Self and mutual admittance of slot antennas on a dielectric half-space

In this paper, an efficient implementation of the spectral domain moment technique is presented for computing the self and mutual coupling between slot antennas on a dielectric half-space. It is demonstrated that by the proper selection of the weighting functions in the method of moments, the analytic evaluation or simplification of the transverse moment integrals is enabled. This results into a significant reduction of the required computational labor. The method is then utilized in order to provide design data for the self and mutual admittances between two slot antennas on a dielectric substrate lens in the case of fused quartz (∈ _r =3.80), crystal quartz (∈ _r =4.53), silicon (∈ _r =11.9) and GaAs (∈ _r =12.8). The presented technique and associated results are useful when designing twin slot quasi-optical receivers, imaging arrays, phased arrays or power-combining arrays of slot elements at millimeter-wave frequencies.     

Analysis of viscoelastic laminated composite plates

A micromechanics analysis is performed for the determination of the five independent elastic moduli of unidirectional fiber composites. By considering viscoelastic phases and by using the correspondence principle and the inversion of the Laplace transform, the five time-dependent functions which characterize the effective behavior of viscoelastic composites are established. The predicted time-dependent behavior is applied for the analysis of viscoelastic laminated plates. The resulting viscoelastic effects are shown, and comparison between the results obtained within the classical laminated plate theory and the first-order shear deformation theory is discussed.     

CD++: a toolkit to develop DEVS models

The features of a toolkit for modeling and simulation based on the DEVS formalism are presented. The tool is built as a set of independent software pieces running on different platforms. Not only are the main characteristics of the environment presented, a focus on its use is also considered by inclusion of application examples for a variety of problems. Many models can be defined in an automated fashion, simplifying the construction of new models and easing their verification. The use of this formal approach has allowed the development of safe and cost‐effective simulations, significantly reducing development time. Copyright © 2002 John Wiley & Sons, Ltd.     

Diversity of pituitary cells in primary cell culture. An immunocytochemical study

A bioassay system for rapid detection of carcinogenic agents has been developed using male Fischer 344 rats to bridge the gap between long-term carcinogenicity tests and short-term screening assays. The system, called the medium-term liver bioassay, is fundamentally based on the 2-stage hypothesis of tumor production, employing initiation by diethylnitrosamine (200 mg/kg, i.p.) in the first stage and test chemical administration during the second, in combination with two-thirds partial hepatectomy. It requires only 8 wk for animal experimentation and a further few weeks for quantitative analysis of immunohistochemically demonstrated glutathione S-transferase placental form positive hepatic foci. A total of 291 chemicals/substances have already been analyzed in our laboratory. Among 63 chemicals that were proved to be carcinogenic in the liver of rat and/or mouse, 57 (90%) gave positive results irrespective of their mutagenicity. Negative compounds include peroxisome proliferators and tamoxifen. Even nonhepatocarcinogens were positive at a rate of 24%. Eighty-six percent (12/14) of mouse liver carcinogens were also positive. On the other hand, only 2 out of 45 noncarcinogens showed very weak positivity. Thus, the efficacy of the system for hepatocarcinogens has been well established. This bioassay is increasingly regarded as an appropriate alternative test for carcinogenicity risk assessment and is practically used for a rapid evaluation of hepatocarcinogenicity of chemicals.     

Executing algorithms with hypercube topology on torusmulticomputers

Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact that the interconnection cost-per-node increases with the total number of nodes. From scalability point of view, meshes and toruses are more interesting classes of interconnection topologies. This paper focuses on the execution of algorithms with hypercube communication topology on multicomputers with mesh or torus interconnection topologies. The proposed approach is based on looking at different embeddings of hypercube graphs onto mesh or torus graphs. The paper concentrates on toruses since an already known embedding, which is called standard embedding, is optimal for meshes. In this paper, an embedding of hypercubes onto toruses of any given dimension is proposed. This novel embedding is called xor embedding. The paper presents a set of performance figures for both the standard and the xor embeddings and shows that the latter outperforms the former for any torus. In addition, it is proven that for a one-dimensional torus (a ring) the xor embedding is optimal in the sense that it minimizes the execution time of a class of parallel algorithms with hypercube topology. This class of algorithms is frequently found in real applications, such as FFT and some class of sorting algorithms     

A unified approach to superresolution and multichannel blind deconvolution.

This paper presents a new approach to the blind deconvolution and superresolution problem of multiple degraded low-resolution frames of the original scene. We do not assume any prior information about the shape of degradation blurs. The proposed approach consists of building a regularized energy function and minimizing it with respect to the original image and blurs, where regularization is carried out in both the image and blur domains. The image regularization based on variational principles maintains stable performance under severe noise corruption. The blur regularization guarantees consistency of the solution by exploiting differences among the acquired low-resolution images. Several experiments on synthetic and real data illustrate the robustness and utilization of the proposed technique in real applications.     

The Gilbert-Holland FDTD thin slot model revisited: an alternative expression for the in-cell capacitance

This paper proposes an alternative expression for the in-cell capacitance of a photoelectrical cell (PEC)-mounted slot, which is the conceptual cornerstone of the Gilbert-Holland subcell finite difference time domain (FDTD) model. By treating a slightly modified electrostatic problem, the extraneous charge singularity on the PEC edges touching the cell, which is characteristic of the originally proposed model, is removed. The latter offers better physical grounds for a new expression of the capacitance and the effective permittivity used in the update equations. High resolution standard FDTD simulation results are presented in support of the new expression.