Abstract: Provided is a generation device including: a test vector generation unit for selecting, for each of parameters to be included in a test vector, one value from among possible values for the parameter to generate test vectors whose combinations of values are different from each other; an extraction unit for extracting, as partial sequences each including one or more test vectors, portions of a series including the test vectors output by the test vector generation unit; and a test sequence generation unit for generating a test sequence based on the extracted partial sequences.

Abstract: Provided is a generation device including: a test vector generation unit for selecting, for each of parameters to be included in a test vector, one value from among possible values for the parameter to generate test vectors whose combinations of values are different from each other; an extraction unit for extracting, as partial sequences each including one or more test vectors, portions of a series including the test vectors output by the test vector generation unit; and a test sequence generation unit for generating a test sequence based on the extracted partial sequences.

Abstract: 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.

Abstract: 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.

Abstract: A sparse matrix used in the least-squares method is divided into small matrices in accordance with the number of elements of observation. An observation ID is assigned to each element of observation, a parameter ID is assigned to each parameter, and the IDs are associated with parameters of elements as ID mapping. A system determines positions of nonzero elements in accordance with whether or not ID mapping exists, the correspondence between observation IDs and parameter IDs, and the positions of the small matrices, and selects a storage scheme for each small matrix based thereon. The system selects a storage scheme in accordance with conditions, such as whether or not a target element is a diagonal element, whether or not a term decided without ID mapping exists, and whether or not the same ID mapping is referred to.

Abstract: Provided is a generation device including: a test vector generation unit for selecting, for each of parameters to be included in a test vector, one value from among possible values for the parameter to generate test vectors whose combinations of values are different from each other; an extraction unit for extracting, as partial sequences each including one or more test vectors, portions of a series including the test vectors output by the test vector generation unit; and a test sequence generation unit for generating a test sequence based on the extracted partial sequences.

Abstract: Provided are techniques for distributing data in a trackable manner while suppressing an increase in the size of data to be distributed as much as possible and minimizing interruption of usage of the data. A method for distributing data to multiple clients from a server includes the steps of: generating a common noise by using noises unique to the multiple clients, respectively; embedding the common noise in the data to be distributed to make the data unusable; and distributing the data containing the embedded common noise, so that the data containing the embedded common noise is made usable by each of the multiple clients using a unique noise generated in the client.

Abstract: A system and method of decrypting is provided. The method includes grouping domain data of the domain for authorized parties, encrypting a group of leaves in the grouped data having a tree structure using a common key, generating first public data, obtaining a common key by decrypting the first public data using a secret key of a link creator and decrypt the groups using the common key and the secret key, generating a, propagating records, generating second public data by encrypting the table using a common key, obtaining a common key by decrypting the first public data and the second public data using a secret key and generating a view by decrypting data received from a method for the link creator using the common key obtained by decrypting the first public data and the second public data using the secret key.

Abstract: 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.

Abstract: 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.

Abstract: A method for constructing relation information between data elements in a directed acyclic graph (DAG) in first and second domains includes importing data from the first domain DAG and data from the second domain DAG to generate a relation graph; responsive a relation between a node va of the first domain DAG and a node vb of the second domain DAG, generating a join node between va and vb in the relation graph, the join node linking a node upstream of va in the DAG to a node upstream of vb in the DAG; if there is a pair of va of the first domain DAG and vb of the second domain DAG that do not have a join node, generating a join node v between va and vb in the relation graph, and generating an edge (va, v) and an edge (vb, v) in the relation graph.

Abstract: A system and method of generating RDF expression. The system receives a URI from a tool using linked data, and identifies an object to become a seed from the URI. Next, the appropriate mapping file is identified from the type of object, and type information is generated from this. The generated type information is referenced, and objects are collected following recursively from the seed. The system sends a graph of the collected objects to an RDF converter. The RDF converter references the mapping file, and converts the object graph into RDF, which is then outputted.

Abstract: A method, computer program, and system-model converter for converting system model. The method includes the steps of: receiving input of a conversion processing description about a structure of a multi-dimensional data model and extraction queries, where the multi-dimensional data model and the extraction queries extract at least one element from a plurality of model elements; and generating a hierarchical multi-dimensional data model from a graph model stored in a graph model storage unit on the basis of the inputted conversion processing description, where the hierarchical multi-dimensional data model includes dimensions having a hierarchical relationship.

Abstract: 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.

Abstract: A system and method for improving access efficiency in a database. The database stores values of a plurality of keys associated with the respective keys. The system of the invention executes a plurality of transactions on the database, and acquires and records a referenced value which is a value of a key referenced in a corresponding transaction from the database according to the execution of each of the transactions. Then, according to commit requests of the plurality of transactions, the system requests a reply of a resultant table including an arrangement of judgment results obtained by judging whether the value of the key stored in the database is maintained as the referenced value without change made by another transaction for the respective transactions. The system further judges whether each transaction is successful, based on the resultant table sent back and commits only transactions judged to be successful.

Abstract: An automatic designing system includes: a rule storage unit storing sets of rewrite rules for rewriting variable nodes of a hierarchically structured graph in a design architecture for the system; a search unit sequentially determining variable nodes as application targets for the rewrite rules by searching the graph, including components in the design architecture for the system to be designed, using a search tree; a judgment unit judging whether the rewrite rule is applicable to the determined variable node; and a rule application unit replacing the determined variable node with a partial graph, including at least one of fixed and variable nodes, according to the rewrite rule, in response to a judgment that the rewrite rule is applicable. The search unit performs the searching until an undefined variable node no longer exists in the graph to be designed, and performs backtracking on condition that no variable node is found.

Abstract: A system and method of decrypting is provided. The method includes grouping domain data of the domain for authorized parties, encrypting a group of leaves in the grouped data having a tree structure using a common key, generating first public data, obtaining a common key by decrypting the first public data using a secret key of a link creator and decrypt the groups using the common key and the secret key, generating a, propagating records, generating second public data by encrypting the table using a common key, obtaining a common key by decrypting the first public data and the second public data using a secret key and generating a view by decrypting data received from a method for the link creator using the common key obtained by decrypting the first public data and the second public data using the secret key.

Abstract: 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.

Abstract: 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.

Abstract: 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.