This paper discusses Boolean functions satisfying the propagation criterion (PC) and their balancedness. Firstly, we discuss Boolean functions with n variables that satisfy the PC with respect to all but three elements in {0,1}n-{(0,...,0)}. For even n4, a necessary and sufficient condition is presented for Boolean functions with n variables to satisfy the PC with respect to all but three elements in {0,1}n-{(0,...,0)}. From this condition, it is proved that all of these Boolean functions are constructed from all perfectly nonlinear Boolean functions with n-2 variables. For odd n3, it is shown that Boolean functions with n variables satisfying the PC with respect to all but three elements in {0,1}n-{(0,...,0)} satisfy the PC with respect to all but one elements in it. Secondly, Boolean functions satisfying the PC of degree n-2 and their balancedness are considered. For even n4, it is proved that an upper bound on the degree of the PC is n-3 for balanced Boolean functions with n variables. This bound is optimal for n=4,6. It is also proved that, for odd n3, balanced Boolean functions with n variables satisfying the PC of degree n-2 satisfy the PC with respect to all but one elements in {0,1}n-{(0,...,0)}.

Soliton transmission control has already proved to be an outstanding technique and enable a soliton to be transmit over one million kilometers. This technique is not only applicable to vast distances but also to shorter distances where the amplifier spacing is greater than that of conventional systems. A combination of time and frequency domain control eliminates the noise accumulation and timing jitter caused by soliton interaction and the Gordon-Haus effect, that are the main impediments to extending the transmission distance. In this paper we describe soliton control techniques applied over an astronomical transmission distance of 180,000,000 km, and to a terrestrial system with a large amplifier spacing of up to 100km. We also report the possibility of realizing a sub-tera bit/s soliton transmission system operating over more than 5,000 km in which the soliton self-frequency shift is controlled with the soliton control technique.

Damgrd defined the notion of a collision intractable hash functions and showed that there exists a collection of collision intractable hash functions if there exists a collection of claw-free permutation pairs. For a long time, the necessary and sufficient condition for the existence of a collection of collision intractable hash functions has not been known, however, very recently Russell finally showed that there exists a collection of collision intractable hash functions iff there exists a collection of claw-free pseudo-permutation pairs. In this paper, we show an alternative necessary and sufficient condition for the existence of a collection of collision intractable hash functions, i.e., there exists a collection of collision intractable hash functions iff there exists a collection of distinction intractable pseudo-permutations.

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.

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.

We developed a parallel bordered-block-diagonal (BBD) matrix solution for parallel circuit simulation. In parallel circuit sumulation on a MIMD parallel computer, a circuit is partitioned into as many subcircuits as the processors of a parallel computer. Circuit partition produce a BBD matrix. In parallel BBD matrix solution, diagonal blocks are easily solved separately in each processor. It is difficult, however, to solve the interconnection (IC) submatrix of a BBD matrix effectively in parallel. To make matters worse, the more a circuit is partitioned into subcircuits for highly parallel circuit simulation, the larger the size of an IC submatrix becomes. From an examination, we found that an IC submatrix is more dense (about 30% of all entries are non-zeros) than a normal circuit matrix, and the non-zeros per row in an IC submatrix are almost constant with the number of subcircuits. To attain high-speed circuit simulation, we devised a data structure for BBD matrix processing and an approach to parallel BBD matrix solution. Our approach solves the IC submatrix in a BBD matrix as well as the diagonal blocks in parallel using all processors. In this approach, we allocate an IC submatrix in block-wise order rather than in dot-wise order onto all processors. Thus, we balance the processor perfomance with the communication capacity of a parallel computer system. When we changed the block size of IC submatrix allocation from dot-wise order to 88 block-wise order, the 88 block-wise order allocation almost halved the matrix solution time. The parallel simulation of a sample circuit with 3277 transistors was 16.6 times faster than a single processor when we used 49 processors.

Coding scheme is discussed for M-Choose-T communication in which at most T active users out of M potential users simultaneously transmit their messages over a common channel. The multiple-access channel considered in this paper is assumed to be a time-discrete noiseless adder channel without feedback with T binary inputs and one real-valued output, and is used on the assumption of perfect block and bit synchronization among users. In this paper a new class of uniquely decodable codes is proposed in order to realize error-free M-Choose-T communication over the adder channel described above. These codes are uniquely decodable in the sense that not only the set of active users can be specified but also their transmitted messages can be recovered uniquely as long as T or fewer users are active simultaneously. It is shown that these codes have a simple decoding algorithm and can achieve a very high sum rate arbitrarily close to unity if exactly T users are active.

In this paper, we compute entropies and average mutual informations for a 'choseong,' a 'jungseong,' and a 'jongseong' in multi-syllable Korean words. In these computations, we consider the property that each Korean syllable is divided into a 'choseong,' a 'jungseong,' and a 'jongseong' which are a consonant, a vowel, and a consonant, respectively, without exception. We compute entropies and average mutual informations for a 'choseong,' a 'jungseong,' and a 'jongseong' from the cumulative frequency of Korean syllables with respect to word length and syllable location in a word. We compute average mutual informations for a syllable and for a 'choseong,' a 'jungseong,' and a 'jongseong' between the two adjacent syllables in a word. The correlation between the two adjacent syllables in a word is not large on the average.

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 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.

We exactly determine the number of negations needed to compute the parity functions and the complement of the parity functions. We show that with k NOT gates, parity can be computed on at most 2k+11 variables, and parity complement on at most 2k+12 variables. The two bounds are shown to be tight.

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.

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.

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 novel total harmonic distortion (THD) measuring technique is proposed. A modified Volterra series using harmonics in place of powers of the sinusoidal input is used to identify the nonlinear models of the source and the device under test (DUT). The least-mean square (LMS) adaptive algorithm is applied for identification. While maintaining comparable speed and accuracy this technique provides a more flexible test procedure than conventional methods, in terms of the frequency resolution, the number of samples, and the sampling rate. It outperforms conventional methods when there is a bin energy leakage, which occurs in a non-coherent system. In addition, it is real-time computing while other conventional methods post process blocks of data. Simulation results collaborate the analytical results.

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.

A highly reliable, operated efficiently, and scalable switching node is required for multivendor system management networks. This paper presents techniques for applying the Telecommunications Management Network (TMN) concept to a distributed switching node. First, we select the TMN protocol structures so as to minimize the command response time. To ensure efficient operation and flexible design of the operation, administration and maintenance (OA & M) software, we propose a command-message handling function for mapping managed objects (MOs) to the OA & M software. We have designed MO classes for switching-system-specific devices with a redundant configuration that ensures highly reliable system operation. The feasibility of these techniques have been confirmed on a prototype system.

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.

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.

Graph unification is doubtlessly the most expensive process in unification-based grammar parsing since it takes the vast majority of the total parsing time of natural language sentences. A parsing time overload in unification consists in that, in general, no less than 60% of the graph unifications performed actually fail. Thus one way to achieve unification time speed-up is focusing on an efficient, fast way to deal with such unification failures. In this paper, a process, prior to unification itself, capable of filtering or stopping a considerably high percentage of graphs that would fail unification is proposed. This unification-filtering process consists of comparison of signatures that correspond to each one of the graphs to be unified. Unification-filter (hereafter UF) is capable of stopping around 87% of the non-unifiable graphs before unification itself takes place. UF takes significantly less time to detect graphs that do not unify and discard them than it would take to unification to fail the attempt to unify the same graphs. As a result of using UF, unification is performed in an around 71% of the time for the fastest known unification algorithm.