Patent application number | Description | Published |
20090112531 | Determining composite service reliability - The reliability of a composite service having service components is determined, where the composite service can fail only where underlying resources fail. The composite service is represented as a plurality of continuous-time Markov chains (CTMC's). Each CTMC corresponds to a resource. A product of the CTMC's is constructed. The product encompasses composite service states. Steady-state probabilities for the product are determined. Each steady-state probability corresponds to a likelihood that a corresponding state will be a steady state. For each state of the composite service, a reward structure is determined. The reward structure corresponds to a likelihood that the state will successfully use the resources without failure. The reward structure is determined for a given state based on the given state's steady-state probability and based on discrete-time Markov chains (DTMC's) corresponding to the service components. The reliability of the composite service is determined based on the reward structure of each state. | 04-30-2009 |
20090132908 | APPARATUS, PROGRAM AND METHOD FOR ACCEPTING A REQUEST FROM A CLIENT COMPUTER VIA A NETWORK AND EXECUTING A WEB APPLICATION - The present invention provides a web application server which executes a process appropriately also with respect to an access from a terminal device which was not recognized by the web application when the application was designed. The web application server includes a DLG file storage unit | 05-21-2009 |
20100332444 | AUTOMATIC DESIGNING SYSTEM, AUTOMATIC DESIGNING METHOD AND AUTOMATIC DESIGNING PROGRAM FOR AUTOMATICALLY DESIGNING ARCHITECTURE FOR SYSTEM COMPONENTS - 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. | 12-30-2010 |
20120033307 | DISPLAY DEVICE - A display device includes a light flux generation unit | 02-09-2012 |
20120230079 | ACTUATOR AND STORAGE DEVICE - In one embodiment, an actuator has a movable member, a frame, and first and second electrodes. Each of the first electrodes has a pair of first and second planes perpendicular to a third direction which is orthogonal to the first and the second directions approximately. The second electrodes are provided alternately with the first electrode respectively and with a distance from the first electrode. Each of the second electrodes has a pair of third and fourth planes perpendicular to the third direction. The first and the second planes have a deviation in the third direction with respect to the third and the fourth planes, respectively. The amount of the deviation is larger than a maximum value of the amount of displacement of the movable member in the third direction. The amount of displacement is produced by gravity when a component of the gravity in the third direction is maximum. | 09-13-2012 |
20120232941 | Determining composite service reliability - The reliability of a composite service having service components is determined, where the composite service can fail only where underlying resources fail. The composite service is represented as a plurality of continuous-time Markov chains (CTMC's). Each CTMC corresponds to a resource. A product of the CTMC's is constructed. The product encompasses composite service states. Steady-state probabilities for the product are determined. Each steady-state probability corresponds to a likelihood that a corresponding state will be a steady state. For each state of the composite service, a reward structure is determined. The reward structure corresponds to a likelihood that the state will successfully use the resources without failure. The reward structure is determined for a given state based on the given state's steady-state probability and based on discrete-time Markov chains (DTMC's) corresponding to the service components. The reliability of the composite service is determined based on the reward structure of each state. | 09-13-2012 |
20130046975 | SYSTEM, METHOD, AND PROGRAM FOR INFORMATION MANAGEMENT - 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. | 02-21-2013 |
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 |
20140025696 | Method, Program and System for Generating RDF Expressions - 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. | 01-23-2014 |