First, in this paper, a new type of interactive optimization method for multiobjective optimization problems is suggested. The method is made up with the calculation phase to generate a tradeoff curve from the Pareto optimal solution set and the decision phase to choose a preferable point on the curve. And these phases are alternated each other and a final preference solution is found eventually. Next, the method is applied to an optimal control problem of multipurpose dam where the storage water can be supplied for five use purposes, i.e. hydroglectric power generation, industrial, agricultural, municipal and adjustment water. The application results are compared with some specific cases and the effectiveness of the method is proved.

This paper gives an analytical method to determine the existence of the long period mode which is the most typical rhythmic activity in reciprocal inhibition networks. The network is assumed to have a considerable odd number of neurons in a ring structure of a linear array. In the long period mode, each cell has the active and the quiescent phases. A number of firings are seen at the constant interval in the active phase, while the firings are inhibited in the quiescent phase. It is shown that there exist many firing patterns in this mode, and that the period length of the rhythmic activities is different depending on the number of firings in the active phases. The upper bound of the period length increases with the increase of the number of cells. Since various firing patterns are possible to occur under identical input and structure parameters, occurrence of each firing pattern of the long period mode has to be determined by a suitable selection of initial conditions of the network. Relations between the firing patterns and the initial conditions are studied in terms of phase transition delay time.

Frequency characteristics of SAW tapped delay lines (TDL's) with equal tap spacing and in-line array are investigated. It is found that reflected SAW echo signals in SAW TLD's cause pulse-like ripples and sharp stopband distortions periodically in the frequency passbands. Tapping design techniques are proposed to remove spurious interference distortion influences on SAW TDL frequency responses. Their applicability is confirmed experimentally. Typical features of a SAW TDL with 101 taps at a 20 MHz bit rate employing 128 rotated Y-cut and X-propagation LiNbO3 substrate are as follows: center frequency is 55.4 MHz, frequency bandwidth is 10 MHz, insertion losses are 3239 dB, and ripples in the passband are about 4 dB.

The transient characteristics of the delay time of a signal are analyzed in detail in the time-varying cases of the continuously variable delay devices, whose delay time can be varied by a control signal. A supposed delay time which corresponds directly to the instantaneous control signal is defined as an instantaneous delay time (t) to make clear the essential function of the variable delay devices. In such devices, first (t) is converted into the actual delay time τ(t) and then the amplitude and frequency of the input signal (only the frequency in case of CCDs) are modulated by a modulating signal, -. Although the /τ conversion is essentially nonlinear, τ(t) is basically a lowpass-filtered version of (t) and hence τ(t) is nearly equal to (t) only if (t) is a slowly varying function of time. 1 generally holds and any τ(t) satisfying this constraint can be realized in the variable delay devices. Such time-variation of the delay time causes the time-axis transformation (time-axis compression and expansion), which is one of the very useful applications in the signal processing. It is shown that any time-axis transformation and its inverse transformation can be performed in principle by the variable delay devices. Finally, fundamental experiments on the time-axis transformation and its inverse transformation are carried out by using CCDs as the variable delay devices and the major theoretical results are varified experimentally.

A floating gate tapped CCD with 32 taps for programmable transversal filter applications is presented. A 32-tap minimum phase lowpass filter designed and implemented on this device is discussed in detail. A novel design procedure of this filter is also explained.

In this paper we extend Pratt's dynamic logic so as to treat assignment statements concerning Pascal-like pointers and records. We present backward transformation rules for these statements and give the formal justification of the rules by extending Pratt's program-semantics. Properties of programs which manipulate more complex data structures composed of pointers and records (e.g., linked stacks, queues, trees, etc.) can be described in our logic. We prove as an example a partial correctness assertion of a program which treats a linked stack.

This paper considers behaviors of first and second order phase-locked loops (PLLs) and delay-locked loops (DLLs) in the presence of interfering signals. In the first part sufficient asynchronous conditions of the PLL with a rectangular signal and of the DLL with a pseudo random signal in the presence of the interfering signals are obtained using a simplified method devised by the author. Fluctuation of phase difference between signal and output of voltage controlled oscillator caused by the interfering signal is also analyzed by the method in the second part. By this method one can compare the interfering effects on several types of signals and get informations about the selection of appropriate signals.

Bipartite representations of permutations are introduced, and the relation between the representations and the actions of permutation networks devised by Waksman et al is investigated. As an example of the application of the bipartite representations, a lucid algorithm for setting-up a permutation network to produce a given permutation is shown. An algorithm for counting the number of configurations of the network that produce a given permutation is derived. The computing time complexity of the algorithm by a random access machine is O (2N/2+O(log2N)).

A two-phase phase-shift-keyed modulator is realized utilizing a SAW delay line and diode switching circuits. Fundamental performances of the device were clarified experimentally and theoretically.

In this paper we show an effective algorithm for automatically constructing a simple acceptor (a modified finite state automaton) of line-segments. The algorithm was successfully applied to the hand-written English alphabet and to the randomly generated line-segments.

A step-by-step approach to the fabrication and analysis of a p-MOS inverter circuit using poly-Si self-aligned gates outlines a possible experimental course in MOS technology, suitable to run concurrently with the lecture course on semiconductor integrated circuits. The fabrication process which uses oxidation, diffusion and evaporation techniques and two photolithographic process can usually be performed in four afternoon experimental sessions. The capital outlay and actual running cost of the course are modest enough to open almost any engineering department to MOS technology. The basic concepts of the p-n junction, MOS diode, MOS transistor and inverter operation are fully illustrated in the inverter circuit presented.

Two expressions including the variance and the correlation coefficient between the level-crossing interval lengths of a stationary random process are derived. If the random process is Gaussian, one can estimate to some extent the correlation between level-crossing intervals. For the Gaussian process having low-pass or band-pass spectra of the seventh-order Butterworth type, the variance and the correlation coefficient are experimentally determined. The level-crossing intervals are found to be mutually dependent in most cases except low-pass spectrum.

As previously reported, we derived the matrix equation which describes mode-coupling phenomena in multimode optical fibers. This paper examines the accuracy of its numerical solution because we contrived this equation as a numerical method.

In this letter, we propose a distributed memory system and develope a procedure for memorizing and recalling excessive numerical data in the system. It is shown that this type of memory can be applied to a flexible and reliable memory systems.

This paper describes a novel theory analysing the baseband transfer function of mode-coupled multi-mode optical fiber. The treatment of this method is based on the scattering matrix. This theory is direct, correct and self-consistent. Most transmission characteristics of the multimode optical fiber can be analyzed.

The present paper deals with the Richards' transformation which converts a multi-variable positive (real) function to another multi-variable positive (real) function. This transformation is based on the fact that the network function reduces to a constant for all zeros of an irreducible polynomial h (p1, p2, , pn) (1degpi h). And its application to the cascade synthesis or the Bott-Duffin type synthesis of a class of multi-variable driving-point impedances, is discussed. Finally, we present the corresponding transformation for the multi-variable positive (real) matrices.

In Codd's relational data model, several dependencies have been introduced to specify the intensional properties of a relation. Fagin and independently, Zaniolo introduced the notion of a multivalued dependency (MVD). The definition of MVD's refers to an underlying set of attributes of a relation. The embedded multivalued dependency (EMVD), which is also introduced by Fagin, is an MVD that holds for a projection of an original relation on the subset of attributes of the relation. The properties of EMVD's are not well known although EMVD's play an important role in designing relation schemata by Fagin's decomposition approach. Our study in this paper is motivated from the following problems: (a) Since the validity of an MVD depends on an underlying set of attributes, it is not so easy to specify valid" MVD's for a relation with many attributes. (b) There has not been a useful tool to analyze whether or not a set of relation schemata obtained by Fagin's decomposition approach can represent the same data and the same dependencies of an initial relation schema. Our standpoint is to handle these problems by studying the properties of EMVD's. The main results of this paper are the following: (1) A basic theorem about the interaction between MVD's and EMVD's is provided. Several useful inference rules for MVD's and EMVD's are derived from this theorem. (2) A marked Hasse diagram called a dependency diagram is introduced to investigate the interections between MVD's and EMVD's. (3) We provide some conditions for an MVD or a set of MVD's to be invariant under the addition or deletion of attributes. (4) Some useful equivalence relationships between two dependency sets including MVD's and EMVD's are provided. We also provide some conditions to represent a given dependency set in a reduced form.

We give a simple formula which represents the relationship between incident matrices of two transformation semigroups X and Y and the incident matrix of their wreath product X Y. The structure generating function of the wreath product can be easily obtained by using this incident matrix.

In this paper, multi-head and finite-state transducers are proposed, and their computing abilities of number-theoretic functions are investigated. A multi-head transducer is an automaton which maps a unary input into a unary output using a finite number of input heads. A finite-state transduccer is one with single input head. First, it is shown that a two-way finite-state transducer is strictly more powerful than a one-way finite-state transducer, but a two-way finite-state transducer can be simulated by a two-scan finite-state transducer. As for the multi-head transducer, the following results are derived. The upper bound of increasing degree of functions computed by two-way multi-head transducers varies with the number of input heads. However, a two-way two-head transducer can compute an arbitrarily slowly increasing monotone total recursive function, so that there exists no lower bound of increasing degree of a function computed by it. Although the class of two-way multi-head transducers forms an infinite hierarchy of computing abilities with respect to the number of input heads, it is shown that a one-way multi-head transducer is equivalent to a two-way finite-state transducer provided that the number of input heads is more than one.

An analog voice scrambling method Sample Inversion" is presented along with several experimental results. The Sample Inversion" principle is to invert the voice sample polarity according to the key code, smooth it with low pass filter and feed it to the transmission channel. Necessary techniques to utilize the principle, filtering and synchronizing are described. Key code design is examined and an error correcting code is proposed appropriate to the key code. Experimental equipment is assembled to prove the principle. Using the same equipment, spectrum variation is demonstrated and articulation by voice scrambling is measured. The Sample Inversion" method can be realized by circuits assembled with conventional parts. Sample Inversion" provides natural voice to the properly keyed-in receiver and assures that the conversation is completely unintelligible to any other receivers. Lack of voice quality sensitivity to noise is also to be emphasised.