Patents by Inventor Akihiko Ohsuga
Akihiko Ohsuga has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7953592Abstract: A semantic analysis apparatus includes a data obtaining unit that obtains data in which an item name and an item value belonging to the item name are represented in a predetermined data format; an item value extracting unit that extracts the item value from the data based on the data format; a concept storing unit that stores a concept which is a semantic notion to be attached to the item name and an instance which is specific data of the concept in association with each other; a concept specifying unit that specifies the concept, which is stored in the concept storing unit and which is associated with the instance which at least partially matches with a character string of the extracted item value, as the concept for the item name; and an associating unit that associates the concept with the item name.Type: GrantFiled: February 27, 2006Date of Patent: May 31, 2011Assignee: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Kouji Ueno, Shinichi Nagano, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20090132654Abstract: A service retrieval apparatus stores service data items, each including two words as input and output items and expression as condition, receives request data item including word as input item and expression as condition, acquires first word set which is set of words having meanings identical/similar to meaning of word as input item in request data item, retrieves group of service data items in each of which one word of first word set is included as input item, calculates condition similarity between meaning of expression in each one of group and meaning of expression in request data item, calculates priority of each one of group based on similarity between word as input item in each one of group and word as input item in request data item and condition similarity, and transmits list including priority and address of appliance which correspond to each one of group to first appliance.Type: ApplicationFiled: January 15, 2009Publication date: May 21, 2009Applicant: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Tetsuo Hasegawa, Akihiko Ohsuga
-
Patent number: 7493364Abstract: A service retrieval apparatus stores service data items, each including two words as input and output items and expression as condition, receives request data item including word as input item and expression as condition, acquires first word set which is set of words having meanings identical/similar to meaning of word as input item in request data item, retrieves group of service data items in each of which one word of first word set is included as input item, calculates condition similarity between meaning of expression in each one of group and meaning of expression in request data item, calculates priority of each one of group based on similarity between word as input item in each one of group and word as input item in request data item and condition similarity, and transmits list including priority and address of appliance which correspond to each one of group to first appliance.Type: GrantFiled: March 22, 2004Date of Patent: February 17, 2009Assignee: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20070073680Abstract: A semantic analysis apparatus includes a data obtaining unit that obtains data in which an item name and an item value belonging to the item name are represented in a predetermined data format; an item value extracting unit that extracts the item value from the data based on the data format; a concept storing unit that stores a concept which is a semantic notion to be attached to the item name and an instance which is specific data of the concept in association with each other; a concept specifying unit that specifies the concept, which is stored in the concept storing unit and which is associated with the instance which at least partially matches with a character string of the extracted item value, as the concept for the item name; and an associating unit that associates the concept with the item name.Type: ApplicationFiled: February 27, 2006Publication date: March 29, 2007Inventors: Takahiro Kawamura, Kouji Ueno, Shinichi Nagano, Tetsuo Hasegawa, Akihiko Ohsuga
-
Patent number: 7159019Abstract: An apparatus collects information stored in a host computer through a network. A correspondence acquirement unit acquires a correspondence between an information identifier of requested information and host identifiers of a plurality of host computers each of which stores the requested information. A first decision unit decides at least one host computer to retrieve the requested information by referring to the correspondence. A second decision unit decides a retrieval method used for each host computer decided by the first decision unit from a plurality of retrieval methods. A retrieval unit indicates retrieval of the requested information based on the retrieval method decided by the second decision unit and each host computer decided by the first decision unit.Type: GrantFiled: December 12, 2001Date of Patent: January 2, 2007Assignee: Kabushiki Kaisha ToshibaInventors: Shinichi Nagano, Yasuyuki Tahara, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20060217839Abstract: An object management apparatus for managing an object which executes a process includes an execution conditions holding unit that holds the process and corresponding execution condition indicating a first status of the object as a prerequisite for executing the process; an execution instruction acquisition unit that acquires an execution instruction indicating the process; a status information acquisition unit that acquires status information indicating a second status of the object from the object; and a status determining unit that determines whether the process indicated in the execution instruction can be executed by the object, based on the first status indicated in the execution condition corresponding to the process indicated in the execution instruction and the second status indicated the status information.Type: ApplicationFiled: December 22, 2005Publication date: September 28, 2006Inventors: Takahiro Kawamura, Kouji Ueno, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20060123426Abstract: A mobile agent mediates cooperation among schedulers by executing a cooperation protocol. For heuristics such as strategies and the order in which variables are decided, which are used as criteria of selecting the value of a variable from candidates, when the heuristics are to be built into a solving method of a constraint satisfaction problem, processes with regard to these heuristics are so substantially localized as to be capable of parallel execution. These processes capable of parallel execution, as autonomous operations of different mobile agents, can be under modeling in natural form, resulting in easy installation. This facilitates software construction for reflecting the heuristics in a solving method of a constraint satisfaction problem, as well as improves the maintainability and extendibility of software.Type: ApplicationFiled: January 26, 2006Publication date: June 8, 2006Applicant: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Yasuyuki Tahara, Naoki Kase, Tetsuo Hasegawa, Akihiko Ohsuga
-
Patent number: 7016934Abstract: A mobile agent mediates cooperation among schedulers by executing a cooperation protocol. For heuristics such as strategies and the order in which variables are decided, which are used as criteria of selecting the value of a variable from candidates, when the heuristics are to be built into a solving method of a constraint satisfaction problem, processes with regard to these heuristics are so substantially localized as to be capable of parallel execution. These processes capable of parallel execution, as autonomous operations of different mobile agents, can be under modeling in natural form, resulting in easy installation. This facilitates software construction for reflecting the heuristics in a solving method of a constraint satisfaction problem, as well as improves the maintainability and extendibility of software.Type: GrantFiled: January 13, 2003Date of Patent: March 21, 2006Assignee: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Yasuyuki Tahara, Naoki Kase, Tetsuo Hasegawa, Akihiko Ohsuga
-
Patent number: 6925486Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: GrantFiled: March 21, 2003Date of Patent: August 2, 2005Assignee: Kabushiki Kaisha ToshibaInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Patent number: 6915326Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: GrantFiled: March 21, 2003Date of Patent: July 5, 2005Assignee: Kabushiki Kaisha ToshibaInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20050144000Abstract: A context recognition unit decides a user's context by comparing context recognition rules to the user's information, and outputs context recognition data based on the user's context. A processing selection unit decides a contents type by comparing processing selection rules to the context recognition data, and outputs contents creation request data based on the contents type. A contents delivery unit obtains contents based on the contents creation request data, and delivers the contents to the user's terminal. A question creation unit creates a question about the contents delivery for the user. Each context recognition rule and each processing selection rule includes a priority degree. The question creation unit specifies the context recognition rule or the processing selection rule based on the user's answer to the question, and changes the priority degree of the specified rule.Type: ApplicationFiled: December 22, 2004Publication date: June 30, 2005Inventors: Tomohiro Yamasaki, Akihiko Ohsuga, Masanori Hattori, Kenta Cho, Hisashi Hayashi, Kouji Ueno, Kentaro Kamahora
-
Publication number: 20050050026Abstract: A service retrieval apparatus stores service data items, each including two words as input and output items and expression as condition, receives request data item including word as input item and expression as condition, acquires first word set which is set of words having meanings identical/similar to meaning of word as input item in request data item, retrieves group of service data items in each of which one word of first word set is included as input item, calculates condition similarity between meaning of expression in each one of group and meaning of expression in request data item, calculates priority of each one of group based on similarity between word as input item in each one of group and word as input item in request data item and condition similarity, and transmits list including priority and address of appliance which correspond to each one of group to first appliance.Type: ApplicationFiled: March 22, 2004Publication date: March 3, 2005Inventors: Takahiro Kawamura, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20040059723Abstract: The result of the search from a temporary search section is given to a search condition item extracting section. The search condition item extracting section extracts registered information items for the retrieved Web service from a registry. The search condition item extracting section classifies the retrieved domains and checks the frequency of keywords, input and output items, and input and output restrictions. A condition item inquiry section transmits to the agent requesting the search the extracted information items in the form of a list of search condition items on the basis of such pieces of information as classification and frequency. As a result, the agent can make a re-search by specifying effective search keys and search values.Type: ApplicationFiled: June 26, 2003Publication date: March 25, 2004Inventors: Tetsuo Hasegawa, Shinichi Nagano, Akihiko Ohsuga
-
Publication number: 20040044737Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand,. a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: March 4, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20040030674Abstract: A Web service coordination plan creating method according to this invention includes a first step of matching the predicate of the precondition with the predicate of the user data and matching the predicate of the post condition with the predicate of the user's request in respect to one application program. The method further includes a second step of matching the predicate of the precondition with a first predicate including the predicate of the user data unmatched in the first step and matching the predicate of the post condition with a second predicate including the predicate of the user's request unmatched in the first step in respect to other application programs excluding the one application program.Type: ApplicationFiled: July 28, 2003Publication date: February 12, 2004Inventors: Shinichi Nagano, Yasuyuki Tahara, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20040019627Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: January 29, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20040003047Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: January 1, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Patent number: 6662207Abstract: A system smoothly performing information processing is realized by dynamically making a decision, when it becomes necessary for an agent currently located at a platform to make use of another platform, with regard to whether to cause the agent to move to the other platform or cause the agent to cooperate with another agent that exists at the other platform. The dynamic decision is made in response to situations, resulting in enabling the unified utilization of mobile and stationary agents. The decision of using either movement or cooperation is typically made based on platform information and agent information. Even if planning changes the plan of an agent and regardless of what agent is using which platform's resources, it is possible to easily establish whether movement or cooperation is to be used, based on the platform profile and agent attributes. Such a system can perform information processing in response to changing situations.Type: GrantFiled: September 9, 2002Date of Patent: December 9, 2003Assignee: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Yasuyuki Tahara, Yutaka Irie, Naoki Kase, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20030217352Abstract: Systems and methods for using a main script program include a function that prompts a user to enter an input script program while a main script program executes. An ACL (Access Control List) defines commands used by the input script program. When a user executes the main script program, a prompt function prompts the user to enter the input script program. Program execution continues and the user's computer determines whether the input script program is executable based upon the ACL contained in the main script program. Accordingly, the input script program may only execute a specified range of authorized commands.Type: ApplicationFiled: March 21, 2003Publication date: November 20, 2003Inventors: Kouji Ueno, Kentaro Kamahora, Tetsuo Hasegawa, Akihiko Ohsuga
-
Publication number: 20030144975Abstract: A mobile agent mediates cooperation among schedulers by executing a cooperation protocol. For heuristics such as strategies and the order in which variables are decided, which are used as criteria of selecting the value of a variable from candidates, when the heuristics are to be built into a solving method of a constraint satisfaction problem, processes with regard to these heuristics are so substantially localized as to be capable of parallel execution. These processes capable of parallel execution, as autonomous operations of different mobile agents, can be under modeling in natural form, resulting in easy installation. This facilitates software construction for reflecting the heuristics in a solving method of a constraint satisfaction problem, as well as improves the maintainability and extendibility of software.Type: ApplicationFiled: January 13, 2003Publication date: July 31, 2003Applicant: Kabushiki Kaisha ToshibaInventors: Takahiro Kawamura, Yasuyuki Tahara, Naoki Kase, Tetsuo Hasegawa, Akihiko Ohsuga