G06F7/36

Mobile user interface for displaying heterogeneous items interleaved by common data type

An embodiment may involve: transmitting a first graphical user interface (GUI) that allows selection of a plurality of item streams for a mobile user interface; receiving a selection of a first item stream; transmitting a second GUI, where the first item stream is populated from a first database table and the second GUI allows selection of a first field from the first database table; receiving a selection of a second item stream; transmitting the second GUI, where the second item stream is populated from a second database table and the second GUI allows selection of a second field from the second database table, where the first and second fields are of a common type; and transmitting, to a mobile device, the mobile user interface with items from the first and second item streams sorted according to values in the first and second fields.

HEALTH TRACKING SYSTEM WITH VERIFICATION OF NUTRITION INFORMATION
20170286639 · 2017-10-05 ·

A health tracking system includes a plurality of health tracking devices in communication with a host server. In one embodiment, a method of operating the system comprises: receiving data relating to consumables from user devices; storing the data as data records; grouping the data records into groups based on a description string of each; determining an individual score to associate to each data record; and applying an identifier to one of the data records in each group, the one of the data records comprising a one associated with a high score relative to the remaining ones of the data records in the group.

INCREASING RADIX SORTING EFFICIENCY UTILIZING A CROSSOVER POINT
20170286459 · 2017-10-05 ·

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

MEMORY DEVICE AND MEMORY SYSTEM
20170242632 · 2017-08-24 ·

A memory device includes a memory cell array including a plurality of memory cells on which a programming loop is executed a plurality of times; a voltage generator configured to apply a verifying voltage to the memory cells, for verifying at least one programming state of the memory cells; and a voltage controller configured to control the voltage generator to change a level of the verifying voltage as a program loop count increases, based on temperature information about a temperature inside or outside the memory device.

MEMORY DEVICE AND MEMORY SYSTEM
20170242632 · 2017-08-24 ·

A memory device includes a memory cell array including a plurality of memory cells on which a programming loop is executed a plurality of times; a voltage generator configured to apply a verifying voltage to the memory cells, for verifying at least one programming state of the memory cells; and a voltage controller configured to control the voltage generator to change a level of the verifying voltage as a program loop count increases, based on temperature information about a temperature inside or outside the memory device.

Merging and sorting arrays on an SIMD processor

Methods, systems, and articles of manufacture for merging and sorting arrays on a processor are provided herein. A method includes splitting an input array into multiple sub-arrays across multiple processing elements; merging the multiple sub-arrays into multiple vectors; and sorting the multiple vectors by comparing and swapping one or more vector elements among the multiple vectors.

Dynamic content presentation

A method includes receiving a first request from a first user device for first data, where the first request identifies a first data source and sending a first data access request to the first data source, where the first data access request is based on a first reader object associated with the first data source. The method also includes receiving the first data from the first data source, where the first data has a first format, and transforming the first data to normalized data in a normalized format based on the first reader object. The method further includes selecting a first presentation object from a database comprising a plurality of presentation objects based on a first device type of the first user device and transforming the normalized data to output data in an output format based on the first presentation object.

Dynamic content presentation

A method includes receiving a first request from a first user device for first data, where the first request identifies a first data source and sending a first data access request to the first data source, where the first data access request is based on a first reader object associated with the first data source. The method also includes receiving the first data from the first data source, where the first data has a first format, and transforming the first data to normalized data in a normalized format based on the first reader object. The method further includes selecting a first presentation object from a database comprising a plurality of presentation objects based on a first device type of the first user device and transforming the normalized data to output data in an output format based on the first presentation object.

Parallel, low-latency method for high-performance speculative globally-large element extraction from distributed, sorted arrays

The present invention provides a system and method for extracting elements from distributed arrays on a parallel processing system. The system includes a module that populates a result array with globally largest elements from input arrays, a module that generates a partition element, a module that counts the number of local elements greater than the partition element, and a module that determines the globally largest elements. The method for extracting elements from distributed arrays on a parallel processing system includes populating a result array with globally largest elements from input arrays, generating a partition element, counting the number of local elements greater than the partition and determining the globally largest elements.

Parallel, low-latency method for high-performance speculative globally-large element extraction from distributed, sorted arrays

The present invention provides a system and method for extracting elements from distributed arrays on a parallel processing system. The system includes a module that populates a result array with globally largest elements from input arrays, a module that generates a partition element, a module that counts the number of local elements greater than the partition element, and a module that determines the globally largest elements. The method for extracting elements from distributed arrays on a parallel processing system includes populating a result array with globally largest elements from input arrays, generating a partition element, counting the number of local elements greater than the partition and determining the globally largest elements.