In this paper, a Web-based management system for the building network is described. We developed a multi-protocol converter based on SoC and embedded Linux. It requires an appropriate operating system for handling protocols and an advanced development environment very similar to embedded linux. The multi-protocol converter integrates control networks of RS-485 and LonWorks devices to BAS through TCP/IP protocol or a client with Java applet. The system consists of three-tier architecture, such as BAS or clients, a multi-protocol converter, and control devices. In order to compare the feasibility of system architecture, it was applied to a small BAS system. By using UML, we modeled a Web-based control system with a unified TCP/IP socket communication and the system architecture. The developed system includes the inverter motor control system with modbus protocol for the RS485 network. The experiment results show that the multi-protocol converter using embedded Linux is a flexible and effective way to build a Web-based monitoring and control system.

In this paper, we propose a multiple-input multiple-output (MIMO) beamforming scheme for a multiuser system in frequency-selective fading channels. The maximum signal-to-noise and interference ratio (MSINR) is adopted as a criterion to determine the transmit and receive weight vectors. In order to maximize the output SINR over all users, two algorithms for base station are considered: the first algorithm is based on the receive weight vector optimization and the second algorithm is based on an iterative update of both transmit and receive weight vectors. Based on the result of single user MIMO beamforming, we analyze the interference channels cancellation ability of multiuser MIMO system. The first algorithm is a simple method and the second algorithm is a performative solution. Through computer simulations, it is shown that multiuser communication system is achievable using the proposed methods in frequency-selective fading condition.

System-level fault diagnosis deals with the problem of identifying faulty nodes (processors) in a multiprocessor system. Each node is faulty or fault-free, and it can test other nodes in the system, and outputs the test results. The test result from a node is reliable if the node is fault-free, but the result is unreliable if it is faulty. In this paper, we prove that four variants of the hypercube: the crossed cube, the twisted cube, the Mobius cube, and the enhanced cube, are adaptively diagnosed using at most 4 parallel testing rounds, with at most n faulty nodes (for the enhanced cube, with at most n + 1 faulty nodes), where each processor participates in at most one test in each round. Furthermore, we propose another diagnosis algorithm for the n-dimensional enhanced cube with at most n + 1 faulty nodes, and show that it is adaptively diagnosed with at most 5 rounds in the worst case, but with at most 3 rounds if the number of existing faulty nodes is at most n -log(n + 1).

In a ubiquitous computing environment, people are surrounded by hundreds of mobile or embedded computers each of which may be used to support one or more user applications due to limitations in their individual computational capabilities. We need an approach to coordinating heterogeneous computers that acts as a virtual computer around a mobile and ubiquitous computing environment and supports various applications beyond the capabilities of single computers. This paper presents a framework for building and aggregating distributed applications from one or more mobile components that can be dynamically deployed at mobile or stationary computers during the execution of the application. Since the approach involves mobile-transparent communications between components and component relocation semantics, it enables a federation of components to adapt its structure and deployment on multiple computers whose computational resources, such as input and output devices, can satisfy the requirement of the components in a self-organized manner. This paper also describes a prototype implementation of the approach and its application.

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.

This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. In the first order case, the termination of term rewriting systems are proved by showing the non-existence of an infinite R-chain of the dependency pairs. However, the termination and the non-existence of an infinite R-chain do not coincide in the higher-order case. We introduce a new notion of dependency forest that characterize infinite reductions and infinite R-chains, and show that the termination property of higher-order rewrite systems R can be checked by showing the non-existence of an infinite R-chain, if R is strongly linear or non-nested.

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.

Paralleled converter system with synchronous rectifiers (SRs) causes several problems such as surge voltage, inhalation current and circulating current. Generally, the system stops operation of the SRs in light load to avoid these problems. However, simultaneously, large voltage fluctuations in the output of the modules are occurred due to forward voltage drop of diode. The fluctuations cause serious faults to the semiconductor devices working in very low voltage such as CPU and VLSI. Moreover, the voltage fluctuations generate unstable current fluctuations in the paralleled converter system with current-sharing control. This paper proposes new switching control methods for rectifiers to reduce the voltage and current fluctuations. The effectiveness of the proposed methods is confirmed by computer simulation and experimental results.

This paper introduces the water ring scan method especially designed for the scalable video coding schemes such as fine granularity scalabilities (FGS) on the basis of MPEG-4 part-2 and the H.264. The proposed scanning method can improve the subjective quality of the decoded video by most-preferentially encoding, transmitting and decoding the image information of the region of interest. From the various simulation results of FGS coding schemes with MPEG-4 part 2 and H.264, the proposed scanning method can improve the subjective picture quality about 0.5 dB 3.5 dB better than the widely used raster scan order, especially on the region of interest, without significant loss of the quality in the left-over region.

A noise reduction technique to reduce background noise in noisy speech is proposed. We have proposed the noise reduction method which uses a noise reconstruction system. However, since a residual speech signal is included in the input signal of a noise reconstruction filter (NRF) used for reconstructing the background noise, the long time average value of error signal for estimating the background noise is needed not to estimate the speech signal. Therefore, the ability of tracking the non-stationary noise is decreased. In order to solve this problem, we propose the noise reconstruction system with adaptive line enhancer (ALE). Since ALE works to obtain the signal occupied by noise components, the input signal of the NRF includes only a few speech components. Therefore, we can give the high tracking ability to NRF.

An audio signal level compressor is presented, which is based on the approximation algorithm using an interpolating polynomial. To implement a compression characteristic in a digital audio system, a power calculation with fractional numbers is required and it is difficult to be performed directly in digital circuits. We introduce a polynomial expression to approximate the power operation, then the gain calculation is easily performed with a number of additions, multiplications and a division. Newton's interpolation formula is used to calculate the compression characteristics in a very short time and the obtained compression characteristics are very close to the ideal ones.

A frequency selection algorithm leveraging the capability of a handset to autonomously select idle channels of a public communication system for use in a private communication system was previously proposed, and its effectiveness was verified through experiments conducted in a metropolitan area. This paper describes the results of an experiment verifying the algorithm's effectiveness in rural areas with relatively low public communication system traffic.

In this letter, we provide a solution to the stabilization problem of a class of Lipschitz nonlinear systems by output feedback. Via the newly proposed nonlinearity characterization function (NCF) concept, we propose an effective method in designing an output feedback controller. Under the suggested sufficient condition which is derived by using the NCF, the proposed control scheme achieves the global exponential stabilization.

We propose a new diversity scheme for orthogonal frequency division multiplexing/multi-input multi-output (OFDM/MIMO) systems. The proposed scheme, named turbo layered space-frequency coded OFDM (TLSFC-OFDM), exploits the turbo principle with space hopping (SH). The TLSFC-OFDM system with SH provides a spatial coding so that we can obtain the transmit diversity. We also introduce a successive interference cancellation (SIC) algorithm that requires no ordering and fewer iterations to converge. As a result, this scheme reduces computational complexity. Computer simulation results show that the unordered SIC-based TLSFC-OFDM system outperforms the OFDM/H-BLAST system. It is also shown that the proposed system can operate even with fewer receive antennas than transmit antennas.

Isogeny for elliptic curve cryptosystems was initially used for efficient improvement of order counting methods. Recently, Smart proposed a countermeasure using isogeny for resisting a refined differential power analysis by Goubin (Goubin's attack). In this paper, we examine a countermeasure using isogeny against zero-value point (ZVP) attack that is generalization of Goubin's attack. We show that some curves require higher order of isogeny to prevent ZVP attack. Moreover, we prove that the class of curves that satisfies (-3/p) = 1 and whose order is odd cannot be mapped by isogeny to curves with a = -3 and secure against ZVP attack. We point out that three SECG curves are in this class. In the addition, we compare some efficient algorithms that are secure against both Goubin's attack and ZVP attack, and present the most efficient method of computing a scalar multiplication for each curve from SECG. Finally, we discuss another improvement for an efficient scalar multiplication, namely the usage of a point (0,y) for a base point of curve parameters. We are able to improve about 11% for double-and-add-always method, when the point (0,y) exists in an underlying curve or its isogeny.

Differential power analysis (DPA) might break implementations of elliptic curve cryptosystem (ECC) on memory constraint devices. Goubin proposed a variant of DPA using a point (0,y), which is not randomized in Jacobian coordinates or in an isomorphic class. This point often exists in standardized elliptic curves, and we have to care this attack. In this paper, we propose zero-value register attack as an extension of Goubin's attack. Note that even if a point has no zero-value coordinate, auxiliary registers might take zero value. We investigate these zero-value registers that cannot be randomized by the above randomization. Indeed, we have found several points P = (x,y) which cause the zero-value registers, e.g., (1) 3x2 + a = 0,(2) 5x4 + 2ax2 - 4bx + a2 = 0,(3) P is y-coordinate self-collision point, etc. We demonstrate the elliptic curves recommended in SECG that have these points. Interestingly, some conditions required for zero-value register attack depend on explicit implementation of addition formulae -- in order to resist this type of attacks, we have to care how to implement the addition formulae. Finally, we note that Goubin's attack and the proposed attack assume that a base point P can be chosen by attackers and a secret scalar d is fixed, so that they are not applicable to ECDSA.

Genus 3 hyperelliptic curve cryptosystems are capable of fast-encryption on a 64-bit CPU, because a 56-bit field is enough for their definition fields. Recently, Kuroki et al. proposed an extension of the Harley algorithm, which had been known as the fastest addition algorithm of divisor classes on genus 2 hyperelliptic curves, on genus 3 hyperelliptic curves and Pelzl et al. improved the algorithm. This paper shows an improvement of the Harley algorithm on genus 3 hyperelliptic curves using Toom's multiplication. The proposed algorithm takes only I + 70M for an addition and I + 71M for a doubling instead of I + 76M and I + 74M respectively, which are the best possible of the previous works, where I and M denote the required time for an inversion and a multiplication over the definition field respectively. This paper also shows 2 variations of the proposed algorithm in order to adapt the algorithm to various platforms. Moreover this paper discusses finite field arithmetic suitable for genus 3 hyperelliptic curve cryptosystems and shows implementation results of the proposed algorithms on a 64-bit CPU. The implementation results show a 160-bit scalar multiplication can be done within 172 µs on a 64-bit CPU Alpha EV68 1.25 GHz.

In this paper we propose a new side channel attack, where exponent recodings for public key cryptosystems such as RSA and ECDSA are considered. The known side channel attacks and countermeasures for public key cryptosystems were against the main stage (square and multiply stage) of the modular exponentiation (or the point multiplication on an elliptic curve). We have many algorithms which achieve fast computation of exponentiations. When we compute an exponentiation, the exponent recoding has to be carried out before the main stage. There are some exponent recoding algorithms including conditional branches, in which instructions depend on the given exponent value. Consequently exponent recoding can constitute an information channel, providing the attacker with valuable information on the secret exponent. In this paper we show new algorithms of attack on exponent recoding. The proposed algorithms can recover the secret exponent, when the width-w NAF and the unsigned/signed fractional window representation are used.

Sliding mode control (SMC) is known to be robust with respect to matched uncertainties. However, it does not guarantee stability of systems with mismatched uncertainties. In this paper, we propose a new method to design a sliding surface for linear systems with mismatched uncertainties. The proposed sliding surface provides a new stability criterion of the reduced-order system origin with respect to mismatched uncertainties. A numerical example is given to illustrate the effectiveness of the proposed method.