98 results about "Binary strings" patented technology

A system and method for multi-level compaction of floating-point numbers and associated metadata within datasets. The system identifies floating-point numbers and their associated metadata, pre-encodes numbers into binary string representations, and encodes metadata into compact binary form. These encoded elements are linked together and indexed to indicate they represent floating-point numbers with metadata. The dataset is organized into multiple compaction levels based on semantic relationships between metadata elements. The system creates specialized indices for metadata-based retrieval, maintains relationship maps, and implements inheritance policies across hierarchical levels. During retrieval, the system reconstructs both the original floating-point values and their associated metadata, preserving hierarchical relationships. This approach enables more intelligent data organization, richer contextual information preservation, and more powerful query capabilities while maintaining efficient floating-point compaction.

A method includes receiving a bit string at a processor, performing an error correction, and causing transmission of a modulated signal. The error correction includes identifying a set of binary strings based on the bit string, mapping each binary string from the set of binary strings to a first abelian group element from a set of first abelian group elements, and applying a generalization of polar codes to the set of first abelian group elements to produce a set of second abelian group elements. The error correction also includes mapping each of the second abelian group elements to an in-phase / quadrature (I / Q) point from a set of I / Q points and identifying real-valued points based on the set of I / Q points, each of the real-valued points representing an I / Q point from the set of I / Q points. The modulated signal has a modulation that is based on the real-valued points.

A method and an apparatus including processing circuitry are provided. The processing circuitry determines previous probability information associated with each entropy coded region of multiple regions in a previous picture. The processing circuitry selects, based on (i) a location or a quantization parameter of an independently decodable coding segment in a current picture or (ii) syntax information of the independently decodable coding segment, a region among the multiple regions. Initial probability information for one or more current syntax elements of a block in the independently decodable coding segment is determined based on the previous probability information associated with the selected region. The one or more current syntax elements are first to be entropy decoded in the independently decodable coding segment. The processing circuitry entropy decodes coded bits associated with the one or more current syntax elements into a bin string based on the initial probability information.

The invention discloses a task processing method and device based on quantum computing, equipment and a storage medium. The method comprises the steps of determining a maximum cut problem corresponding to a target task and a weighted undirected graph of the maximum cut problem; performing community detection division on the weighted undirected graph to obtain a plurality of community sub-graphs; mapping the community sub-graph into a sub Hamiltonian and constructing a parameterized quantum circuit; updating parameters of the parameterized quantum circuit by adopting a gradient descent algorithm to minimize a global Hamiltonian expected value, and outputting a binary string of a quantum state corresponding to the global Hamiltonian expected value as an initial solution; generating a plurality of candidate solutions for the initial solution based on a neighborhood search algorithm, calculating cut values of the initial solution and the candidate solutions, and selecting a better feasible solution based on the optimal cut value; and applying a preset disturbance operator in the parameterized quantum circuit to construct a disturbance quantum circuit, updating parameters of the disturbance quantum circuit by adopting a gradient descent algorithm, and outputting a binary string of a quantum state corresponding to the global Hamiltonian expected value as a final solution of the target task by minimizing the global Hamiltonian expected value after disturbance.

This application provides a charging pile communication method, electronic device, and computer program product, relating to the field of charging pile technology. The method, applied to a charging pile, includes: sending a pulse width modulation (PWM) control guidance signal (CP signal) to a vehicle; determining a binary field corresponding to each signal cycle based on the peak voltage of the CP signal adjusted by the vehicle within each signal cycle and a preset voltage threshold; combining the binary fields corresponding to multiple signal cycles to obtain a binary string; and obtaining vehicle information based on the binary string. This method enhances the communication scheme between the charging pile and the vehicle in an AC charging system for electric vehicles.

The invention provides a shape-based template matching method, and belongs to the technical field of machine vision, and the method comprises the steps: obtaining a plurality of template images with different scales and angles; respectively calculating the gradient, the feature vector and the feature point at each pixel point on each template image; for a test image, calculating feature vectors and feature points of the test image, performing gradient direction expansion on each feature point to obtain a gradient direction quantized value, and enabling the gradient direction quantized value to correspond to a unique binary character string; a plurality of lookup tables are created, the index number of each lookup table corresponds to each binary character string, and the index value corresponds to the cosine value of the feature point and the feature vector corresponding to the binary character string; extracting template images and feature information of the template images, performing sliding window matching on the template images on the test images in the horizontal and vertical directions, acquiring overall similarity, and judging whether the test images are successfully matched with the corresponding template images or not; according to the invention, the matching speed and accuracy can be effectively improved.

The present disclosure describes a method for conditioning and preprocessing raw cosmic ray data to extract features and generate a binary string representing the inherent randomness in the data. Measurable characteristics of cosmic ray particles, such as arrival times and amplitudes, are processed to create random binary sequences. These binary strings are then used to train a generative adversarial network (GAN) framework. In the GAN framework, the generator creates random sequences resembling the target distribution, which matches the entropy of the conditioned cosmic data. The discriminator evaluates the generated sequences by comparing them to the conditioned cosmic data and assigns a randomness score that characterizes the quality of the generated sequences. This adversarial process ensures the generation of high-quality random sequences that are statistically indistinguishable from the conditioned input data.

This invention provides a stylizable and deformation-resistant QR code encoding and recognition method based on topological coding, comprising: converting the binary string to be encoded into natural numbers using a bijective function and recursively decomposing it to generate a topological tree structure; determining the spatial allocation ratio based on the tile traces of each node in the topological tree; performing inward shrinking processing on the polygonal region carrying the QR code, recursively dividing it into non-overlapping closed sub-regions according to the ratio, mapping the hierarchical structure of the topological tree to a QR code with a nested structure and stylizing it; scanning the QR code image and performing preprocessing, extracting the boundary contours of the closed regions and constructing a global topological tree, enumerating multiple candidate topological trees and decoding them one by one, and filtering out the valid binary information as the recognition result after CRC verification. This invention achieves the deformation resistance of the QR code through the mapping of the topological tree structure and nested regions, and improves its visual effect and application flexibility through stylization processing.

An image decoding method according to the present document may comprise the steps of: deriving residual samples by applying at least one of LFNST and MTS to transform coefficients; and generating a reconstructed picture on the basis of the residual samples, wherein the LFNST is performed on the basis of an LFNST transform set, an LFNST kernel included in the LFNST transform set, and an LFNST index indicating the LFNST kernel, a first bin of a syntax element bin string for the LFNST index is derived on the basis of different context information according to a tree type of a current block, and a second bin of the syntax element bin string is derived on the basis of preconfigured context information.

The invention provides an AMF key generation method and device and a storage medium, relates to the technical field of mobile communication and quantum key distribution, is applied to a terminal, and comprises the following steps: receiving a measurement base sequence sent by a first quantum key distribution module, and sending the measurement base sequence to a core network device; receiving a measurement base result sequence sent by the core network equipment, and sending the measurement base result sequence to a first quantum key distribution module; receiving a first AMF key sent by the first quantum key distribution module; the first AMF key is generated based on the measurement base result sequence, the measurement base sequence and the second set of binary strings; the measurement base sequence and the second group of binary strings are obtained by measuring the quantum messenger sent by the second quantum key distribution module by the first quantum key distribution module. According to the application, the quantum key distribution technology is applied to a 5G communication security mechanism, and the security in an AMF key generation process is improved, so that the overall security of a communication system is improved.

A multi-component system for identity resolution and customer segmentation utilizes bitmap encoding to overcome storage and processing limitations of traditional approaches. The system comprises a bitmap encoding processor that associates binary strings with user identities in an identity graph, where each bit corresponds to a unique segment and indicates user membership through bit state. A metadata association table stores descriptive information for each segment and dynamically links to the encoding processor for automatic updates. The binary strings serve dual purposes as both segment representations and user identifiers, eliminating separate identifier systems. The system can be implemented as a software development kit and deployed across various hardware architectures, making previously cost-prohibitive large-scale segmentation operations computationally feasible.

The application discloses a data processing method of multi-point shared register and related devices, and relates to the technical field of software, which comprises the following steps: reading the sixteen-bit integer values of each register in a Modbus slave device, each register being occupied by at least one logical point and each logical point being pre-configured with position occupation information; converting the sixteen-bit integer values of each register into corresponding binary strings, and intercepting the binary string of each logical point from the binary string of the occupied register according to the position occupation information of each logical point; and converting the binary string of each logical point into a corresponding decimal value, and storing the decimal value of each logical point into a local cache. The application can accurately extract the values of different logical points in the scene of multi-point shared register, improve the utilization rate of register bit resources, reduce the cost of equipment, and maximize the number of accessible points.

A method for decoding a video from a video bitstream is provided and includes: accessing a binary string representing a partition of the video, the partition comprising a plurality of coding tree units (CTUs) forming one or more CTU rows; for each CTU of the plurality of CTUs in the partition, determining whether the CTU is the first CTU in a slice or a tile; in response to determining that the CTU is not the first CTU in a slice or a tile, determining whether parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile; in response to determining that the parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile, determining an available flag for a top neighboring block of the CTU.

An adder for binary strings comprises a plurality of adder circuits arranged such that each adder circuit executes an addition of bits in the same position on a pair of binary substrings at the same t

The present disclosure is directed to a method for data bus inversion. The method includes determining a first metric associated with transitioning a data bus from carrying a first binary string to carrying a second binary string. The method includes determining a second metric associated with transitioning the data bus from carrying the first binary string to carrying a complement of the second binary string. The method includes transitioning the data bus from carrying the first binary string to carrying the second binary string or the complement of the second binary string based on the first metric and the second metric.

In some embodiments, a video decoder decodes a video from a bitstream of the video using a history-based Rice parameter derivation along with the wavefront parallel processing (WPP). The video decoder accesses a binary string representing a partition of the video and processes each coding tree unit (CTU) in the partition to generate decoded coefficient values in the CTU. The process includes prior to decoding the CTU, determining whether WPP is enabled and the CTU is the first CTU of a current CTU row in the partition, and if so, setting a history counter to an initial value. The process further includes decoding the CTU by calculating the Rice parameters for transform units (TUs) in the CTU based on the value of the history counter and decoding the binary string corresponding to the TUs in the CTU into coefficient values of the TUs based on the calculated Rice parameters.

A system and method for multi-level compaction of floating-point numbers and associated metadata within datasets. The system identifies floating-point numbers and their associated metadata, pre-encodes numbers into binary string representations, and encodes metadata into compact binary form. These encoded elements are linked together and indexed to indicate they represent floating-point numbers with metadata. The dataset is organized into multiple compaction levels based on semantic relationships between metadata elements. The system creates specialized indices for metadata-based retrieval, maintains relationship maps, and implements inheritance policies across hierarchical levels. During retrieval, the system reconstructs both the original floating-point values and their associated metadata, preserving hierarchical relationships. This approach enables more intelligent data organization, richer contextual information preservation, and more powerful query capabilities while maintaining efficient floating-point compaction.

A method used when adding two numbers in the form of binary strings, which makes a given bit position in one of the binary strings available to store a carry-over value. The method comprises the steps

In some embodiments, a video decoder decodes a video from a bitstream of the video using a history-based Rice parameter derivation. The video decoder accesses a binary string representing a partition of the video and processes each coding tree unit (CTU) in the partition to generate decoded coefficient values in the CTU. The process includes updating a history counter for a color component for calculating Rice parameters and prior to calculating a next Rice parameter, updating a replacement variable based on the updated history counter. The process further includes calculating the Rice parameters for transform units (TUs) in the CTU based on the value of the replacement variable and decoding the binary string corresponding to the TUs in the CTU into coefficient values of the TUs based on the calculated Rice parameters.

A method for decoding a video from a video bitstream is provided and includes: accessing a binary string representing a partition of the video, the partition comprising a plurality of coding tree units (CTUs) forming one or more CTU rows; for each CTU of the plurality of CTUs in the partition, determining whether the CTU is the first CTU in a slice or a tile; in response to determining that the CTU is the first CTU in a slice or a tile, initializing context variables for context-adaptive binary arithmetic coding (CABAC) according to a first context variable initialization process; in response to determining that the CTU is not the first CTU in a slice or a tile, determining whether parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile.

In some embodiments, a video decoder decodes a video from a bitstream of the video using a history-based rice parameter derivation. The video decoder accesses a binary string representing a partition of the video and processes each coding tree unit (CTU) in the partition to generate decoded coefficient values in the CTU. The process includes updating a replacement variable for a transform unit (TU) in the CTU for calculating rice parameters independently of the previous TU or CTU. The process further includes calculating the rice parameters for TU in the CTU based on the value of the replacement variable and decoding the binary string corresponding to the TU into coefficient values based on the calculated rice parameters. Pixel values of the TU can be determined from the decoded coefficient values for output.

In some embodiments, a video decoder decodes a video from a bitstream of the video using a history-based Rice parameter derivation. The video decoder accesses a binary string representing a partition of the video and processes each coding tree unit (CTU) in the partition to generate decoded coefficient values in the CTU. The process includes updating a history counter for a color component for calculating Rice parameters and prior to calculating a next Rice parameter, updating a replacement variable based on the updated history counter. The process further includes calculating the Rice parameters for transform units (TUs) in the CTU based on the value of the replacement variable and decoding the binary string corresponding to the TUs in the CTU into coefficient values of the TUs based on the calculated Rice parameters.

The application discloses a quantum adder, an operation method and related devices. The quantum adder comprises a plurality of chips connected through an EPR module. One chip is used for processing one data segment. The data segment comprises an addend segment and a summand segment. The chip comprises: an addition module, which is used for obtaining an addition result and carry information of the data segment based on a quantum Fourier transform; a loading module, which is used for loading the carry information transmitted through the EPR module on the addition result and the carry information obtained by the chip based on the addition module, so as to update the addition result and the carry information of the chip; and an inverse quantum Fourier transform module, which is used for converting the latest addition result into a binary string. According to the embodiments of the application, the efficiency of the addition operation in quantum computing can be improved.

The invention provides a vector database construction method and system, and relates to the technical field of databases. The method comprises the steps of performing normalization processing on an original vector so as to limit a sudden change value and zoom the sudden change value to a unified range; recursive dichotomy is carried out on the value range of each dimension, binary codes are allocated to each interval, and mapping of the intervals and the codes is dynamically recorded through a skip list; alternately combining codes of all dimensions of the normalized vector to generate a global binary string; and finally, taking the binary string and the original vector as a joint primary key, and constructing a B + tree index. According to the method, a high-dimensional proximity problem is converted into a prefix matching problem of a one-dimensional space, and excellent characteristics of a B + tree and a skip list are utilized, so that efficient insertion, deletion, modification, accurate query and fuzzy query of high-dimensional vector data are realized; the problems of complicated calculation, high storage overhead, difficulty in dynamic updating and low query speed of the traditional method on high-dimensional data are effectively solved.

The application discloses a service parameter comparison method, device, system and storage medium, and belongs to the field of big data processing. The method comprises the following steps: obtaining a first interaction string and a first result string based on a first binary string obtained by converting a first service parameter of a first device, a first label string randomly generated, and an initial random string agreed upon; sending the first interaction string to a second device, so that the second device obtains a second result string based on a second binary string obtained by converting a second service parameter of the second device, the initial random string, a part of the second label string randomly generated, and the first interaction string; and interacting with the second device based on the first result string and the second result string, performing fragmentation calculation, and obtaining a first comparison result. According to the embodiment of the application, the efficiency of service parameter comparison of multiple parties can be improved.

A method for formatting a binary string in such a way that the need to consider a carry-over bit from an upstream adder is removed, by splitting the binary string into a pair of binary substrings and

This application discloses a method and apparatus for confidence level assessment. The method includes: constructing a repeating permutation of an N-digit binary string; constructing a first mapping relationship between decimal values ​​and confidence levels based on the repeating permutation; and specifying that the decimal values ​​in the first mapping relationship are related to the confidence levels in the repeating permutations. N Each binary string is mapped one-to-one, where N is an integer greater than or equal to 2. The data to be evaluated is obtained and converted into a decimal comparison value. The data to be evaluated is N-digit binary data. A decimal value matching the decimal comparison value is determined based on the first mapping relationship. The confidence level corresponding to this decimal value is set as the confidence level of the data to be evaluated. According to the embodiments of this application, the confidence level generation process is simple, and the real-time output of the confidence level is good.

The application discloses a binary descriptor acquisition method based on local voxel coding, comprising the following steps: firstly, extracting local point clouds around key points, calculating a local reference frame from the local point clouds, and converting the local point clouds into the local reference frame; then, voxelizing the converted local point clouds, comparing the relationship between occupied voxels for each layer, obtaining a binary string, and concatenating all the binary strings to obtain a binary descriptor. After extracting key points of two point clouds to be registered, the descriptor proposed in the application is calculated on the key points. Through the descriptor, the pairing between the two point clouds can be established. The better the matching effect of the descriptor is, the more correct pairings can be established, and the point cloud registration is ensured to be successful.

The present invention discloses a low-computing-power feature extraction and data compression method for acceleration sensor data. The method includes a feature extraction algorithm for three-axis acceleration sensor data, and a data compression algorithm for the extracted features. After the acceleration data is segmented by a sliding window, the resultant acceleration direction is calculated. According to the pre-defined base directions, the base direction numbers are used to replace the resultant acceleration directions in sequence according to the proximity principle. The direction codes are counted to obtain a histogram of the frequency of occurrence of each base direction in a single sliding window. In a short period of time, the distribution of the resultant acceleration direction is relatively concentrated. Based on this property, the value 0 is encoded as a single bit with a value of 0. For non-zero values, 8 bits are used to represent it. The first bit is fixed to 1 as a flag bit, and the last 7 bits are the binary values ​​of the corresponding frequencies. The encoded binary string is used for data transmission. Application of this method can save the computational overhead of the feature extraction and data compression process and reduce the overall power consumption of the device.