Super-anomalous elliptic curves over a ring Z/nZ ;(n=Πi=1k piei) are defined by extending anomalous elliptic curves over a prime filed Fp. They have n points over a ring Z/nZ and pi points over Fpi for all pi. We generalize Satoh-Araki-Smart algorithm and Ruck algorithm, which solve a discrete logarithm problem over anomalous elliptic curves. We prove that a "discrete logarithm problem over super-anomalous elliptic curves" can be solved in deterministic polynomial time without knowing prime factors of n.

Measurement of the viscosity of liquid using a piezoelectric disk is described. Experiments with a radial expansion mode of a piezoceramic disk were carried out for water-glycerin mixture samples. Resonant resistance has linearity to the square root of the product of density and viscosity of a liquid around 113 kHz.

This paper addresses output regulation for nonlinear systems driven by a time varying parameter. The derivative information of the time varying parameter is necessary for the improved regulation performance but it is not readily available in general. In this paper, we propose a velocity estimation of the time varying parameter for use in the control law without amplifying noise signals.

Methods to discover laws are reviewed from among both statistical approach and artificial intelligence approach with more emphasis placed on the latter. Dimensions discussed are variable dependency checking, passive or active data gathering, single or multiple laws discovery, static (equilibrium) or dynamic (transient) behavior, quantitative (numeric) or qualitative or structural law discovery, and use of domain-general knowledge. Some of the representative discovery systems are also briefly discussed in conjunction with the methods used in the above dimensions.

This paper reviews design aspects of computational discovery systems through the analysis of some successful discovery systems. We first review the concept of viewscope/view on data which provides an interpretation of raw data in a specific domain. Then we relate this concept to the KDD process described by Fayyad et al. (1996) and the developer's role in computational discovery due to Langley (1998). We emphasize that integration of human experts and discovery systems is a crucial problem in designing discovery systems and claim together with the analysis of discovery systems that the concept of viewscope/view gives a way for approaching this problem.

This paper proposes two topology discovery algorithms for IP networks, namely, a network layer topology discovery algorithm and a link layer topology discovery algorithm. The network layer topology discovery algorithm discovers the subnets and devices in the network of interest and the connections among them. The devices in a subnet can be found by a network layer topology discovery algorithm; however, the connections among the devices cannot be obtained. The link layer topology discovery algorithm is proposed to find the devices in a subnet and the connections among them. The two algorithm are integrated to find the detailed topology map of an IP network. The proposed topology discovery algorithms are implemented based on the Tcl/Tk and Scotty environment. Some implementation details are discussed.

In this paper, we propose an analytic method for dimensioning traffic descriptors at the leaky bucket-based UPC for VBR MPEG video traffic on ATM networks. We analytically derived cell violation probabilities at the UPC by using a proposed scene-based video traffic model, and then we showed that it was possible to select sets of traffic descriptors that produce the required violation probability. In two example video traces, the numerical results showed that our proposed traffic descriptor dimensioning method well approximated the simulation-based traffic control results of the real video traces. In cases where an effective bandwidth allocation method based on the ON/OFF model was used for the call admission control in the networks, we compared the allocated effective bandwidth to each set of traffic descriptors that produced zero UPC losses.

We propose a new probabilistic ID-based non-interactive key sharing scheme that has non-separable secret-key functions and a non-separable common-key function. The proposed scheme uses the calculation over modulo-P, modulo-Q and over integer ring for realizing non-separability. This proposed scheme has a large threshold against linear attack by the collusive entities.

In this paper, we present an access scheme for packet-typed wireless networks, called DQRUMA/PAR (Distributed-Queueing Request Update Multiple Access with Periodically Automatic Reservation), which can transmit multimedia traffic efficiently. Here, we deal with three kinds of traffic i. e. voice, data and still picture. DQRUMA/PAR introduces the transmission scheme that mobile stations for voice communications reserve the transmission capacity periodically during their talkspurts. The transmission control process of DQRUMA/PAR will become easier than the one of DQRUMA, and the delay characteristic of voice is improved. Furthermore, we study two enforced protocols on DQRUMA/PAR. One is the more enforced protocol for voice communications. We call this as Voice Enforced mode (VE mode) on DQRUMA/PAR. The other is the more enforced protocol for data communications. We call this as Data Enforced mode (DE mode) on DQRUMA/PAR. The transmission delay of voice will become reduced significantly by introducing VE mode. On the other hand, the transmission delay characteristic of data will be improved by introducing DE mode. We carry out the performance comparisons of pure DQRUMA/PAR with PRMA and DQRUMA and show the considerable improvement of the protocol numerically. Next we make the performance comparisons between pure DQRUMA/PAR and two enforced modes on DQRUMA/PAR and show the considerable improvements of these enforced protocols, respectively.

A portable cryo-system using a high-Tc SQUID for the measurement of the remanant magnetic field of a rock specimen was designed and fabricated. The sensing surface of the SQUID faces upward in our system, although the system for bio-magnetics faces down. The SQUID is cooled by liquid nitrogen via a sapphire heat transfer rod. The total heat transfer of the system was measured by means of a boiling-off method and was found to be 1.65 W. It was demonstrated that the system can be operated for more than 17 hours without any maintenance such as filling with liquid nitrogen. The system was applied to the measurement of the remanent magnetic field distributions of rock samples cored from deep underground. We have successfully measured the distributions.

Inductive Logic Programming (ILP) is a study of machine learning systems that use clausal theories in first-order logic as a representation language. In this paper, we survey theoretical foundations of ILP from the viewpoints of Logic of Discovery and Machine Learning, and try to unify these two views with the support of the modern theory of Logic Programming. Firstly, we define several hypothesis construction methods in ILP and give their proof-theoretic foundations by treating them as a procedure which complets incomplete proofs. Next, we discuss the design of individual learning algorithms using these hypothesis construction methods. We review known results on learning logic programs in computational learning theory, and show that these algorithms are instances of a generic learning strategy with proof completion methods.

We propose an untraceable electronic money system. Our system uses the partially blind signature based on the discrete logarithm problem, and applies secret key certificates to the payment protocol.

We have two goals in this paper. One is the comparison of Spread Spectrum (SS) CDMA and Spread Time (ST) CDMA. The other is to propose a new SS-ST CDMA system, which is an adaptive CDMA with both merits of SS and ST CDMA. SS and ST CDMA are compared from the view point of two dimensional space "frequency (B Hz)-time (T Sec)" together with their communication capacity. A primary modulation is assumed to be PPM in ST CDMA, and FSK in SS CDMA which is regarded as PPM in frequency axis. Both SS and ST CDMA are combined to give the proposed SS-ST CDMA, where transmitted signals are spread both in time and frequency domain. In order to realize the proposed system, a transmitter model is presented, and two receiver structures are discussed. The discrete Fourier transform (DFT) is employed for the system flexibility. Although SS, ST and SS-ST CDMA are shown to have the same capacity of 0.7213, the combined SS-ST CDMA has a merit of adaptability to adjust spreading gain of ST and SS according to property of channels, an impulsive noise dominated or a CW interference dominated channel. Numerical results of DFT are also shown to illustrate the waveform and spectrum of the proposed SS-ST CDMA system. Finally the symbol error probability performance of ST PPM, SS FSK and combined SS-ST systems in CW and impulsive environment is presented.

A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.

This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.

I would like to draw the attention of the editorial board of IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences and its readers to a recent paper, Tianruo Yang, "The integrated scheduling and allocation of high-level test synthesis," vol. E82-A, no. 1, January 1999, pp. 145-158. (Here we call this paper the Yang's paper. ) Yang did not give the correct information about the originality of the paper. I will point out that the writings (and the idea accordingly) of section 6 of Yang's paper came from papers [1] and [2].

In this paper, we will present a study of the time-dependence effect in alumite perpendicular media at different thicknesses. Important parameters of the time-dependence effect such as magnetic viscosity and activation volume are investigated. Viscosity as a function of applied field (viscosity curve) exhibits a short plateau at a low field and then decreases monotonously with increasing field. After correcting for the demagnetizing field, the shape of the intrinsic viscosity curves changes to the well-known shape of the viscosity curve of in-plane media, i. e. , they have a peak near Hc. The intrinsic viscosity curves obtained from the experiments were fitted to an analytical model by Chantrell et al., from which, we found that the effective switching volumes obtained by fitting are much smaller than the column volumes, indicating that the reversal mechanism is incoherent.

As VLSI technology has developed, the interest in implementing an entire or significant part of a parallel computer system using wafer scale integration is growing. The major problem for the case is the possibility of drastically low yield and/or reliability of the system if there is no strategy for coping with such situations. Various strategies to restructure the faulty physical system into the fault-free target logical system are described in the literature [1]-[5]. In this paper, we propose an efficient approximate method which can reconstruct the 1 1/2 track-switch mesh arrays with faulty PEs using hardware as well as software. A logical circuit added to each PE and a network connecting the circuits are used to decide spare PEs which compensate for faulty PEs. The hardware compexity of each circuit is much less than that of a PE where the size of each additional circuit is independent of array sizes and constant. By using the exclusive hardware scheme, a built-in self-reconfigurable system without using a host computer is realizable and the time for reconfiguring arrays becomes very short. The simulation result of the performance of the method shows that the reconstructing efficiency of our algorithm is a little less than those of the exaustive and Shigei's ones [6] and [7], but much better than that of the neural one [3]. We also compare the time complexities of reconstructions by hardware as well as software, and the hardware complexity in terms of the number of gates in the logical circuit added to each PE among the other methods.

As many research works are based on some previous results, my paper, namely The Integrated Scheduling and Allocation of High-Level Test Synthesis, makes use of some techniques by T. Kim. However, I did not state explicitly that some parts of my work are based on Kim's approach although I have referred to his paper. I would like to express my deep apology to Kim for not having emphasized Kim's contribution to my work. But my intention was not to steal Kim's ideas. I would like to emphasize the following difference.

An accurate and efficient numerical solution is presented for a two-dimensional electromagnetic wave scattering from a multilayered resistive strip grating embedded in a dielectric slab. Both E- and H-waves are treated. The problem is formulated into a set of integral equations, which is solved by the moment method accompanied by a regularization procedure. The resultant set of linear algebraic equations has the form of the Fredholm second kind, and therefore yields stable and accurate numerical solutions. The power distribution is computed for several grating parameters. Attention is paid to seek a set of parameters that maximizes absorption in the strips. The low frequency approximate formulas are also derived. This analysis would be useful in designing electromagnetic wave absorbers.