More than 200 papers, two special issues (Journal of Circuits, Systems, and Computers, March, June, 1993, and IEEE Trans. on Circuits and Systems, vol.40, no.10, October 1993), an International workshop on "Chua's Circuit: chaotic phenomena and applications" at NOLTA'93, and a book (Edited by R. N. Madan, World Scientific, 1993) on Chua's circuit have been published since its inception a decade ago. This review paper attempts to present an overview of these timely publications, almost all within the last 6 months, and to identify four milestones of this very active research area. An important milestone is the recent fabrication of a monolithic Chua's circuit. The robustness of this IC chip demonstrates that an array of Chua's circuits can also be fabricated into a monolithic chip, thereby opening the floodgate to many unconventional applications in information technology, synergetics, and even music. The second milestone is the recent global unfolding of Chua's circuit, obtained by adding a linear resistor in series with the inductor to obtain a canonical Chua's circuit--now generally referred to as Chua's oscillator. This circuit is most significant because it is structurally the simplest (it contain only 6 circuit elements) but dynamically the most complex among all nonlinear circuits and systems described by a 21–parameter family of continuous odd–symmetric piecewise–linear vector fields. The third milestone is the recent discovery of several important new phenomena in Chua's Circuits, e.g., stochastic resonance, chaos–chaos type intermittency, 1/f noise spectrum, etc. These new phenomena could have far-reaching theoretical and practical significance. The fourth milestone is the theoretical and experimental demonstration that Chua's circuit can be easily controlled from a chaotic regime to a prescribed periodic or constant orbit, or it can be synchronized with 2 or more identical Chua's circuits, operating in an oscillatory, or a chaotic regime. These recent breakthroughs have ushered in a new era where chaos is deliberately created and exploited for unconventional applications, e.g., secure communication.

We introduce recurrent networks that are able to learn chaotic maps, and investigate whether the neural models also capture the dynamical invariants (Correlation Dimension, largest Lyapunov exponent) of chaotic time series. We show that the dynamical invariants can be learned already by feedforward neural networks, but that recurrent learning improves the dynamical modeling of the time series. We discover a novel type of overtraining which corresponds to the forgetting of the largest Lyapunov exponent during learning and call this phenomenon dynamical overtraining. Furthermore, we introduce a penalty term that involves a dynamical invariant of the network and avoids dynamical overtraining. As examples we use the Hnon map, the logistic map and a real world chaotic series that correspond to the concentration of one of the chemicals as a function of time in experiments on the Belousov–Zhabotinskii reaction in a well–stirred flow reactor.

This paper proposes a methodology for fine evaluation of the uncertain behaviors of systems affected by any fluctuation of internal structures and internal parameters, by the use of a new concept on the fuzzy mapping. For a uniformly convex real Banach space X and Y, a fuzzy mapping G is introduced as the operator by which we can define a bounded closed compact fuzzy set G(x,y) for any (x,y)∈X×Y. An original system is represented by a completely continuous operator f defined on X, for instance, in a form xλ(f(x)) by a continuous operator λ: YX. The nondeterministic fluctuations induced into the original system are represented by a generalized form of the fuzzy mapping equation xGβ (x,f(x)) {ζX|µG(x,f(x))(ζ)β}, in order to give a fine evaluation of the solutions with respect to an arbitrarily–specified β–level. By establishing a useful fixed point theorem, the existence and evaluation problems of the "β–level-likely" solutions are discussed for this fuzzy mapping equaion. The theory developed here for the fluctuation problems is applied to the fine estimation of not only the uncertain behaviors of system–fluctuations but also the validity of system–models and -simulations with uncertain properties.

In this paper, we propose the architecture of BALANCE (Better Adaptive Load-balancing through Acquiring kNowledge of Characteristic of an Environment) in which users can submit their jobs without acquiring either a status of an environment or characteristics of jobs and servers even in a widely connected heterogeneous network. The architecture of BALANCE includes three types of information bases and two types of daemons. Information bases, namely job, resource, and environment information base, manage the knowledge of job characteristics, available resources for CPUs, and status of the environment, respectively, as a proxy for users. The dispatching daemon selects an adequate server for each job using knowledge stored in the information bases. A service daemon executes each job. On completing each job, a service daemon gets a statistic of the job and returns it to the dispatching daemon where the job came from so that the statistic will be available at the next dispatching time. BALANCE enables an environment (1) to balance the load, (2) to share software functions as well as hardware facilities, and (3) to learn a user's job characteristics. We have implemented a prototype with more than 50 heterogeneous UNIX workstations connected by different networks. Two simple experiments on this prototype are presented. These experiments show a load balancing scheme that takes the characteristics of each job into account.

This paper describes a procedural detailed compaction method for the symbolic layout design of CMOS leaf cells and its algorithmic aspects. Simple symbolic representations that are loosely designed by users in advance are automatically converted into densely compacted physical patterns in two phases: symbolic–to–pattern conversion and segment–based detailed compaction. Both phases are executed using user-defined procedures and a specified set of design rules. The detailed compaction utilizes a segment–based constraint graph generated by an extended plane sweep method where various kinds of design rules can be applied. Since various kinds of basic operations can be applied to the individual segments of patterns in the procedures, the detailed procedure for processing can be described in accordance with fabrication process technologies and the corresponding sets of design rules. This combined stepwise procedure provides a highly flexible framework for the symbolic layout of CMOS leaf cells. The proposed approach was implemented in a symbolic layout system called CAMEL. To date, more than 300 kinds of symbolic representations of CMOS leaf cells have been designed and are stored in the database. Using several different sets of design rules, symbolic representations have been automatically converted into compacted patterns without design rule violations. The areas of those generated patterns were averaged at 98% of the manually designed patterns. Even in the worst case, the increases in area were less than about 10% of the manually designed ones. Furthermore, since processing times are much shorter than manual design periods, for example, 300 kinds of symbolic representations can be converted to corresponding physical patterns in only a day. It is evident, through these practical design experiences with CAMEL, that our approach is more flexible and process–tolerant than conventional ones.

We are developing GENESIS, a new seamless total environment for designing, developing, installing, and operating various types of telecommunication networks as extremely large distributed processing applications in the future network integrated by ATM. Similar uniform architectures for quick introduction and easy management of service or operation applications have been proposed, such as by TINA, but there has been insufficient study on how to operate and con figure those applications. This paper discusses the implementation model and execution environment in GENESIS from the viewpoint of flexible operation according to network conditions. The implementation model can describe detailed configurations under various conditions on design or operation, independently of the execution environment. To achieve the goals of GENESIS, our execution environment provides message handling functions and a transparent interface for controlling network resources independently of the configuration, and dynamic reconfiguration functions that are independent of the execution. This paper also reports the prototype system GENESIS-1. The GENESIS-1 message handling mechanism and the effect of the reconfiguration functions are described.

This paper presents a cost-effective network for very large ATM cross-connects. In order to develop it, we propose the delta network with expanded middle stages. This proposed network is the intermediate network between a nonblocking network and the delta network with respect to the cost of hardware and internal blocking probability. Using this network, we explore the tradeoff between the cost and internal blocking probability, and derive the optimum configuration under temporarily deviating traffic. Internal blocking occurs when input traffic temporarily deviates from its average value. However, we cannot evaluate the internal blocking probability by using conventional traffic models. In this paper, we adopt temporarily deviating traffic such that all traffic is described as the superposition of the paths which are defined by traffic parameters. As can easily be seen, the path corresponds to virtual path (VP) or virtual channel (VC). Therefore, we believe that our model describes actual traffic more exactly than conventional models do. We show that the optimum configuration is the proposed network whose expansion ratio γ=3 when the maximum number of paths that can be accommodated in one link is greater than 22. This network achieves the internal blocking probability of 10-10. As an example of this network, we show that the proposed network of size 7272 is constructed with only 40% of the hardware required by the nonblocking network.

The propagation characteristics of dielectric waveguides with slanted grating structure are analyzed by using the combination of the improved Fourier series expansion method and the approximated multilayer method. The slanted grating region is appoximated by a structure with stratified thin modulated index layers. This method is effective to the guiding problems of the planar slanted grating, because the electromagnetic fields in each layer can be expressed by shifting the phase of the solution in the first layer. In this paper, numerical results are given for the grating with the rectangular and the sinusoidal profile for arbitrary slant angle. The radiation efficiencies for the grating with negative and positive slant angle are also discussed.

In an image fiber containing a large number of cores, a certain class of crosstalk has been found to decrease with the distance along the fiber axis. This crosstalk is absolutely distinguished from the usual crosstalk that increases with the distance. A theoretical model is presented based on the power transfer between three groups of modes supported by each core. The process of power transfer is described by coupled power equations. Values of the coupling coefficients can be determined from the measurement of the crosstalk. The equations are solved numerically for the transmission of a point image. The results are in good agreement with measurement results.

We have classified parenchymal echo patterns of cirrhotic liver into 3 types, according to the size of hypoechoic nodular lesions. We have been studying an ultrasonic image diagnosis system using the three–layer back–propagation neural network. In this paper, we will describe the applications of the neural network techniques for recognizing and classifying chronic liver disease, which use the nodular lesions in the Proton density and T2–weighed magnetic resonance images on the gray level of the pixels in the region of interest.

A particle trajectory estimation method from far electromagnetic fields are discussed in this paper. Authors have already presented a trajectory estimation method for single particle system and good agreements between a source particle trajectory and an estimated one have been obtained. For this, this paper discusses twin particles system as an examples of multi-particles systems for simplicity. First of all, it is pointed out that far electromagnetic fields from the twin particles system show quite different aspect from the single particle system using an example, radiation patterns produced by two particles which carry out circular motion. This result tells us that any trajectory estimations for general multi-particles system are almost impossible. However, it is shown that when the distance between the particles is small, the estimation method for the single particle system can be applied to the twin particles system, and that twin particles effects appear as disturbance of estimated trajectory.

We present a novel algorithm to reconstruct the refractive-index profile of a circularly symmetric object from measurements of the electromagnetic field scattered when the object is illuminated by a plane wave. The reconstruction algorithm is besed on an iterative procedure of matching the scattered field calculated from a certain refractive-index distribution with the measured scattered field on the boundary of the object. In order to estimate the convergence of the reconstruction, the mean square error between the calculated and measured scattered fields is introduced. It is shown through reconstructing several examples of lossy dielectric cylinders that the algorithm is quite stable and is applicable to high-contrasty models in situations where the Born approximation is not valid.

In this letter we present an electronic circuit based on a neural net to compute the discrete Walsh transform. We show both analytically and by simulation that the circuit is guaranteed to settle into the correct values.

The access control method adopted by UNIX is simple, understandable, and useful. However, it is quite possible that unexpected information flows occur when we are cooperating with some group members on UNIX. Introducing notions such as "flow right," "maximal permission" and "minimal umask value", this note proposes a simple method, can be seen as a natural extension of UNIX, to control indirect information flows without losing availability and understandability of UNIX.

In this paper, we present an approach which is applicable to both the stereo and the motion correspondence problems. We take into account different representations of edge primitives and introduce the idea of Hough Transform to develop a matching algorithm which does not require any local constraints during the matching process.

Multimedia services based on broadband ISDN (B-ISDN) technology need a network architecture that satisfies the requirements of users, carriers, and vendors. This paper describes a new network architecture for B-ISDN service control and management based on INA. We list general requirements, and present implementation issues of INA. A network architecture and main components, which resolve implementation issues, is then proposed. We also describe a video-on-demand service based on our proposed architecture.

This paper describes that a neural network, which consists of neurons with piecewise–linear sigmoid characteristics, is able to approximate any piecewise–linear map with origin symmetry. The neural network can generate "deterministic diffusion" originating from its diffusive trajectory.

This paper presents a new numerical procedure for solving the scattering wave by the moving surface. Recently, the author and her colleagues have proposed a novel numerical procedure of grid generation having a coordinate line coincident with an arbitrarily shaped moving boundary. The time dependent curvilinear coordinate system which coincides with a contour of moving boundary in a physical region is transformed into fixed rectangular coordinate system. The simple form for the transformation is made possible to choose the function between the physical region and the rectangular computational region. The FD-TD algorithm is exactly solved in this fixed rectangular coordinate system. In this paper, for the application of the FD-TD algorithm to the body fitted grid generation with moving boundary, the stability criterion of FD-TD algorithm for the body fitted grid generation with moving boundary in three dimensions is derived. The stability criterion is shown an upper bound for time step assuring stable numerical solutions. The study of scattering of electromagnetic and acoustic wave from a moving or a rotating body is very important for electromagnetic probing of moving body. The problem has been investigated in the past by numerous authors. One of them is solved by FD-TD method, where the linear interpolation is introduced for the movement. By using the presented transformation technique where time component is added to the grid generation, the time depending coordinate system can be transformed into fixed rectangular coordinate system. Then the problems are directly solved by FD-TD method in the transformed coordinate system. To verify this numemical technique, scattered field is evaluated in the case when a plane wave is normally incident on a moving perfectly conducting flat plate. The numerical results are compared with the exact ones and excellent agreement between them is obtained.