Signal processing antennas have been studied not only for interference suppression but also for high-resolution estimation of radio environment such as directions-of-arrival of incident signals. These two applications are based on the common technique, that is, null steering. This tutorial paper reviews the MUSIC algorithm which is one of the typical high-resolution techniques. Examining the eigenvector beam patterns, we demonstrate that the high-resolution capability is realized by steering nulls. The considerations will be useful for understanding the high-resolution techniques in the signal processing antennas. We then describe a modified version of MUSIC (Root MUSIC). We show the performance and robustness of the method. Furthermore, we introduce radar target identification and two-dimensional radar target imaging. These study fields are new applications of the signal processing antennas, to which a great deal of attention has been devoted recently.

The MUSIC algorithm has proven to be an effective means of estimating parameters of multiple incoherent signals. Furthermore, the forward-backward (FB) spatial smoothing technique has been considered the best preprocessing method to decorrelate coherent signals. In this paper, we propose a novel preprocessing technique based upon ideas associated with the FB and adaptive spatial smoothing techniques and report on its superiority in numerical simulations.

This paper describes a new intelligent computer assisted instruction (ICAI) system for Japanese beginners to learn Korean composition. This system is supported by speech synthesis which is generated by a new method for arbitrary sentences of Japanese and Korean using the natural speech data-base.

We demonstrate a feasibility of a Beam Space CMA (Constant Modulus Algorithm) Adaptive array antenna by implementing a Digital Signal Processor (DSP) in ASICs using field programmable gate arrays (FPGA). The DSP can synthesize 16 multibeams and eliminate interference signals by CMA adaptive processing. The whole function was implemented in about 127,000 equivalent gates. Simple experimental results in a radio anechoic chamber have confirmed the basic function of BSCMA adaptive array antenna.

In this paper, a pushdown automaton, with an infinite set of states as a partially ordered set (poset), is formulated, and its control problem of whether a given configuration can be transferred to another is discussed. For the controllability to be decidable, we take a condition the poset satisfies, that is, a condition that there are only finite number of states under the partial ordering between two given states. The control problem is decidable in polynomial time on condition the length of each pushed stack string is bounded by a constant in a given pushdown automaton. The motivation of considering the control problem comes up from the stack structure in implementing the SLD resolution deductions, in which the leftmost atom in each goal is selected and unified with some procedure name (that is, some head) of a definite clause, with the effect of the procedure name being replaced by the procedure bodies and unifications. Thus, the control problem is applied to describe the SLD resolution deductions of finite steps, by constructing a pushdown automaton model for a set of definite clauses, in which leftmost selection of atom in each goal forms a stack structure and substitutions affecting goals are interpreted as states. When constructing a pushdown automaton model for an SLD resolution deduction, algebraic properties of the idempotent substitution set, which are used in unifications, are examined and utilized. The quotient set of the idempotent substitution set per renamings is adopted to present the automaton model.

Simplification of the Viterbi algorithm and the error rate performance are presented for a partial response maximum-likelihood (PRML) system employing the PR(1, 1) system as a PR system for (1, 7) run-length limited (RLL) code. The minimum run-length of 1's or O's in the output sequence of the precoder for (1, 7) RLL code is limited to 2. Two kinds of simplified Viterbi algorithms using this run-length constraint are proposed. One algorithm requires the path memory length of only two in the Viterbi detector. The Viterbi detector based on the other algorithm is equivalent to the simple PR(1, 1) system followed by a threshold detector. The bit-error rates of PRML systems with Viterbi detectors based on these algorithms are obtained by computer simulation and their performance is compared with that of conventional PRML systems for (1, 7) RLL code. It is shown that the proposed PRML system exhibits better performance than conventional PRML systems at high recording density.

The ultraclean sputtering process (UC-process) was newly introduced in the fabrication of Co62.5Ni30Cr7.5 and Co85.5Cr10.5Ta4 thin film media to establish a new concept in controlling microstructure. UC-process enables the realization of high coercive force Hc up to 2.7-3 kOe in both CoNiCr and CoCrTa media (15/50 nm magnetic/Cr thicknesses) without the decrement of saturation magnetization. The purification of the atmosphere during sputtering and the removal of the adsorbed oxygen impurity on the substrate surface play important roles in obtaining high Hc by applying the UC-process. This high Hc is mainly due to the realization of large magnetocrystalline anisotropy field of grains Hkgrain and low intergranular exchange coupling. UC-process realizes the adequate separation of grains by segregated grain boundaries even in media with thin Cr thickness of 2.5 nm, and enables grain size reduction without the remarkable increment in intergranular exchange coupling. In these media, the reduction of the grain size is most effective for the improvement of readback signal to media noise ratio S/Nm. In the media with grains sufficiently separated by segregated grain boundaries fabricated by the UC-process, control of grain size reduction and further increase in Hc/Hkgrain value through the decrement in intergranular magnetostatic coupling are required to obtain higher S/Nm value.

Conventional subband ADF's (adaptive digital filters) using filter banks have shown a degradation in performance because of the non-ideal nature of filters. To solve this problem, we propose a new type of subband ADF incorporating two types of analysis filter bank. In this paper, we show that we can design the optimum filter bank which minimizes the LMSE (least mean squared error). In other words, we can design a subband ADF with less MSE than that of conventional subband ADF's.

When signal subspace techniques, such as MuSIC, are used to locate a number of incident signals, an exhaustive search of the array manifold has to be carried out. This search involves the evaluation of a single cost function at a number of points which form a grid, resulting in quantization-error effects. In this paper a new algorithm is put forward to overcome the quantization problem. The algorithm uses a number of cost functions, and stages, equal to the number of incident signals. At each stage a new cost function is evaluated in a small number of "special" directions, known as characteristic points. For an N-element array the characteristic points, which can be pre-calculated from the array manifold curvatures, partition the array manifold into N-1 regions. By using a simple gradient algorithm, only a small area of one of these regions is searched at each stage, demonstrating the potential benefits of the proposed approach.

This paper proposes a distributed built-in self-test (BIST) technique and its test design platform for VLSIs. This BIST has lower hardware overhead pattern generators, compressors and controller. The platform cuts down on the number of complicated operations needed for the BIST insertion and evaluation, so the BIST implementation turn-around-time (TAT) is dramatically reduced. Experimental results for the 110 k-gate arithmetic execution blocks of an image-processing LSI show that using this BIST structure and platform enables the entire BIST implementation within five days. The implemented BIST has a 1% hardware overhead and 96% fault coverage. This platform will significantly reduce testing costs for time-to-market and mass-produced LSIs.

Flora is a functional-style language for object and relational algebra. It has been designed for efficient support of advanced database languages combining rules and objects using compilation and optimization. Flora is a strongly typed language based on an OO data model and incorporating support for collection-oriented computational capabilities. In this paper, we describe the design and architecture of the Flora optimizer which is rule-based, yet doing cost-based optimization. The optimizer uniformly captures logical, semantic and implementation knowledge regarding the execution system and the applications by means of assertions. This framework eases extensibility and enables efficient query rewriting.

As the Hypertext Transfer Protocol (HTTP) becomes more popular for network communication, network loads in areas with less developed network infrastructures will be an increasing problem. This paper presents a system which extends a WWW-server with a gateway to an RDBMS and a mail program, allowing for interactive query formulation together with return of potentially large query results by e-mail. These results can then be downloaded by the user when network loads are low.

This paper describes the architecture and storage structure of a new interactive multimedia information system called VideoReality. VideoReality is based on a visual conducting model, which describes the information retrieval process that occurs when people observe visible objects in the real world. VideoReality provides a spatial and temporal spread of a virtual video space from a set of stored video streams. The video space has a three-layered structure similar to that of the ANSI/X3/SPARC three-schema architecture. Users can move their eyes and watch objects freely in the video space, just as if they were viewing the real world. This paper also presents a prototype application system called Electronic Aquarium'

In order to make the hyperling generation mechanism not only dynamic but also systematic, we will mainly describe the use of the querying and abstraction facilities in hypertext database systems. Our work focuses on a dynamic, abstract and systematic link generation mechanism. The prototype system named TextLink/Gem is implemented by taking an object-oriented approach, and the notions of anchor objects, query-pair links, polymorphic links and inheritable links, on which the system is based, and their implementations are described in detail.

Documents stored in a database system can have complex internal structure described by languages such as SGML. How to take advantage of this structure presents challenges for database system implementors. We classify the types of queries that need to be supported by SGML-conformant database systems. We then describe several data models that have been proposed for representing documents in a database system and discuss the support these models provide for SGML. Finally we consider query evaluation.

The evolution of heterogeneous and autonomous databases research has been slow compared to other areas of research. Part of the problem resides in the fact that bridging data semantics has been a difficult problem. Sharing data among disparate databases has mostly been achieved through some form of manual schema integration. The complexity of making autonomous heterogeneous databases smoothly interoperate is dependent on addressing two major issues. The first issue to address is what adequate levels of autonomy databases are guaranteed to keep. The second issue to address is what overhead cost is required to bridge database heterogeneity. The complexity of these two issues are closely dependent on how scalable multidatabase systems are. In this paper we introduce the FINDIT architecture which uses information meta-types to provide a basis for such an organization and, consequently, provides a platform for inter-operability. A distinction is made between the information and inter-node relationship spaces to achieve scalability. Tassili language primitives are used for the incremental building of dynamic inter-node relationships based upon usage considerations.

Our objective is to resolve three types of heterogeneity - data model,database system, and semantic - in heterogeneous databases. The basic framework which we propose for this objective is realized in an autonomous decentralized database system (i.e., an interoperable database system), called Jasmine/M. Users describe their relational or object-oriented data models and schemas locally using the model primitives which Jasmine/M provides as a scripting language. Description using such primitives or scripts constitutes viewports, which have a role to resolve heterogeneity in data models and database systems at local sites. At relational viewports, both relational and object-oriented schemas defined at other sites are translated via scripts and are viewed as relational schemas. Similarly at object-oriented viewports, any schema defined at other sites is viewed object-oriented schemas. Relational and object-oriented views are used to resolve semantic heterogeneity within viewports. This paper describes a step wise approach to resolving the three types of heterogeneity, using scripts, viewports, and views, and its implementation using active objects.

Tilt margins for disk and lens for a magneto-optical (MO) head were studied for designing a disk system for use with objective lenses having numerical apertures (NA) of 0.55, 0.60, and 0.65. The tilt margins were examined to determine the aberration characteristics of objective lenses and bit error rate (BER) by recording and reproducing signal. In preparing the optical head for testing disk and lens tilt margins, the aberrations were measured by image processing from the CCD area sensor for the spot image of the focused beam, and BER dependencies on the tilting of lens and disk were obtained at the velocity of the outer diameter of the MO disk at the bit rate of 80-Mbps (1, 7 code modulation) recording. According to the aberration and BER characteristics, the limitation for effective wavefront aberration would be 0.05λ rms, the tilt margins corresponded to BER limitation at the level of 3*10-5. The disk margins for NA=0.55, 0.6, and 0.65 were 0.4, 0.2, and 0.1 degrees. The lens tilt margins for NA=0.55, 0.6, and 0.65 were 0.2, 0.1, and 0.05 degrees.

A two-dimensional recording method that achieves double recording density by reducing the track pitch is described. This method uses a flat disk and the data are recorded with circular marks on lattice points. Two-dimensional interference consisting of crosstalk and inter-symbol interference is reduced by two-dimensional equalization. To minimize the two-dimensional interference, the optimum equalization coefficients are calculated dynamically with the reproduced signal of the training marks. Reproduction was simulated and this showed that the signal-to-noise ratio of the processed signal was 24.3 dB under ideal conditions and 19.8 dB under worst-case conditions with the usual magneto-optical media using double recording density. These simulation results were checked by a recording/reproduction experiment. The experimental result for the signal-to-noise ratio of the processed signal was 23.6 dB with an areal density of 2.3 Gbit/in2.

The interstitial hyperthermia is an invasive heating method applied by inserting the applicator into the human body. We have been studying on coaxial-slot antennas for interstitial microwave hyperthermia. The characteristics of the square antenna array were theoretically examined. Firstly, the basic structure of the antenna, and a simplified analysis model taking account of the effect of the boundary surface were explained. Then analysis was performed by using the moment method. Finally, the calculated results were discussed. The catheter thickness has much effect on the characteristics and must be considered both in designing and in using the antenna. When the array spacing was increased, the effective heating area became larger and more uniform. As the insertion depth was increased, the effective heating area was also enlarged.