Abstract: An approach for reducing transmission of probe car data over a network is provided. The approach includes using a processor to receive, at one or more processors remote from a vehicle, a first set of probe car data for the vehicle, wherein the first set of probe car data comprises a trigger event from a first time. The processor determine that no additional set of probe car data is received during a second time interval. The processor also determines that a trigger event has not occurred during the second time interval based on the determination that no additional set of probe car data was received. The processor also estimates an estimated probe car data for the vehicle at the second time interval based on the first set of probe car data and a non-trigger assumption.

Abstract: A computer-implemented method and system for simulating traffic flow configurations. The method includes simulating vehicle traffic on a virtual roadway configuration in a simulated environment using a car-following model to provide simulated vehicle traffic at an intersection, wherein the car-following model includes vehicle parameters of at least one of a lead vehicle and a subsequent vehicle at each timestep, the lead vehicle positioned in front of the subsequent vehicle, and modifying the simulated vehicle traffic using a ghost vehicle approximation model to provide simulated traffic flow distributions while maintaining incident avoidance criteria, wherein the ghost vehicle approximation model includes setting a speed value and a gap distance value of a ghost vehicle positioned in front of the lead vehicle and/or the subsequent vehicle to modify the vehicle parameters of the lead vehicle and the subsequent vehicle at each timestep.

Abstract: A computer-implemented method for acquiring a velocity of a vehicle, detecting whether the velocity is in a fluctuating state, and determining that the vehicle is in traffic congestion, in response to a parameter of the velocity being less than or equal to a predetermined threshold value and the velocity being detected to be in the fluctuating state. The computer-implemented method may further be capable of acquiring a position of the vehicle and identifying a position of a tail end of the traffic congestion, based on the position of the vehicle determined to be in the traffic congestion. In exemplary embodiments, if a ratio of vehicles capable of acquiring information is low, then the accuracy of an estimation of traffic congestion also becomes low.

Abstract: A computer-implemented method is provided for distributed computing. The method includes forming interaction specific shadow agents by extracting agent interaction data from an original agent at a source node utilizing agent-based simulators. The method further includes broadcasting aggregated agent interaction data collected from the original agent at a source node to other nodes in a distributed area to calculate agent interactions and behaviors therefrom. The agent interaction data extracted from the original agent consists of a constrained subset of data derived from a set of data of the original agent at the source node.

Abstract: A computer-implemented method is provided for distributed computing. The method includes forming interaction specific shadow agents by extracting agent interaction data from an original agent at a source node utilizing agent-based simulators. The method further includes broadcasting aggregated agent interaction data collected from the original agent at a source node to other nodes in a distributed area to calculate agent interactions and behaviors therefrom. The agent interaction data extracted from the original agent consists of a constrained subset of data derived from a set of data of the original agent at the source node.

Abstract: A computer-implemented method is provided for distributed computing. The method includes forming interaction specific shadow agents by extracting agent interaction data from an original agent at a source node utilizing agent-based simulators. The method further includes broadcasting aggregated agent interaction data collected from the original agent at a source node to other nodes in a distributed area to calculate agent interactions and behaviors therefrom. The agent interaction data extracted from the original agent consists of a constrained subset of data derived from a set of data of the original agent at the source node.

Abstract: A computer-implemented method is provided for distributed computing. The method includes forming interaction specific shadow agents by extracting agent interaction data from an original agent at a source node utilizing agent-based simulators. The method further includes broadcasting aggregated agent interaction data collected from the original agent at a source node to other nodes in a distributed area to calculate agent interactions and behaviors therefrom. The agent interaction data extracted from the original agent consists of a constrained subset of data derived from a set of data of the original agent at the source node.

Abstract: A computer-implemented method and system for simulating traffic flow configurations. The method includes simulating vehicle traffic on a virtual roadway configuration in a simulated environment using a car-following model to provide simulated vehicle traffic at an intersection, wherein the car-following model includes vehicle parameters of at least one of a lead vehicle and a subsequent vehicle at each timestep, the lead vehicle positioned in front of the subsequent vehicle, and modifying the simulated vehicle traffic using a ghost vehicle approximation model to provide simulated traffic flow distributions while maintaining incident avoidance criteria, wherein the ghost vehicle approximation model includes setting a speed value and a gap distance value of a ghost vehicle positioned in front of the lead vehicle and/or the subsequent vehicle to modify the vehicle parameters of the lead vehicle and the subsequent vehicle at each timestep.

Abstract: An information processing device which selects a set of items to be recommended for a user out of a set of items. The information processing device includes: (a) a selection unit which: (i) calculates priority which is high in the case of a high score of an item itself and low in the case of a high degree of similarity to another selected item with respect to each of the plurality of items, and (ii) selects a set of items out of the plurality of items on the basis of the priority; and (ii) an output unit which outputs each item included in the selected set of items as an item to be presented to the user.

Abstract: An information processing apparatus that optimizes a policy in a transition model in which the number of targeted objects in each state transits according to the policy includes a cost constraint acquisition unit configured to acquire a cost constraint that constrains a total cost of the policy; a mass policy setting unit configured to set the number of objects targeted by a mass policy in each state, based on the predefined number of objects to belong to each state and a reach rate at which the mass policy reaches to an object, with respect to the mass policy collectively executed for the object in two or more states; and a processing unit configured to assume the reach rate of the mass policy as a variable of an optimization and maximize an objective function based on a total reward in a whole period while satisfying the cost constraint.

Abstract: An information processing apparatus optimizes an action in a transition model in which a number of objects in each state transits according to the action. A cost constraint acquisition unit acquires multiple cost constraints including one that constrains a total cost of the action over at multiple timings and/or multiple states. A processing unit assumes action distribution in each state at each timing as a decision variable in an optimization problem and maximizes an objective function subtracting a term based on an error between an actual number of objects with the action in each state at each timing and an estimated number of objects in each state at each timing based on state transition by the transition model, from a total reward in a whole period, satisfying the multiple cost constraints. An output unit outputs the action distribution in each state at each timing that maximizes the objective function.

Abstract: An information processing apparatus optimizes an action in a transition model in which a number of objects in each state transits according to the action. A cost constraint acquisition unit acquires multiple cost constraints including one that constrains a total cost of the action over at multiple timings and/or multiple states. A processing unit assumes action distribution in each state at each timing as a decision variable in an optimization problem and maximizes an objective function subtracting a term based on an error between an actual number of objects with the action in each state at each timing and an estimated number of objects in each state at each timing based on state transition by the transition model, from a total reward in a whole period, satisfying the multiple cost constraints. An output unit outputs the action distribution in each state at each timing that maximizes the objective function.

Abstract: An information processing apparatus that optimizes a policy in a transition model in which the number of targeted objects in each state transits according to the policy includes a cost constraint acquisition unit configured to acquire a cost constraint that constrains a total cost of the policy; a mass policy setting unit configured to set the number of objects targeted by a mass policy in each state, based on the predefined number of objects to belong to each state and a reach rate at which the mass policy reaches to an object, with respect to the mass policy collectively executed for the object in two or more states; and a processing unit configured to assume the reach rate of the mass policy as a variable of an optimization and maximize an objective function based on a total reward in a whole period while satisfying the cost constraint.

Abstract: An information processing device which selects a set of items to be recommended for a user out of a set of items. The information processing device includes: (a) a selection unit which: (i) calculates priority which is high in the case of a high score of an item itself and low in the case of a high degree of similarity to another selected item with respect to each of the plurality of items, and (ii) selects a set of items out of the plurality of items on the basis of the priority; and (ii) an output unit which outputs each item included in the selected set of items as an item to be presented to the user.

Abstract: An apparatus for evaluating organization efficiency, a method for evaluation service of organization efficiency, an apparatus for generating communication frequencies, a method for generating communication frequencies, and programs and recording media of the same, quantitatively evaluate efficiency of an organization structure.

Abstract: There is provided a program for allocating an agent on a computer including a plurality of interconnected nodes, each having a CPU and a memory; the program causing each of the nodes of the computer to perform the steps of: storing the amount of data transmitted between an agent residing on the node and a node with which the agent has communicated; determining for each agent a node M that results in the largest reduction in the amount of data transmitted when the agent is transferred to the node M; adding the agent to an agent list containing candidate agents to be transferred to the node M; and transferring agents on the agent list to the node M.

Abstract: An apparatus for evaluating organization efficiency, a method for evaluation service of organization efficiency, an apparatus for generating communication frequencies, a method for generating communication frequencies, and programs and recording media of the same, quantitatively evaluate efficiency of an organization structure.

Abstract: A discrete pattern, formed by dots discretely arranged in two dimensions, is provided wherein the dots are generated in a low discrepancy sequence. The dots are preferably generated in a discrete pattern wherein the square of discrepancy D satisfies the formula, D?0.13N?1.15??(1) Further, the method provides for generation of, and the appartus provides implementation of, a discrete pattern even when the filling factor rapidly changes by automatically generating or deleting dots.

Abstract: A discrete pattern, formed by dots discretely arranged in two dimensions, is provided wherein the dots included in a rectangular area having a longitudinal length of Lx and a transverse length of Ly satisfy expression (1), D≦0.13N−1 15  (1) (in expression (1), N denotes the number of dots included in a predetermined area, and D is obtained by expression (2), wherein A(x,y) defines the number of dots, of a total of N dots, included in a rectangular area for which a line segment extended from reference coordinates (0,0) to an arbitrary coordinate point (x,y) is a diagonal line), [Ex.

Abstract: A discrete pattern, formed by dots discretely arranged in two dimensions, is provided wherein the dots are generated in a low discrepancy sequence.