A new interacting multiple model (IMM) algorithm using intelligent input estimation (IIE) is proposed for maneuvering target tracking. In the proposed method, the acceleration level for each sub-model is determined by IIE-the estimation of the unknown target acceleration by a fuzzy system using the relation between the residuals of the maneuvering filter and the non-maneuvering filter. The genetic algorithm (GA) is utilized to optimize a fuzzy system for a sub-model within a fixed range of target acceleration. Then, multiple models are represented as the acceleration levels estimated by these fuzzy systems, which are optimized for different ranges of target acceleration. In computer simulation for an incoming anti-ship missile, it is shown that the proposed method has better tracking performance compared with the adaptive interacting multiple model (AIMM) algorithm.

Side channel attacks (SCA) are serious attacks on mobile devices. In SCA, the attacker can observe the side channel information while the device performs the cryptographic operations, and he/she can detect the secret stored in the device using such side channel information. Ha-Moon proposed a novel countermeasure against side channel attacks in elliptic curve cryptosystems (ECC). The countermeasure is based on the signed scalar multiplication with randomized concept, and does not pay the penalty of speed. Ha-Moon proved that the countermeasure is secure against side channel attack theoretically, and confirmed its immunity experimentally. Thus Ha-Moon's countermeasure seems to be very attractive. In this paper we propose a novel attack against Ha-Moon's countermeasure, and show that the countermeasure is vulnerable to the proposed attack. The proposed attack utilizes a Markov chain for detecting the secret. The attacker determines the transitions in the Markov chain using side channel information, then detects the relation between consecutive two bits of the secret key, instead of bits of the secret key as they are. The use of such relations drastically reduces the search space for the secret key, and the attacker can easily reveal the secret. In fact, around twenty observations of execution of the countermeasure are sufficient to detect the secret in the case of the standard sizes of ECC. Therefore, the single use of Ha-Moon's countermeasure is not recommended for cryptographic use.

In 1998, Tseng and Jan proposed a lightweight interactive user identification protocol based on ID-based cryptography. Recently, Hwang et al. modified their protocol to reduce the responding and waiting time for wireless network applications. In this letter, we show that their scheme is vulnerable to impersonation attacks.

The DNSSECbis data model has key introduction follow the delegation chain, thus requiring a zone's parent to become secure before a zone itself can be secured. Ultimately this leads to non-deployability since the root zone will probably not be secured any time soon. We describe an early deployment aid for DNSSECbis whereby key introduction can be done via cooperating third parties.

Global computing system (GCS) harnesses the idle CPU resources of clients connected to Internet for solving large problems that require high volume of computing power. Since GCS scale to millions of clients, many projects usually adopt coarse-grained scheduling in order to reduce server-side contention at the expense of sacrificing the degree of parallelism and wasting CPU resources. In this paper, we propose a new type of client, i.e., a scheduling proxy that enables adaptive-grained scheduling between the server and clients. While the server allocates coarse-grained work units to scheduling proxies alone, clients download fine-grained work units from a relatively nearby scheduling proxy not from the distant server. By computation of small work units at client side, the turnaround time of work unit can be reduced and the waste of CPU time by timeout can be minimized without increasing the performance cost of contention at the server. In addition, in order not to lose results in the failure of scheduling proxies, we suggest a technique of result caching in clients.

This paper describes a sub-1-V power-supply, which is useful for self-powered short-range wireless systems with ambient energy sources. A variable-stage DC-DC converter, which consists of multi-stage switched capacitor circuits and has intermittent operation with an external capacitor, makes it possible to extend the time for self-powered operation. We fabricated a variable-stage DC-DC converter and an intermittent operation circuit with a 0.8-µm CMOS/SOI process. We also applied the sub-1-V power-supply system to a self-powered short-range wireless system and verified its effectiveness.

To provide better QoS management, we investigated network-level dynamic priority methods. We propose methods in which packets of the same type of application receive different treatment in the network, depending on the route information. They feature a simple mechanism, which enables the methods to be executed easily with a small processing load at the routers as well as a small amount of information stored in the packet header. The effectiveness of these methods is shown by numerical comparison with the existing static priority method as well as the dynamic priority method.

A direct tunneling memory (DTM) with ultra-thin tunnel oxide and depleted floating gate has been proposed for low power embedded RAM. To achieve excellent charge retention characteristics with ultra-thin tunnel oxide, floating gate depletion is adopted to utilize the band bending at the interface between floating gate and tunnel oxide in charge retention period. The depleted floating gate is also effective to suppress the degradation of program/erase speed caused by the gate re-oxidation process. These effects were evaluated by the device and process simulations and confirmed by the experimental data. As a consequence, both fast programming time and superior retention time have been achieved, which is a promising performance as a low power embedded RAM for system-on-a-chip (SoC) applications.

Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.

This paper provides algorithms in order to solve an interval implicit function of the Poincare map generated by a continuous piece-wise linear (CPWL) vector field, with the use of interval arithmetic. The algorithms are implemented with the use of MATLAB and INTLAB. We present an application to verification of canards in two-dimensional CPWL vector field appearing in nonlinear piecewise linear circuits frequently, and confirm that the algorithms are effective.

Conventional WDM systems multiplex channels with different signal bandwidths using fixed and equal channel spacing. As a result, their spectral efficiency is rather poor. If the wavelength and the bandwidth of each channel in a WDM system could be freely changed as needed, a variety of services with different signal bandwidths could be accommodated efficiently. This is expected to yield high spectral efficiency. For this purpose, this paper proposes a WDM optically amplified system that combines optical power splitting with homodyne detection; its use in three configurations, point to point, ring (center to remote nodes), and peer to peer, is described. Coherent optical systems generally need a frequency stable local light source in addition to a sending light source in each WDM channel. We improve cost effectiveness by proposing that the output of one light source be divided to yield the local light for frequency selection by homodyne detection and the sending light source whose output is externally modulated by transmission signal. In this configuration, the local light level is low to permit high levels of sending power. The key problem is how to get high SNR with limited low-level local lights. This paper derives the optimum receiving loss condition that can maximize the SNR with local light levels as low as -20 dBm for the point to point configuration. For the ring configuration, the system overcomes the optical power loss created by splitting numbers over 1,000 even if the local lights are as low as 0 dBm. The ring configuration can, therefore, flexibly accommodate many users and services. We also elucidate the relation between SNR and BER for DPSK homodyne detection in a bandwidth-flexible system.

Peer-to-peer (P2P) web caching has been studied recently as it can exploit local caches of peers for web caching without additional infrastructure. However, dynamic join/leave behaviors or local caching strategies of the peers due to their autonomy in a P2P network may limit the performance of P2P web caching. To overcome these limitations, we propose an effective directory-based P2P web caching system under dynamic participation of peers. We introduce the object lifetime in a P2P network considering the lifetimes of both an object in the local cache of a peer and a peer who owns the object, and utilize this object lifetime information for neighbor selection and storage management in the P2P web caching framework. For the neighbor selection, the proposed system utilizes the object lifetimes in selecting accurately a neighbor who would still retain the requested object and still remain in the P2P network. To improve the storage management, the proposed system uses efficiently the entire cache storage of the P2P network in such a way that the object is stored selectively in the local cache of the peer who requested it, considering the object lifetime. The trace-driven simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in the feasible P2P network.

VLSI architecture of IEEE802.11i cipher algorithms is devised dedicatedly for embedded implementation of IEEE802.11a/g wireless communication systems. The proposed architecture consists mainly of RC4 unit for WEP/TKIP and AES unit. The RC4 unit successfully adopts packed memory accessing architecture. As for the AES unit, overlapped pipeline scheme of CBC-MAC and Counter-Mode is exploited in order to conceal processing latency. The cipher core has been implemented with 18 Kgates in 0.18 µm CMOS technology, which achieves the maximum transmission rate of IEEE802.11a/g at 60 MHz clock frequency while consuming 14.5 mW of power.

This paper presents an approach of logic mapping into LUT-Array-Based PLD where Boolean functions in the form of the sum of generalized complex terms (SGCTs) can be mapped directly. While previous mapping approach requires predetermined variable ordering, our approach performs mapping and variable reordering simultaneously. For the purpose, we propose a directed acyclic graph based on the multiple-valued decision diagram (MDD) and an algorithm to construct the graph. Our algorithm generates candidates of SGCT expressions for each node in a bottom-up manner and selects the variables in the current level by evaluating the sizes of SGCT expressions directly. Experimental results show that our approach reduces the number of terms maximum to 71 percent for the MCNC benchmark circuits.

We have developed an estimation system of the electric parameters for liquid materials without a sensor connecting to the testing materials. A PC can be used for the calculation, and the calculation time is about 2 minutes. The accuracy is such that the estimated values are different from the nominal values by less than 2%.

High-speed, area-efficient, and low-power Montgomery modular multipliers for RSA algorithm have been developed for digital signature and user authentication in high-speed network systems and smart card LSIs. The multiplier-accumulators (MAC) in the developed Montgomery modular multipliers have a non-identical multiplicand/multiplier word length organization. This organization can eliminate the bandwidth bottleneck associated with a data memory, and enables to use a single-port memory for area and power reductions. The developed MAC is faster than the conventional identical word length organization due to the shortened critical path. For smart card applications, an area-efficient architecture with 42 kgates can produce 1.2 digital signatures in a second for 2,048-bit key length with the power consumption of 6.8 mW.

On the Internet, two different IP protocols are deployed such as IPv4 and IPv6. The Mobile Router uses the basic NEMO protocol which is IPv6 protocol specific. During the early period of time that IPv6 transition is occurring it is very likely that a Mobile Router will move to an IPv4 only access network. When this occurs the Mobile Router will no longer be able to operate using the basic NEMO protocol. There has already been some earlier work to provide IPv6 capability over an IPv4 access network for a Mobile Router. This paper provides a capability by to maintain IPv6 connectivity for the Mobile Router via its Home Agent with IPv4-in-IPv6 encapsulation with no special boxes to be deployed elsewhere in the network.

The phase noise has a significant effect on the M-ary PSK transmission signal, furthermore the higher-order modulation signal can not be recovered in the presence of phase noise. It is important to define exactly what is required in terms of phase noise within a particular system and to avoid expensive over-specification. Based on the analysis of allowable signal-to-noise ratio for phase reference and required phase error variance for M-ary PSK systems relative to a degradation loss objective, the general phase noise allocation method for M-ary PSK satellite communication systems has been proposed in this paper. The phase noise allocation using the proposed method is adopted for M-ary PSK multi-mode satellite communication systems. Using the oscillator phase noise model and the phase noise model of a frequency synthesizer, the required phase noise spectrum distributions are carried out and the validities of the allocated phase noise spectrums are verified by the system simulation.

The current scheme of access control judges the legality of each access based on immediate information without considering associate information hidden in a series of accesses. Due to the deficiency, access control systems do not efficiently limit attacks consist of ordinary operations. For trusted operating system developments, we extended RBAC and added negative procedural constraints to refuse those attacks. With the procedural constraints, the access control of trusted operating systems can discriminate attack trials from normal behaviors. This paper shows the specification of the extended concept and model, and presents simple analysis results.

Domain Name System--DNS is a key service of the Internet. Without DNS, we cannot use any useful Internet applications. At the beginning of the Internet, email or file transfer applications were provided. DNS provides key service to them--resource discovery. Nowadays, there are broad range of software making use of DNS as basis of their application. In this paper, we explain the evolution of DNS, how DNS works and recent activities including operational issues. Then, we describe EPC network which make use of RFID to bridge real world and the Internet, and how DNS helps to organize EPC network.