Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

343 results about "Complete sequence" patented technology

In mathematics, a sequence of natural numbers is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once. For example, the sequence of powers of two {1, 2, 4, 8, ...}, the basis of the binary numeral system, is a complete sequence; given any natural number, we can choose the values corresponding to the 1 bits in its binary representation and sum them to obtain that number (e.g. 37 = 100101₂ = 1 + 4 + 32). This sequence is minimal, since no value can be removed from it without making some natural numbers impossible to represent. Simple examples of sequences that are not complete include the even numbers, since adding even numbers produces only even numbers—no odd number can be formed.

User interface and database structure for Chinese phrasal stroke and phonetic text input

The invention provides a stroke and phonetic text input entry system that has substantially the same definition of stroke match as that used in T9, where the input is a phrasal input rather than a character input. The invention solves the problem of Chinese phrasal stroke and phonetic text input by allowing users to enter an arbitrary number of strokes for each character in a phrase, where each character is separated by a delimiter. In this way, the invention provides a system that is easily learned and efficiently applied. Thus, the invention makes it possible for users to enter multiple characters while keeping their single character input habits. Each Chinese character has a standard stroke sequence in Guo Biao (GB), which is the standard for mainland China, or multiple sequences for BIG5 Chinese Character Encoding for Traditional (Complex) Characters, which is the de facto standard in Taiwan but not used in mainland China. With the invention, users do not have to enter the complete sequence for a single character, but instead can stop at any point and enter a delimiter which indicates the end of the previous character and the start of the next character. The whole stroke sequence entered by the user can then be split into a few groups that are separated by zero or more delimiters. Phrases can then be identified by user entry of groups of characters. The presently preferred phrase matching criteria are as follows: the first stroke group matches the leading stroke sequence of the first character of the phrase; the second stroke group matches the leading stroke sequence of the second character of the phrase, etc; the phrases that match the entered stroke sequence are presented to the user for selection. A user interface design for Chinese phrasal stroke text input is also provided.
Owner:TEGIC COMM

Polychronic time sequence similarity analysis method based on weighting BORDA counting method

The invention discloses a polychronic time sequence similarity analysis method based on a weighting BORDA counting method. The method comprises the steps of conducting PCA processing on polychronic sequences to be inquired and inquired sequences, reserving front p-dimensional principal component sequences with the characteristic value contribution rate reaching a certain threshold value (such as 80% and 95%), forming the p-dimensional principal component sequences, selecting a unitary time sequence similarity analysis method from existing time sequence similarity analysis methods according to the specific analysis requirements (such as sequence form similarity and distorted time shafts), utilizing the selected time sequence similarity analysis method for conducting unitary time sequence similar analysis on each-dimensional sequences of the p-dimensional principal component sequences, obtaining unitary similar (sequences) subsequences of the each-dimensional sequences, trimming the unitary similar (sequences) subsequences, generating polychromic candidate similar (sequences) subsequences, and utilizing the weighting BORDA counting method for conducting voting ranking on the candidate similar (sequences) subsequences to obtain the final similar (sequences) subsequences. The method is suitable for k-neighbor similarity inquiry of the complete sequences and the subsequences.
Owner:HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products