Studies on thin film based flexible gold electrode arrays for resistivity imaging in electrical impedance tomography

Practical phantoms are essential to assess the electrical impedance tomography (EIT) systems for their validation, calibration and comparison purposes. Metal surface electrodes are generally used in practical phantoms which reduce the SNR of the boundary data due to their design and development errors. Novel flexible and biocompatible gold electrode arrays of high geometric precision are proposed to improve the boundary data quality in EIT. The flexible gold electrode arrays are developed on flexible FR4 sheets using thin film technology and practical gold electrode phantoms are developed with different configurations. Injecting a constant current to the phantom boundary the surface potentials are measured by a LabVIEW based data acquisition system and the resistivity images are reconstructed in EIDORS. Boundary data profile and the resistivity images obtained from the gold electrode phantoms are compared with identical phantoms developed with stainless steel electrodes. Surface profilometry, microscopy and the impedance spectroscopy show that the gold electrode arrays are smooth, geometrically precised and less resistive. Results show that the boundary data accuracy and image quality are improved with gold electrode arrays. Results show that the diametric resistivity plot (DRP), contrast to noise ratio (CNR), percentage of contrast recovery (PCR) and coefficient of contrast (COC) of reconstructed images are improved in gold electrode phantoms. (C) 2013 Elsevier Ltd. All rights reserved.

Supramolecular control of the magnetic anisotropy in two-dimensional high-spin Fe arrays at a metal interface

Magnetic atoms at surfaces are a rich model system for solid-state magnetic bits exhibiting either classical(1,2) or quantum(3,4) behaviour. Individual atoms, however, are difficult to arrange in regular patterns(1-5). Moreover, their magnetic properties are dominated by interaction with the substrate, which, as in the case of Kondo systems, often leads to a decrease or quench of their local magnetic moment(6,7). Here, we show that the supramolecular assembly of Fe and 1,4-benzenedicarboxylic acid molecules on a Cu surface results in ordered arrays of high-spin mononuclear Fe centres on a 1.5nm square grid. Lateral coordination with the molecular ligands yields unsaturated yet stable coordination bonds, which enable chemical modification of the electronic and magnetic properties of the Fe atoms independently from the substrate. The easy magnetization direction of the Fe centres can be switched by oxygen adsorption, thus opening a way to control the magnetic anisotropy in supramolecular layers akin to that used in metallic thin films.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

A Design for Testability of Undetectable Crosspoint Faults in Programmable Logic Arrays

In this paper, the validity of'single fault assumption in deriving diagnostic test sets is examined with respect to crosspoint faults in programmable logic arrays (PLA's). The control input procedure developed here can be used to convert PLA's having undetectable crosspoint faults to crosspoint-irredundant PLA's for testing purposes. All crosspoints will be testable in crosspoint-irredundant PLA's. The control inputs are used as extra variables during testing. They are maintained at logic I during normal operation. A useful heuristic for obtaining a near-minimal number of control inputs is suggested. Expressions for calculating bounds on the number of control inputs have also been obtained.

Generation of optimum random pinhole arrays for multiple imaging

Through an analysis using the transfer function of a pinhole camera, the multiple imaging characteristics of photographic diffusers described by Grover and Tremblay [Appl. Opt.21,4500(1982)] is studied. It is found that only one pinhole diameter satisfies the optimum imaging condition for best contrast transfer at any desired spatial frequency. A simple method of generating random pinhole arrays with a controlled pinhole diameter is described. These pinhole arrays are later used to generate high frequency sinusoidal gratings from a coarse grid. The contrast in the final gratings is found to be reasonably high.

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.

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.

GEODERM: geometric shape design system using an entity-relationship model

GEODERM, a microcomputer-based solid modeller, which incorporates the parametric object model, is discussed. The entity-relationship model, which is used to describe the conceptual schema of the geometric database, is also presented. Three of the four modules of GEODERM, which have been implemented are described in some detail. They are the Solid Definition Language (SDL), the Solid Manipulation Language (SML) and the User-System Interface.

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.

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.

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.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.