Abstract: A table acquiring means 381 acquires a first table including prediction objects and first attributes, and a second table including second attributes. A receiving means 382 receives a similarity function and condition for similarity used to calculate the similarity between the first attribute and the second attribute. A feature generating means 383 generates feature candidates able to affect a prediction object using a combination condition for combining a record in the first table including the value of a first attribute satisfying the condition with a record in the second table including the value of a second attribute satisfying the similarity calculated with the value of the first attribute and the value of the second attribute using the similarity function, and using a reduction method for a plurality of records in the second table and a reduction condition represented by the column to be aggregated. A feature selecting means 384 selects an optimum feature for the prediction from the feature candidates.

Abstract: A method, software, database and system for determining an optimal treatment for an illness in an individual and for determining the impact (e.g., side effects and intended benefits) of the treatment in the individual are presented in which an attribute profile of the individual containing genetic and non-genetic attributes is compared against a database containing combinations genetic and non-genetic attributes that are statistically associated with successful treatment of the illness in other individuals.

Abstract: A method comprising: enabling user definition of a search parameter; causing searching of content to find content having the search parameter and to provide the found content having the search parameter as search results; and causing rendering of the search results, using virtual reality, at different positions in a three dimensional space.

Abstract: An event processing system for distributing a continuous query, and processing events in an event stream, is disclosed. The system can synchronize timestamps across all partitions by adding a heartbeat propagator component propagating a heartbeat signal for silent partitions. The system can further include a timestamp tracker component that tracks the maximum observed timestamp across all partitions for each batch, and sends this to each partition. The system can distribute partitions of the events to the worker nodes, and instruct a heartbeat propagator component to generate a heartbeat for a first worker node corresponding to an event in a different partition. The system receives outputs from the worker nodes and combines these into a single result corresponding to a continuous query. The system can further implement a timestamp tracker to select a highest timestamp value of a previous batch, and send the value to the worker nodes.

Abstract: In disclosed techniques, a computing system causes presentation of a user interface having an input field operable to receive, from a user, a search query for a database. The computing system may classify the search query by: determining whether the search query includes terms that are within a specified vocabulary indicative of a natural language query and determining whether the search query includes terms that identify an object defined in a schema of the database. In response to classifying the search query as a natural language query, the computing system returns query results determined by identifying values in the database corresponding to the object defined in the schema. In response to classifying the search query as a keyword query, the computing system returns query results determined by comparing terms of the search query to values within records in the database.

Abstract: Disclosed is a system to provide an answer to a query generated by a device while hiding the answer and the query from a server providing the answer. Data structures, created at the server, contain information such as information about restaurants, mechanics, medical conditions, etc. The server creates bundles including two or more data structures containing disparate information, and a unique identifier for each bundle. The server creates a table of contents indicating the unique identifier of a bundle and the information contained in the bundle and sends the table of contents to the device. The server provides the answer to the query from the device by receiving the unique identifier of the bundle and providing the bundle having the unique identifier to the device. While the bundle contains the answer to the query, the server does not know the query or the answer because the bundle contains disparate information.

Abstract: A data clustering device includes an input configured to receive a plurality of data points encoded in at least one signal and a hardware logic circuit configured to extract one or more features of the one or more data points from the at least one signal, create or update, based on the one or more features, one or more data clusters representing one or more of the data points, and encode at least one of the one or more data clusters in at least one output signal. The device further includes an output configured to provide the at least one output signal, for instance, to a processor, such as a processor for controlling a controlled system. The device can be further configured to split or merge the data cluster(s) based on a statistical distribution of the one or more data points in the respective data cluster.

Abstract: The technology is directed to cache admission control. One or more processors may categorize access requests for data items in a cache storage into a plurality of categories and collect information on the access requests over time. Based on the collected information, a utility value for caching data items in each category of the plurality of categories may be determined. Newly requested data items may be admitted into the cache storage in an order according to the corresponding utility values of their respective categories.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for contextually disambiguating queries are disclosed. In an aspect, a method includes receiving an image being presented on a display of a computing device and a transcription of an utterance spoken by a user of the computing device, identifying a particular sub-image that is included in the image, and based on performing image recognition on the particular sub-image, determining one or more first labels that indicate a context of the particular sub-image. The method also includes, based on performing text recognition on a portion of the image other than the particular sub-image, determining one or more second labels that indicate the context of the particular sub-image, based on the transcription, the first labels, and the second labels, generating a search query, and providing, for output, the search query.

Abstract: The technology disclosed relates to systems and methods for constructing standardized addresses for a plurality of jurisdictions. The system includes logic to receive an address string for a place-of-interest. The address string can have a plurality of substrings. The system includes logic to classify substrings in the plurality of substrings as address substrings and non-address substrings. The system includes logic for one-to-one mapping respective address substrings in the address string to respective address components. The system includes logic to access respective standardized formats for the respective address components. The system includes logic to conform the address substrings to the respective standardized formats of the respective address components. The system can then access a template that specifies an order of concatenating the conformed address substrings. The system includes logic to concatenate the conformed address substrings according to specified order.

Abstract: The data of data objects stored in a DDOS are converted from one data format to another. The conversion is performed while the system is live and available to process requests for access to the data objects being converted. The conversion techniques do not require taking the DDOS offline. The conversion techniques also do not require locking a data object for the entire conversion of the data object.

Abstract: A system for providing responses to natural language queries or commands is disclosed. The system comprises a server comprising a processor and non-transitory memory storing instructions that cause the processor to: retrieve a stored data structure comprising a plurality of named entities; receive a natural language query or command from a human user; extract one or more named entities from the query or command, wherein the extraction comprises iteratively: dividing the query or command into overlapping sets of tokens, determining whether a set of tokens corresponds to a named entity from the plurality of named entities, extracting any corresponding set of tokens from the query, and if no corresponding sets remain, decreasing the set size and repeating; and based at least in part on the query or command and on the extracted one or more named entities, act to fulfill a user intent expressed by the query or command.

Abstract: An information processing device (100) includes a memory and processing circuitry. The memory stores a data set (DG) including multiple items of digital data (DD) and a label set (RG) including multiple labels. Each of the multiple labels are added to each of the multiple items of digital data (DD). The processing circuitry generates a feature vector set (BG) by extracting a predetermined feature from each of the multiple items of digital data (DD) and generating feature vectors indicating the extracted features. The feature vector set includes the feature vectors. The processing circuitry determines homogeneity of the data set (DG) by performing a trial of supervised clustering on the feature vector set (BG) by using the label set (RG) and determining the possibility of the clustering.

Abstract: The disclosure discloses a method and an apparatus for recognizing an entity word. The method includes: obtaining an entity word category and a document to be recognized; generating an entity word question based on the entity word category; segmenting the document to be recognized to generate a plurality of candidate sentences; inputting the entity word question and the plurality of candidate sentences into a question-answer model trained in advance to obtain an entity word recognizing result; and obtaining an entity word set corresponding to the entity word question based on the entity word recognizing result.

Abstract: A system and method that given a user preference will create a list of geographic locations that are the closest matches to the user's criteria. Based on the user specified importance of one or more categories and advanced metrics, locations are ranked. Climate category is ranked by estimating the number of days the user will be comfortable per year. Budget category is estimated based on if user wants to save money, have approximately the same cost of living, or pay more for improved lifestyle. For diversity metric, ranking is based on diverse or a specific ethnicity.

Abstract: Content fragments aligned to content criteria enable rich sets of multimodal content to be generated based on specified content criteria, such as content needs pertaining to various content delivery platforms and scenarios. For instance, the described techniques take a set of content (e.g., text, images, etc.) along with a specified content criteria (e.g., business/user need) and creates content fragment variants that are tailored to the content criteria with respect to both the information presented as well as the style of the content presented.

Abstract: Methods, systems, and processes to optimize role level identification for computing resource allocation to perform security operations in networked computing environments. A role level classifier to process a training dataset that corresponds to a clean title is generated from a subset of entities associated with the clean title. An initial effective title determined by the role level classifier based on processing the training dataset is assigned to an entity. A new effective title based on feature differences between the initial effective title and the clean title is re-assigned to the entity. Performance of the generating, the assigning, and the re-assigning is repeated using the new effective title instead of the clean title.

Abstract: A knowledge enabled data management system ingests data and stores the data as an instance in a knowledge graph according to a domain specific ontology. The instance includes stored relationships of the entities in the instance. A query regarding the data may be parsed to derive a first query entity that is used to search the knowledge graph for a first graph entity corresponding to the first query entity. Results may be returned including a first identification of the first graph entity, a second identification of at least a second graph entity related to the first graph entity stored within the knowledge graph, and additional data corresponding to the first graph entity and to the second graph entity. The additional data may include a probabilistic measure of the relationship of the first graph entity to the second graph entity.

Abstract: In a streaming environment, efficient correlation between base events and relevant follow-on events is accomplished by temporarily storing events in an in-memory state for a limited time window. The in-memory state buffers the incoming stream of events to permit efficient attempted correlation. Successful correlation (e.g., by ID matching) between a follow-on event and a relevant base event, gives rise to specialized aggregation tables for matched (base, follow-on) event pairs. All events are ultimately removed from the in-memory state upon expiry of the time window. This results in correlated matched event pairs being stored in the aggregation tables for efficient querying. Events remaining uncorrelated upon expiration of the time window, are stored only in an (voluminous) log table for less-efficient (but rare) late querying and aggregation. Efficient correlation is achieved by assuming that successful event pair matching is most likely to occur within the in-memory time window, or not at all.

Abstract: An example operation may include one or more of receiving a request to modify a reliability value of an off-chain data source to generate a modified reliability value, determining whether a consensus on the modified reliability value has been received among a plurality of peer nodes, and in response to a determination that the consensus has been received, updating a storage to reflect the modified reliability value associated with the off-chain data source, and storing an identification of the modified reliability value within a block among a hash-linked chain of blocks on a distributed ledger shared among the plurality of peer nodes.