The Towers of Hanoi problem is a classical problem in puzzles, games, mathematics, data structures, and algorithms. In this letter, a least memory used algorithm is proposed by combining the source array and target array for comparing the sizes of disk and labeling the disks in the towers of Hanoi problem. As a result, the proposed algorithm reduces the space needed from 2n+2 to n+5, where n represents the disks number.

This paper describes a technique for reconstructing dynamic scene geometry using a handheld video projector-camera system and a single checkerboard image as a structured light pattern. The proposed technique automatically recognizes a dense checkerboard pattern under dynamic conditions. The pattern-recognition process is adaptive to different light conditions and an object's color, thereby avoiding the need to set threshold values manually for different objects when the scanning device is moving. We also propose a technique to find corresponding positions for the checkerboard pattern, when displayed by a projector, without needing any position-encoding techniques. The correspondence matching process is based on epipolar geometry, enabling the checkerboard pattern to be matched even if parts of it are occluded. By using a dense checkerboard pattern, we can construct a handheld projector-camera system that can acquire the geometry of objects in real time, and we have verified the feasibility of the proposed techniques.

In this paper we unveil basic properties of a code Γq for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c = 2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c ≥ 3. Relationships between Γq and other existing classes of codes are discussed as well.

In a periodic spectrum sensing framework where each frame consists of a sensing block and a data transmitting block, increasing sensing duration decreases the probabilities of both missed opportunity and interference with primary users, but increasing sensing duration also decreases the energy efficiency and the transmitting efficiency of the cognitive network. Therefore, the sensing duration to use is a trade-off between sensing performance and system efficiencies. The relationships between sensing duration and state transition probability are analyzed firstly, when the licensed channel stays in the idle and busy states respectively. Then a state transition probability based sensing duration optimization algorithm is proposed, which can dynamically optimize the sensing duration of each frame in the current idle/busy state by predicting each frame's state transition probability at the beginning of the current state. Analysis and simulation results reveal that the time-varying optimal sensing duration increases as the state transition probability increases and compared to the existing method, the proposed algorithm can use as little sensing duration in each frame as possible to satisfy the sensing performance constraints so as to maximize the energy and transmitting efficiencies of the cognitive networks.

In the contention access period (CAP) of IEEE 802.15.4 beacon-enabled mode, collision probability increases, and network performance decreases as the number of contending devices increases. In this paper, we propose an enhanced contention access mechanism (ECAM) to reduce the collision probability in low rate -- wireless personal area networks (LR-WPANs). In ECAM, since the duration of each CAP is divided into multiple sub-CAPs, the number of devices contending for frame transmissions in each sub-CAP can be reduced by approximately one over the number of sub-CAPs. Further, this lowers the probability of collision due to two or more simultaneous frame transmissions. In addition, since ECAM shortens the channel access duration of devices, devices with ECAM have lower power consumption. To compare the performance of ECAM with that of the IEEE 802.15.4 standard, we carry out extensive simulations. The results show that ECAM yields better performance than the IEEE 802.15.4 standard, especially for dense networks with a heavy traffic load.

In a spectrum sharing system, lower-priority users are allowed to spatially reuse the spectrum allocated to higher-priority users as long as they do not disrupt communications of the latter. Therefore, to improve spectrum utilization, an important requirement for the former users is to manage the interference and ensure that the latter users can maintain reliable communications. In the present paper, a game theoretic framework of joint channel selection and power allocation for spectrum sharing in distributed cognitive radio networks is proposed. First, a utility function that captures the cooperative behavior to manage the interference and the satisfaction level to improve the throughput of the lower-priority users is defined. Next, based on the defined utility function, the proposed framework can be formulated as a potential game; thus, it is guaranteed to converge to a Nash equilibrium when the best response dynamic is performed. Simulation results show the convergence of the proposed potential game and reveal that performance improvements in terms of network throughput of the lower-priority users and outage probability of the higher-priority users can be achieved by the introduction of an adaptive coefficient adjustment scheme in the proposed utility function at the expense of the convergence to the Nash equilibrium.

The performance of the kernel-based learning algorithms, such as SVM, depends heavily on the proper choice of the kernel parameter. It is desirable for the kernel machines to work on the optimal kernel parameter that adapts well to the input data and the learning tasks. In this paper, we present a novel method for selecting Gaussian kernel parameter by maximizing a class separability criterion, which measures the data distribution in the kernel-induced feature space, and is invariant under any non-singular linear transformation. The experimental results show that both the class separability of the data in the kernel-induced feature space and the classification performance of the SVM classifier are improved by using the optimal kernel parameter.

Quite recently [IEEE Commu. Letters, Vol.14, No.1, 2010], Choi et al. proposed a handover authentication scheme using credentials based on chameleon hashing, claiming to provide several security features including Perfect Forward/Backward Secrecy (PFS/PBS). This paper examines the security of the scheme and shows that the scheme still fails to achieve PFS/PBS unlike their claims.

This paper proposes a prioritized aggregation method that supports compressed video transmission on millimeter wave wireless personal area network (mmWave WPAN) systems. Frame aggregation is an effective means to improve system efficiency and throughput for wide band systems such as mmWave WPAN. It is required by the applications that the mmWave WPAN systems should provide Gbps or multiGbps transmission capability. The proposed scheme targets not only transmission efficiency but also support of compressed video transmission which currently is very popular. The proposal combines MAC layer aggregation with PHY layer skew modulation to facilitate the video transmission in a way that more important data is better protected. Simulation results show that the average peak signal to noise ratio (PSNR) performance is improved by 5 dB compared to conventional method, while the Gbps transmission requirement is fulfilled.

In this paper, we propose a new motion vector smoothing algorithm using weighted vector median filtering based on edge direction for frame interpolation. The proposed WVM (Weighted Vector Median) system adjusts the weighting values based on edge direction, which is derived from spatial coherence between the edge direction continuity of a moving object and motion vector (MV) reliability. The edge based weighting scheme removes the effect of outliers and irregular MVs from the MV smoothing process. Simulation results show that the proposed algorithm can correct wrong motion vectors and thus improve both the subjective and objective visual quality compared with conventional methods.

We present a new method that can represent the reflectance of metallic paints accurately using a two-layer reflectance model with sampled microfacet distribution functions. We model the structure of metallic paints simplified by two layers: a binder surface that follows a microfacet distribution and a sub-layer that also follows a facet distribution. In the sub-layer, the diffuse and the specular reflectance represent color pigments and metallic flakes respectively. We use an iterative method based on the principle of Gauss-Seidel relaxation that stably fits the measured data to our highly non-linear model. We optimize the model by handling the microfacet distribution terms as a piecewise linear non-parametric form in order to increase its degree of freedom. The proposed model is validated by applying it to various metallic paints. The results show that our model has better fitting performance compared to the models used in other studies. Our model provides better accuracy due to the non-parametric terms employed in the model, and also gives efficiency in analyzing the characteristics of metallic paints by the analytical form embedded in the model. The non-parametric terms for the microfacet distribution in our model require densely measured data but not for the entire BRDF(bidirectional reflectance distribution function) domain, so that our method can reduce the burden of data acquisition during measurement. Especially, it becomes efficient for a system that uses a curved-sample based measurement system which allows us to obtain dense data in microfacet domain by a single measurement.

Recent studies investigating the Internet topology reported that inter Autonomous System (AS) topology exhibits a power-law degree distribution which is known as the scale-free property. Although there are many models to generate scale-free topologies, no game theoretic approaches have been proposed yet. In this paper, we propose the new dynamic game theoretic model for the AS level Internet topology formation. Through numerical simulations, we show our process tends to give emergence of the topologies which have the scale-free property especially in the case of large decay parameters and large random link costs. The significance of our study is summarized as following three topics. Firstly, we show that scale-free topologies can also emerge from the game theoretic model. Secondly, we propose the new dynamic process of the network formation game for modeling a process of AS topology formation, and show that our model is appropriate in the micro and macro senses. In the micro sense, our topology formation process is appropriate because this represents competitive and distributed situation observed in the real AS level Internet topology formation process. In the macro sense, some of statistical properties of emergent topologies from our process are similar to those of which also observed in the real AS level Internet topology. Finally, we demonstrate the numerical simulations of our process which is deterministic variation of dynamic process of network formation game with transfers. This is also the new result in the field of the game theory.

The rapid growth of IT technology has enabled ship navigation and automation systems to gain better functionality and safety. However, they generally have their own proprietary structures and networks, which makes interfacing with and remote access to them difficult. In this paper, we propose a total ship service framework that includes a ship area network to integrate separate system networks with heterogeneity and dynamicity, and a ship-shore communication infrastructure to support a remote monitoring and maintenance service using satellite communications. Finally, we present some ship service systems to demonstrate the applicability of the proposed framework.

The spatio-temporal multiple view geometry can represent the geometry of multiple images in the case where non-rigid arbitrary motions are viewed from multiple translational cameras. However, it requires many corresponding points and is sensitive to the image noise. In this paper, we investigate mutual projections of cameras in four-dimensional space and show that it enables us to reduce the number of corresponding points required for computing the spatio-temporal multiple view geometry. Surprisingly, take three views for instance, we no longer need any corresponding point to calculate the spatio-temporal multiple view geometry, if all the cameras are projected to the other cameras mutually for two time intervals. We also show that the stability of the computation of spatio-temporal multiple view geometry is drastically improved by considering the mutual projections of cameras.

We propose a new channel adaptive distributed video coding algorithm, which is adaptive to time-varying available bitrate and packet loss ratio. The proposed method controls the quantization parameter according to channel condition of especially error-prone mobile channel. Simulation shows that the proposed algorithm outperforms the conventional rate-control-only algorithm.

Usually the contact voltage drop or contact resistance of electromagnetic relays is observed only to identify if the contacts are failure or not on the manufactures' life tests. However, it is difficult to reveal the contact performance degradation because the variation of contact resistance may not be obvious. In this paper, a new life test technology was investigated to analyze the contact failure mechanisms and degenerative processes of electromagnetic relays by measuring their time parameters including closing time, opening time, over-travel time, rebound duration and gap time during each operation. Moreover, for the purpose of verifying the time parameters, the contact motion and contact morphology during life test were record by using a high speed camera. Both the variations of time parameters and information obtained from photos taken by high speed camera show that it involves three different degenerative phases during the whole life of a relay. The results also indicate this method is an effective technology to discriminate and diagnose the failure mechanisms for electromagnetic relays.

In this letter, we propose a new tuning method of ε value, which is a parameter in the ε-filter, using a metric between signal distributions, i.e., Hellinger distance. The difference between the input and output signals is evaluated using Hellinger distance and used for the parameter tuning in the proposed method.

Break arcs are generated between pure silver electrical contacts in a DC high-voltage resistive circuit. The break arc is driven by the external magnetic field of a permanent magnet from horizontal direction of contacts. Electrical contacts are separated at constant opening speed at 75 mm/s. The maximum supply voltage is 300 V. The maximum circuit current when electrical contacts are closed is 20 A. The maximum output power of the supply is limited to 6.0 kW. The gap between the contacts and the magnet is defined as x. The gap is varied from 2.5 mm to 10.0 mm to change the magnetic flux density that affects the break arc. The break arc is observed with a high-speed camera. The effect of the magnetic field on the arc duration was examined. As a result, break arcs are successfully extinguished by the transverse magnetic field when the gap x is 2.5 mm. Then the length of the break arc just before lengthening of the break arc L and the Lorentz force that affects the break arc F are examined. The length L was almost constant for each gap x and independent of the circuit current I and the Lorentz force F. The break arc is driven by the magnetic field when the arc length reached a certain length that was determined by the strength of the magnetic flux density.

Higher frame-rates are essential in achieving more realistic representations. Since increasing the frame-rate increases the total amount of information, efficient coding methods are required. However, the statistical properties of such data, needed for designing sufficiently powerful encoders, have not been clarified. Conventional studies on encoding high frame-rate sequences do not consider the effect on the encoding bit-rate of the motion blur generated by the shutter being open. When the open interval of the shutter in the image pickup apparatus increases, motion blur occurs, which is known as the integral phenomenon. The integral phenomenon changes the statistical properties of the video signal. This paper derives, for high frame-rate video, a mathematical model that quantifies the relationship between frame-rate and bit-rate; it incorporates the effect of the low-pass filtering induced by the open shutter. A coding experiment confirms the validity of the mathematical model.

In this paper, we propose a new method that employs two novel features, correlation density (Cd) and fractal dimension (Fd), to recognize emotional states contained in speech. The former feature obtained by a list of parametric filters reflects the broad frequency components and the fine structure of lower frequency components, contributed by unvoiced phones and voiced phones, respectively; the latter feature indicates the non-linearity and self-similarity of a speech signal. Comparative experiments based on Hidden Markov Model and K Nearest Neighbor methods are carried out. The results show that Cd and Fd are much more closely related with emotional expression than the features commonly used.