G06F16/334

Determining object geolocations based on heterogeneous data sources

An example method of determining geolocations of objects based on information retrieved from heterogeneous data sources comprises: receiving, from a first data source associated with an object by an ontology-defined relationship, a first dataset including a first data item specifying a first time identifier and a first geolocation associated with the object; receiving, from a second data source associated with an object by an ontology-defined relationship, a second dataset including a second data item specifying a second time identifier and a second geolocation associated with the object; and determining, by applying a rule set associated with the ontology to the first dataset and the second dataset, a geolocation of the object and a corresponding time identifier.

Determining an origin of a target source code for a computer program or a part thereof
11500990 · 2022-11-15 · ·

A computer-implemented method for determining an origin of a target source code for a computer program or a part thereof. The method involves: Searching a plurality of software archives from different sources in a global computer network to find occurrences of the target source code among code files in said software archives. For every found occurrence of the target source code, the method further involves collecting key information about the matching source code files and, from the key information collected a frequency map is built that contains, for each keyword found in the key information, a keyword count value being indicative of the number of times the keyword occurs in the key information. The method may further involves applying a scoring scheme to the matching source code files based on the built frequency map (310), determining a highest score (Vmax) among the matching source code files after the scoring scheme has been applied, and determining the origin of the target source code as the matching source code file having the highest score.

TEXT STANDARDIZATION AND REDUNDANCY REMOVAL

The present disclosure provides a computer-implemented method, computer system and computer program product for text processing. The present in invention may include obtaining an original text input from a collaborative development environment. The present invention may include extracting a first text statement from the original input text. The present invention may include calculating a similarity value between the first text statement and a second text statement, wherein the second text statement is obtained from a statement database. The present invention may include comparing the similarity value to a pre-set threshold.

Method and apparatus for generating information

A method and apparatus for generating information are disclosed. An implementation of the method includes: receiving a target text, the target text including an objective and descriptive information of the objective; performing a dependency syntax parsing on the target text to generate a dependency tree of the target text; matching predetermined syntactic structure tree with the dependency tree to obtain at least one triple, a triple including a subject, a predicate, and an object; and determining, based on words contained in a triple among the at least one triple and a predetermined weight of the syntactic structure tree matched to obtain the triple, a target triple among the at least one triple.

Corpus specific generative query completion assistant

Representative embodiments disclose mechanisms to complete partial queries entered by a user. Users enter a partial query. The partial query is used to search a short text index comprising the titles of documents. The search yields a list results. The top k entries of the list are selected and a language model is created from the top k entries. The language model comprises n-grams from the top k entries and an associated probability for each n-gram. A query completion generator creates query completion suggestions by matching n-grams with the partial query, removing candidate suggestions that to not comply with suggestion rules, and filtering the remaining suggestions according to a filtering criteria. The top N results are returned as suggestions to complete the query.

Deep reinforcement learning-based multi-step question answering systems
11573991 · 2023-02-07 · ·

A method includes receiving a user query and performing, using at least one processor, multiple rounds of an answer generation process. Each round of the answer generation process includes selecting one of multiple functions to be performed based on an input state. The input state for each round includes an embedding of the user query in a feature space. The input state for at least one round also includes an embedding of information to be used to identify an answer to the user query in the feature space. Each round of the answer generation process also includes performing the selected function. The multiple functions include (i) an answer generation function that produces the answer to the user query and (ii) at least one additional function that updates the input state for a current round for use during a subsequent round. In addition, the method includes providing the answer to the user.

STORAGE CLUSTER CONFIGURATION
20230102863 · 2023-03-30 ·

Storage cluster configuration for computing resources of a storage system is disclosed. A cluster configuration can be based on client indicated cluster criteria. Further, a cluster configuration can be based on non-client indicated criteria, such as, system requirements, regulatory compliance, industry best practices, etc. Determined candidate cluster configurations that can satisfy client criteria can be organized according to a selection preference, to enable selection of a preferred cluster configuration from the candidate cluster configurations. Candidate cluster configurations can result from recursive combinatorial searching, with pruning, of an entity space resulting from an ontological analysis of storage system computing resources. Pruning can be accelerated based on heuristic selection of a fork attribute. A K-D tree subjected to dimensional normalization can be employed to interpolate an attribute value. Interpolation can be performed from predetermined sets of data, for example from storage system models or historical storage system performance.

System and method of encrypted information retrieval through a context-aware ai engine

This disclosure relates to personalized and dynamic server-side searching techniques for encrypted data. Current so-called ‘zero-knowledge’ privacy systems (i.e., systems where the server has ‘zero-knowledge’ about the client data that it is storing) utilize servers that hold encrypted data without the decryption keys necessary to decrypt, index, and/or re-encrypt the data. As such, the servers are not able to perform any kind of meaningful server-side search process, as it would require access to the underlying decrypted data. Therefore, such prior art ‘zero-knowledge’ privacy systems provide a limited ability for a user to search through a large dataset of encrypted documents to find critical information. Disclosed herein are communications systems that offer the increased security and privacy of client-side encryption to content owners, while still providing for highly relevant server-side search-based results via the use of content correlation, predictive analysis, and augmented semantic tag clouds for the indexing of encrypted data.

Computer systems, methods, and components for overcoming human biases in subdividing large social groups into collaborative teams

Humans have collaborated in both small and large groups for thousands of years, sometimes achieving great feats for the good of all mankind. However, most groups have failed to achieve greatness, often because of poor group “chemistry” and/or because of missing skills or insights. These problems typically arise because group organizers build groups using human mental processes that suffer from social, racial, gender, ethnic, or other unconscious biases. To reduce impact of these biases and help organizers form more effective groups or teams, the present inventors have devised, among other things, an exemplary system that subdivides a group of user data structures into subgroups, based on similarities between electronic surveys and/or other data types, such as social media and network analysis data types. The system further includes user interfaces for creating surveys, implementing user preferences regarding subgroup membership and sizes, controlling the subdivision process, and displaying the subgroups.

SYSTEM OF VISUALIZING VALIDITY LEVEL OF SEARCHING, METHOD OF VISUALIZING VALIDITY LEVEL OF SEARCHING, AND CARRIER MEANS

A search system (10) includes a search term acquisition unit (111) configured to acquire a search term; a full-text search unit (112) configured to perform a searching operation based on the search term; and a visualization unit (114) configured to display a corresponding relationship between the search term and a result obtained by performing the searching operation.