Abstract: An information providing system includes: first servers in which each first server including a first processor with hardware is provided for each of a plurality of bases. The first processor is configured to calculate a traffic frequency of a vehicle on a road link included in a road map based on past travel data of the vehicle, partition the road map into a plurality of areas so that a total of the traffic frequency in a road link straddling each partitioned area becomes minimum, allocate each base to each of the partitioned areas, and output predetermined information to the vehicle traveling in the partitioned area to which the base is allocated.

Abstract: A method of establishing a user profile on a server computer, the user profile being associated with a unique user identifier used during a transaction made by a user, the method comprising: receiving user-related data comprising identification data associated with the unique user identifier; sending a server authentication message to the user in dependence on the user related data; receiving a registration message from the user, the message comprising the authentication message; establishing the user profile in response to receiving the registration message

Abstract: A method, device and computer program for efficiently identifying items having a high frequency of occurrence among items included in a large-volume text data stream. Identification information for identifying an item and a count of items are stored in a higher level of memory and only identification information is stored in a lower level. Text data stream input is received, the increment of the count of an item is increased in response to storage in the higher level memory of identification information for an item included in a bucket divided from the received text data stream input, identification information for the item is transferred with the initial count to the higher level of memory in response to storage in the lower level and the identification information for the item is newly stored with the initial count in the higher level in response to not being stored on any level.

Abstract: Embodiments relate to a computer implemented information processing system, method and program product for data access. The information processing system includes a data store having a top tier store and at least another tier store with the top tier store including a counter for each entry of a symbol and another tier store including a representative frequency value defined for the another tier store. A sorter is also provided configured to sort the symbol in the top tier store and the another tier stores according to a value generated in the counter for the assessed symbol. The said sorter is also configured to restore entry of the symbol in the top tier store, in response to a symbol having moved from said top tier store to another tier store, by using the representative frequency value defined for said another store to which said symbol was moved.

Abstract: A method, device and computer program for efficiently identifying items having a high frequency of occurrence among items included in a large-volume text data stream. Identification information for identifying an item and a count of items are stored in a higher level of memory and only identification information is stored in a lower level. Text data stream input is received, the increment of the count of an item is increased in response to storage in the higher level memory of identification information for an item included in a bucket divided from the received text data stream input, identification information for the item is transferred with the initial count to the higher level of memory in response to storage in the lower level and the identification information for the item is newly stored with the initial count in the higher level in response to not being stored on any level.

Abstract: An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.

Abstract: An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node sKn of the second substructure K to a child node sPn+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.

Abstract: An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.

Abstract: Systems, methods and computer products for generating calculation context classes from a relationship between structured data and a calculation procedure, the context classes having parent-child relationships. Exemplary embodiments include a method including searching the calculation procedure for a first data definition, generating a first context from a first scope applied to the first data definition, tracing back the calculation procedure to obtain a second data definition for calculating the first data definition and to which the first scope is applied, copying the calculation procedure into the first context until the second data definition is obtained, obtaining a second scope applied to the second data definition, obtaining a second context generated from the second scope, determining an existence of an order comparison of the first scope with the second scope and obtaining order from the structured data.

Abstract: Disclosed is a system and method for model-driven datastore. The model-driven datastore includes an object persistence model editor for developing specific object persistence models based on an object persistence metamodel. The object persistence model consists of object model, object access pattern and user defined functions. The object model consists of a collection of object definition, said object definition supports at least one basic type or structure type of attributes. The object access pattern defines the access path that are used to retrieve the object instances, where the access path is consists of a collection of actions. The actions comprise at least one of the following a self action, parent action, or children action. User defined functions are declaratively defined and supports group operators.

Abstract: This invention provides methods, systems and apparatus for processing a message of a large number of agents. An example of an apparatus includes: a memory; means for managing a state of an agent based on whether the agent is in the memory and whether there is a message, by determining a priority level of the agent based on a message inserted into the agent; means for assigning a thread to the agent if the agent is in the memory and for assigning a thread to the agent after calling the agent to the memory if the agent is not in the memory, on condition that the agent having a highest priority level has been detected; and message processing means for repeating message processing until a predetermined criterion is satisfied, in relation to the agent to which a thread has been assigned.

Abstract: An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node sKn of the second substructure K to a child node sPn+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.

Abstract: Disclosed is a system and method for model-driven datastore. The model-driven datastore includes an object persistence model editor for developing specifc object persistence models based on an object persistence metamodel. The object persistence model consists of object model, object access pattern and user defined functions. The object model consists of a collection of object definition, said object defintion supports at least one basic type or structure type of attributes. The object access pattern defines the access path that are used to retrieve the object instances, where the access path is consists of a collection of actions. The actions comprise at least one of the following a self action, parent action, or children action. User defined functions are declaratively defined and supports group operators.

Abstract: A method and system for maintaining consistency between a view of a virtual table and the database. The method includes: First, selecting a discard candidate instance from a discard candidate list table in accordance with an LRU algorithm if it is judged that there is less free space for adding an instance. Then, judging whether a revision wait flag is on for the discard candidate instance. If it is judged that the revision wait flag is on, deleting the discard candidate instance from the discard candidate list table. If it is judged that the revision wait flag is not on, deleting the discard candidate instance from the instance pool and adding the instance to the instance pool. Lastly, adding the requested instance to the instance pool if it is judged that there is enough storage area.

Abstract: Methods, apparatus and systems to keep a desired element properly addressed in a structured document in which particular elements are addressed, even if the structured document is modified. In an example embodiment, the invention comprises a difference computation unit for computing a difference between structured documents, and an XPath update unit for generating addressing information from addressing information that addresses a part of a particular structured document based on information on the difference computed by the difference computation unit, the generated addressing information addressing a corresponding part of the other structured document.

Abstract: Systems, methods and computer products for generating calculation context classes from a relationship between structured data and a calculation procedure, the context classes having parent-child relationships. Exemplary embodiments include a method including searching the calculation procedure for a first data definition, generating a first context from a first scope applied to the first data definition, tracing back the calculation procedure to obtain a second data definition for calculating the first data definition and to which the first scope is applied, copying the calculation procedure into the first context until the second data definition is obtained, obtaining a second scope applied to the second data definition, obtaining a second context generated from the second scope, determining an existence of an order comparison of the first scope with the second scope and obtaining order from the structured data.

Abstract: This invention provides methods, systems and apparatus for processing a message of a large number of agents. An example of an apparatus includes: a memory; means for managing a state of an agent based on whether the agent is in the memory and whether there is a message, by determining a priority level of the agent based on a message inserted into the agent; means for assigning a thread to the agent if the agent is in the memory and for assigning a thread to the agent after calling the agent to the memory if the agent is not in the memory, on condition that the agent having a highest priority level has been detected; and message processing means for repeating message processing until a predetermined criterion is satisfied, in relation to the agent to which a thread has been assigned.

Abstract: This invention provides methods, systems and apparatus for processing a message of a large number of agents. An example of an apparatus includes: a memory; means for managing a state of an agent based on whether the agent is in the memory and whether there is a message, by determining a priority level of the agent based on a message inserted into the agent; means for assigning a thread to the agent if the agent is in the memory and for assigning a thread to the agent after calling the agent to the memory if the agent is not in the memory, on condition that the agent having a highest priority level has been detected; and message processing means for repeating message processing until a predetermined criterion is satisfied, in relation to the agent to which a thread has been assigned.

Abstract: A structure pattern candidate generating system is disclosed for automatically generating many kinds of complicated structure pattern candidates and facilitating selection of a structure pattern suitable for the purpose. When the system is provided with a structure pattern pointing to an element or an element set in a document logical structure of a structured document, that has been specified by a user, a method for determining an item to be edited determines an item to be edited among the items composing the structure pattern. A method for generating structure pattern candidates replaces the item to be edited with items in different expressions based on the document logical structure information about the structured document to generate structure pattern candidates. A method for generating a structure pattern candidate list arranges the generated structure pattern candidates based on a condition and index for display for giving selection criteria to the user to generate a structure pattern candidate list.

Abstract: To achieve classification of semistructured data with a Kernel method for labeled ordered trees, instances having a labeled ordered tree structure are input and their inner product is computed, the result of which is used for classification learning of the instances. In the inner product computation, a sum of matches is computed for descendant nodes of non-leaf nodes of the labeled ordered trees by applying dynamic programming based on correspondence in which order of the nodes is maintained.