Verification of responsive communication protocols is to determine whether they can recover to a normal state within a predetermined time, even when they enter an abnormal state due to any fault. In this paper, we propose a new verification method for responsive communication protocols using virtual system states, each of which represents several system states. Next, in order to evaluate the effectiveness of the new method, we develop a verification tool based on the proposed method. Then we apply the tool to a broadcasting protocol and measure several metrics on the tool. The experimental results show that (1) the number of system states, (2) the amount of memory used by the tool, and (3) the execution time of the tool, can be drastically reduced.

In this paper we consider a parallel and distributed computation of genetic algorithms on loosely-coupled multiprocessor systems. Loosely-coupled ones are more suitable for massively parallel processing and also more easily VLSI implementation than tightly-coupled ones. However, communication overhead on parallel processing is more serious for loosely-coupled ones. We propose in this paper a parallel and distributed execution method of genetic algorithm on loosely-coupled multiprocessor systems of fixed network topologies in which each processor element carries out genetic operations on its own chromosome set and communicates with only the neighbors in order to save communication overhead. We evaluate the proposed method on the multiprocessor systems with ring, torus, and hypercube topologies for benchmark problem instances. From the results, we find that the ring topology is more suitable for the proposed parallel and distributed execution since variety of chromosomes in the ring is kept much more than that in the others. Moreover, we also propose a new network topology called cone which is a hierarchical connection of ring topologies. We show its effectiveness by experimental evaluation.

Surface damage of the electrical contact is a primary cause of failure in many electronic devices which use sliding contacts. Therefore, the quantitative observation of the contact surface is one of the most important subjects for improvement of contact reliability. In this study, in order to clarify the relationship between the contact resistance and the damage on the contact surface, a digital image measuring system (DIMS) was developed. A shadow image processing technique (SIPT) was applied to the damage analysis on the sliding contact surface. The damage width on the contact surface and the damaged image could be obtained with a 3-D graphic image by applying both DIMS and SIPT. Part of the relationship between the damage on the contact surface and the contact resistance could be obtained in the case when Cu is used for the moving contact and Cu and Ni are used for the static contact.

The alloy of Ag (40wt%)-Pd(60wt%) has been used in the electrical contacts of electromechanical devices due to its superior contact properties. There is currently, an increasing trend to decrease the size of electromechanical devices. However, it has been difficult to obtain a high contact force and the high restoring force of contacts, and these problems cause contact failures such as high contact resistance. In response to this problem, the alloy is overlaid with an Au layer which is not affected by oxide films. However, when the contacts are subjected to an unacceptable amount of mechanical shock, adhesion of the Au overlay occurs easily. In order to solve these difficulties, it can be proposed to cover the contact surface with high electric conductive oxide films. With this concept, the Au overlay should be unnecessary. In the present study, to reduce the high contact resistance of the Ag-Pd alloy contaminated with an oxide film, very small amounts of Mg and Cr were used in separate doping trials to the alloy. The improvement of contact resistance characteristics is the focus of the present study. Specimens of Ag (40wt%)-Pd(60wt%), Ag-Pd-Mg(0.1, 0.5 and 1.0wt%), and Ag-Pd-Cr(0.1 and 0.5wt%) were oxidized at elevated temperatures to accelerate the process of oxidation, and the growth kinetic law of oxide films grown on the surfaces were evaluated by ellipsometry. The effect of the oxide film on the contact resistance characteristics were then clarified. A marked improvement of the contact resistance caused by the oxide film was found for the Ag-Pd alloy with a Mg doping agent. However, for the Cr doping agent, a low contact resistance was not obtained as same as the Ag-Pd alloy itself.

In this paper, we compare the performance of evolutionary digital filters (EDFs) for IIR adaptive digital filters (ADFs) in terms of convergence behavior and stability, and discuss their advantages. The authors have already proposed the EDF which is controlled by adaptive algorithm based on the evolutionary strategies of living things. This adaptive algorithm of the EDF controls and changes the coefficients of inner digital filters using the cloning method or the mating method. Thus, the adaptive algorithm of the EDF is of a non-gradient and multi-point search type. Numerical examples are given to demonstrate the effectiveness and features of the EDF such that (1) they can work as adaptive filters as expected, (2) they can adopt various error functions such as the mean square error, the absolute sum error, and the maximum error functions, and (3) the EDF using IIR filters (IIR-EDF) has a higher convergence rate and smaller adaptation noise than the LMS adaptive digital filter (LMS-ADF) and the adaptive digital filter based on the simple genetic algorithm (SGA-ADF) on a multiple-peak surface.

We show that under some conditions an attacker can break the public-key cryptosystem proposed by J. Schwenk and J. Eisfeld at Eurocrypt '96 which is based on the difficulty of factoring over the ring Z/nZ [x], even though its security is as intractable as the difficulty of factoring a rational integer. We apply attacks previously reported against RSA-type cryptosystems with a low exponent to the Schwenk-Eisfeld cryptosystem and show a method of breaking the Schwenk-Eisfeld signature with a low exponent.

In this paper, we study bifurcations of equilibrium points and periodic solutions observed in a resistively coupled oscillator with voltage ports. We classify equilibrium points and periodic solutions into four and eight different types, respectively, according to their symmetrical properties. By calculating D-type of branching sets (symmetry-breaking bifurcations) of equilibrium points and periodic solutions, we show that all types of equilibrium points and periodic solutions are systematically found. Possible oscillations in two coupled oscillators are presented by calculating Hopf bifurcation sets of equilibrium points. A parameter region in which chaotic oscillations exist is also shown by obtaining a cascade of period-doubling bifurcation sets.

We propose ATM switching nodes with a feedback rate control scheme, AREX, which does not require a large buffer space and does not deteriorate throughput even in large-scale and high-speed ATM-WANs. The goal of our study is to establish the ATM multi-protocol emulation network ALPEN, which is an ATM-WAN architecture for establishing a backbone for multimedia networks. ALPEN achieves an ATM-WAN which is robust against long propagation delays. It also provides high performance without a large buffer space in an ATM-WAN environment. In ALPEN, each transit node informs the edge nodes only its residual bandwidth ratio. The edge nodes support multiple ATM-layer services by emulating them based on the information notified by transit nodes. Our research has been directed towards achieving high performance ABR (Available Bit Rate) service in an ATM-WAN by using ALPEN. The conventional ABR service requires transit nodes to have relatively high calculation power and large buffer space to overcome the effect of the long propagation delays common in WANs. ALPEN node systems have been developed for trials with actual network traffic. ALPEN with AREX reduces the calculation load of transit nodes for ABR service. That is confirmed by the size of the DSP program created for a test system. ALPEN with AREX is, therefore, able to emulate ABR service with higher performance in ATM-WANs, because ALPEN edge nodes are able to indicate the users allowed by ER (Explicit Rate) feedback. The network throughput, maximum queue length at congestion point, and burst transmission rate are determined by simulation. ALPEN with AREX achieves better performances than the conventional ABR network.

The ATM switching system accommodating the public switched telephone network (PSTN) and narrowband ISDN (N-ISDN) subscribers should ensure the continued support of existing services and applications and guarantee the same quality of voice services for the telephone users. The voice message connection control discussed in this paper is one of the various technical issues for voice services in the interworking function unit, IWF between asynchronous transfer mode (ATM) node and existing synchronous transfer mode (STM) node [2]. We describe the technical points for the implementation of the voice message connection control with the consideration of the development time and cost. And then we discuss several technical problems such as mapping pulse code modulation PCM coded voice data into an ATM cell, different switching operation, keeping performance of the ATM-PSTN interworking system and then present benefits of the voice message connection control processing from the hardware/software point of views.

Input and output queueing two stage ATM switch model which is effective under variable hot-spot traffic is proposed. In order to prevent the degradation of performance due to hot-spot traffic, the hot-spot route is added in which cells destined to the hot-spot port bypass. The switch applies the backpressure mode basically. When the switch judges that the hot-spot port exists, it routes cells destined there to the hot-spot route and applies the queue loss mode on them. We evaluate both the cell loss probability and the mean system delay under the nonuniform traffic with variable hot-spot port by computer simulation. As the results, it is shown that our proposed switch can achieve better switching performance than those of conventional switches under variable traffic condition.

In this paper we review the stretched-pulse principle and discuss its inherent advantages for ultrashort pulse generation and transmission. An analytic theory of the stretched-pulse fiber laser is presented and shown to be in good agreement with experimental results. An extension of the stretched-pulse theory is applied to both fiber lasers and dispersion-allocated soliton transmission and then compared to numerical results. We also discuss the design and operation of an environmentally stable stretched-pulse fiber laser.

In the first stage of ATM switching system development, the specifications are sometimes changed in order to match revisions in ITU standards. Fatal problems due to specification changes and unexpected bugs force ASIC redesign and subsequent debugging is seriously restricted. These situations demand the introduction of new hardware design methodologies. This paper proposes a flexible hardware design methodology, based on a novel real-time emulation technique, suitable for large-scale high-speed communication switching systems. The emulation technique offers desirable system performance without Application Specific Integrated Circuit (ASIC) fabrication by using commercial Field Programmable Gate Arrays (FPGAs) along with many simply-structured high-speed interconnect switch devices for multiple FPGA connection. This technique suits line interface units (LUs) that have ASICs operating at about 20 MHz; each LU employs an LU board and emulation boards, both of which have hierarchical structures with sub-boards. The emulation boards are indispensable for realizing prototype systems rapidly and dealing with specification changes. Different types of LUs can be realized by mounting different sub-boards to the common LU board. Each emulation board is attached to the LU board by the same connector used for LU sub-board mounting. Therefore, the proposed structure has the advantage of utilizing a common LU board for system emulation as well as permitting the development of practical systems. To suppress undesirable multiple FPGA partitioning, we propose the emulation board architecture that has two types of sub-boards, each of which carries a different type of FPGA. We produced some portions of the proposed LU and tested the nearly 20 MHz real-time emulation of a complicated ASIC designed to realize ATM cell header conversion functions. The results of multiple FPGA partitioning on the emulation board suggest that the proposed design methodology will yield economic systems that can be freely modified to overcome hardware bugs and comply with future ITU standards.

In this paper, we develop a novel method for tuning parameters known as the sensitivity parameters of membership functions used in a fuzzy classifier. The proposed method performs tuning by solving a set of inequalities. Each inequality represents a range of the ratio of the sensitivity parameters between the corresponding pair of classes. The range ensures the maximum classification rate for data of the two corresponding classes used for tuning. First, we discuss how such a set of inequalities is derived. We then propose an algorithm to solve the derived set of inequalities. We demonstrate the effectiveness of the proposed tuning method using two classification problems, namely, classification of commonly used iris data, and recognition of vehicle licence plates. The results are compared with those obtained by using the existing tuning method and with those by neural networks.

Requirements engineering refers to activities of gathering and organizing customer requirements and system specifications, making explicit representations of them, and making sure that they are valid and accounted for during the course of the design lifecycle of software. One very popular software development practice is the incremental development practice. The incremental development refers to practices that allow a program, or similarly specifications, to be developed, validated, and delivered in stages. The incremental practice is characterized by its depth-first process where focuses are given to small parts of the system in sequence to fair amounts of detail. In this paper, we present a development and validation of specifications in such an incremental style using a tool called ASADAL, a comprehensive CASE tool for real-time systems. ASADAL supports incremental and hierarchical refinements of specifications using multiple representational constructs and the evolving incomplete specifications can be formally tested with respect to critical real time properties or be simulated to determine whether the specifications capture the intended system behavior. In particular, we highlight features of ASADAL's specification simulator, called ASADAL/SIM, that plays a critical role in the incremental validation and helps users gain insights into the validity of evolving specifications. Such features include the multiple and mixed level simulation, real-value simulation, presentation and analysis of simulation data, and variety of flexible simulation control schemes. We illustrate the overall process using an example of an incremental specification development of an elevator control system.

We present a new scheduling policy named Value-based Processor Allocation (VPA-k) for scheduling value-based transactions in a multiprocessor real-time database system. The value of a transaction represents the profit the transaction contributes to the system if it is completed before its deadline. Using VPA-k policy, the transactions with higher values are given higher priorities to execute first, while at most k percentage of the total processors are allocated to the urgent transactions dynamically. Through simulation experiments, VPA-k policy is shown to outperform other scheduling policies substantially in both maximizing the totally obtained values and minimizing the number of missed transactions.

Though causal order of message delivery simplifies the design and development of distributed applications, the overhead of enforcing it is not negligible. We claim that a causal order algorithm which does not send any redundant information is efficient in the sense of communication overhead. We characterize and classify the redundant information into four categories: information regarding just delivered, already delivered, just replaced, and already replaced messages. We propose an efficient causal multicast algorithm which prevents propagation of these redundant information. Our algorithm sends less amount of control information needed to ensure causal order than other existing algorithms and can also be applied to systems whose communication channels are not FIFO. Since our algorithm's communication overhead increases relatively slowly as the number of processes increases, it shows good scalability feature. The potential of our algorithm is shown by simulation study.

An adaptive infinite impulse response (IIR) filter implemented using an allpass and a minimum phase system has an advantage of its poles converging to the poles of the unknown system when the input is a white signal. However, when the input signal is colored, convergence speed deteriorates considerably, even to the point of lack of convergence for certain colored signals. Furthermore with a colored input signal, there is no guarantee that the poles of the adaptive digital filter (ADF) will converge to the poles of the unknown system. In this paper we propose a method which uses a linear predictor filter to whiten the input signal so as to improve the convergence characteristic. Computer simulation results confirm the increase in convergence speed and the convergence of the poles of the ADF to the poles of the unknown system even when the input is a colored signal.

This letter gives a study of additionY=X+K mod 2w which is used in some cryptosystems as RC5. Our results enables us to express the differential and linear probability of addition as a function of addendK. To detect a good differential characteristics or linear approximation of a cryptosystem in which extended key is used as addend, we need to consider how the characteristics or approximations behave depending upon the value of the addend, which are clarified by our results.

The Optimal Packet Length (OPL) in packet-switched communication systems has been studied in the literature from various aspects. In this paper, we consider the trade-off between packet length and data transmission delay in a high-speed communication system. To simplify the analysis of the mean data transmission delay, the model is limited to a point-to-point communication system, in which each node complies with the OSI reference model. In order to study the relationship between the OPL and the number of modules performing each protocol, two model communication systems are discussed. In one each node contains two layered protocol modules, and in the other three. Moreover, for both models, the mean data transmission delay is analyzed for two cases depending on whether or not the DLC layer or the network layer performs retransmissions. After studying the OPL which minimizes the mean data transmission delay in each case, we discuss the relationships between the OPLs and the various protocol parameters.

This paper proposes a new method for estimating route outage probability in non-regenerative repeater digital microwave radio systems. In this method, the route outage probability is estimated by various means, including path correlation of fading occurrence and C/N degradation corresponding to the number of non-regenerative repeater stations with and without demodulator devices. In the conventional method, the path correlation is treated as 0 and the C/N degradation is taken as a constant value on each path. To confirm the proposed method's effectiveness, a field test is carried out in which 16QAM signals pass through two non-regenerative repeater stations. The results obtained are in good agreement with the estimated outage probability.