Abstract: A method, computer program product, and computer system for clustering data objects. Data objects are accessed. The data objects are sorted. The data objects are transformed into binary words. The binary words are encoded into blocks, using the sorted data objects. Block clusters are generated from the blocks. The block clusters are converted into word clusters. For each word cluster, the word cluster is reconfigured into L word clusters in a manner that minimizes a total number of binary word deviations in the L word clusters, wherein L is at least 1.

Abstract: An embodiment for improved insight discovery using combinatorial low-dimensional clustering. The embodiment may detect a set of data point key performance indicators (KPIs) from one or more statistical or machine learning domain spaces. The embodiment may generate clusters including a series of binary vectors corresponding to the detected set of data point KPIs, wherein neighboring binary vectors having a mutual Mahalanobis distance below a threshold value are clustered together. The embodiment may generate weighted binary matrix representations of the generated clusters The embodiment may perform insight discovery by identifying data point intersections within the generated weighted binary matrix representations.

Abstract: An exemplary embodiment uses a novel adaptation of a tree splitting algorithm applied to Radio Frequency (RE) tagging technology to identify many tags in the RF field of a base station. The embodiment uses the tree splitting algorithm to identify a single tag in a field of a plurality of radio frequency tags. Once the single tag is identified, the identified tag is placed in a Data_Exchange state where the base station can access data from the tag memory by using information that identifies the tag.

Abstract: A system and method is disclosed for selecting certain subgroups of radio frequency (RF) tags for querying, communicating, and/or identifying by a base station. The base station sends commands to a group tags within a RF field of the base station. The tags use control logic to determine whether or not they meet certain criteria sent out by the commands. This may cause the tags to change state which either prevents or allows a given tag to participate in an identification process. In this way, a given subgroups of tags meeting certain criteria can be selected for querying, communicating, and/or identifying.

Abstract: A master entity is capable of broadcasting commands to a plurality of three-state-selection machine slaves. Transitions from one state to another are effected on instruction from commands in a sequence of commands broadcast from the master. Slaves move to another state when they satisfy a primitive condition specified in the command. By moving slaves among the three sets, a desired subset of slaves can be isolated in one of the sets. This desired subset of slaves then can be moved to one of the states that is unaffected by commands that cause the selection of other desirable subsets of slaves. In the embodiments of the incorporated U.S. Pat. No. 5,673,037, certain subgroups of radio frequency (RF) tags are selected for querying, communicating, and/or identifying by commands from a base station. Commands from the base station may cause the tags to change state which either prevents or allows a given tag to participate in an identification process.

Abstract: A Write Broadcast system and method uses a base station to write sent data to all or some selected number (sub group) of tags in a base station field simultaneously. By unselecting the tags that have been successfully written to, and requesting a response from the remaining tags in the field (or sub group), the system determines, by receiving a response to the request, that there are tags in the field (sub group) that were unsuccessfully written to. Another Write Broadcast signal is sent to these tags. The system is useful for quickly (simultaneously) “stamping” information on the tag memory of a large number of tags in the field of the base station.