Abstract: Methods, systems, and computer-readable storage media for event-triggered reassignment of time-limited resources. Implementations include actions of receiving an event indicator, determining a particular demand and associated particular time-limited resources based on the event indicator, identifying, for the particular demand, one or more first candidate demands in an assignment plan, the assignment plan including a plurality of demands associated with a plurality of time-limited resources, each first candidate demand and associated time-limited resources satisfying one or more constraints defined by the particular demand and associated particular time-limited resources, determining whether at least one of the first candidate demands has not been processed, and performing an action based on a result of determining whether at least one of the first candidate demands has not been processed.

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: A request handler may receive transaction requests for transactions to be executed using data of a database, and may classify a first transaction request of the transaction requests as a simple transaction request, and a second transaction request of the transaction requests as a complex transaction request. A key-value store engine may execute a first transaction satisfying the first transaction request, using a key-value store of pre-calculated results determined prior to receipt of the first transaction request, and based on the data, and may update a key-value delta reflecting a change, if any, of the key-value store caused by the first transaction. A relational store engine may cause the at least one processor to execute a second transaction satisfying the second transaction request, using a relational store including a subset of the data, and may update a relational delta reflecting a change, if any, of the relational store caused by the second transaction.

Abstract: A query collector may be configured to receive a plurality of queries applied by a search engine to obtain corresponding search results. A graph manager may be configured to generate, based on the plurality of queries, a directed graph of nodes, each node corresponding to at least one query and connected to another node, and further configured to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, and generate at least one representative query representing the merged node. A suggestion generator may be configured to match a current query with a matching node of the nodes, determine that the merged node is a successor node of the matching node within the directed graph, and provide the at least one representative query as a suggested query for a future search to be conducted by the search engine.

Abstract: An incident handler receives a plurality of incident reports, each incident report characterizing an incident occurring within a geographical area. An incident model generator generates an incident model, based on, for each incident, an occurrence time window and an occurrence area within the geographical area. An incident estimator receives a new incident report characterizing a new incident occurring within the geographical area and recorded within a plurality of media files captured by at least one media capture device, the new incident report including a new occurrence time window and new occurrence area. The incident estimator further prioritizes the plurality of media files, based on the incident model, the new occurrence time window, and the new occurrence area, in an order corresponding to a likelihood of inclusion of the new incident therein. A media manager selects and sorts the prioritized media files for ordered playback thereof.

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: A computer system includes at least one processor and at least one memory operably coupled to the at least one processor. The memory includes a memory pool and a database partitioned into multiple fragments. Each of the fragments is allocated a block of memory from the memory pool and the fragments store compressed data in a columnar table format. A database operation is applied in a compressed format to the compressed data in at least one of the fragments.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for managing context aware recommendations by providing recommendations to a user in response to a query related to the user by integrating contextual information of a context related to the user in a recommendation model while considering a granular structure of the context and the contextual information thereof.

Abstract: Disclosed herein are technologies for providing recommendations as to particular products and/or services that are customer specific and general, based on customer preference and inquiry. The recommendations are provided as part of an online shopping system. In accordance with one aspect, an item query is received from a customer, and analyzed by a query analyzer to determine if the query is a general item query or a specific item query. A search may be performed for items based on the item query in an items database listing items offered for purchase. If the query is the general item query, customer preference is determined from results of the search. If the query is the specific item query, the items from the results of the search are grouped based on cost performance. The items of the search result are ranked and provided to the customer.

Abstract: Disclosed herein are technologies for demand management by providing a real time prediction model, using an elasticity matrix to quantify price change and demand, group customers based on their demand, set pricing per each group of customers, and optimize distribution. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

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

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: Disclosed herein are technologies related to an optimization of project resource management of projects having multiple resource types and cost structures. One or more the technologies involves optimizing a project based, at least in part, on project data and related resource data using successive genetic operations and evaluations and further producing a resource-acquisition plan for the optimized project.

Abstract: Disclosed herein are technologies related to infrastructure investment planning for short-term and long-term capacity demands. One or more of the described technologies involve solving rent-or-buy optimization for real world infrastructure investment planning. Such technologies utilize forecasting, predictive analysis and dynamic programming. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: The present disclosure describes methods, systems, and computer program products for finding a best location scheme for a set of interactional objects in a constrained geographical area. A geographic region representing a wind farm is partitioned into a plurality of lattices. Initial chromosomes are generated, where a particular chromosome is a binary series used to represent the presence of a wind turbine in a layout of the plurality of lattices. A cost associated with each wind turbine associated with the initial chromosomes is evaluated. Parent chromosomes are selected for a genetic operation, and following the genetic operation, a cost associated with each wind turbine if evaluated. The parent chromosomes are updated using a fitness value.

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 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: A framework for optimized service facility placement is provided. Load constraints of each service facility are factors of the overall optimization. In various implementations, one or more iterative algorithms are used in the optimization of efficient facility placement.

Abstract: A system and method provide optimized resource planning and allocation. Various constraints of each resource are factors of the overall optimization. In various implementations, one or more iterative algorithms are used in the optimization for efficient resource allocation.

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