Patent classifications
H03M7/3064
Remote downhole signal decoder and method for signal re-transmission
A decoding device is used to securely send corresponding data gathered from multiple underground sources to multiple users. The device comprises a signal receiving port connected to multiple bandwidth filters and further connected to internet access points that are assigned to end users for secure data access. The invention facilitates allowing the signal and data being transmitted through the formation of the earth to reach end users located nearby and significant distances away from the source of the transmission. A system and method utilizing the decoding device is provided.
Data Compression and Transmission Technique
Disclosed herein is a method of transmitting data, the method comprising: obtaining a plurality of data blocks; determining a plurality of values of a transmission parameter for a transmitter; determining a plurality of values of a processing parameter of a processor; determining, for each of the obtained data blocks, one of a plurality of compression levels in dependence on at least one of the determined transmission parameter values and/or at least one processing parameter values; compressing each of a plurality data blocks in dependence on the determined compression level each block; and transmitting the data blocks; wherein: the transmitted data blocks comprise data blocks are compressed with different compression levels; and one of the compression levels is a determination to not compress data blocks such that the method does not compress some of the transmitted data blocks.
Locally varying numerical ranges for data compression
Data compression techniques are described for saving memory space by using fewer bits to store information while achieving high fidelity. A data set may be partitioned into a plurality of regions. Locally varying numerical ranges of data values (e.g., the minimum and maximum extents) may be determined for the plurality of regions. The data in the individual regions may be encoded using a lower number of bits as interpolation values in reference to the local extents rather than being encoded using a higher number of bits as absolute values. Where there are multiple channels of data in the regions, the number of available bits for encoding the data may be dynamically allocated per region based on the relative degrees of variance in data among the multiple channels.
COMPRESSING MULTIPLE DIMENSION FILES USING SEQUENCE ALIGNMENT
Compressing files is disclosed. An input file to be compressed is first aligned. When the file has multiple axes or dimensions, the file is aligned along each of the axes. Aligning the file includes splitting the file into sequences that can be aligned along each of the axes or dimensions. Aligning the file generates a compression tensor, where each row or dimensional space of the compression tensor corresponds to part of the file. A consensus tensor is determined from the compression tensor. Using the consensus tensor, pointer lists are generated. Each pointer lists identifies a subsequence or portion of the consensus tensor. The compressed file includes the pointer lists and the consensus tensor.
WARM START FILE COMPRESSION USING SEQUENCE ALIGNMENT
Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. The compression matrix may also serve as a warm start if additional compression is desired. Compression may be performed in stages, where an initial compression matrix is generated in a first stage using larger letter sizes for alignment and then a second compression stage is performed using smaller letter sizes. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.
Selective data compression based on data similarity
Technology is disclosed for selectively compressing data based on similarity of pages within the data that is to be compressed. At least one corresponding hash value is generated for each one of multiple candidate pages to be compressed. In response to the hash values generated for the candidate pages, the technology selects a set of similar candidate pages from the candidate pages. The set of similar candidate pages are a subset of the candidate pages that includes less than all the candidate pages. The set of similar candidate pages are compressed as a single unit, separately from one or more other ones of the candidate pages that were not selected to be included in the set of similar candidate pages.
DISPERSING DATA AND PARITY ACROSS A SET OF SEGMENTS STORED VIA A COMPUTING SYSTEM
A computing system is operable to generate a plurality of lines of coding blocks that includes a plurality of data blocks and a plurality of parity blocks. Each of the plurality of lines of coding blocks includes a corresponding subset of data blocks a corresponding subset of parity blocks. A set of segments of a segment group are generated to collectively include the plurality of lines of coding blocks. Different coding blocks of each of the plurality of lines of coding blocks are included within different ones of the set of segments, and the plurality of parity blocks are dispersed across all of the set of segments. The set of segments are stored via a plurality of nodes sets, where different segments of the set of segments are stored via memory resources of different node sets of the plurality of node sets.
QUERY EXECUTION VIA NODES WITH PARALLELIZED RESOURCES
A node includes a plurality of processing core resources. Each processing core resource of the plurality of processing core resources includes a corresponding processing module, a corresponding memory interface module, a corresponding memory device, and a corresponding cache memory. The plurality of processing core resources of the node is operable to collectively perform corresponding operations of the node. Each processing core resource of the plurality of processing core resources of the node is operable to perform operations independently from other ones of the plurality of processing core resources of the node.
Database system implementation of a plurality of operating system layers
A computing device comprises a plurality of nodes and a plurality of operating system layers. The plurality of operating system layers includes a local database operating system and a sub-system database operating system. The plurality of nodes utilize the local database operating system to execute at least one database operation independently of other ones of the plurality of nodes. The computing device utilizes the sub-system database operating system in conjunction with other ones of a plurality of computing devices of at least one sub-system to facilitate execution of at least one sub-system operation of the at least one sub-system.
Information processing apparatus and information processing method
The present disclosure relates to an information processing apparatus and an information processing method that are capable of distributing higher-quality G-PCC streams. When G-PCC streams obtained by encoding Point Cloud data according to G-PCC are generated, there are generated spatial positional information indicating spatial positions of respective pieces of partial Point Cloud data that represent individual parts into which the Point Cloud data is segmented, and grouping information that groups the partial Point Cloud data. The present technology is applicable to a generating apparatus that generates G-PCC streams, for example.