Abstract: Low-level nodes (LLNs) that are communicatively connected to one another each have sensing capability and processing capability. High-level nodes (HLNs) that are communicatively connected to one another and to the LLNs each have processing capability more powerful than the processing capability of each LLN. The LLNs and the HLNs perform processing based on sensing events captured by the LLNs. The processing is performed by the LLNs and the HLNs to minimize data communication among the LLNs and the HLNs, and to provide for software-defined sensing.

Abstract: User information may be used to create a training exercise representing simulated package delivery. The user information can include metrics corresponding to physical package delivery. The user information may be used as part of a predictive model to determine the content of the training exercise, including the type and number of tasks comprising the exercise. Once created, the training exercise can be presented to a user as a graphical simulation. The presentation can occur in response to one or more triggering conditions.

Abstract: Techniques for improving image processing related to item deliveries are described. In an example, a computer system receives an image showing a drop-off of an item, the item associated with a delivery to a delivery location. The computer system inputs the image to a first artificial intelligence (AI) model. The computer system receives first data comprising an indication of whether the drop-off is correct from the first AI model. The computer system causes a presentation of the indication at a device associated with the delivery of the item to the delivery location.

Abstract: Secure multi-party information retrieval is disclosed. One example is a system including a query processor to request secure retrieval of candidate terms similar to a query term. A collection of information processors, where a given information processor receives the request and generates a random permutation. A plurality of data processors, where a given data processor generates clusters of a plurality of terms in a given dataset, where the clusters are based on similarity scores for pairs of terms, and selects a representative term from each cluster. The given information processor determines similarity scores between a secured query term received from the query processor and secured representative terms received from the given data processor, where the secured terms are based on the permutation, and the given data processor filters, without knowledge of the query term, the candidate terms of the plurality of terms based on the determined similarity scores.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating, via a processor, a set of hashes for each of a plurality of objects. The method also comprises computing, via the processor, a high-dimensional sparse vector for each object, where the vector represents the set of hashes for each object. The method further comprises computing, via the processor, a combined high-dimensional sparse vector from the high-dimensional sparse vectors for all objects and computing a hash suppression threshold. The method also comprises determining, via the processor, a group of hashes to be suppressed by using the hash suppression threshold, and suppressing, via the processor, the group of selected hashes when performing an action.

Abstract: Techniques for improving image processing related to item deliveries are described. In an example, a computer system receives image data showing a portion of a delivery location. The computer system determines an artificial intelligence (AI) model associated with the delivery location. The computer system inputs the image data to the AI model. The computer system receives an indication of whether the portion corresponds to a correct drop-off location and causes a presentation about the indication to be provided at a device.

Abstract: Examples disclosed herein involve data stream analytics. In examples herein, a data stream may be analyzed by computing a set of hashes of a real-valued vector, the real-valued vector corresponding to a sample data object of a data stream; generating a list of data objects from a database corresponding to the sample data object based on the set of hashes, the list of data objects ordered based on similarity of the data objects to the sample data object of the data stream; and updating a data structure representative of activity of the sample data object in the data stream based on the list of data objects, the data structure to provide incremental analysis corresponding to the sample data object.

Abstract: Incremental update of a neighbor graph via an orthogonal transform based indexing is disclosed. One example is a system including a hash transform module to apply an orthogonal transform to a data object in a data stream, and to associate the data object with a collection of ordered hash positions. An indexing module retrieves an index of ordered key positions, where each key position is indicative of data objects in the data stream that have a hash position at the key position. A neighbor determination module determines a ranked collection of neighbors for the data object in a neighbor graph, where the ranking is based on the index. A graph update module incrementally updates the neighbor graph by including the data object as a neighbor for a selected sub-plurality of data objects in the ranked collection.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating, via a processor, a set of hashes for each of a plurality of objects. The method also comprises computing, via the processor, a high-dimensional sparse vector for each object, where the vector represents the set of hashes for each object. The method further comprises computing, via the processor, a combined high-dimensional sparse vector from the high-dimensional sparse vectors for all objects and computing a hash suppression threshold. The method also comprises determining, via the processor, a group of hashes to be suppressed by using the hash suppression threshold, and suppressing, via the processor, the group of selected hashes when performing an action.

Abstract: Low-level nodes (LLNs) that are communicatively connected to one another each have sensing capability and processing capability. High-level nodes (HLNs) that are communicatively connected to one another and to the LLNs each have processing capability more powerful than the processing capability of each LLN. The LLNs and the HLNs perform processing based on sensing events captured by the LLNs. The processing is performed by the LLNs and the HLNs to minimize data communication among the LLNs and the HLNs, and to provide for software-defined sensing.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating, via a processor, a set of hashes for each of a plurality of objects. The method also comprises computing, via the processor, a high-dimensional sparse vector for each object, where the vector represents the set of hashes for each object. The method further comprises computing, via the processor, a combined high-dimensional sparse vector from the high-dimensional sparse vectors for all objects and computing a hash suppression threshold. The method also comprises determining, via the processor, a group of hashes to be suppressed by using the hash suppression threshold, and suppressing, via the processor, the group of selected hashes when performing an action.

Abstract: Low-level nodes (LLNs) that are communicatively connected to one another each have sensing capability and processing capability. High-level nodes (HLNs) that are communicatively connected to one another and to the LLNs each have processing capability more powerful than the processing capability of each LLN. The LLNs and the HLNs perform processing based on sensing events captured by the LLNs. The processing is performed by the LLNs and the HLNs to minimize data communication among the LLNs and the HLNs, and to provide for software-defined sensing.

Abstract: Incremental clustering of a data stream via an orthogonal transform based indexing is disclosed. One example is a system including an indexing module that retrieves a ranked neighbor list for a data object in a data stream, where the ranked list is based on an orthogonal transform based indexing of an incrementally updated nearest neighbor graph. A reverse neighbor determination module identifies a reverse neighbor list for the data object, the reverse neighbor list comprising previously received data objects that include the data object in their respective ranked lists. An evaluator determines a hub measure for the data object, where the hub measure is a size of the reverse neighbor list. A hub identification module determines, based on the hub measure, if the data object is a hub, where the hub is representative of a cluster of similar data objects.

Abstract: Storage allocation based on secure data comparisons is disclosed. One example is a system including a plurality of intermediaries, a data allocator and a plurality of storage containers. Each intermediary receives a request from the data allocator to identify a target storage container of the plurality of storage containers, for secure allocation of a data term. Each intermediary compares, for each storage container, the truncated data term with a collection of truncated candidate terms to select a representative term of the candidate terms, identifies the selected representative term to the storage container, receives a similarity profile from each storage container, where the similarity profile is representative of similarities between the truncated data term and terms in the storage container, and selects a candidate target storage container based on similarity profiles received from each storage container.

Abstract: Incremental automatic update of ranked neighbor lists based on k-th nearest neighbors is disclosed. One example is a system including an indexing module to retrieve an incoming data stream, and retrieve ranked neighbor lists for received data objects. An evaluator determines similarity measures between the received data objects and their respective k-th nearest neighbors. A threshold determination module determines a statistical distribution based on the determined similarity measures, and a threshold based on the statistical distribution. The evaluator determines additional similarity measures between a new data object in the data stream and the received data objects.

Abstract: Automatic selection of neighbor lists to be incrementally updated is disclosed. One example is a system including an indexing module to receive an incoming data stream, and retrieve neighbor lists for received data objects. An evaluator determines similarity measures between pairs of the received data objects. A threshold determination module determines distributions of order statistics based on the determined similarity measures and retrieved neighbor lists, and a threshold based on the distributions of order statistics. The evaluator determines additional similarity measures between a new data object in the data stream and the received data objects.

Abstract: Data allocation based on secure information retrieval is disclosed. One example is a system including an information processor communicatively linked to a query processor and a plurality of data processors respectively associated with a plurality of datasets. The information processor receives a request from the query processor for identification of a target dataset to be associated with a query term. The information processor generates a random permutation, and receives a secure version of the query term from the query processor, and receives secure versions of a collection of candidate terms from each of a plurality of data processors, each candidate term representing a cluster of similar terms in the associated dataset. The information processor determines similarity scores between the secure version of the query term and secure versions of the candidate terms, and identifies the target dataset of the plurality of datasets based on the determined similarity scores.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises computing, via a processor, a ranked elements list for each of a plurality of objects. The method also comprises iteratively computing, via the processor, a blacklist of elements for the objects. The method further comprises determining, via the processor, duster centers that include top ranked non-blacklisted elements, and assigning, via the processor, each object to at least one duster center.

Abstract: An example method is provided in according with one implementation of the present disclosure. The method comprises generating, via a processor, a set of hashes for each of a plurality of objects. The method also comprises computing, via the processor, a high-dimensional sparse vector for each object, where the vector represents the set of hashes for each object. The method further comprises computing, via the processor, a combined high-dimensional sparse vector from the high-dimensional sparse vectors for all objects and computing a hash suppression threshold. The method also comprises determining, via the processor, a group of hashes to be suppressed by using the hash suppression threshold, and suppressing, via the processor, the group of selected hashes when performing an action.

Abstract: Dynamically updating a ridge regression data model of a continuous stream of data is disclosed. New data chunks corresponding to a current data accumulation point are received and the data values in the new data chunks are transformed via standardization methods. A ridge estimator for the standardized data that includes data chunks received up to a penultimate data accumulation point to include the new data chunks is dynamically updated. The cumulative observations received up to the current data accumulation point are updated and stored. Predictions for the continuous data stream are generated based on the updated ridge estimator.