Maximum two-dimensional (u×v,4,1,3)-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.

Multiple bit upsets mitigation in memory by using improved hamming codes and parity codes

This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended at the end of data bits,which eliminates the overhead of interspersing the redundancy bits at the encoder and decoder.The reliability of memory is further enhanced by the layout architecture of redundancy bits and data bits.The proposed scheme has been implemented in Verilog and synthesized using the Synopsys tools.The results reveal that the proposed method has about 19% less area penalties and 13% less power consumption comparing with the current two-dimensional error codes,and its latency of encoder and decoder is 63% less than that of Hamming codes.

Emergence of Plastidial Intergenic Spacers as Suitable DNA Barcodes for Arid Medicinal Plant <i>Rhazya stricta</i>

The desert plant Rhazya stricta has anticancer and antimicrobial properties, and is widely used in indigenous medicines of Saudi Arabia. However, the therapeutic benefits rely on an accurate identification of this species. The authenticity of R. stricta and other medicinal plants and herbs procured from local markets can be questionable due to a lack of clear phenotypic traits. DNA barcoding is an emerging technology for rapid and accurate species identification. In this study, six candidate chloroplastid barcodes were investigated for the authentication of R. stricta. We compared the DNA sequences from fifty locally collected and five market samples of R. stricta with database sequences of R. stricta and seven closely related species. We found that the coding regions matK, rbcL, rpoB, and rpoC1 were highly similar among the taxa. By contrast, the intergenic spacers psbK-psbI and atpF-atpH were variable loci distinct for the medicinal plant R. stricta. psbK-psbI clearly discriminated R. stricta samples as an efficient single locus marker, whereas a two-locus marker combination comprising psbK-psbI + atpF-atpH was also promising according to results from the Basic Local Alignment Search Tool and a maximum likelihood gene tree generated using PHyML. Two-dimensional DNA barcodes (i.e., QR codes) for the psbK-psbI and psbK-psbI + atpF-atpH regions were created for the validation of fresh or dried R. stricta samples.

Very Low Bit-Rate Video Coding by Combining H.264/AVC Standard and 2-D Discrete Wavelet Transform

In this paper, we propose a new method for very low bit-rate video coding that combines H.264/AVC standard and two-dimensional discrete wavelet transform. In this method, first a two dimensional wavelet transform is applied on each video frame independently to extract the low frequency components for each frame and then the low frequency parts of all frames are coded using H.264/AVC codec. On the other hand, the high frequency parts of the video frames are coded by Run Length Coding algorithm, after applying a threshold to neglect the low value coefficients. Experiments show that our proposed method can achieve better rate-distortion performance at very low bit-rate applications below 16 kbits/s compared to applying H.264/AVC standard directly to all frames. Applications of our proposed video coding technique include video telephony, video-conferencing, transmitting or receiving video over half-rate traffic channels of GSM networks.

A framework to express variant and invariant functional spaces for binary logic

A new framework has been developed to express variant and invariant properties of functions operating on a binary vector space.This framework allows for manipulation of dynamic logic using basic operations and permutations.Novel representations of binary functional spaces are presented.Current ideas of binary functional spaces are extended and additional conditions are added to describe new function representation schemes:F code and C code.Sizes of the proposed functional space representation schemes were determined.It was found that the complete representation for any set of functions operating on a binary sequence of numbers is larger than previously thought.The complete representation can only be described using a structure having a space of size 2^(2n)×2^(n)!for any given space of functions acting on a binary sequence of length n.The framework,along with the proposed coding schemes provides a foundational theory of variant and invariant logic in software and electricelectronic technology and engineering,and has uses in the analysis of the stability of rule-based,dynamic binary systems such as cellular automata.