Two new algorithms for performing modular exponentiation are suggested. Nonstandard number systems are used. The first algorithm is based on the representing the exponent as a sum of generalized Fibonacci numbers. This representation is known as Zeckendorf representation. When precomputing is allowed the resulting algorithm is more efficient than the classical binary algorithm, but requires more memory. The second algorithm is based on a new number system, which is called hybrid binary-ternary number system (HBTNS). The properties of the HBTNS are investigated. With or without precomputing the resulting algorithm for modular exponentiation is superior to the classical binary algorithm. A conjecture is made that if more bases are used asymptotically optimal algorithm can be obtained. Comparisons are made and directions for future research are given.

This paper deals with the information leakage measurement in a distributed computation protocol called SASC. The SASC protocol is a kind of two-party protocol between a client and a server. The computation for RSA cryptosystem is the target of this paper. This paper shows that a secure RSA-SASC protocol proposed recently could be changed to be insecure if the client which has secret information were to complain about the computation result. This paper first clarifies how to measure the information amount which leaks through the protocol. It, then, shows an attack procedure to make use of the client's complaint. Effectiveness of the attack procedure is measured by the information theoretic measure. By using the same measure, it is shown that some attacks do not work to derive the client's secret. It is also shown that a practical countermeasure to limit the number of incorrect computation allowed is effctive to limit the leakage of the secret information to some reasonable extent.

In this paper a method of recognizing waveform based on the Discrete Wavelet Transform (DWT) presented by us is applied to detecting the K-complex in human's EEG which is a slow wave overridden by fast rhythms (called as spindle). The features of K-complex are extracted in terms of three parameters: the local maxima of the wavelet transform modulus, average slope and the number of DWT coefficients in a wave. The 4th order B-spline wavelet is selected as the wavelet basis. Two channels at different resolutions are used to detect slow wave and sleep spindle contained in the K-complex. According to the principle of the minimum distance classification the classifiers are designed in order to decide the thresholds of recognition criteria. The EEG signal containing K-complexes elicited by sound stimuli is used as pattern to train the classifiers. Compared with traditional method of waveform recognition in time domain, this method has the advantage of automatically classifying duration ranks of various waves with different frequencies. Hence, it specially is suitable to recognition of signals which are the superimposition of waves with different frequencies. The experimental results of detection of K-complexes indicate that the method is effective.

This paper proposes a method for constructing an interface between an operations system and a workstation (OpS-WS interface) in a telecommunications management system based on TMN. To construct this interface, an appropriate communication protocol must be selected to perform management through efficient message exchange. The human machine interface provided by the WS should specify the managed objects. The interface also needs to be implemented so as to minimize the software revisions needed when the computer or its associated window system, or both, are changed. The proposed method addresses all these requirements. GUI components for realizing the HMI function are defined as Managed Objects as are communication network resources. Therefore, the communication protocol in TMN is defined as unique and it is possible to separate the HMI Interface from the OpS. CMIP is employed as the communication protocol to provide efficient message exchange. Software components that realize the human machine interface are selected so as to satisfy functional requirements specific to telecommunications management. The managed objects (MOs) and their relationships are investigated in order to represent these components appropriately. In the proposed method, the CMIP-based OpS-WS interface allows the OpS to take the manager role and the WS take the agent role. An implementation technique for MOs is also presented. The technique enables the software that implements MO behaviour to be coded easily. A prototype is built to confirm the correct operation of the proposed OpS-WS interface, and it is shown that CMIP requires fewer message exchanges to indicate alarms on the WS than other protocols. The proposed method is also advantageous because of its flexibility. That is, the WS software can be updated with little effort when the computer or its associated window system, or both, are changed.

Telecommunications management activities have mostly been supported by operators; however, machines are gradually playing more important roles in the management arena by utilizing computing technology. Additionally, management systems can now be networked by using standard interface specifications. The study of human and machine integration is thus essential for achieving the sophisticated management objectives of telecommunications. This paper proposes the principles for a telecommunications management integration network (TMIN), which integrates human and machine management networks, and proposes a source text description method for transferring management communication knowledge from human to machine. First, reference models are proposed for the management process and management communication. These models cover network management activities of both humans and machines. Second, the contents of the source text are clarified. Source text presents human management knowledge in a form suitable for machine-machine communication. Third, an efficient source text description method is proposed that reduces redundancy and proliferation. Finally, a means of harmonizing management information definitions with TMIN is suggested to facilitate human-machine cooperation.

The improved point-matching method with Mathieu function expansion for the accurate analysis of the W-type elliptical fiber with layers of any ellipticity is proposed. Results of our method are reliable, because we expand the electromagnetic fields by a sum of the complete set of wave functions in each layer of the fiber. Numerical results are presented for the highly-birefringent fibers with a hollow layer outside an elliptical core. It is found that such fibers can realize the large value of the modal birefringence as well as they can be suitable for the single-mode and single-polarization transmission. From the convergence tests, it is confirmed that the relative error of the modal birefringence is less than 0.01%. The comparison of our results with those by previously reported method is presented. The proposed method can be extended for analysis of the elliptical-core fibers with hollow pits and electromagnetic scattering by targets of the complex elliptical geometry.

Mobile communication networks need public key cryptosystems that offer both low computation cost and user authentication. Tatebayashi et al. showed a key distribution protocol for such networks at Crypto'89 based on low exponent RSA. This paper shows that their protocol is not secure. We also present two types of secure and efficient key distribution protocols.

Telecommunications management is essentially an aggregation of a wide range of activities, including operations and management (O & M) of telecommunications services and customers as well as the network and network elements. During the period of rapid growth in telecommunications, the highest priority was to meet increasing market demand and to construct a telecommunications network infrastructure. Therefore, research and development in telecommunications management were subordinated to the evolution of telecommunications services and systems. Recently, customers have been demanding higher quality services, as a variety of new, advanced services have been introduced. This has led to the need to integrate telecommunications services and O & M services. This paper first reviews the history of the development of telecommunications O & M in parallel with the progress of telecommunications in Japan and clarifies specific features in each step of this progress. This analysis identifies urgent problems and their solutions. The results suggests that telecommunications O & M and O & M services should be considered as a key to making future services possible and to the value of those services in a multi-media telecommunications services environment. Based on these studies, the future direction of O & M is then shown, focusing on cooperative O & M involving the customer in the multi-media, multidomain telecommunications environment.

This paper proposes that a combination of pre-chirping and dispersion compensation is effective in suppressing the waveform distortion due to the self-phase modulation and the group-velocity dispersion in 10 Gb/s repeaterless transmission using 1.3-µm zero-dispersion single-mode fibers (SMF) operating at a wavelength of 1.55µm. The following results were obtained through simulation. 1) Setting the α-parameter of a LiNbO3 optical modulator negative (α1.0) gives a large tolerance of the launched power Pin. 2) For 90-km SMF transmission, the maximum Pin is obtained when the dispersion compensation ratio β is from 50% to 70%. 3) For the allowable β as a function of the transmission distance when a dispersion compensator is located in the receiver (post-compensation scheme), the lower limit of β is determined by the constant residual dispersion value, which agrees well with the dispersion tolerance without dispersion compensation. Our 90-km SMF transmission experiments using a LiNbO3 optical modulator and a dispersion compensating fiber (DCF) confirmed the simulation results regarding the optimum value of β and the large tolerance of the fiber launched power. Based on the above investigations, we achieved a 10-Gb/s repeaterless 140-km SMF transmission with α1.0 and post-compensation.

Wavelength-division multiplexing (WDM) optical switching networks are one of most attractive technologies in optical interconnections. By combining with time-division multiplexing (TDM) and space-division multiplexing (SDM) technologies, remarkably high-throughput interconnections may be accomplished. In this paper, we propose WDM switching networks with time-division multiplexed optical signals by using free-space optics. We also propose novel WDM interconnections, including multiple-wavelength light-sources, optical fibers and wavelength-selectable detectors. We successfully confirmed basic principles for the WDM interconnections.

This paper proposes a suitable distributed computing model as the basis for building a network management system. Author has been studying a distributed reactive model, called Meta for this purpose at Cornell University. Effectiveness using Meta is to provide high level program interface for developing network management system, and programmers can achieve network management system with coding small amount of programs. It also realizes easy additions and modifications for network management application programs. To confirm the effectiveness of the proposal, the author has utilized Meta to implement an experimental network management system. The experimental system provides high level interfaces for monitoring and controlling network components. It also supports reliable communication over distributed nodes. Preliminary evaluation of the system shows that critical network management applications are provided within an appropriate response time for all applications provided by SNMP, with small development cost and easy system modification.

A simple method is presented to calculate the parasitic capacitance effect in the propagation delay of series-connected MOS (SCM) structures. This method divides SCM circuits into two parts and accurately calculates the contribution of each part to the difference from the delay without parasitic capacitances.

Trouble management is a key function in solving the problems and maintaining the high communications capability of a network when communication service network users encounter problems in the quality of services [1]. This paper proposes technologies and architecture for an intelligent management system to achieve advanced service/network trouble management. The system generates operation scenarios to find a cause to solve a reported trouble, executes them, and modifies them according to operation circumstance changes. In the scenario execution process, fault propagation simulation is used to isolate a fault in necessary cases. The evaluation of the system applied to the ISDN services shows that the proposed system can achieve high-speed, precise trouble management by the integrated cooperative work of a human (operator) and a machine (operation system).

For an application to the optical signal processing devices, we propose the optical X coupler which consists of two bending waveguides and a nonlinear dielectric region. To analyze this structure accurately we utilized the iterative finite difference beam propagation method (iterative FD-BPM). In this paper the formulation of the iterative FD-BPM for one wave and two waves cases are presented, respectively. We investigate following two cases. First, we consider the case that the light is launched into one of the input ports. We calculate the evolutions of the field amplitude and the transmission characteristics for the input power. Second, we consider the case that the signal light with the constant power is launched into one of the input ports and that the control light with the wavelength different from that of the signal light is launched into another input port. We calculate the evolutions of the field amplitude and the transmission characteristics of the signal light for the power of control light. As a result of the analysis, we show that all-optical switching operation is possible in the proposed structure.

A negation-limited circuit is a combinational circuit which includes at most [log(n1)] NOT gates. We show a relationship between the size of negation-limited circuits computing clique functions and the number of NOT gates in the circuits.

Exploiting the full potential of a multiprocessor system requires a good job scheduling algorithm. In this paper we analyze three dynamic job scheduling algorithms in multiprocessor systems. These algorithms are based on static job scheduling algorithms, LPT (longest processing time first), SJF (shortest job first), and LPR (largest processor requirement first), each of which exhibits good performance in terms of asymptotic upper bound on the makespan of the schedule generated by it. We analyze their performance in the dynamic case experimentally, where we have a stochastic stream of jobs with arbitrary processing time and processor requirement. We compare their performance with the FCFS algorithm and its simple extension. Except for LPT, the algorithms are found to perform significantly better than FCFS, while among themselves SJF performs the best, followed by K-LPR, a variation of LPR. We also consider the fairness aspect of these algorithms and propose a general technique to impose fairness on these algorithms. Finally, we analyze the impact of imposing fairness on the performance of these algorithms.

This paper describes a method of coding image sequences based on global/local motion information. The suggested method initially estimates global motion parameters and segments a target region from a given image. Then we coded background and target region by assigning more bits to the target region and less bits to background in order to reconstruct the target region with high quality. Simulations show that the suggested algorithm has better result than the existing methods, especially in the circumstances where background changes and target region is small enough compared with that of background.

A near-ring is an extended notion of a usual ring. Therefore a ring is a near-ring, but the converse does not necessarily hold. We investigate in this paper one-way functions associated with finite near-rings, and show that if there exists a one-way group homomorphism, there exists a one-way non-ring near-ring homomorphism (Theorem 1); if there exists a one-way ring homomorphism (Theorem 2). Further, we introduce a discrete logarithm problem over a finite near-ring, and show that the integer factoring is probabilistic polynomial-time Turing equivalent to a modified version of this problem (Theorem 3). Theorem 1 implies that under some standard cryptographic assumption, there is an affirmative but trivial solution to the extended version of the open question: Is there an encryption function f such that both f(x+y) and f(xy) are efficiently computed from given f(x) and f(y) ?

We have fabricated a new analog memory with a floating gate as a key component to store synaptic weights for integrated artificial neural networks. The new analog memory comprises a tunnel junction (poly-Si/poly-si oxide/poly-Si sandwich structure), a thin-film transistor, two capacitors, and a floating gate MOSFET. The diffusion of the charges injected through the tunnel junction is controlled by switching operation of the thin-film transistor, and we refer to the new analog memory as switched diffusion analog memory (SDAM). The obtained characteristics of SDAM are a fast switching speed and an improved linearity between the potential of the floating gate and the number of pulse inputs. SDAM can be used in a neural network in which write/erase and read operations are performed simultaneously.

Let L{0,1}* be a language and let λL : {0,1}*{0,1} be the characteristic function of the language L, i.e., if x ∈ L, λL (x) = 1; otherwise,λL (x) = 0. In this paper, we consider an adaptive checker with a single program F (resp. noncommunicating multiple programs F1, F2,...) for λL that works even when an incorrect program F* (resp. incorrect noncommunicating multiple programs F*1,F*2,...) for λL adaptively behaves according to inputs previously provided to the program F* (resp. the programs F*1,F*2,...). We show that (1) for any language L, there exists an adaptive checker with a single program for λL iff L and respectively have competitive interactive proof systems; and (2) that for any language L, there exists an adaptive checker with noncommunicating multiple programs for λL iff L and respectively have function-restricted interactive proof systems. This implies that for any language L, adaptive chekers with noncommunicating multiple programs for λL are as powerful as static ones with a single program for λL.