Redundant Code Research Articles

Universal evolutionary selection for high dimensional silent patterns of information hidden in the redundancy of viral genetic code.

MotivationUnderstanding how viruses co-evolve with their hosts and adapt various genomic level strategies in order to ensure their fitness may have essential implications in unveiling the secrets of viral evolution, and in developing new vaccines and therapeutic approaches. Here, based on a novel genomic analysis of 2625 different viruses and 439 corresponding host organisms, we provide evidence of universal evolutionary selection for high dimensional ‘silent’ patterns of information hidden in the redundancy of viral genetic code.ResultsOur model suggests that long substrings of nucleotides in the coding regions of viruses from all classes, often also repeat in the corresponding viral hosts from all domains of life. Selection for these substrings cannot be explained only by such phenomena as codon usage bias, horizontal gene transfer and the encoded proteins. Genes encoding structural proteins responsible for building the core of the viral particles were found to include more host-repeating substrings, and these substrings tend to appear in the middle parts of the viral coding regions. In addition, in human viruses these substrings tend to be enriched with motives related to transcription factors and RNA binding proteins. The host-repeating substrings are possibly related to the evolutionary pressure on the viruses to effectively interact with host's intracellular factors and to efficiently escape from the host's immune system.Supplementary information Supplementary data are available at Bioinformatics online.

A HYBRID TECHNIQUE FOR SOFTWARE CLONE DETECTION BY USING TOKEN BASED AND LINE BASED APPROACH

The presence of same code more than one time degrades the quality of the software that outperforms software maintainability which is too difficult to manage. In this research paper, authors designed a new methodology which is termed as “A Hybrid Technique for software code clone detection by using Token Based and Line Based Approach” (HTSCCDUToLiA) whose main purpose is to detect different types of clones viz. Type 1, Type 2 and Type 3 clones etc. This newly designed methodology working is based on two different types of software cloning approaches viz. Line based Approach and Token Based Approach. The major objective of this research paper is to remove redundant code or free space which is covered by the comment lines especially.The main significance to detect clones is to improve software code reusability and decrease same lines of source code. The major benefit to propose this new designed methodology is automatic detection of software code clone within minimum duration of time.In addition, the other benefit to design this new hybrid technique is to save software developer time, space as well as effort. By utilizing this new designed methodology the amount of code clones under a specific project or specific application can be easily reduced or removed up to some extent that will ultimately increase the performance of the software. In this way, this new designed methodology in future will helpful for producing more consistent or more efficient results.

Adaptive Batch Coding: A Balanced Congestion Control Strategy for Multi-Beam Antenna Networks

Multi-Beam Smart Antennas (MBSAs) achieve concurrent communications in multiple beams, thereby providing higher throughput compared to regular directional antennas. Most of the transport control schemes used today are based on TCP, which is too conservative since it indiscriminately reduces the window size upon any packet loss. The other extremity is the de-congestion control strategy, which abandons both window size control and retransmission, aggressively saturates the network, and compensates packet loss via network coding. To adapt to the features of the MBSA-based networks, this paper proposes a balanced transport control strategy between the above two categories, which is based on the idea of Adaptive Batch Coding (ABC) . The proposed ABC scheme resists random loss through redundant coding and copes with congestion via window shrink and retransmission. Using a cross-layer design (between transport and routing layer), both the coding scheme and the traffic allocation are adaptively adjusted according to network conditions. A customized simulation system has been developed to comprehensively evaluate the performance of the proposed ABC protocol. Experimental results show that the proposed scheme overcomes the drawbacks of those two extremities. It achieves both high throughput and high throughput (under packet loss) in MBSA-based networks.

Reducing the Power Consumption of Fault Tolerant Registers Through Hybrid Protection

Soft errors produced by radiation events can cause malfunctions in modern day electronics. To preserve the system functionality, its elements must be protected against the effects of these events. Two of the possible techniques usually employed to implement fault tolerant registers are triple modular redundancy (TMR) and single error correcting (SEC) codes. However, the use of these techniques increases circuit area, timing, and power consumption to different extents. In this paper, we study the influence of each of these approaches on the circuit when they are implemented in application-specific integrated circuits and, based on the results, present some guidelines to choose between both of them depending on the design requirements. Additionally, we present a new low power fault tolerant technique destined for registers in which a subset of bits have a lower switching activity than the rest. This approach is based on the idea of combining TMR and SEC codes within a register to implement a hybrid protection that can exploit the strengths of each of the techniques. Our results show that the use of this technique achieves both power and area savings with respect to TMR in most cases, whereas it achieves large power savings with respect to SEC codes at the cost of increasing the area overhead.

Lookup Table Algorithm for Error Correction in Color Images

Error correction and error detection techniques are often used in wireless transmission systems. A color image of type BMP is considered as an application of developed lookup table algorithms to detect and correct errors in these images. Decimal Matrix Code (DMC) and Hamming code (HC) techniques were integrated to compose Hybrid Matrix Code (HMC) to maximize the error detection and correction. The results obtained from HMC still have some error not corrected because the redundant bits added by Hamming codes to the data are considered inadequate, and it is suitable when the error rate is low for detection and correction processes. Besides, a Hamming code could not detect large burst error period, in addition, the have same values sometimes which lead to not detect the error and consequently increase the error ratio. The proposed algorithm LUT_CORR is presented to detect and correct errors in color images over noisy channels, the proposed algorithm depends on the parallel Cyclic Redundancy Code (CRC) method that's based on two algorithms: Sarwate and slicing By N algorithms. The LUT-CORR and the aforementioned algorithms were merged to correct errors in color images, the output results correct the corrupted images with a 100 % ratio almost. The above high correction ratio due to some unique values that the LUT-CORR algorithm have. The HMC and the proposed algorithm applied to different BMP images, the obtained results from LUT-CORR are compared to HMC for both Mean Square Error (MSE) and correction ratio. The outcome from the proposed algorithm shows a good performance and has a high correction ratio to retrieve the source BMP image.

Perceptual consequences of cochlear synaptopathy in middle age

It is known that as the body ages, listening in noisy situations becomes increasingly more difficult. Middle-aged people have more difficulty than younger people in complex listening environments, even with similar audiometric thresholds. One hypothesis for why this might be is age-related cochlear synaptopathy. Cochlear synaptopathy has been robustly observed to occur with normal aging in animals, and in post-mortem studies of human temporal bones harvested at different ages. However, there are currently no clinical assessments to measure cochlear synaptopathy or the perceptual consequences of this phenomenon. Currently, we are evaluating a battery of clinical and laboratory measures by comparing young and middle-aged listeners with matched audiometric thresholds within the normal range. The battery includes both objective physiological measures that correlate with synaptopathy in animal models, and perceptual measures that hypothetically may be sensitive to synaptopathy-mediated loss of redundancy in afferent coding. Here, we discuss our initial findings within these parameters.It is known that as the body ages, listening in noisy situations becomes increasingly more difficult. Middle-aged people have more difficulty than younger people in complex listening environments, even with similar audiometric thresholds. One hypothesis for why this might be is age-related cochlear synaptopathy. Cochlear synaptopathy has been robustly observed to occur with normal aging in animals, and in post-mortem studies of human temporal bones harvested at different ages. However, there are currently no clinical assessments to measure cochlear synaptopathy or the perceptual consequences of this phenomenon. Currently, we are evaluating a battery of clinical and laboratory measures by comparing young and middle-aged listeners with matched audiometric thresholds within the normal range. The battery includes both objective physiological measures that correlate with synaptopathy in animal models, and perceptual measures that hypothetically may be sensitive to synaptopathy-mediated loss of redundancy in af...

A Parity-Check Spectral R-Code

This article introduces a parity-check code based on the Rademacher function. The error-correction model of the code corresponds to a binary symmetrical channel: bits may be inverted randomly and independently, but no bit insertion/bit omission occurs. The code corrects a single error; its redundancy and coding/decoding features are virtually identical with those of the Hamming code, but it has clear advantages for application of redundant coding in fault-tolerant integrated-circuit design.

Visual perception based rate distortion optimization method for high dynamic range video coding

In view of the drastic increase of storage resources and transmission bandwidth requirement for high dynamic range (HDR) video compared to the traditional low dynamic range (LDR) video, we propose a dynamic rate distortion optimization algorithm based on visual perception for HDR Video encoding to improve the performance of high efficiency video coding (HEVC) Main 10 for coding HDR video. With the information of visual selective attention, we design a non-uniform distortion weight distribution strategy to different regions of interest and improve the conventional method of distortion calculation. At the same time, in order to further eliminate the perceptive redundancy in HDR video coding, the texture characteristics of video content are used to adjust Lagrange multipliers adaptively, which is applied to the encoder to dynamically adjust the quantization parameters to realize reasonably the trade-off between coded bits and distortion perception. The experimental results show that the proposed algorithm can save an average of 7.46% and 6.53% bitrate with the same HDR-visible difference predictor-2.2(HDR-VDP-2.2) and PSNR_DE compared with HEVC Main 10, saving the maximum of 18.52 % and 11.49% respectively. The proposed algorithm can effectively reduce the consumption of the overall bitrates and still maintain the visual quality of the reconstructed HDR video.

Hybrid Network Coding Scheme in Cognitive Radio Networks With Multiple Secondary Users

In order to realize a variety of intelligent applications, a large number of devices need to collect and transmit potentially large amounts of data through the Internet of Things. However, with the explosive growth of communication devices, spectrum resources are becoming more and more scarce, which in turn makes it impossible to send information in time. Cognitive radio technology is an effective way to resolve spectrum allocation shortages, while the spatiotemporal uncertainty of spectrum has a great influence on the secondary user (SU)’s throughput. In this paper, we investigate the network coding scheme in cognitive radio networks under multiple primary and SU relationships, including non-collaboration, collaboration, and lease. Moreover, we propose a hybrid network coding scheme to improve the utilization efficiency of idle spectrum. In particular, the successful transmission rate and the packet loss rate can be increased and decreased through redundant coding, respectively. The simulation results show that our proposed scheme can achieve a better performance in terms of both delay and throughput than the existing mechanisms.

On the Second Separating Redundancy of LDPC Codes from Finite Planes

On the Second Separating Redundancy of LDPC Codes from Finite Planes

A novel visible-infrared image fusion framework for smart city

Image fusion technology is widely used in different areas and can integrate complementary and relevant information of source images captured by multiple sensors into a unitary synthetic image. Image fusion technology as an efficient way to integrate information from multiple images plays a more and more important role in smart city. The quality of fused image affects the accuracy, efficiency, and robustness of the related applications. Existing sparse representation-based image fusion methods consist of overly complete and redundant dictionaries learning and sparse coding. However, overly complete and redundant dictionary does not consider the discriminative ability of dictionaries that may seriously affect the image fusion. A good dictionary is the key to a successful image fusion technique. To construct a discriminative dictionary, a novel framework that integrates an image-patches clustering and online dictionary learning methods is proposed for visible-infrared image fusion. The comparison experiments with existing solutions are used to validate and demonstrate the effectiveness of the proposed solution for image fusion.

Classifying <i>Drosophila</i> Olfactory Projection Neuron Subtypes by Singlecell RNA Sequencing

How a neuronal cell type is defined and how this relates to its transcriptome are still open questions. The Drosophila olfactory projection neurons (PNs) are among the best-characterized neuronal types: Different PN classes target dendrites to distinct olfactory glomeruli and PNs of the same class exhibit indistinguishable anatomical and physiological properties. Using single-cell RNA-sequencing, we comprehensively characterized the transcriptomes of 40 PN classes and unequivocally identified transcriptomes for 6 classes. We found a new lineage-specific transcription factor that instructs PN dendrite targeting. Transcriptomes of closely related PN classes exhibit the largest difference during circuit assembly, but become indistinguishable in adults, suggesting that neuronal subtype diversity peaks during development. Genes encoding transcription factors and cell-surface molecules are the most differentially expressed, indicating their central roles in specifying neuronal identity. Finally, we show that PNs use highly redundant combinatorial molecular codes to distinguish subtypes, enabling robust specification of cell identity and circuit assembly.

High Performance Parallel Decimal Multipliers Using Hybrid BCD Codes

A parallel decimal multiplier with improved performance is proposed in this paper by exploiting the properties of three different binary coded decimal (BCD) codes, namely the redundant BCD excess-3 code (XS-3), the overloaded decimal digit set (ODDS) code and the BCD-4221/5211 code. The signed-digit radix-10 recoding is used to recode the BCD multiplier to the digit set [-5, 5] from [0, 9]. The redundant BCD XS-3 code is adopted to generate the multiplicand multiples in a carry-free manner. The XS-3 coded partial products (PPs) are converted to ODDS PPs to fit binary partial product reduction (PPR). In this paper, a regular decimal PPR tree using ODDS and BCD-4221/5211 codes is proposed; it consists of a binary PPR tree block, a non-fixed size BCD-4221 counter block and a BCD-4221/5211 PPR tree block. The decimal carry-save algorithm based on BCD-4221/5211 is used in the PPR tree to obtain high performance multipliers. Moreover, an improved PPG circuit and an improved parallel prefix/carry-select decimal adder are proposed to further improve the performance of the proposed multipliers. Analysis and comparison using the 45 nm technology show that the proposed decimal multipliers are faster and require less hardware area than previous designs found in the technical literature.

Efficiency two-character ensembles of letters using in systems decision feedback

The estimation of the efficiency of the transmission of discrete information in systems with solving feedback link is carried out in the work. It allows in each signal structure synthesized on the timed signals base of to transmit information about two next symbols of the Russian language or two bytes.In paragraph 1 “Efficiency of simplex discrete systems with position codingˮ, definition of simplex transmission systems is given according to [1], in which the quality of the received codeword and its correction are made on the receiving side. For which positional redundancy codes are used, an analysis of their main characteristics is carried out and it is proved that redundancy in position coding in channels of the Hilbert model over a longer transmission time interval is not used effectively.In paragraph 2 “Systems with ROS on the position codes baseˮ to increase the one element information capacity of the code structure, it was suggested to make the transition to the system with ROS, analysis of the losses for the repetition of detected errors in the code words of systems with ROS, in the radio relay telephone channel (Table 2). Taking into account that the entropy (the amount of information in the code word), according to [3], is determined by the expression (6), for increasing of it, it is necessary to increase the number of realizations on the code word interval.In paragraph 3 “Timed signals as a code multiplexing toolˮ, it is determined that, unlike positional coding, the distance between the modulation instants is not a multiple of the Nyquist element, but it is not less than it. Such formation of signal structures provides a greater number of them at a given interval, but with a minimum energy distance.In paragraph 4. “Conclusionˮ the main properties of the timer signals are defined, namely:1) the number of realizations of time signals Npm for m> 4, s> 3 is much larger than the number of realizations of the position codes NPK (Nt >> NPK );2) in Table. 3.4 [3] the values of Nрт are given for m Î 4¸10; s Î 1¸12; i Î 1¸6;3) correcting and simple TSK are realized on the same time interval Tsk = mt0;4) to increase the information capacity of the nayquist element, it is necessary to create ensembles from the sets of signal structures for a different number of segments i in the code word.

Novice programmer’s misconception of programming reflected on problem-solving plans

Understanding the misconception of students is critical in that it identifies the reasons of errors students make and allows instructors to design instructions accordingly. This study investigated the mental models of programming concepts held by pre-service teachers who were novice in programming. In an introductory programming course, students were asked to solve problems that could be solved by utilizing conditional statements. They developed solution plans pseudo-code including a simplified natural language, symbols, diagrams, and so on. Sixteen solution plans of three different types of problems were analyzed. As a result, the students’ egocentric and insufficient programming concepts were identified in terms of the misuse of variables, redundancy of codes, and weak strategic knowledge. The results revealed that the students had difficulty designing solution plans that could be executed by computers. They needed instructional supports to master how to express their solution plans in the way computers run. Problem driven instructional designs for novice students were discussed.

Somatic mutation driven codon transition bias in human cancer

Accumulation of DNA mutations alters amino acid sequence in the key domains of oncoproteins, leading to cellular malignant transformation. Due to redundancy of the genetic code, the same amino acid alteration can be achieved by multiple distinct genetic mutations, which are considered functionally identical and not actively distinguished in the current cancer genome research. For the first time, we analyzed the distribution of codon level transitions acquired by somatic mutations in human cancers. By analyzing the ~2.5 million nonsynonymous somatic single nucleotide variations (SNVs) found in the COSMIC database, we found 41 recurrent amino acid alterations whose DNA changes are significantly biased toward a specific codon transition. Additional analyses partially identified functional discrepancies between the favored and avoided codon transitions in terms of mutational process, codon usage, alternative splicing, and mRNA stability.

Proof-of-concept: role of generic content characteristics in optimizing video encoders

The influence of content characteristics on the efficiency of redundancy and irrelevance reduction in video coding is well known. Each new standard in video coding includes additional coding tools that potentially increase the complexity of the encoding process in order to gain further rate-distortion efficiency. In order to be versatile, encoder implementations often neglect the content dependency or they optimize the encoding complexity on a local scale, i.e. on a single frame or on the coding unit level without being aware of the global content type. In this contribution, an analysis is presented which coding tool settings of the recent High Efficiency Video Coding (HEVC) standard are most efficient for a given content type when balancing rate-distortion against computational complexity measured in encoding time. The content type is algorithmically determined, leading to a framework for rate-distortion-complexity based encoder parameter decision for any given video sequence. The implementability is demonstrated using a set of 35 Ultra-HD (UHD) sequences. The performance results and evaluations show that the encoding parameters may be predicted to optimize the video coding. For instance, predicting motion search range achieves complexity reduction of 36% on average when HEVC reference HM is used at a cost of bitrate (2%). When another HEVC coding standard software, x265, is used to predict the coding unit (CU) size, there is a reduction of 20% in bitrate and of 8% in distortion but there is a reduction of 6% in execution time.

Polarimetric SAR Image Factorization

This paper reformulates the problem of polarimetric incoherent target decomposition as a general image factorization which aims to simultaneously estimate a dictionary of meaningful atom scatterers and their corresponding spatial distribution maps. Both model-based and eigenanalysis-based decompositions can be seen as special cases of image factorization under specific constraints. The inverse problem of image factorization can be converted to an equivalent nonnegative matrix factorization (NMF) problem via redundant coding. It enables a wide range of NMF algorithms with various regularizations to be directly applicable to polarimetric image analysis. The advantage of the proposed image factorization is demonstrated on both synthesized and real data. It also shows that extended applications such as speckle reduction and classification can benefit from the proposed image factorization.

Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes

Binary almost instantaneous fixed-to-variable length (AIFV) codes are lossless codes that generalize the class of instantaneous fixed-to-variable length codes. The code uses two code trees and assigns source symbols to incomplete internal nodes as well as to leaves. AIFV codes are empirically shown to attain better compression ratio than Huffman codes. Nevertheless, an upper bound on the redundancy of optimal binary AIFV codes is only known to be 1, which is the same as the bound of Huffman codes. In this paper, the upper bound is improved to 1/2, which is shown to coincide with the worst-case redundancy of the codes. Along with this, the worst-case redundancy is derived for sources with $p_{\max }\geq 1$ /2, where $p_{\max }$ is the probability of the most likely source symbol. In addition, we propose an extension of binary AIFV codes, which use $m$ code trees and allow at most $m$ -bit decoding delay. We show that the worst-case redundancy of the extended binary AIFV codes is $1/m$ for $m \leq 4$ .

Controlled Flooding of Fountain Codes

We consider a multihop network where a source node must reliably deliver a set of data packets to a given destination node. To do so, the source applies a fountain code and floods the encoded packets through the network, until they reach their destination or are lost in the process. We model the probability that the destination can recover the original transmissions from the received coded packets as a function of the network topology and of the code redundancy, and show that our analytical results predict the outcome of simulations very well. These results are employed to design distributed forwarding policies that achieve a good tradeoff between the success probability and the total number of transmissions required to advance a packet toward the destination. We finally develop in detail the case where intermediate relays can inject additional redundancy in the network, provided that they have successfully decoded the source packets.