Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

Tunneling spectroscopy of palladium-barium emitters

The surface of a palladium-barium cathode was studied using scanning probe microscopy techniques. Data from the tunneling spectroscopy showed the pattern of the electron work function distribution over a microscopic region on the emitter surface. This pattern is compared to the distribution of various phases in the palladium-barium alloy employed.     

Simple concepts for ion source improvement

We report on improvements in the overall intensity of a sputter ion source that evolved originally from an NEC MCSNICS. Beam output increases benefit both AMS measurements and nuclear physics experiments using low natural abundance beams. In particular, minor changes in source geometry suggested by a combination of electrostatic calculations and simple design principles have yielded increases in extracted negative ion intensity of nearly a factor of 4.     

Nanocell logic gates for molecular computing

Molecular electronics seeks to build electrical devices to implement computation - logic and memory - using individual or small collections of molecules. These devices have the potential to reduce device size and fabrication costs, by several orders of magnitude, relative to conventional CMOS. However, the construction of a practical molecular computer will require the molecular switches and their related interconnect technologies to behave as large-scale diverse logic, with input/output wires scaled to molecular dimensions. It is unclear whether it is necessary or even. possible to control the precise regular placement and interconnection of these diminutive molecular systems. This paper describes genetic algorithm-based simulations of molecular device structures in a nanocell where placement and connectivity of the internal molecular switches are not specifically directed and the internal topology is generally disordered. With some simplifying assumptions, these results show that it is possible to use easily fabricated nanocells as logic devices by setting the internal molecular switch states after the topological molecular assembly is complete. Simulated logic devices include an inverter, a NAND gate, an XOR gate and a 1-bit adder. Issues of defect and fault tolerance are addressed.     

Baseband Volterra filters for implementing carrier basednonlinearities

A diagonal coordinate representation for Volterra filters is developed and exploited to derive efficient Volterra filter implementations for processing carrier based input signals. In the diagonal coordinate representation, the output is expressed as a sum of linear filters applied to modified input signals. Hence, linear filtering methods are employed to implement the nonlinear filter on a baseband version of the input. Downsampling is then used to reduce computational complexity. The same approach is employed to develop efficient implementations for processing continuous-time carrier-based signals, pulse amplitude-modulated signals, and frequency division multiplexed input signals     

Random sequence multisets for synchronous code-divisionmultiple-access channels

The effect of using randomly selected sequence multisets for the uplink of a synchronous code-division multiple-access channel is considered. A tight lower bound on the expected value of the sum capacity over the ensemble of randomly selected sequence multisets is given. For large systems, the sum rate penalty for using randomly selected multisets is shown to be at most 1 nat and to vanish as the number of users becomes large, compared to the sequence length     

Mathematical analysis of dynamic channel selection in indoor mobilewireless communication systems

Dynamic channel selection (DCS) is an algorithm for flexible resource sharing in mobile radio systems. The digital enhanced cordless telecommunications (DECT) standard implements a version of DCS based on time as well as frequency multiplexing. In this paper, mathematical models are developed to evaluate the probabilities of channel availability, desired carrier power, and the carrier-to-interference ratio (CIR) for a constant traffic load. These results can be used to compute the call setup blocking probability. The models reported in this study are based on a decentralized DCS according to the DECT standard specifications. The results show that blocking due to availability of a channel (resource blocking), not interference blocking, generally is the most important factor in overall call blocking. Furthermore, it is seen that resource blocking is sensitive to the implementation of portable sets. Also, with homogeneous static traffic, this type of DCS ran be as good as fixed channel allocation (FCA) with respect to resource blocking     

Two-dimensional singular vector elements for finite-elementanalysis

The finite-element method (FEM) exhibits a reduced convergence rate when used for the analysis of geometries containing sharp edges where the electromagnetic field is singular. The convergence of the method can be-improved by introducing singular elements that model analytically predicted singular behavior. A number of authors have developed singular elements that are compatible with the scalar FEM. In this paper, we propose a new singular element that is compatible with edge-based vector finite elements and can cope with any order of singularity while preserving the sparsity of the FEM equations. Edge-based singular elements more correctly model singular fields and thus require fewer unknowns, while avoiding the introduction of spurious modes in the numerical solution. Numerical results verify that the convergence of the FEM is significantly improved