A system that includes an edge node configured to define a first set of correlithm objects for the first device and to send the first set of correlithm objects to the first device. The first set of correlithm objects includes a first correlithm object within a core distance of a root correlithm from the set of root correlithm objects. The core distance identifies the maximum number of different bits between the root correlithm object and a correlithm object. The edge node is further configured to define a second set of correlithm objects for the second device and to send the second set of correlithm objects to the second device. The second set of input correlithm objects comprises a second correlithm within the core distance of the root correlithm object from the set of root correlithm objects. The first correlithm object and the second correlithm object are different.

Features are described for improving data transmission by filtering weakly associated items in sequences of item selections. By identifying spurious relationships, data transmissions for weakly related items can be altered or suppressed. The weak relationship may be identified in existing item-to-item associations or for a set of items scheduled for transmission to a user device.

In a subscription vehicle system that enables customers to select and swap between a fleet of available vehicles, the vehicles are evaluated to identify which vehicles would be the best fit in view of a customer request and other information pertaining to the customer. The customer request and information is examined to identify particular attributes that are being sought. Based on these attributes, the available vehicles are assigned a score that reflects the level of satisfaction that the vehicle is anticipated to provide for the customer. The vehicles with the highest scores can be considered as candidates for fulfilling the customer request.

The present application discloses an article quality scoring method and device, a client, a server, and a programmable device. The method includes: obtaining browsing behavior information of a user when the user browses a target article; obtaining a browsing behavior score of the user for the target article according to the browsing behavior information and a corresponding browsing behavior coefficient; and obtaining an article quality score of the target article according to obtained browsing behavior scores of multiple users for the target article.

Methods and systems for ranking a plurality of articles for rendering on a website for a user account include receiving a request for accessing the website. Features are identified for the plurality of articles selected for rendering on the website. Each feature is associated with a value parameter having a value in a multi-dimensional vector space. A pair of solutions is identified for an article of the plurality of articles, wherein the pair of solutions identifies a portion of the multi-dimensional vector space that satisfies multiple objectives. A vector point defining the optimal solution is selected for the article from within the portion of the multi-dimensional vector space. The selected vector point is used in computing an article score for the article. The article score for the plurality of articles is used to identify and present a subset of the articles on the website for the user.

Methods and systems recommend a mutually-agreeable location to parties invited to a meeting. A method analyzes attributes of the meeting, attributes of the invited parties, and attributes of the various potential locations to prepare a list of recommended locations. To arrive at the list of recommended locations, the method may leverage all available attributes regarding the parties, the engagement type, and the potential locations, to create a value that represents a degree that a potential location correlates with the parties' attributes and meeting attributes. The set of recommended locations is sent to the invited parties. The method then determines, from party responses that each include a list of locations that are acceptable to that party, which of the recommended locations is agreed upon.

A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.

Median values for a stream of received data values in a data processing system (e.g. an image processing system) are determined. A first median value of the received data values within a first subset of data values of the received stream is determined, and intermediate data used for determining the first median value is stored. The stored intermediate data is used to determine a median value of the received data values within a second subset of data values of the received stream, wherein the second subset at least partially overlaps with the first subset. The determined median values are outputted for use in the data processing system, e.g. for further processing.

Systems and methods for recommending an item from a plurality of items. The plurality of items includes chemistry-based features. The system comprises a computing device and a database. The database includes user preference data, item data, and mapping data. The system receives user input regarding user preferences, and associates user preference values with chemistry-based feature values. The system compares chemistry-based feature values for each item to the user preference values and returns items that best match. In one embodiment, the items are wines and the system uses chemistry-based features of wines such as wine volatile chemical compounds to return wine recommendations.

A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.