Abstract: A distributed system is provided that includes member nodes and a leader node. Each member node stores a database and updates the database by performing common ones of a plurality of transactions. The leader node generates a batch, to be executed by each member node, which includes two or more transactions lacking an access conflict from among the plurality of transactions. The leader node includes: a section that generates an access set as a set of database entries to be accessed by each transaction to be executed; a section that generates the batch, based on the access set of each transaction to be executed; and a leader-side section that performs a consensus process for the batch among the leader and member nodes. Each member node includes the database; a member-side section that performs a consensus process for the batch; and a section that performs parallel execution of batch transactions.

Abstract: A method for controlling priority of dynamic compilation by a computer system is disclosed. A task is executed by using a thread pooled in a thread pool. A metric related to the dynamic compilation is monitored. And then, determination is done whether the metric meets a predetermined criterion. In returning of the thread to the thread pool for next execution, a lowering of priority of the thread is caused if the metric is determined to meet the predetermined criterion. The lowering of priority of the thread may be caused by causing the thread to sleep for a period of time before the returning. The metric may be a length of a compilation queue for the dynamic compilation or a utilization rate of a compiler thread executing the dynamic compilation.

Abstract: Verified snapshots are generated by obtaining, from one of a plurality of first nodes, a difference between a common data at a first time point and the common data at a second time point that is different from the first time point, generating a first snapshot of the common data at the first time point based on the difference, obtaining a hash of the common data at the first time point from one of the plurality of first nodes, and verifying the first snapshot at the first time point with the hash of the common data at the first time point.

Abstract: A computer-implemented method and system are provided for reducing garbage collection overhead. The method includes specifying, by a hardware processor from a set of nodes of a Directed Acyclic Graph representing an application program, wherein each of the nodes represents a respective one of a plurality of computation tasks, any of the nodes which store a respective computation result for at least a threshold period of time as cache nodes. The method further includes allocating, by the hardware processor, the respective computation result of each of the cache nodes into a tenure area of a memory.

Abstract: Verified snapshots are generated by obtaining, from one of a plurality of first nodes, a difference between a common data at a first time point and the common data at a second time point that is different from the first time point, generating a first snapshot of the common data at the first time point based on the difference, obtaining a hash of the common data at the first time point from one of the plurality of first nodes, and verifying the first snapshot at the first time point with the hash of the common data at the first time point.

Abstract: Apparatus and method for processing a query. The apparatus includes: a storage unit configured to store (i) a plurality of safe elements committed and saved in the database, and (ii) a plurality of unsafe elements for updating the plurality of safe elements, wherein the unsafe elements are not committed or committed, but not saved; a first query executing unit configured to execute the query on the plurality of unsafe elements; a second query executing unit configured to execute the query on the plurality of safe elements after the first query executing unit executes the query; and a third query executing unit configured to execute the query on at least one safe element saved during execution of the query by the second query executing unit after the second query executing unit executes the query. There is also provided another apparatus and a method.

Abstract: A method and system are provided for reducing garbage collection overhead. The method includes representing, by a hardware processor, an application program by a Directed Acyclic Graph having a set of nodes. Each of the nodes represents a respective one of a plurality of computation tasks. The method further includes specifying, by the hardware processor from the set of nodes, any of the nodes which store a respective computation result for at least a threshold period of time as cache nodes. The method further includes allocating, by the hardware processor, the respective computation result of each of the cache nodes into a tenure area of a memory.

Abstract: Various methods for generating map-based snippets are provided. One example method includes determining that a content page identifier includes an indication that a content page includes a map. In this regard, data for rendering the content page may include at least destination information. The method may also include in response to determining that the content page identifier includes an indication that the content page includes a map, extracting the destination information from the content page. The example method may further include constructing a user interface snippet that is selectable for retrieving the content page, where the user interface snippet includes a component that is generated based at least in part on the destination information. Similar and related example methods and example apparatuses are also provided.

Abstract: In one example of the disclosure, presence data indicative of a presence factor for a remote subject is received from a server. The presence data is analyzed and a display representative of the presence factor is caused at a 3D object. The 3D object includes a 3D element representative of the remote subject.

Abstract: Apparatus and method for processing a query. The apparatus includes: a storage unit configured to store (i) a plurality of safe elements committed and saved in the database, and (ii) a plurality of unsafe elements for updating the plurality of safe elements, wherein the unsafe elements are not committed or committed, but not saved; a first query executing unit configured v to execute the query on the plurality of unsafe elements; a second query executing unit configured to execute the query on the plurality of safe elements after the first query executing unit executes the query; and a third query executing unit configured to execute the query on at least one safe element saved during execution of the query by the second query executing unit after the second query executing unit executes the query. There is also provided another apparatus and a method.

Abstract: Method and apparatus for direct memory access of dynamically allocated memory. The apparatus includes: a state receiving module operable to receive a reallocation state of a dynamically allocated memory; an address receiving module operable to receive a dynamic address of a data segment stored in the dynamically allocated memory; a data access module operable to access the dynamic address via a direct memory access (DMA) protocol; and a determining module operable to determine whether a reallocation state received before access to the dynamic address is identical to a reallocation state received after access to the dynamic address. Also provided, a method for verification of data accessed from a dynamically allocated memory and a method and apparatus for allowing a server to provide access to data from a dynamically allocated memory by a client device.

Abstract: A method and system are provided for reducing garbage collection overhead. The method includes representing, by a hardware processor, an application program by a Directed Acyclic Graph having a set of nodes. Each of the nodes represents a respective one of a plurality of computation tasks. The method further includes specifying, by the hardware processor from the set of nodes, any of the nodes which store a respective computation result for at least a threshold period of time as cache nodes. The method further includes allocating, by the hardware processor, the respective computation result of each of the cache nodes into a tenure area of a memory.

Abstract: A hydraulic system includes: hydraulic actuators; a control valve for controlling the hydraulic actuators; a tank for storing a hydraulic operation fluid; a variable displacement pump for supplying the hydraulic operation fluid to the hydraulic actuators; a regulator for controlling the variable displacement pump; a pilot pump for discharging a hydraulic pilot fluid; a load sensing system for maintaining a differential pressure to be a constant pressure, the differential pressure being obtained by subtracting a second signal pressure from a first signal pressure that is the discharge pressure of the variable displacement pump, the second signal pressure being the maximum one of the load pressures generated in the hydraulic actuators; a signal tube for sending the second signal pressure to the regulator; a throttle provided on the signal tube; and a warm-up circuit for supplying the hydraulic pilot fluid to a downstream side of the throttle.

Abstract: A system for controlling an autonomous vehicle having cameras for obtaining image data of neighboring vehicles in a proximity of the autonomous vehicle and for identifying physical characteristics of the neighboring vehicles, including makes, models, and trims of neighboring vehicles, colors of the neighboring vehicles, and exposed cargo being carried by the neighboring vehicles. The system maps the identified physical characteristics into predicted potential on-road events in the proximity of the autonomous vehicle, and makes driving decisions based on the predicted potential on-road event.

Abstract: A hydraulic system for a work machine includes a first control valve including a first direction switch to switch a direction in which the operation fluid is to flow through a first hydraulic actuator and a pressure compensator to maintain a differential pressure to a constant pressure, the differential pressure being a difference between a pressure of the operation fluid to be inputted to the pressure compensator and a pressure of the operation fluid to be outputted from the pressure compensator. And, the hydraulic system includes a second control valve including a second direction switch to switch a direction in which the operation fluid is to flow through a second hydraulic actuator and a flow rate prioritizer to prioritize a flow rate of the operation fluid to be outputted to the second hydraulic actuator.

Abstract: A method of managing a commitment time that includes providing at least a first client and a second client in communication with at least a transaction management server in an NoSQL environment; and determining with the transaction management server when the first client reads a value in a first transaction that is being updated by the second client in a second transaction whether the value has been committed. If it is determined that the value has not been committed, the transaction management server causes the second client to commit after the start time of the first transaction.

Abstract: An apparatus, method, and computer program product are described that can receive a signal from a tangible object, where the signal includes an indication of an operation to be executed upon receipt of a user input applied by the tangible object, and that can determine the operation based on the indication. In this way, the user is not required to provide additional user input to define the particular operation that is desired. The apparatus may determine at least one recipient with whom data selected via a user input applied by the tangible object may be shared. The apparatus may further provide for the determination of an operation to be executed based on an identification of a selection of content and may provide for the association of the operation with the tangible object, such that subsequent user input applied via the tangible object causes execution of the operation.

Abstract: An apparatus, method, and computer program product are described that can receive a signal from a tangible object, where the signal includes an indication of an operation to be executed upon receipt of a user input applied by the tangible object, and that can determine the operation based on the indication. In this way, the user is not required to provide additional user input to define the particular operation that is desired. The apparatus may determine at least one recipient with whom data selected via a user input applied by the tangible object may be shared. The apparatus may further provide for the determination of an operation to be executed based on an identification of a selection of content and may provide for the association of the operation with the tangible object, such that subsequent user input applied via the tangible object causes execution of the operation.

Abstract: Method and apparatus for direct memory access of dynamically allocated memory. The apparatus includes: a state receiving module operable to receive a reallocation state of a dynamically allocated memory; an address receiving module operable to receive a dynamic address of a data segment stored in the dynamically allocated memory; a data access module operable to access the dynamic address via a direct memory access (DMA) protocol; and a determining module operable to determine whether a reallocation state received before access to the dynamic address is identical to a reallocation state received after access to the dynamic address. Also provided, a method for verification of data accessed from a dynamically allocated memory and a method and apparatus for allowing a server to provide access to data from a dynamically allocated memory by a client device.

Abstract: A system and method of implementing distributed transactions on a KVS having a simple configuration without unnecessarily causing rollbacks. The method includes providing a management map including a global transaction ID as a key and {a state of global transaction, a waiting global transaction ID list} as a value, starting a management local transaction on one of the plurality of servers, inserting a key-value pair including an ID of the global transaction to be processed as a key and {a state “working”, null} as a value into the management map in the management local transaction, and updating a value having the ID of the global transaction to be processed as a key to {a state “waiting”, a waiting global transaction ID list for the global transaction to be processed} on the management map in the management local transaction and committing the management local transaction.