Abstract: A system for tracking cumulative motor vehicle risk includes a satellite navigation system receiver disposed within a motor vehicle and configured to determine a present location of the motor vehicle. A computer processor receives the determined present location of the motor vehicle from the satellite navigation system receiver and generates a traveled route therefrom. A first computer server receives a plurality of motor vehicle claims records, determines a plurality of motor vehicle accident locations from the plurality of motor vehicle claims records, and generates a motor vehicle accident heat map from the plurality of motor vehicle accident locations. A second computer server determines a cumulative risk exposure of the motor vehicle based on the generated traveled route and the generated motor vehicle accident heat map.

Abstract: A method to train a machine learning model for in-vehicle air quality control in a knowledge-based system, executed by one or more computer processors, includes collecting data related to in-vehicle air quality from a plurality of probe cars where the data is collected by various on-board systems in each probe car. The method includes correlating the data related to in-vehicle air quality from each probe car with air quality measurements from each probe car, where the correlation is used to update the machine learning model. The method includes determining a situation when an in-vehicle air quality measurement of the air quality measurements is above a pre-determined in-vehicle air quality level and determining instructions for actions by one or more of the one or more on-board systems in each of the probe cars to maintain an in-vehicle air quality level at or below the pre-determined in-vehicle air quality level.

Abstract: A method and system obtaining positioning data from an object traveling on a plurality of routes; mapping the data into a plurality of points on a digital map; identifying points that are unmatched to the stored route trajectory; obtaining candidate transition points from the unmatched points; aggregating the candidate transition points by applying a clustering algorithm; selecting a first cluster of points and a plurality of second clusters of points, determining a confidence level that the first cluster of points are transition points indicating a transition between the routes, classifying the first cluster of points as a first plurality of traveling points having a first direction in response to the confidence being below a threshold confidence and automatically adjusting the stored route trajectory to indicate that the first cluster of points are on the route trajectory.

Abstract: A computer-implemented method for cache memory management in a distributed computing environment includes tracking, via a cache balancing engine, a plurality of vehicles operating in a first region. The method further includes executing, via the cache balancing engine, an analysis for a subset of the plurality of vehicles in the first region to determine a weighted mean velocity for each vehicle in the subset of the plurality of vehicles in the first region. The method further includes determining, via the cache balancing engine, based on the analysis, whether a second regional server tracking a second plurality of vehicles in a second region is likely to have an unbalanced cache memory, and rebalancing, via the cache balancing engine, cache memory data in the first regional server and cache memory data in the second regional server responsive to determining that the second regional server is likely to have an unbalanced cache memory.

Abstract: The present invention relates to multi-user analytical system and corresponding device and method. The device includes an interception module configured to intercept a user's request for a first core object, wherein the first core object belongs to core object; a transformation module configured to create, in response to the request being a creation request, the first core object specific to the user; a mapping module configured to interpret, in response to the request being a non-creation request, the request as a request for the first core object specific to the user. The present invention also includes an isolation method for the multi-user analytical system. The technical solutions provided in the present invention can effectively enable multiple users to share physical resources in the analytical system, and the users are isolated from each other in a substantially transparent way.

Abstract: A system, a computer program product, and method for automatic state adjustment in reinforcement learning is described. The method begins with operating a reinforcement learning model using a state-action table with a set of environment states, a set of software agent states of at least one software agent, a set of actions corresponding to the set of environmental states and software agent states, a plurality of policies of transitioning from the environmental states and software agent states to actions, rules that determine a scalar immediate reward based on the transitioning, and rules that describe what the at least one software agent observes. An unstable state is identified from a series of values of the set of actions in the state-action table in which the series of values differ from each other by a settable threshold. Policies or factors are selected to split the unstable state that has been identified.

Abstract: Embodiments of the present invention generally relate to data processing and collection, further relate to a data processing method and a corresponding system, a data collecting method and a corresponding system. Particularly, the data processing method of the present invention comprises: obtaining position data; obtaining a position-function mapping relationship; and converting the position data into user behavior data according to the position-function mapping relationship. As compared to the prior art, at least one embodiment of the present invention has at least one of the following advantages: first, to collect user operations on a mobile terminal in a non-intrusive manner; second, to facilitate analysis performed on various applications of the mobile terminal.

Abstract: A method, system, and computer program product for obtaining a first route traversed by a target object, performing at least one prediction for a second route to be traversed by the target object based on the first route, the at least one prediction being performed with at least one of an object-specific prediction model, an object group-specific prediction model, and an object-independent prediction model, and determining, according to a decision rule, a prediction result of the second route based on the at least one prediction.

Abstract: A mechanism is provided for controlling the internal air-quality of a vehicle. In-vehicle sensor data of a vehicle are acquired and the usage status of the vehicle is determined based on the acquired in-vehicle sensor data. Based on the acquired in-vehicle sensor data and the determined usage status, a changing trend of the in-vehicle air-quality is determined and responsive to the determined changing trend of the in-vehicle air-quality, a control system of the vehicle is signaled to control the usage status of the vehicle based on a control policy.

Abstract: An embodiment of the present invention provides a method for storing trajectory. The method includes: mapping, based on a plurality of positions on a trajectory of an entity, the trajectory to at least one road segment in a road network; identifying an entry point and an exit point of one of the road segments, wherein the entry point is a point where the entity starts traveling along the road segment, and the exit point is a point where the entity ends traveling along the road segment; and storing data related to at least one of the entry point and the exit point, to store the road segment as a part of information of the trajectory.

Abstract: A computer-implemented method for cache memory management in a distributed computing environment includes tracking, via a cache balancing engine, a plurality of vehicles operating in a first region. The method further includes executing, via the cache balancing engine, an analysis for a subset of the plurality of vehicles in the first region to determine a weighted mean velocity for each vehicle in the subset of the plurality of vehicles in the first region. The method further includes determining, via the cache balancing engine, based on the analysis, whether a second regional server tracking a second plurality of vehicles in a second region is likely to have an unbalanced cache memory, and rebalancing, via the cache balancing engine, cache memory data in the first regional server and cache memory data in the second regional server responsive to determining that the second regional server is likely to have an unbalanced cache memory.

Abstract: Systems and methods for navigating in consideration of estimated air quality in an individual area of a geographic region includes receiving traffic data for the individual area and sensor data of environmental pollution sensors within the individual region.

Abstract: Techniques facilitating resolution-based spatial computing are provided. In one example, a computer-implemented method comprises traversing, by a device operatively coupled to a processor, a data structure corresponding to a land area for a location having an index; and determining, by the device, whether the location is at least partially within the land area based on a result of the traversing. In some embodiments, the traversing comprises: obtaining a threshold number of levels based at least in part on a resolution parameter; scanning a first level of the data structure for a node having an index corresponding to the index of the location; and iterating the scanning for respective subsequent levels of the data structure based on the scanning returning a node having subordinate nodes and a number of levels for which the scanning and iterating have been performed being less than the threshold number of levels.

Abstract: A method for scheduling MapReduce tasks includes receiving a set of task statistics corresponding to task execution within a MapReduce job, estimating a completion time for a set of tasks to be executed to provide an estimated completion time, calculating a soft decision point based on a convergence of a workload distribution corresponding to a set of executed tasks, calculating a hard decision point based on the estimated completion time for the set of tasks to be executed, determining a selected decision point based on the soft decision point and the hard decision point, and scheduling upcoming tasks for execution based on the selected decision point. The method may also include estimating a map task completion time and estimating a shuffle operation completion time. A computer program product and computer system corresponding to the method are also disclosed.

Abstract: A method for scheduling MapReduce tasks includes receiving a set of task statistics corresponding to task execution within a MapReduce job, estimating a completion time for a set of tasks to be executed to provide an estimated completion time, calculating a soft decision point based on a convergence of a workload distribution corresponding to a set of executed tasks, calculating a hard decision point based on the estimated completion time for the set of tasks to be executed, determining a selected decision point based on the soft decision point and the hard decision point, and scheduling upcoming tasks for execution based on the selected decision point. The method may also include estimating a map task completion time and estimating a shuffle operation completion time. A computer program product and computer system corresponding to the method are also disclosed.

Abstract: A method and system obtaining positioning data from an object traveling on a plurality of routes; mapping the data into a plurality of points on a digital map; identifying points that are matched based on a distance and having a traveling direction consistent with the route directions; obtaining candidate transition points from the plurality of points on the digital map; aggregating the candidate transition points by applying a clustering algorithm to obtain a first cluster of points and a plurality of second clusters of points, verifying a confidence that the first cluster of points are transition points indicating a transition between the routes, and in response to the confidence being below a threshold confidence, classifying the first cluster of points as a first plurality of traveling points having a first direction and automatically adjusting the digital map at least in part based on the first cluster of points.

Abstract: A hierarchical spatial encode structure stored on a computing device is disclosed. The hierarchical spatial encode structure includes a plurality of scale levels having a plurality of encode expressions for a multi-scale context. The encode expressions on a first of the scale levels may include a first length. The encode expressions on a second of the scale levels may include a second length greater than the first length. Each encode expression of the second of the scale levels may include one or more of the encode expressions of the first of the scale levels. A context of the first of the scale levels may have a contain/nest (contained) spatial relation to a context of the second of the scale levels.

Abstract: Embodiments of the present invention provide efficient and dynamic systems and methods for building a hybrid road network and grid based spatial temporal index to handle big trajectory data. Embodiments of the present invention can be used to satisfy the issue of low indexing and compression rate of big trajectory data, and to improve the efficiency of index queries, while also providing a mechanism to account for missing road links in a map.

Abstract: A method for scheduling MapReduce tasks includes receiving a set of task statistics corresponding to task execution within a MapReduce job, estimating a completion time for a set of tasks to be executed to provide an estimated completion time, calculating a soft decision point based on a convergence of a workload distribution corresponding to a set of executed tasks, calculating a hard decision point based on the estimated completion time for the set of tasks to be executed, determining a selected decision point based on the soft decision point and the hard decision point, and scheduling upcoming tasks for execution based on the selected decision point. The method may also include estimating a map task completion time and estimating a shuffle operation completion time. A computer program product and computer system corresponding to the method are also disclosed.

Abstract: An embodiment of the present invention provides a method for storing trajectory. The method includes: mapping, based on a plurality of positions on a trajectory of an entity, the trajectory to at least one road segment in a road network; identifying an entry point and an exit point of one of the road segments, wherein the entry point is a point where the entity starts traveling along the road segment, and the exit point is a point where the entity ends traveling along the road segment; and storing data related to at least one of the entry point and the exit point, to store the road segment as a part of information of the trajectory.