Brightness pattern golssiness GBP of pearls was measured by the system, which consists of a CCD-TV camera, an image processor, etc. The GBP was considered to be roughly suitable for the physical glossiness of pearls.

We have pressented here, for the Control Unit (CU) of Benes Interconnection Network (IN), a new fast parallel computational model named as; Cyclic Cube Engine (CCE), which depends on the Cyclic Cube topology, where the total number of processing elements is φ such that φN(11/h), h is an arbitrary integer, such that 2hlog N. N is number of the data items consisting the permutation. We have presented on this model parallel algorithm for parallel settings of Benes IN in order to realize arbitrary permutation with a setting time of O(h log2 N); (assuming N is base 2) using φN(11/h) processors (i.e., φN). This bound could be achieved by accelerating the parallel setting algorithm by function call of another very fast algorithm named as the accelerator. We have also, proven in the appendix of this paper, that our construction is within the lower bound of setting Benes IN for arbitrary permutation for general nonshared model when φN. Using these algorithms we have constracted a fast parallel setting algorithm to set the switches of Benes IN for arbitrary permutation in parallel time of O(h log2 N) where is hlog2 N. The parallel setting algorithm has been constructed depending on the CCE as the main computational structure suitable for setting Benes IN in parallel.

Based on the similarity between the neural and the immune networks, a modified PDP model is adopted to simulate the idiotype networks of the immune system. Major modifications peculiar to immune networks are the introduction of time delays and the bilateral and asymmetric interaction between units. Simulation results show nonlinear behaviors of networks such as hard oscillations and chaos. The behaviors are closely related to the structure of networks. It is suggested that the analysis of the immune system can inspire new scheme in parallel distributed information processing.

For investigating the pantograph discontact phenomena, this letter describes the statistical measurements of the discontact properties in the sliding-contacts. The current-dependences of the discontact and the discharge rates are elucidated.

Quadrature amplitude modulation (QAM) was found to suitable for the bandpass type frequency characteristic of magnetic recording/reproducing channels. A method of 20 Mbps signal recording using 32 QAM coded modulation is described.

Degradation of the two-dimensional images transmitted through a graded-index (GRIN) optical fiber is evaluated by considering the fourth and sixth order terms of the refractive index distribution, and the spatial inverse filter and Wiener filter are investigated in order to restore the degraded images. When a point image is transmitted through a practical GRIN fiber, the output image is degraded by the modal dispersion, i.e. the phase differences between the modes. This degraded image at the output plane of the GRIN fiber is restored by the spatial inverse filter and Wiener filter which are designed so that the filtered coherent transfer function of the GRIN fiber has almost flat spatial frequency spectrum. The transform function of the inverse filter is calculated by using only the on-axis point spread function (PSF) of the fiber and is found to be effective in a region near the propagation axis, because the fiber is space-invariant around the axis. By considering the difference between the on-axis and off-axis PSFs, the transfer function of the optimum Wiener filter is obtained. The optimum Wiener filter restores the off-axis PSF as well as that of the on-axis. The waists of the main peaks at which the intensities of the filtered on-axis and off-axis PSFs become 1/e2 of their maximum values, are 0.75 and 0.52 of those without filtering. The resolution of the PSFs corresponding to the point images transmitted in the range of 0-25 µm are increased. The levels of the small peaks in the field intensity distributions of the filtered on-axis and off-axis PSFs are also reduced and these peaks are low enough to obtain high contrast images at the output for the considered range.

An algorithm for the generation of PL integral operator is presented. This algorithm provides a virtually trivial determination of the operator elements. Sparseness and decomposition of the integral operator are also discussed.

The spatial network method can analyze a three-dimensional electromagnetic field, including time response. But, no paper has discussed a matching condition of a microstrip line in detail. In this paper, we have clarified a generalized procedure to obtain the maching condition using resistor and capacitor at the terminal plane of the microstrip line.

This paper concerns the study on the Ku band multi-beam direct radiating array antenna technology, which provides frequency reuse and reconfigurable multi-beam capabilities in satellite communication system. The study consists of two dimensional pattern synthesis, beam forming network analysis and design, and fabrication and measurement of an experimental model. The measurement results have shown that the experimental model with 64 array elements including 14 dummy elements has a low loss of less than 2 dB in average and high sidelobe and polarization isolation of more than 27 dB and 29 dB, respectively, over 1 GHz bandwidth in the Ku band. As a result of careful evaluation, it has been confirmed that the design method established here is valid and useful for multi-beam direct radiating array antenna design.

First, we give a method by which any k-valued logic function with n variables can be realized with a cellular array of (k1)kn-1 rows and kn-1 columns. Next, by encoding multi-value to binary one and decoding binary value to multivalue, we give another method by which any k-valued logic function with n variables can be realized with log2k cellular arrays each of which is of kn-1 rows and kn-1 columns.

A new method is presented for designing robust stabilizing controllers for SISO plants with any bounded parameter and/or degree variations in some known ranges It is shown that, if the plants are of minimum phase and have (any) fixed relative degrees and gains with fixed sign, then, linear time-invariant controllers can always be designed to stabilize robustly such plants. The order of a controller designed by this method is equal to the relative degree of the plant, and is independent of the order of the plant.

The problem is deduced to scattering from four conducting rectangular cylinders by using the electric image method and analyzed by Point Matching Method. This letter gives not only near field distribution but also model experiments using a line source at 9.6 GHz. Numerical result is in nearly good agreement with the experimental result.

Reflection and transmission when a Gaussian beam is launched into an anisotropic slab whose optical axis has arbitrary direction is described. This problem is solved by using Fourier transforms. Solutions of reflected and transmitted beams having integral form are numerically calculated by using FFT.

By use of a planar grating on a dielectric slab where some strips of different width are placed in one period, polarization- and frequency-selectivities are improved when the thickness of the dielectric slab, its relative permitivity and the location of the strips are chosen appropriately.

A sequence α(a1,,an) is k-sorted if and only if α satisfies the condition: for all i, j in {1,,n}, ijk implies aiaj. A local characterization of k-sorted sequences is given. An algorithm for sorting k-sorted sequences is designed, and its time efficiency is analysed. For each k1, a lower bound on the number of comparisons needed to sort k-sorted sequences is obtained by an estimate of the number of k-sorted sequences of length n and a decision tree argument. We show that 0.6947 n and 1.1265 n are average case lower bounds on the numbers of comparisons for sorting 1-sorted and 2-sorted sequences of length n, respectively.

A new type of phase comparator for DPLL (Digital Phase-Locked Loop), named Adaptive Multilevel-Quantized Phase Comparator (abbreviated as AMPC), is proposed. The characteristics of this proposed comparator AMPC are changed adaptively to reduce the frequency deviation and the phase jitter of the input signals, whereas the conventional phase comparator has constant characteristics whatever signals come. When the offset between input and output signal frequency exists, the amount of frequency control is increased by shifting up or down its characteristics in order to decrease this deviation. When the loop is in the steady-state, the amount of phase control is decreased by varying the scale of them to suppress the input jitter. Performance characteristics of AMPC and the loop which uses AMPC are analyzed theoretically and verified by computer simulation. As a result, the loop which uses AMPC has much wider locking-range and much better jitter suppresion effect than those of the conventional loops, and steady-state phase error is also reduced by using AMPC.

Bennett proved that any irreversible Turing machine can be simulated by a reversible one. However, Bennett's reversible machine uses 3 tapes and many tape symbols. Previously, Gono and Morita showed that the number of symbols can be reduced to 2. In this paper, by improving these methods, we give a procedure to convert an irreversible machine into an equivalent 1-tape 2-symbol reversible machine. First, it is shown that the state-degeneration degree" of any Turing machine can be reduced to 2 or less. Using this result and some other techniques, a given irreversible machine is converted into a 1-tape 32-symbol (i.e., 5-track 2-symbol) reversible machine. Finally the 32-symbol machine is converted into a 1-tape 2-symbol reversible machine. From this result, it is seen that a 1-tape 2-symbol reversible Turing machine is computation universal.

This paper presents and effective acceleration technique for the homotopy method using a rectangular subdivision (which will be called the rectangular algorithm" in this paper). The rectangular algorithm is an efficient solution algorithm that is globally convergent for a large class of nonlinear resistive networks. In the rectangular algorithm, the restart technique is usually used in order to improve the accuracy of the solution. In this paper, we show that certain realization of the restart technique achieves local quadratic convergence. In other words, if we determine the grid size of the rectangular subdivision pertinently in each restart, the sequence of the approximate solutions generated by the algorithm converges to the exact solution quadratically. And in this case, the computational work involved in each restart is almost identical to that of Newton's method. Therefore, our algorithm becomes as efficient as Newton's method when it reaches sufficiently close to the solution.

Continuous-time high-frequency active filters suitable for monolithic implementation by standard low cost bipolar process are presented. Balanced NIC's are used to cancel out the loss of passive RC integrators, thus realizing active loss-less integrators with good high-frequency performance. Two types of balanced integrators are proposed and their quality factors are analyzed. The proposed NIC-integrators are used to realize tunable active filters capable of low-voltage operation and without the drawbacks of the NIC-gyrator filters. As an example of application of the NIC-integrators to leapfrog simulation of RLC ladders a second-order 1 MHz bandpass filter was designed, computer simulated and laboratory tested showing good results.

This paper presents an image compression coding sheme named Boundary Detection Coding (BDC). It is worked out to compress digital multi-color images having large uniformly colored areas. Input images to the BDC encoder are given in the raster scan data format. The encoder detects boundary points of uniformly colored areas and changes them into compression codes. It does not generate any code while scanning uniformly colored areas. The BDC decoder changes the boundary codes back to the original image using some characteristics of boundary points. The BDC is much more efficient than the one-dimensional runlenght coding method. This paper covers the coding algorithm of the BDC, the results of some experiments and comparison with other methods.