The generation and design of a stationary Markov signal are discussed as an inverse problem, in which one looks for a transition probability when a stationary probability distribution is given. This paper presents a new solution to the inverse problem, which makes it possible to design and generate a Markov random signal with arbitrary probability distribution and an exponential correlation function. Several computer results are illustrated in figures.

This paper addresses the problem of estimating the parameters of multivariate ARMA processes by using higher-order statistics called cumulants. The main objective in this paper is to extend the idea of the q-slice algorithm in univariate ARMA processes to multivariate ARMA processes. It is shown for a multivariate ARMA process that the MA coefficient matrices can be estimated up to postmultiplication of a permutation matrix by using the third-order cumulants and of an extended permutation matrix by using the fourth-order cumulants. Simulation examples are included to demonstrate the effectiveness of the proposed method.

This paper proposes a new strategy for reducing contention for a critical section in a multiprocessor system and shows that the strategy can improve CPU utilization by several percent. Using simulation and queueing theory, it also discusses when the strategy is superior to conventional ones.

The paper proposes a new multicarrier 16QAM system for high-quality and high-bit-rate transmission with high spectral efficiency in land mobile radio communications. The proposed system uses a multicarrier transmission scheme to provide immunity against frequency-selective fading distortion. It also uses pilot-symbol-aided 16QAM to increase spectral efficiency, and it combines space diversity and FEC with maximum likelihood decoding to improve the bit error rate (BER) performance. Computer simulation shows that a BER of less than 10-4 is obtained over frequency-selective fading channels with rms delay spread of less than 5.4µs. Using a bandwidth of 200kHz the proposed system can achieve high-quality transmission with a total information rate of 256kbit/s.

This paper shows that a convolution property holds for sixteen members of a sinusoidal unitary transform family (DCTs and DSTs), on condition that an impulse response is an even function. Instead of the periodicity of an input signal assumed in the DFT case, DCTs require the input signal to be even symmetric outside boundaries and DSTs require it to be odd symmetric. The property is obtained by solving the eigenvalue problem of the matrices representing the convolution. The content of the property is that the DCT (or the DST) element of the output signal is the product of the DCT (or the DST) element of the input signal and the DFT element of the impulse response. The result for the well-known DCT is useful for a strongly-correlated signal and two examples demonstrate it.

This paper describes the general conditions for perfect signal reconstruction in adaptive blocksize MDCT. MDCT, or modified Discrete Cosine Transform, is a method in which blocks are laid to overlap each other. Because of block overlapping, some consideration must be paid to reconstructing the signals perfectly in adaptive blocksize schemes. The perfect reconstruction conditions are derived by considering the reconstruction signals, on a segment by segment basis. These conditions restrict the analysis/synthesis windows in the MDCT formula. Finally, this paper evaluates two examples of window sets, including windows used in the ISO MPEG audio coding standard.

The optical waveguides containing phthalocyanine as an optically active material were fabricated and transmission properties were investigated experimentally and numerically. The positive refractive index change was observed in the glass waveguide with a vanadyl phthalocyanine thin film as a top layer. The thermal influence on refractive index change was estimated by surface plasmon measurements.

Electrical and optical properties of organic multilayer structure have been investigated. Two types of current-voltage characteristics have been found for thin multilayer structure of organic films. Optical property and its application for electroluminescent diode have been presented. The diode characteristics have been discussed in terms of energy band scheme.

We develop a convergence theory of the simple genetic algorithm (SGA) for two-bit problems (Type I TBP and Type II TBP). SGA consists of two operations, reproduction and crossover. These are imitations of selection and recombination in biological systems. TBP is the simplest optimization problem that is devised with an intention to deceive SGA into deviating from the maximum point. It has been believed that, empirically, SGA can deviate from the maximum point for Type II while it always converges to the maximum point for Type I. Our convergence theory is a first mathematical achievement to ensure that the belief is true. Specifically, we demonstrate the following. (a) SGA always converges to the maximum point for Type I, starting from any initial point. (b) SGA converges either to the maximum or second maximum point for Type II, depending upon its initial points. Regarding Type II, we furthermore elucidate a typical sufficient initial condition under which SGA converges either to the maximum or second maximum point. Consequently, our convergence theory establishes a solid foundation for more general GA convergence theory that is in its initial stage of research. Moreover, it can bring powerful analytical techniques back to the research of original biological systems.

J. Bresnan and R. M. Kaplan introduced lexical-functional grammars (LFGs, for short) as a new formalism for human language syntax. It is important to show formal properties of this kind of grammars in order to characterize the formal complexity of human languages. In this paper, we will show that the emptiness problem for LFGs is undecidable.

Relating to the problem of suppressing the immanent redundancy contained in an image with out vitiating the quality of the resultant approximation, the interpolation of multi-dimensional signal is widely discussed. The minimization of the approximation error is one of the important problems in this field. In this paper, we establish the optimum interpolatory approximation of multi-dimensional orthogonal expansions. The proposed approximation is superior, in some sense, to all the linear and the nonlinear approximations using a wide class of measures of error and the same generalized moments of these signals. Further, in the fields of information processing, we sometimes consider the orthonormal development of an image each coefficient of which represents the principal featurr of the image. The selection of the orthonormal bases becomes important in this problem. The Fisher's criterion is a powerful tool for this class of problems called declustering. In this paper, we will make some remarks to the problem of optimizing the Fisher's criterion under the condition that the quality of the approximation is maintained.

This paper discusses the asynchronous and synchronous parallel derivation of languages based on standard formal grammars. Some of the synchronous languages defined in this paper are essentially equivalent to the languages of E0L and EIL systems. Languages with restrictions on the number of parallel derivation steps are difined so that a t-time language is the set of strings w derived in t(w) or less parallel derivatio steps, where t(n) is an integer function. the properties of asynchronous derivation are generally discussed to clarify their conditions so that the derivation results are independent of the order in which productions are applied. It is shown that: (1) Any context sensitive grammar (CSG) G can be transformed into a CSG G such that the language generated by synchronous derivation in G is equal to that generated by asynchronous derivation in G , and vice versa; (2) Any regular language is a log-time context free language (CFL); (3) The class of CFLs is incomparable with that of log-time CSLs; and (4) If there is a bounded cellular automaton recognizing any language L in time T(n), then L is an O(T(n))-time CSL.

To investigate the effect of alkyl chain length and adsorption time on the charge-transfer complex formation, ultraviolet-visible absorption and inelastic electron tunneling (IET) spectroscopy measurements were carried out for the tetramethylphenylenediamine (TMPD; donor molecule) adsorbed dodecyl-, pentadecyl- and octadecyl-tetracyanoquinodimethane (TCNQ) Langmuir-Blodgett (LB) films. In the optical absorption spectra, the main peak of LB films shows a red-shift depending on alkyl chain length and adsorption time. Furthermore, the dependence on alkyl chain length and adsorption time are also shown in the IET spectra. These results demonstrate that adsorption LB methods enable to control the adsorption ratio of functional molecules and the CT complex formation.

An adaptive method analyzing analytic speech signals is proposed in this paper. The method decreases the errors of finite precision on calculation in a method with real coefficients. It is shown from the results of experiments that the proposed method is more useful than adaptive methods with real coefficients.

This paper introduces some modelling methods of time-varying stochastic process and its linear/nonlinear adaptive identification. Time-varying models are often identified by using a least square criterion. However the criterion should assume a time invariant stochastic model and infinite observed data. In order to adjust these serious different assumptions, some windowing techniques are introduced. Although the windows are usually applied to a batch processing of parameter estimates, all adaptive methods should also consider them at difference point of view. In this paper, two typical windowing techniques are explained into adaptive processing. In addition to the use of windows, time-varying stochastic ARMA models are built with these criterions and windows. By using these criterions and models, this paper explains nonlinear parameter estimation and the property of estimation convergence. On these discussions, some approaches are introduced, i.e., sophisticated stochastic modelling and multi-rate processing.

The linear array processor architecture is an important class of interconnection structures that are suitable for VLSI. In this paper we study the problem of mapping a task tree onto a linear array to minimize the total execution time. First, an optimization algorithm is presented for a message scheduling probrem which occurs in the task tree mapping problem. Next, we give a heuristic algorithm for the task tree mapping problem. The algorithm partitions the node set of a task tree into clusters and maps these clusters onto processors. Simulation experiments showed that the proposed algorithm is much more efficient than a conventional algorithm.

Truncated sum (TSUM for short) is useful for MV-PLA's realization. This paper introduces a new class of multiple-valued logic functions that are expressed by truncated sum, differential product (DPRODUCT for short), NOT and variables, where TSUM (x, y)min (xy, p1) and DPRODUCT (x, y)max (xy(p1), 0) is newly defined as the product that is derived by applying De Morgan's laws to TSUM. We call the functions T-functios. First, this paper clarifies that a set of T-functions is not a lattice. It clarifies that Lukasiewicz implication can be expressed by TSUM and NOT. It guarantees that a set of p-valued T-functios is not complete but complete with constants. Next, the speculations of the number of T-functions for less than ten radixes are derived. For eleven or more radix p, a speculation of the number of p-valued T-functions is shown. Moreover, it compares the T-functions with B-functions. The B-functions have been defined as the functions expressed by MAX, MIN, NOT and variables. As a result, it shows that a set of T-functions includes a set of B-functions. Finally, an inclusion relation among these functional sets and normality condition is shown.

Many metrics between trees have been proposed. However, there is no research on a graph metric that can be applied to molecular graphs. And most of the reports on tree metrics have dealt with rooted and ordered trees. As the first step defining a graph metric for molecular graphs, this paper proposes a tree metric between unrooted and unordered trees. This metric is based on a mapping between trees that determines a transformation from one tree to another. The metric is the minimum weight among the weights of all possible transformations. The characteristics of the mapping are investigated. A top-down computing method is proposed using the characteristics of the mapping. The time and space complexities are OT(N 2aN 2b(N 3aN 3b)) and Os(N 2aN 2b), respectively, where Na and Nb are the numbers of vertices of the two trees. If the degrees of all vertices of the trees are bounded by a constant, the time complexity of the method is O (N 3aN 3b). The computing time to obtain the distance between a pair of molecular graphs using a computer (SUN SparcStation ELC) is 0.51 seconds on average for all the pairs of 111 molecular graphs that have 12.0 atoms on average. This methic can be applied to the clustering of molecular graphs.

The data-driven model of computation is well suited for flexible and highly parallel simulation of neural networks. First, the operational semantics of data-driven languages preserve the locality and functionality of neural networks, and naturally describe their inherent parallelism. Second, the asynchronous data-driven execution facilitates the implementation of large and scalable multiprocessor systems, which are necessary to obtain considerable degrees of simulation sppedups. In this paper, we present a dynamic data-driven multiprocessor system, and demonstrate its suitability for the paralel simulation of back propagation neural networks. Two parallel implementations are described and evaluated using an image data compression network. The system is scalable, and as a result, the performance improved proportionally with the increase in number of processors.

When measuring the ejection fraction for the evaluation of the ventricular pumping function by means of the thermodilution technique, the slow response a conventional thermistor has caused it to be considered unsuitable, and fast thermistors have been proposed as an alternative. However, in this paper we propose improving the time-domain response of a conventional thermistor using a signal processing technique composed of a series of first-order high-pass filters which is known as the natural observation system. We considered the rise time of the thermistor in response to a step temperature change to effect correction for the measurement of the ejection fraction. The coefficients of the natural observation system were calculated by minimizing the square error between the step-response signal of the thermistor and the band-limited reference signal. In an experiment using a model ventricle, the thermodilution curve obtained from a conventional thermistor was improved using the proposed technique, thus enabling successful measurement of the ejection fraction of the ventricles.