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

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: A system includes an option selection engine selects an initial subset of pre-selected products from multiple products for display to a user, where the products include multiple filtering options and multiple selection criteria. An elicitation engine prompts the user to provide input including input for the filtering options and input for the selection criteria and receives the filtering options input and the selection criteria input. A ranking and scoring engine receives the filtering options input and the selection criteria input and selects one method of multiple methods to calculate a score for the products and to rank the products using the score based on the filtering options input and the selection criteria input from the user. An option selection engine selects an updated subset of products from the plurality of products for display to the user based on the rank of the of the products using the score.

Abstract: A method includes receiving an identification code for an item selected for purchase by a customer in a retail store, identifying at least one item similar to the customer-selected item, identifying at least one item related to the customer-selected item, calculating a value for a first expected profit for a first sale of the customer-selected item and the similar item, calculating a value for a second expected profit for a second sale of the customer-selected item and the related item, sorting the first sale and the second sale in an order based on the value for the first expected profit and the value for the second expected profit, and providing information associated with the first sale and the second sale, the information for use in recommending the similar item or the related item for purchase by the customer in the retail store.

Abstract: A computer-implemented method schedules production in a business' production facilities by seeking market orders for products of the business on a timeline commensurate with a temporal availability of production capacity. The method involves recommending a selling price for a forecasted order for products of the business, checking whether the business has available production capacity to produce the products in time to fulfill the forecasted order, and determining the business' minimum selling price for the forecasted order. The method further includes checking whether a competitor has available manufacturing capacity to compete for the forecasted order based on competitor-specific information on available manufacturing capacity, cost and minimum profit margin requirement. The competitor-specific information is derived from market intelligence data.

Abstract: A maintenance data collector may be used to collect maintenance data characterizing maintenance events associated with maintaining operations of a plurality of components, and a critical component identifier may be used to identify, from the plurality of components and based on the maintenance data, critical components that contribute disproportionately to production losses caused by the maintenance events. A causality analyzer may then determine causal connections between the maintenance events, based on operational dependencies between pairs of the plurality of components, and a maintenance policy generator may generate a maintenance policy governing future maintenance events for the plurality of components, based on the identified critical components and the causal connections.

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: Techniques for recommending content to a user include identifying classified public content stored on a server appliance or a repository; identifying private content of a user stored on a client appliance or a repository, the client appliance communicably coupled to the server appliance through a network; receiving, from the user, a request for a recommendation of content; generating a representative query based on the request for the recommendation of content; determining, based on the representative query, a portion of the classified public content stored on a server appliance or the repository; determining, based on the request, a portion of the private content stored on the client appliance or the repository; and preparing, for presentation to the user, the portion of the classified public content based on the representative query and the portion of the private content based on the request for the recommendation of content.

Abstract: This disclosure generally relates to devices, systems, and computer-implemented methods for simulating flights. Specifically, methods are described that comprise the operations of receiving flight information for one or more flights to be simulated; receiving historical flight information for historical flights; determining, based on the flight information and the historical flight information, probabilities for one or more flight parameters of the one or more flights to be simulated; determining a current state of the one or more flights to be simulated based on the determined probabilities for the one or more flight parameters; determining a next state of the one or more flights to be simulated based on the current state; and outputting one or more evaluation parameters associated with the next state of the one or more flights to be simulated.

Abstract: According to an aspect, a system includes transportation module configured to generate a transportation plan for packages scheduled to be routed through a regional logistics network such that the transportation plan minimizes transportation costs. The transportation module may include a pickup plan module, a depot-to-depot plan module, and a delivery plan module. The pickup plan module may be configured to compute a pickup transportation plan for packages to be picked-up from the customers in the customer area of an origin depot. The depot-to-depot plan module may be configured to compute a depot-to-depot transportation plan for packages transferred between the origin depot and a destination depot. The delivery plan module may be configured to compute a delivery transportation plan for delivering packages from the destination depot to the customers within the customer area of the destination depot.

Abstract: A system for forecast modeling includes at least one processor and at least one database that is operably coupled to the at least one processor. The database includes a time series data module that is configured to store time series data for a domain, an exogenous data module that is configured to store exogenous data associated with multiple exogenous factors and a feedback module that is configured to collect and store feedback data from multiple online users, where the feedback data is related to the exogenous data and the exogenous factors. The system includes a data pre-processor module that is configured to use the at least one processor to identify and select a portion of the exogenous factors using the feedback data collected from the online users for use in a forecast model in combination with the time series data for the domain.

Abstract: A classifier may be used to receive, via a website, user input associated with a product search of a user, and may be further used to identify a plurality of filters associated with the product search and predict a user-specific subset of the plurality of filters. Then, a filter manager may be used to provide a webpage of the website to the user, based on the user-specific filter subset.

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: In accordance with aspects of the disclosure, systems and methods are provided for capacity planning management by generating a capacity expansion plan for a plurality of production resources used to produce one or more products relative to one or more time intervals. The systems and methods may include evaluating production patterns for each production resource to determine a production capacity within each time interval, evaluating budget patterns for each production resource to determine a production cash flow within each time interval, generating one or more potential capacity expansion forecasting schemes for each production resource and production budget based on the production patterns for each production resource and the budget patterns for each production budget, and generating the capacity expansion plan within each time interval based on the one or more potential capacity expansion forecasting schemes for each production resource and production budget.

Abstract: The embodiments provide a system for maximizing information gain for messages. The system may include an information processing unit configured to receive a plurality of messages having a plurality of attributes, and an integrated optimizer configured to receive an information gain model representing information gain of the plurality of messages and output a message schedule for displaying at least a subset of the plurality of messages on a display terminal including calculating a significance and display time for each of the plurality of messages using the information gain model and the plurality of attributes such that the information gain is substantially maximized. The calculated significance may determine which of the plurality of messages are included in the message schedule and the display time may provide a time period for which each message of the subset is displayed.

Abstract: A schedule manager may include a chromosome comparator configured to compare a plurality of schedule chromosomes, each schedule chromosome including a potential schedule of use of manufacturing resources within one or more time intervals in producing one or more items, and configured to compare each of the plurality of schedule chromosomes relative to constraints, to thereby output a selected subset of the plurality of schedule chromosomes. The schedule manager may include a chromosome combiner configured to combine schedule chromosomes of the selected subset to obtain a next generation of schedule chromosomes for output to the chromosome comparator and for subsequent comparison therewith of the next generation of schedule chromosomes with respect to the constraints, as part of an evolutionary loop of the plurality of schedule chromosomes between the chromosome comparator and the chromosome combiner, and a scheduler configured to select a selected schedule chromosome therefrom.

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

Abstract: The embodiments provide a federated system for supporting an application to perform analytics. The federated system includes a first distributed system for performing one or more first tasks including processing incoming data into a set of data blocks, an in-memory database system for performing one or more second tasks including receiving the set of data blocks from the first distributed system and storing the set of data blocks in an internal storage, and a second distributed system for performing one or more third tasks including receiving at least one data block of the set from the in-memory database system and performing analytics on the at least one data block. Execution of the first, second, and third tasks are controlled via a scripting language utilized by the application and associated with the in-memory database system.

Abstract: A scheduler may receive a plurality of jobs for scheduling of execution thereof on a plurality of computing nodes. An evaluation module may provide a common interface for each of a plurality of scheduling algorithms. An algorithm selector may utilize the evaluation module in conjunction with benchmark data for a plurality of jobs of varying types to associate one of the plurality of scheduling algorithms with each job type. A job comparator may compare a current job for scheduling against the benchmark data to determine a current job type of the current job. The evaluation module may further schedule the current job for execution on the plurality of computing nodes, based on the current job type and the associated scheduling algorithm.

Abstract: In accordance with aspects of the disclosure, systems and methods are provided for production scheduling management by scheduling production events for each of a plurality of production resources used to manufacture one or more products relative to one or more time intervals while considering constraints related to product dependency trees for each of the one or more products. The systems and methods may include determining the constraints related to the product dependency trees for each of the one or more products, generating one or more potential production scheduling schemes for use of each production resource within the one or more time intervals while considering the constraints related to the product dependency trees for each of the one or more products, and generating a production schedule for the production events within the one or more time intervals based on the one or more potential production scheduling schemes.