269 results about "String length" patented technology

Decoding Huffman codes is accomplished by identifying consecutive strings of high order ones or zeroes and following consecutive strings of high order ones or zeroes, retrieving a table entry for each string based on its run count and bit value, until the retrieved entry contains the decoding output symbol, or until the remaining bits of the code word number within a predetermined threshold. The remaining bits are used as an offset into a lookup table, but the dimensions of the table have been reduced through elimination of the leading ones and zeroes. The consecutive strings are preferably processed by a hardware accelerator to identify the repeated bit, count the bits in the string and return this information to the host processor. The efficiencies of decoding canonical codes are realized; yet, non-canonical codes can be decoded.

An apparatus and method for analyzing known data, storing the known data in a pattern database (“PDB”) as a template is provided. Additional methods are provided for comparing new data against the templates in the PDB. The data is stored in such a way as to facilitate the visual recognition of desired patterns or indicia indicating the presence of a desired or undesired feature within the new data. Data may be analyzed as fragments, and the characteristics of various fragments, such as sting length, may be calculated and compared to other indicia to indicate the presence or absence of a particular substance, such as a hydrocarbon. The apparatus and method is applicable to a variety of applications where large amounts of information are generated, and / or if the data exhibits fractal or chaotic attributes.

A string trimmer head is provided for receiving and retaining separate lengths of string supplied from outside the head. String lengths passing through openings in the periphery of the head are held by clamping members provided within the head. The clamping members are selectively opened by activation of respective slidable members provided on the upper surface of the head in order to release short lengths of previously supplied string and / or to permit the receipt of new string lengths. On release of the slidable members, the respective clamping members move towards one another for clamping purposes under the influence of springs.

An apparatus and method for analyzing known data, storing the known data in a pattern database (“PDB”) as a template is provided. Additional methods are provided for comparing new data against the templates in the PDB. The data is stored in such a way as to facilitate the visual recognition of desired patterns or indicia indicating the presence of a desired or undesired feature within the new data. Data may be analyzed as fragments, and the characteristics of various fragments, such as string length, may be calculated and compared to other indicia to indicate the presence or absence of a particular substance, such as a hydrocarbon. The length and / or character of each fragment are a product of the cutting criteria in both horizontal and vertical orientations. Modifying the cutting criteria can have a beneficial effect on the results of the analysis and / or in the amount of time necessary to achieve useful results. The apparatus and method is applicable to a variety of applications where large amounts of information are generated, and / or if the data exhibits fractal or chaotic attributes.

Embodiments of the invention relate to providing dynamic absolute-path symbolic links. According to one embodiment, indication of a symbolic link is received, which references a target, the indication including an absolute path of the target that includes a target mount point and a name of the target. A current mount point of the target is identified, and a verification is made that the target mount point is identical to the current mount point. When the target mount point is identical to the current mount point, a string length of the current mount point is determined, and an in-memory record of the symbolic link is created. The in-memory record includes the string length of the current mount point associated with the symbolic link.

The invention relates to a quantum key agreement method belonging to the technical field of information security, comprising the following steps: 1, two agreement communications users selecting respective positions in the agreement: if one user decides to select forward agreement, the user selects self to be the server end and the other user becomes the client; 2, the server end begins to monitor the network, then the client inputs the IP address of the server end and begins to connect the server end; 3, the two agreement communications users exchange original error rates and agreement data files with each other and undertake negotiation handling by winnow method which contains adaptive interval selection functions; 4, once inputting the bit string length obtained from the eavesdropper after agreement, any user can decide to begin a privacy enhanced process, so as to obtain a safe communication key in the textboxes of the two agreement communications users. The adaptive interval selecting method of the invention improves the rate of Winnow method, thus increasing the rate of the agreement method.

The invention discloses a method for realizing multicast and a bit forwarding router. The method includes the steps of obtaining bit string length information related with bit index display copying BIER on the node, packaging the BIER related information of the bit string length information in the type / length / value TLV of same BIER information, and notifying the TLV of the BIER information through a route protocol. Support of MPLS control surface and data surface in a BIER domain can be reduced.

In particular, this invention provides novel methods of populating data structures for use in evolutionary modeling. In particular, this invention provides methods of populating a data structure with a plurality of character strings. The methods involve encoding two or more a biological molecules into character strings to provide a collection of two or more different initial character strings; selecting at least two substrings from the pool of character strings; concatenating the substrings to form one or more product strings about the same length as one or more of the initial character strings; adding the product strings to a collection of strings; and optionally repeating this process using one or more of the product strings as an initial string in the collection of initial character strings.

Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having <len, distance> data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.

Techniques for comparing character strings include identifying a first character string having a first string length, and a second character string having a second string length greater than the first string length; parsing the first character string into one or more first sub-groups of characters; parsing the second character string into one or more second sub-groups of characters; comparing each of the one or more first sub-groups of characters against the one or more second sub-groups of characters; determining a ratio of a number of characters in the one or more first sub-groups of characters that match the one or more second sub-groups of characters and the second string length; and based on the ratio being greater or equal to a threshold, preparing at least one of the first or second character strings for display, the threshold including a variable value based on the first string length.

The invention provides a video decoding method and device, a video encoding method and device, equipment and a storage medium, and relates to the technical field of video encoding and decoding. The method comprises the following steps: decoding from a code stream to obtain string length information of a current string; determining a string length resolution of the current string; and determining the string length of the current string according to the string length information and the string length resolution. The preset string length resolution is decoded from string length information in a code stream to determine the string length of the current string according to the string length information and the string length resolution, and by taking the string length resolution as the divisionand decoding basis of the pixel string, the length of the pixel string in the coding block is limited to be multiple of the string length resolution, so that the uniformity of the pixel string is improved, a decoding end can decode under the condition of memory alignment, and the decoding efficiency of the pixel string is improved.

In particular, this invention provides novel methods of populating data structures for use in evolutionary modeling. In particular, this invention provides methods of populating a data structure with a plurality of character strings. The methods involve encoding two or more a biological molecules into character strings to provide a collection of two or more different initial character strings; selecting at least two substrings from the pool of character strings; concatenating the substrings to form one or more product strings about the same length as one or more of the initial character strings; adding the product strings to a collection of strings; and optionally repeating this process using one or more of the product strings as an initial string in the collection of initial character strings.

The invention relates to a configuration method of a high-voltage transmission line insulator, belonging to the technical field of transmission line insulation design of a power system. The method comprises the steps as follows: firstly, a mapping table is established according to the existing experience or the corresponding standards, thereby estimating the string length of the insulator to be selected, wherein the insulator is needed in line design; the insulator to be configured is chosen according to the string length of the insulator in the mapping table and mechanical requirements; for a specific insulator to be configured, the salt deposit density of the operated insulator is calculated and the pollution flashover voltage is acquired by the data of the pollution test; in consideration of revisions of a plurality of affection factors, the withstand voltage of the insulator to be configured is calculated and the string length of the insulator is determined according to the target voltage of the line to be designed; and finally, the string length and the string length threshold in the mapping table are calibrated, thereby determining final insulation configuration result. The method realizes two functions of insulator type selecting and size configuration and directly uses the results of the pollution test to calculate, so as to ensure the precision and reliability of insulator configuration to meet the requirements on line pollution outer insulation design.

A bridge for providing adjustable active string length on acoustic stringed musical instruments comprised of a concavity surrounding a plurality of individually adjustable saddles that are arranged individually and independently to support each string and be freely moveable into position by an adjustment screw to obtain the harmonic at the 12th fret, and then can be locked in place by action of a contiguous wedge that causes firm contact between the saddles and lateral sides of the concavity.

A mechanism is described for the computer-aided generation of anonymized data records (44) for developing and testing application programs that are intended for use in a productive network. A method according to the invention comprises the provision of at least one productive database containing data records (40) that contain productive data elements to be anonymized, the provision of at least one non-productive database containing data records (42) that, in regard to the character string length of the data elements contained therein, at least partly correspond to the productive data records, the dertermination of a first data record (40) from the productive database and of a second data record (42) from the non-productive database and also the generation of anonymized data records (44) by replacing the data elements to be anonymized in the first data record (40) by data elements of the second data record (44).

The invention discloses a short link address generating method and a system thereof. The method comprises the following steps of receiving a link address conversion request and generating a corresponding Hash value for an original URL based on a Hash algorithm; determining whether a memory cache has a short link address matching with the Hash value, and if the memory cache has the short link address, directly returning the short link address; otherwise, taking one resource from a short link resource pool to generate the short link address, and returning the newly-generated short link address and storing in the memory cache, wherein the short link resource pool is created according to a generation strategy corresponding to a short link address resource demand; the generation strategy includes a selected coding character set and an only identification character string length corresponding to the short link address; and the short link resource pool carries out resource expansion through changing the only identification character string length. In the invention, a short link address retrieval conversion speed is increased and a problem that a collision possibility is increased because a value domain of a Hash function is too small is effectively avoided so that system availability is increased.

A method of dictionary coding using coding unit (CU) based processing or using string length coding by taking into account of color component aligned matched sample-strings are disclosed. In the dictionary coding using CU based processing, the pixels in each CU is converted to one-dimensional (1-D) pixel data according to an intra-block scanning pattern. A string search is then performed to determine a match condition regarding whether a current sample-string starting at a current position of the current 1-D packed pixel data matches a previously coded sample-string in the reference 1-D packed pixel data. For string length coding by taking into account of color component aligned matched sample-strings, a flag is signaled to indicate whether the string length of one previously coded sample-string is in a length group corresponding to color-component-aligned previously coded sample-strings.

The invention provides a catenary suspension string preplanning platform. The catenary suspension string preplanning platform mainly comprises an electric control device, an automatic wire sending and cutting device, a left copper sleeve pushing device, a right copper sleeve pushing device, a suspension string length control device, a hydraulic system, a suspension string tension presetting device and a reversing pressing ring device. The platform can intelligently control the procedures of automatically feeding the suspension string, penetrating a crimping pipe in a positive direction, encircling a heart-type ring, penetrating the crimping pipe in a negative direction, adjusting the tension of a stranded wire according to a preset value, determining the length of the stranded wire according to a preset value, automatically crimping a mechanical device, cutting off the wire according to the length requirement and the like, so that the manual intervention is reduced to the maximum extent. The catenary suspension string preplanning platform has the characteristics of high efficiency, high precision, high automation degree and the like as the traditional manual processing is replaced by mechanical intelligent production, can solve the problems such as poor precision, low efficiency and high reject rate existing in the current manual preplanning efficiently, can make up the blank of research in related fields at home and abroad, and can realize mechanical and professional construction of key procedures of the catenary construction.

The invention discloses a compressor and an impeller with big and small blades in which the small blade is non-total-height. The invention is characterized in that: a blade is arranged between two adjacent big blades of the impeller with big and small blades; the height in radial direction of the small blade is equal to three percents to fifteen percents of the height in radial direction of the big blade; the string length in axial direction of the small blade is thirty percents to eighty-five percents of the string length in axial direction of the big blade; the initial arc of the small blade is the same as the arc in the central section of the big blade, and the tailing edge is aligned with the tailing edge of the big blade. The invention has the advantages that not only the structure and efficiency of the blade is not influenced, but also the secondary flow of the airflow near the wheel hub surface and at the root section of the blade is inhibited effectively.

Methods and systems for processing text input within a MMI application framework are provided and may comprise creating at least one text editor by an active application and generating at least one text edit view by the text editor. Text input, for example, predictive input, multi-tap input and / or numeric input, which may be associated with the text edit view, may be received by the text editor. At least one text editor feature may be associated with at least one text editor and the text editor feature may comprise a maximum string length characteristic and / or a cursor characteristic. The text editor feature may be customized for each text editor view and the text input may be buffered by a buffer within the MMI application framework.

Disclosed is a string length adjusting device, which includes a fixed housing including a drum rotation shaft formed in a central region thereof; a rotation housing rotatably coupled with respect to the fixed housing; a winding drum inserted into the fixed housing and the rotation housing and including a winding part around / from which a string is wound or unwound; and a coupling unit guide shaft coupling the fixed housing to the rotation housing, the coupling unit guide shaft guiding up / down operations of the rotation housing for operations of winding or unwinding the string.

The embodiment of the invention discloses a data repeatability checking method and device as well as a system. The method comprises the following steps: matching the parameter of each character of the data with the parameter of a leaf node respectively in a parallel index tree to achieve that each leaf node in the parallel index tree respectively corresponds to one character, and the leaf node parameter at least comprises the character string length of the data containing the character and the position of the character in the character string; and judging whether the data and the saved data are repeated or not according to the matching result of each character, if not, the parameter of each character of the data is saved in the parallel index tree to serve as the leaf node. The checking method of data repeatability and the device thereof provided by the embodiment of the invention perform the parallel matching on the parameter value of each character of the data using the parallel index tree, and the scheme is independent of the database saving the data, thereby having smaller indexing quantity and significantly improving the checking efficiency of the data repeatability.

Polarization mode dispersion (PMD) induced system penalty ε is determined from optical characteristics of an optical wavelength division multiplexed (WDM) signal that is carried on a network. The method involves tapping the optical WDM signal, separating an optical channel from the tapped optical WDM signal, performing a frequency-resolved state of polarization (SOP) measurement on the channel, and computing the PMD-induced system penalty as ε=AL2+BL4, in which A and B are predetermined parameters and L is an SOP string length based on the SOP measurement.

A cap or visor consisting a crown portion or rim portion and a visor protion is secured to the front bottom of the crown portion. The crown portion, rim portion, or the visor portion, or any combination thereof is separated with at least one gap, both sides of the separated portion are punched with proper size, which are linked each other by the strings passing through the punched holes, and the string length controller is located in the rear of crown portion, which can be tightened or loosened.

The invention provides a wind-turbine impeller provided with an air-jetting flap airfoil blade. On the airfoil tail edge of the blade or on the pressure face near the tail edge, for example, apart from the front edge at a distance of 80-100 percent of the airfoil string length, a row of air-jetting holes are drilled from the blade tip to the blade root or in a range with selected radius on the blades. The angle between the air-jetting direction and the airfoil string is controlled between 15 and 90 DEG. Using air-jetting to replace the function of the conventional flap improves the output power of the wind-turbine, lowers the starting wind-speed, enlarges the working range, as well as consumes no additional power, and lowers the electricity generating cost. The air-jetting is produced when the rotating centrifugal force of the blade sucks the air in front of a hollow wheel hub.

The present invention discloses a multi-mode string matching method and apparatus, in order to improve the matching efficiency and the matching speed of multi-mode string matching. In the method, mode strings with the prefix inclusion relation in the mode strings are compressed into a mode string to obtain a compressed mode set; a prefix set is constructed according to the compression mode set; and the AC automaton is constructed according to the preset algorithm. The method comprises: for each to-be-matched text string, successively inputting characters contained in the current sliding window into the AC automaton so as to obtain at least one initial matching position; for each initial matching position, if the length of the matched string of the initial matching position is less than the preset length, adding the initial matching position and the matched string into a matching result set; if the length of the matched string of the initial matching position is equal to the preset length, adding the initial matching position into a secondary matching entry set; and carrying out secondary matching for each entry position, and adding the entry position of the secondary matching and the matched string into the matching result set.

An apparatus for doubling of the length of each string of a stringed instrument using two legs of an extended string. The effective longer string length allows for the production of a lower tone range without lengthening the neck of the instrument, or the same tone range while shortening the neck of the instrument. If required to prevent bowing of the neck, a reinforcing structure may be included to the neck structure or in a second preferred embodiment a buttress support to the neck of the instrument may be provided. The height of the paired strings above the fret board may also be adjusted.

The invention discloses a method and system for intelligently matching and showing recommended information of a web page according to a product title. The method comprises the following steps: first, extracting the product title on the web page; then, conducting Chinese word segmentation for the product title, matching with product words in a product word bank, and taking out the product words; obtaining the string length of the product words, and taking out the product word with the longest string length as a kernel keyword; finally, matching with information containing the kernel keyword as the recommended information from an information bank, and picking the recommended information onto a page showing interface to be showed. The method and the system can automatically match and show the recommended information of the web page only according to the product title on the page, so that the fact that technical staff manually set the recommended information backstage in the past is avoided. The operation is simple and convenient, the workload is greatly relieved, and the working efficiency is increased. In addition, when the production information in the information bank needs to be updated, as the method and the system automatically match the recommended information, the manual update of the technical staff is avoided, and the updating speed is increased.

The method is as the follows. To make statistic for the ratio of 0 and 1 in original test data, all extranous bits are assigned to be 0 and to code as per 0 string if 0 data bits are less then, data bits in the original test data, otherwise to code as per 1 string. Using bit sting as basic unit to divide the said test data for counting length of the bit string code table of adaptive variable length compression method is utilized to convert bit string length into code word to achieve data compression. The decoding method uses decoding unit organized with adaptive variable length compression method to carry on decoding.

The invention relates to a backup and query method of FLASH-based small data. The method aims at the small data with fixed string length and backup cycle, time and date of backup data and a mapping relation of the storage area position of a FLASH chip are established, multiple circulation is not needed to use for searching the storage position and a query point in the whole chip range, and a time label is only needed to write in when each data storage page starts to write. A sector is used as an operating unit during the data storage, and the sequence is identified through a sector number and the time label of a page. When a sector is filled with data, the earliest used sector is searched, cleaned up and used as a current working sector, so that even abrasion can be achieved. According to the method, data storage and query are simple and fast, and the defects of limited resources and low processing speed of a single chip microcomputer are effectively overcome.