This paper introduces a new computational problem on a two-dimensional vector space, called the vector decomposition problem (VDP), which is mainly defined for designing cryptosystems using pairings on elliptic curves. We first show a relation between the VDP and the computational Diffie-Hellman problem (CDH). Specifically, we present a sufficient condition for the VDP on a two-dimensional vector space to be at least as hard as the CDH on a one-dimensional subspace. We also present a sufficient condition for the VDP with a fixed basis to have a trapdoor. We then give an example of vector spaces which satisfy both sufficient conditions and on which the CDH is assumed to be hard in previous work. In this sense, the intractability of the VDP is a reasonable assumption as that of the CDH.

In the IEEE 802.11 MAC protocol, access points (APs) are given the same priority as wireless terminals in terms of acquiring the wireless link, even though they aggregate several downlink flows. This feature leads to a serious throughput degradation of downlink flows, compared with uplink flows. In this paper, we propose a dynamic contention window control scheme for the IEEE 802.11e EDCA-based wireless LANs, in order to achieve fairness between uplink and downlink TCP flows while guaranteeing QoS requirements for real-time traffic. The proposed scheme first determines the minimum contention window size in the best-effort access category at APs, based on the number of TCP flows. It then determines the minimum and maximum contention window sizes in higher priority access categories, such as voice and video, so as to guarantee QoS requirements for these real-time traffic. Note that the proposed scheme does not require any modification to the MAC protocol at wireless terminals. Through simulation experiments, we show the effectiveness of the proposed scheme.

An eyegaze interface is one of the key technologies as an input device in the ubiquitous-computing society. In particular, an eyegaze communication system is very important and useful for severely handicapped users such as quadriplegic patients. Most of the conventional eyegaze tracking algorithms require specific light sources, equipment and devices. In this study, a simple eyegaze detection algorithm is proposed using a single monocular video camera. The proposed algorithm works under the condition of fixed head pose, but slight movement of the face is accepted. In our system, we assume that all users have the same eyeball size based on physiological eyeball models. However, we succeed to calibrate the physiologic movement of the eyeball center depending on the gazing direction by approximating it as a change in the eyeball radius. In the gaze detection stage, the iris is extracted from a captured face frame by using the Hough transform. Then, the eyegaze angle is derived by calculating the Euclidean distance of the iris centers between the extracted frame and a reference frame captured in the calibration process. We apply our system to an eyegaze communication interface, and verified the performance through key typing experiments with a visual keyboard on display.

A method was developed for deriving the approximate global optimum of a nonlinear objective function with multiple local optimums. The objective function is expanded into a linear wave coefficient equation, so the problem of maximizing the objective function is reduced to that of maximizing a quadratic function with respect to the wave coefficients. Because a wave function expressed by the wave coefficients is used in the algorithm for maximizing the quadratic function, the algorithm is equivalent to a full search algorithm, i.e., one that searches in parallel for the global optimum in the whole domain of definition. Therefore, the global optimum is always derived. The method was evaluated for various objective functions, and computer simulation showed that a good approximation of the global optimum for each objective function can always be obtained.

A space-time and multipath diversity combining algorithm is presented for STBC single carrier block transmission system with two transmit and one receive antennas. The initial solution is achieved by an STBC-based frequency domain equalizer, and the multipath components in the received signal are decoupled by this initial solution and channel state information. Finally, STBC combining is carried out on each decoupled multipath component separately, and then the single carrier output branches are combined further using the maximal ratio combining (MRC) algorithm.

Recently, a new multi-carrier CDMA (MC-CDMA) system with cyclic-shift orthogonal keying (CSOK) has been proposed and shown to be more spectral and power efficient than conventional MC-CDMA systems. In this paper, a novel extension called the multiplexed CSOK (MCSOK) MC-CDMA system is proposed to further increase the data rate while maintaining a low peak-to-average power ratio (PAPR). First, the data stream is divided into multiple parallel substreams that are mapped into QPSK-CSOK symbols in terms of cyclic shifted Chu sequences. Second, these sequences are repeated, modulated, summed, and placed on IFFT subcarriers, resulting in a constant-modulus multiplexed signal that preserves the desired orthogonality among substreams. The receiver performs frequency-domain equalization and uses efficient demultiplexing, despreading, and demapping schemes to detect the modulation symbols. Furthermore, an alternate MCSOK system configuration with high link quality is also presented. Simulations show that the proposed MCSOK system attains lower PAPR and BER, as compared to conventional MC-CDMA system using Walsh codes. Under a rich multipath environment, the high link quality configuration exhibits excellent performance with both diversity gain and MCSOK modulation gain.

An analog circuit testing scheme is presented. The testing technique is a sinusoidal fault signature characterization, involving the measurement of DC offset, amplitude, frequency and phase shift, and the realization of two crossing level voltages. The testing system is an extension of the IEEE 1149.4 standard through the modification of an analog boundary module, affording functionalities for both on-chip testing capability, and accessibility to internal components for off-chip testing. A demonstrating circuit-under-test, a 4th-order Gm-C low-pass filter, and the proposed analog testing scheme are implemented in a physical level using 0.18-µm CMOS technology, and simulated using Hspice. Both catastrophic and parametric faults are potentially detectable at the minimum parameter variation of 0.5%. The fault coverage associated with CMOS transconductance operational amplifiers and capacitors are at 94.16% and 100%, respectively. This work offers the enhancement of standardizing test approach, which reduces the complexity of testing circuit and provides non-intrusive analog circuit testing.

Designing NURBS surfaces by manipulating control points directly requires too much trial and error for immersive VR applications. A more natural interface is provided by deforming a NURBS surface so that it passes through a given target point; and by repeating such deformations we can make the surface follow one or more target curves. These deformations can be achieved by modifying the pseudo-inverse matrix of the basis functions, but this matrix is often ill-conditioned. However, the application of a modified FE approach to the weights and control points provides controllable deformations, which are demonstrated across a range of example shapes.

Impossible differential attack (IDA) uses impossible differential characteristics extracted from enough plaintext pairs to retrieve subkeys of the first and the last several rounds of AES. In this paper, a general IDA on 7-round AES is proposed. Such attack takes the number of all-zero columns of the 7th and the 6th round as parameters (α,β). And a trade-off relation between the number of plaintexts and times of encryptions in the process of the attack is derived, which makes only some values of (α,β) allowed in the attack for different key length.

The NTRU cryptosystem is a public key system based on lattice problems. While its theoretical security has been well studied, little effort has been made to analyze its security against implementation attacks including power analysis attacks. In this paper, we show that a typical software implementation of NTRU is vulnerable to the simple power analysis and the correlation power analysis including a second-order power attack. We also present novel countermeasures to prevent these attacks, and perform experiments to estimate the performance overheads of our countermeasures. According to our experimental results, the overheads in required memory and execution time are only 8.17% and 9.56%, respectively, over a Tmote Sky equipped with an MSP430 processor.

Recently, proportionate adaptive algorithms have been proposed to speed up convergence in the identification of sparse impulse response. Although they can improve convergence for sparse impulse responses, the steady-state misalignment is limited by the constant step-size parameter. In this article, based on the principle of least perturbation, we first present a derivation of normalized version of proportionate algorithms. Then by taking the disturbance signal into account, we propose a variable step-size proportionate NLMS algorithm to combine the benefits of both variable step-size algorithms and proportionate algorithms. The proposed approach can achieve fast convergence with a large step size when the identification error is large, and then considerably decrease the steady-state misalignment with a small step size after the adaptive filter reaches a certain degree of convergence. Simulation results verify the effectiveness of the proposed approach.

Conventional efficient key recovery attacks against Wired Equivalent Privacy (WEP) require specific initialization vectors or specific packets. Since it takes much time to collect the packets sufficiently, any active attack should be performed. An Intrusion Detection System (IDS), however, will be able to prevent the attack. Since the attack logs are stored at the servers, it is possible to prevent such an attack. This paper proposes an algorithm for recovering a 104-bit WEP key from any IP packets in a realistic environment. This attack needs about 36,500 packets with a success probability 0.5, and the complexity of our attack is equivalent to about 220 computations of the RC4 key setups. Since our attack is passive, it is difficult for both WEP users and administrators to detect our attack.

In this paper, we propose a technique for estimating the degree or intensity of emotional expressions and speaking styles appearing in speech. The key idea is based on a style control technique for speech synthesis using a multiple regression hidden semi-Markov model (MRHSMM), and the proposed technique can be viewed as the inverse of the style control. In the proposed technique, the acoustic features of spectrum, power, fundamental frequency, and duration are simultaneously modeled using the MRHSMM. We derive an algorithm for estimating explanatory variables of the MRHSMM, each of which represents the degree or intensity of emotional expressions and speaking styles appearing in acoustic features of speech, based on a maximum likelihood criterion. We show experimental results to demonstrate the ability of the proposed technique using two types of speech data, simulated emotional speech and spontaneous speech with different speaking styles. It is found that the estimated values have correlation with human perception.

In this paper, we propose a rapid model adaptation technique for emotional speech recognition which enables us to extract paralinguistic information as well as linguistic information contained in speech signals. This technique is based on style estimation and style adaptation using a multiple-regression HMM (MRHMM). In the MRHMM, the mean parameters of the output probability density function are controlled by a low-dimensional parameter vector, called a style vector, which corresponds to a set of the explanatory variables of the multiple regression. The recognition process consists of two stages. In the first stage, the style vector that represents the emotional expression category and the intensity of its expressiveness for the input speech is estimated on a sentence-by-sentence basis. Next, the acoustic models are adapted using the estimated style vector, and then standard HMM-based speech recognition is performed in the second stage. We assess the performance of the proposed technique in the recognition of simulated emotional speech uttered by both professional narrators and non-professional speakers.

The Fourier series expansion method is a useful tool to approach the problems of discontinuities in optical waveguides, and it can apply to analyze the Floquet-modes of photonic crystal waveguides. However, it has known that the Floquet-mode calculation with large truncation order is limited because of the roundoff errors. This paper proposes a novel formulation of the Floquet-modes propagating in two-dimensional photonic crystal waveguides formed by circular cylinders. We introduce a periodic boundary condition as same with the conventional method, and the fields are expressed in the Fourier series expansions. The present formulation also introduces the cylindrical-wave expansions and uses the recursive transition-matrix algorithm, which is used to analyze the scattering from cylinder array. This makes us possible to obtain very high accuracy without the use of large truncation order for Fourier series expansion. The presented formulation is validated by numerical experiments.

Ultrasonic imaging is useful in seabed or lakebed observations. We can roughly estimate the sea depth by hearing the echo generated by the boundary of water and rocks or sand. However, the estimation quality is usually not sufficient to draw seabed landscape since the echo signal includes serious distortion caused by autointerference. This paper proposes a novel method to visualize the shape of distant boundaries, such as the seawater-rock/sand boundary, based on the complex-valued Markov random field (CMRF) model. Our method realizes adaptive compensation of distortion without changing the global features in the measurement data, and obtains higher-quality landscape with less computational cost than conventional methods.

The coupled mode equation describing the propagation of light in a disordered waveguide system composed of randomly different cores in size is analytically solved by the perturbation method and the average amplitude of light is derived. In the summation of a perturbation series only successive scatterings from different cores are taken into account. The result obtained shows that the average amplitude behaves as if in an ordered waveguide system composed of identical cores at short distance and decreases exponentially with increasing distance at large distance. The result is compared with the result obtained by the coherent potential approximation and the both results are in good agreement with each other. The results are also compared with the results obtained by numerically solving the coupled mode equation.

The theoretical studies conducted mainly by the author are reviewed on (1) derivation of arbitrary order moment equations and solutions of some equations, (2) scattering by many particles and the effective medium constant of random medium, (3) scattering by a conducting body in random media and (4) spatially partially-coherent wave scattering, with application to satellite communications, artificial material development, and sensing and radar technology. The leading research results are described with many references; and also unsolved subjects in the above four studies are touched.

The electrical properties of poly-Si thin film transistors (TFTs) using rapid thermal annealing with various gate oxide thicknesses were studied in this work. It was found that Poly-Si TFT electrical characteristics with the thinnest gate oxide thickness after RTA treatment exhibits the largest performance improvement compared to TFT with thick oxide as a result of the increased incorporated amounts of the nitrogen and oxygen. Thus, the combined effects can maintain the advantages and avoid the disadvantages of scaled-down oxide, which is suitable for small-to-medium display mass production.

This paper considers the proportional fair (PF) based subcarrier allocation problem in a multihop orthogonal frequency division multiple access (OFDMA) broadcast system with decode-and-forward (DF) relays. The problem is formulated as a mixed binary integer programming problem with the objective to achieve proportional fairness among users and exploit the diversity provided by the independent frequency selective fading among hops. Since it is prohibitive to find the optimal solution, two efficient heuristic schemes are proposed. Simulation results indicate that with the same fairness performance, the proposed schemes achieve considerable capacity gain over the conventional PF scheduling method.