Abstract: An association rule accelerator may be used to access a transaction database storing a plurality of transactions, each transaction including one or more items. The association rule accelerator also may select a sampling rate based on an item frequency of frequent items within the transaction database, relative to a sampled item frequency of sampled items within a corresponding sampled transaction database. An an association rule selector may determine, using the selected sampling rate and corresponding sampled transaction database, frequent item sets within the sampled transactions, and may further determine an association rule relating at least two items of the sampled transactions, based on the frequent item sets.

Abstract: In an example, a method for determining quantities of fuel to dispense at a plurality of terminals along a transit route of a vehicle includes identifying a plurality of terminals along the transit route, each terminal of the plurality of terminals have an associated cost-per-unit of fuel dispensed; initializing a set of candidate fueling scenarios, each candidate fueling scenario including an initial array of values, each value in the array of values indicating a quantity of fuel to dispense to the vehicle at one of the plurality of terminals along the transit route; iteratively, using at least one processor, modifying the set of candidate scenarios; identifying the candidate scenario of the set of candidate scenarios with the lowest total fuel cost; and transmitting for display, the quantity of fuel to dispense at each of the plurality of terminals according to the identified lowest total fuel cost candidate scenario.

Abstract: Methods, systems, and computer program products for logistics management are described. A root node in a tree representing a home base may be established, the root node comprising a capacity of a corresponding delivery vehicle. One or more unassigned delivery points may be added as a child node of the root node if a path to the corresponding unassigned delivery point is feasible. A next level delivery point may be added as a child node of a node in a tree levelindex if the delivery point is unassigned and a path to the next level delivery point is feasible. The adding step may be repeated for each combination of unassigned delivery point and node(s) in the tree levelindex.

Abstract: A method of assigning web service requests to service providers includes searching for an optimal assignment from all possible assignments using a genetic algorithm (GA) that represents possible assignments as chromosomes, and converging towards an assignment of web service request to service providers that maximizes overall business value for all workflows to the service providers. An adaptive mutation scheme is used to introduce mutation into populations of chromosomes. The mutation scheme includes a mutation rate that increases when chromosomes under evaluation fail to improve its workload against the metric over a certain number of generations.

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

Abstract: The method includes selecting a target record from a dataset, the target record including a missing value, partitioning records of the dataset into at least two groups including co-related data, the partitioned records including records having a value for a same field as the missing value in the target record, predicting the missing value based on a relationship between fields in each of the at least two groups associated with the partitioned records, and setting the missing value of the target record to the predicted value.

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: 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: Example systems and methods of assigning shipping orders to delivery vehicles are presented. In one example, a delivery region may be segmented into delivery blocks. A shipping order density may be determined for each of the delivery blocks. Adjacent delivery blocks having corresponding shipping order densities may be merged to yield delivery areas. A cost of using each type of available delivery vehicle to transport a delivery job may be determined relative to a cargo capacity of the vehicle type, a delivery distance, and a shipping order density. Each of the delivery areas may be partitioned into delivery jobs based on the cost of using each of the vehicle types. Each of the delivery jobs may be assigned to one of the available delivery vehicles based on minimizing a total cost of using the vehicles to transport the delivery jobs.

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: A system may include a similarity measurement processing unit configured to determine a plurality of similar users that are similar to a user based on similarity values including calculating the similarity values for pairs of users based on an importance vector and differences between rated items. The importance vector may include importance values corresponding to a plurality of items, and each importance value may represent a similarity importance of a corresponding item. Each similarity value may represent a level of similarity between the user and another user. Also, the system may include a rating processor configured to estimate a rating value of an unrated item for potential recommendation based on recommendations from the plurality of similar users, and provide a recommendation for the item based on the rating value.

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

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: In accordance with aspects of the disclosure, systems and methods are provided for managing promotion scheduling by generating a promotion sales plan for scheduling promotion events within one or more time intervals based on potential promotion sales strategies for use with one or more products within the one or more time intervals while considering constraints related to the historic sales data for each product.

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