Sap Se

Mengjiao Wang

Wen-Syan Li

Yu Cheng

Philippe Nemery

The present disclosure relates to a computer system comprising a database including, a reallocation scheduling module, the reallocation scheduling module configured to obtain an objective function including one or more integer-valued decision variables and automatically determine a proposed reallocation scheme for each of one or more items between a plurality of locations based on the objective function, wherein determining the reallocation scheme includes finding values of one or more decision variables that optimize the objective function while obeying the one or more constraints, wherein determining a proposed reallocation scheme includes solving an integer quadratic programming problem.

Efficient computerized calculation of resource reallocation scheduling schemes

A recommendation system for generating location recommendations for drivers of public service vehicles is disclosed. The system segments a map of an area of interest into segments or regions and analyzes historical call data to estimate demand in the regions. The analysis also determines values of the calls in the regions. For example, the analysis estimates the probability of the calls and values of such calls in each region. The analysis may include time patterns to improve accuracy of the estimation. By using the results of the analysis along with current information, such as current location of a vehicle, current time, and real-time traffic information, a holding location recommendation is generated.

Dynamic location recommendation for public service vehicles

Disclosed herein is a framework for determining a service provider to service a customer request. In accordance with one aspect, a request from a customer is received by a decision module. The decision module further receives a response to the request from a first service provider, determines the average frequency of responses for a given time interval during the time and location of the request, estimates arrival time of the first service provider and near-by service providers to the location of the customer, ranks all service providers based on arrival time, and estimates a probability of a shorter customer wait time.

System and method for intermediary agency to find better service providers

In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources.

Production resource management using genetic algorithm

A candidate position selector determines locations for M candidate positions along pathways within an area defining potential routes for moving objects within the area. A coverage rate calculator calculates a coverage rate for a device layout of N media capture devices among the M candidate positions, including calculating the coverage rate as a ratio of the moving objects captured by the N media capture devices in the device layout to a total number of the moving objects in the area within a defined period of time. A layout selector iteratively tests different device layouts of the N media capture devices among the M candidate positions, based on corresponding coverage rates calculated by the coverage rate calculator for each tested device layout, until a termination condition is reached and a final device layout of the tested device layouts is selected.

Device layout optimization for surveillance devices

Software techniques are described for optimizing resource assignments among assignees of those resources, by using dynamic priority updating over a plurality of rounds of resource assignment. In particular, in example implementations, a greedy algorithm is used to optimize the resource assignments over multiple rounds based on ranked selections within each selection set of each assignee, including dynamically updating the priority of the assignees at each round, based on assignment results from one or more preceding assignment rounds.

Multi-period assignment optimization using dynamic priority updating

A framework for clustering is described herein. In accordance with one aspect, a data set having x number of objects, and preference information of a user is provided to a clustering tool. The clustering tool may calculate preference degrees between objects in the data set. In addition, similarity measures of objects in the data set may be calculated. Clusters of objects may then be generated from the data set.

Framework for ordered clustering

A failover manager may be configured to determine a plurality of tenants executable on a server of a plurality of servers, each tenant being a virtual machine executable on the server in communication with at least one corresponding user. The failover manager may include a replicated tenant placement selector configured to dispatch a first replicated tenant for a first tenant of the plurality of tenants to a first standby server of the plurality of servers, and configured to dispatch a second replicated tenant for a second tenant of the plurality of tenants to a second standby server of the plurality of servers. The failover manager also may include a replicated tenant loader configured to activate, based on a failure of the server, the first replicated tenant on the first standby server to replace the first tenant, and the second replicated tenant on the second standby server to replace the second tenant.

Distributed failover for multi-tenant server farms based on load times of replicated tenants

A priority request handler may receive a priority request to associate a priority label with a sensed data file, the sensed data file being included within a time series of sensed data files received from a plurality of sensors. A queue manager may then store the sensed data file within a priority queue in association with the priority label, and independently of a temporal order of a time series of sensed data files. The queue manager may thus retrieve the sensed data file from the priority queue, based on the priority label, for processing thereof to obtain a sensed data record.

Large-scale processing and querying for real-time surveillance

In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster.

Migration event scheduling management

A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described. Network demand information is obtained. The network demand information may include a network graph and information related to an outbound demand of each node of the network graph. A simplified demand graph based on the outbound demand of each node and a distance between each node pair is generated. A plurality of return routes for the simplified network graph is generated and a payload delivery capacity of each of the routes is calculated. An advised return route from the plurality of return routes is generated based in part on the payload delivery capacities of the plurality of return routes.

Methods and systems for routing selection based on routing distance and capacity

Techniques of dynamic path optimization are disclosed. In some embodiments, a method comprises receiving an instruction to determine an optimal path from a source geographical location to a destination geographical location, and determining an optimal path from the source geographical location to the destination geographical location using corresponding historical traffic information for each one of a plurality of sub-paths. The historical traffic information for each sub-path may correspond to an estimated arrival time at a start location for the corresponding sub-path and be used to select sub-paths from the plurality of sub-paths. The selected sub-paths may define the optimal path. In some embodiments, the historical traffic information comprises an indication of traffic flow for the corresponding sub-path. In some embodiments, the indication of traffic flow comprises an average speed of traffic flow.

Growing community of inventors

Shanghai, China

Mengjiao Wang