37 results about "Bit array" patented technology

Data characterizing a request to access a database record, a data attribute of the database record, and an authorization token are received. Based on the received data, permission to access the database record is determined by at least validating the authorization token using the data attribute. The authorization token can be generated by producing hash values for the database record and generating a bit array for the hash values. Related apparatus, systems, techniques, and articles are also described.

Data characterizing a request to access a database record, a data attribute of the database record, and an authorization token are received. Based on the received data, permission to access the database record is determined by at least validating the authorization token using the data attribute. The authorization token can be generated by producing hash values for the database record and generating a bit array for the hash values. Related apparatus, systems, techniques, and articles are also described.

This invention provides an automated testing method and system for segment LCD screens. The method includes: establishing a data path between a test platform and the device under test (DUT), wherein the data path establishment strategy is adaptively selected based on the architecture of the DUT; pre-establishing a video memory mapping configuration file and test cases, and loading them onto the test platform; establishing a frame synchronization mechanism when the test platform receives video memory data from the DUT; detecting whether the DUT has physical faults or electrical connection anomalies, and generating physical test results; translating the segment codes of the test cases into bit arrays based on the video memory mapping configuration file, and comparing them with the actual arrays obtained by parsing the actually received video memory data; and generating a corresponding diagnostic report based on the comparison results and the physical test results.

An in-memory computation (IMC) circuit. The IMC circuit includes: an array comprising a matrix of memory cells having a plurality of rows and columns, wherein memory cells within the same column are connected through a common bit line and memory cells within the same row are connected through a common word line, wherein the memory cells are configured for storing weights of a trained neural network architecture, wherein the order of the weights is pre-scrambled; at least one decoder configured for outputting a number of shifting operations to be performed by each shifting register of a plurality of shifting registers using a secret key; the plurality of shifting registers configured for shifting outputs of the array according to the output of the decoder.

This application discloses a data processing method, apparatus, device, and storage medium, relating to the field of computer technology. The data processing method includes: in response to the presence of sensitive data of a numeric type in the data to be processed, obtaining binary data corresponding to the sensitive data; storing the binary data bit by bit in an initial bit array to obtain a first bit array; obfuscating the first bit array according to a preset obfuscation rule to obtain a second bit array; desensitizing the second bit array to obtain an encrypted string corresponding to the sensitive data; and replacing the sensitive data in the data to be processed with the encrypted string. This application, while ensuring the protection of sensitive data, can reduce the amount of encrypted data, making it more convenient for transmission and storage.

This invention belongs to the field of communication technology, specifically relating to a method for content delivery and local confirmation for glasses in a private network environment. The method includes the following steps: Step 1: The content delivery server assigns a task identifier to each task content data and sends it to the glasses terminals within the private network via a User Datagram Protocol (UDP) broadcast channel; Step 2: Each glasses terminal receives the UDP broadcast data until it recovers the complete task content data and registers it in its local task table; Step 3: When a glasses terminal executes task content data in the registered state, it triggers a voice confirmation module to collect the wearer's confirmation-type command voice to generate a task confirmation event. The content delivery server then parses the Bloom filter digest bit array to obtain the set of completed tasks and updates the task management record. This invention significantly improves the efficiency, reliability, and controllability of task management in a private network environment.

To expand quantum bits in two dimensions using a current semiconductor manufacturing method, in a quantum information processing device.SOLUTION: A first layer has a first gate electrode row arranged in a first direction to control quantum bits of a quantum bit row, and a second gate electrode row arranged in the first direction to control quantum bit interactions of an interaction row. The second layer has a third gate electrode row arranged in a second direction, and a fourth gate electrode row arranged adjacent to the third gate electrode row in the second direction. The third gate electrode row and the fourth gate electrode row control some of the quantum bits of the multiple quantum bits and some of the multiple quantum bit interactions, respectively.SELECTED DRAWING: Figure 1

The application discloses a unified storage conversion method and system for finite element analysis result data, relates to the field of data conversion, and solves the problem that current finite element result data cannot be effectively stored and converted. The method comprises the following steps: converting different original files into identifiable files through a converter plug-in, and extracting finite element result data in the identifiable files; processing three-dimensional result arrays in the finite element result data to obtain reorganized result arrays; performing data deduplication on the finite element result data, and intelligently grouping different standard physical quantities in the reorganized result arrays according to byte bits; storing node coordinate arrays, element connectivity arrays and different byte bit arrays into different subfolders respectively, and querying the byte bit arrays according to different query conditions. The application realizes effective storage and conversion of finite element result data.

The invention provides a data back-to-source method, device and system, equipment, a medium and a program product. According to one specific embodiment, the data back-to-source method comprises the steps that a target data request sent by a client side is received, and the target data request comprises a target data identifier; in response to the failure of querying the cache data of the current node based on the target data identifier, calculating a target hash value of the target data identifier; in response to the success of querying a cluster bloom filter based on the target hash value, determining a target node in which the target data is cached in the logic machine room, and obtaining the address of the target node, the cluster bloom filter being used for recording a bit array mapped by the hash value of the data identifier of the back-to-source data of the logic machine room within the latest 2N duration; sending a target data request to the target node based on the address of the target node; and in response to the received target data sent by the target node, sending the target data to the client.

The application provides a method and device for processing data, the method comprising: obtaining first digital data and second digital data, the base value of the base of the first digital data and the second digital data being a first value X, X being a positive integer; performing single-bit conversion on the first digital data according to the first value X to generate a plurality of first single-bit arrays, wherein the number of the first single-bit arrays corresponds to the first value X; performing single-bit conversion on the second digital data according to the first value X to generate a plurality of second single-bit arrays, wherein the number of the second single-bit arrays corresponds to the first value X; performing convolution calculation on the plurality of first single-bit arrays and the plurality of second single-bit arrays to generate a plurality of first convolution results; and determining the product of the first digital data and the second digital data according to the plurality of first convolution results, which can improve the efficiency of multiplication processing of large numbers while meeting high precision.

An apparatus may include a transmitter and one or more processors configured to identify a code rate of a low-density parity-check (LDPC) code, receive, by an LDPC encoder, a set of information bits and encode, using the code rate, the set of information bits to generate a set of encoded bits and a set of parity bits, generate, from the set of encoded bits, a matrix of bit arrays, discard one or more parity bits from the set of parity bits to generate a parity bit array with a size equal to a number of column of the matrix, generate a bit array by concatenating (1) one or more bit arrays selected from the matrix of bit arrays and (2) one or more bits selected from the parity bit array corresponding to the one or more bit arrays, and modulate, by a modulator, the bit array to generate modulated data.

The invention discloses a file receiving state monitoring method and a related device, and relates to the technical field of data processing, and the file receiving state monitoring method comprises the steps that after a first data file is received, file information of the first data file is determined, and the file information comprises a first file theme and a first file identifier; mapping the first file identifier by using hash functions of a first function number corresponding to the first file theme to obtain a first hash value of the first function number, the first function number being determined based on a first expected file total amount and a first bit number corresponding to the first file theme, the first bit number is a bit array size of a first bitmap corresponding to the first file theme, and the first bit number is determined based on a first expected misjudgment rate corresponding to the first file theme and a first expected total file amount; and setting a bit taking each first hash value as a bit index on the first bitmap as a first state value so as to update the first bitmap. The processing efficiency of state monitoring is improved.

The application provides a foreign key constraint checking method and device, equipment and a storage medium, and relates to the technical field of databases and the technical field of data processing. The method comprises the following steps: preprocessing a first foreign key value to obtain a first hash value and mapping the first hash value to a bit array to obtain a Bloom relationship table, the first foreign key value being any one of foreign key column data of a reference table; preprocessing a foreign key value of to-be-written data to obtain a second hash value and performing bit matching in the Bloom relationship table according to the second hash value; and in the case of a failed bit matching, rejecting to write the to-be-written data. The method provided by the application can improve the foreign key constraint checking efficiency.

The application provides a complementary embedding image encryption method based on an improved cross-coupled mapping lattice, which comprises the following steps: establishing an improved sine cross-coupled mapping lattice model; based on a plaintext image, generating a secret key by SHA-384 and an original image, and calculating model parameters and initial values according to the secret key; detecting the plaintext image, identifying and obtaining airport coordinates, randomly selecting a coordinate point, and obtaining a visual confusion image through a complementary embedding algorithm; iterating the established sine cross-coupled mapping lattice model to obtain a matrix, converting the matrix into a one-bit array, taking the last rxc data to obtain b; distributing an initial matrix and iterating to an appropriate size to obtain a fractal disorder matrix; selecting the first r rows and the first c columns to form a one-dimensional array, sorting the one-dimensional array to obtain an index array; performing synchronous dynamic scrambling and diffusion operations on three channels R, G and B in a color image respectively to obtain a sub-encrypted image corresponding to each channel. The sub-encrypted images are assembled into a final encrypted image C.

The invention discloses a data management method and device, a storage medium and electronic equipment, and the method comprises the steps: building a Bloom filter for a target data set in an initial state, and enabling the Bloom filter to comprise a first preset number of hash functions and a first preset number of bit arrays; in response to an insertion request of an element in the target data set, under the condition that it is determined that the Bloom filter reaches the capacity limit, the Bloom filter is switched into an inactive state, and a new Bloom filter in an active state is established, the new bloom filter in the active state comprises a second preset number of hash functions and a second preset number of bit array, and the second preset number is greater than the first preset number; and mapping the to-be-inserted element to a new Bloom filter in an active state based on the unique ID of the to-be-inserted element. According to the method, the data query efficiency can be improved, the probability that the data are wrongly marked is reduced, and the false alarm rate is reduced.

The application discloses a database data query method and device based on a state dictionary, electronic equipment and a storage medium. Its features include: receiving a data query instruction for a target database, determining target query data corresponding to the data query instruction; performing hash calculation on the target query data according to a hash function group stored in the state dictionary to determine a query hash value of the target query data; if a target hash value identical to the query hash value exists in a hash bit array stored in the state dictionary, the data query instruction is sent to the target database for data query. The application realizes pre-query of data stored in the database, can filter data not existing in the database through the state dictionary, reduces the number of invalid data query to the database, and improves the query efficiency.

In certain embodiments, a method includes recursively performing a procedure that includes using an allowed set of object identifiers and a hash function to update a bit array, using a disallowed set of object identifiers and the hash function to further update the bit array where collisions occur, repeating the process with a new allowed set that includes object identifiers from the original allowed set that collided with the disallowed set and a new hash function, until reaching a round where no collisions occurred, generating a data structure that includes the bit arrays created during each recursive round, and compressing the data structure.

A data processing method performed by a first device includes: generating, in response to first service data satisfying a data uploading condition, a first bit array corresponding to the first service data; encrypting the first bit array through a data key to obtain a ciphertext bit array, the data key being generated by a second device in a data intersection application run in a trusted execution environment of the second device; and transmitting the ciphertext bit array to a blockchain node for forwarding to a second device, for the second device to decrypt, in the data intersection application through the data key, the ciphertext bit array to obtain the first bit array.

This application relates to a file query method, apparatus, computer device, storage medium, and program product. The method includes: obtaining a file identifier to be queried; determining a query hash value corresponding to the file to be queried based on the file identifier and at least one preset hash function; and determining a query result for the file to be queried based on preset element values ​​at each bit of a preset bit array and the query hash value. The preset element values ​​include a first element value and a second element value, where the first element value is the element value corresponding to a whitelisted file. This allows for the determination of whether a file to be queried is a whitelisted file using a fixed number of hash calculations and bit array accesses, reducing the time complexity of file queries and improving file query efficiency. Furthermore, using a bit array to store the element values ​​corresponding to whitelisted files also saves storage space.

The invention provides a probability distribution sampling enhancement method based on a photoelectric probability bit array in-situ sensing circuit, and the method comprises the steps: directly building a Sigmoid nonlinear mapping relation between incident light intensity and output probability at a physical level of a device through employing the intrinsic photoelectric response characteristics of a photoelectric probability bit unit of the circuit and a random noise mechanism; the method comprises the steps of optical image input, in-situ photoelectric response and probability bit stream generation, repeated continuous sampling and probability distribution integral processing on a binary probability bit stream, and image gray scale reconstruction. According to the method, continuous simulation gray information is successfully recovered from the noise flow which seems to be disordered and fluctuates randomly in a high-fidelity mode, the method is an image enhancement means and is a bridge between probability calculation hardware and actual visual application, the recognition precision of a system in a complex visual task is remarkably improved, and the recognition efficiency of the system is improved. And the system is endowed with strong image reconstruction capability and high-accuracy reverse image generation capability in the environment of serious loss of original data.

The invention discloses a quantum bit array design method and device, a storage medium and electronic equipment, and the method comprises the steps: obtaining the physical technical specifications and manufacturing process constraint parameters of quantum bits; based on physical technical specifications and manufacturing process constraint parameters, selecting at least one target space group for inhibiting crosstalk between quantum bits from a symmetry principle from a plurality of crystallographic space groups; according to a Wyckoff position theory of a target space group, generating a symmetric layout of initial quantum bits in a unit cell; applying all symmetric operations of the target space group to the initial symmetric layout to generate a quantum bit array layout with global symmetry; and based on the group theory and the Wigner-Eckart theorem, performing crosstalk immunity verification on the quantum bit array layout, and outputting the quantum bit array layout passing the verification. According to the invention, crosstalk can be inhibited fundamentally, and inherent tolerance to manufacturing errors is realized.

The invention discloses an abnormal request identification method and device, equipment and a computer storage medium. The abnormal request identification method applied to server equipment comprises the following steps: receiving a data operation request sent by client equipment; the data operation request comprises a target database identifier, at least one target table and at least one target field; determining a target Bloom filter of the target database according to the target database identifier; the target database comprises at least one real table, and the real table comprises at least one real field; the target Bloom filter comprises a target bit array and at least two hash functions; determining a position to which the target table is mapped in the target bit array and a position to which the target field is mapped in the target bit array by adopting at least two hash functions; and identifying whether the data operation request is an abnormal request or not according to the target table and the value of the position, mapped to the target bit array, of the target field. According to the embodiment of the invention, abnormal requests can be identified, and invalid requests can be effectively intercepted.

A successive approximation register (SAR) analog-to-digital converter (ADC) includes a capacitive digital-to-analog converter (DAC) including a capacitive DAC array implemented with a combination of non-binary units and binary units, a comparator, a SAR logic circuit and an encoder. The comparator compares the DAC output signal with a predetermined voltage level to generate the comparison result. The SAR logic circuit determines a plurality of bits according to the comparison result, and controls setting of the capacitive DAC in order to generate a set of first bits and a set of second bits among the plurality of bits with aid of a first sub-array and a second sub-array of the capacitive DAC array, respectively. The encoder encodes the set of first bits into a set of third bits, allowing the SAR ADC to output the set of third bits and the set of second bits as output bits of the SAR ADC.

The invention discloses a truth table wave selection range finding method and measuring device for a laser radar, and the method comprises the steps: controlling the laser radar to transmit a high-power laser pulse and a low-power laser pulse in a range finding process; receiving all echoes returned by the high-power pulse and the low-power pulse, classifying all echoes to obtain two groups of classified echoes, and screening the two groups of classified echoes to obtain two groups of verification echoes; the two sets of verification echoes are subjected to cross traversal verification to obtain state bit arrays, the state bit arrays are compared with a preset echo truth table to obtain target output echoes, and the distance measurement process is completed, and the preset echo truth table comprises a plurality of preset state bit arrays. In the prior art, a distance measurement process of a laser radar is realized only through point cloud splicing, and a splicing fault phenomenon exists because of low reliability and stability of the point cloud, so that the distance measurement precision of the radar is low.

The invention discloses a rapid all-sky star map identification method suitable for a star sensor, and relates to the field of photoelectric imaging, the method comprises the following steps: constructing a star map matching model based on a navigation star catalogue, a star diagonal distance table and a star diagonal distance index table, extracting and calibrating star points after obtaining a star map, obtaining a plurality of star vectors, and sorting according to star magnitude; selecting a star vector combination corresponding to the minimum star number threshold value for matching in a manner of gradually expanding a search boundary; in the matching process, calculating a star diagonal distance between star vectors, discretizing the star diagonal distance, quickly retrieving navigation star pair information in an error range by utilizing a star diagonal distance index table, recording a matching relationship in combination with a bit array so as to determine candidate navigation star IDs of the star vectors, and performing overall consistency verification on candidate combinations so as to complete star map recognition; when matching fails, invalid combinations are automatically skipped, and searching is continued. According to the method, while the matching accuracy is ensured, the calculation complexity is effectively reduced, and the star map recognition speed and the false star resistance are improved.

The application provides a bit-level image encryption method of chaotic sequence based on a diffusion model, including: obtaining an original image to be encrypted, performing initialization processing on the original image, generating a Lorenz chaotic sequence by using a diffusion model to obtain a first initial value and a second initial value; inputting the first initial value into an improved three-dimensional Logistic mapping to generate a first chaotic sequence; performing scrambling on the original image based on the second initial value to obtain a scrambled sequence; converting the first chaotic sequence into a random bit array to generate an auxiliary key; inputting the random bit array and the auxiliary key into an improved Feistel network, converting a one-dimensional encryption sequence obtained into a two-dimensional encryption image to obtain an encryption image. The application generates a chaotic sequence by using a diffusion model, adopts an improved three-dimensional Logistic mapping and an improved Feistel network, and improves the complexity and security of image encryption.

The disclosure includes a virtual sparse bit-array (VSB) having a low memory structure. The low memory structure is designed to increase processing speed for operations executed on the VSB. The VSB may be in a pointer tree structure or an offset tree structure. The VSB includes blocks, levels, and special pointers. The blocks are distributed on the levels to form the tree structure. The special pointers include a real pointer that connects the blocks across levels of the VSB tree structure, zero pointers which indicate all bits in the block and blocks connected to the block from levels below are reset to zero, and max pointers (FF), which indicate all bits in the block and blocks connected to the block from levels below are set to one. Methods herein describe how to allocate and deallocate sets of blocks at each level to achieve maximum memory efficiency.

The invention relates to the technical field of information security, and particularly provides a segmented encryption method and device based on a multilayer key, and the method comprises the following steps: S1, data segmentation processing; s2, performing byte processing on the secret key; s3, carrying out segmented iterative encryption; s4, a strToBt method is called to convert the segmented data into a 64-bit array; s5, according to the number of the available keys, sequentially using the corresponding key bytes to perform iterative encryption; and S6, encryption result conversion. Compared with the prior art, the anti-cracking capability of the encryption system can be improved through multi-layer key superposition, segmentation processing adapts to data of different lengths, key configuration is flexible, different security level requirements can be met, and the method is suitable for data transmission and storage scenes needing high security.

The application discloses a kind of redundancy data elimination methods of spaceborne time trigger network, multiple bit array in bloom filter is set to 0 under initial condition each bit, for marking hash function value.For double-path redundant input in end system, bloom filter first calculates each hash value of one of data packet, and the corresponding position of multiple bit array is 1.Then again calculate each hash value to next data packet, at this time if the corresponding position of multiple bit array is 1, it indicates that two data packets have the same hash value, same content with high probability, eliminate the data packet of later arrival;If the position of all hash values corresponding to the second data packet of multiple bit array is 0, it indicates that the hash value of two data packets is not the same, content must be different, two data packets are retained, and sent to subsequent module in end system.It can effectively eliminate double-mode or multi-mode redundancy, improve the real-time performance of network equipment scheduling through hardware fast calculation.

The invention provides a bit-level image encryption method based on a chaos sequence of a diffusion model, and the method comprises the steps: obtaining a to-be-encrypted original image, carrying out the initialization processing of the original image, generating a Lorentz chaos sequence through a diffusion model, and obtaining a first initial value and a second initial value; inputting the first initial value into an improved three-dimensional Logistic map to generate a first chaotic sequence; scrambling the original image based on the second initial value to obtain a scrambling sequence; converting the first chaotic sequence into a random bit array, and generating an auxiliary key; and inputting the random bit array and the auxiliary key into the improved Feistel network, and converting the obtained one-dimensional encryption sequence into a two-dimensional encryption image to obtain an encryption image. The chaotic sequence is generated through the diffusion model, the improved three-dimensional Logistic mapping and the improved Feistel network are adopted, and the complexity and safety of image encryption are improved.