We predict that chemical waves can propagate as a guided mode in a reaction-diffusion system that consists of two regions with different wave speeds. In comparison with electromagnetic waveguides, unique features of the guided chemical waves can be seen in their dispersion characteristics. Conditions for supporting lowest-loss guided waves are discussed.

As a generalization of the tree automaton, tree automata with various types of memory are introduced and their relation to context-free grammars with memory is studied. Relations between computation trees of tree automata with memory and derivation trees of context-free grammars with memory are established, and as a consequence, the languages generated by context-free grammars with memory are characterized in terms of the sets of trees recognizable by tree automata with memory. Also various types of traversal of labeled trees recognizable by tree automata with memory are considered.

Among the problems that face ITS designers, the problem of measuring the student knowledge state after concept learning in order to initially adapt a skill acquisition session according to a student's own necessities is a hard one. Typical approaches are the use of some sort of test to assess the student knowledge and choose an initial set of parameters for a session, or use, regardless the particular necessities of a student, a pre-defined set of initial parameters. We consider the fromer to be disrupting for learning and the latter too simple to deal with the broad possibilities that are faced. It is known that students show different behaviors during concept learning depending on the experience, background and actual understanding (the way a student is understanding a concept) during concept learning. Our approach here is to classify the different behaviors through fuzzy proposition and link them with a student model through fuzzy rules to use in an expert system, and with it, select the most suitable problem-solving strategy for each particular student in order to clear his misunderstandings and facilitate the learning of problem-solving skills. The use of probabilistic reasoning (i.e. Bayesian statistics) instead of fuzzy logic is not suitable for the present situation because of the rigidity and precision of the rules that do not allow a proper manipulation of the vagueness involved in the student behavior. We apply this idea to a circuit analysis ITS where the concept learning session is carried out on a Hypertext environment and the skill acquisition session on an interactive problem-solving environment. By tracing the student use of the Hypertext environment we can know the student behavior and use it as a premise in the fuzzy inference.

We modified the adaptive fuzzy classification algorithm (AFC), which allows fuzzy clusters to grow to meet the demands of a given task during training. Every fuzzy cluster is defined by a reference vector and a fuzzy cluster radius, and it is represented as a shape of hypersphere in pattern space. Any pattern class is identified by overlapping plural hyperspherical fuzzy clusters so that it is possible to approximate complex decision boundaries among pattern classes. The modified AFC was applied to recognize handwritten digits, and performances were shown compared with other neural networks.

In communication protocols, the behaviour of a protocol entity is related to the behaviour of another protocol entity as they communicate under sets of communication rules (protocols). Thus, it is desirable to concentrate on the design of one protocol entity and generate the corresponding protocol entity automatically. Furthermore, it is desirable that the protocol is formal, precise and unambiguous that is, it is described using FDTs (Formal Description Techniques). In this paper, we propose a protocol synthesis algorithm in which, from a LOTOS specification of a single given entity, LOTOS specification of the corresponding peer entity is generated automatically. Unlike previous works, where FSMs (Finite State Machines) were used to synthesize protocols, we use LOTOS, which is one of FDTs developed by ISO, in our proposed synthesis algorithm. We prove that the generated protocol is logical errors free, collectively represented as deadlock free, if the given entity is in certain forms which are natural in the context of connunication protocols.

Measuring mechanical characteristics of optical disks is significant not only for designing drives but also for assuring disk interchangeability. This paper shows that the lens-movement detection method has the greatest overall potential and thus fits to a practical system for measuring mechanical characteristics. A system based on this method was constructed by developing simple and accurate capacitive sensors that can be built into an optical head to detect lens movement. The system configuration includes a precision turntable and a high-duarability reference disk to fully extract the potential. Test results show that this measuring system has adequate measuring range, accuracy, and stability. Some applications of this system are described in this paper. They show that the system is useful for evaluating and improving optical disk mechanical characteristics.

Creating a bandwidth abundant B-ISDN requires the further development of path technologies. Optical path cross-connect nodes (OXCs) will be required that offer very high levels of expandability. The present limited traffic demands must be efficiently supported while permitting easy step-wise expansion in capacity. This paper proposes two OXC architectures that offer high modularity with regard to incoming/outgoing links or the number of multiplexed wavelengths in each link. This paper briefly reviews, for optical path realization, the wavelength path (WP) and the virtual wavelength path (VWP) techniques. The proposed OXC architectures provide flexibility and minimum investment to encourage introduction but support incremental network growth and investment to match traffic demand. The architectures make it easy to upgrade a WP network to a VWP network, simply by replacing some optical components. It is also shown that the proposed OXC architectures ensure effective optical signal detection after a long-haul optical fiber transmission because they minimizes signal power losses within the OXC. Therefore, the proposed OXC architecture can be applied to global area networks. The proposed OXC architectures will play a key role in realizing the optical path infrastructure for the future bandwidth abundant B-ISDN.

Management of control functions in large computer networks is a very difficult problem. One of the effective way to overcome the difficulty is to introduce hierarchical control structure (network cluster) in the management. When a fault occurred in the cluster, routing information at some nodes in the network must be updated in order to react the fault. However, the number of such nodes can be reduced by introducing ingenious topology into the cluster. This paper presents a fundamental discussion on network topology for a network cluster. First, L-FT is defined to represent a degree of fault-tolerance in a cluster with respect to link failures. Secondly, the minimum link problem M is defined to find the minimum number of links to make the cluster L-FT. The following results are obtained. (1) For a network cluster with the fault-tolerant topology 1-FT, at least 2n-2 links have to exist in the cluster where n is the number of border nodes in the cluster. (2) As far as connectivity of the whole network is held, for multiple L link failures in a L-FT cluster, the update of routing information at each node is localized within only the cluster containing the failed links. (3) Several hierarchical networks with fault-tolerant conditions are presented as case studies for a LAN and a MAN.

In a distributed system, the protocol entities must exchange some data values and synchronization messages in order to ensure the temporal ordering of the events described in a service specification for the distributed system. It is desirable that a correct protocol specification can be derived automatically from a given service specification. In this paper, we propose an algorithm which synthesizes automatically a correct protocol specification from a service specification described as a Marked Graph with Registers (MGR) model and resources (registers and gates) allocation information. This model has a finite control modeled as a marked graph. Therefore, parallel events can be described. In our method, to minimize the number of the exchanged messages, we use a procedure to calculate an optimum solution for 0-1 integer linear programming problems. The number of the steps which each protocol entity needs to simulate one transition in the service specification is also minimized. Ways to avoiding conflict of registers are also described. Our approach has the following advantages. First, parallel events can be described in a service specification. Secondly, many practical systems can be described in the MGR model. Finally, at the protocol specification level, we can understand what events can be executed in parallel.

High-speed pulse propagation, up to several hundred Mbps or higher, will play an important role in telecommunication systems for B-ISDN. High-performance packaging, especially high-speed, high-throughput interconnection, is strongly required. For advanced telecommunication systems, giga-bit signal transmission has been developed at the multi-chip module level, and 300 to 600 Mbps signal transmission has been reached at the printed circuit board level. Electrical inter-cabinet interconnections of 150 to 300 Mbps have been achieved for up to several tens of meters. High-speed, high-throughput connectors are the key to achieving high-performance telecommunication packaging systems. Two technologies are extremely important. One is for high-density, high-pin-count connectors, and the other is for high-speed signal transmission connectors. The requirements for the connectors needed for advanced high-performance telecommunication systems are described. Several high-density, high-bandwidth connectors developed for high-performance packaging system are introduced.

With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.

Different signature codes in an optical code division multiple access (CDMA) network have been known to demonstrate different performances. The performance of different signature codes in an optical CDMA network was analyzed here in this paper by including the performance evaluation for the synchronization process which was not considered previously. Both auto- and cross-correlation properties of the signature codes were found to be important. In addition, the performance comparison of (n, w1, 1, 1), (n, w2, 2, 1) optical orthogonal codes (OOC's), and (n, w3, w3, 1) extended prime code demonstrated that an (n, w2, 2, 1) OOC could accommodate more users than the other two.

This paper describes a newly developed 22 liquid crystal optical switch for 1.3µm single-mode fiber use. This switch state can be freely set at either the cross or the bar state. The measured performance of two prototype 22 liquid crystal optical switches is given. Tests confirm that the 3 values are a maximum insertion loss of 1.5dB, a crosstalk attenuation of more than 26.1dB, and a return loss of more than 28.9dB. Requirements for optical switches for fault isolation are theoretically clarified from a LAN system view point.

Kumar and Billinton have presented a new technique for obtaining the steady-state probabilities from a flow graph based on Markov model. By examining the graph and choosing suitable input and output nodes, the steady-state probabilities can be obtained directly by using the flow graph. In this paper this graphical technique is applied for a k-out-of-n: G repairable system. Consequently a new derivation way of the formulae for the steady-state availability and MTBF is obtained.

A Wavelength Division Multiaccess (WDMA) network with buffer sharing among stations is studied. All stations in the network are connected to a passive optical star coupler and each station has a different fixed wavelength laser for transmitting packets. Each station in the network reports its packet backlog to a scheduler which computes and then broadcasts a transmission schedule to all the stations through a control channel in each time slot. A transmission schedule includes two types of assignments: 1) assign a maximum number of stations for conflict-free transmissions, and 2) assign the relocation of packets from congested stations to uncongested relaying stations through idling transceivers for distributed buffer sharing. The first assignment aims at maximizing throughput and the second assignment aims at minimizing packet loss. Simulation results show that as much as 75% of the buffers can be saved with the use of buffer sharing when 50% of the packets are of the non-sequenced type.

An alias free parallel structure for adaptive digital filters (ADF's) is considered. The method utilizes the properties of the Frequency-Sampling Filter (FSF) banks to obtain alias free points in the frequency domain. We propose a new cost function for parallel ADF's. The limiting value analysis of system identification using proposed cost function is given in stochastic sense. It is also shown by simulation examples that we can carry out precise system identification. The cost function is defined in each bin; accordingly, it enables the parallel processing of ADF's.

An unsupervised segmentation technique is presented that is based on a layered statistical model for both region shapes and the region internal texture signals. While the image partition is modelled as a sample of a Gibbs/Markov random field, the texture inside each image segment is described using functional approximation. The segmentation and the unknown parameters are estimated through iterative optimization of an MAP objective function. The obtained tesults are subjectively agreeable and well suited for the requirements of region-oriented transform image coding.

A new positioning method for higher track density hard disk using embossed-servo-mark magnetic disks is proposed. An embossed-servo-mark medium with grooved-guard-band data tracks for 208 TPMM was developed using molded plastic substrate. The marks were magnetized so that conventional magnetic head can reproduce position signals. Simple analogy from optical disk track following to magnetic disk track following was taken and examined. A DSP controlled feed-forward servo was introduced to resolve the inherent eccentricity caused by mounting preformed tracks onto an independent spindle axis. The prototype drives with a form factor of 2.5 inches were designed introducing the disks, the servo scheme and the newly developed orthogonal MR head. As a result, an areal density of 650 kbits/mm2 (about 420 Mbits/in2) recording was successfully demonstrated on the media using 2.5-inch form factor prototype drives.

The classical supervised learning algorithms for optimizing multi-layered feedforward neural networks, such at the original back-propagation algorithm, suffer from several weaknesses. First, they have the possibility of being trapped at local minima during learning, which may lead to failure in finding the global optimal solution. Second, the convergence rate is typically too slow even if the learning can be achieved. This paper introduces a new learning algorithm which employs a genetic-type search during the learning phase of back-propagation algorithm so that the above problems can be overcome. The basic idea is to evolve the network weights in a controlled manner so as to jump to the regions of smaller mean squared error whenever the back-propagation stops at a local minimum. By this, the local minima can always be escaped and a much faster learning with global optimal solution can be achieved. A mathematical framework on the weight evolution of the new algorithm in also presented in this paper, which gives a careful analysis on the requirements of weight evolution (or perturbation) during learning in order to achieve a better error performance in the weights between different hidden layers. Simulation results on three typical problems including XOR, 3-bit parity and the counting problem are described to illustrate the fast learning behaviour and the global search capability of the new algorithm in improving the performance of back-propagated network.

Exact analytical solutions for the steady-state transmission and reflection characteristics of a nonlinear Fabry-Perot resonator applicable to bistable optical devices are derived. The resonator consists of a Kerr-like nonlinear film sandwiched by reflection mirrors made of a quarter-wave dielectric stack. An equivalent mirrorless model has been introduced to facilitate the analysis. For both positive and negative nonlinear coefficients, the rigorous solutions have been simply expressed in terms of Jacobian elliptic functions.