146 results about "Binary strings" patented technology

Methods, systems, and apparatus for generating a cryptographic hash digest. In one aspect, a method includes obtaining data representing a quantum circuit. An initial quantum state vector is generated, where the initial quantum state vector includes an input quantum state vector for the quantum circuit. The initial quantum state vector is used to generate one or more evolved quantum state vectors, where each evolved quantum state vector is generated by applying a respective portion of the quantum circuit to the initial quantum state vector. Logical operations are iteratively applied to floating point binary representations of the initial and evolved quantum state vectors to obtain a binary string, and a hash function is applied to the binary string to obtain a cryptographic hash digest of the quantum circuit.

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.

The invention discloses a part monitoring method, an electronic device, a storage medium and a product, and relates to the technical field of servers, the method is applied to a data processing unit card, the data processing unit card comprises N parts, N is a positive integer greater than or equal to 2, and the method comprises the following steps: obtaining the health state of each part in the N parts; a binary number corresponding to each component is generated based on the health state of each component, N binary numbers are obtained, each binary number is a first numerical value or a second numerical value, the first numerical value is used for indicating that the health state of each component is healthy, and the second numerical value is used for indicating that the health state of each component is abnormal; forming a binary character string by the N binary numbers according to a preset rule; and when a monitoring request sent by a substrate management controller at a host side is received, sending the binary character string to the substrate management controller. Multiple query command monitoring components do not need to be sent frequently, and occupation of a large number of system resources and network bandwidth is avoided.

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.

The invention discloses a neural network differential compression method and system, and the method comprises the steps: obtaining a sparse weight matrix and an index matrix, and carrying out the sorting and differential calculation of the weight of each line in the sparse weight matrix through the index matrix; each row in the difference matrix is used as a block, a bit width is additionally arranged behind the head data of the block, and the bit width represents the minimum bit width required by the binary system of the maximum difference value except the head data in the block; according to the minimum bit width and the distribution frequency required by binary representation of the maximum differential value except the header data in the block, determining the value of the bit width in the block and the storage bit width of other differential values except the header data; according to the storage bit width in the blocks, other differential values are converted into binary character strings meeting the storage bit width requirement, compression is completed after the binary character strings are connected with head data and binary representation of the bit width, lightweight of a network model is achieved, and finally corresponding decompression is designed according to actual operation of a compressed network by means of the programmable characteristic of FPGA hardware.

The invention discloses a multi-target ship scheduling method based on a GA-SA algorithm. The method comprises the following steps: obtaining ship information; comprehensively evaluating the throughput rate of the ship lock, the area utilization rate of a lock chamber of the ship lock, the average lock waiting time and the lockage fairness by using a fitness function; the selection state of the ship to be locked is coded into a binary character string, an initial population is generated, and individuals with high fitness are selected through selection operation to enter the next generation; performing crossover and mutation operation on the selected individuals to obtain a new population; in the main cycle of the genetic algorithm, part of individuals with high fitness are selected for each generation to perform simulated annealing optimization, disturbance operation is performed on the individuals with high fitness to obtain a new solution, whether the new solution is accepted or not is selected according to the probability, and after the temperature is reduced to the specified temperature, an optimal solution obtained by simulated annealing is reserved; and judging whether the number of iterations is reached, and if so, outputting the scheduling scheme with the highest fitness. The problem that traditional ship lockage scheduling depends on manpower and is low in efficiency is solved.

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 relates to the technical field of network security, and discloses a steganography method based on a generative image, which comprises the following steps: determining secret information, a shared key and a first feature group set, and encoding the secret information to obtain a binary string; acquiring a second feature group set according to the shared key and the first feature group set; obtaining a first feature text set according to the second feature group set and the binary string; randomly selecting one feature text from the first feature text set as an input feature text, and obtaining a secret-containing image by using the input feature text and a carrier image; after iteration is finished, a final secret-containing image is obtained; and performing secret communication by using the secret-containing image. According to the method, the capacity, the safety and the robustness of generative image steganography can be 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.

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.

The present invention discloses a method for optimizing the coverage of a wireless sensor network with a composite discretization strategy, including: converting coordinates into binary string form in combination with the range of the detection area; initializing the coordinates of each wireless sensor, and iteratively updating the coordinates of each wireless sensor in combination with the coverage rate: in each iteration, calculating the coverage rate according to the coordinates of the wireless sensor; determining whether the coverage rate meets the set requirements; if so, updating the coordinates of each wireless sensor using a V-shaped conversion function that changes with time; if not, updating the coordinates of each wireless sensor using an S-shaped conversion function that changes with time; when the set number of iterations is reached, outputting the updated coordinates of each wireless sensor. The above method can make the coordinate data more conform to the data characteristics, and make the optimization scheme achieve better performance, so as to optimize the coverage range of the wireless sensor network.

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.

Embodiments use quantum conditional logic in the Quantum Phase Estimation Algorithm (QPEA) to compute eigenvalues prior to inversion. Embodiments estimate the eigenvalues of a unitary, U=eiÂt, generated by a N×N Hermitian matrix Â. The binary representations of the n-bit estimations of eigenvalues of  may be encoded in these states: |λi=|b1b2 . . . bn; λi is an estimation of the i-th eigenvalue, excluding degeneracy, and .b1b2 . . . bn is its binary representation. To perform the eigenvalue inversion, an n-qubit controlled Ry rotation with angle λi / 2(n−1) conditioned on seeing |b1b2 . . . bn is applied for each possible n-bit binary string b1b2 . . . bn (2n values). The overall unitary is called a “uniformly controlled Ry rotation” in literature.

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.

Techniques and examples related to single-channel line-of-sight (LOS) communications are described. A transmitting end of the LOS communication involves direct modulation of light emitted from an optical transmitter. A receiving end of the LOS communication involves receiving a video stream of the optical transmitter that emits the light, wherein the video stream includes a plurality of video frames that are temporally consecutive. The receiving end of the LOS communication also involves converting the video stream into a binary string including a plurality of binary bits. Each of the binary bits corresponds to a respective one of the plurality of video frames, and the binary string contains a repeating binary pattern representing a message being communicated. The receiving end of the LOS communication also involves extracting the binary pattern from the binary string and then decoding the binary pattern to obtain the message.

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.

An image decoding method according to the present document comprises a step for performing inverse first-order transform and inverse non-separable transform on a residual sample. The inverse non-separable transform is performed on the basis of a transform index indicating a predetermined transform kernel matrix, the inverse first-order transform is performed on the basis of a multiple transform selection (MTS) index indicating MTS for a horizontal transform kernel and a vertical transform kernel, and a syntax element bin string for the transform index is derived on the basis of first context information when a tree type for a split structure of a target block is not a single tree type and is derived on the basis of second context information when the tree type is the single tree type.

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

A method for monitoring at least one of exudate data and absorbent article data, wherein said exudate data is associated with at least one absorbent article and a person wearing said at least one article, and wherein said absorbent article data is associated with one or more primary article characteristics, the method comprising the steps of: - acquiring at least one of: ∘ exudate data comprising exudate information for one or more voiding events, within a time period corresponding to a monitoring period, the one or more voiding events corresponding to at least a first voiding event, wherein the first, voiding event occurs at an absorbent article position; and ∘ absorbent article data according to the one or more primary article characteristics that are selected from the group consisting of: absorbency of said article; size of said article; construction of said article; brand of said article; material specification of said article, and combinations thereof; and - wherein each said acquired data comprises, preferably consists of, a binary string comprising a plurality of bits that uniquely distinguishes each said acquired data; and - identifying the presence or absence of an anomaly in the said acquired data by comparing the plurality of bits of said acquired data with bits of a plurality of pre-set binary strings comprised in a code book, each said pre-set binary strings corresponding to actual exudate and / or absorbent article data; and wherein the method further comprises the step of carrying out a data correction step, wherein said data correction step comprises the step of replacing the acquired data corresponding to said identified anomaly with the most likely actual exudate and / or absorbent article data.