Patent application number | Description | Published |
20080215325 | TECHNIQUE FOR ACCURATELY DETECTING SYSTEM FAILURE - An apparatus, method and program for dividing a conversational dialog into utterance. The apparatus includes a computer processor; a word database for storing spellings and pronunciations of words; a grammar database for storing syntactic rules on words; a pause detecting section which detects a pause location in a channel making a main speech among conversational dialogs inputted in at least two channels; an acknowledgement detecting section which detects an acknowledgement location in a channel not making the main speech; a boundary-candidate extracting section which extracts boundary candidates in the main speech, by extracting pauses existing within a predetermined range before and after a base point that is the acknowledgement location; and a recognizing unit which outputs a word string of the main speech segmented by one of the extracted boundary candidates after dividing the segmented speech into optimal utterance in reference to the word database and grammar database. | 09-04-2008 |
20090183141 | Application program development assisting method, program, and information processing apparatus - A method, program, and information processing apparatus for detecting an inconsistency in an application program before the application program is implemented. The described is detecting a consistency or inconsistency in the design of screen transition of an application program, by generating a control flow graph for the application program, calculating from the control flow graph the solution of dataflow problem which occurs in the application program, detecting an inconsistency in the application program on the basis of the calculated solution, and displaying information concerning a detected inconsistency. | 07-16-2009 |
20100146382 | Differencing and Merging Tree-Structured Documents - Differencing and merging tree-structured documents, such as eXtensible Markup Language (XML) documents, is disclosed. A differencing-and-merging system for tree-structured documents of one embodiment of the invention includes a difference processing unit and a merging processing unit. The differencing processing unit performs a difference operation on at least two tree-structured documents, in accordance with difference configuration information regarding the documents. The merging processing unit performs a merging operation on the tree-structured documents from correspondence information generated by the difference processing unit, based on the difference operation configuration information regarding the documents. The correspondence information indicates differences among nodes of the documents. The difference operation configuration information specifies one or more nodes among the documents that are to be considered equivalent when the difference operation is performed, and one or more nodes among the documents that are to be ignored when the difference operation is performed. | 06-10-2010 |
20120023366 | TECHNIQUE FOR ACCURATELY DETECTING SYSTEM FAILURE - An apparatus, method and program for dividing a conversational dialog into utterance. The apparatus includes a computer processor; a word database for storing spellings and pronunciations of words; a grammar database for storing syntactic rules on words; a pause detecting section which detects a pause location in a channel making a main speech among conversational dialogs inputted in at least two channels; an acknowledgement detecting section which detects an acknowledgement location in a channel not making the main speech; a boundary-candidate extracting section which extracts boundary candidates in the main speech, by extracting pauses existing within a predetermined range before and after a base point that is the acknowledgement location; and a recognizing unit which outputs a word string of the main speech segmented by one of the extracted boundary candidates after dividing the segmented speech into optimal utterance in reference to the word database and grammar database. | 01-26-2012 |
20130097219 | APPARATUS AND METHOD FOR EXECUTING AGENT - Methods for selecting an initial agent for an agent transaction context (ATC) are presented, the ATC configured to process a transaction utilizing a number of active agents in a multiagent system using a computing device including: causing the computing device to determine whether an agent having a top priority message is present, where the agent is one of the number of active agents in the multiagent system: if the agent having the top priority message is present, causing the computing device to determine whether the agent having the top priority message is processing; and if the agent having the top priority message is not processing, causing the computing, device to select the agent having the top priority message as the initial agent for the ATC. | 04-18-2013 |
Patent application number | Description | Published |
20090157757 | FAILURE TOLERANT TRANSACTION PROCESSING SYSTEM - The present invention proposes a system for resending a process to a backup server farm from a client without waiting for the failure-detection, if no reply is received for a certain time. The transaction processing mechanism of the present invention has a transaction start processing mechanism in which an exclusive control using a valid processing authority token and data consistency are combined, and a commit processing mechanism in which determination on whether a commit is available or not based on a distributed agreement and replication of updated data. With the mechanisms, a system for shortening a service halt time when a failure occurs to a time as such it appears to a client that the service does not stop is provided. | 06-18-2009 |
20100115061 | SERVER SYSTEM, SERVER APPARATUS, PROGRAM AND METHOD - Provided is a server system that transmits a content back in response to receipt of a request message for the content, the server system including: a request receiver for receiving the request message for the content; a delay notification unit for replying to a request source with a delay message indicating that a transmission of the content is to delay; a restoration unit for restoring the content specified by the request message; and a content transmitter for transmitting the restored content back to the request source. | 05-06-2010 |
20120011097 | METHOD, COMPUTER PROGRAM, AND SYSTEM-MODEL CONVERTER FOR CONVERTING SYSTEM MODEL - [Object] To provide a system model conversion method, a computer program, and a system model converter which facilitate analysis and editing of the system model by using information indicating a hierarchical relationship. | 01-12-2012 |
20120191681 | FAILURE TOLERANT TRANSACTION PROCESSING SYSTEM - The present invention proposes a system for resending a process to a backup server farm from a client without waiting for the failure-detection, if no reply is received for a certain time. The transaction processing mechanism of the present invention has a transaction start processing mechanism in which an exclusive control using a valid processing authority token and data consistency are combined, and a commit processing mechanism in which determination on whether a commit is available or not based on a distributed agreement and replication of updated data. With the mechanisms, a system for shortening a service halt time when a failure occurs to a time as such it appears to a client that the service does not stop is provided. | 07-26-2012 |
Patent application number | Description | Published |
20090292593 | Server, Information Communication Terminal, Product Sale Management Method, and Storage Medium and Program Transmission Apparatus Therefor - A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module | 11-26-2009 |
20090292620 | Server, Information Communication Terminal, Product Sale Management Method, and Storage Medium and Program Transmission Apparatus Therefor - A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module | 11-26-2009 |
20090292621 | Server, Information Communication Terminal, Product Sale Management Method, and Storage Medium and Program Transmission Apparatus Therefor - A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module | 11-26-2009 |
20090292623 | Server, Information Communication Terminal, Product Sale Management Method, and Storage Medium and Program Transmission Apparatus Therefor - A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module | 11-26-2009 |
20090299873 | Server, Information Communication Terminal, Product Sale Management Method, and Storage Medium and Program Transmission Apparatus Therefor - A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module | 12-03-2009 |
Patent application number | Description | Published |
20120293541 | MANIPULATION OF AN OBJECT AS AN IMAGE OF A MAPPING OF GRAPH DATA - Techniques are disclosed for effectively reflecting a manipulation of an object in graph data. In one example, a method enables a manipulation performed on an object as an image of a mapping of at least a part of graph data including nodes and edges to be reflected in the graph data. The method includes the step of specifying, from among nodes in the graph data that are related to the object being modified by the manipulation, a shared node that may be related to another object as well, and the step of reflecting the manipulation in the graph data while preventing the shared node from being modified. | 11-22-2012 |
20120293542 | Manipulation of an Object as an Image of a Mapping of Graph Data - Techniques are disclosed for effectively reflecting a manipulation of an object in graph data. In one example, a method enables a manipulation performed on an object as an image of a mapping of at least a part of graph data including nodes and edges to be reflected in the graph data. The method includes the step of specifying, from among nodes in the graph data that are related to the object being modified by the manipulation, a shared node that may be related to another object as well, and the step of reflecting the manipulation in the graph data while preventing the shared node from being modified. | 11-22-2012 |
20120296923 | METHOD, PROGRAM, AND SYSTEM FOR CONVERTING PART OF GRAPH DATA TO DATA STRUCTURE AS AN IMAGE OF HOMOMORPHISM - To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints. | 11-22-2012 |
20120296924 | METHOD, PROGRAM, AND SYSTEM FOR CONVERTING PART OF GRAPH DATA TO DATA STRUCTURE AS AN IMAGE OF HOMOMORPHISM - To provide a method, program, and system for converting graph data to a data structure that enables manipulations in various applications to be reflected in the original graph data. The method uses at least one graph matching pattern to convert at least a part of graph data including nodes and edges to a data structure as an image of a homomorphism thereof. A pattern is provided which includes one representative node variable having a first constraint that at most one node in the graph data matches the representative node variable; the node is prohibited from matching a node variable in another pattern. The method includes the step of performing matching between the graph data and the pattern to obtain a matching result that does not violate constraints including the first constraint, and the step of generating a data structure corresponding to the matching result that does not violate the constraints. | 11-22-2012 |
20130268566 | GENERATING RDF EXPRESSION TECHNICAL FIELD - A set of ID for data of an existing tool is created as a parameter. A bulk access template that acquires a plurality of data is prepared. Access is provided to an existing tool path through the bulk access template. The bulk access template is prepared for each type of data that is acquired. The template is instantiated based on the URI that is requested. Entries that correspond to the operating table are filled in by executing the bulk access template that was created. When an RDF expression is requested for the URI of the template that is the same as one previously accessed, the entries would already be in the operating table, so that the RDF expression can be generated without accessing the existing tool. | 10-10-2013 |