To evaluate DRAM memory-cell data retention characteristics, measuring the leakage current of the individual memory-cell is important. However, the leakage current of a DRAM memory-cell cannot be measured directly, because its value is on the order of femtoamperes. This paper describes a Plate Bumping (PB) method that can measure the leakage current of a specific memory-cell using the relationship between the shifted value of memory-cell-plate potential and the retention period. By using the PB method, it can be confirmed that the leakage current of the short-retention cell (bad cell) depends on its storage-node potential. With regards to cells with "0" data stored in them ("0" cells), it appears that the relaxed junction biasing (RJB) scheme which can extend refresh interval increases the number of misread "0" cells due to the lowering of the sense amplifier's sensing threshold.

This paper reports on a high-speed silicon bipolar transistor with an fT and fMAX of over 40 GHz, we call it the Advanced Boro-silicated-glass Self-Aligned (A-BSA) transistor. In basic BSA technology, a CVD-BSG film is used not only as a diffusion source to form the intrinsic base and the link base regions but also as a sidewall spacer between the emitter and the base polysilicon electrodes. An A-BSA transistor offers three advancements to this technology: (1) a graded collector profile underneath the intrinsic base region to suppress the Kirk effect; (2) an optimized design of the link base region to prevent the frade-off effect between fT and base resistance; and (3) a newly developed buried emitter electrode structure, consisting of an N++-polysilicon layer, a platinum silicide layer, and a CVD tungsten plug, to prevent the emitter plug effect. Furthermore, our transistor uses a BPSG filled trench isolation to reduce parasitic capacitance and improve circuit performance. In this paper, we describe device design, process technology and characterization of the A-BSA transistor, with it we have performed several application ICs, operating at 10Gb/s and above. The A-BSA transistor achieved an fT of 41 GHz and an fMAX of 44 GHz under optimized conditions.

In this paper, we consider the protein structure alignment problem, which is a very important problem in molecular biology. Since an outline of protein structure is represented by a sequence of points in three-dimensional space, this problem is defined as the following geometric pattern matching problem: given two point sequences P and Q in three-dimensions and a real number δ > 0, find a maximum-cardinality set of point pairs such that the distance between each pair is at most δ under the condition that any translation and rotation can be applied to P. Since it is very difficult to solve this problem exactly, we consider algorithms that solve it approximately. We propose three algorithms: BASICALIGN, RANDALIGN and FRAGALIGN whose worst case time complexities are O(n8), O((n7/k3) polylog(n)) and O(n4) respectively, where n denotes the size of larger input structure and k denotes the minimum size of the alignment to be obtained. All of these have the following common framework: a series of initial superpositions are computed; for each of such superpositions, a rough alignment is first computed using a dynamic programming technique, and then it is refined through an iterative improvement procedure which also uses dynamic programming; the best alignment among them is selected as an output. The difference among three algorithms lies in the methods of finding initial superpositions. BASICALIGN, RANDALIGN and FRAGALIGN use exhaustive search, random sampling technique and fragment-based search, respectively. We prove guaranteed approximation ratios (in the sense of distances between point pairs) for theoretical versions of BASICALIGN and RANDALIGN. Practical versions of RANDALIGN and FRAGALIGN were implemented and compared with a previous algorithm using real protein structure data. The experimental results show that FRAGALIGN is best among them and it outputs good alignments quickly.

The quality of a modular software system depends on the reliabilities of the software modules and the software operational profile. When the software is designed for multiple customers having different operational profiles, different customers may experience different software quality. It is important to ensure that no customer will suffer from a poor software quality. In this paper, we formulate and solve three reliability allocation problems for modular software system designed for multiple customers. In these reliability allocation problems, we consider the software operational profile of every customer while fulfilling such practical constraints as cost budget and software quality requirement. The numerical results show that when the operational profiles of the customers are more skewed, it is more beneficial to take their operational profiles into account.

A systematic procedure to configure faulttolerant systolic arrays based on Triplicated Triple Modular Redundancy is proposed. The design procedure consists of the triplication of the dependence graph which is formed from a target regular algorithm and the transformation onto physical time-processor domain. The resultant systolic arrays tolerate failures not only on processing elements but also on communication links. While it needs sophisticated connection scheme between processing elements to guarantee the fault-tolerance on communication links, the link complexity is possibly reduced by optimizing redundant operation scheme. Unconstrained and constrained link minimization problems are introduced, and the possibility and the constraints required for link complexity reduction are investigated.

A requirement specification acquisition method combined with hypothesis-based reasoning and model reasoning is proposed for obtaining service specifications from the ambiguous and/or incomplete requirement specifications of communications services. Errors at an early stage of software development cost more to debug than those at a later stage. Specification acquisition is the most upstream development process. Nevertheless, the system support for specification acquisition is delayed compared with other development phases.' Users do not always have precise requirements. It is therefore inevitable that user requirements contain ambiguities, insufficiencies and even contradictions. Considering this, it is indispensable to support a specification completion method that derives service specifications from such problem requirements. This paper proposes a combined method to obtain consistent and complete specifications from such problem requirements. Communications service specifications can be described by specifying terminal behaviors which can be recognized from outside the communications system(s). Such specifications are described by a rule-based language. Requirement specifications usually have components that are ambiguous, incomplete, or even contradictory. They appear as rule description and/or missing rules. From such requirements, service specifications are obtained by using hypothesis-based reasoning on input requirements and existing service specifications. When existing specifications cannot be used to obtain complementary specifications, a communications service model is used to propose new rules. The proposed methods are implemented as a part of a communications software development system. The system enables non-experts in communications systems to define their own service specifications.

The paper discusses the possibility of building semiconductor lasers whose wavelength stays nearly constant with ambient temperature variation. Several factors affecting the lasing wavelength change with temperature variation in both distributed feedback lasers and Fabry-Perot lasers are addressed and the optimum design of bandgap temperature dependence for the active layer material is discussed. It is pointed out that the most important challenge we face in building temperature-insensitive wavelength lasers is the development of a temperature-insensitive bandgap material for the active layer. Based on published data, it is speculated that such a laser could be developed using a Hg1-xCdxTe/CdTe double heterostructure. Although no data is available yet, we expect a Ga1-xInxAs1-yBiy III-V alloy semiconductor can be used for this purpose. Recently reported T1xIn1-x-yGayP III-V alloy semiconductor might be another promising candidate. Such lasers will greatly advance applications of WDM (Wavelength-Division-Multiplexing) technology to optical fiber communication systems and contribute to network innovations.

The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.

This paper is concerned with a point-oriented finite volume time domain (FVTD) method in the Cartesian coordinate system for analyzing electromagnetic wave scattering by arbitrary shaped metallic gratings. The perfectly matched layer (PML) is used for the absorbing boundary conditions (ABC's) in the directions corresponding to transmitted and reflected wave regions. An FVTD version of the Floquet's theorm is described to impose the periodic condition in the direction where conducting rods are located periodically. The boundary conditions for a conductor rod which is not well suited to the Cartesian coordinate system are satisfied in an average fashion by introducing image fields at image points. It is shown that the present method gives accurate numerical results. Numerical calculations are also carried out for thick conducting rods which seem difficult to deal with in an analytical way.

This paper evaluates the performance of DS/CDMA with diversity coding and multiuser interference (MUI) cancellation in fading multipath channel. The diversity technique considered in this paper, is different from the conventional scheme and transmits different information over different channels. It is shown that, this diversity scheme performs better than conventional diversity scheme, and when combined with MUI cancellation provides significant performance improvement. Effects of partial band jamming on the system are also considered.

In [2] Ibarra introduced a restricted version of one-way multihead pushdown automaton (PDA), called a simple one-way multihead PDA, and showed that such machines recognize only languages with semilinear property. The main result of this paper is that for each k 1, simple (sensing) one-way (k + 1)-head PDA's are more powerful than simple (sensing) one-way k-head PDA's. This paper also investigates closure properties for simple (sensing) one-way multihead PDA's

For quasi millimeter-wave and millimeter-wave high-speed wireless communications over wireless LANs and wireless ATMs, narrow beam antennas have been shown to provide high transmission quality by suppressing the troublesome multipath effect. However, the diameter of sector antennas needed to create the narrow beams rapidly increases with the sector number. In addition, the cylindrical shape of typical sector antennas does not suit portable terminals. This paper shows a methodology for designing planar sector antennas that overcomes these problems. The proposed antenna uses two kinds of beams and the antenna gains are equalized in all sectors. The antenna is developed as a 4-beam subarray fed by a planar Butler matrix circuit. The design method of the subarray and an evaluation of its characteristics in the 20 GHz band are discussed.

The Time-Slicing paradigm is a newly developed method for the training of neural networks for speech recognition. The neural net is trained to spot the syllables in a continuous stream of speech. It generates a transcription of the utterance, be it a word, a phrase, etc. Combined with a simple error recovery method the desired units (words or phrases) can be retrieved. This paradigm uses a recurrent neural network trained in a modular fashion with natural connectionist glue. It processes the input signal sequentially regardless of the input's length and immediately extracts the syllables spotted in the speech stream. As an example, this character string is then compared to a set of possible words, picking out the five closest candidates. In this paper we describe the time-slicing paradigm and the training of the recurrent neural network together with details about the training samples. It also introduces the concept of natural connectionist glue and the recurrent neural network's architecture used for this purpose. Additionally we explain the errors found in the output and the process to reduce them and recover the correct words. The recognition rates of the network and the recovery rates for the words are also shown. The presented examples and recognition rates demonstrate the potential of the time-slicing method for continuous speech recognition.

In the envisaged Universal Mobile Telecommunications System (UMTS), the satellite component will have to provide services to mobile or, in some cases, hand held terminals with a required grade of user co-operation and link availability in various communication environments. This may require the capability of the satellite link to cope with more severe multipath environments than those for which mobile satellite links are most frequently designed (maritime or open rural applications); unfortunately, when the mobile radio channel is affected by multipath and a coherent demodulation is chosen, the phase synchronisation can be a critical issue. To satisfactorily deal with the arising difficulties, a dual channel demodulation is a viable and efficient strategy for the forward link, since only one common pilot channel is needed in this case. If the same dual channel demodulation is considered for the return link, an unacceptable capacity reduction may result. In this paper, some synchronisation strategies are analysed and an efficient dual channel demodulation scheme is proposed for the return link of a satellite DS-CDMA mobile communication system; furthermore, the impact on the overall system performance or capacity is analysed.

In this paper, a simple frame synchronization system for M-ary/SS communication systems is proposed, and synchronization performance and the resulting bit error rate performance are analyzed. The frame synchronization system uses racing counters and framing chips which are added to spreading sequences. M-ary/SS communication systems can improve bit error rate performance under the condition in which there is an additive white gaussian noise. Synchronization of M-ary/SS communication systems is difficult, however, because M-ary/SS communication systems have several spreading sequences. The authors proposed the simple frame synchronization system which uses only one chip in the spreading sequence as a framing signal. This system needs a long time for initial acquisition as the frame length is longer. The proposed system in this paper can make initial acquisition time short by increasing the number of framing chips. The proposed system corresponds to the conventional system when the number of framing chips is l. As the result, it is shown that several framing chips contribute to decrease the initial acquisition time. Moreover, the frame synchronization system can be applied to asynchronous M-ary/SSMA system when different framing chip pattern is assigned to each user.

In this paper, a design of a new processor array architecture with effective data storage schemes which meets the practical requirement of a reduced number of processor elements is proposed. Its design method is shown to be drastically simpler than the popular systolic arrays. This processor array which we call Memory Sharing Processor Array (MSPA) consists of a processor array, several memory units, and some address generation hardware units used to minimize the number of I/O ports. MSPA architecture with its design methodology tries to overcome overlapping data storages, idle processing time and I/O bottleneck problems, which mostly degrade the performance of systolic architecture. It has practical advantages over the systolic array in the view of area-efficiency, high throughput and practical input schemes.

A three-terminal quantum device utilizing photon-assisted tunneling in a multilayer structure is proposed and analyzed in terms of its high frequency amplification characteristics. The operation principle of this device includes photonassisted tunneling at the input, formation of a propagating charge wave due to the beat of tunneling electrons and its acceleration, and radiation of electromagnetic waves at the output. Analysis of these operations, discussion of similarities and dissimilarities to classical klystrons, and estimation of the power gain and its frequency dependence are given. A simple example demonstrates that amplification up to the terahertz frequency range is possible using this device.

This paper proposes a method for deriving protocol specifications in a communicating processes model, in which protocol specifications are modeled by finite automata communicating through the LOTOS multirendezvous mechanism. Message sequence charts (MSCs) are used for the derivation inputs. MSCs are graphical representations of traces of protocols and are suitable for defining requirements. Since an MSC usually covers only partial behavior, several mechanisms for composing a large number of MSCs from element MSCs have been proposed. These mechanisms, however, are not adequate: Either their input language for MSCs is not powerful enough, or they need some information on protocol specifications (i.e., implementation specifications). This paper proposes the use of regular expressions over MSCs to fully define protocols. The proposed language is powerful enough to describe protocols in the communicating processes model. A derivation algorithm based on a finite automata construction algorithm that accept sets expressed by regular expressions is presented. Because the derived protocols sometimes include unrequired behavior, an algorithm for detecting unrequired behavior is also presented.

The aim of this study is to measure and quantify muscle fatigue of low back, caused by sitting on the vehicle seat for a long period of time. The authors proposed a new objective muscle fatigue index based on Principle Component Analysis utilizing the measured muscle viscoelasticity and EMG. The new index suggests an adequate correlation with the subjective fatigue.

For reduction of computational complexity in the IA algorithm, the thinned-out IA algorithm in which only one step size is updated every iteration is proposed and is complementarily switched with the HA algorithm according to the convergence. The switching is determined by using the gradient of the error signal power. These are investigated through the computer simulations.