A new low voltage high-speed CMOS composite transistor is presented. It lowers supply voltage down to |Vt|+2 Vds,sat and considerably extends input voltage operating range and achieves high speed operation. As an application example, it is used in the design of a high-speed four quadrant analog multiplier. Simulations results using MOSIS 2µm N-well process with a 3 V supply are given.

Crosstalk from digital to analog circuits can be causative of operation fails in analog-digital mixed LSIs. This paper describes modeling techniques and simulation strategies of the substrate coupling noise. A macroscopic substrate noise model that expresses the noise as a function of logic state transition frequencies among digital blocks is proposed. A simulation system based on the model is implemented in the mixed signal simulation environment, where performance degradation of the 2nd order ΔΣADC coupled to digital noise sources is clearly simulated. These results indicate that the proposed behavioral modeling approach allows practicable full chip substrate noise simulation measures.

In this paper, the computational issue in the problem of learning Bayesian belief networks (BBNs) based on the minimum description length (MDL) principle is addressed. Based on an asymptotic formula of description length, we apply the branch and bound technique to finding true network structures. The resulting algorithm searches considerably saves the computation yet successfully searches the network structure with the minimum value of the formula. Thus far, there has been no search algorithm that finds the optimal solution for examples of practical size and a set of network structures in the sense of the maximum posterior probability, and heuristic searches such as K2 and K3 trap in local optima due to the greedy nature even when the sample size is large. The proposed algorithm, since it minimizes the description length, eventually selects the true network structure as the sample size goes to infinity.

In this paper, we discuss the problem of active training data selection for improving the generalization capability of a neural network. We look at the learning problem from a function approximation perspective and formalize it as an inverse problem. Based on this framework, we analytically derive a method of choosing a training data set optimized with respect to the Wiener optimization criterion. The final result uses the apriori correlation information on the original function ensemble to devise an efficient sampling scheme which, when used in conjunction with the learning scheme described here, is shown to result in optimal generalization. This result is substantiated through a simulated example and a learning problem in high dimensional function space.

This paper is concerned with radio resource allocation in multiple-chip-rate (MCR) DS/CDMA systems accommodating multimedia services with different information rates and quality requirements. Considering both power spectral density (PSD) over a radio frequency (RF) band and the effect of RF input filtering on the receiver in MCR-DS/CDMA systems, criteria for capacity estimation are presented and the characteristics of co-channel interference between subsystems are investigated. System performance in MCR-DS/CDMA systems is strongly affected by radio resource assignment. A minimum power-increment-based resource assignment scheme for an efficient resource assignment scheme is proposed herein. The performance of this scheme is compared with that of a random-based resource assignment scheme in terms of blocking probability and normalized throughput. The minimum power-increment-based resource assignment scheme yields a better performance than the random-based resource assignment scheme for multimedia services.

Much of the data we deal with every day is organized hierarchically: file systems, library classification schemes and yellow page categories are salient examples. Business data too, benefits from a hierarchical organization, and indeed the hierarchical data model was quite prevalent thirty years ago. Due to the recently increased importance of X. 500/LDAP directories, which are hierarchical, and the prevalence of aggregation hierarchies in datacubes, there is now renewed interest in the hierarchical organization of data. In this paper, we develop a framework for a modern hierarchical data model, substantially improved from the original version by taking advantage of the lessons learned in the relational database context. We argue that this new hierarchical data model has many benefits with respect to the ubiquitous flat relational data model.

This paper proposes a new cell station (CS) configuration for personal communication systems. The proposed CS employs a modified coherent demodulator with 4-branch maximal ratio combining diversity and a burst-by-burst automatic frequency control (AFC) to enhance the coverage. The proposed CS also employs an antenna-sharing diversity transmission to incorporate more than one transceiver block into a small unit with high power efficiency. With these techniques, the BER performance of the uplink control channel (CCH) is flattened regardless of carrier frequency errors within 12 kHz; the diversity gain of uplink traffic channel (TCH) is improved by 2 dB; the downlink transmission power is reduced by 1.9 dB.

This paper presents results of subjective assessment of the media synchronization quality in the virtual-time rendering (VTR) media synchronization algorithm. For the assessment, stored voice and video streams were transmitted as two separate transport streams from a source to a destination on various traffic conditions in an experimental system. At the destination, they were output after synchronization control. We subjectively assessed the quality of media synchronization in a systematic way. This paper examines the effects of the difference between methods of recovery from asynchrony on the media synchronization quality. The paper also clarifies the relationships between the subjective and objective performance measures. Furthermore, it examines the effect of the difference in scene between media streams and that of the modification of the target output time on the media synchronization quality.

Internet users have become well acquainted with the World Wide Web (WWW) system, and WWW has become the most significant service on the Internet. In the near future, the importance of large scale hypermedia database systems based on WWW technologies is expected to continue to increace. The present study focuses on the issue of managing hyperlink integrity constraints on WWW like hypermedia database systems. After formally defining path existence constraint definitions(PEDs) using intuitive examples, we apply the notion of PEDs to represent hyperlink integrity constraints. Intuitively, a PED can be used to represent the following integrity constraint. If a reference path exists in a given database, then another corresponding reference path must also exist. An outline of a prototype hypermedia database system, AYATORI, which is based on the proposed model and under development, is also mentioned.

We study resource allocation strategies in ATM switches, which provide quality of service (QoS) guarantees to individual connections. In order to minimize the cell loss rate over a wide range of traffic characteristics, an efficient allocation strategy is necessary. In this paper we introduce a resource allocation strategy, named TP+WRR (Threshold Pushout + Weighted Round Robin) which can fully utilize the buffer space and the bandwidth. We compare the performance of TP+WRR with two typical resource allocation strategies. An exact queueing analysis based on a Markov model is carried out under bursty traffic sources to evaluate their performance. Our results reveal that TP+WRR considerably improves the cell loss probability over the other strategies considered in this paper, especially when many connections are sharing a link.

In this paper, we will discuss a map synthesis system which handles static information (geographic objects) as well as dynamic information (traffic conditions, weather, etc. ). In addition to geographic thesauruses used in the previous systems, we will use co-existence relationships to improve the quality of maps generation. The system is considered to be general purpose (not restricted to car navigation nor travel maps) and can generate arbitrary maps according to the user's specification. It is very difficult for a user to specify a query which corresponds to the required map, because map description is not easy. The system should automatically generate missing information or find errors in the user specification. For the purpose we use geographic domain thesauruses which contain aggregation and other geographic relationships as well as conventional thesaurus hierarchy. In this paper, we will discuss to use co-existence relationships to enhance ability to select geographic objects automatically. Co-existence specifies relationships among geographic objects which should appear in a map together although they may not have geographic relationship by thesauruses. By utilizing co-existence relationships, a user can acquire much more understandable maps.

The disk allocation problem examined in this paper is finding a method to distribute a Binary Cartesian Product File on multiple disks to maximize parallel disk I/O accesses for partial match retrieval. This problem is known to be NP-hard, and heuristic approaches have been applied to obtain suboptimal solutions. Recently, efficient methods such as Binary Disk Modulo (BDM) and Error Correcting Code (ECC) methods have been proposed along with the restrictions that the number of disks in which files are stored should be a power of 2. In this paper, a new Disk Allocation method based on Genetic Algorithm (DAGA) is proposed. The DAGA does not place restrictions on the number of disks to be applied and it can allocate the disks adaptively by taking into account the data access patterns. Using the schema theory, it is proven that the DAGA can realize a near-optimal solution with high probability. Comparing the quality of solution derived by the DAGA with the General Disk Modulo (GDM), BDM, and ECC methods through the simulation, shows that 1) the DAGA is superior to the GDM method in all the cases and 2) with the restrictions being placed on the number of disks, the average response time of the DAGA is always less than that of the BDM method and greater than that of the ECC method in the absence of data skew and 3) when data skew is considered, the DAGA performs better than or equal to both BDM and ECC methods, even when restrictions on the number of disks are enforced.

In this paper, we propose a method for querying heterogeneous molecular biology databases. Since molecular biology data are distributed into multiple databases that represent different biological domains, it is highly desirable to integrate data together with the correlations between the domains. However, since the total amount of such databases is very large and the data contained are frequently updated, it is difficult to maintain the integration of the entire contents of the databases. Thus, we propose a method for dynamic integration based on user demand, which is expressed with an OQL-based query language. By restricting search space according to user demand, the cost of integration can be reduced considerably. Multiple databases also exhibit much heterogeneity, such as semantic mismatching between the database schemas. For example, many databases employ their own independent terminology. For this reason, it is usually required that the task for integrating data based on a user demand should be carried out transitively; first search each database for data that satisfy the demand, then repeatedly retrieve other data that match the previously found data across every database. To cope with this issue, we introduce two types of agents; a database agent and a user agent, which reside at each database and at a user, respectively. The integration task is performed by the agents; user agents generate demands for retrieving data based on the previous search results by database agents, and database agents search their databases for data that satisfy the demands received from the user agents. We have developed a prototype system on a network of workstations. The system integrates four databases; GenBank (a DNA nucleotide database), SWISS-PROT, PIR (protein amino-acid sequence databases), and PDB (a protein three-dimensional structure database). Although the sizes of GenBank and PDB are each over one billion bytes, the system achieved good performance in searching such very large heterogeneous databases.

Extremely small aperture radial line slot antennas (RLSAs) are analyzed by method of moments. At first, the analysis model of cylindrical waveguide in terms of rectangular cavity modes is confirmed for a RLSA with a spiral slot arrangement. The overall VSWR as well as rotational symmetry of the actual structure of RLSAs is predicted for the first time and is confirmed experimentally. Secondly, the minimum diameter of the concentric array RLSA is estimated for which the conventional analysis model of a rectangular waveguide is valid for the design of matching slot pairs at the shorted periphery of the radial waveguide. It is found that the curvature and cylindrical short wall at aperture periphery must be considered in the design and analysis of small RLSAs with the gain lower than about 25 dBi.

This letter addresses how to set SIR targets higher than normally required, in order to mitigate the effect of signal-to-interference ratio (SIR) measurement error included in power control steps. We find that scaling up the SIR targets by 1 dB is conformable to resisting SIR measurement error for code division multiple access (CDMA) mobile systems.

The OMG have made the trading service one of the basic CORBA services. A specification has been drawn up (OMG RPF5) but seems to have some problems in terms of scalability and complexity. This paper introduces an architecture called Contextual Clustering Using Service Properties (CCUSP) that deals with issues of scalability. It uses a contextual approach to clustering object service offers based on property commonalities. It also handles issues of scalability of trader federation. An ontological approach is to be used, however not covered in this paper. An implementation of the specialisation graph context model is detailed.

Peculiar patterns of SiO2 contamination around the periphery of the contact trace caused by silicone vapor under switching at the boundary of 1.6 W were confirmed. For micro relays, the electrical power conditions are restricted to lower level. Therefore, it is important to ascertain the upper limit of the electrical power conditions for normal operation. The peculiar pattern is important as it is recognized as the first stage of the origination of contact failure. Causes of this pattern were discussed from the viewpoints of temperature distribution in the contact trace, molten metallic bridge, micro arc discharge, and supply of silicone vapor with oxygen. It is proposed that during the closing contacts, as maximum Joule heating occurs at the periphery of the true contact area and silicone vapor with oxygen is easily supplied at the periphery, SiO2 grows around the contact trace. For the opening contacts, as the bridge or micro arc appears, silicone vapor with oxygen is supplied only outside of the contacts. Thus SiO2 is formed mainly around the periphery of the trace. Moreover, SiO2 was scattered radially depending on the sputtering of molten metal under rupture of the bridge. Therefore, the peculiar pattern forms as a result.

This paper surveys recent research activities on three major areas of digital media information base, namely, video database systems as a typical example of temporal application, database systems for mixed reality as an instance of spatial application, and kansei management for digital media retrieval as a case of humanistic feelings application. Current research results by the project Advanced Database Systems for Integration of Media and User Environments are reported.

Adaptive maximum likelihood differential detection implemented by a reduced state-transition Viterbi algorithm (called adaptive 3-state RSTVDD) is presented for adaptive reception of M-ary differential phase shift keying (DPSK) signals transmitted over additive white Gaussian noise (AWGN) and frequency-nonselective Rayleigh fading channels. The adaptive 3-state RSTVDD comprises 1DD, a differential encoder, and reverse modulator, followed by reduced-state (3-state) Viterbi DD (RSVDD) with adaptive phase reference estimation. The adaptive 3-state RSVDD detector estimates the sequence of phase errors of the 1DD output. The phase reference estimator is an adaptive least mean square (LMS) filter with a step-size that adapts to changing channel conditions. The final detected symbol sequence is the modulo-2π sum of the 1DD output phase sequence and the detected phase error sequence. The bit error rate (BER) performance of M-ary DPSK, M=4, 8, and 16, in the AWGN and Rayleigh fading channels is evaluated by computer simulation to show that adaptive 3-state RSTVDD can achieve almost the same BER performance as the previously developed adaptive M-state RSVDD. Since the number of trellis states is reduced to three irrespective of M, the adaptive 3-state RSTVDD has lower computation complexity and it is particularly useful for M-ary DPSK with M8.

The optimistic analytical results for performance analysis of buffered banyan networks are mainly due to certain independence assumptions used for simplifying analysis. To capture more effects of cell correlation, a refined analytical model for both single-buffered and multiple buffered banyan networks is proposed in this paper. When cell output contention occurs at a 2 2 switch element, two contention resolution schemes are used. One is based on randomly choosing the winning cell and another is to give priority to the cell which has been delayed in the current buffer for at least one stage cycle. The switch throughput, cell transfer delay and cell delay deviation for single-buffered banyan networks with and without using priority scheme are derived. Then the model is generalized to multiple buffered banyan networks where analytical expressions for throughput and delay are obtained. We show that using the priority scheme the cell delay deviation is reduced and the influence on throughput performance is insignificant. The results obtained from our analytical model are compared with the simulations and good agreement is observed. Comparisons with some proposed analytical models in the literature reveal that our model is more accurate and powerful in predicting the performance of buffered banyan networks.