This paper describes the future perspective of automatic telephone interpretation using a multimedia intelligent communication network. The need for language interpretation over a telecommunication system creates a strong drive toward integrating information modalities for voice, image, data, computation and conferencing into modern systems using the capability of language interpretation. An automatic telephone interpretation system will solve the problems of language differences in international human-to-human communication. The future prospective of advanced multimedia language communication will be stated as the versatile application of an integrated intelligent network.

Transmittance distribution along a horizontal line in LCDs addressed by amorphous silicon TFTs was investigated using measurements and calculations. Nonuniformity of the distribution, in which the transmittance increased with increasing distance from the left edge of the LCD, was observed in a 10 inch diagonal TFT-LCD. The cause of the nonuniformity was attributed to the decrease in voltage drop due to the gate source parasitic capacitance and the increase in gate voltage fall time due to large line resistance, based on the measurements of voltage drops in TFT test elements and calculations considering the decrease in voltage drop. The distribution could be improved by reducing the line resistance and parasitic capacitance in the actual LCD.

This paper investigates the performance of the line spectrum pair (LSP) frequency parameter representation for speech recognition. Transitional parameters of LSP frequencies are defined using first-order regression coefficients. The transitional and the instantaneous frequency parameters are linearly combined to generate a single feature vector used for recognition. The performance of the single vector is compared with that of the cepstral coefficients (CC) representation using a minimumdistance classifier in speaker-independent isolated word recognition experiments. In the speech recognition experiments, the transitional and the instantaneous coefficients are also combined in the distance domain. Also, inverse variance weighted Euclidean measures are defined using LSP frequencies to achieve Mel-scale-like warping and the new warped-frequencies are used in recognition experiments. The performance of the single feature vector defined with transitional and instantaneous LSP frequencies is found to be the best among the measures used in the experiments.

Circuit complexity of a Boolean function is defined to be the minimum number of gates in circuits computing the function. In general, the circuit complexity is established by deriving two types of bounds on the complexity. On one hand, an upper bound is derived by showing a circuit, of the size given by the bound, to compute a function. On the other hand, a lower bound is established by proving that a function can not be computed by any circuit of the size. There has been much success in obtaining good upper bounds, while in spite of much efforts few progress has been made toward establishing strong lower bounds. In this paper, after surveying general results concerning circuit complexity for Boolean functions, we explain recent results about lower bounds, focusing on the method of approximation.

A maximal l-diameter tree cover of a graph G(V,E) is a spanning subgraph C(V,EC) of G such that each connected component of C is a tree, C contains no path with more than l edges, and adding any edge in EEC to C yields either a path of length l1 or a cycle. For every function f from positive integers to positive integers, the maximal f-diameter tree cover prolem (MDTC(f) problem for short) is to find a maximal f(n)-diameter tree cover of G, given an n-node graph G. In this paper, we give two parallel algorithms for the MDTC(f) problem. The first algorithm can be implemented in time O(TMSP(n,f(n))log2n) using polynomial number of processors on an EREW PRAM, where TMSP(n,f(n) is the time needed to find a maximal set of vertex disjoint paths of length f(n) in a given n-node graph using polynomial number of processors on an EREW PRAM. We then show that if suitable restrictions are imposed on the input graph and/or on the magnitude of f, then TMSP(n,f(n))O(logkn) for some constant k and thus, for such cases, we obtain an NC algorithm for the MDTC(f) problem. The second algorithm runs in time O(n log2n/{f(n)1}) using polynomial number of processors on an EREW PRAM. Thus if f(n)Ω(n/logkn) for some kO, we obtain an NC algorithm for the MDTC(f) problem.

We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t1 and t2 any of these schemes can broadcast information within any consecutive logt+1N2 rounds, and for an arbitrary t they can broadcast information within any consecutive logt+1N3 rounds.

There have been several studies related to a reduction of the amount of computational resources used by Turing machines. As consequences, Linear speed-up theorem", tape compression theorem" and reversal reduction theorem" have been obtained. In this paper, we discuss a leaf reduction theorem on alternating Turing machines. Recently, the result that one can reduce the number of leaves by a constant factor without increasing the space complexity was shown for space- and leaf-bounded alternating Turing machines. We show that for time- and leaf-bounded alternating Turing machines, the number of leaves can be reduced by a constant factor without increasing time used by the machine. Therefore, our result says that a constant factor on the leaf complexity does not affect the power of time- and leaf-bounded alternating Turing machines.

The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)X(n)/(X(1))n both for the second (n2) and third-order (n3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.

The VSTEP concept and its practical application in the form of an LED-type pnpn-VSTEP demonstrating low power consumption through electro-photonic operational modes are both shown. Further, with focus primarily on the new laser-mode VSTEP with high-intensity light output and narrow optical beam divergence, the design features such as threshold gain and optical absorptivity, device fabrication, and characteristics are explained. The possibility of ultimate performance based mainly on electrical to optical power conversion efficiency, important from the application viewpoint of optical interconnection, are also discussed. Also, as two examples of functional optical interconnection achieved by VSTEP, serial-to-parallel data conversion and optical self-routing switches are shown. Finally, future opto-electronic technologies to be developed for two-dimensionally integrable surface-type optical semiconductor devices, including the VSTEP, are discussed.

In this paper we review the recent progress and basic technology of vertical cavity surface emitting lasers together with related parallel surface operating optical devices. First, the concept of surface emitting lasers is presented, and then currently developed device technologies will be reviewed. We will feature several technical issues, such as multi-layer structures, 2-dimensional arrays, photonic integration, etc. Lastly, future prospects for parallel lightwave systems will be discussed.

We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.

We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.

The nonlinear optical properties of organics with unsaturated bonds were compared with those of inorganics including semiconductors and dielectrics. Because of the mesomeric effect, namely quantum mechanical resonance effect among configurations, aromatic molecules and polymers have larger optical nonlinear parameters defined as δ(n)=X(n)/(X(l))n both for the second (n=2) and third-order (n=3) nonlinearities. Experimental results of ultrafast nonlinear response of conjugated polymers, especially polydiacetylenes, were described and a model is proposed to explain the relaxation processes of photoexcitations in the conjugated polymers. Applying the model constructed on the basis of the extensive experimental study, we propose model polymers to obtain ultrafast resonant optical nonlinearity.

In this letter we study the wave propagation in a diode-equipped microstrip line and show that soliton generation at microwave frequencies is possible with monolithic fabrications of such nonlinear transmission lines. We propose that this phenomenon be utilized as a new method of obtaining ultrashort electrical pulses with picosecond durations. The perdicted soliton generation has been confirmed by computer simulations based on the harmonic balance method.

We review the role of optics in interconnects, analog processing, neural networks, and digital computing. The properties of low interference, massively parallel interconnections, and very high data rates promise extremely high performance for optical information processing systems.

A chordal ring network is a processor network on which n processors are arranged to a ring with additional chords. We study a distributed leader election algorithm on chordal ring networks and present trade-offs between the message complexity and the number of chords at each processor and between the message complexity and the length of chords as follows:For every d(1dlog* n1) there exists a chordal ring network with d chords at each processor on which the message complexity for leader election is O(n(log(d1)nlog* n)).For every d(1dlog* n1) there exists a chordal ring network with log(d1)nd1 chords at each processor on which the message complexity for leader election is O(dn).For every m(2mn/2) there exists a chordal ring network whose chords have at most length m such that the message complexity for leader election is O((n/m)log n).

Electromagnetic interference on a bus wiring configuration of the ISDN basic interface using metallic telecommunication lines is studied. A simple circuit to simulate terminal equipment unbalance about earth is developed for measurement purposes, based on the fact that the unbalance weakens the withstanding capability against interference. The electromagnetic interferences from low-voltage supply lines, analog telephone lines and broadcasting waves are evaluated by experiments using the circuit. The interference is measured by both induced voltage on the interface line and the error rate of the transmission signal line. Consequently, it is clarified that the basic interface is disturbed by the induced voltage, because the terminal equipment in the CCITT Recommendation I.430 has too large an unbalance about earth to maintain transmission quality. Adding to this, countermeasures to reduce interference are proposed.

We propose Polarization-Shift-Keying (POLSK) homodyne system using phase-diversity receivers and theoretically analyze its bit-error-rate (BER) performance. Since the proposed system uses polarization modulation and homodyne detection, it can cancel the phase noise and is attractive at a high bit-rate transmission. It is found that the receiver sensitivity of the proposed POLSK homodyne system is the same as that of POLSK heterodyne system and is much better than that of DPSK phase-diversity homodyne systems at high signal-to-noise ratio (SNR). We also cosider theoreically the effect of the fluctuation of state of polarization (SOP) on the BER performance of POLSK homodyne system.

This paper proposes a new construction of the minimum knowledge undeniable signature scheme which solves a problem inherent in Chaum's scheme. We formulate a new proof system, the minimum knowledge interactive bi-proof system, and a pair of languages, the common witness problem, based on the random self-reducible problem. We show that any common witness problem has the minimum knowledge interactive bi-proof system. A practical construction for undeniable signature schemes is proposed based on such a proof system. These schemes provide signature confirmation and disavowal with the same protocol (or at the same time).

A fast Viterbi decoding technique with path reduction in optical channels is presented. This decoding exploits the asymmetric characteristic of optical channels. In the decoding trellis, the branches with low or no possibility being correct path are eliminated based on the detected signal level. The number of Add-Compare-Select (ACS) operations which occupy the dominant part of Viterbi decoding is considerably reduced due to branch eliminations, and fast decoding is realized by decoding asynchronously to received sequence. The reduction of the number of ACS operations is derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced compared with the conventional Viterbi decoding. The bit error probability of the proposed decoding is derived for noiseless photon counting channel. It is also shown that the decoding technique can be applied to the cases using avalanche photo diode (APD) based receiver with dark current noise at a cost of negligible degradation on the bit error probability.