Abstract: A method of recommending Mashups, including identifying, using a processor, pre-existing Mashups implementing application program interfaces (APIs), where each implemented API has one or more attached Tag(s) including API characteristics; extracting the characteristics from the Tags attached to the API(s) implemented in the Mashup, form a set including all of the characteristics from the APIs implemented in Mashup; identifying one or more API(s) not implemented in the Mashups; extracting the characteristics from the Tags attached to the API(s) not implemented in the Mashup to form another set; identifying API characteristics that are an element of one set, but not an element of the other set, forming a third set of these characteristics; modeling a relationship between API(s) using the sets; calculating the probability of one or more API(s) not implemented in a Mashup being used for new Mashup; and presenting the API(s) to a user for new Mashups.

Abstract: A computer-implemented method, system, and computer program product for generating a synonym list from an existing thesaurus includes preparing a first feature vector from a natural language query and preparing a second feature vector from a result of the natural language query, determining, using a processor, whether a combination of a first feature from the first feature vector and a second feature from the second feature vector is included as a synonym pair in the existing thesaurus, and generating the synonym list by adding the combination to the synonym list when the determination is positive. The result of the natural language query may be identified by a user browsing action or by a positive feedback from a user. The method further includes reading a log which includes a single set or plural sets of the natural language query and the result of the natural language query.

Abstract: A computer-implemented method, system, and computer program product for generating a synonym list from an existing thesaurus includes preparing a first feature vector from a natural language query and preparing a second feature vector from a result of the natural language query, determining, using a processor, whether a combination of a first feature from the first feature vector and a second feature from the second feature vector is included as a synonym pair in the existing thesaurus, and generating the synonym list by adding the combination to the synonym list when the determination is positive. The result of the natural language query may be identified by a user browsing action or by a positive feedback from a user. The method further includes reading a log which includes a single set or plural sets of the natural language query and the result of the natural language query.

Abstract: An extraction method for extracting a sub query to be converted to a program for processing stream data continuously inputted to a database, from a query including instructions, as sub queries, to be issued to a database management system. The extraction method includes receiving input of the query and a lower limit value of efficiency as processing time per unit memory increase amount. A calculating operation calculates a one memory increase amount and the efficiency using the memory increase amount and the processing time to be reduced. The method selects a sub query whose calculated efficiency is equal to or higher than the lower limit value and extracts the selected sub query as a conversion object on condition that the integrated memory increase amount is equal to or smaller than the maximum memory increase amount.

Abstract: An extraction device for extracting a sub query to be converted to a program for processing stream data continuously inputted to a database, from a query including instructions, as sub queries, to be issued to a database management system. The extraction device includes: an input unit; an operation unit for calculating the memory increase amount in a case of processing the stream data and the processing time to be reduced for each sub query, and calculating the efficiency by using them; and an extraction unit for selecting at least one sub query whose efficiency is equal to or higher than the lower limit value, integrating the memory increase amount calculated for the selected sub query, and on condition that the integrated memory increase amount is equal to or smaller than the maximum memory increase amount, extracting the selected sub query as a conversion object.

Abstract: Techniques are disclosed for generating rules for classifying structured documents, and for classifying, retrieving, or checking structured documents, using generated rules. In one example, a method for generating rules for classifying a plurality of electronic structured documents to which a same schema is applied comprises a computer performing the following steps: determining one or more variable portions defined by the schema by scanning the schema; acquiring respective feature values of the determined variable portions from each of the plurality of structured documents and associating the structured document, from which the feature values are acquired, with the acquired feature values; and generating the rules on the basis of the feature values associated with the structured document.

Abstract: A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.

Abstract: A calculating unit calculates either one of a reaction probability between a chemical species used in a semiconductor process and a semiconductor device and a deactivation probability of the chemical species, according to either one of a structure of the semiconductor device and a plurality of materials. A simulation unit performs a simulation of a physical phenomenon occurring in a reaction chamber based on either one of the reaction probability and the deactivation probability.

Abstract: A method and system for monitoring and judging activities in a virtual world environment are disclosed. The method comprises a first user engaging in an activity in the virtual world environment, a witness witnessing the first activity and reporting the activity to a monitor as possibly malicious, and the monitor organizing a jury comprised of a plurality of jurors. The jurors view and judge the activity in the virtual world environment; and on the basis of this judging, defined benefits in the virtual world environment are awarded to the witness, monitor and jurors. The method may further comprise penalizing the first user in the virtual world environment. For instance, if the first user has friends in the virtual world environment, the penalizing may include penalizing these friends.

Abstract: A simulation method includes dividing a material surface into finite computational elements, and calculating a deposition rate or etching rate at each of the computational elements to simulate a feature profile of the material surface, the calculating including calculating an indirect effect of a first computational element on the deposition rate or etching rate of a second computational element. The calculating the indirect effect includes correcting a surface profile at the first computational element on the basis of a surface structure around the first computational element, and calculating the indirect effect on the basis of the corrected surface profile at the first computational element.

Abstract: Techniques are disclosed for generating rules for classifying structured documents, and for classifying, retrieving, or checking structured documents, using generated rules. In one example, a method for generating rules for classifying a plurality of electronic structured documents to which a same schema is applied comprises a computer performing the following steps: determining one or more variable portions defined by the schema by scanning the schema; acquiring respective feature values of the determined variable portions from each of the plurality of structured documents and associating the structured document, from which the feature values are acquired, with the acquired feature values; and generating the rules on the basis of the feature values associated with the structured document.

Abstract: A transformation processing system input data including a data record area for storing target date and a transformation processing identification information record area for storing transformation processing identification information about transformation processing executed upon the target data.

Abstract: A method and system for dividing a tree structure of a structured document based on a tree structure defined by a schema of the structured document. The method includes the following steps: calculating an index value of size of a subtree having each element as a root for at least part of at least one element included in the tree structure defined by the schema, and deciding on a division pattern using the index value, where the division pattern is used to divide the tree structure of the structured document to which the schema is applied so that the size of the subtree, after being divided, meets a predetermined standard.

Abstract: A computer for a service provider receives from each member of two groups who is a user of a service via a mediating computer, a priority list in which member IDs of the other group is permuted in the priority order of a user and processing information that are encrypted so as not to be decrypted by the mediating computer. The ID of the priority list is encrypted with an encrypting key that is common to all members. The computer for a service provider performs matching, with ID in the priority list being left encrypted when the list is decrypted. The computer for a service provider decrypts the processing information, makes it in a state in which the matching result can be decrypted based on the processing information by only a person concerned, and sends it to each member via the mediating computer.

Abstract: A message gateway apparatus is provided for use in a web service system to process a message containing a request for a destination web service application, in which the message includes a plurality of events within a structured document conforming to a web service protocol and each event of the plurality of events has a name and a content thereof.

Abstract: A computer for a service provider receives from each member of two groups who is a user of a service via a mediating computer, a priority list in which member IDs of the other group is permuted in the priority order of a user and processing information that are encrypted so as not to be decrypted by the mediating computer. The ID of the priority list is encrypted with an encrypting key that is common to all members. The computer for a service provider performs matching, with ID in the priority list being left encrypted when the list is decrypted. The computer for a service provider decrypts the processing information, makes it in a state in which the matching result can be decrypted based on the processing information by only a person concerned, and sends it to each member via the mediating computer.

Abstract: An apparatus and method is provided in which a server causes a client to back up a part of resource data of a server by use of an HTTP protocol. The method includes the steps of: transmitting the resource data to be backed-up to the client; determining whether or not the recovery of the resource data to be backed-up is required; transmitting, to the client, an HTTP response having a message that indicates the necessity of recovering the resource data to be backed-up, together with a message indicating that there is no update in the resource data to be backed-up, in response to the determination that indicates the necessity of recovering the resource data to be backed-up; and recovering the resource data to be backed-up by receiving a backup of the resource data to be backed-up from the client. The method of the present invention facilitates the processing of backing up, in the client, the resource data of the server and recovering the data when the resource data of the server is lost.

Abstract: Provides structured-document processing device for detecting a relationship of approximateness between structured documents effectively. State-transition-diagram information storing means stores information concerning a state transition diagram where source nodes of a source structured document transit in order of occurrence from the head thereof. Extracting means extracting, a pair consisting of a new node and a corresponding source node in accordance with order of occurrence. Matching means determining whether the source and new nodes in the selection pair have matchingness, on the basis of their descriptions. Node qualifying means qualifying the source node as a node to be used for the new node. Transition-history information generating means generates, as transition-history information, information concerning a transition history regarding the node to be used.

Abstract: Provides efficient cache systems in a network service that allows for different expressions of requests with the same meaning, such as in a web work service using XML. The invention can be implemented as a network service system comprising a server and a client connected via a network. In this system, the client transmits a processing request that includes a certain canonicalized XML document to the server, and the server returns a response to the processing request while the server processes the XML document included in the processing request and caches the content of the response by using the processed XML document as a key.

Abstract: The method may comprise the further step of on the basis of said judging, penalizing the first user in the virtual world environment. For instance, if the first user has friends in said virtual world environment, and the penalizing step includes the step of penalizing said friends.