In this paper, we give a new approach to the computation of primary decomposition and associated prime components of a zero-dimensional polynomial ideal (f1,f2,. . . ,fn), where fi are multivariate polynomials on Z (the ring of integer). Over the past several years, a considerable number of studies have been made on the computation of primary decomposition of a zero-dimensional polynomial ideal. Many algorithms to compute primary decomposition are proposed. Most of the algorithms recently proposed are based on Groebner basis. However, the computation of Groebner basis can be very expensive to perform. Some computations are even impossible because of the physical limitation of memory in a computer. On the other hand, recent advance in numerical methods such as homotopy method made access to the zeros of a polynomial system relatively easy. Hence, instead of Groebner basis, we use the zeros of a given ideal to compute primary decomposition and associated prime components. More specifically, given a zero-dimensional ideal, we use LLL reduction algorithm by Lenstra et al. to determine the integer coefficients of irreducible polynomials in the ideal. It is shown that primary decomposition and associated prime components of the ideal can be computed, provided the zeros of the ideal are computed with enough accuracy. A numerical experiment is given to show effectiveness of our algorithm.

A new type of fiber Fabry-Perot interferometer buried in a fiber connector housing was proposed. The transmission spectra revealed double peaks due to birefringence in the fiber and the peak separation showed a temperature dependence as large as -7. 7 MHz/deg, which was 2 orders of magnitude larger than that estimated from the thermal characteristics of its component materials.

In this paper, we propose a technique to synthesize a hardware circuit from a protocol specification consisting of several concurrent EFSMs with multi-rendezvous specified among their subsets. In our class, each multi-rendezvous can be specified among more than two EFSMs, and several multi-rendezvous can be specified for different combinations of EFSMs. In the proposed technique, using the information such as current states of EFSMs, input values at external gates and guard expressions, we compose a circuit to evaluate whether each multi-rendezvous can be executed. If several exclusive multi-rendezvous get executable simultaneously for some combinations of EFSMs, we select one of them according to the priority order given in advance. We compose such a circuit as a combinational logic circuit so that it works fast. By applying our technique to Abracadabra protocol specified in LOTOS, it is confirmed that the derived circuit handles multi-rendezvous efficiently.

Silva et al. has suggested a criterion based on incidence matrix to verify if a given extended free choice net has a live and bounded marking. This paper shows that this criterion is a necessary and sufficient condition that a given net is a state machine allocatable (SMA) net. This result gives a polynomial algorithm to verify SMA net.

Degradation of ferroelectricity in PZT (Pb(Zr0. 52, Ti0. 48)O3) thin-film capacitors caused by heat treatment in a reductive ambience is investigated. We have found that the degradation of ferroelectricity depends upon the metal used for the top electrode of the PZT capacitor. The increased degradation in the case of a PZT capacitor with Pt electrodes can be explained by a catalytic reaction on the Pt surface. With the use of an IrO2 non-catalytic top electrode, we have made the ferroelectricity of an IrO2/PZT/Pt capacitor retained even after the H2 annealing at 400, or above.

In this paper we consider a parallel and distributed computation of genetic algorithms on loosely-coupled multiprocessor systems. Loosely-coupled ones are more suitable for massively parallel processing and also more easily VLSI implementation than tightly-coupled ones. However, communication overhead on parallel processing is more serious for loosely-coupled ones. We propose in this paper a parallel and distributed execution method of genetic algorithm on loosely-coupled multiprocessor systems of fixed network topologies in which each processor element carries out genetic operations on its own chromosome set and communicates with only the neighbors in order to save communication overhead. We evaluate the proposed method on the multiprocessor systems with ring, torus, and hypercube topologies for benchmark problem instances. From the results, we find that the ring topology is more suitable for the proposed parallel and distributed execution since variety of chromosomes in the ring is kept much more than that in the others. Moreover, we also propose a new network topology called cone which is a hierarchical connection of ring topologies. We show its effectiveness by experimental evaluation.

The metal/ferroelectric material/metal/oxide insulating material/Si substrates (MFMIS) structure was realized by using Pb(Zr0. 4Ti0. 6)O3 (PZT) thin film. PZT(330 nm thick) thin film was sandwiched between the upper electrode of Ti/Pt-Rh (about 380 nm thick and 123 microns in diameter) and the lower electrode of Pt-Rh/Ti (about 380 nm thick and 378 microns in diameter). The MFM structures mentioned above were prepared on metal oxide semiconductor (MOS structures). Pt-Rh and Ti lower electrodes were directly deposited on a poly-Si MOS electrode with sputtering, and PZT layer was prepared using the sol-gel method. In order to maximize induced charge density in the MOS gate, diameters of the upper and the lower electrodes were adjusted, and the MFM area-to-MOS area ratio was optimized. By using the area ratio of 0. 11 a memory window of 2. 4 V was obtained.

The post-annealing process has been investigated for (Ba, Sr)TiO3 [BST] thin films employed as a capacitor dielectric in 1 Gbit dynamic random access memories (DRAMs). The effects of post-annealing on morphology, crystallinity, and dielectric properties were examined for thin film capacitors with BST prepared on Pt electrodes by liquid source chemical vapor deposition (CVD). The direct annealing of BST capacitors caused a roughening in surface morphology of the upper Pt electrodes and BST films. However, the post-annealing of capacitors with a silicon dioxide passivation layer was found to cause little change in surface morphology of Pt and BST, and also no significant deterioration in leakage current. The improvement in crystallinity of BST films through post-annealing was confirmed at a temperature in the range 700-850 by X-ray diffraction (XRD) and transmission electron microscope (TEM). Moreover, the post-annealing experiments for BST films with different compositions showed that the post-annealing greatly increases the dielectric constant of BST films having approximately stoichiometric composition. The leakage and breakdown properties of BST films were also examined, indicating that excess Ti ions result in an increase of the turn-on voltage and the breakdown time. Based on these investigations, the electrical properties of dielectric constant ε 260, equivalent silicon dioxide thickness teq 0. 44 nm, and leakage current JL110-7 A/cm2 at 1. 9 V were successfully obtained for stoichiometric 30-nm-thick BST films post-annealed at 750. Hence, it can be concluded that the post-annealing is a promising technique to enhance the applicability of CVD-deposited BST films with conformal coverage to memory cell capacitors of 1 Gbit DRAMs.

A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet Nw. This result is based on the decomposition of a given net (N, Mo) with Md and the concepts of "no immature siphon at the reduced initial marking Mwo" and "no immature trap at the reduced end marking Mwd" on Nw which are both extended from "no token-free siphon at the initial marking Mo" and "no token-free trap at the end marking Md" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.

In this paper, we propose a new structure of the frequency domain adaptive filter (FDAF). The proposed structure is based on the modified DFT pair which consists of the FIR filters, so that un-delayed output signal can be obtained with stable convergence and without accumulated error which are problems for the conventional FDAFs. The convergence performance of the proposed FDAF is examined through the computer simulations in the adaptive line enhancer (ALE) comparing with the conventional FDAF and the DCT domain adaptive filter. Furthermore, in order to improve the error performance of the FDAF, we propose a composite algorithm which consists of the normalized step size algorithm for fast convergence and the variable step size one for small estimation error. The advantage of the proposed algorithm is also confirmed through simulations in the ALE. Finally, we propose a reduction method of the computational complexity of the proposed FDAF. The proposed method is to utilize a part of the FFT flow-graph, so that the computational complexity is reduced to O(N log N).

In B-ISDN, network reliability is a very significant theme. This paper proposes the Failure-Resistant Virtual Path (FRVP) scheme that prevents any information loss even with network failure, to realize a high-end reliability service in B-ISDN. The FRVP scheme is based on simple parallel transmission established using the superior characteristics of ATM. In the FRVP scheme, the transmitter duplicates user cells and transmits them across several VPs simultaneously. The receiver chooses the perfect cells and sends them to the user. As a result, the cell stream output by the receiver is not affected by VP failure if at least one VP remains active. I develop a prototype FRVP system and conduct field trials using NTT's nationwide ATM testbed network. The FRVP scheme is shown to achieve extremely-reliable ATM networks and services.

Sr0. 7Bi2. 3Ta2O9(SBT) films are drawing attention as fatigue-free materials. We prepared an SBT film containing discontinuous crystals in the Bi-layered compound using a misted deposition method. In comparison to films prepared by the spin-on method, leakage current was low and spontaneous polarization is high but saturation performance was low. The low saturation performance seems attributable to the inclusion of discontinuous crystals in the Bi-layered compound, while the low leakage current may be explained by the films smaller, denser particles, which form a film without voids, resulting in higher uniformity. The misted deposition method has advantages of finer grain size and higher uniformity.

A new numerical approach for the analysis of electromagnetic scattering from a body moving in an arbitrary direction is described. A time dependent grid generation is applied to solve these problems. We are treating this method for a quasi-stationary field. Some numerical results are compared with the exact ones and excellent agreement between them is obtained.

This paper presents a generation method of orthogonal spreading codes with different spreading factors (SFs), which are called orthogonal multi-SF spreading codes in this paper, for DS-CDMA mobile radio. The generated orthogonal multi-SF spreading codes have a tree structure and the codes are applied to the forward link such that all users, who transmit data at different rates, are orthogonalized. A group spreading modulator that simplifies the base station transmitter structure is also described. The transmission performance of the orthogonal multi-SF forward link under multi-user and frequency selective Rayleigh fading environments is evaluated by computer simulation to show that its performance is identical to that achieved by using multiple orthogonal spreading codes in parallel (orthogonal multicode forward link). Unlike the orthogonal multicode forward link, only a single Rake combiner is required at a mobile receiver which significantly simplifies the mobile receiver structure.

A maximal-ratio-combining (MRC) digital beamformer has been studied to attain open-loop and automatic self-beam steering towards both desired and multipath signals at the same time and diversity combining of the signals, which are made possible by spatial digital signal processing. This paper describes the performance of this beamformer under the multipath signal arrivals with various path delays using numerical simulation, aimed at application to future mobile radios with high spatial utilization efficiency. The results indicate the robustness of the MRC beamformer in a multipath environment. It features multidirectional beam steering when there is small path delay in the multipath signal and gain suppression in multipath signals when their path delay is more than about one symbol. Moreover, improvement in suppression by employing low-sidelobe amplitude distribution is discussed as a means to reduce inter-symbol interference without null-beam steering.

RZ signal transmission in an anomalous region with periodic dispersion compensation is examined by a straight-line experiment in terms of the compensation ratio, the signal power, and the pulse width. The optimum condition enables single-channel 20-Gbit/s RZ signal and two-WDM-channel 20-Gbit/s signals (40-Gbit/s in total) to be transmitted over 5,520 km and 2,160 km, respectively. Numerical simulations with the assistance of a basic theory enables analysis of the experimental results. It is shown that the balance between the waveform distortion and the remaining Gordon-Haus jitter determines the optimum conditions to achieve the longest transmission distance. Excess dispersion compensation results in waveform distortion, while insufficient compensation causes a greater amount of remaining jitter. Moreover, spectrum deformation during propagation is experimentally and numerically clarified to have a large effect on the transmission performance, especially for WDM transmission.

The umbrella cell system, where the same radio system is used for microcells and overlaying macrocells, is a promising strategy for deploying microcell service to cope with the locally increased radio traffic. The interference at microcells due to macrocells can be compensated by increasing the transmit power of microcell. In this paper, a practical method to implementing a microcell system overlaid with an existing macrocell system is proposed. In order to engineer the radio resource planning for the underlaid microcells, transmit power design and application of Channel Segregation, a self-organized dynamic channel assignment, are proposed. By these techniques, the system channels are reused automatically while minimizing interference between macrocell and microcell systems, thereby communication quality of umbrella cell system can be improved. Furthermore, the prime advantage of the proposed method is that locally increased traffic is handled by the underlaid microcells without any extra effort for channel management.

Process algebras with name passing have been proposed for concurrent mobile processes. They can be suitable to describe dynamical changes of connections among processes. To describe mobile communication or mobile computing systems, however, it is necessary to consider locations at which processes run. We propose a description method to design mobile communication systems using a concurrent calculus in this paper. The concept of a field is introduced to model locality of communication. An extension of π-calculus with a field is proposed. The extension does not include locality represented by a field while most related works treat locality within their languages. A field is given when behavior of a target system is verified in a particular environment. The aim of the extension is to verify and to test connectivity between processes under various geographical constraints. This method could be design-oriented in this context. Equivalence relations with/without location in this calculus are also discussed.

In this work, a new algorithm for tracking the directions-of-arrival (DOA's) of moving targets by introducing a linear approximation is proposed. The targets are assumed to move with constant angular velocities within a short time and emitting continuously narrow-band signals that impinge on an array of sensors. Therefore the trajectories of targets can be approximated by linear functions of time, which consist of the DOA's and the angular velocities, within the short time. In the condition that the number of targets is known and the outputs vector of the sensors including the additive white complex Gaussian noises is observed continuously, a cost function which consists of the squared residual error vectors is defined. The estimation of the DOA's and the angular velocities of targets is performed by minimizing this cost function. By estimating both the DOA's and the angular velocities at the same time, the proposed algorithm is able to improve the tracking performance for rapidly moving targets. In computer simulations, the performance of the proposed algorithm is compared with the ESPRIT method, which is one of the typical subspace methods with super resolution.

This paper describes an automatic region segmentation method which is detectable nuclei regions from hematoxylin and eosin (HE)-stained breast tumor images using artificial organisms. In this model, the stained images are treated as virtual environments which consist of nuclei, interstitial tissue and background regions. The movement characteristics of each organism are controlled by the gene and the adaptive behavior of each organism is evaluated by calculating the similarities of the texture features before and after the movement. In the nuclei regions, the artificial organisms can survive, obtain energy and produce offspring. Organisms in other regions lose energy by the movement and die during searching. As a result, nuclei regions are detected by the collective behavior of artificial organisms. The method developed was applied to 9 cases of breast tumor images and detection of nuclei regions by the artificial organisms was successful in all cases. The proposed method has the following advantages: (1) the criteria of each organism's texture feature values (supervised values) for the evaluation of nuclei regions are decided automatically at the learning stage in every input image; (2) the proposed algorithm requires only the similarity ratio as the threshold value when each organism evaluates the environment; (3) this model can successfully detect the nuclei regions without affecting the variance of color tones in stained images which depends on the tissue condition and the degree of malignancy in each breast tumor case.