This paper presents a new multi-clustering network for the purpose of intelligent data classification. In this network, the first layer is a self-organized clustering layer and the second layer is a restricted clustering layer with a neighborhood mechanism. A new clustering algorithm is developed in this system for the efficiently use of parallel processors. This parallel algorithm enables the nodes of this network to be independently processed in order to minimize data communication load among processors. Using the parallel processors, the quite low calculation cost can be realized among the conventional networks. For example, a 4-processor parallel computing system has shown its ability to reduce the time taken for data classification to 26.75% of a single processor system without declining its performance.

A new compression algorithm for fingerprint images is introduced. A modified wavelet packet scheme which uses a fixed decomposition structure, matched to the statistics of fingerprint images, is used. Based on statistical studies of the subbands, different compression techniques are chosen for different subbands. The decision is based on the effect of each subband on reconstructed image, taking into account the characteristics of the Human Visual System (HVS). A noise shaping bit allocation procedure which considers the HVS, is then used to assign the bit rate among subbands. Using Lattice Vector Quantization (LVQ), a new technique for determining the largest radius of the Lattice and its scaling factor is presented. The design is based on obtaining the smallest possible Expected Total Distortion (ETD) measure, using the given bit budget. At low bit rates, for the coefficients with high-frequency content, we propose the Positive-Negative Mean (PNM) algorithm to improve the resolution of the reconstructed image. Furthermore, for the coefficients with low-frequency content, a lossless predictive compression scheme is developed. The proposed algorithm results in a high compression ratio and a high reconstructed image quality with a low computational load compared to other available algorithms.

The cell structure of surface discharge ACPDPs with a long gap between the sustaining electrodes achieves high luminous efficiency. However, the long gap cell structure causes high firing voltage and thus makes driving more difficult than with the conventional gap cell structure. The rise in firing voltage in the long gap cell structure could not be explained by Paschen's scaling law. We derived a new governing equation for firing voltage, involving the influence of a non-uniform electric field, to investigate this deviation from Paschen's law. From the calculated results we found that changing the gap length corresponds to the change in the degree of distortion of the electric field between the sustaining electrodes.

We propose an interactive identification scheme based on the quadratic residue problem. Prover's identity can be proved without revealing his secret information with only one accreditation. The proposed scheme requires few computations in the verification process, and a small amount of memory to store the secret information, A digital signature based on this scheme is proposed, and its validity is then proved. Lastly, analysis about the proposed scheme is presented at the end of the paper.

The key concept of Physical Optics (PO), originally developed for a perfectly electric conductor (PEC), consists in that the high frequency fields on the scatterer surface are approximated by those which would exist on the infinite flat surface tangent to the scatterer. The scattered fields at arbitrary observation points are then calculated by integrating these fields on the scatterer. This general concept can be extended to arbitrary impedance surfaces. The asymptotic evaluation of this surface integration in terms of diffraction coefficients gives us the fields in analytical forms. In this paper, uniform PO diffraction coefficients for the impedance surfaces are presented and their high accuracy is verified numerically. These coefficients are providing us with the tool for the mechanism extraction of various high frequency methods such as aperture field integration method and Kirchhoff's method.

This paper provides an architectural study of optical multiple-ring trunk-transmission networks using high-speed Time Division Multiplexing (TDM), and proposes two algorithms for distributed control environments. We propose a path-setup algorithm that uses Token protocol over Section Overhead (SOH) bytes, by which network-nodes communicate with each other to reserve bandwidth. A classified path restoration algorithm is also proposed that offers 3 path classes in terms of restoration performance. Class A paths, the most reliable, never lose any bit even against unpredictable disasters. They are realized by path-duplication at the source node, route diversity,and hitless switching at the destination node. Class B paths are restored by re-routing, where the original path-setup algorithm is reused. Class C paths are the most economical because a failed path is restored by maintenance action.

Scattering of a plane electromagnetic wave by a conducting wedge will be discussed. The former solution can not be applicable to all the transition regions when its parameter is constant. This study shows a new solution which consists of only one expression applicable to the shadow region, the illuminated region and the transition regions, and which has no parameter.

A new method is proposed for recovering an unknown source signal ,which is observed through two unknown channels characterized by non-minimum phase FIR filters. Conventional methods cannot estimate the non-minimum phase parts and recover the source signal. Our method is based on computing the eigenvector corresponding to the smallest eigenvalue of the input correlation matrix and using the criterion with the multi-channnel inverse filtering theory. The impulse responses are estimated by computing the eigenvector for all modeling orders. The optimum order is searched for using the criterion and the most appropriate impulse responses are estimated. Multi-channel inverse filtering with the estimated impulse responses is used to recover the unknown source signal. Computer simulation shows that our method can estimate nonminimum phase impulse responses from two reverberant signals and recover the source signal.

An algorithm for extracting fundamental frequencies from duet sounds is proposed. The algorithm is based on an acoustical feature that the temporal fluctuation patterns in frequency an power are similar for harmonic components composing a sound for a single musical note played on a single instrument with a single active vibrating source. The algorithm is applied to the sounds of 153 combinations of pair-notes played by a flute duet and a violin duet. Experimental results show that the zone-wize correct identification rate by pitch name are 98% for the flute duet and 95% for the violin duet in the best cases.

We present a general framework with which we can evaluate the flexibility and efficiency of various replay systems for parallel programs. In our approach, program monitoring is modeled by making a virtual dataflow program graph, referred to as a VDG, that includes all the instructions executed by the program. The behavior of the program replay is modeled on the parallel interpretation of a VDG based on two basic parallel execution models for dataflow program graphs: a data-driven model and a demand-driven model. Previous attempts to replay parallel programs, known as Instant Replay and P-Sequence, are also modeled as variations of the data-driven replay, i.e. the datadriven interpretation of a VDG. We show that the demand-driven replay, i.e. the demand-driven interpretation of a VDG, is more flexible in program replay than the data-driven replay since it allows better control of parallelism and a more selective replay. We also show that we can implement a demand-driven replay that requires almost the same amount of data to be saved during program monitoring as does the data-driven replay, and which eliminates any centralized bottleneck during program monitoring by optimizing the demand propagation and using an effective data structure.

We extend the Rabin cryptosystem to the Eisenstein and Gauss fields. Methods for constructing the complete representation class and modulo operation of the ideal are presented. Based on these, we describe the methods of encryption and decryption. This proposed cryptosystem is shown to be as intractable as factorization, and recently presented low exponent attacks do not work against it.

A factorization method for a string polynomial called the constant method is proposed. This uses essentially three operations; classification of monomials, gcrd (greatest common right divisor), and lcrm (least common rigth multiple). This method can be applied to string polynomials except that their constants cannot be reduced to zeros by the linear transformation of variables. To factorize such excluded string polynomials, the naive method is also presented, which computes simply coefficients of two factors of a given polynomial, but is not efficient.

We propose low Rayleigh scattering Na2O-MgO-SiO2 (NMS) glass as a candidate material for low-loss optical fibers. This glass exhibits Rayleigh scattering which is only 0.4 times that of silica glass, and a theoretical evaluation suggests that it is dominated by density fluctuation. An investigation of the optical properties of NMS glass reveals that a minimum loss of 0.06 dB/km is expected at a wavelength of 1.6 µm and that the zero-material dispersion wavelength is found in the 1.5 µm band. To establish the waveguide structure, we evaluated the feasibility of using F-doped NMS (NMS-F) glass as a cladding layer for an NMS core and found that it is suitable because it exhibits low relative scattering (e.g. 0.7) and is versatile in terms of viscosity matching. We also describe an attempt to draw optical fibers using the double crucible technique.

Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. In a previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper is concerned with a covering problem called the single cover problem defined in the previous paper. First, we define a generalized single cover problem and show that an algorithm proposed in the previous paper can be applicable to solving the generalized single cover problem. Then, we define a single cover problem satisfying cardinality constrains and show that the problem is solved in a polynomial time.

We developed a 1200 dots-per-inch light emitting diode array (1200 dpi LED array) chip using a GaAs0.8 P0.2 epitaxial substrate for the first time. One LED array chip consists of 256 LEDs. In general, LED arrays are fabricated by vapor-phase zinc diffusion. From the viewpoint that shallow junctions should be formed to fabricate a very high-density LED array, solid-phase diffusion seems to be more suitable. We fabricated the LED array using selectively-masked solid-phase zinc diffusion, and the diffusion depth was controlled at 1 µm. The diffusion depth was uniform under the diffusion window. The ratio of the length of lateral diffusion to the diffusion depth was about 1.7. These features imply that Zn diffusion was well controlled. In the Zn diffusion, the carrier concentration in the Zn diffusion region was high enough and the sheet resistance of the diffusion region with a diffusion depth of 1 µm was low enough to obtain a sufficient level of emitted light power. The results of performance tests showed that the characteristics of the LED array chip are satisfactory for application in optical printer print heads, because of the array's highly-resolved near-field pattern characteristic, ample emitted light power, low emitted-light-power deviation, and long life.

Recently, torque-transmission one-way tip articulated fiberscopes with a working channel have been developed. With this type of scopes, force is transmitted from the operator's hands to the tip of the fiberscope to obtain an adequate field of view. Micro actuators are expected to increasingly replace the operator's hands. Shape memory alloy (SMA) coil spring actuators are well suited to this purpose because of their large displacement compared with conventional actuators. In the fabrication of SMA coil springs, we examined fabrication conditions such as the tension and pitch of the SMA wire. As a result, we have successfully fabricated coil springs with a minimum outer diameter of 76 µm. SMA wire 25 µm in diameter and stainless steel wire 30 µm in diameter were used. As an application using SMA actuators, an active fiberscope (using an image guide fiber with 4200 pixels and light guide fibers) 2 mm in outer diameter with SMA actuators was designed and fabricated. We investigated the mechanical properties of the bending part in designing the SMA actuators. The specifications of the SMA coil springs are determined by the displacement and the force required of the pull wire. The relationship between the displacement of the pull wire and the number of windings of the SMA coil spring was calculated. The effective number of windings of SMA coil spring was found to be seventeen when using wire of 0.3 mm in diameter. The tip of the fiberscope was bent approximately 60 degrees and returned to the straight position when a current was applied to each of the SMA coil springs. A clear picture of the fiberscope which followed the tip bending operation could be received on the monitor. This SMA actuator can be easily extended for bending in many directions by configuring several of these mechanisms.

A new structure for adaptive AR spectral estimation based on multi-band decomposition of the linear prediction error is introduced and the mathematical background for the soulution of the related adaptive filtering problem is derived. The presented structure gives rise to AR spectral estimates that represent the true underlying spectrum with better fidelity than conventional LS methods by allowing an arbitrary trade-off between variance of spectral estimates and tracking ability of the estimator along the frequency spectrum. The linear prediction error is decomposed through a filter bank and components of each band are analyzed by different window lengths, allowing long windows to track slowly varying signals and short windows to observe fastly varying components. The correlation matrix of the input signal is shown to satisfy both time-update and order-update properties for rectangular windowing functions, and an RLS algorithm based on each property is presented. Adaptive forward and backward relations are used to derive a mathematical framework that serves as a basis for the design of fast RLS alogorithms. Also, computer experiments comparing the performance of conventional and the proposed multi-band methods are depicted and discussed.

Resonance characteristics of a coupled dielectric resonator which consists of a Whispering Gallery mode dielectric disk resonator and a ring resonator located eccentrically are analyzed. New analytical results of resonance characteristic based on the distributed coupling phenomena between the disk and the ring are obtained. The resonance performances have also been verified experimentally on X band model. We have found that Free Spectral Range of the coupled resonator is several times larger than that of the single disk resonator and the single ring resonator, respectively. As a result, the eccentric coupled resonator discussed in this paper can be used as a frequency selective element in millimeter wave integrated circuits.

The design and engineering of new network intelligence platforms to accommodate the ever-changing and growing demands of customers, presents rich market opportunities and challenges tempered by concerns arising from the problematic experiences of similar system and network developments. As the telecommunications industry evolves, customers are increasingly coming to expect the perception of instantaneous access to service providers together with transparency to network failures. System performance dictates that response times need to be minimised, sufficient redundant capacity installed in case of failure and controls embedded within the design to manage the exceptional situations (such as media stimulated events) that continually threaten network integrity. Network design based on a 'top-down,' 'end-to-end' methodology plays a fundamental role in delivering solutions that meet customers' performance needs. It is necessary to consider service scenario mixes, service demand, physical network topology, signalling message flows, the mapping of functional entities to physical components, and routing as part of the network design process to ensure that performance requirements are met. The use of 'what-if' design tools is particularly relevant as part of this process. A challenging task faces the System Designer with the often conflicting goals of good performance and provision of service flexibility.

In this paper we discuss a certain constrained optimization problem which is often encountered in the geometrical optimization. Since these kinds of problems occur frequently, constrained genetic optimization becomes very important topic for research. This paper proposes a new methodology to handle constraints using the Genetic Algorithm through a multiprocessor system (FIN) which has a self-similarity network.