Kabushiki Kaisha Toshiba

The University of Tokyo

Nippon Oil Fats Co., Ltd.

Thinkcyte K.k.

Nippon Hoso' Kyokai

Gte Internetworking Incorporated

Kabsuhiki Kaisha Toshiba

Toru Imai

Hideki Yoshida

Shigeyasu Natsubori

Toshihiko Shimokawa

Hiroko Fujii

Tetsuro Muranaga

Toshiya Takahashi

Mitsuo Saito

Sadao Ota

Kishio Shibato

Shigeru Oyanagi

Hideo Segawa

Osamu Ohe

Mami Kodama

Fumio Sakurai

Atsuhiro Sakai

Masaaki Akutsu

Koji Yamaguchi

Yoshiaki Takabatake

Toshinari Takahashi

Richard M Schwartz

Yoichi Takebayashi

Masahiro Imai

Takeshi Aikawa

Mika Fukui

Hisako Tanaka

Shozo Isobe

Ichiro Tomoda

Tatsuya Zettsu

Yoshio Masubuchi

Yoshiyuki Makino

Kouichi Sasaki

Toshihiko Manabe

Hiroshi Mizoguchi

Tetsuya Yamane

Kenji Minagawa

Yasuko Nakayama

Shinya Amano

Kazuyuki Gotoh

Nobuichi Nishimura

Satoru Matsumoto

Kazutoshi Tani

Sachio Kizu

Akio Ando

Kenji Sirakawa

Yoshihisa Ohtake

Hiroku Fujii

Keisuke Toda

This flow cytometer includes a flow path through which an observation object flows with a fluid; an optical illumination system including a spatial optical modulation device, and a first optical element; and an optical detection system including a first light detector, wherein the optical illumination system further includes a first spatial filter disposed in a first optical path between a light source and an image position of light imaged in the flow path by the first optical element and having a first region which hinders traveling of light emitted from the light source towards the observation object, the optical detection system further includes a second light detector disposed in a second optical path between the first light detector and the image position and having a second region which directs the light modulated by the observation object towards the first light detector, and the position of the first region and the position of the second region are in a substantially optically conjugate relationship.

Flow cytometer

An observation device includes an illumination optical system and an observation optical system. The illumination optical system includes a light source and an aperture member. The observation optical system includes an objective lens, an optical structure, and a detector. The optical structure is disposed at a first position which is the position conjugate with the aperture member. The optical structure includes a blocking portion that blocks light and a transmitting portion that transmits light, the blocking portion having a shape including the shape of an image of an aperture of the aperture member which is formed on the optical structure. The detector detects dark-field light passing through the optical structure.

Observation device

By using program information, the amount of which to be transmitted is not fixed, and related information which is related to the expected amount of the main information, an area for recording main information is ensured in advance on a recording medium. This ensures a reliable recording of a program, the recording of which has already been reserved, without affecting any program which has already been recorded. In addition, even when a change occurs in related information before or after the start of recording information on the recording medium, an area assigned before the start of the recording can be changed corresponding to related information after the change.

Apparatus for recording data, method for recording data and television program receiver

At member registration step, a master transmits a certificate and a priority to a slave. The certificate indicates that the slave receiving it belongs to the same data synchronization group as the master. The priority is used to solve a data conflict. At data synchronization, after it is determined that members belong to the same data synchronization group by the certificate, data synchronization processing is performed between arbitrary members in which an input device and a display device such as a wrist watch are limited. Data synchronization does not require a specific server.

Communication method for data synchronization processing and electronic device therefor

A reservation processing apparatus. A data receiving section receives broadcast data including mainview data and preview data. The preview data represents information of next mainview data. A preview data record section records the preview data received by the data receiving section. A reservation list management section extracts the information of next mainview data from the preview data and stores the information as a reservation list. A reservation item execution section records the next mainview data according to the reservation list when the data receiving section receives the next mainview data transmitted.

Reservation processing apparatus and method

An integrated network management and apparatus for managing devices connected to a network which have the same function. Control modules prepare local management tables by reading information regarding recordings made on respective recording media of the devices, and an integrated control module communicates with the control modules to prepare an integrated management table by reading the local management tables. The integrated management table enables the integrated control module to recognize a correlation between a recorded program and the control module, recording medium and recording position. The integrated control module also controls the control modules in the respective devices in an integrated manner using the integrated management table.

Apparatus and method for network integrated management

A second pass processor detects a stable portion in a 1-best word string obtained by a second pass processing, and determines the word string in the detected stable portion as a speech recognition result.

Continuous speech recognizing apparatus and a recording medium thereof

A compiling method, for compiling a source program into an object program for a CPU having multiple functional units that allow for concurrent operations and supporting predicated execution, for generating the object program that can be executed on the CPU at high speed by analyzing the source program and generating intermediate codes, making an analysis of the intermediate codes, generating, based on the analysis, an execution mode set instruction to set an execution mode managed within the CPU, allocating, based on the analysis, instructions such that whether they are to be executed or not to be executed depends on the execution mode set by the execution mode set instruction from the intermediate codes, wherein one or more instructions in which values in their respective specific fields are identical make an block together for every value in the specific field, finding, for each block, an ending part of the block in which its last instruction is allocated, and generating, when the ending part of a certain block is to be earlier in the object program than the ending part of another block, an unconditional branch instruction identical in specific field value to the instructions in the certain block, and allocating it either to be executed in the ending part of the certain block or to be executed as immediately as possible after the ending part of the block.

Compiling method and memory storing the program code

An information sharing system using a computer so as to allow a plurality of users to share disclosed information, the system comprising, input section for receiving responses to the disclosed information from references of the disclosed information, evaluation information generation section for totalizing and processing the responses to generate evaluation information and storing the evaluation information after correlating it with the disclosed information, and evaluation information notifying section for presenting the evaluation information generated by the evaluation information generation section.

Information sharing system and computer program product for causing computer to support the information sharing system

A method for improving the associating articles of information or stories with topics associated with specific subjects (subject topics) and with a general topic of words that are not associated with any subject. The inventive method is trained using Hidden Markov Models (HMM) to represent each story with each state in the HMM representing each topic. A standard Expectation and Maximization algorithm, as are known in this art field can be used to maximize the expected likelihood to the method relating the words associated with each topic to that topic. In the method, the probability that each word in a story is related to a subject topic is determined and evaluated, and the subject topics with the lowest probability are discarded. The remaining subject topics are evaluated and a sub-set of subject topics with the highest probabilities over all the words in a story are considered to be the &ldquo;correct&rdquo; subject topic set. The method utilizes only the positive information and words related to other topics are not taken as negative evidence for a topic being evaluated. The technique has particular application to text that is derived from speech via a speech recognizer or any other techniques that results in a text file. The use of a general topic category enhances the results since most words in any story are not keywords that are associated with any given subject topic. The removal of the general words reduces the numbers of words being considered as keywords related to any given subject topic. The reduced number of words being processed allows the method to enhance the discrimination between the fewer words as related to the subject topics. The topics can range from general, for example &ldquo;the U.S. economy&rdquo;, to very specific, for example, &ldquo;the relationship of the yen to the dollar in the U.S. economy.&rdquo;

Topic indexing method

A scheme for transferring files from a file server to a file requesting client, which enables request and transfer of files which are related to a user requested file at a time of transferring a user requested file. The file requesting client makes a file request indicating a desired file, and in response the file server transfers a file list of files related to the desired file indicated by the file request. Then, the file requesting client makes a transfer request requesting a transfer of files according to the file list, and in response the file server transfers the files requested by the transfer request. Alternatively, the file requesting client makes a request indicating a desired file, and in response the file server transfers a concatenated file formed by concatenating files related to the desired file indicated by the request. Then, the file requesting client extracts individual files from the concatenated file.

System for transferring desired file by transferring concatenated file

A computer-based electronic payment system, in which a payer's check issuing computer issues an electronic check having a check identifier and an issue time, where the check identifier includes a payer identifier for uniquely identifying a payer and a payment identifier for uniquely identifying a payment. Then, at a payee's check processing computer receiving the electronic check from the payer and at a bank's check processing computer receiving the electronic check transmitted from the payee, a check identifier of each electronic check accepted during a prescribed period of time prior to a current time is recorded, and a received electronic check is refused when the issue time of the received electronic check is older than the prescribed period of time past of the current time or the check identifier of the received electronic check is identical to any recorded check identifier of an already accepted electronic check, or a received electronic check is accepted when the acceptance is not refused.

Electronic payment system using check identifier and issue time for

A decryption key management scheme for a software distribution system utilizing the decryption key, which can enable the re-install of the software that was decrypted once by a proper procedure, without requiring a re-acquisition of the decryption key from the software vender, so that a user can freely delete and re-install the software that was properly obtained once. The decryption key is searched in a memory device of a user's computer, or acquired from a distribution source of the encrypted software when the decryption key is not found in the memory means. Then, the encrypted software is decrypted by using the obtained decryption key, and a decrypted software content is installed into the memory device, while the decryption key acquired from the distribution source is stored into the memory device, such that the decryption key stored in the memory device is utilizable in decrypting the encrypted software at a time of re-installing the encrypted software.

Decryption key management scheme for software distribution system

A document requesting and providing system capable of realizing the linking to the specified document from another document efficiently and safely. A linking request computer issues a linking request for attaching a link from a first document to a second document, and a client computer issues a document request for the first document. Then, a server computer stores the first document, records a link information indicated by the linking request in correspondence to the first document upon receiving the linking request from the linking request computer, and provides the first document in conjunction with the link information to the client computer upon receiving the document request from the client computer.

Document requesting and providing system using safe and simple document

A data processing scheme capable of realizing both the reduction of an amount of data due to the compression and the shortening of a time required to refer to data, as well as the lowering of the power consumption in a portable information device. A compression start position is detected, and data subsequent to the compression start position are compressed, and then a data sequence is generated from data prior to the compression start position and subsequent compressed data. In a case of reading a data sequence containing non-compressed data and subsequent compressed data, a boundary position between the non-compressed data and the compressed data is detected, and only the compressed data subsequent to the boundary position is expanded. In a case of reading data sequence containing compressed data in at least two segments which are separately compressed, only the compressed data in a top segment are expanded, and a data sequence is generated from expanded top segment data and compressed data in subsequent segments.

Method and apparatus for processing compressed data and non-compressed

Growing community of inventors

Tokyo, Japan

Toru Imai