Abstract: 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.

Abstract: A framework for intelligent memory replacement of loaded data blocks by requested data blocks is provided. For example, various factors are taken into account to optimize the selection of loaded data blocks to be discarded from the memory, in favor of the requested data blocks to be loaded into the memory. In some implementations, correlations between the requested data blocks and the loaded data blocks are used to determine which of the loaded data blocks may become candidates to be discarded from memory.

Abstract: Techniques are described for forming a machine learning model vector, or just model vector, that represents a weighted combination of machine learning models, each associated with a corresponding feature set and parameterized by corresponding model parameters. A model vector generator generates such a model vector for executing automated machine learning with respect to historical data, including generating the model vector through an iterative selection of values for a feature vector, a weighted model vector, and a parameter vector that comprise the model vector. Accordingly, the various benefits of known and future machine learning algorithms are provided in a fast, effective, and efficient manner, which is highly adaptable to many different types of use cases.

Abstract: The embodiments provide a system for decision-making criteria-based recommendations. The system may include a decision engine configured to receive a request for recommendations for an option problem associated with a product or service category, and determine options among a plurality of options for the product or service category based on preference information. The preference information may include activated decision-making criteria and corresponding weight values. The corresponding weight values may represent a relative importance of each activated decision-making criterion. The decision engine may be configured to determine options among the plurality of options including calculating scores for the plurality of options based on, in part, the activated decision-making criteria and the corresponding weight values and selecting the options among the plurality of options based on the calculated scores.

Abstract: A method of manufacturing at least a first product and a second product with at least a first machine and a second machine at minimum cost in an environment in which a cost of energy used by the first machine and the second machine varies as a function of time may include generating multiple chromosomes, determining fitness scores of each of the chromosomes, randomly generating, with probabilities based on the fitness scores, new chromosomes, determining fitness scores of the new chromosomes, selecting one of the new chromosomes with an optimal fitness score, and manufacturing at least the first product and the second product with at least the first machine and the second machine according to a schedule based on the selected new chromosome.

Abstract: 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.

Abstract: The present description provides data analysis to provide highly individualized recommendations for users. The recommendations received by a user will include a combination of frequent recommendations and occasional recommendations. The frequent recommendations refer to recommendations made for the same product or type of product repetitively across multiple sets of recommendations, while the occasional recommendations recommend a given product or type of product only rarely across the multiple sets of recommendations. The described techniques and systems automatically determine, through data analysis, which products should be considered frequent and which should be occasional, as well as which products should not be recommended at all (blacklisted). Moreover, when generating a given recommendation set, the described techniques and systems automatically determine an optimal or near-optimal ratio of frequent/occasional recommendations.

Abstract: A query analyzer may be used to identify a plurality of queries and associated query characteristics, the query characteristics including a corresponding dataset of data units for each query, wherein the data units are to be loaded from an offline memory into a memory of an in-memory database. Then, a sequencer may be used to select a selected dataset for loading into the memory of the in-memory database, based on dependencies between the plurality of queries as included within the query characteristics, and on relationships, if any, between the datasets.

Abstract: 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.

Abstract: The present disclosure involves systems, software, and computer implemented methods for mutual reinforcement of edge devices with dynamic triggering conditions and/or computation frequencies. In one example, a first edge device in multiple edge devices in an Internet of Things (IoT) system monitors at least a first parameter. The first edge device determines whether a first condition from one set of conditions is satisfied based on at least the monitored first parameter. In response to determining that the first condition is satisfied, the first edge device automatically transmits a signal to a second edge device in the multiple edge devices to initiate or stop monitoring of a second parameter by the second edge device.

Abstract: The present description provides data analysis for machine maintenance scheduling. For example, dynamic maintenance intervals are assigned for each machine being scheduled. Then, a system is provided for implementing a particle swarm optimization for finding an optimized maintenance schedule. In the optimization, an objective function is defined for maximizing production while minimizing relative maintenance cost.

Abstract: 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.

Abstract: A computer system for controlling operation of a vehicle travelling from a starting location to a target location includes a memory and a semiconductor-based processor forming one or more logic circuits configured to generate a travel itinerary by selecting different highway segments on a map for the vehicle to drive over at respective speeds from the starting location to the target location subject to an arrival time deadline for arriving at the target location. Each of the highway segments has a distance that can be driven at the respective speed in less than a continuous driving time limit. The computer system sends the travel itinerary to a vehicle operator to drive the vehicle over the different highway segments with instructions to make a stop at the end of each highway segment to stay below the continuous driving time limit.

Abstract: Techniques are provided for rendering network applications in a highly-customized manner, in which, for example, user interactions with one or more network applications using devices having different screen sizes are analyzed and used to assign user preferences and priorities with respect to the one or more network application(s). In this way, users may be provided with desired and useful content in a convenient manner, while application providers may have their content rendered in a manner that increases a likelihood of achieving an intended result (e.g., consummating a sale or other transaction, or eliciting some other desired reaction from the user).

Abstract: Techniques for managing display of content include identifying a document to present to a user on a graphical user interface (GUI); extracting at least one property of the document, the property including metadata associated with the document; determining a correlation between the document and one or more document topics associated with the user; determining an amount of time to display a portion of the document to the user through the GUI based at least in part on the property and the correlation; and displaying the portion of the document to the user through the GUI for the determined amount of time.

Abstract: 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.

Abstract: Disclosed herein are technologies for quantitative evaluation and optimization of user interface and software design. In one implementation, a design step in a software process is chosen. The software process may be evaluated with different design elements, and time penalties for the different design elements may be determined during the evaluation. A design element of the design step may then be changed to one of the different design elements with the lowest time penalty.

Abstract: 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.

Abstract: A computer system utilizes substitutable assets as substitutes to fulfill orders for specific assets. The computer system includes a memory and a semiconductor-based processor forming one or more logic circuits. The logic circuits are configured to predict acceptability of different asset types of the substitutable assets as substitutes for the specific assets requested in each of the orders, select a pool of to-be-allocated assets including acceptable substitutable assets for the orders, and allocate selected assets from the pool to fulfill each of the orders according to a multi-objective vector optimization solution.

Abstract: The method includes determining an assignment completion time distribution based on a task set defining a project, determining a project completion time distribution based on the assignment completion time distribution and the task set, determining a project cost based on assignments of the task set, and generating a list of project task assignments based on the project cost and the project completion time distribution.