Code Table Research Articles

Smart Multimedia Compressor—Intelligent Algorithms for Text and Image Compression

AbstractA number of text compression algorithms have been proposed in the past decades, which have been very effective and usually operate on conventional character/word-based approaches. A novel data compression perspective of data mining is explored in this research and the paper focuses on novel frequent sequence/pattern mining approach to text compression. This work attempts to make use of longer-range correlations between words in languages for achieving better text compression. We propose a novel and efficient method by making the compression of any word-level text in a universal manner for corpora across domains referred as Universal Huffman Tree-based encoding. The major contribution of this work is in terms of avoidance of code table communication to the decoder. Simulation results over benchmark datasets indicate that Universal Huffman encoding employing frequent sequence mining (achieves [20%, 89%] improvement in compression in reduced time. The paper also contributes a usable interface for Data compression that employs the proposed frequent sequent mining-based data compression algorithm. The interface supports features such as feedback, consistency, usability, navigation, visual appeal, performance and accessibility on par with existing compression softwares. The work results in an intelligent data compression software employing knowledge engineering perspective.

Application of 3D Dynamic Image Technology in Industrial Products

Aiming at the problems of manual testing of industrial products, a measurement method of industrial products based on three-dimensional dynamic imaging technology is proposed. The products on the production line are dynamically photographed from different angles and within a certain period of time by using cameras. Then the obtained Image denoising processing and contour tracking based on chain code table and line segment table to obtain boundary information and regional information of each enclosed area of the image. Experimental tests show that the test accuracy of this method is 100%, which is suitable for real-time detection. Fully automated research on product testing provides the foundation.

The Operational Inflight Radiometric Uniform Calibration of a Directional Polarimetric Camera

The directional polarimetric camera (DPC) on-board the GF-5A satellite is designed for atmospheric or water color detection, which requires high radiometric accuracy. Therefore, in-flight calibration is a prerequisite for its inversion application. For large field optical sensors, it is very challenging to ensure the consistency of radiation detection in the whole field of view in the space environment. Our work proposes a vicarious in-flight calibration method based on sea non-equipment sites (visible bands) and land non-equipment sites (all bands). Combined with environmental parameters and radiation transmission calculations, we evaluated the radiation detection accuracy of the 0° to 60° view zenith angle of the DPC in each band. Our calibration method is based on the single-day normalized radiance data measured by the DPC. Through data selection, enough calibration samples can be obtained in a single day (the number of desert samples is more than 5000, and the number of calibration samples of the ocean is more than 2.8×106). The measurements are compared with the simulation of 6SV VRT code or look-up tables. The massive amount of data averages the uncertainty of a single-point calculation. Although the uncertainty of a single sample is significant, the final fitting of the curve of the variation in the radiometric calibration coefficient with the observation angle can still keep the root mean squared error at approximately 2–3% or even lower, and for visible bands, the calibration results for both ocean sites and desert sites are in good agreement regarding the non-uniformity of the sensor.

Method for hiding text data in an image

The main problem: The article deals with the issues of hiding text information in a graphic file. A formula for hiding text information in image pixels is proposed. A steganography scheme for embedding secret text in random image pixels has been developed. Random bytes are pre-embedded in each row of pixels in the source image. As a result of the operations performed, a key image is obtained. The text codes are embedded in random bytes of pixels of a given RGB channel. To form a secret message, the characters of the ASCII code table are used. Demo encryption and decryption programs have been developed in the Python 3.5.2 programming language. A graphic file is used as the decryption key. Purpose: To develop an algorithm for embedding text information in random pixels of an image. Methods: Among the methods of hiding information in graphic images, the LSB method of hiding information is widely used, in which the lower bits in the image bytes responsible for color encoding are replaced by the bits of the secret message. Analysis of methods of hiding information in graphic files and modeling of algorithms showed an increase in the level of protection of hidden information from detection. Results and their significance: Using the proposed steganography scheme and the algorithm for embedding bytes of a secret message in a graphic file, protection against detection of hidden information is significantly increased. The advantage of this steganography scheme is that for decryption, a key image is used, in which random bytes are pre-embedded. In addition, the entire pixel bits of the container image are used to display the color shades. It can also be noted that the developed steganography scheme allows not only to transmit secret information, but also to add digital fingerprints or hidden tags to the image.

Relational model of the standard genetic code

The genetic code is a set of rules that establishes mapping between triplets in messenger RNA and amino acids in proteins. The most common way to display these rules is the Standard Genetic Code (SGC) table. This paper takes an alternative approach, based on the relational data model by Edgar F. Codd (Commun. ACM, 13:377–387, 1970). The relational model (RM) proposes a distributed storage of data into a collection of tables (called relations), that can be connected by shared communality. Basic elements of the table are rows (called records or tuples), and columns (called fields or attributes). The SGC table, according to the relational data model, represents the so called unnormalized form of a table. Using normalization rules it is possible to subdivide the SGC table into four tables. The rows and columns of single tables are defined by the first and second base and individual tables by the third codon base. The result of this model is an approach to managing genetic code data, represented in terms of tuples and grouped into relations, with table structure and language consistent with first-order (predicate) logic. The RM explains that the final step in the development of the SGC was the adoption of coding function by the third base, which makes an informational/functional unit with the first base, despite the different physical location in a triplet. This enabled the synthesis of specific proteins without ambiguity, in accordance with the concept of ambiguity reduction and five phases of the general model on the origin of biological codes by Marcello Barbieri (BioSystems 181:11–19, 2019).

Antisense Peptide Technology for Diagnostic Tests and Bioengineering Research.

Antisense peptide technology (APT) is based on a useful heuristic algorithm for rational peptide design. It was deduced from empirical observations that peptides consisting of complementary (sense and antisense) amino acids interact with higher probability and affinity than the randomly selected ones. This phenomenon is closely related to the structure of the standard genetic code table, and at the same time, is unrelated to the direction of its codon sequence translation. The concept of complementary peptide interaction is discussed, and its possible applications to diagnostic tests and bioengineering research are summarized. Problems and difficulties that may arise using APT are discussed, and possible solutions are proposed. The methodology was tested on the example of SARS-CoV-2. It is shown that the CABS-dock server accurately predicts the binding of antisense peptides to the SARS-CoV-2 receptor binding domain without requiring predefinition of the binding site. It is concluded that the benefits of APT outweigh the costs of random peptide screening and could lead to considerable savings in time and resources, especially if combined with other computational and immunochemical methods.

An 18-Gb/s/pin Single-Ended PAM-4 Transmitter for Memory Interfaces with Adaptive Impedance Matching and Output Level Compensation

This paper presents a method for preventing output level distortion while matching the channel impedance in the single-ended PAM-4 transmitter for memory interfaces. ZQ codes for all four output signal levels were obtained through ZQ calibration and saved in the ZQ code table. The ZQ code generator then adaptively selected the appropriate codes depending on the data pattern and delivered them to the output driver; this can improve the level separation mismatch ratio (RLM) while matching the channel impedance. To validate the effectiveness of our approach, a prototype chip with an active area of 0.035 mm2 was fabricated in a 65 nm CMOS process. It achieved the energy efficiency of 3.09 pJ/bit/pin at 18 Gb/s/pin, and its RLM was 0.971 while matching the channel impedance.

The Unexpected Strategies behind Alternative Genetic Codes

This article proposes a number of codon reassignment strategies. These strategies are inferred by comparing the alternative (non-standard) genetic codes to the standard genetic code. Codon reassignments show strong and non-random connection to the standard code. The strategies interconnect all genetic codes and model a selected pathway through the heterotrophic part of life. The article also shows that the codon reassignment strategies model the evolution from the standard to the vertebrate mitochondrial code. Furthermore, it introduces a genetic code table based on third position synonyms that compares the vertebrate mitochondrial code to the standard code.

Метод обробки вiдеодaних з можливістю їх захисту після квaнтувaння

The subject of research in the article is the video processing processes based on the JPEG platform for data transmission in the information and telecommunication network. The aim is to build a method for processing a video image with the possibility of protecting it at the quantization stage with subsequent arithmetic coding. That will allow, while preserving the structural and statistical regularity, to ensure the necessary level of accessibility, reliability, and confidentiality when transmitting video data. Task: research of known methods of selective video image processing with the subsequent formalization of the video image processing procedure at the quantization stage and statistical coding of significant blocks based on the JPEG platform. The methods used are an algorithm based on the JPEG platform, methods for selecting significant informative blocks, arithmetic coding. The following results were obtained. A method for processing a video image with the possibility of its protection at the stage of quantization with subsequent arithmetic coding has been developed. This method will allow, while preserving the structural and statistical regularity, to fulfill the set requirements for an accessible, reliable, and confidential transmission of video data. Ensuring the required level of availability is associated with a 30% reduction in the video image volume compared to the original volume. Simultaneously, the provision of the required level of confidence is confirmed by an estimate of the peak signal-to-noise ratio for an authorized user, which is dB. Ensuring the required level of confidentiality is confirmed by an estimate of the peak signal-to-noise ratio in case of unauthorized access, which is equal to dB. Conclusions. The scientific novelty of the results obtained is as follows: for the first time, two methods of processing video images at the quantization stage have been proposed. The proposed technologies fulfill the assigned tasks to ensure the required level of confidentiality at a given level of confidence. Simultaneously, the method of using encryption tables has a higher level of cryptographic stability than the method of using the key matrix. It is due to a a more complex mathematical apparatus. Which, in turn, increases the time for processing the tributes. To fulfill the requirement of data availability, it is proposed to use arithmetic coding for info-normative blocks, which should be more efficient compared with the methods of code tables. So, the method of using the scoring tables has greater cryptographic stability, and the method of using the matrix-key has higher performance. Simultaneously, the use of arithmetic coding will satisfy the need for accessibility by reducing the initial volume.

The novel Ideal Symmetry Genetic Code table – Common purine-pyrimidine symmetry net for all RNA and DNA species

Ever since Nirenberg’s discovery in 1961 in which codons code individual amino acids, numerous scientists searched for symmetries within the genetic code. The standard genetic code (SGC) table is an alphabetic artificial construct based on the U-C-A-G ordering of nucleotides without natural symmetries. Up to the present, complete symmetry in the genetic code has not been found, leaving doubt as to whether the symmetrical nature as the protector of order even exists. Our novel Ideal Symmetry Genetic Code (ISyGC) table reflects a unique fundamental physicochemical purine-pyrimidine symmetry net for all more than thirty known variations of nuclear and mitochondrial genetic codes. The nuclear genetic code for RNA and DNA viruses also contains the same purine-pyrimidine symmetry net. We show that the ISyGC table leads to automatic transformation into a DNA sequence akin to the 5′3 codon and 3′5 anticodon patterns. As a result of purine-pyrimidine symmetries between codons in the ISyGC table, algorithms of the first two bases as well of the third base of codons show how tRNA cognate anticodons can recognize synonymous codons during mRNA decoding. We show that the ISyGC purine-pyrimidine net with its physicochemical properties represents an evolutionary common “frozen accident” at the onset of each genetic code creation and RNA to DNA evolution. As such, during all of evolution the unique fundamental purine-pyrimidine symmetry net of all genetic codes remains unchangeable. In this way, evolution is a road paved with symmetries.

The Roots of Genetic Coding in Aminoacyl-tRNA Synthetase Duality.

Codon-dependent translation underlies genetics and phylogenetic inferences, but its origins pose two challenges. Prevailing narratives cannot account for the fact that aminoacyl-tRNA synthetases (aaRSs), which translate the genetic code, must collectively enforce the rules used to assemble themselves. Nor can they explain how specific assignments arose from rudimentary differentiation between ancestral aaRSs and corresponding transfer RNAs (tRNAs). Experimental deconstruction of the two aaRS superfamilies created new experimental tools with which to analyze the emergence of the code. Amino acid and tRNA substrate recognition are linked to phase transfer free energies of amino acids and arise largely from aaRS class-specific differences in secondary structure. Sensitivity to protein folding rules endowed ancestral aaRS-tRNA pairs with the feedback necessary to rapidly compare alternative genetic codes and coding sequences. These and other experimental data suggest that the aaRS bidirectional genetic ancestry stabilized the differentiation and interdependence required to initiate and elaborate the genetic coding table.

Parallelism between the Classical Geocentric Cosmos and the Life Chemistry Essentials

There’s a parallelism between the classical geocentric cosmos and the following essentials of life chemistry: the electron octet, the bio-elements, the amino acids, and the genetic code. The introduction contains a short summary of the chemistry of life and the classical geocentric cosmology. The research method compares the classical geocentric cosmos to the investigated essentials of life chemistry. The Earth-Sun (substrate-source of life) opposite and the inner-outer planet opposites correspond to several of these essentials. The twelve zodiac constellations correspond to the twelve macro bio-elements, the twelve polar amino acids and the twelve by doublet codons encoded amino acids. Each of the latter three zodiac chemical representatives shows the typical seven to five ratio of the twelve zodiac constellations: seven animal and five human related constellations. An original genetic code table based on third position synonyms shows the similarities and differences between the vertebrate mitochondrial and the standard genetic codes, and the parallelism with the classical geocentric cosmos. Specific zodiac constellation representatives for the life chemistry essentials are presented.

Crick Wobble and Superwobble in Standard Genetic Code Evolution

Wobble coding is inevitable during evolution of the Standard Genetic Code (SGC). It ultimately splits half of NN U/C/A/G coding boxes with different assignments. Further, it contributes to pervasive SGC order by reinforcing close spacing for identical SGC assignments. But wobble cannot appear too soon, or it will inhibit encoding and more decisively, obstruct evolution of full coding tables. However, these prior results assumed Crick wobble, NN U/C and NN A/G, read by a single adaptor RNA. Superwobble translates NN U/C/A/G codons, using one adaptor RNA with an unmodified 5′ anticodon U (appropriate to earliest coding) in modern mitochondria, plastids, and mycoplasma. Assuming the SGC was selected when evolving codes most resembled it, characteristics of the critical selection events can be calculated. For example, continuous superwobble infrequently evolves SGC-like coding tables. So, continuous superwobble is a very improbable origin hypothesis. In contrast, late-arising superwobble shares late Crick wobble’s frequent resemblance to SGC order. Thus late superwobble is possible, but yields SGC-like assignments less frequently than late Crick wobble. Ancient coding ambiguity, most simply, arose from Crick wobble alone. This is consistent with SGC assignments to NAN codons.

Chinese and American female images – Comparing TV advertisement in 2010, 2015 and 2020

As a prominent part of study, female image in the mass media serve as a dimension that worth studying. The purpose of the project is to compare female images on TV commercials between China and the United States in 2010, 2015 and 2020 in a cross-cultural view. Research contains 125 American advertisements and 76 Chinese advertisements as 2 samples to represent the countries. Partly based on Bem Sex Role Inventory, the code table includes 6 sections: appearance, age, and occupation, dimension of product, occasion and personality. Both China and the US are in a transitional period from tradition to modernity, but manifested in different forms.

A lossless compression method for logging data while drilling

Mud pulse transmission technology is widely used in logging while drilling (LWD), while its low data transmission efficiency has restricted the development of LWD technology for a long time. In order to improve the equivalent data transmission efficiency of LWD system, a data compression method, namely, Frame Prediction Huffman Coding (FPHC) with a group of frames, is proposed in this paper. Several factors including the data accuracy, the need for real-time transmission, and the existence of transmission errors are comprehensively considered in the proposed method. Through the probability statistical analysis of LWD data, it is proved that the data have a relatively stable probability distribution after predictive coding. In addition, the Huffman code table generated from predictive coding is universally applicable to other LWD data. Through data compression experiments on logging data, it is verified that the proposed method has higher compression efficiency compared with Huffman coding, Lempel–Ziv–Welch algorithm, adaptive Huffman coding and adaptive arithmetic coding. This lossless compression method will have a good application prospect because of its ability to prevent error diffusion, simple implementation and easy to be embedded in down-hole equipment.

Hamming distances of constacyclic codes of length 3ps and optimal codes with respect to the Griesmer and Singleton bounds

Let p≠3 be a prime, s, m be positive integers, and λ be a nonzero element of the finite field Fpm. In [22] and [20], when the generator polynomials have one or two different irreducible factors, the Hamming distances of λ-constacyclic codes of length 3ps over Fpm have been considered. In this paper, we obtain that the Hamming distances of the repeated-root λ-constacyclic codes of length lps can be determined by the Hamming distances of the simple-root γ-constacyclic codes of length l, where l is a positive integer and λ=γps. Based on this result, the Hamming distances of the repeated-root λ-constacyclic codes of length 3ps are given when the generator polynomials have three different irreducible factors. Hence, the Hamming distances of all such constacyclic codes are determined. As an application, we obtain all optimal λ-constacyclic codes of length 3ps with respect to the Griesmer bound and the Singleton bound. Among others, several examples show that some of our codes have the best known parameters with respect to the code tables in [19].

Complete Weight Enumerators of Linear Codes Based on Weil Sums

With a proper defining set, we define a class of linear codes and determine their complete weight enumerators and weight enumerators using Weil sums. They only have two or three nonzero weights, and some of them are optimal with respect to the Griesmer bound or Markus Grassl's code tables. So they are suitable for applications in strongly regular graphs and secret sharing schemes.

The Timer Inremental Compression of Data and Information

The ability to find short representations, i.e. to compress data, is crucial for many intelligentsystems. This paper is devoted to data compression and a transform-based quantitative data compressiontechnique involving quick enumeration in a unary-binary time-based numeral system (NS). The symbolscomprising the alphabets of human-computer interaction languages (HCIL), which are used in an informationalmessage (IM), are collected in primary code tables, such as the ASCII table. The statistical-oriented datacompression method using unconventional timer encryption and encoding information are proposed by us. Itwas constructed probability - discrete model of the set of character sequences and characterized someprobabilistic algorithms associated with the recovery of text by its public key and its cipher. We find thepossibility of parallel implementation of this method by building a block of timer tags. The necessaryestimations of complexity are obtained. The method can be used to compress SMS messages. Probabilisticstatistical analysis and evaluation of their effectiveness are obtained.

METAGRAMMATICAL MODEL AND METHOD OF DECODING THE VIDEOGRAPHICAL INFORMATION WITH PREFIX COMPRESSION CODES

In the article, a metagrammatic model and the local-frequency decoding method are proposed to solve the problem of decoding videographic information with prefix compression codes. The metagrammatic model is presented as a five – level stochastic metagrammatics that allows us to take into account the structural and statistical features of prefix coded data and use them to improve the decoding efficiency. It is shown that only regular Chomsky grammars can be used in the proposed stochastic metagrammatics. The model uses a combined metagrammatics scheme with matching rules such as “terminal – initial symbol” (TS) and “terminal – product label” (TP). It is shown that structuring the model in the form of stochastic metagrammatics can significantly reduce the total number of products in metagrammatics and simplify its modification when solving problems of decoding promising prefix compression codes. The features of the local-frequency method of decoding videographic information with prefix compression codes focused on this metagrammatic model are considered. To implement one of the main and time-consuming procedures of this method, related to the search in local code tables and translation of uneven prefix codes, a local-private procedure for searching code words is proposed. The features of the software implementation of the proposed method are considered. The results of experimental testing of the method on the example of real arrays of non-uniform prefix codes are presented.

Developing the Art of Secret Writing across Borders: The Journey of Marie de Guise’s Ciphers between France and Scotland

This article looks at Marie de Guise’s part in the development of ciphered writing in Scotland. Based on six surviving enciphered dispatches between the Regent of Scotland and the French ambassadors between 1553 and 1560, it analyses Guise’s increasing reliance on secret writing in periods of war or domestic conflict as well as the encoding technique she or her secretaries used. This cryptoanalysis leads to a discussion of Guise’s political use of ciphers and her attempt to prevent French skills in the field to be shared with the Scots. Finally it discusses the information game, involving three players – France, Scotland and England – in which the Regent took part during the Reformation rebellion and which contributed to her fall. Guise’s ciphered letters as well as the matching code tables are also transcribed here to illustrate the contribution of continental consorts to this aspect of early modern diplomatic culture.