G06F16/00

DNA alignment using a hierarchical inverted index table

System and method for constructing a hierarchical index table usable for matching a search sequence to reference data. The index table may be constructed to contain entries associated with an exhaustive list of all subsequences of a given length, wherein each entry contains the number and locations of matches of each subsequence in the reference data. The hierarchical index table may be constructed in an iterative manner, wherein entries for each lengthened subsequence are selectively and iteratively constructed based on the number of matches being greater than each of a set of respective thresholds. The hierarchical index table may be used to search for matches between a search sequence and reference data, and to perform misfit identification and characterization upon each respective candidate match.

Data analysis device, data analysis method and data analysis program
11593299 · 2023-02-28 · ·

A data analysis device 10 comprises: a frequency analysis unit 11 that performs frequency analysis, under a predetermined condition, on each piece of a plurality of training data pieces including a plurality of class training data pieces some of which have been assigned a label indicating the data class; a cluster analysis unit 12 that clusters the frequency analyzed training data pieces into a number of classes of frequency analyzed training data; a computation unit 13 that computes, on the basis of the clusters, the degree to which frequency analyzed training data pieces assigned the same label are not included in the same cluster; and a selection unit 14 that selects, as a clustering model for assigning a label to a training data piece, clustering results according to the cluster analysis unit 12 when the smallest degree was computed, from among the plurality of computed degrees.

Data analysis device, data analysis method and data analysis program
11593299 · 2023-02-28 · ·

A data analysis device 10 comprises: a frequency analysis unit 11 that performs frequency analysis, under a predetermined condition, on each piece of a plurality of training data pieces including a plurality of class training data pieces some of which have been assigned a label indicating the data class; a cluster analysis unit 12 that clusters the frequency analyzed training data pieces into a number of classes of frequency analyzed training data; a computation unit 13 that computes, on the basis of the clusters, the degree to which frequency analyzed training data pieces assigned the same label are not included in the same cluster; and a selection unit 14 that selects, as a clustering model for assigning a label to a training data piece, clustering results according to the cluster analysis unit 12 when the smallest degree was computed, from among the plurality of computed degrees.

Update of deduplication fingerprint index in a cache memory

In some examples, a system performs data deduplication using a deduplication fingerprint index in a hash data structure comprising a plurality of blocks, wherein a block of the plurality of blocks comprises fingerprints computed based on content of respective data values. The system merges, in a merge operation, updates for the deduplication fingerprint index to the hash data structure stored in a persistent storage. As part of the merge operation, the system mirrors the updates to a cached copy of the hash data structure in a cache memory, and updates, in an indirect block, information regarding locations of blocks in the cached copy of the hash data structure.

Agent system, agent processing method, and non-transitory storage medium that stores an agent processing program

An agent system includes a first memory and a first processor coupled to the first memory. The first processor analyzes contents of a verbal question, and carries out pre-processing that replaces vocabulary, which is used in the contents of the question, with homogenized vocabulary, and generates response information based on results of analysis. In a case in which there exists substitution vocabulary that has replaced original vocabulary in the pre-processing, the first processor changes the response information such that it can be recognized that the substitution vocabulary in the response information is synonymous with the original vocabulary, and outputs the response information.

Intelligent and automatic load balancing of workloads on replication appliances based on appliance load scores

Various systems and methods are provided in which a replication process is initiated between a primary site and a recovery site, each having plurality of gateway appliances. Replication loads are evaluated for each given gateway appliance of the plurality of gateway appliances. If a determination is made that at least one gateway appliance of the plurality of gateway appliances is not overloaded, the plurality of gateway appliances are sorted based on replication loads respectively associated with each gateway appliance, and a determination is made as to whether a relative difference in replication loads between a gateway appliance having a highest replication load and a gateway appliance having a lowest replication load exceeds a difference threshold to determine whether the replication workloads between the gateway appliances should be rebalanced.

GENERATING AND STORING SUMMARIZATION TABLES FOR SEARCHABLE EVENTS

Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

PERSONALIZED REAL ESTATE EVENT FEED
20180007169 · 2018-01-04 ·

A personalized feed system is described herein that provides feeds that are tailored to the preferences of each user of a real estate website or application. A user signs up to receive a stored profile with the website, and the profile includes information such as what geographical regions the buyer is interested in, what types of homes the buyer is looking for, and so on. The personalized feed system uses this information to provide a feed specific to the buyer that notifies the buyer of listings that are of particular relevance to that buyer. The personalized feed system summarizes other real estate events that are relevant to the user in a single time-oriented feed. Buyers receive information about new and/or modified listings, sales, outstanding offers, status of a transaction, and the like, while sellers receive information about sales, new and/or modified listings, open offers, and so on.

INFORMATION VIEWING SYSTEM
20180004821 · 2018-01-04 ·

An information viewing system that allows a viewer to efficiently display its desired posted article by a simple operation. According to the present invention, a front server includes an information page creating unit that creates a plurality of hierarchical information pages and search result pages, using data items stored in the information database, a posted page creating unit that extracts from the posted article database, a posted article associated with an information page displayed on the communication terminal and a posted article associated with a lower-order information page of the information page displayed, to create a posted page corresponding to the information page displayed, and a communication processing unit that sends the information page and the posted page to the communication terminal to display therein.

READ ONLY BUFFERPOOL
20180004798 · 2018-01-04 ·

Example implementations disclosed herein include techniques for a ready only bufferpool for use in local nodes of a multi-node computing system. Read only transactions executed by a processor can reference a ready only bufferpool resident in a VRAM on the same node. If the desired data page is in the bufferpool the transaction can immediately read data records from the cached data pages. If the desired data page is not in the bufferpool, then the transaction can cause a copy of a corresponding data page in a secondary memory to be installed in the bufferpool. The bufferpool can include more than one copy of a data page simultaneously to handle and prevent cache line misses. Data page are dropped from the bufferpool based on an incrementing per data page counter.