We consider the performance of hyperelliptic curve cryptosystems over the fields Fp vs. F2n. We analyze the complexity of the group law of the jacobians JC(Fp) and JC(F2n) and compare their performance taking into consideration the effectiveness of the word size (32-bit or 64-bit) of the applied CPU (Alpha and Pentium) on the arithmetic of the definition field. Our experimental results show that JC(F2n) is faster than JC(Fp) on an Alpha, whereas JC(Fp) is faster than JC(F2n) on a Pentium. Moreover, we investigate the algorithm of the jacobian and the definition-field arithmetic to clarify our results from a practical point of view, with theoretical analysis.

Knowledge-based program understanding is widely known as one of the key issues in programming education support systems and environments for novices. Most program understanders, however, have limitations. One of them is an ability to deal with a single programming language, while human tutors can comprehend plural languages by means of generalized knowledge on programming languages and techniques. This paper proposes the concepts and methodology of the knowledge-based program understander ALPUS II, which deals with plural programming languages, i. e. , Pascal and C, by means of generalized abstract syntax AL and knowledge representations based on it. ALPUS II is an extension of ALPUS, which dealt with a single programming language Pascal, and is a sub-system of an intelligent programming environment INTELLITUTOR. The INTELLITUTOR system consists of a guided programming editor GUIDE and a knowledge-based program understander ALPUS II, and is available on the Internet. In the process of comprehension source statements written in Pascal or C are translated into AL representation first. Since the contents of the programming knowledge bases are adjusted to deal with the AL representations the program comprehension procedure is available for both Pascal and C. It is possible to append other programming languages by simply attaching a transformation module for each additional procedural language. It is noted that knowledge acquisition tasks for additional languages are not needed since the contents of the knowledge base are generalized for multiple use. The INTELLITUTOR system was implemented in the frame-based knowledge engineering environment ZERO on a UNIX server machine in the Internet environment. ALPUS II demonstrates interesting features in program comprehension for the C language by means of the transformed knowledge from the already available knowledge for Pascal, which was developed for ALPUS, in a feasibility study. The current version of ALPUS II supports almost full specifications for Pascal and a Pascal-associated subset for C. This limitation should be reasonable for programming practice at freshmen classes of a university.

There are the following three targets to be achieved in a software project from the three viewpoints of process management (or progress management), cost management, and quality management for software project to be successful: (a) drafting a software development plan based on accurate estimation, (b) early detection of risks that the project includes based on correct situation appraisal, (c) early avoidance of risks that the project includes. In this paper, the authors propose a method and facilities to project risks in a software project through Kepner-Tregoe program, and propose schedule re-planning by using genetic algorithm for avoiding the projected risks. Furthermore the authors show, from the results of execution of the system, that the system is effective in early avoidance of risks that the software project includes.

We present an architecture of a VOD system employing proxy servers. The proposed VOD system provides efficient and reliable VOD services and solves the problems caused by traditional VOD systems of centralized, hierarchical or distributed architecture. The proxy servers are placed between video servers and user systems. The proxy server is a small size video server that has not only caching function but also intelligence such as VCR-like video stream control or navigation of other proxy/video servers to search for a selected video program. Using a VOD system of the proposed architecture, the VOD services can be provided to more users because it reduces the workload of video servers and network traffic. We provide the performance model of the system. Service availability is also analyzed. The proposed architecture shows better performance and availability than the traditional VOD architectures.

This paper proposes a reference model of CAD system generation, and describes its prototype implementation. The problems encountered in using CAD systems in industry involve complicated data handling and unsatisfied demands for domain knowledge because of the lack of a way of extracting and adopting it in the system. In the example domain of architecture, the authors have already defined domain-specific BDL (Building Design Language) for architecture experts to describe modelers of architectural structure in CAD systems by themselves. Moreover, the authors have developed a CAD system generator based on BDL descriptions. However, the different domain-specific languages required for individual domains create difficulty in developing various CAD system generators. The proposed reference model solves this problem by applying a common intermediate language based on the object model. Moreover, the model allows the creation of an integrated CAD system which contains multiple domains required by a field of industry. Its prototype implementation demonstrates its feasibility.

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the throughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-φ expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field Fpm is expected to enhance elliptic curve operation efficiency more than Fq (q is a prime) or F2n.

The pantograph current collector-catenary contact has been recognized as an established cause of permanent electromagnetic perturbation in a railway environment. In this paper the problems due to pantograph-catenary crawling are addressed. Introducing a suitable model for the radiating contacts, results in agreement with classical fields theory and with experimental measurements may be deduced.

Distributed computation has attracted considerable attention and large-scale distributed systems have been designed and developed. A distributed system inherently has possibility of fault tolerance because of its redundancy. Thus, a great deal of investigation has been made to design fault-tolerant distributed algorithms. This paper introduces two promising paradigms, self-stabilization and wait-freedom, for designing fault-tolerant distributed algorithms and discusses some subjects important from the point of view of algorithm engineering.

One of the most important capacity parameters in the DS-CDMA cellular systems is the system reliability on which the reverse link capacity is usually limited by a prescribed lower bound. In this letter, the effect of the system reliability as well as imperfection of the power control on the system capacity is quantitatively considered using sensitivity analysis in a multimedia DS-CDMA cellular system. As a result, an analytical close-form formula is presented in terms of the standard deviation of the received SIR and the system reliability. In a numerical example, sensitivity with respect to the system reliability on the system capacity has the value ranging from 5 to 50 between 95% and 99% the range in we are interested.

System level diagnosis that can identify the faulty units in the system was introduced by Preparata, Metze, and Chien. In this area, the fundamental problem is to decide the diagnosability of given networks. We study the diagnosability of networks represented by the cartesian product. Our result is the optimal one with respect to the restriction of degrees of vertices of graphs that represent the networks.

We study the problem of stabilizing a general nonlinear control system globally based on direct gradient descent control which is a dynamic feedback control law. The direct gradient descent control and the general nonlinear control system (original system) form a new system (extended system). Under an appropriate assumption we can make the extended system become globally asymptotically stable if its unforced system is stable in the sense of Lyapunov.

The robust induced l-norm control problem is considered for uncertain discrete-time systems. We propose a state feedback and an output feedback controller that quadratically stabilize the systems and satisfy a given constraint on the induced l-norm. Both controllers are constructed by solving a set of scalar-dependent linear matrix inequalities (LMI's), and the gain matrices are characterized by the solution to the LMI's.

We review public-key cryptosystems from lattice problems, which are inspired by Ajtai's remarkable result, and consider their security from the point of view of both theory and practice. We also survey recent results on the power of the lattice reduction algorithm in cryptanalysis.

The wavelength demultiplexer, using cascaded optical fiber gratings and circulators, was proposed and developed for application to optically amplified wavelength-division multiplexing (WDM) submarine cable systems with 100 GHz channel spacing. Our proposed demultiplexer cannot only achieve high wavelength selectivity, small excess loss and effective allocation of dispersion compensation fibers for each channel, but also be upgraded without affecting other existing channels. By using this demultiplexer, it has been successfully confirmed that 8 WDM channels were demultiplexed even after 6,000 km transmission including separate compensation of accumulated chromatic dispersion in each channel.

This paper describes the roles and benefits of an ATM transport network composed of ATM transport systems, such as ATM cross-connect systems and/or ATM add-drop multiplexers. The ATM transport network is an economical way of providing the ATM public network and a virtual path service for enterprise users. This paper exemplifies the effectiveness of a VP grooming function in the ATM transport system by comparing it to the network costs with direct fiber connection, an alternative to VP grooming. Main and junction module architecture for the ATM cross-connect system is proposed to realize an economical network that supports small to large traffic. For implementing a large-scale cross-connect switch, a cell congestion control method that employs re-arrangement control and a concentration network is proposed. Implementation of multiple service classes and VP protection switching in the ATM cross-connect system are mentioned. We also describe an SDH signal transmission method based on ATM cells, that offers a cost effective and reliable transport network.

Broadband subscriber loop system and ATM switching system are the key equipment for construction of Broadband networks. In this paper, we describe the architecture of access network and the implementation of ATM switching system with multi-service interface for construction of broadband access network. We also represent the design of MAIN-AN (Multi-service Access Integrated Network--Access Node) system as integrated access network platform which enables to accommodate ATM/SDH-based and ATM/PON-based FTTx (Fiber-To-The-x) access architecture simultaneously. The system has a Cross-point ATM Switch Fabric with 10 Gbits/sec throughput and it has been implemented using 0.5 µm CMOS technology. For performance evaluation of it, we simulate it under burst traffic conditions. In addition, we show the implementation of prototype of ASIC (Application Specific Integrated Circuit), MAIN system and its core PBA (Printed circuit Board Assembly) and so on.

This paper presents a robust and nonblocking group membership protocol for large-scale distributed systems. This protocol uses the causal relation between membership-updating messages (i. e. , those specifying the adding and deleting of members) and allows the messages to be executed in a nonblocking manner. It differs from conventional group membership protocols in the following points: (1) neither global locking nor global synchronization is required; (2) membership-updating messages can be issued without being synchronized with each other, and they can be executed immediately after their arrival. The proposed protocol therefore is highly scalable, and is more tolerant to node and network failures and to network partitions than are the conventional protocols. This paper proves that the proposed protocol works properly as long as messages can eventually be received by their destinations. This paper also discusses some design issues, such as multicast communication of the regular messages, fault tolerance and application to reliable communication protocols (e. g. , TCP/IP).

This paper presents an architecture for a single-chip MPEG-2 video encoder and demonstrates its flexibility and usefulness. The architecture based on three-layer cooperation provides flexible data-transfer that improves the encoder from the standpoints of versatility, scalability, and video quality. The LSI was successfully fabricated in the 0.25-µm four-metal CMOS process. Its small size and its low power consumption make it ideal for a wide range of applications, such as DVD recorders, PC-card encoders and HDTV encoders.

An ATMS (Assumption-based Truth Maintenance System) has been widely used for maintaining the truth of an information by detecting and solving the contradictions in rule-based systems. However, the ATMS cannot correctly maintain the truth of the information in case that the generated information is satisfied within a time interval or includes data about temporal relations of events in time varying situations, because it has no mechanism manipulating temporal data. In this paper, we propose the extended ATMS that can maintain the truth of the information in the knowledge-based system using information changing over time or temporal relations of events. To maintain the contexts generated by relations of events, we modify the label representation method, the disjunction and conjunction simplification method in the label-propagation procedure and the nogood handling method of the conventional ATMS.

This paper proposes an Iterated Function System (IFS) which can reduce effects of quantization errors of the IFS parameters. The proposed method skips conventional analog-parameter search and directly selects optimum IFS parameters from pools of discrete IFS parameters. In conventional IFS-based image coding the IFS parameters are quantized after their analog optimum values are determined. The image reconstructed from the quantized parameters is degraded with errors that are traced back to quantization errors amplified in the iterated mappings. The effectiveness of this new realistic approach is demonstrated by simulation results over the conventional method.