Abstract: An electronic device that includes one or more input sensor devices, one or more output devices, one or more computer processors and a memory containing computer program code that, when executed by operation of the one or more computer processors, performs an operation. The operation includes collecting information, using one or more input sensor devices, about the plurality of users within a physical environment. The operation includes analyzing the collected information to determine a present situational context for the plurality of users that are currently present within the physical environment. An action to perform is determined based on the determined present situational context. The determined action is executed using the one or more output devices.

Abstract: A deduplication service can be provided to a storage domain from a services framework that expands and contracts to both meet service demand and to conform to resource management of a compute domain. The deduplication service maintains a fingerprint database and reference count data in compute domain resources, but persists these into the storage domain for use in the case of a failure or interruption of the deduplication service in the compute domain. The deduplication service responds to service requests from the storage domain with indications of paths in a user namespace and whether or not a piece of data had a fingerprint match in the fingerprint database. The indication of a match guides the storage domain to either store the piece of data into the storage backend or to reference another piece of data. The deduplication service uses the fingerprints to define paths for corresponding pieces of data.

Abstract: A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.

Abstract: An apparatus includes an interface and a processor. The interface sends and receives data over a network. The processor uses the interface to transmit a first series of profiles to a first user. The first series of profiles corresponds to recommendations of users for a second user. The processor also uses the interface to receive a selection from the first user of a first profile of the first series of profiles. In response to receiving the selection from the first user of the first profile of the first series of profiles, the processor determines, based at least in part on the selection from the first user of the first profile, a second series of profiles. The processor additionally uses the interface to transmit the second series of profiles to the second user.

Abstract: Embodiments of the present invention disclose a result ranking method and device. The method includes: acquiring search key-information by using an interaction application, and searching a prestored interaction data set for at least one search result associated with the search key-information; ranking the at least one search result according to a quality assessment score corresponding to each of the at least one search result; and outputting the ranked at least one search result. The quality assessment score corresponding to each search result is a value generated according to a number of historical operations performed on each search result and an interactive influence score of an application identifier performing a historical operation on each search result.

Abstract: Categorical data transformation and clustering techniques and systems are described for machine learning using natural language processing. These techniques and systems are configured to improve operation of a computing device to support efficient and accurate use of categorical data, which is not possible using conventional techniques. In an example, categorical data is received by a computing device that includes a categorical variable having a non-numerical data type for a number of classes. The categorical data is then converted into numerical data using natural language processing. Data is then generated by the computing device that includes a plurality of latent classes. This is performed by clustering the numerical data into a number of clusters that is smaller than the number of classes in the categorical data.

Abstract: A framework and the associated method, schema and design for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes including the purposes of encryption/decryption or compression/decompression or both. There is no assumption of the digital information to be processed before processing. An universal coder is invented and now pigeonhole meets blackhole.

Abstract: A data management method is provided. To-be-migrated base data in a first service data set is obtained, mirror data that are same as the base data are generated, and the base data to a second service data set are migrated. Incremental data obtained for the base data are recorded in the migration process of the base data. Adding processing is performed on the mirror data by using the incremental data, and the incremental data are migrated to the second service data set, when the migration process of the base data is completed. The mirror data and the incremental data in the first service data set are cleared when the migration process of the incremental data is completed.

Abstract: Implementations are described herein for analyzing existing interactive web sites to facilitate automatic engagement with those web sites, e.g., by automated assistants or via other user interfaces, with minimal effort from the hosts of those websites. For example, in various implementations, techniques described herein may be used to abstract, validate, maintain, generalize, extend and/or distribute individual actions and “traces” of actions that are useable to navigate through various interactive websites. Additionally, techniques are described herein for leveraging these actions and/or traces to automate aspects of interaction with a third party website.

Abstract: Provided is a system and method for reconstructing and visualizing transformation steps that are performed to an optimized database query. In one example, the method may include receiving a database query including an initial set of execution steps, generating a plurality of alternative sets of execution steps for the database query based on transformations to the initial set of execution steps, selecting an alternative set of execution steps from among the plurality of alternative sets of execution steps based on a performance of the alternative set of execution steps, identifying transformations that are used to transform the initial set of execution steps into the selected alternative set of execution steps, and displaying information about the identified transformations via a user interface.

Abstract: A method, computer system, and computer program product for eliminating confirmation bias in a user search query is provided. The present invention may include receiving a user-entered search query from an open ended-search tool. The invention may also include identifying a field associated with the received user-entered search query. The invention may further include creating a dictionary based on the identified field. The invention may also include determining the received user-entered search query relates to an effect by parsing the created dictionary. The invention may further include identifying one or more causes associated with the effect by parsing the created dictionary. The invention may also include generating a plurality of suggested search queries based on the one or more identified causes.

Abstract: Systems and methods are provided to improve data sets and/or data set collection. An entity submits a request for a data set crowd sourced database system. Contributor(s) work to complete the data set, such as by submitting components of the data set. Multiple separate users contributing to a data set improves the diversity of a data set. The crowd sourced database system ranks contributing users using a ranking algorithm based on the previous submissions of a user. The crowd sourced database system ranks contributions based on the quality of the data submitted. The crowd sourced database system anonymizes data contributions where data privacy considerations are required or are important.

Abstract: Data mining operations are performed within a columnar database management system. The columnar database management system stores input sets of data for a data mining operation. An input set of data is represented as a column of data in the columnar database management system. The columnar database management system stores instructions to perform one or more data mining operations for processing the input sets of data. The columnar database management system receives requests for performing data mining operations and performs the processing of the data mining operation within the columnar database management system. As a result, the processing of data mining operations is performed without requiring multiple data transfers between an application implementing the data mining operations and the columnar database management system.

Abstract: In one aspect, a data accumulation apparatus includes a script execution environment, an accumulation and retrieval unit accumulating data and performing retrieval on the accumulated data, a notification unit outputting notification in response to that data newly accumulated in the accumulation and retrieval unit matches one of conditions registered in advance, and a storage unit storing scripts and action correspondence information. The script execution environment has property of being capable of describing an instruction to perform data retrieval and an instruction to perform communication through the network, according to a script being executed.

Abstract: Embodiments relate to a computer platform and corresponding process and program code to assess multimedia files with respect to similarity and duplicate media content. Data streams are converted into sequences of events, and object representation within the streams is identified and subject to processing with respect to the event sequences. A similarity assessment is conducted between two or more of the data streams, and a corresponding distance measurement to quantify similarity is produced. Duplicate data is selectively identified in response to the similarity assessment and the produced distance measurement.

Abstract: Systems and methods are provided for automatically identifying and displaying unmet technical needs and/or technical problems, such as identifying and displaying serious technical issues in specific areas of technology. In some exemplary embodiments, the text of technical documents is automatically analyzed to determine whether the text of any document identifies or potentially identifies a technical problem. In exemplary embodiments, portions of a documents called “problem kernels” and their associated features are automatically identified, automatically scored, and automatically ranked, and a subset of the problem kernels and/or features of problem kernels are displayed to a user on a computer display.

Abstract: The present technology relates to identifying one of a plurality of artificial intelligence models based on a received key value. The received key value is applied to the identified one of the artificial intelligence models which is trained to output one of a plurality of actual index values. The one of the actual index values is compared to a range within the actual index values to determine when the one of the actual index value points to the data block. A received input-output operation is performed on the data block when the one of the actual index values is determined to point to the data block.

Abstract: In an embodiment, a method of sketching using a hybrid quantum-classical system includes creating a set of clustered data sets from a first data set. In an embodiment, the method includes evaluating, using a quantum processor and quantum memory, the set of clustered data sets. In an embodiment, the method includes evaluating, using the quantum processor and quantum memory, a set of quality metrics for the set of clustered data sets. In an embodiment, the method includes reclustering, responsive to at least one of the set of quality metrics failing to meet a quality criterion, the first data set.

Abstract: A data store item count process determines the number of items in a data store (e.g., the number of items in a database table). In response to receipt of triggering events (e.g., additions or deletions of items in a table), a function registered to process the events is launched. The function processes the events to identify a net change to a count of items, and updates a value in a data store based on the net change. Multiple functions may process events for respective sets of partitions of a table, or for respective sets of tables, and update a distinct count value for each partition or table. In some instances, the process is performed within the context of a serverless compute environment; the function may retire, without saving an execution state for the function. A reporting function may access the value and send the value to a metrics reporting service.

Abstract: A query-set is used to obtain recommendation results from different recommendation algorithms available locally on a device. The same query-set is used to obtain recommendation results from a remote, well-established online recommendation system using an unknown recommendation algorithm. Distances are measured between the recommendation results from the online recommendation system and the recommendation results from each of the local recommendation algorithms. The local recommendation algorithm having generated recommendation results with a smallest distance to the recommendation results from the online recommendation system is selected for generation of recommendations based on a local recommendation algorithm.