Research in optical microwave interaction, at its earlier stages, was spured by the desire to make an optically fed and controlled phased array antenna with monolithic microwave integrated circuit (MMIC) transmit/receive (T/R) modules. In the first part of this paper experimental results are presented demonstrating an optically fed phased array antenna operating at C-band in the 5.5 to 5.8 GHz frequency range. The present system consists of two optically fed 14 subarrays with MMIC based active T/R modules. Custom designed fiber optic links have been employed to provide distribution of data and frequency reference signals to phased array antenna. One of the challenges of the future is the development of better interfaces between electronic (microwave) and optical components, including the chip level merging of photonic and electronic components on III-V compounds. This aspect of the research is covered in the second half of the paper.

In this paper, optimal static load balancing in a tree hierarchy network that consists of a set of heterogeneous host computers is considered. It is formulated as a nonlinear optimization problem. We study the effects of the link communication time on the optimal link flow rate (i.e., the rate at which a node forwards jobs to other nodes for remote processing), the optimal node load (i.e., the rate at which jobs are processed at a node), and the optimal mean response time, by parametric analysis. We show that the entire network can be divided into several independent sub-tree networks with respect to the link flow rates and node loads. We find that the communication time of a link has the effects only on the link flow rates and the loads on nodes that are in the same sub-tree network. The increase in the communication time of a link causes the decrease in the link flow rates of its descendant nodes, its ancestor nodes and itself, but causes the increase in the link flow rates of other nodes in the same sub-tree network. It also causes the increase in the loads of its descendant nodes and itself, but causes the decrease in the loads of other nodes in the same sub-tree network. In general, it causes the increase in the mean response time.

An information retrieval system based on a dynamic thesaurus was developed utilizing the connectionist approach. The dynamic thesaurus consists of nodes, which represent each term of a thesaurus, and links, which represent the connections between nodes. Term information that is automatically extracted from user's relevant documents is used to change node weights and generate links. Thus, node weights and links reflect a user's interest. A document retrieval experiment using the dynamic thesaurus was conducted in which both a high recall rate and a high precision rate were achieved.

We analyze the average bit error probability (BER) performances of BPSK with pilot tone in the frequency-selective Rayleigh fading channel, which can be characterized by the delay power spectrum due to multipath fading. The analysis is based on the error probability conditioned on the receiver input envelope in order to investigate the diversity effects. With taking into consideration of predetection receiving filter characteristic, the average BER is evaluated by treating the normalized standard deviation (rms delay spread), τ0/T (T: digital symbol period), of the delay power spectrum, BT product of predetection filter and power distribution between BPSK signal and pilot tone as parameters. The results show that the optimum power distribution (kopt) can be determined mainly according to the ratio (α) of tone extracting filter bandwidth to predetection filter bandwidth provided that α is small. For fixed α, τ0/T and kopt corresponding to α, optimum BT product, which minimizes the error rate, exists and the value is dependent on signal energy per bit to noise power spectral density ratio (SNR), and is affected slightly by the delay power spectrum shapes. In this paper, one-sided exponential, Gaussian and double spike shapes are treated as delay power spectrum shapes. On the average BER characteristics due to delay spread with fixed α, BT and kopt corresponding to α, the delay power spectrum shape is of no importance for τ0/T0.06. For τ0/T0.06, in the case of double spike delay power spectrum, BER is less than that for the other two spectral shapes. By making use of the selection diversity with 2-branch and predetection filter with optimum BT product, SNR can be improved by 16dB at the average BER of 10-4.

This paper proposes fiber optic link configurations for use in microwave and millimeter-wave transmission Higher frequencies,such as millimeter-waves, are well suited to transmission of broadband signals. Photodiodes can operate simultaneously as optical detectors and microwave frequency mixers thanks to their inherent nonlinearities. This allows us to increase the output radio frequncy. But, this also generates undesired spurious frequencies, necessitating the use of microwave filters. We discuss here two fiber optic link configurations, i.e., balanced/image canceling photodiode mixing links utilizing the combination of microwave functional components and optical devices to suppress the local/image frequency without filters. These configurations are experimentally investigated at microwave frequencies and local/image frequency suppression is successfully demonstrated.

We propose a new type of Graph Rewriting Systems (GRS) that provide a theoretical foundation for using the reduction method which plays an important role on analyze network reliability. By introducing this GRS, several facts were obtained as follows: (1) We clarified the reduction methods of network reliability analysis in the theoretical framework of GRS. (2) In the framework of GRS, we clarified the significance of the completeness in the reduction methods. (3) A procedure of recognizing complete systems from only given rewriting rules was shown. Specially the procedure (3) is given by introducing a boundary graph (B-Graph). Finally an application of GRS to network reliability analysis is shown.

In this paper, we will define Kleene-Stone logic functions which are functions F: [0, 1]n[0, 1] including the intuitionistic negation into fuzzy logic functions, and they can easily represent the concepts of necessity and possibility which are important concepts of many-valued logic systems. A set of Kleene-Stone logic functions is one of the models of Kleene-Stone algebra, which is both Kleene algebra and Stone algebra, as same as a set of fuzzy logic functions is one of the models of Kleene algebra. This paper, especially, describes some algebraic properties and representation of Kleene-Stone logic functions.

A field trial was conducted to evaluate the technical performance of land mobile message communication in different environments. The OmniTRACS system and the Ku-band JCSAT satellite were utilized as the mobile communications system and the satellite, respectively. The trial took place in September 1990 at different areas in Japan. Data collected correspond to about 65 hours of operation, during which a large number of messages were sent via the satellite. Two land mobile terminals operated simultaneously, each terminal having a function of generating messages automatically which simulates a large volume of traffic corresponding to about 50 terminals. Thus, the system was evaluated under the condition that 100 mobile terminals were in operation. Obtained data have been analyzed with a particular focus on the message transmission correlating with actual environments. The analysis was done by classifying environments into five categories: overall condition, type of roads, terrain, areas and weather conditions. The average transmission count per message experienced under all conditions is equal to 1.432 for forward messages transmitted from the hub station to mobiles, and 1.157 for return messages transmitted from mobiles to the hub station. With respect to the classification by the type of roads, for enample it becomes obvious that the performance is generally good except along roads of North-South orientation through dense urban areas. It is concluded that the message communications from/to mobiles are feasible in a wide range of environments, with the performance of success essentially depending on the visibility of satellite.

In general, the work on developing an expert system has relied on domain experts to provide all domain-specific knowledge. The method for acquiring knowledge directly from experts is inadequate in oriental medicine because it is hard to find an appropriate expert and the development cost becomes too high. Therefore, we have developed two effective methods for acquiring knowledge indirectly from sample cases. One is to refine a constructed knowledge base by using sample cases. The other is to train a neural network by using sample cases. To demonstrate the effectiveness of our methods, we have implemented two prototype systems; the Oriental Medicine Expert System (OMES) and the Oriental Medicine Neural Network (OMNN). These systems have been compared with the system with the knowledge base built directly by domain experts (OLDS). Among these systems, OMES are considered to be superior to other systems in terms of performances, development costs, and practicalness. In this paper, we present our methods, and describe our experimental and comparison results.

Kleene-Stone algebra is both Kleene algebra and Stone algebra. The set of Kleene-Stone logic functions discussed in this paper is one of the models of Kleene-Stone algebra, and they can easily represent the concepts of necessity and possibility which are important concepts for many-valued logic systems. Main results of this paper are that the followings are clarified: a necessary and sufficient condition for a function to be a Kleene-Stone logic function and a formula representing the number of n-variable Kleene-Stone logic functions.

This paper proposes a new speaker adaptation method using a speaker weighting technique for multiple reference speaker training of a hidden Markov model (HMM). The proposed method considers the similarities between an input speaker and multiple reference speakers, and use the similarities to control the influence of the reference speakers upon HMM. The evaluation experiments were carried out through the/b, d, g, m, n, N/phoneme recognition task using 8 speakers. Average recognition rates were 68.0%, 66.4%, and 65.6% respectively for three test sets which have different speech styles. These were 4.8%, 8.8%, and 10.5% higher than the rates of the spectrum mapping method, and also 1.6%, 6.7%, and 8.2% higher than the rates of the multiple reference speaker training, the supplemented HMM. The evaluation experiments clarified the effectiveness of the proposed method.

A new type of analog-to-digital (A/D) converter is introduced. The structure is based on a magnitude-preserving quadrature mirror filter (QMF) bank where the analysis bank is composed on IIR switched-capacitor (SC) filters. The analog output samples of the analysis filters are converted into digital form using individual A/D converters and combined by an IIR digital filter synthesis filter bank. This A/D converter is useful in applications where only the magnitude of the spectrum of the analog signal needs to be preserved. The structure incorporates the advantages of sub-band coding and reduces considerably the effect of mismatches among the sub-band A/D converters. In addition, the proposed scheme leads to an increase in the conversion speed by a factor of M when an M-channel QMF bank is used. An illustrative example verifying the good performance of the proposed approach is included.

In this paper, the effects of the grouping and the addressing methods on the accuracy and the response time in a visual search task were investigated. Four grouping conditions (4, 8, 16 and 32 groups) and four addressing methods (random, ordered, cartesian and polar) were selected in the experiment. For each combination of grouping and addressing methods, subjects repeated the search task 30 times. No remarkable differences of the percent correct were observed both among the levels of grouping and among the addressing methods. The mean response time increased with the increase of the number of groups. Moreover, the interaction between addressing methods and grouping for both percent correct and response time was clarified.

The performance of a traveling wave Mach-Zehnder external optical modulator (EOM) mixer is described and compared with a conventional diode mixer's performance. Additionally, by incorporating external circuitry, the EOM mixer can provide single sideband suppression in addition to the inherent local oscillator suppression. The basic frequency mixing function of the EOM mixer is first described theoretically and then extended to the sideband suppression case. The performance of both configurations is also presented. Achievable electrical isolation between LO (carrier) and RF (upconverted data signal at LOIF) frequencies is greater than 95 dB and total link conversion loss is 37 dB in this demonstration with a laser diode source. Sideband suppression of greater than 43 dB with respect to the desired sideband at the photodetector output is achieved.

This letter describes the concepts that the learnability of multilayer neural networks exists in a constrained hypersurface in learning space which is formed by input and output subspace of multilayer neural networks, and that a priori information, providing constraints on the learning space, is required for generalization.

This paper describes a new supervised speaker adaptation method based on vector field smoothing, for small size adaptation data. This method assumes that the correspondence of feature vectors between speakers can be viewed as a kind of smooth vector field, and interpolation and smoothing of the correspondence are introduced into the adaptation process for higher adaptation performance with small size data. The proposed adaptation method was applied to discrete HMM based speech recognition and evaluated in Japanese phoneme and phrase recognition experiments. Using 10 words as the adaptation data, the proposed method produced almost the same results as the conventional codebook mapping method with 25 words. These experiments clearly comfirmed the effectiveness of the proposed method.

In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.

This paper describes the linguistic procedure of our speech dialogue system. The procedure is composed of two processes, syntactic analysis using a finite state network, and discourse analysis using a plan recognition model. The finite state network is compiled from regular grammar. The regular grammar is described in order to accept sentences with various styles, for example ellipsis and inversion. The regular grammar is automatically generated from the skeleton of the grammar. The discourse analysis module understands the utterance, generates the next question for users and also predicts words which will be in the next utterance. For an extension number guidance task, we obtained correct recognition results for 93% of input sentences without word prediction and for 98% if prediction results include proper words.

In this paper, we investigate the round complexity of zero-knowledge interactive proof systems of possession of knowledge, and mainly show that if a relation R has a three move blackbox simulation zero-knowledge interactive proof system of possession of knowledge, then there exists a probabilistic polynomial time algorithm that on input x{0,1}*, outputs y such that (x,y)R with overwhelming probability if xdom R, and outputs "" with probability 1 if x dom R. The result above can not be generalized to zero-knowledge interactive proof systems of possession of knowledge with more than four moves, because it is known that there exists a "four" move blackbox simulation perfect zero-knowledge interactive proof system of possession of knowledge for a nontrivial relation R.

We show that, if NP language L has an invulnerable generator and if L has an honest verifier standard statistical ZKIP, then L has a 5 move statistical ZKIP. Our class of languages involves random self reducible languages because they have standard perfect ZKIPs. We show another class of languages (class K) which have standard perfect ZKIPs. Blum numbers and a set of graphs with odd automorphism belong to this class. Therefore, languages in class K have 5 move statistical ZKIPs if they have invulnerable generators.