A high-speed data communication service such as inter-LAN is one of many services possible with ATM-based B-ISDN. Design objectives were to simplify the connection setup procedure, to ensure efficient utilization of network capacity, and to reduce delay in servers. These objectives were met in a B-ISDN service trial system featuring distributed connectionless servers connected by permanent virtual channels and cell-by-cell processing in the connectionless server. The system's eight connectionless servers accommodate up to 256 subscriber network interfaces. The authors discuss how multicast can be provided in ATM-based connectionless data networks for inter-LAN communications. Four possible configurations, distinguished by copy function (multicast/broadcast) and on functional arrangement in the inter-connectionless server network (centralized/distributed), are presented. The configurations are compared from perspectives of required hardware and network capacity. The distributed broadcast function is shown the most reasonable solution.

An adaptive algorithm is presented for fuzzy clustering of data. Partitioning is fuzzified by addition of an entropy term to objective functions. The proposed method produces more convex membership functions than those given by the fuzzy c-means algorithm.

Broadband multimedia information environments are part of the next big advance in communications and computer technology. The use of multimedia infrastructures in offices is becoming very important. This paper deals with a service concept and human interfaces based on a paper metaphor. The proposed service offers the advantages of paper and eliminates the disadvantages. The power of multimedia's expressiveness, user interaction, and hypermedia technology are key points of our solution. We propose a system configuration for implementing the service/human interface.

In this paper, two models for associative memory based on a measure of manhattan length are proposed. First, we propose the two-layered model which has an advantage to its implementation by using PDN. We also refer to the way to improve the recalling ability of this model against noisy input patterns. Secondly, we propose the other model which always recalls the nearest memory pattern in a measure of manhattan length by lateral inhibition. Even if a noise of input pattern is so large that the first model can not recall, this model can recall correctly against such a noisy pattern. We also confirm the performance of the two models by computer simulations.

This article analyzes the property of the fully interconnected neural networks as a method of solving combinatorial optimization problems in general. In particular, in order to escape local minimums in this model, we analyze theoretically the relation between the diagonal elements of the connection matrix and the stability of the networks. It is shown that the position of the global minimum point of the energy function on the hyper sphere in n dimensional space is given by the eigen vector corresponding the maximum eigen value of the connection matrix. Then it is shown that the diagonal elements of the connection matrix can be improved without loss of generality. The equilibrium points of the improved networks are classified according to their properties, and their stability is investigated. In order to show that the change of the diagonal elements improves the potential for the global minimum search, computer simulations are carried out by using the theoretical values. In according to the simulation result on 10 neurons, the success rate to get the optimum solution is 97.5%. The result shows that the improvement of the diagonal elements has potential for minimum search.

A technique is presented for constructing (d,k) block codes capable of detecting single bit errors and single peak-shift errors in consecutive two runs. This constrains the runlengths in the code sequences to odd numbers. The capacities and the cardinalities for finite code length of these codes are described. A technique is also proposed for constructing (d,k) block codes capable of correcting single peak-shift errors.

This paper presents a new algorithm for finding the kth-shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.

This paper discusses a formulation of a basic theory of the information systems, where information is not only transmitted, but is also processed and memorized during the transmission. A deterministic procedure applied by an information system is defined as a logical work, and two measurements with information X, information quantity I(X) and information vitality T(X), are introduced. A system with the ability of transmitting, processing and memorizing information is called an information engine. A system of interconnected information engines is called an information network. The power of an information engine is defined as the maximum capacity of the logical works performed by the engine, and important properties of total power of information network are derived. Response time characteristics and cost minimizing problems of an information network are also discussed.

This paper describes a text-independent speaker recognition method using predictive neural networks. For text-independent speaker recognition, an ergodic model which allows transitions to any other state, including selftransitions, is adopted as the speaker model and one predictive neural network is assigned to each state. The proposed method was compared to quantization distortion based methods, HMM based methods, and a discriminative neural network based method through text-independent speaker identification experiments on 24 female speakers. The proposed method gave the highest identification rate of 100.0%, and the effectiveness of predictive neural networks for representing speaker individuality was clarified.

Broadband ISDN, using asynchronous transfer mode, are expected to carry traffic of different classes, each with its own set of traffic characteristics and performance requirements. To achieve the quality of service in ATM networks, a suitable buffer management scheme is needed. In this paper, we propose a buffer management scheme using a priority service discipline to improve the delay time of delay-sensitive class and the packet loss ratio of loss-sensitive class. The proposed priority scheme requires simple buffer management logic and minor processing overhead. We also analyze the delay time and the packet loss ratio for each class of service. The results indicate that the required buffer size of the proposed priority scheme is reduced and the delay time of each class of service is controlled by a parameter. If the control parameter is appropriately chosen, the quality of service of each class is improved.

The current telecommunication network is structured in two layers: The intelligent layer that includes Intelligent Network (IN) nodes and Operation, Administration and Maintenance (OAM) nodes, and the transport layer that includes Network Elements (NEs). The transport layer carries user Information (Iu) from end-users as well as control and OAM Information (Ic&o) from IN/OAM nodes. The quick deployment of new IN services and OAM capabilities that will need (a) flexibility and easy management, and (b) an effective handling method for searching the huge amount of data among distributed databases, will be two requirements to be satisfied. Integrating various types of Ic&o into a unique Ic&o transport network and using ATM technique as a transport technique satisfies partly the requirement (a). To completely meet both requirements, this paper proposes the following solutions:(a) Intelligent layer connections and transport layer connections should be managed independently: The necessary mapping between the Logical Destination Address (LDA) that represents the logical address of the physical entity where data are routed, combined with the Quality Of Service (QOS) type, and the ATM connection IDentifier (ID), that is to say the Virtual Channel Identifier/ Virtual Path Identifier (VCI/VPI), is provided by specific nodes (the Ic&o network Management Nodes (Ic&o MNs)) belonging to an intermediate layer, i.e., the Ic&o network management layer.(b) The widely distributed aspect of the databases also needs a very effective data handling method. This paper proposes to implement a Distributed Directory System (DDS) into both intelligent nodes and Ic&o MNs.In order to apply the DDS function to 2 functional levels, the following items are studied: First, the possible mapping of DDS functions into the intelligent node functions is proposed. Second, this paper gives an interaction scenario between intelligent nodes and Ic&o MNs, to translate the LDA/QOS type into VPI/VCI. Finally, the analysis of the mapping of LDA/QOS type into VCI/VPI at the ATM level shows that the Ic&o network based on VP backbone offers the best compromise between flexibility, complexity and cost.

Broadband ISDN based on ATM technologies is expected to offer enhanced and sophisticated services to customers. Since ATM will first be introduced in the business communication world, it will be worth to discuss the future image of desirable ATM customer premises network (CPN). In this paper, we first consider the possible migration scenario of Broadband CPN and some important requirements for the realization of the scenario. Then, we discuss the key issues to be solved for future ATM-CPN, which include network topology, traffic control and connectionless communication services.

A new method is proposed for automatically evaluating the English pronunciation quality of non-native speakers. It is assumed that pronunciation can be rated using three criteria: the static characteristics of phonetic spectra, the dynamic structure of spectrum sequences, and the prosodic characteristics of utterances. The evaluation uses speech recognition techniques to compare the English words pronounced by a non-native speaker with those pronounced by a native speaker. Three evaluation measures are proposed to rate pronunciation quality. (1) The standard deviation of the mapping vectors, which map the codebook vectors of the non-native speaker onto the vector space of the native speaker, is used to evaluate the static phonetic spectra characteristics. (2) The spectral distance between words pronounced by the non-native speaker and those pronounced by the native speaker obtained by the DTW method is used to evaluate the dynamic characteristics of spectral sequences. (3) The differences in fundamental frequency and speech power between the pronunciation of the native and non-native speaker are used as the criteria for evaluating prosodic characteristics. Evaluation experiments are carried out using 441 words spoken by 10 Japanese speakers and 10 native speakers. One half of the 441 words was used to evaluate static phonetic spectra characteristics, and the other half was used to evaluate the dynamic characteristics of spectral sequences, as well as the prosodic characteristics. Based on the experimental results, the correlation between the evaluation scores and the scores determined by human judgement is found to be 0.90.

This paper treats mutual exclusion of a single shared-resource in distributed autonomous environments. The most important property of the autonomous network treated in this paper is its membership variability, that is, frequent occurrence of entries of new nodes and exits of old nodes. Thus, when the network is large-scale, it is not possible for each node to keet up the information of all other nodes. We in this paper design a mutual exclusion algorithm for distributed environments of autonomous nodes based on Chandy-Misra protocol for Dining Philosopher (diners) problems, which realizes a distributed implementation of the token ring method. We consider requirements of the communication topology that makes mutual exclusion possible, and propose entry and exit protocols for each node to perform them individualistically and autonomously.

Responses in the Nagumo neural circuit to pulse-train stimulation are studied using the time sequence, phase diagram, Poincare section, return map, firing rate, Lyapunov number and bifurcation diagram. For the mono-stable neuron with an equilibrium point deeper than the maximal point of a tunnel diode curve, main responses are periodic or all-or-none and chaotic responses are rarely observed. For the neuron with an equilibrium point located near the maximal point, the response to one input pulse oscillates after the undershoot and responses to pulse-trains make complex bifurcation structure in the threshold diagram. The ranges of periodic responses are stratified in the diagram. There exist broad regions of chaotic responses and chaos is not a special response of the Nagumo circuit, but it often comes out. The results are different from those obtained from Hodgkin-Huxley equations and the BVP model.

Asynchronous Transfer Mode (ATM) is an information transport technique that well supports Broadband ISDN (B-ISDN). One unsolved problem to the perfection of ATM networks is to provide a testing environment that conforms to some standardized network management scheme. From this point of view, remotely controlled virtual path testing is considered in this paper. Remotely controlled virtual path testing should be executed through the standardized Telecommunications Management Network (TMN) model, which employs the OSI systems management concept as the basis of information exchange. Thus, this paper addresses the two issues that arise when OSI systems management standards are applied to virtual path testing. One issue is to define relevant information models. The other issue is to provide test resources with a concurrency control mechanism that guarantees a consistent test environment without causing deadlocks. To resolve these issues, technical requirements are clarified for the remote control of test resources. Next, alternatives to the concurrency control mechanism are shown and compared through computer simulations. A method of defining information models is then proposed. The proposed method ensures the easy storage and retrieval of intermediate test results as well as permitting the effective provision of concurrency control for test resources. An application scenario is also derived. The scenario shows that tests can be executed by using standardized communication services. These results confirm that virtual path testing can be successfully achieved in conformance with the OSI systems management standards.

This paper proposes the laser diode receiving mixer which utilizes the laser diode nonlinearity. The laser diode receiving mixer can make the bidirectional fiber optic link simple and cost-effective. These laser diodes are applied to configure the LD-LD MIX link which consists of two laser diodes, two local oscillators, two microwave switches and one fiber cable. The LD-LD MIX link configuration is extended to introduce novel two fiber optic links, i.e. the local suppression link and the image cancellation link. These links utilize the combination of microwave circuits and optical devices. These configurations are experimentally investigated at microwave frequencies and the QPSK signal transmission is successfully demonstrated.

In coherent optical subcarrier multiplexing (SCM) systems, the performance degradation of the system due to the phase noise of lasers restricts the maximum number of stations and channels that the system can serve. However, the effects of phase noise on the performance of the coherent SCM system with distributing Local Oscillator (LO) in local loop have not been analyzed. On the other hand, a limit on both the number of channels and stations can be effectively alleviated by using coding technique. In this paper, the effects of phase noise of lasers on the performance of frequency shift keying (FSK) SCM system with distributing LO in local loop are analyzed in terms of carrier-to-noise ratio (CNR) penalty. Second, the effects of Reed-Solomon (RS) coding on FSK SCM system with distributing LO in local loop are analyzed. It is shown that both the number of channels and stations can be increased by using coding technique.

We apply Fahlman and Lebiere's (FL) algorithm to network synthesis and incremental learning by making use of already-trained networks, each performing a specified task, to design a system that performs a global or extended task without destroying the information gained by the previously trained nets. Investigation shows that the synthesized or expanded FL networks have generalization ability superior to Back propagation (BP) networks in which the number of newly added hidden units must be pre-specified.

A theoretical method is required for prediction of mean field strength in land mobile radio systems, instead of the conventional empirical methods. Feasibility study of theoretical prediction using the ray-tracing method, was made in a 1.2GHz band for a model of a small-cell system. Theoretical values showed better agreement with the measured, when diffraction around the side edges of a building is taken into account. Comparison between mean field strengths in summer and winter suggested the seasonal variations in attenuation due to trees.