272 results about "Binary strings" patented technology

A method of keyless encryption of messages allows secure transmission of data where data security is not available for some technical or legal reason. The method of data transfer uses a challenge response in which a correct response to a challenge is used to transmit the value "1", while a deliberately false response is made to transmit the value "0". Any message can be transmitted as a binary string using successive applications of this method.

A method of establishing a shared secret random cryptographic key between a sender and a recipient using a quantum communications channel is described. The method comprises: generating a plurality of random quantum states of a quantum entity, each random state being defined by a randomly selected one of a first plurality of bases in Hilbert space, transmitting the plurality of random quantum states of the quantum entity via the quantum channel to a recipient, measuring the quantum state of each of the received quantum states of the quantum entity with respect to a randomly selected one of a second plurality of bases in Hilbert space, transmitting to the recipient composition information describing a subset of the plurality of random quantum states, analysing the received composition information and the measured quantum states corresponding to the subset to derive a first statistical distribution describing the subset of transmitted quantum states and a second statistical distribution describing the corresponding measured quantum states, establishing the level of confidence in the validity of the plurality of transmitted random quantum states by verifying that the first and second statistical distributions are sufficiently similar, deriving a first binary sting and a second binary string, correlated to the first binary string, respectively from the transmitted and received plurality of quantum states not in the subset, and carrying out a reconciliation of the second binary string to the first binary string by using error correction techniques to establish the shared secret random cryptographic key from the first and second binary strings.

A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.

A particle swarm algorithm is applied to an optimum coverage problem of wireless sensor network nodes, and the invention provides a coverage mechanism of the particle swarm optimization algorithm based on a discrete binary edition, and the mechanism is used for performing optimal solution on the wireless sensor network node coverage problem. The method comprises the following steps: defining the wireless sensor network node coverage problem as a 0/1 planning problem, encoding individuals of a binary particle swarm algorithm as a 0/1 binary string and then performing optimization by an evolutionism of the particle swarm algorithm. In the method, two important indexes are defined to evaluate the solution results, one index is 'coverage' of a region, and the other index is 'consumption rate' of the sensor. Validity and high efficiency of the algorithm are verified by a simulation experiment.

The invention discloses a cellphone based dynamic two-dimension code access control system. The cellphone based dynamic two-dimension code access control system comprises a cellphone and an access control device with a two-dimension code identification module, a two-dimension code application module is arranged in the cellphone, a binary string code is generated through twice encryption calculation of a preset secret key, a time parameter and the IMEI (International Mobile Equipment Identity) code of the cellphone, and a two-dimension code image generated by the binary string code is used as a key for opening the door; the two-dimension code image is obtained through scanning of the two-dimension code identification module, and the IMEI code for opening the door and the key generation time are obtained through identification and decoding, the door is opened after verification, and the key which is used for opening the door this time is abolished. The cellphone-based dynamic two-dimension code access control system has the characteristics that one key only can open the door once and can not be copied, the security is high, and the cellphone is used as the carrier of the key to achieve carrying convenience.

A method and algorithm of authentication between parties includes receiving a randomly generated binary string. A shared secret of the parties is combined with the randomly generated binary string to form a new binary string. A binary pair (A, B) is initiated; a first bit of the new binary string is read. A current value of B is added to A when the read bit is zero, and a current value of A is added to B when the read bit is one. A next bit of the new binary string is read. The steps of adding the current values and reading a next bit are repeated until all bits have been read. A resulting binary pair (A, B) is returned after all of the bits have been read. Ephemeral Diffie-Hellman public keys are securely exchanged between the parties. Challenge responses are exchanged and a session key is agreed upon.

A method and apparatus for compressing three-dimensional point cloud data is disclosed. In one aspect, a method for compressing three dimensional point cloud includes steps of retrieving three-dimensional point cloud data; providing one or more grids to the three-dimensional point cloud data; assigning one binary digit to each three-dimensional grid voxel containing said point cloud data and assigning the other binary digit to each three-dimensional grid voxel that does not have said point cloud data; converting the three-dimensional grid into two-dimensional tiles; and storing information of a plurality of binary strings in said two-dimensional tiles. In one embodiment, the step of storing information of a plurality of binary strings in said two-dimensional tiles includes a step of storing the number of repeating times of each binary digit in the binary strings. The method can significantly reduce memory space, as well as preserving small details of the point cloud.

The present invention provides a method for designing DNA code consisting of a set of information codes as an information carrier to write optional information into an optional noncoding region not including any DNA genetic information which can avoid an error occurring when the designed DNA is used. A set S1 of the base sequences corresponding to a signal unit for information transmission is obtained as follows: 1) selecting a template such that its Hamming distance of templates, against its block shift, and against the ligated sequences are equal to or above the predetermined value, when DNA sequence of predetermined length is specified by the binary string of 0 and 1 (template), meaning that the position of G or C ([GC]), or A or T ([AT]) are fixed, 2) further selecting a template having a subword constraint of length m from the set of the selected templates, and 3) combining thus selected template and codewords of the predetermined error-correcting codes having a subword constraint of length m.

The invention provides an identity authentication method and system using fingerprints in an open network. The identity authentication system comprises an authentication terminal, an authentication server, a token and an authentication information issuance server. The identity authentication method comprises the following steps: the authentication terminal or the token calculates a hash value in the event that transformation detailed points and a random binary string are cascaded with each other, the token encrypts the hash value, the authentication terminal transfers the encryption result of the token to the authentication server, and the authentication server cascades the encrypted binary string with each stored template set value and calculates a cascaded hash value; and the authentication server judges whether identity of a user is accepted according to the number of the transformation detailed points matched with the hash value. By adopting the identity authentication method and system, private fingerprint data of the user and the authentication server is not leaked to each other during the fingerprint identity authentication process in an open network environment, which protects data privacy of the user and the authentication server.

A system for three-dimensional reconstruction of a surface profile of a surface of an object is provided that utilizes a binary pattern projected onto the surface of the object. A binary string consisting of a series of “1”s and “0”s is first created, and a binary pattern of light that is constructed in accordance with the binary string such that bright and dark bands of light of equal widths correspond to “1”s and “0”s from the binary string respectively is projected onto the surface. The binary pattern is shifted with respect to the surface multiple times, during which an image of the binary pattern illuminating the surface is obtained at each position of the binary pattern. Thereafter, a height of each predetermined point on the surface is calculated relative to a reference plane based upon the images cumulatively obtained at said predetermined point.

The invention discloses a vector dot product accumulating network supporting reconfigurable fixed floating point and configurable vector length, comprising a parallel reconfigurable multiplying unit for receiving vectors B, C, FBS and U as input, and performing vector multiplying operation to obtain multiplying result B*C of the vectors B and C; a floating point index and mantissa pre-processing part for receiving multiplying result B*C of the parallel reconfigurable multiplying unit and scalar A as input, finishing operations of selecting maximum floating point index, subtracting the indexes, shifting and aligning, complementing bits and converting and sticky compensating to obtain processed vector result B*C and scalar result A; a reconfigurable compressor for receiving processing result of the floating point index and mantissa pre-processing part, and compressing the result to obtain a sum string S and a binary string C; and a floating point index and mantissa post-processing/fixed point operating part for receiving the sum string S and the binary string C of the reconfigurable compressor, and finishing mantissa addition and post-processing to obtain a final vector dot product accumulating result.

The invention provides a source irrelevant quantum random number generation method, which comprises the following steps: receiving a photon signal emitted via a source by a receiving end, and converting a multiphoton signal contained in the photon signal into an equivalent single-photon signal; carrying out X basis vector or Z basis vector modulation on the single-photon signal, and carrying out projection measurement on an X basis vector or Z basis vector; according to the measurement result of the Z basis vector, calculating an error rate; according to the measurement result of the X basis vector, obtaining parts of random binary string; obtaining the minimum entropy of the parts of random binary string, and carrying out aftertreatment to obtain a completely random binary string. The method disclosed by the invention does not need to depend on source hypothesis, a true random number guaranteed by quantum mechanics can be generated, and the method can tolerate high channel loss, and has high practical value. The invention also provides a source irrelevant quantum random number generation device.

A method for error control in multilevel memory cells storing a configurable number of bits. The error control is performed using an error-control code which operates, in the encoding phase, on b-bit binary strings made up of k symbols of r-bit data. When the memory cells store a number r of bits, a data symbol is formed only with the data bits stored in a memory cell. When the memory cells store a number s of bits smaller than r, a data symbol is formed with the data bits stored in a memory cell and with r-s bits having a pre-determined logic value, in which the data bits stored in the memory cell are arranged in the least significant part of the data symbol, and the r-s bits having a pre-determined logic value are arranged in the most significant part of the data symbol.

A gene is disclosed for use in a predictive genetic algorithm that performs time series interactions between dataset variables. The temporal logic that performs the interaction is encoded as a binary string.

The invention is in use for intelligentized analyzing data source collected in intrusion detection system. The invention includes methods of anomaly detection under host condition and network condition. The method includes following steps: first obtaining data source to be detected including host audit data and data of network data packet, characters of which are formatted as binary element string character string in length L; then, based on data source under normal condition, set of tester is generated; finally, using the set of tester carries out anomaly detection for real data. Based on host audit data and data of network data packet, the invention implements overall process: data acquisition, feature extraction and intrusion detection. Features are: system in distributed, lightweight level, and having fine characteristics of biological immune system: self-organization, diversity and self-adapting.

The invention discloses a genetic algorithm-based classification algorithm parameter optimization method, and belongs to the field of algorithm parameter optimization. The method comprises the following specific steps: (1) making a coding and decoding rule; (2) performing population initialization; (3) performing cyclical iteration; (4) decoding to obtain an optimal parameter. Aiming at the parameter optimization problem of a classification algorithm, all parameters are discretized according to numerical values and sequentially connected into a binary coding sequence, each individual corresponds to a binary string, each performance indicator value weight of the classification algorithm is used as fitness, the fitness is used as a standard for judging the quality of the individual to maintain a group, and the finally obtained group is coded to obtain a corresponding parameter value and further obtain an optimal parameter combination; the method is suitable for various classification algorithms for parameter constraint of the parameter sensitivity.

A method of reference position determination for a DGNSS base station. The base station comprises a memory, a logic controller and a GNSS receiver. Stored reference positions are stored in the memory as coordinate sets comprising components. The GNSS receiver determines a current estimate position of the base station as a coordinate set comprising components. The logic controller retrieves a stored reference position, converts the components of the stored reference position and the current estimate position to binary string format. The current estimate position is matched to the stored reference position by matching the binary string format components of the current estimate position with the binary string format components of the stored reference position. If the stored reference position is matched to the current estimate position, the base station is assigned the stored reference position as its reference position.

A system, method and computer program product for encoding an input string of binary characters representing alphanumeric characters. A system includes: a register for storing a two dimensional cellular shape definition including a starting empty cell; a character writing engine for writing a binary character to an empty cell with a predefined initial position; a next cell determination engine for determining a next empty cell by methodically traversing neighboring cells in the two dimensional shape until an empty cell is located; a loop facilitator for looping back to the character writing engine and the next cell determining engine until there are no more data characters or a next empty cell is not determined; and a serialization engine for methodically serializing the two dimensional cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

The invention provides a parallel evolution super-network DNA micro array gene data sorting system and method based on a GPU and relates to the technical field of intelligent information processing. After preprocessing on DNA micro array data is carried out, a processed binary string is used as input information of a super-network, the super-network is initialized on a CUP of a host computer, the initialized super-network is transferred to the GPU, a hyperedge bank is divided into a plurality of sets of hyperedges, evolution studies based on a genetic algorithm are executed in parallel on the GPU respectively to acquire priori knowledge, the best hyperedge with decision-making ability is searched, and the super-network after evolution carries out classification on input samples by utilizing the hyperedges together. According to the parallel evolution super-network DNA micro array gene data sorting system and method based on the GPU, super-network parallel evolution studies based on the genetic algorithm are achieved on the GPU, study time and recognition time are short, and system execution efficiency is high. The super-network can classify the samples by utilizing a plurality of singles with the decision-making ability together, and therefore system recognition rates and generalization ability are high.

A method and apparatus for context-adaptive arithmetic coding (CABAC) of a syntax element are disclosed. The bin string corresponding to a syntax element is processed by context- adaptive arithmetic coding with a reduced number of contexts using the bin-level bypass mode, bin-level context sharing, or both. The syntax element belongs to a group comprising merge_idx, ref_idx_lc/ref_idx_10/ref_idx_l1, pred_type, and cu_qp_delta. In one embodiment, the syntax element corresponds to merge_idx and three bins of the bin string with bin indices corresponding to 1, 2 and 3 are coded in the bin bypass mode. In another embodiment, the syntax element corresponds to ref_idx_lc/ref_idx_10/ref_idx_l1 and one or more bins of the bin string with bin indices larger than 1 or larger than 2 are coded in the bin bypass mode.

The invention provides a global optimization and construction method of a TRIE double-array, comprising the following steps of: 1. representing each node in a TRIE structure by using binary strings, wherein each bit in each binary string from left to right is in one-to-one correspondence with each subnode in each node, 1 represents that the subnodes are contained, and 0 represents that the subnodes are not contained, then rightwards shifting each binary string until the 0 bit is 1, and respectively recording the shifted binary representations and the shifted digits; 2. mapping all nodes in the TRIE to the corresponding class according to the binary representations of the nodes; 3. determining the stored sequence of each nodes of the TRIE in the double-array and recording the shifted basic value of each node in the double-array; and 4. setting a check and a base arrays according to the shifted basic value stored in each node, the parent-child relationships among the nodes in the TRIE and the shifted step length corresponding to each subnode.

The invention relates to a modified SHA-1 hash algorithm. The existing SHA-1 harsh algorithm has low security. The invention firstly adds a 1, a plurality of 0 and a 64-bit binary string after the information to be processed, then enlarges and groups the information, so the original 512-bit group is changed into a 1024-bit group and a register value is initialized; then a main cycle is utilized to sequentially process each group, the main cycle totally has four operations, and each operation contains logical function and compression function processing; and finally, after the processing of all the groups is completed, 160-bit message digest is output, and when the message digest is transferred, the message to be transferred is added with a safety hashed value. Through the algorithm of the invention, the original SHA-1 algorithm has more safety on message processing, and through modifying the logical function expression and the compression function logical structure of the algorithm, the efficiency of the SHA-1 algorithm is improved.