This paper reports on the development of an eyeglass-type infrared-controlled telephone communication interface for the disabled. This system is comprised of four major components: A) a headset; B) an infrared transmitting module; C) an infrared receiving/signal-processing module; and D) a main controller, the Intel-8951 microprocessor. The headset with a tongue-touch panel, a wireless earphone, and a wireless microphone. The infrared transmitting module utilizes a tongue touch panel via tongue-touch circuitry which is converted to an infrared beam and a low power laser (<0.1 mW) beam. The infrared receiving/signal-processing module, receives the infrared beam and fine tunes the unstable infrared beam into standard pulses which are used as control signals. The main controller is responsible for detecting the input signals from the infrared receiving/signal-processing module and verifying these signals with the mapping table in its memory. After the signal is verified, it is released to control the keys of the telephone interface. This design concept was mainly based on the idea that the use of an infrared remote module fastened to the eyeglasses could allow the convenient control of the dialing motion on the keys of a telephone's dialing-pad which are all modified with infrared receiving/signal-processing modules. The disabled are competent for some of work, such as a telephone operator. The increase of opportunity to do a job for the disabled would help them live independently.

In this paper, we describe an experimental evaluation of visual fatigue in a binocular disparity type 3-D display system. To evaluate this fatigue, we use a subjective assessment method and focus on mismatching between convergence and accommodation, which is a major weakness of binocular disparity 3-D displays. For this subjective assessment, we use a newly-developed binocular disparity 3-D display system with a compensation function for accommodation. Because this equipment only allowed us to compare the terms of the mismatching itself, the evaluation is more accurate than similar previous works.

This paper shows the method of theoretical analysis for the bit error probability of the trellis-coded partial response continuous phase modulation (TCM-PR-CPM) over the correlated Rician fast frequency nonselective fading channel. In the analysis, the fading correlation of the channel and the effect due to finite interleaver are taken into account. By applying the method to the rate 1/2 (7, 2) trellis code with the raised cosine pulse of length 2 (2RC) partial response signaling, we show that the tighter upper bounds of the bit error rate are obtained than those in the preceding report.

Negation as failure is realized to be combined with SLD resolution for general logic programs, where the combined resolution is called an SLDNF resolution. In this paper, we introduce narrowing and infinite failure to SLDNF resolution for general logic programs with equations. The combination of SLDNF resolution with narrowing and infinite failure is called an SLDNFN resolution. In Shepherdson (1992), equation theory is combined with SLDNF resolution so that the soundness may be guaranteed with respect to Clark's completion. Generalizing the method of Yamamoto (1987) for definite clause sets with equations, we formally define a least fixpoint semantics, which is an extension of Fitting (1985) and Kunen (1987) semantics, and which includes the pair of success and failure sets defined by the SLDNFN resolution. The relationship between the fixpoint semantics and the pair of sets is regarded as an extension of the relationships for general logic programs as in Marriott and et al. (1992) and in Yamasaki (1996). Instead of generalizing Clark's completion for SLDNFN resolution, we establish, as a model for general logic programs with equations, an extended well-founded model so that the SLDNFN resolution is sound and complete for non-floundering queries with respect to the extended well-founded model.

In this paper, we consider the ring embedding problem in faulty star graphs. Our embedding is based on the path transition scheme and node borrow technique in the ring of 4-dimensional substars with evenly distributed faults. Let Sn be the n-dimensional star graph having n! nodes. We will show that a ring of length n! - 2f can be found in Sn when the number of faulty nodes f is at most n-3. In the worst case, the loss of 2f nodes in the size of fault-free ring is inevitable because the star graph is bipartite. In addition, this result is superior to the best previous result that constructs the ring of length n! - 4f under the same fault condition. Moreover, by extending this result into the star graph with both node and edge faults simultaneously, we can find the fault-free ring of length n! - 2 fn in Sn when it contains fn faulty nodes and fe faulty edges such that fn + fe n-3.

It is known that AND-EXOR two-level networks obtained by AND-EXOR expressions with positive literals are easily testable. They are based on the single-rail-input logic, and require (n+4) tests to detect their single stuck-at faults, where n is the number of the input variables. We present three-level networks obtained from single-rail-input OR-AND-EXOR expressions and propose a more easily testable realization than the AND-EXOR networks. The realization is an OR-AND-EXOR network which limits the fan-in of the AND and OR gates to n/r and r respectively, where r is a constant (1 r n). We show that only (r+n/r) tests are required to detect the single stuck-at faults by adding r extra variables to the network.

This paper proposes an automatic method for reconstructing a realistic 3D facial image from CT (computer tomography) and three color photographs: front, left and right views, which can be linked easily with the underlying bone and soft tissue models. This work is the first part of our final goal, "the prediction of patient's facial appearance after cancer surgery" such as removal of a part of bone or soft tissues. The 3D facial surface derived from CT by the marching cubes algorithm is obviously colorless. Our task is to add the color texture of the same patient actually taken with a digital camera to the colorless 3D surface. To do this it needs an accurate registration between the 3D facial image and the color photograph. Our approach is to set up a virtual camera around the 3D facial surface to register the virtual camera images with the corresponding color photographs by automatically adjusting seven parameters of the virtual camera. The camera parameters consists of three rotations, three translations and one scale factor. The registration algorithm has been developed based upon Besl and McKay's iterative closest point (ICP) algorithm.

This paper develops an algorithm based on the Modular Approach to solve singly constrained separable discrete optimization problems (Nonlinear Knapsack Problems). The Modular Approach uses fathoming and integration techniques repeatedly. The fathoming reduces the decision space of variables. The integration reduces the number of variables in the problem by combining several variables into one variable. Computational experiments for "hard" test problems with up to 1000 variables are provided. Each variable has up to 1000 integer values.

In order to lead an ongoing software project to success, it is important to flexibly control its dynamically-changing software process. However, it is generally impossible not only to exactly pre-define the production process but also to prescribe the process change process (meta-process). To solve the problem, we have focused on communication between the project staff through which process change requests presented by individuals can be immediately shared, designed, verified, validated and implemented. This paper proposes a communication model which can represent a wide variety of communication states between the project manager and developers discussing how to implement process change requests. The communication model has been derived by investigating the sort of process change requests and, based on the model, we have implemented a cooperative process planning system (called CooPs). CooPs is a communication environment designed for software projects and supports information sharing for discussing the process change requests. By using CooPs, the software project can flexibly deal with not only expected change requests but also unexpected ones. To evaluate the applicability of the communication model and the capabilities of CooPs, we have conducted an experiment which is an application of CooPs to the ISPW6 example problem. This paper describes the concepts of CooPs, the system implementation, and the experiment.

Using Hopfield-type neural network model, we present an algorithm for reconstructing 3D mesh processor arrays using single-track switches where spare processors are laid on the six surfaces of a 3D array and show its effectiveness in terms of reconstruction rate and computing time by computer simulation. Next, we show how the algorithm can be realized by a digital neural circuit. It consists of subcircuits for finding candidate compensation paths, deciding whether the neural system reaches a stable state and at the time the system energy is minimum, and subcircuits for neurons. The subcircuit for each neuron including the other subcircuits can only be made with 16 gates and two flip-flops. Since the state transitions are done in parallel, the circuit will be able to find a set of compensation paths for a fault pattern very quickly within a time less than 1 µs. Furthermore, the hardware implementation of the algorithm leads to making a self-reconfigurable system without the aid of a host computer.

This paper reports on time-space conversion-based differential processing of optical signals using a high-resolution arrayed-waveguide grating (AWG) and a spatial filter at a wavelength of 1.55 µm. We clarify the advantages of the AWG device and show where it is applicable. In order to reduce loss at the spatial filter, we propose a new phase-only filter that functions as a differential filter. The difference between the exact differential filter and the proposed phase-only filter is calculated theoretically. We confirm experimentally that the optical pulse can be differentiated by the proposed filter. For application of differential processing, we also proposed a phase modulation to amplitude modulation (PM-AM) conversion and demonstrated the PM-AM conversion at 10 Gbit/s signals using a PSK-non-return-to-zero (NRZ) format.

This paper reports on time-space conversion-based differential processing of optical signals using a high-resolution arrayed-waveguide grating (AWG) and a spatial filter at a wavelength of 1.55 µm. We clarify the advantages of the AWG device and show where it is applicable. In order to reduce loss at the spatial filter, we propose a new phase-only filter that functions as a differential filter. The difference between the exact differential filter and the proposed phase-only filter is calculated theoretically. We confirm experimentally that the optical pulse can be differentiated by the proposed filter. For application of differential processing, we also proposed a phase modulation to amplitude modulation (PM-AM) conversion and demonstrated the PM-AM conversion at 10 Gbit/s signals using a PSK-non-return-to-zero (NRZ) format.

Coaxial-core erbium-doped fiber amplifiers (EDFA's) having a property of self-regulated gain spectrum are developed. The operation of a coaxial-core EDFA is based on the partial separation of the light paths for different wavelength channels in the directionally-coupled waveguides of a coaxial-core geometry. The degree of channel equalization depends on the geometrical and optical parameters of the coaxial-core EDFA and on relative channel power levels. A numerical analysis based on the coupled-mode theory and on the rate equation shows that, under fully optimized conditions, a coaxial-core EDFA provides equalization rates in excess of -0.4 dB per dB of input-power imbalance in the case with two WDM channels. A cascade experiment demonstrates the effect of coaxial-core EDFA's toward channel-power equalization in fiber links with a small number of WDM channels.

On the reverse (mobile-to-base) link of direct sequence code division multiple access (DS-CDMA) mobile radio, closed-loop fast transmit power control (TPC) must be sufficiently fast to track fast multipath fading. However, in urban areas, the line-of-sight (LOS) path may appear abruptly when a mobile station appears from behind a building and later suddenly the LOS may disappear, resulting in an abrupt path-loss change in the order of 30 to 40 dB. This "on-off" path loss change can be considered as a special case of shadowing. This "on-off" shadowing causes two problems at the base station: generation of severe multiple access interference (MAI) to other users when the LOS path appears and degradation of the quality of its own signal when the LOS path disappears. This paper proposes a new closed-loop fast TPC based on Markov-state transitions (called Markov fast TPC). State transition is determined by the past history of the received binary TPC commands sent from the base station. The TPC step size is associated with each state. By changing the step size between as small as 0.8 dB and as large as 4 dB, the Markov fast TPC can better track "on-off" shadowing as well as multipath fading compared to conventional one-state closed-loop fast TPC. A new SIR estimation method used in TPC command generation is also proposed. The TPC error is evaluated by computer simulation to demonstrate the adaptability of the proposed Markov fast TPC in a Rayleigh fading channel superimposed by "on-off" shadowing.

We analyze the dispersion-managed optical transmission system for the non-return-to-zero (NRZ) pulse format. First, we investigate the physical image of dispersion management by computing small-signal-based transfer functions, and summarize the dependence of transmission performance on system parameters. Next, the Q-map is computed numerically to design long-distance large-capacity dispersion-managed transmission systems for a single channel in a more detailed manner. It is shown that the third-order dispersion of fibers negatively influences transmission performance, and third-order dispersion compensation is proved to be an effective method for extending the transmission distance of high bit-rate systems. Utilizing these results, guidelines can be derived for the optimal design of long-distance large-capacity NRZ transmission systems.

Coaxial-core erbium-doped fiber amplifiers (EDFA's) having a property of self-regulated gain spectrum are developed. The operation of a coaxial-core EDFA is based on the partial separation of the light paths for different wavelength channels in the directionally-coupled waveguides of a coaxial-core geometry. The degree of channel equalization depends on the geometrical and optical parameters of the coaxial-core EDFA and on relative channel power levels. A numerical analysis based on the coupled-mode theory and on the rate equation shows that, under fully optimized conditions, a coaxial-core EDFA provides equalization rates in excess of -0.4 dB per dB of input-power imbalance in the case with two WDM channels. A cascade experiment demonstrates the effect of coaxial-core EDFA's toward channel-power equalization in fiber links with a small number of WDM channels.

This paper presents a new technique for the synthesis of sets of low-peak sequences exhibiting low peak cross correlation. The sequences also have flat power spectra and are suitable for many applications requiring such sets of uncorrelated pseudo-white-noise sources. This is a new application of the ta-sequence (trigonometric function aliasing sequence), which itself is a very new technique that uses the well-known "Reed-Solomon code" or "One coincident code" to generate these sets of low-peak-factor pseudo-white-noise exhibiting low peak cross correlation. The ta sequence method presented here provides the means for generating various sequences at the lengths required for such applications as system measurement (needing uncorrelated test signals), pseudo-noise synthesis (for spread spectrum communication), and audio signal processing for sound production (for enhancing spatial imagery in stereo signals synthesized from mono sources) and sound reproduction (for controlling unwanted interference effects in multiple-loudspeaker arrays).

We analyze the dispersion-managed optical transmission system for the non-return-to-zero (NRZ) pulse format. First, we investigate the physical image of dispersion management by computing small-signal-based transfer functions, and summarize the dependence of transmission performance on system parameters. Next, the Q-map is computed numerically to design long-distance large-capacity dispersion-managed transmission systems for a single channel in a more detailed manner. It is shown that the third-order dispersion of fibers negatively influences transmission performance, and third-order dispersion compensation is proved to be an effective method for extending the transmission distance of high bit-rate systems. Utilizing these results, guidelines can be derived for the optimal design of long-distance large-capacity NRZ transmission systems.

A loop architecture of DQDB with slot reuse (LDQDB-SR) segmented by erasure nodes was studied to overcome the performance limitation due to the nature of the unidirectional bus architecture of DQDB with slot reuse. The LDQDB-SR adopts the destination slot release and an inter-segment bandwidth regulation based on the distributed queuing system of DQDB. This network suffers not only from severe throughput deterioration due to a high regulation cost and an excessive transit delay but also from unfairness in bandwidth sharing, especially under an overload condition. In this paper, we introduce an enhanced loop architecture of DQDB with slot reuse (ELDQDB-SR) to improve the performance of LDQDB-SR. The ELDQDB-SR uses a quota-based inter-segment bandwidth regulation mechanism to effectively control the bandwidth use of each segment. Each station selects the bus that minimizes the number of erasure nodes on the path to destination stations. Fairness control methods of DQDB are reviewed and the alpha-tuning mechanism is modified to achieve a fair bandwidth distribution among stations within each segment. Simulation results show that the ELDQDB-SR gives an enhanced throughput level and also maintains good fairness under overload conditions.

Excitation of magnetostatic surface waves by slot line transducers is analyzed by using the integral kernel expansion method. The Fourier integral for the current density is derived in terms of an unknown normal component of the magnetic flux density in a slot region. The integral kernel is expanded into a series of orthogonal polynomials and then applying Galerkin's method to the resulting equation yields a system of linear equations for the unknown coefficients. Comparison of a numerical result by the present method with an experiment is in good agreement.