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: Embodiments include a system, method, and computer program product for foreign organization name matching. Aspects include receiving a first entity name from a first database configured in a first language and receiving a second database, wherein the second database includes a plurality of entity names in a second language, wherein the first and second languages are different. Aspects also include performing an Internet search based on the first entity name, wherein a language setting of the Internet search is configured to the second language and identifying a list of candidate names based on a set of results from the Internet search. Another aspect includes filtering the list to obtain a resulting candidate name and determining whether the resulting candidate name matches one of the entity names in the second database. Aspects include associating the first entity name and a matching entity name in the second database based on the determination.

Abstract: A system, method and computer program product for retrieving trajectory data from huge datasets. In the method, there is received, at a processor device, a user query including a request for displaying trajectory data at a user device. From the user query, a query type and a current map visualization scale setting (mapscale) for visualizing the trajectory data on the user device display is determined. Then, responsive to a user query type and the determined mapscale setting, a corresponding reference level is selected. Based on the selected reference level, there is accessed from a memory storage device a data set of compressed trajectory data. This compressed trajectory data set is communicated to the user device, for presentation on the user device display. In one aspect, the system and method is adaptive, enabling storage and retrieval of trajectory data according to various degrees of visualization or granularity.

Abstract: Embodiments include a system, method, and computer program product for foreign organization name matching. Aspects include receiving a first entity name from a first database configured in a first language and receiving a second database, wherein the second database includes a plurality of entity names in a second language, wherein the first and second languages are different. Aspects also include performing an Internet search based on the first entity name, wherein a language setting of the Internet search is configured to the second language and identifying a list of candidate names based on a set of results from the Internet search. Another aspect includes filtering the list to obtain a resulting candidate name and determining whether the resulting candidate name matches one of the entity names in the second database. Aspects include associating the first entity name and a matching entity name in the second database based on the determination.

Abstract: Embodiments include a system, method, and computer program product for foreign organization name matching. Aspects include receiving a first entity name from a first database configured in a first language and receiving a second database, wherein the second database includes a plurality of entity names in a second language, wherein the first and second languages are different. Aspects also include performing an Internet search based on the first entity name, wherein a language setting of the Internet search is configured to the second language and identifying a list of candidate names based on a set of results from the Internet search. Another aspect includes filtering the list to obtain a resulting candidate name and determining whether the resulting candidate name matches one of the entity names in the second database. Aspects include associating the first entity name and a matching entity name in the second database based on the determination.

Abstract: The present disclosure relates to a method and system for generating a road network. An embodiment of the present invention provides a method comprising: identifying a target area to be refined in a road network skeleton; and refining the target area using at least one trajectory associated with the target area to generate the road network. Another embodiment of the present invention provides a corresponding system.

Abstract: A mechanism is provided for controlling the internal air-quality of a vehicle. Responsive to determining that a speed of a vehicle fails to be above the predetermined low-speed threshold, a determination is made as to whether an internal air-quality from an internal air-quality sensor is better than the external air-quality from an external air-quality sensor. Responsive to the internal air-quality being better than the external air-quality, a ventilation control mechanism is signaled to utilize a recirculating-air mode, wherein the ventilation control mechanism either stays in an already initiated recirculation-air mode or switches to the recirculating-air mode. Responsive to the internal air-quality being worse than the external air-quality, the ventilation control mechanism is signaled to utilize a fresh-air mode, wherein the ventilation control mechanism either stays in an already initiated fresh-air mode or switches to the fresh-air mode.

Abstract: A method for evaluating fraudulent data in a Usage Based Insurance (UBI) system, includes retrieving trip data for a driver from a database. A processor on a computer determines tough context incidents in the trip data. Driving behavior of the driver during said tough context incidents is compared with driving behavior of other drivers during similar tough context incidents. The trip data is identified as potentially fraudulent if the driver's driving behavior is better by a predetermined amount compared to the other drivers' driving behavior.

Abstract: Location based on call detail record. The method includes: acquiring handover call detail record (HCDR) data and handover (HO) data corresponding to at least one cell transfer during a call; The HCDR data can include a start time, an end time, passed cells during the call; The HO data can include the HO time for each pair of adjacent cells among the passed cells during the call. The method can further include estimating the location of the subscriber based on the HCDR data and the HO data.

Abstract: A method and apparatus for vehicle position indexing. The method includes: obtaining position information of a vehicle in real time, and monitoring a current road segment where the vehicle is located based on the position information and road segment information divided by road network information; in response to having monitored that the vehicle enters into the current road segment, building a road segment index record that includes identification information of the vehicle, identification information of the current road segment, and a time when the vehicle enters into the current road segment; and in response to having monitored that the vehicle leaves the current road segment, adding the time when the vehicle leaves the current road segment, into the road segment index record.

Abstract: A mechanism is provided in a data processing system for precision adaptive trajectory query plan optimization. The mechanism identifies precision needs based on query instances and maps trajectory point data to the precision needs to form a precision support skeleton data structure. The mechanism generates an optimized query plan and executes the optimized query plan on the precision support skeleton data structure to identify at least one passing trajectory that passes the query. The mechanism then queries the trajectory point data for the at least one passing trajectory.

Abstract: A method and apparatus for generating a training model based on feedback are provided. The method for generating a training model based on feedback, includes calculating an eigenvector of a sample among a plurality of samples; obtaining scores granted by a user for one or more of the plurality of samples in a round, obtaining scores granted by the user for a first number of samples; obtaining scores granted by the user for a second number of samples in response to detecting, based on the eigenvector, an inconsistency between the scores granted by the user for the first number of samples; and generating a training model based on the scores granted by the user for the first and second numbers of samples. A corresponding apparatus is also provided.

Abstract: A method and apparatus for estimating a wave velocity of negative pressure wave in a fluid transportation pipeline. The method including: receiving a plurality of pressure signals from a plurality of sensors; determining time differences produced by the negative pressure wave reaching the adjacent sensors based on the received pressure signals; determining a wave source sensor segment where a wave source of the negative pressure wave is located; and estimating the wave velocities of the negative pressure wave in a non-wave source sensor segment and the wave source sensor segment.

Abstract: Dispatching messages in a moving object, in one aspect, may include receiving a description of a spatial area. A hierarchical tree representation of the spatial area may be generated. The hierarchical tree representation may comprise nodes, wherein a child node represents a sub-region of a region represented by a parent node of the child node. Moving features may be associated with each of the nodes, the moving features comprising whether the node is cacheable, whether the node covers an unpartitioned area, an active object list in an area covered by the node, and a latest position associated with an object in the active object list. Data from the moving object may be dispatched based on the hierarchical tree representation.

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: 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: 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 recommending a candidate path includes, in response to receiving a query from a user, looking up a plurality of paths that conform to the query; with respect to a current path among the plurality of paths, obtaining behavior data of the user and behavior data of at least one other user associated with the current path; determining a recommendation indicator associated with the current path, based on the behavior data of the user and the behavior data of the at least one other user; and recommending the candidate path to the user based on at least a recommendation indicator associated with at least one of the plurality of paths.

Abstract: Simplification of trajectory representation is provided. Trajectories represented by a set of points on a map are obtained. Common route elements are identified for the trajectories based on the set of points. Each of the common route elements represents a geospatial area in which at least a predetermined number of the trajectories are identical. Simplified representations of the trajectories are generated based on the identified common route elements.