An on-line algorithm for the location of cross point faults in programmable logic arrays

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the algorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.

A Spectral Iteration Technique For The Analysis Of Yagi-Uda Arrays

The paper present a spectral iteration technique for the analysis of linear arrays of unequally spaced dipoles of unequal lengths. As an example, the Yagi-Uda array is considered for illustration. Analysis is carried out in both the spatial as well as the spectral domains, the two being linked by the Fourier transform. The fast Fourier transform algorithm is employed to obtain an iterative solution to the electric field integral equation and the need for matrix inversion is circumvented. This technique also provides a convenient means for testing the satisfaction of the boundary conditions on the array elements. Numerical comparison of the input impedance and radiation pattern have been made with results deduced elsewhere by other methods. The computational efficency of this technique has been found to be significant for large arrays.

Difference covering arrays and pseudo-orthogonal Latin squares

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.

An On-Line Algorithm for the Location of Cross Point Faults in Programmable Logic Arrays

An on-line algorithm is developed for the location of single cross point faults in a PLA (FPLA). The main feature of the valgorithm is the determination of a fault set corresponding to the response obtained for a failed test. For the apparently small number of faults in this set, all other tests are generated and a fault table is formed. Subsequently, an adaptive procedure is used to diagnose the fault. Functional equivalence test is carried out to determine the actual fault class if the adaptive testing results in a set of faults with identical tests. The large amount of computation time and storage required in the determination, a priori, of all the fault equivalence classes or in the construction of a fault dictionary are not needed here. A brief study of functional equivalence among the cross point faults is also made.

Foldable compatibility matrix for the folding of programmable logic arrays

This paper describes a switching theoretic algorithm for the folding of programmable logic arrays (PLA). The algorithm is valid for both column and row folding, although it has been presented considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are mapped into a square matrix, called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept introduced by the author, is then derived from the compatibility matrix. A new theorem called the folding theorem is then proved. The theorem states that the existence of an m by 2m FCM is both necessary and sufficient to fold 2m columns of the n column PLA (2m ≤ n). Once an FCM is obtained, the ordered pairs of foldable columns and the re-ordering of the rows are readily determined.

Oriented Nanocrystal Arrays of Selectable Polymorphs by Chemical Sculpture

Growing crystals with selected structure and preferred orientations oil seed substrates is crucial for a wide variety of applications. Although epitaxial or textured film growth of a polymorph whose structure resembles the seed crystal structure is well-known, growing oriented nanocrystal arrays or more than one polymorph, selectable one at a time, from the same seed has not been realized. Here, we demonstrate for the first time the exclusive growth of oriented nanocrystal arrays of two titania polymorphs from a titanate crystal by chemically activating respective polymorph-mimicking crystallographic facets in the seed. The oriented titania nanocrystal arrays exhibit significantly higher photocatalytic activity than randomly oriented polymorphs. Our approach of chemically sculpting oriented nanocrystal polymorph arrays could be adapted to other materials systems to obtain novel properties.

Small nerve fiber quantification in the diagnosis of diabetic sensorimotor polyneuropathy: Comparing corneal confocal microscopy with intraepidermal nerve fiber density

OBJECTIVE Quantitative assessment of small fiber damage is key to the early diagnosis and assessment of progression or regression of diabetic sensorimotor polyneuropathy (DSPN). Intraepidermal nerve fiber density (IENFD) is the current gold standard, but corneal confocal microscopy (CCM), an in vivo ophthalmic imaging modality, has the potential to be a noninvasive and objective image biomarker for identifying small fiber damage. The purpose of this study was to determine the diagnostic performance of CCM and IENFD by using the current guidelines as the reference standard. RESEARCH DESIGN AND METHODS Eighty-nine subjects (26 control subjects and 63 patients with type 1 diabetes), with and without DSPN, underwent a detailed assessment of neuropathy, including CCM and skin biopsy. RESULTS Manual and automated corneal nerve fiber density (CNFD) (P < 0.0001), branch density (CNBD) (P < 0.0001) and length (CNFL) (P < 0.0001), and IENFD (P < 0.001) were significantly reduced in patients with diabetes with DSPN compared with control subjects. The area under the receiver operating characteristic curve for identifying DSPN was 0.82 for manual CNFD, 0.80 for automated CNFD, and 0.66 for IENFD, which did not differ significantly (P = 0.14). CONCLUSIONS This study shows comparable diagnostic efficiency between CCM and IENFD, providing further support for the clinical utility of CCM as a surrogate end point for DSPN.

Enrichment and identification of glycoproteins in human saliva using lectin magnetic bead arrays

Aberrant glycosylation of proteins is a hallmark of tumorigenesis, and could provide diagnostic value in cancer detection. Human saliva is an ideal source of glycoproteins due to the relatively high proportion of glycosylated proteins in the salivary proteome. Moreover, saliva collection is non-invasive, technically straightforward and the sample collection and storage is relatively easy. Although, differential glycosylation of proteins can be indicative of disease states, identification of differential glycosylation from clinical samples is not trivial. To facilitate salivary glycoprotein biomarker discovery, we optimised a method for differential glycoprotein enrichment from human saliva based on lectin magnetic bead arrays (saLeMBA). Selected lectins from distinct reactivity groups were used in the saLeMBA platform to enrich salivary glycoproteins from healthy volunteer saliva. The technical reproducibility of saLeMBA was analysed with LC-MS/MS to identify the glycosylated proteins enriched by each lectin. Our saLeMBA platform enabled robust glycoprotein enrichment in a glycoprotein- and lectin-specific manner consistent with known protein-specific glycan profiles. We demonstrated that saLeMBA is a reliable method to enrich and detect glycoproteins present in human saliva.

Computational Identification of Recessive Mutations in Cancers using High Throughput SNP-arrays

This thesis presents a highly sensitive genome wide search method for recessive mutations. The method is suitable for distantly related samples that are divided into phenotype positives and negatives. High throughput genotype arrays are used to identify and compare homozygous regions between the cohorts. The method is demonstrated by comparing colorectal cancer patients against unaffected references. The objective is to find homozygous regions and alleles that are more common in cancer patients. We have designed and implemented software tools to automate the data analysis from genotypes to lists of candidate genes and to their properties. The programs have been designed in respect to a pipeline architecture that allows their integration to other programs such as biological databases and copy number analysis tools. The integration of the tools is crucial as the genome wide analysis of the cohort differences produces many candidate regions not related to the studied phenotype. CohortComparator is a genotype comparison tool that detects homozygous regions and compares their loci and allele constitutions between two sets of samples. The data is visualised in chromosome specific graphs illustrating the homozygous regions and alleles of each sample. The genomic regions that may harbour recessive mutations are emphasised with different colours and a scoring scheme is given for these regions. The detection of homozygous regions, cohort comparisons and result annotations are all subjected to presumptions many of which have been parameterized in our programs. The effect of these parameters and the suitable scope of the methods have been evaluated. Samples with different resolutions can be balanced with the genotype estimates of their haplotypes and they can be used within the same study.

Iterative solution of a class of linear equations with application to reconstruction of three-dimensional object arrays

An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm solution of a very large, consistent, linear system of equations AX = g where A is an (m times n) matrix with non-negative elements, x and g are respectively (n times 1) and (m times 1) vectors with positive components.

Mass transfer with surface reaction in arrays of cylinders at low reynolds and high peclet numbers

Creeping flow hydrodynamics combined with diffusion boundary layer equation are solved in conjunction with free-surface cell model to obtain a solution of the problem of convective transfer with surface reaction for flow parallel to an array of cylindrical pellets at high Peclet numbers and under fast and intermediate kinetics regimes. Expressions are derived for surface concentration, boundary layer thickness, mass flux and Sherwood number in terms of Damkoehler number, Peclet number and void fraction of the array. The theoretical results are evaluated numerically.

A Novel Opto Electro Mechanical Interrogation System for Measuring Wavelength Shifts in Fiber Bragg Grating (FBG) Sensors

Here, we describe a novel FBG interrogation system in which FBGs are used as both sensing and reference elements. The reference FBGs is bonded to a mechanical flexure system having a linear amplification of 1:3.5, which is actuated using a piezo-actuator by applying a 0-150V ramp. The lengths of the reference gratings decide the maximum strain that can be applied to the reference grating, which in turn decides that strain range which can be interrogated. The main advantages of the present system are the on-line measurement of the wavelength shifts, small size, good sensitivity, multiplexing capability and low cost.

Field Emission Properties of Carbon Nanotube Arrays with Defects and Impurities

It has been found experimentally that the results related to the collective field emission performance of carbon nanotube (CNT) arrays show variability. The emission performance depends on the electronic structure of CNTs (especially their tips). Due to limitations in the synthesis process, production of highly pure and defect free CNTs is very difficult. The presence of defects and impurities affects the electronic structure of CNTs. Therefore, it is essential to analyze the effect of defects on the electronic structure, and hence, the field emission current. In this paper, we develop a modeling approach for evaluating the effect of defects and impurities on the overall field emission performance of a CNT array. We employ a concept of effective stiffness degradation for segments of CNTs, which is due to structural defects. Then, we incorporate the vacancy defects and charge impurity effects in our Green's function based approach. Simulation results indicate decrease in average current due to the presence of such defects and impurities.