320 results about "Sequence matching" patented technology

A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The re-configurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN. In addition to performing search and data reduction operations, this device may also be used to perform a variety of other processing operations including encryption, decryption, compression, decompression, and combinations thereof.

A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The re-configurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN. In addition to performing search and data reduction operations, this device may also be used to perform a variety of other processing operations including encryption, decryption, compression, decompression, and combinations thereof.

A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The reconfigurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN.

A system, method and article of manufacture are provided for password protecting user access to a computer system. One or more images are displayed to a user. The user is then required to perform a sequence of actions involving the images. The performed sequence of actions is compared with a predefined sequence of actions. If the performed sequence of actions matches the predefined sequence of actions, user access is permitted.

An architecture for a multimedia search system is described. To perform similarity matching of multimedia query frames against reference content, reference database comprising of a cluster index using cluster keys to perform similarity matching and a multimedia index to perform sequence matching is built. Methods to update and maintain the reference database that enables addition and removal of the multimedia contents, including portions of multimedia content, from the reference database in a running system are described. Hierarchical multi-level partitioning methods to organize the reference database are presented. Smart partitioning of the reference multimedia content according to the nature of the multimedia content, and according to the popularity among the social media, that supports scalable fast multimedia identification is also presented. A caching mechanism for multimedia search queries in a centralized or in a decentralized distributed system and a client based local multimedia search system enabling multimedia tracking are described.

An apparatus and method for providing visual indication of character ambiguity and ensuing reduction of such ambiguity during text entry are described. An application text entry field is presented in a display screen, into which the user enters text by means of a reduced keyboard and a disambiguating system. The default or most likely word construct for the current key sequence may be presented at the insertion point of the text entry field. An indication of ambiguity is presented in the display screen to communicate to the user the possible ambiguous characters associated with each key. A word choice list field may also be present to display at least one word construct matching the current key sequence.

The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.

Assigning meanings to spoken utterances in a speech recognition system. A plurality of speech rules is generated, each of the of speech rules comprising a language model and an expression associated with the language model. At one interval (e.g. upon the detection of speech in the system), a current language model is generated from each language model in the speech rules for use by a recognizer. When a sequence of words is received from the recognizer, a set of speech rules which match the sequence of words received from the recognizer is determined. Each expression associated with the language model in each of the set of speech rules is evaluated, and actions are performed in the system according to the expressions associated with each language model in the set of speech rules.

Deduplication of data on disk devices based on a threshold number (THN) of sequential blocks is described herein, the threshold number being two or greater. Deduplication may be performed when a series of THN or more received blocks (THN series) match a sequence of THN or more stored blocks (THN sequence), whereby a sequence comprises blocks stored on the same track of a disk device. Deduplication may be performed using a block-comparison mechanism comprising metadata entries of stored blocks and a mapping mechanism containing mappings of deduplicated blocks to their matching blocks. The mapping mechanism may be used to perform later read requests received for the deduplicated blocks. The deduplication described herein may reduce the read latency as the number of seeks between tracks may be reduced. Also, when a seek to a different track is performed, the seek time cost is spread over THN or more blocks.

An architecture for a multimedia search system is described. To perform similarity matching of multimedia query frames against reference content, reference database comprising of a cluster index using cluster keys to perform similarity matching and a multimedia index to perform sequence matching is built. Methods to update and maintain the reference database that enables addition and removal of the multimedia contents, including portions of multimedia content, from the reference database in a running system are described. Hierarchical multi-level partitioning methods to organize the reference database are presented. Smart partitioning of the reference multimedia content according to the nature of the multimedia content, and according to the popularity among the social media, that supports scalable fast multimedia identification is also presented. A caching mechanism for multimedia search queries in a centralized or in a decentralized distributed system and a client based local multimedia search system enabling multimedia tracking are described.

The invention pertains to a system and method for dispatching and executing the compute-intensive parts of the workflow for database queries on an attached high-performance, parallel computing platform. The performance overhead for moving the required data and results between the database platform and the high-performance computing platform where the workload is executed is amortized in several ways, for example,by exploiting the fine-grained parallelism and superior hardware performance on the parallel computing platform for speeding up compute-intensive calculations,by using in-memory data structures on the parallel computing platform to cache data sets between a sequence of time-lagged queries on the same data, so that these queries can be processed without further data transfer overheads,by replicating data within the parallel computing platform so that multiple independent queries on the same target data set can be simultaneously processed using independent parallel partitions of the high-performance computing platform.A specific embodiment of this invention was used for deploying a bio-informatics application involving gene and protein sequence matching using the Smith-Waterman algorithm on a database system connected via an Ethernet local area network to a parallel supercomputer.

A communication system having a transmitter chaotic signal generator and a receiver chaotic signal generator which when uncoupled generate state signals along substantially identical chaotic attractor trajectories in an out of phase relation. A controller controls the transmitter chaotic signal generator to transmit a state signal having segments of the deterministic state trajectory which identify a subsequent length of the deterministic state trajectory matching an input N-bit sequence. A receiver coupler receives the transmitted state signal and, if the signal is above a threshold for a duration of approximately two bit periods, synchronizes the receiver chaotic signal generator to the segment of its deterministic state trajectory indicated by the state signal to generate, with or without coupling, the subsequent length of that state trajectory matching the input N-bit sequence. A receiver symbol detector reconstructs the N-bit sequence based on the receiver chaotic oscillator state signal.

A method for predicting insider threat includes mining electronic data of an organization corresponding to activity of an entity, determining features of the electronic data corresponding to the activity of the entity, classifying the features corresponding to the activity of the entity, determining sequences of classified features matching one or more patterns of insider threat, scoring the entity according to matches of the classified features to the one or more patterns of insider threat, and predicting an insider threat corresponding to the entity according to the score.

The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘ / / ’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).

The invention discloses a protocol identification control method based on application behavior mode applied in bandwidth management equipment. The method comprises following steps: judging if the current session possesses specific plaintext character produced by application layer network protocol; If the current session does not possesses specific plaintext character, finding if message character sequence matching with current session existed in the associated IP item between preset network flow and corresponding network protocol; if matching, then determining network protocol used by current session according to corresponding relation of message character sequence and network protocol. The invention can promptly, highly effectively identify network application flow unrecognized by port identification method and DPI method.

The present invention is directed to an apparatus and a method of game play for an electronic sequence matching game the may include a pair of elongated stick member that may be operatively coupled together by an electrical cord so the game play for the electronic matching game may be coordinated between the elongated stick members. During the electronic sequence matching game, the elongated stick members may illuminate different colored lights and generate corresponding sounds in particular sequences, and a player must manipulate the sticks to repeat the sequences generated by the elongated stick members. Depending on the mode of game play, the elongated stick members may repeat the sequence with an additional light being added to the sequence each time the player successfully matches the sequence, or the elongated stick members may generate a new sequence that may be longer or played faster than the previous sequence each time the player successfully matches a sequence. In a further mode, the player may be able to manipulate the elongated stick members in any desired sequence, with the player's manipulation of the elongated stick members causing the stick members to respond with lights and sounds of the music chosen by the player.

Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. Herein, there is addressed the problem of query equivalence with respect to this transformation, and thereis introduced a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. There is identified a class of sequencing methods for this purpose, and there is presented a novel subsequence matching algorithm that observe query equivalence. Also introduced is a performance-oriented principle to guide the sequencing of tree structures. For any given XML dataset, the principle finds an optimal sequencing strategy according to its schema and its data distribution; there is thus presented herein a novel method that realizes this principle.

The invention discloses a user credibility authentication system and method based on user behaviors. The system comprises a user identity and behavior model determination module, a user behavior collection module, a user behavior mining module, a user behavior sequence matching and credibility authentication module and a local security policy module. The method comprises the steps as follows: the user behavior mining module performs behavior mining on user behavior logs; a personal user behavior characteristic sequence is established; the user behavior sequence matching and credibility authentication module performs sequence similarity calculation on the personal user behavior characteristic sequence and a to-be-matched sequence, so that a user credibility grade is obtained, and a corresponding security policy is started using. According to the invention, a sequence pattern mining manner is adopted to collect real-time user behaviors so as to establish the to-be-matched sequence, the similarity matching of the behavior sequence is performed, accordingly, the real-time user behaviors are subjected to credibility authentication, the accurate rate of authentication is improved, and enterprise and personal property safety is guaranteed.

Genomic sequence matching and alignment techniques are disclosed. In one embodiment, an index of a reference sequence is constructed that represents all transitions from a single l-mer prefix to multiple m-mer suffixes. This index data structure may take a variety of forms, including an array or a tree. The base position of each transition from l-prefix to m-suffix is recorded in k-bit masked form. The positions data structure may take a variety of forms as well, including an array or a tree. The l-prefix, m-suffix and k-position index is used for rapid assessment of similarity between a query and a reference genomic sequence by means of a table of local hits.

The invention relates to a method for capturing human motion by the aid of fused depth images and three-dimensional models. By the aid of the method, problems of adhesion requirement on mark points, inconvenience in interaction and easiness in confusing and shielding the mark points of a method for optically capturing motion can be solved. The method includes acquiring depth information of human actions; removing backgrounds of motion objects; acquiring complete depth information of the human actions; converting the complete depth information of the human actions into three-dimensional point-cloud information of human bodies; acquiring three-dimensional human action models; establishing databases; enabling the databases to be in one-to-one correspondence with data of human action skeleton databases; extracting depth information of to-be-identified human actions to build the three-dimensional models; then matching the similarity of the three-dimensional models with the similarity of human actions in the databases of the three-dimensional models; outputting human action skeletons according to similarity sequences. The human action skeletons are motion capturing results. The method has the advantages that sensors or added mark points can be omitted on the human bodies, the method is easy to implement, motion sequences are matched with one another by the aid of a regular time wrapping process, the matching precision of each two sequences can be improved, the matching time can be greatly shortened, and the motion capturing speed and the motion capturing precision can be guaranteed.

One embodiment of the present invention provides a system for entering text. The system starts by receiving a sequence of finger-triggered events. The system then attempts to match the sequence of finger-triggered events to one or more predetermined sequences of finger-triggered events. If the sequence matches a predetermined sequence, the system outputs at least one character corresponding to the predetermined sequence.

The present invention provides a numeric coded Pinyin and Zhuyin multi-character input method on a reduced keypad, in which each Chinese phrase is mapped to corresponding numeric sequences based on full syllable or initial consonant of a syllable inputting rule and the keypad mapping relation, accordingly, phrases of different phonetic pronunciation may be mapped to a same numeric sequence; in the case of consecutively receiving a numeric keystroke sequence which represents of several desired Chinese characters but pronunciation still undetermined, a processor immediately searches the phrases' numeric sequences which are matched with keystroke sequence and present these mixed phrase candidates to user even though these candidates may have different pronunciation; further, an initial syllable grouping and cycling rule is specially defined, along with a key for switching between character candidate priority and phrase candidate priority, additionally, define an equal-length candidate filtering code keystroke, and a key for determining syllable by character and the like to accelerate the choice of candidate phrases and facilitate the realization of PC-like Chinese phrase consecutive inputting on the reduced keypad.

The present invention discloses a method for identifying a user action and an intelligent mobile terminal. The method comprises: acquiring user action data, and training the user action data to obtain a feature extraction parameter and a template symbol sequence; collecting data that needs to execute user action identification during user action identification to obtain an original data sequence; performing feature extraction on the original data sequence by using the feature extraction parameter to obtain a dimension-reduced test data sequence; converting the test data sequence into a discrete character string to obtain a symbol sequence of the test data sequence; and performing matching on the symbol sequence of the test data sequence and a template symbol sequence, and when the matching is successful, determining that the user action corresponding to the template symbol sequence occurs. According to the method provided by an embodiment of the present invention, dimension reduction is performed on the original data sequence by using the feature extraction parameter, the dimension-reduced data sequence is symbolized, and then the dimension-reduced data sequence is matched with the template symbol sequence, so that calculation complexity is lowered, perceptual identification efficiency is improved, and good user experience is achieved.

The invention discloses a method for detecting a designated location point of variation. The method comprises the following steps that a designated location point of variation and a reference sequence containing the variation are determined based on known information of the variation; sequencing data of nucleic acid of a sample to be detected is obtained, wherein the sequencing data comprises multiple read segments; the read segment containing the designated location point in the sequencing data is extracted, and then the designated read segment is obtained; N bps are extended in the directions of both ends centered on the designated location point of the designated read segment, a designated fragment is obtained, 4<=N<=10; the designated fragment is compared with the reference sequence containing the variation, and then a support read segment is obtained, wherein the support read segment is a read segment where the designated fragment matched with the reference sequence containing the variation is located; the amount of the support read segment is counted, and whether or not the variation exists is judged based on the amount of the support read segment. Attention is paid to whether or not sequence characteristics which should occur after the variation exist in the read segment, and based on the judgment, detection of the designated location point of the variation is carried out; the problem of the decline in the quality of the comparison near the variation location point is avoided, and the variation can be detected quickly and accurately.

An integrated solution in which BLAST functionality is integrated into a DBMS provides improved performance and scalability over the conventional approach, in addition to reducing the required hardware resources and reducing the cost of the system. In a database management system, a system for sequence matching and alignment comprises a database table storing sequence information comprising target sequences, a query sequence, a table function operable to accept the query sequence and match the query sequence with at least one target sequence stored in the database table, and a structured query language query referencing a database table storing sequence information comprising target sequences, a query sequence, and a table function, the structured query language query evaluatable by the database management system.

The invention discloses a smartphone address book fuzzy search method including preprocessing data of contacts recorded in a smartphone address book, acquiring spelling of names of the contacts and corresponding digital sequences of a thumb keyboard according to a spelling code table, writing the key information including the spellings, the digital sequences, phone numbers and the like into a memory while backing up the key information to a designed buffer, respectively matching different fields of the contacts in the memory on the basis of three classifications by judging whether including Chinese characters, letters or numbers according to the given search keywords, and finally realizing fuzzy matching of the keywords and the spellings of the names by a modified character string sequence matching algorithm. By the smartphone address book fuzzy search method, the address book can be searched globally according to optional keywords, the digital search of the thumb keyboard is supported, names, full spellings, shorthand spellings, part spellings, phone numbers, mailboxes of the contacts can be in fuzzy search, the search results can be output in a weighted ranking manner according to specific matching reasons, and accordingly, the smartphone address book fuzzy search method is a convenient and efficient diversified operating method for users.

The invention relates to a chinning count detection method and a device based on a deep convolution neural network. Firstly, a multilayer deep convolution neural network is constructed and the neural network is trained; the weight from an output layer vector element to a middle layer output vector element and the weight from the middle layer output vector element to the output layer vector element are obtained through training; according to a general error function and the relationship with an error threshold, the weights are further adjusted to obtain a good classifier; the classifier is used for analyzing an acquired video image to further detect a human body action target and action classes; the acquired class values are serially connected according to a time sequence to form an action sequence, the action sequence is compared with a standard chinning action sequence, whether the chinning of a person at the time is standard, if the sequences are matched, one is added to the chinning count. The method and the device have the advantages of strong generalization ability, strong robustness, high counting accuracy and fast counting speed.

The invention relates to a multi-source information fusion positioning method and device. The multi-source information fusion positioning method comprises the steps: (1) the track is deduced through asensor integrated in an intelligent terminal; (2) weighted centroid positioning and signal sequence matching positioning are conducted through a Bluetooth sensor; (3) weighted centroid positioning and signal sequence matching positioning are conducted through a Wi-Fi sensor; and (4) the track deduction result obtained in the step (1) and the positioning results obtained in the step (2) and the step (3) are fused, and the final positioning result is obtained. An inertial navigation / Bluetooth / Wi-Fi-based fusion positioning mode is adopted, the advantages of various positioning technologies canbe developed effectively, and high-precision positioning and navigation are achieved; and the positioning cost is low, deployment is convenient, the coverage range is wide, the very high scene adaptability is achieved, real-time, continuous and accurate position information can be provided, and the multi-source information fusion positioning method and device can be widely applied to various indoor positioning scenes.