Scan test in 18x8 bits Booth Coding-Wallace Tree multiplier

Scan test can be inserted around hard IP cores that have not been designed with DFT approaches. An 18x18 bits Booth Coding-Wallace Tree multiplier has been designed with full custom approach with 0.61 m CMOS technology. When we reuse the multiplier in another chip, scan chain has been inserted around it to increase the fault coverage. After scan insertion, the multiplier needs 4.7% more areas and 24.4% more delay time, while the fault coverage reaches to 95%.

Optimized logarithmic phase masks used to generate defocus invariant modulation transfer function for wavefront coding system

In a previous Letter [Opt. Lett. 33, 1171 (2008)], we proposed an improved logarithmic phase mask by making modifications to the original one designed by Sherif. However, further studies in another paper [Appl. Opt. 49, 229 (2010)] show that even when the Sherif mask and the improved one are optimized, their corresponding defocused modulation transfer functions (MTFs) are still not stable with respect to focus errors. So, by further modifying their phase profiles, we design another two logarithmic phase masks that exhibit more stable defocused MTF. However, with the defocus-induced phase effect considered, we find that the performance of the two masks proposed in this Letter is better than the Sherif mask, but worse than our previously proposed phase mask, according to the Hilbert space angle. (C) 2010 Optical Society of America

Performance of an improved logarithmic phase mask with optimized parameters in a wavefront-coding system

In two papers [Proc. SPIE 4471, 272-280 (2001) and Appl. Opt. 43, 2709-2721 (2004)], a logarithmic phase mask was proposed and proved to be effective in extending the depth of field; however, according to our research, this mask is not that perfect because the corresponding defocused modulation transfer function has large oscillations in the low-frequency region, even when the mask is optimized. So, in a previously published paper [Opt. Lett. 33, 1171-1173 (2008)], we proposed an improved logarithmic phase mask by making a small modification. The new mask can not only eliminate the drawbacks to a certain extent but can also be even less sensitive to focus errors according to Fisher information criteria. However, the performance comparison was carried out with the modified mask not being optimized, which was not reasonable. In this manuscript, we optimize the modified logarithmic phase mask first before analyzing its performance and more convincing results have been obtained based on the analysis of several frequently used metrics. (C) 2010 Optical Society of America

Profiling of Complex Microbial Populations by Denaturing Gradient Gel Electrophoresis Analysis of Polymerase Chain Reaction-Amplified Genes Coding for 16S rRNA

We describe a new molecular approach to analyzing the genetic diversity of complex microbial populations. This technique is based on the separation of polymerase chain reaction-amplified fragments of genes coding for 16S rRNA, all the same length, by denaturing gradient gel electrophoresis (DGGE). DGGE analysis of different microbial communities demonstrated the presence of up to 10 distinguishable bands in the separation pattern, which were most likely derived from as many different species constituting these populations, and thereby generated a DGGE profile of the populations. We showed that it is possible to identify constituents which represent only 1% of the total population. With an oligonucleotide probe specific for the V3 region of 16S rRNA of sulfate-reducing bacteria, particular DNA fragments from some of the microbial populations could be identified by hybridization analysis. Analysis of the genomic DNA from a bacterial biofilm grown under aerobic conditions suggests that sulfate-reducing bacteria, despite their anaerobicity, were present in this environment. The results we obtained demonstrate that this technique will contribute to our understanding of the genetic diversity of uncharacterized microbial populations.

The complete mitochondrial genome of the mantid shrimp Oratosquilla oratoria (Crustacea: Malacostraca: Stomatopoda): Novel non-coding regions features and phylogenetic implications of the Stomatopoda

The complete mitochondrial (mt) genome sequence of Oratosquilla oratoria (Crustacea: Malacostraca: Stomatopoda) was determined; a circular molecule of 15,783 bp in length. The gene content and arrangement are consistent with the pancrustacean ground pattern. The mt control region of O. oratoria is characterized by no GA-block near the 3' end and different position of [TA(A)]n-blocks compared with other reported Stomatopoda species. The sequence of the second hairpin structure is relative conserved which suggests this region may be a synapomorphic character for the Stomatopoda. In addition, a relative large intergenic spacer (101 bp) with higher A + T content than that in control region was identified between the tRNA(Glu) and tRNA(Phe) genes. Phylogenetic analyses based on the current dataset of complete mt genomes strongly support the Stomatopoda is closely related to Euphausiacea. They in turn cluster with Penaeoidea and Caridea clades while other decapods form a separate group, which rejects the monophyly of Decapoda. This challenges the suitability of Stomatopoda as an outgroup of Decapoda in phylogenetic analyses. The basal position of Stomatopoda within Eumalacostraca according to the morphological characters is also questioned. (C) 2010 Elsevier Inc. All rights reserved.

Review of "Coding for Success" implementation.

Coding for Success was published in 2007 and described how bar coding and similar technologies can be used to improve patient safety, reduce costs and improve efficiency. This review aims to outline progress made since 2007, and was recommended by the Health Select Committee in its 2009 report on Patient Safety.

Non-commutative symbolic coding

Gohm, Rolf; Kummerer, B.; Lang, T., (2006) 'Non-commutative symbolic coding', Ergodic Theory and Dynamical Systems 26(5) pp.1521-1548 RAE2008

Dynamic Binding of Visual Contours Without Temporal Coding

Recognition of objects in complex visual scenes is greatly simplified by the ability to segment features belonging to different objects while grouping features belonging to the same object. This feature-binding process can be driven by the local relations between visual contours. The standard method for implementing this process with neural networks uses a temporal code to bind features together. I propose a spatial coding alternative for the dynamic binding of visual contours, and demonstrate the spatial coding method for segmenting an image consisting of three overlapping objects.

Neural Pattern Recognition With Multi-Scale Pyramidal Coding and Selective Attention

A new neural network architecture for spatial patttern recognition using multi-scale pyramida1 coding is here described. The network has an ARTMAP structure with a new class of ART-module, called Hybrid ART-module, as its front-end processor. Hybrid ART-module, which has processing modules corresponding to each scale channel of multi-scale pyramid, employs channels of finer scales only if it is necesssary to discriminate a pattern from others. This process is effected by serial match tracking. Also the parallel match tracking is used to select the spatial location having most salient feature and limit its attention to that part.

Gröbner basis techniques for certain problems in coding and systems theory

There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has shown that a Göbner basis approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time modeling, multivariable interpolation and list decoding. Gröbner basis theory has come into its own in the context of software and algorithm development. By generalizing the concept of polynomial degree, term orders are provided for multivariable polynomial rings and free modules over polynomial rings. The orders are not, in general, unique and this adds, in no small way, to the power and flexibility of the technique. As well as being generating sets for ideals or modules, Gröbner bases always contain a element which is minimal with respect tot the corresponding term order. Central to this thesis is a general algorithm, valid for any term order, that produces a Gröbner basis for the solution module (or ideal) of elements satisfying a sequence of generalized congruences. These congruences, based on shifts and homomorphisms, are applicable to a wide variety of problems, including key equations and interpolations. At the core of the algorithm is an incremental step. Iterating this step lends a recursive/iterative character to the algorithm. As a consequence, not all of the input to the algorithm need be available from the start and different "paths" can be taken to reach the final solution. The existence of a suitable chain of modules satisfying the criteria of the incremental step is a prerequisite for applying the algorithm.

SDC: Scalable description coding for adaptive streaming media

Video compression techniques enable adaptive media streaming over heterogeneous links to end-devices. Scalable Video Coding (SVC) and Multiple Description Coding (MDC) represent well-known techniques for video compression with distinct characteristics in terms of bandwidth efficiency and resiliency to packet loss. In this paper, we present Scalable Description Coding (SDC), a technique to compromise the tradeoff between bandwidth efficiency and error resiliency without sacrificing user-perceived quality. Additionally, we propose a scheme that combines network coding and SDC to further improve the error resiliency. SDC yields upwards of 25% bandwidth savings over MDC. Additionally, our scheme features higher quality for longer durations even at high packet loss rates.