Feasibility of 20 Gbit/s single channel transoceanic soliton transmission systems with a simple EDFA repeaters configuration has been studied. Both a simple and versatile soliton pulse generator and a polarization insensitive optical demultiplexer, which can provide a almost square shape optical gate with duration of full bit time period, have been proposed and demonstrated by using sinusoidally modulated electroabsorption modulators. The optical time-division multiplexing/demultiplexing scheme using the optical demultiplexer results in drastic improvement of bit error rate characteristics. We have experimentally confirmed that the use of alternating-amplitude solitons is an efficient way to mitigate not only soliton-soliton interaction but also Gordon-Haus timing jitter constraints in multi-ten Gbit/s soliton transmission. Timing jitter reduction using relatively wide band optical filter bas been investigated in 20 Gbit/s loop experiments and single-carrier, single-polarization 20 Gbit/s soliton data transmission over 11500 km with bit error rate of below 10-9 has been experimentally demonstrated, using the modulator-based soliton source, the optical demultiplexer, the alternation-amplitude solitons, and wide-band optical filters. Obtained 230 Tbit/skm transmission capacity shows the feasibility of 20 Gbit/s single channel soliton transoceanic systems using fully practical technologies.

We describe an application of InGaAs/AlGaAs VCSELs to multiple wavelength light source for optical interconnection. A flip-chip bonding technique is used to integrate the VCSELs lasing at different wavelengths. The integrated VCSELs of different wavelengths are individually grown and processed, so that one can optimize the device characteristics and the wavelength separation or distribution for multiple wavelength interconnection systems. A 9-wavelength VCSEL array with a wavelength separation of 5 nm has been successfully fabricated.

The polarization dependence of femtosecond soliton-soliton interactions is investigated in detail. When the polarization direction of two solitons is orthogonal, the soliton interaction can be reduced in comparison to that for parallel polarization. The soliton self-frequency shift (SSFS) is still observed even in the orthogonal condition, but the quantity of the SSFS is much smaller than in the parallel condition. A stronger soliton interaction is observed between two solitons in an in-phase condition, than in an out-of-phase condition. The largest SSFS occurs in-phase with parallel polarization. The polarization dependence of femtosecond soliton interaction in a distributed erbium-doped fiber amplifier (DEDFA) is also investigated. It is shown that when the optical gain of the DEDFA is given adiabatically, the input pulse separation at which the first soliton occurs is less with orthogonal polarization. This is because the soliton pulse width is reduced due to the adiabatic soliton narrowing caused by the optical amplification.

Ultrashort pulsed-beam propagation in a Kerr-type bulk medium is studied theoretically through classical and quantum field solutions of a higher-order nonlinear Schrödinger equation, which is valid for transversely localized femtosecond pulses in an anomalous dispersion regime. Quantum-mechanical stability analysis via a Hartree approximation to interacting bosons shows that within a certain range of a parameter the solitary wave could be stabilized even in the three-dimensional transverse space-time. This feature admits of an exotic route to multidimensional solitons.

While Electro-Optic (E-O) sampling has achived the electric signal measurement with advantages of noninvasive, noncontact and ultrafast time resolution, it is unsuitable for measuring long logic patterns in fast ICs under the functional test conditions. To overcome this problem, a real time E-O probing using a continuous wave (CW) diode laser and a fast photodetector has been developed. By adopting a ZnTe E-O probe having a half-wave voltage of 3.6 kV, shot noise limited measurement with a frequency bandwidth of 480 MHz has been achieved using a low noise diode laser (wavelength of 780 nm, output power of 30 mW), a pin photodiode, a wideband low noise amplifier, and a digital oscilloscope having 500 MHz bandwidth as a waveform analyzer. The minimum detectable voltage was 23 mV under 700 times integration. In this paper, discussion of the voltage sensitivity of real time E-O probing is included. Key parameters for attaining the highly sensitive real time E-O probing are the sensitivity of the E-O probe and noises of the probing light and detection system.

Memory type polymer dispersed liquid crystal (PDLC) can be applied to a thermal addressing display device cell. Making use of its easy fabrication of large area display using flexible film substrate, the PDLC film can be used as reusable paper for direct-view mode display. In this study, memory type PDLC cells are prepared with an aluminum reflector deposited onto one side of the substrate and the reflection property in the PDLC cell with the reflector is clarified and compared to that without the reflector in the off-, on- and memory-states. The increase of contrast ratio and the decrease of driving voltage can be concurrently realized by decreasing the cell thickness by attaching the reflector. In addition, the reflected light in the off-state is bright and colorless due to the reflector, as compared with the weak, bluish reflected light in the cell without the reflector. Reflected light in the on-state and the memory-state are tinged with blue.

We exactly determine the number of negations needed to compute the parity functions and the complement of the parity functions. We show that with k NOT gates, parity can be computed on at most 2k+11 variables, and parity complement on at most 2k+12 variables. The two bounds are shown to be tight.

Graph unification is doubtlessly the most expensive process in unification-based grammar parsing since it takes the vast majority of the total parsing time of natural language sentences. A parsing time overload in unification consists in that, in general, no less than 60% of the graph unifications performed actually fail. Thus one way to achieve unification time speed-up is focusing on an efficient, fast way to deal with such unification failures. In this paper, a process, prior to unification itself, capable of filtering or stopping a considerably high percentage of graphs that would fail unification is proposed. This unification-filtering process consists of comparison of signatures that correspond to each one of the graphs to be unified. Unification-filter (hereafter UF) is capable of stopping around 87% of the non-unifiable graphs before unification itself takes place. UF takes significantly less time to detect graphs that do not unify and discard them than it would take to unification to fail the attempt to unify the same graphs. As a result of using UF, unification is performed in an around 71% of the time for the fastest known unification algorithm.

Self-modelocking of Ti:sapphire laser has obtained with less than 2 W of argon-ion laser pumping. Two independent lasers with 36 fsec and 63 fsec in pulse duration were operated by a 6 W pump laser. In the low-threshold lasers, not only an ordinary mode-locking but also a double-pulse mode-locking, where two pulses circulating in the cavity, was stable.

For two finite disjoint sets P and Q of strings over an alphabet Σ, an alphabet indexing for P, Q by an indexing alphabet Γ with |Γ||Σ| is a mapping :ΣΓ satisfying (P)(Q), where :Σ*Γ* is the homomorphism derived from . We defined this notion through experiments of knowledge acquisition from amino acid sequences of proteins by learning algorithms. This paper analyzes the complexity of finding an alphabet indexing. We first show that the problem is NP-complete. Then we give a local search algorithm for this problem and show a result on PLS-completeness.

This paper discusses sign word segmentation methods and extraction of motion features for sign language recognition. Because Japanese sign language grammar has not yet been systematized and because sign language does not have prepositions, it is more difficult to use grammar and meaning information in sign language recognition than in speech recognition. Segmentation significantly improves recognition efficiency, so we propose a method of dividing sign language based on rests and on the envelope and minimum of motion speed. The sign unit corresponding to a sign word is detected based on the divided position using such features as the change of hand shape. Experiments confirmed the validity of word segmentation of sign language based on the temporal structure of motion.

Exploiting the full potential of a multiprocessor system requires a good job scheduling algorithm. In this paper we analyze three dynamic job scheduling algorithms in multiprocessor systems. These algorithms are based on static job scheduling algorithms, LPT (longest processing time first), SJF (shortest job first), and LPR (largest processor requirement first), each of which exhibits good performance in terms of asymptotic upper bound on the makespan of the schedule generated by it. We analyze their performance in the dynamic case experimentally, where we have a stochastic stream of jobs with arbitrary processing time and processor requirement. We compare their performance with the FCFS algorithm and its simple extension. Except for LPT, the algorithms are found to perform significantly better than FCFS, while among themselves SJF performs the best, followed by K-LPR, a variation of LPR. We also consider the fairness aspect of these algorithms and propose a general technique to impose fairness on these algorithms. Finally, we analyze the impact of imposing fairness on the performance of these algorithms.

A filter-type coplanar parallel electrode with periodically loaded reactances is introduced to construct guided-wave light modulators of limited bandwidth. The device was built by using a Ti:LiNbO3 optical waveguide and was operated successfully at 633 nm. Measured 3 dB bandwidth was 1 GHz centered at 14.8 GHz. Required modulating power for 1 rad phase modulation was 67.6 mW.

A near-ring is an extended notion of a usual ring. Therefore a ring is a near-ring, but the converse does not necessarily hold. We investigate in this paper one-way functions associated with finite near-rings, and show that if there exists a one-way group homomorphism, there exists a one-way non-ring near-ring homomorphism (Theorem 1); if there exists a one-way ring homomorphism (Theorem 2). Further, we introduce a discrete logarithm problem over a finite near-ring, and show that the integer factoring is probabilistic polynomial-time Turing equivalent to a modified version of this problem (Theorem 3). Theorem 1 implies that under some standard cryptographic assumption, there is an affirmative but trivial solution to the extended version of the open question: Is there an encryption function f such that both f(x+y) and f(xy) are efficiently computed from given f(x) and f(y) ?

We have fabricated a new analog memory with a floating gate as a key component to store synaptic weights for integrated artificial neural networks. The new analog memory comprises a tunnel junction (poly-Si/poly-si oxide/poly-Si sandwich structure), a thin-film transistor, two capacitors, and a floating gate MOSFET. The diffusion of the charges injected through the tunnel junction is controlled by switching operation of the thin-film transistor, and we refer to the new analog memory as switched diffusion analog memory (SDAM). The obtained characteristics of SDAM are a fast switching speed and an improved linearity between the potential of the floating gate and the number of pulse inputs. SDAM can be used in a neural network in which write/erase and read operations are performed simultaneously.

We measured the longitudinal electric field of the electrical pulses with a rise time less than 1 ps on a coplanar transmission line by electrooptic sampling. The longitudinal component is a sharp pulse and is only observed at the wavefront. The transverse component has no overshoot or undershoot. The mixing of longitudinal component to the transverse component is discussed for C3v crystals whose electrooptic coefficient is large. We developed the method to estimate the longitudinal and the transverse component of the electric field by the polarization control of a probe light without changing the probe configuration which affects sensitivity severely. The waveform and the rise time of the transverse electric field were eatimated, for the first time, by subtracting the influence of the longitudinal component.

This paper proposes that a combination of pre-chirping and dispersion compensation is effective in suppressing the waveform distortion due to the self-phase modulation and the group-velocity dispersion in 10 Gb/s repeaterless transmission using 1.3-µm zero-dispersion single-mode fibers (SMF) operating at a wavelength of 1.55µm. The following results were obtained through simulation. 1) Setting the α-parameter of a LiNbO3 optical modulator negative (α1.0) gives a large tolerance of the launched power Pin. 2) For 90-km SMF transmission, the maximum Pin is obtained when the dispersion compensation ratio β is from 50% to 70%. 3) For the allowable β as a function of the transmission distance when a dispersion compensator is located in the receiver (post-compensation scheme), the lower limit of β is determined by the constant residual dispersion value, which agrees well with the dispersion tolerance without dispersion compensation. Our 90-km SMF transmission experiments using a LiNbO3 optical modulator and a dispersion compensating fiber (DCF) confirmed the simulation results regarding the optimum value of β and the large tolerance of the fiber launched power. Based on the above investigations, we achieved a 10-Gb/s repeaterless 140-km SMF transmission with α1.0 and post-compensation.

We introduce the interval set of a graph G which is a representation of the proper-path-decomposition of G, and show a linear time algorithm to construct an optimal interval set for any tree T. It is shown that a proper-path-decomposition of T with optimal width can be obtained from an optimal interval set of T in O(n log n) time.

This paper describes a new algorithm for calculating exact statistics on directional data and its application to pattern processing. Although information about directional characteristics is practically useful in image processing, e.g. texture analysis or color segmentation, dominant information is not always extracted as exact statistics on directional data. The main reason is concerned with periodicity inherent in directional data. For example, an expectation of a random variable X is defined as ∫xp(x)dx, where p(x) is a probability density function of X; therefore, when a random direction D is distributed only at 170[]and 170[] with same probability density, the expectation of D leads to 0[] if nothing about the periodicity is considered. We would, however, expect that the exact expectation of D should be 180[]. To overcome the problem, we, at first, define a directional distance in such a form that can introduce the periodicity. Then, we propose an idea of defining directional statistics by a problem of minimizing an arithmetic mean of squared directional distances to each sample direction. Because the periodicity is introduced to the directional distance definition, the directional statistics are calculated as the exact statistics on directional data. Although the introduced periodicity might cause the minimization to be complex, we can compensate the complexity by introducing recurrence formulas; consequently, dominant information can efficiently be extracted as the directional statistics from those data. Experiments on their applications to pattern processing show that the proposed algorithm works well in detecting (1) divergent points of distorted vector field patterns with noise and (2) moving directions from translational movement vector fields.

In this paper a method of recognizing waveform based on the Discrete Wavelet Transform (DWT) presented by us is applied to detecting the K-complex in human's EEG which is a slow wave overridden by fast rhythms (called as spindle). The features of K-complex are extracted in terms of three parameters: the local maxima of the wavelet transform modulus, average slope and the number of DWT coefficients in a wave. The 4th order B-spline wavelet is selected as the wavelet basis. Two channels at different resolutions are used to detect slow wave and sleep spindle contained in the K-complex. According to the principle of the minimum distance classification the classifiers are designed in order to decide the thresholds of recognition criteria. The EEG signal containing K-complexes elicited by sound stimuli is used as pattern to train the classifiers. Compared with traditional method of waveform recognition in time domain, this method has the advantage of automatically classifying duration ranks of various waves with different frequencies. Hence, it specially is suitable to recognition of signals which are the superimposition of waves with different frequencies. The experimental results of detection of K-complexes indicate that the method is effective.