Abstract: A shortest path search method includes a process of K1-shortest path search (K1: a positive integer) from a first vertex to a second vertex in graph structure data that includes a plurality of vertices and a plurality of edges. The method includes: based on a shortest path from the first vertex to respective vertices and a shortest path from the second vertex to respective vertices, deriving each of shortest passing paths which are shortest paths of paths from the first vertex to the second vertex using any of the respective vertices as a passing point, generating contracted graph structure data in which vertices and edges that are not included in any of the shortest passing paths of top K2 (K2>=K1) having a short distance are removed from the graph structure data, and performing the process of K1-shortest path search with respect to the contracted graph structure data.

Abstract: A path searching method to be executed by a computer, the path search method includes identifying a starting point and an end point from nodes included in graph data; identifying, by using a limit value for which a value lower than a predetermined number is set, a joint point where a path from the starting point and a path from the end point are jointed; limiting a number of paths to be held in association with each of nodes including the joint point to a number equal to or lower than the limit value and holding a path having a short distance among paths reaching each of the nodes; searching, by using the paths held in association with the nodes, paths whose number is equal to or lower than a higher predetermined number among the paths reaching the joint point; and outputting the paths that have been searched.

Abstract: A shortest path matrix generation method includes assigning, in a graph represented by a plurality of vertexes and edges connecting the vertexes, identification information to respective intermediate paths including two or more of the edges on a shortest path between each vertex. The method may also include generating, as values of respective elements of a matrix representing the shortest path from all the vertexes to all the vertexes included in the graph, the shortest path matrix using the identification information of the intermediate paths on the shortest path between the vertexes corresponding to a row and a column corresponding to the respective elements.

Abstract: An apparatus generates, for each of vertices in a graph represented by the vertices and edges connecting the vertices, a first shortest-path tree rooted at a first root vertex equal to the each vertex, where the first shortest-path tree represents shortest paths from the first root vertex to vertices. The apparatus generates a vertex in the first shortest path tree whose distance from the first root vertex is a natural number of N, based on searching for one or more child vertices of a vertex within a second shortest-path tree rooted at a second root vertex adjacent to the first root vertex whose distance from the first root vertex is N?1, where the vertex for searching is included in both the first shortest-path tree and the second shortest-path tree.

Abstract: An apparatus generates, for each of vertices in a graph represented by the vertices and edges connecting the vertices, a first shortest-path tree rooted at a first root vertex equal to the each vertex, where the first shortest-path tree represents shortest paths from the first root vertex to vertices. The apparatus generates a vertex in the first shortest path tree whose distance from the first root vertex is a natural number of N, based on searching for one or more child vertices of a vertex within a second shortest-path tree rooted at a second root vertex adjacent to the first root vertex whose distance from the first root vertex is N?1, where the vertex for searching is included in both the first shortest-path tree and the second shortest-path tree.

Abstract: A plurality of computers dispersedly store pieces of data and pieces of depository information of the respective pieces of data. The depository information indicates a depository computer storing data of the pieces of data. A first computer of the plurality of computers stores, when depository information of first data is absent in a first storing unit of the first computer, first depository information in the first storing unit. The first depository information indicates the first computer as a first depository computer storing the first data. The first data is stored in a second storing unit of the first computer. The first computer identifies, by searching the first storing unit, a second computer as a second depository computer storing second data to be manipulated in association with third data stored in the second storing unit.

Abstract: An information searching apparatus retrieves a sub graph matching an inquiry graph from a graph to be searched. The apparatus includes an extracting unit that extracts, from among clusters of nodes in the graph to be searched, plural cluster pairs that each include a first cluster and a second cluster including a node linked by a link to a node in the first cluster and a calculating unit that calculates a bonding strength for each of the cluster pairs. The apparatus further includes a determining unit that determines, among the cluster pairs and based on the bonding strength of each of the cluster pairs, a cluster pair to be merged; a merging unit that merges the cluster pair; and a searching unit that searches the merged clusters for a sub graph matching the inquiry graph. An output unit outputs a search result of the searching unit.

Abstract: A method of cutting a workpiece made of a highly-hard material is provided. The workpiece is cut by a machining device including a workpiece holder that holds the workpiece, a spindle device that rotates the workpiece holder, a tool holder that holds a tool, and a relative moving mechanism that relatively moves the workpiece holder and the tool holder at least in two axial directions orthogonal to each other. In the machining device, positioning errors in the axial directions are within 5 nm.

Abstract: An information searching apparatus retrieves a sub graph matching an inquiry graph from a graph to be searched. The apparatus includes an extracting unit that extracts, from among clusters of nodes in the graph to be searched, plural cluster pairs that each include a first cluster and a second cluster including a node linked by a link to a node in the first cluster and a calculating unit that calculates a bonding strength for each of the cluster pairs. The apparatus further includes a determining unit that determines, among the cluster pairs and based on the bonding strength of each of the cluster pairs, a cluster pair to be merged; a merging unit that merges the cluster pair; and a searching unit that searches the merged clusters for a sub graph matching the inquiry graph. An output unit outputs a search result of the searching unit.

Abstract: An information searching apparatus retrieves a sub graph matching an inquiry graph from a graph to be searched. The apparatus includes an extracting unit that extracts, from among clusters of nodes in the graph to be searched, plural cluster pairs that each include a first cluster and a second cluster including a node linked by a link to a node in the first cluster and a calculating unit that calculates a bonding strength for each of the cluster pairs. The apparatus further includes a determining unit that determines, among the cluster pairs and based on the bonding strength of each of the cluster pairs, a cluster pair to be merged; a merging unit that merges the cluster pair; and a searching unit that searches the merged clusters for a sub graph matching the inquiry graph. An output unit outputs a search result of the searching unit.

Abstract: A clock determination method executed by a first one of apparatuses included in a system includes receiving a list including first definite clock values of respective apparatuses, the list being circulated among the apparatuses; determining the first clock value of the first apparatus at a point in time based on a smallest of logical clock values regarding corresponding commands on which processing is not completed, the commands being included in commands received by the first apparatus and the logical clock values being obtained at a time of receiving the corresponding commands and being stored, and updating the first clock value, the updated first clock value being included in the list, by using the determined first clock value; specifying, as a second clock value for the system, a smallest of the first clock values included in the updated list; and transmitting the updated list to a second one of the apparatuses.

Abstract: A first node apparatus included in a distributed data store acquires first operation information and a first timestamp corresponding to target data. The first operation information specifies a first operation to be executed on the target data. The first timestamp indicates a first receipt time of the first operation information. The first node apparatus determines whether the first receipt time is earlier than some of second receipt times on the basis of second timestamps and the acquired first timestamp. The second timestamp indicates the second receipt time of second operation information. The second operation information specifies a second operation executed on the target data. The first node apparatus re-executes the second operations together with the first operation on the target data in the order of the receipt time when it is determined that the first receipt time is earlier than some of the second receipt times.

Abstract: A first node apparatus included in a distributed data store acquires first operation information and a first timestamp corresponding to target data. The first operation information specifies a first operation to be executed on the target data. The first timestamp indicates a first receipt time of the first operation information. The first node apparatus determines whether the first receipt time is earlier than some of second receipt times on the basis of second timestamps and the acquired first timestamp. The second timestamp indicates the second receipt time of second operation information. The second operation information specifies a second operation executed on the target data. The first node apparatus re-executes the second operations together with the first operation on the target data in the order of the receipt time when it is determined that the first receipt time is earlier than some of the second receipt times.

Abstract: This method includes, in response to receipt of a snapshot request from a first node that receives an instruction to obtain a snapshot, identifying transactions in progress; transmitting data representing states of the identified transactions in progress to the first node; after the identifying, carrying out a first processing to prevent the transactions in progress from normally completing; receiving a list of first transactions whose results are reflected to snapshot data or a list of second transactions whose results are not reflected to the snapshot data; and executing copy-on-write on a basis of a specific time after removing the first transactions from among transactions to be processed in the first processing and confirming that the respective first transactions are normally completed or cancelled.

Abstract: A disclosed information processing system includes a receiving node and a storing node, the receiving node includes an order information adding unit that adds first order information to operation instructions included in an operation instruction sequence, the first order information indicating an order among the operation instruction sequences and an operation instruction transmission unit that transmits the one or more operation instructions to the storing node, the storing node includes an operation instruction execution unit that executes the operation instructions. Further, upon a receipt of a second operation instruction having the first order information indicating that the second operation instruction is earlier than the one or more first operation instructions, which was already executed, in the first order relationship, the storing node re-executes the first operation instruction after the second operation instruction is executed.

Abstract: A clock determination method executed by a first one of apparatuses included in a system includes receiving a list including first definite clock values of respective apparatuses, the list being circulated among the apparatuses; determining the first clock value of the first apparatus at a point in time based on a smallest of logical clock values regarding corresponding commands on which processing is not completed, the commands being included in commands received by the first apparatus and the logical clock values being obtained at a time of receiving the corresponding commands and being stored, and updating the first clock value, the updated first clock value being included in the list, by using the determined first clock value; specifying, as a second clock value for the system, a smallest of the first clock values included in the updated list; and transmitting the updated list to a second one of the apparatuses.

Abstract: An object of the present invention is to provide a mist measuring apparatus in which visual confirmation performance is enhanced, and high-accuracy detection is enabled. In the mist measuring apparatus including a housing, and a light source that is provided in this housing and emits light to a misty cutting fluid, the housing is provided around an ejection part of the misty cutting fluid, the light emitted from the light source is a visible ray, and the housing is provided with an observation part for observing scattered light from the misty cutting fluid.

Abstract: A method of cutting a workpiece made of a highly-hard material is provided. The workpiece is cut by a machining device including a workpiece holder that holds the workpiece, a spindle device that rotates the workpiece holder, a tool holder that holds a tool, and a relative moving mechanism that relatively moves the workpiece holder and the tool holder at least in two axial directions orthogonal to each other. In the machining device, positioning errors in the axial directions are within 5 nm.

Abstract: An object of the present invention is to provide a mist measuring apparatus in which visual confirmation performance is enhanced, and high-accuracy detection is enabled. In the mist measuring apparatus including a housing, and a light source that is provided in this housing and emits light to a misty cutting fluid, the housing is provided around an ejection part of the misty cutting fluid, the light emitted from the light source is a visible ray, and the housing is provided with an observation part for observing scattered light from the misty cutting fluid.

Abstract: A silicon lump crushing tool comprising a pneumatic piston drive means for driving a piston installed in a casing from a retreat position to a projection position by air pressure, a guide tube connected to the casing and extending in the movement direction of the piston, and a hammer head. The rear end portion of the hammer head is movably inserted into the front end portion of the guide tube, and when the piston is driven from the retreat position to the projection position, the front end of the piston collides with the rear end of the hammer head.