International Business Machines Corporation

Hideyuki Mizuta

Yoichi Taira

Tsuyoshi Ide

Akiko Nishikai

Gaku Yamamoto

Fusashi Nakamura

Kazuaki Ikeda

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.

Probe car data transmission reduction

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.

System and method for simulating traffic flow distributions with approximated vehicle behavior near intersections

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.

Shadow agent projection in multiple places to reduce agent movement over nodes in distributed agent-based simulation

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. The present invention provides an apparatus for evaluating organization efficiency having communication frequencies among departments obtaining unit for obtaining communication frequencies among departments, the frequency being frequencies of information interchanges among departments within an organization; a group definition data obtaining unit for obtaining group definition data, the data defining a group including more than one department within an organization; communication frequencies among groups calculation unit for calculating communication frequencies among groups for groups interchanging information, on the basis of communication frequencies among departments; and an organization efficiency calculation unit for calculating efficiency of an organization structure defined by group definition data, on the basis of the communication frequencies among groups.

Collaborative organization analysis

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&#x2266;0.13N&#x2003;&#x2003;(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.

Discrete pattern, apparatus, method, and program storage device for generating and implementing the discrete pattern

Discrete pattern

To provide a numerical integration system and method, suitable for a high-order dimensional Monte Carlo calculation and having high convergence speed without incurring a calculation time penalty, a multi-dimensional sequence is first converted into a one-dimensional value. Then the conversion is optimized in accordance with characteristics of a model. A summation calculation is corrected by using an averaged weight, instead of correcting the values of a random sequence. Then a histogram is prepared to correct the overall shape of the distribution of a random number sequence. DA sum is calculated for each group obtained when the histogram is prepared. As a result, the convergence speed is increased without sacrificing the calculation time.

Growing community of inventors

Tokyo, Japan

Hideyuki Mizuta