Kabushiki Kaisha Toshiba

Akihiko Ohsuga

Yasuyuki Tahara

Tetsuo Hasegawa

Yasuo Nagai

Shinichi Honiden

Yutaka Irie

Takahiro Kawamura

Masanori Hattori

Naoki Kase

Satoshi Ito

Toshibumi Seki

Nobuyuki Sawashima

Keiichi Handa

Naoshi Uchihira

Hideaki Shiotani

Shinichi Nagano

Kouji Ueno

Akira Kagaya

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.

Semantic analysis apparatus, semantic analysis method and semantic analysis program

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.

Service retrieval apparatus and service retrieval method

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.

Information collection apparatus and method

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.

Cooperate processing units using stored cooperation problem solving knowledge and receive information to perform problem solving

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.

Information processing apparatus and method and information processing program recording medium

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.

Agent system and information processing method for same

An apparatus for supporting parallelization according to the invention is characterized by comprising a serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, a debugging unit for debugging the sequential program and forming debugging information, and a concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes a unit for introducing information associated with concurrency to the sequential program.

Programming method for concurrent programs and program supporting apparatus thereof

A planning section 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 section 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 section requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.

Method and apparatus that improves the technique by which a plurality of agents process information distributed over a network through by way of a contract net protocol

Information processing system and method for same

In a data-processing apparatus, in local information storage L and R at each node, local information for the purpose of accessing a constituent element is stored, this information being updated. A plan is generated that represents the action that should be taken by an agent in order to satisfy request code that has been input, this being generated as a set of actions, based on agent information and local information. The operation of the agent is implemented at the nodes L and R, based on the various actions that make up the thus-generated plan, and an agent is migrated to another node, based on a go action within the plan. It is possible to perform replanning and generation of a child agent at a migration destination node, if necessary, because of the failure of plan execution, for example.

Data-processing apparatus, data-processing method, and storage medium

This invention provides a technology for using a plurality of databases each having dissimilar data structure with each other. A user specified, on a portable terminal P, a search condition based on a global ontology G, a list of data items common to the plurality of databases. An agent A is sent from an agent launcher L to a connection node S. In the connection node S, data used as a table or a dictionary containing information on a correspondence between the global ontology G and each of the databases is provided. A search condition based on the global ontology G is translated based on the data to a format compatible with the structure of each database. The agent A, with the translated search condition, moves to a node where each database is located, transfers the search result obtained at each node, and then returns to the connection node S.

Growing community of inventors

Kawasaki, Japan

Akihiko Ohsuga