<Emphasis Type="Italic">FCC/BCC</Emphasis> competition and enhancement of saturation magnetization in nanocrystalline Co-Ni-Fe films

The structure, chemical composition, and magnetic properties of electrochemically deposited nanocrystalline Co-Ni-Fe films were investigated using a number of techniques. A high saturation magnetic induction up to B _s = 21 kG was attained. An enhancement of the saturation magnetization compared to the ideal anticipated one was revealed, which correlated with the nonlinear behavior of the structural phase composition and lattice parameters with the change of the composition. The text was submitted by the authors in English.     

Unified Systolic-Like Architecture for DCT and DST Using Distributed Arithmetic

A common computing-core representation of the discrete cosine transform and discrete sine transform is derived and a reduced-complexity algorithm is developed for computation of the proposed computing-core. A parallel architecture based on the principle of distributed arithmetic is designed further for the computation of these transforms using the common-core algorithm. The proposed scheme not only leads to a systolic-like regular and modular hardware for computing these transforms, but also offers significant improvement in area-time efficiency over the existing structures. The structure proposed here is devoid of complicated input/output mapping and does not involve any complex control. Unlike the convolution-based structures, it does not restrict the transform length to be a prime or multiple of prime and can be utilized as a reusable core for cost-effective, memory-efficient, high-throughput implementation of either of these transforms     

Synthesis of an isotropic reradiator for suppression of TE-polarized wave scattering by a perfectly conducting cylinder

The problem of synthesis of an isotropic reradiator providing for the transparency of a circular perfectly conducting cylinder illuminated by a TE-polarized plane wave is investigated. A general solution to the problem of diffraction from the cylinder with a reradiator is obtained, and a system of nonlinear equations for the synthesis problem is derived. Numerical solution of the synthesis problem is illustrated by a number of examples.     

An optically clocked transistor array with dual serial-to-parallel and parallel-to-serial conversion capability for optical label swapping

We propose an optically clocked transistor array optoelectronic integrated circuit (OEIC) for both serial-to-parallel and parallel-to-serial conversion (demux/mux), enabling an interface between high-speed asynchronous burst optical labels and CMOS circuitry for optical label swapping. Dual functionality of the OEIC reduces size, power, and cost of the optical label swapper. The capability for greater than 20-Gb/s conversion operation is demonstrated.     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

Sequential testing of sorted and transformed data as an efficient way to implement long GLRTs

It is often required to detect a long weak signal in Gaussian noise, and frequently, the exact form of that signal is parameterized but not known. A bank of matched filters provides an appropriate detector. However, in some practical applications, there are very many matched filters, and most are quite long. The consequent computational needs may render the classical bank-of-filters approach infeasibly expensive. One example, and our original motivation, is the detection of chirp gravitational waves by an Earth-based interferometer. In this paper, we provide a computational approach to this problem via sequential testing. Since the sequential tests to be used are not for constant signals, we develop the theory in terms of average sample number (ASN) for this case. Specifically, we propose two easily calculable expressions for the ASN: one a bound and the other an approximation. The sequential approach does yield moderate computational savings, but we find that by preprocessing the data using short/medium fast Fourier transforms (FFTs) and an appropriate sorting of these FFT outputs such that the most informative samples are entered to a sequential test first, quite high numerical efficiency can be realized. The idea is simple but appears to be quite successful: Examples are presented in which the computational load is reduced by several orders of magnitude. The FFT is an example of an energy-agglomerating transform, but of course, there are many others. The point here is that the transform need not match the sought signal exactly in the sense that all energy becomes confined to a single sample; it is enough that the energy becomes concentrated, and the more concentrated the better.     

A decision support system for interactive decision making - Part II: analysis and output interpretation

For pt.I see ibid., p.42-55 (2003). The development of a comprehensive decision support system, GMCR II, for the systematic study of real-world interactive decision problems is presented. The companion paper (Part I), discusses how GMCR II elicits, stores, and manages conflict models; here (Part II), the focus is on GMCR IIs analysis and output interpretation subsystems. Specifically, this paper describes the powerful and efficient analysis engine contained in GMCR II, its informative output presentation and interpretation facilities, and a number of follow-up analyses. Furthermore, an illustrative case study is used to demonstrate how GMCR II can be conveniently applied in practice.     

Full-diversity, high-rate space-time block codes from division algebras

We present some general techniques for constructing full-rank, minimal-delay, rate at least one space-time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field /spl Qopf/ embedded in matrix rings. The first half of the paper deals with constructions using field extensions of /spl Qopf/. Working with cyclotomic field extensions, we construct several families of STBCs over a wide range of signal sets that are of full rank, minimal delay, and rate at least one appropriate for any number of transmit antennas. We study the coding gain and capacity of these codes. Using transcendental extensions we construct arbitrary rate codes that are full rank for arbitrary number of antennas. We also present a method of constructing STBCs using noncyclotomic field extensions. In the later half of the paper, we discuss two ways of embedding noncommutative division algebras into matrices: left regular representation, and representation over maximal cyclic subfields. The 4/spl times/4 real orthogonal design is obtained by the left regular representation of quaternions. Alamouti's (1998) code is just a special case of the construction using representation over maximal cyclic subfields and we observe certain algebraic uniqueness characteristics of it. Also, we discuss a general principle for constructing cyclic division algebras using the nth root of a transcendental element and study the capacity of the STBCs obtained from this construction. Another family of cyclic division algebras discovered by Brauer (1933) is discussed and several examples of STBCs derived from each of these constructions are presented.     

A fuzzy logic based-method for prognostic decision making in breast and prostate cancers

Accurate and reliable decision making in oncological prognosis can help in the planning of suitable surgery and therapy, and generally, improve patient management through the different stages of the disease. In recent years, several prognostic markers have been used as indicators of disease progression in oncology. However, the rapid increase in the discovery of novel prognostic markers resulting from the development in medical technology, has dictated the need for developing reliable methods for extracting clinically significant markers where complex and nonlinear interactions between these markers naturally exist. The aim of this paper is to investigate the fuzzy k-nearest neighbor (FK-NN) classifier as a fuzzy logic method that provides a certainty degree for prognostic decision and assessment of the markers, and to compare it with: 1) logistic regression as a statistical method and 2) multilayer feedforward backpropagation neural networks an artificial neural-network tool, the latter two techniques having been widely used for oncological prognosis. In order to achieve this aim, breast and prostate cancer data sets are considered as benchmarks for this analysis. The overall results obtained indicate that the FK-NN-based method yields the highest predictive accuracy, and that it has produced a more reliable prognostic marker model than both the statistical and artificial neural-network-based methods.