Three-dimensional vocal tract shapes of a male, a female and a child subjects are measured from magnetic resonance (MR) images during sustained phonation of Japanese vowels /a, i, u, e, o/. Non-uniform dimensional differences in the vocal tract shapes of the subjects are quantitatively measured. Vocal tract area functions of the female and child subjects are normalized to those of the male on the basis of non-uniform and uniform scalings of the vocal tract length and compared with each other. A comparison is also made between the formant frequencies computed from the area functions normalized by the two different scalings. It is suggested by the comparisons that non-uniformity in the vocal tract dimensions is not essential in the normalization of the five Japanese vowels.

Microwave radiometry has been investigated for non-invasive measurement of temperature in human body. Recent trends are to explore the capability of retrieving a temperature profile or map from a set of brightness temperatures measured by a multifrequency radiometer operating in a 1-6GHz range. The retrieval of temperature from the multifrequency measurement data is formulated as an inverse problem in which the number of independent measurement or data is limited (7) and the data suffer from considerably large random fluctuations. The standard deviation of the data fluctuation is given by the brightness temperature resolution of the instrument (0.04-0.1K). Solutions are prone to instabilities and large errors unless proper solution methods are used. Solution methods developed during the last few years are reviewed: singular system analysis, bio-heat transfer solution matched with radiometric data, and model-fitting combined with Monte Carlo technique. Typical results obtained by these methods are presented to indicate a crosssection of the present-state-of-the-development in the field. This review concludes with discussions on the radiometric weighting function which connects physical temperatures in object to the brightness temperature. Three-dimensional weighting functions derived by the modal analysis and the FDTD method for a rectangular waveguide antenna coupled to a four layered lossy medium are discussed. Development of temperature retrieval procedures incorporating the 3-D weighting functions is an important and challenging task for future work in this field.

In the early stage of hyperthermia, a large number of engineering efforts have been done in the development or the improvement of the heating and temperature measuring techniques. However, they were not always satisfactory clinically. Thus, even in this moment, various engineering researches as well as the electromagnetic techniques for hyperthermia should be build up rapidly. This paper describes some of the highlights of developed or ongoing electromagnetic heating techniques in hyperthermia and identities a trend of emerging electromagnetic heating. Furthermore, the author emphasizes that few medical engineering efforts have been done in the boundary field between pure physics and clinics, and the proper way to develop the hyperthermia equipment is the best use of successes in the three essential regions: Physics, Biology and Clinics.

When communication network planning-design is performed, especially in a short-term case, it is important to utilize existing facilities in the construction of the new network. In this paper, link capacity assignment problem (CA problem) for packet-switched networks is investigated with the consideration of the existing network. To deal with this, per-unit cost of existing link capacity is thought to be less than that of newly installed capacity and a link cost function is modeled by a non-linear, non-differentiable one which is composed of two portions of capacity cost. After formulating the CA problem, two optimum algorithms derived from Lagrange multiplier method are presented and a modified algorithm is used for solving the CA problem in order to reduce the computation time. Some numerical results show that according to the values of link traffic flows, there will be links whose capacities must be set equally to the existing values. Moreover, when link cost difference is introduced in the CA problem, the number of links that the capacities of which have to be changed from existing values is less than that of linear cost function case, i.e., the case without consideration of the cost difference in link capacity.

Computational approaches to concept formation often share a top-down, incremental, hill-climbing classification, and differ from each other in the concept representation and quality criteria. Each of them captures part of the rich variety of conceptual knowledge and many are well suited only when the object-attribute distribution is not sparse. Formal concept analysis is a set-theoretic model that mathematically formulates the human understanding of concepts, and investigates the algebraic structure, Galois lattice, of possible concepts in a given domain. Adopting the idea of representing concepts by mutual closed sets of objects and attributes as well as the Galois lattice structure for concepts from formal concept analysis, we propose an approach to concept formation and develop OSHAM, a method that forms concept hierarchies with high utility score, clear semantics and effective even with sparse object-attribute distributions. In this paper we describe OSHAM, and in an attempt to show its performance we present experimental studies on a number of data sets from the machine learning literature.

Cross-phase modulation (XPM) induced by residual intensity modulation in coherent optical frequency-shift-keying (FSK) frequency division multiplexing (FDM) transmission systems that use dispersion-shifted fibers is evaluated theoretically and experimentally in terms of spectral profile deformation. The bit-error rate is measured in a 2.5-Gbit/s 4-channel 40-km dispersion-shifted fiber transmission experiment, and we confirm experimentally and theoretically that the power penalty in the presence of residual intensity modulation of over 4 mWp-p exceeds 1dB. Experimental results show that the penalty due to XPM is large even when the power of the newly generated lights caused by four-wave mixing is 20-dB less than that of signals. This confirms that residual intensity modulation must be reduced in continuous-phase (CP)-FSK-FDM systems even though they are designed to avoid generating four-wave mixing.

A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.

This paper describes a SQUID magnetometer and the measurement of small signals. It also describes the current state of SQUID technology developed in the SSL project.

This paper describes a parameter extraction system that can easily accommodate many MOSFET models. The model-adaptability is contributed by tow factors; a model-adaptable initial value estimation technique and an environment which stores and reuses extraction procedures. A designer can easily develop an extraction procedure for a new MOSFET model by modifying a procedure for another MOSFET model developed previously. We have verified that the system is suitable for major SPICE models.

This paper concerns the issue of learning strategies for problem solvers from trace data. Many works on Explanation Based Learning have proposed methods for speeding up a given problem solver (or a Prolog program) by optimizing it on some subspace of problem instances with high probability of occurrences. However, in the current paper, we discuss the issue of identifying a target strategy exactly from trace data. Learning criterion used in this paper is the identification in the limit proposed by Gold. Further, we use the tree pattern language to represent preconditions of operators, and propose a class of strategies, called decision list strategies. One of the interesting features of our learning algorithm is the coupled use of state and operator sequence information of traces. Theoretically, we show that the proposed algorithm identifies some subclass of decision list strategies in the limit with the conjectures updated in polynomial time. Further, an experimental result on N-puzzle domain is presented.

This paper describes a fully digitized modem designed for variable baud rate transmission systems with the aim of efficiently providing multimedia services over a wireless communication network. The concept of a variable baud rate wireless communication system is discussed focusing on the access scheme and channel allocation from the viewpoint of frequency utilization efficiency. For easy system construction, we propose a fully digitized variable baud rate modem based on multirate digital signal processing, taking into account the need for even performance and easy clock control for all transmission rates. We also discuss the operational principle of modulation, the degradation factor in the A/D converter, and the configuration of the clock recovery circuit. Steady modulation performance can be kept by generating the same frequency system clock for all transmission rates and using the sampling rate conversion technique without selecting the channel filter for each transmission rate. It is proved by the analysis of the degradation factor in the A/D converter that only the bandwidth of the channel filter in demodulator should be changed for the transmission rate. A double loop clock recovery configuration capable of both tank-limit type and baseband estimation type clock recovery is shown to be suitable for this system. The tank-limit clock recovery circuits can be constructed easily by employing a tank circuit array. Finally, we present experimental results for a modem having transmission rates of 1.544Mbps and 6.312Mbps for the digital hierarchy and information speed of video signals such as MPEG-1 and MPEG-2. The measured basic performance of the proposed modem shows it delivers superior performance without the need for precise adjustment when a QPSK modulation scheme is employed.

The performance of trellis coded hybrid frequency and phase shift modulation (TC HFPSK) with the expurgated phase code and the asymmetric signal constellation is investigated by using the minimum squared free Euclidean distance d 2free and the bit error rate (BER). It is found that TC hybrid 2FSK/4PSK with the expurgated phase code shows larger d 2free than the corresponding TC hybrid 2FSK/4PSK with the complete phase code for varying the angle φ that determines the asymmetric signal constellation. The maximum value of d 2free of TC hybrid 2FSK/4PSK with the expurgated phase code can be obtained when the signal constellation is symmetric. The performance of BER is analyzed in additive white Gaussian noise (AWGN) and fading channels by using uniform error property and error bound based on transfer function. It is found that the coding gain of TC hybrid 2FSK/4PSK with the expurgated phase code over uncoded hybrid 2FSK/2PSK at BER=10-4 are 2.71dB and 4.74dB in AWGN and fading channels, respectively. The performance improvements of TC hybrid 2FSK/4PSK with the expurgated phase code over TC 8PSK at BER=10-4 are 0.68dB and 4.07dB in AWGN and fading channels, respectively.

Motion estimation is a major part of the video coding, which traces the motion of moving objects in video sequences. Among various motion estimation algorithms, the Hierarchical Block-Matching Algorithm (HBMA) that is a multilayered motion estimation algorithm is attractive in motion-compensated interpolation when accurate motion estimation is required. However, parallel processing of HBMA is necessary since the high computational complexity of HBMA prevents it from operating in real-time. Further, the repeated updates of vectors naturally lead to pipelined processing. In this paper, we present a pipelined architecture for HBMA. We investigate the data dependency of HBMA and the requirements of the pipeline to operate synchronously. Each pipeline stage of the proposed architecture consists of a systolic array for the block-matching algorithm, a bilinear interpolator, and a latch mechanism. The latch mechanism mainly resolves the data dependency and arranges the data flow in a synchronous way. The proposed architecture achieves nearly linear speedup without additional hardware cost over a non-pipelined one. It requires the clock of 2.70 ns to process a large size of frame (e.q. HDTV) in real-time, which is about to be available under the current VLSI technology.

Wide bandwidth of 30MHz was achieved by 3-IDT SAW resonator filters using 36Y-X LiTaO3 substrates at 800MHz. The filter, which has fractional bandwidth of 3.6%, can be applied for several mobile communication systems. Low insertion loss of 1.7 dB was obtained by taking parallel arranged configuration, which proved to be 0.4 dB better than simple cascade-connected configuration.

Program transformation is a kind of optimization techniques for logic programs, which aims at transforming equally a program into an other form by exploiting some properties or information of the program, so as to make the program cheaper to evaluate. In this paper, a new kind of property of logic programs, called reducibility, is exploited in program transformation. A recursive predicate is reducible if the values of some variables in the recursive predicate are independent to the remainder part and can be detached from the predicate after finite times of expansions. After being proved that the semantic notion of reducibility can be replaced by the syntactic notion of disconnectivity of a R-graph, which is a kind of graph model to represent the behavior of formula expansions, an efficient testing and factoring algorithm is proposed. The paper also extends some existed results on compiled formulas of linear sirups, and compares with some related work.

Although consistent learning is sufficient for PAC-learning, it has not been found what strategy makes learning more efficient, especially on the sample complexity, i.e., the number of examples required. For the first step towards this problem, classes that have consistent learning algorithms with one-sided error are considered. A combinatorial quantity called maximal particle sets is introduced, and an upper bound of the sample complexity of consistent learning with one-sided error is obtained in terms of maximal particle sets. For the class of n-dimensional axis-parallel rectangles, one of those classes that are consistently learnable with one-sided error, the cardinality of the maximal particle set is estimated and O(d/ε1/ε log 1/δ) upper bound of the learning algorithm for the class is obtained. This bound improves the bounds due to Blumer et al. and meets the lower bound within a constant factor.

In this paper we investigate the learnability of relations in Inductive Logic Programming, by using equality theories as background knowledge. We assume that a hypothesis and an observation are respectively a definite program and a set of ground literals. The targets of our learning algorithm are relations. By using equality theories as background knowledge we introduce tree structure into definite programs. The structure enable us to narrow the search space of hypothesis. We give pairs of a hypothesis language and a knowledge language in order to discuss the learnability of relations from the view point of inductive inference and PAC learning.

This letter presents new estimation algorithm of ARMAX systems which do not always satisfy the strictly positive real (SPR) condition. We show how estimated parameters can converge to their true values based on the overparameterized system. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.

In this study, a ring of simple chaotic circuits coupled by inductors is investigated. An extremely simple three-dimensional autonomous circuit is considered as a chaotic subcircuit. By carrying out circuit experiments and computer calculations for two, three or four subcircuits case, various synchronization phenomena of chaos are confirmed to be stably generated. For the three subcircuits case, two different synchronization modes coexist, namely in-phase synchronization mode and three-phase synchronization mode. By investigating Poincar map, we can see that two types of synchronizations bifurcate to quasi-synchronized chaos via different bifurcation route, namely in-phase synchronization undergoes period-doubling route while three-phase synchronization undergoes torus breakdown. Further, we investigate the effect of the values of coupling inductors to bifurcation phenomena of two types of synchronizations.

In coherent optical space communication systems, the phase noise generated from high power laser diodes and the polarization axis mismatch between transmitter and receiver are the serious problem. In this paper, a novel coherent optical space communication system, called optical polarization azimuth modulation (POLAM)/heterodyne detection system is newly proposed, and its system performance is theoretically investigated. It is clarified that the POLAM system can perfectly remove the laser phase noise, is actually insensitive to the polarization axis mismatch, and can provide the remarkable performance improvement compared to a conventional optical frequency modulation system.