In this paper, we study the problem of perfect tracking control of nonminimum phase systems in magnetic levitation system. Generally, perfect tracking control schemes cannot be applied to nonminimum phase plants because of unstable pole-zero cancellations. Although the method of state matching using multirate feedforward control to realize perfect tracking control have been proposed, the oscillation restraint and the feasibility in nonminimum phase system cannot be satisfied at same time. We propose a method using the difference of state variables to generate a smooth desired state variable trajectory in the discrete-time systems. The techniques we proposed are applicable to nonminimum phase discrete-time systems and the oscillations between the sampling points are well restrained. We will show that the structure of the proposed perfect tracking controller is very simple and clear. Finally, computer simulations and experiment results based on magnetic levitation apparatus are presented.

The protein threading problem with profiles is known to be efficiently solvable using dynamic programming. In this paper, we consider a variant of the protein threading problem with profiles in which constraints on distances between residues are given. We prove that protein threading with profiles and constraints is NP-hard. Moreover, we show a strong hardness result on the approximation of an optimal threading satisfying all the constraints. On the other hand, we develop two practical algorithms: CLIQUETHREAD and BBDPTHREAD. CLIQUETHREAD reduces the threading problem to the maximum edge-weight clique problem, whereas BBDPTHREAD combines dynamic programming and branch-and-bound techniques. We perform computational experiments using protein structure data in PDB (Protein Data Bank) using simulated distance constraints. The results show that constraints are useful to improve the alignment accuracy of the target sequence and the template structure. Moreover, these results also show that BBDPTHREAD is in general faster than CLIQUETHREAD for larger size proteins whereas CLIQUETHREAD is useful if there does not exist a feasible threading.

Wireless multi-hop networks have drawn much attention for the future generation mobile communication systems. These networks can establish multiple routes from a source node to a destination node because of flexible construction of network topology. Transmissions by multiple routes have enough capability to achieve reliable communication because we can expect to obtain diversity gain by multiple routes. In this paper, we propose the multi-route coding scheme. At first, we discuss a channel model in multi-hop networks employing regenerative relay, which we named the virtual channel model. By using the virtual channel model, a packet is encoded on multiple routes as follows; a bit sequence of a packet is encoded and divided into subpackets, and each subpacket is transmitted on each route. We evaluate its packet error rate performance, and clarify effectiveness of the proposed scheme. In general, we should face degradation of a route condition such as the case when a subpacket does not reach a destination node. Hence, we have to consider the influence of subpacket loss. We also investigate it, and show tolerance of the proposed scheme over that.

We show that the necessary and sufficient condition for the existence of a balanced C4-trefoil decomposition of the complete multi-graph λKn is λ(n-1) ≡ 0 (mod 24) and n ≤ 10. Decomposition algorithms are also given.

For a property π on graphs, the edge-contraction problem with respect to π is defined as a problem of finding a set of edges of minimum cardinality whose contraction results in a graph satisfying the property π. This paper gives a lower bound for the approximation ratio for the problem for any property π that is hereditary on contractions and determined by biconnected components.

This paper deals with graph colouring games, an example of pseudo-telepathy, in which two players can convince a verifier that a graph G is c-colourable where c is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of the Hadamard graph GN with N=c=16. Their protocol applies only to Hadamard graphs where N is a power of 2. We propose a protocol that applies to all Hadamard graphs. Combined with a result of Frankl, this shows that the players can win on any induced subgraph of G12 having 1609 vertices, with c=12. Moreover combined with a result of Godsil and Newman, our result shows that all Hadamard graphs GN (N ≥ 12) and c=N yield pseudo-telepathy games.

The release of image processing techniques make image modification and fakery easier. Image fakery, here, is defined as a process to copy a region of source image and paste it onto the destination image, with some post processing methods applied, such as boundary smoothing, blurring, etc. to make it natural. The most important characteristic of image fakery is object copy and paste. In order to detect fake images, this letter introduces a blind detection scheme based on singular value decomposition (SVD). Experimental results also show the effectiveness of the proposed scheme.

A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. We consider flattening a tree-like linkage, that is, a continuous motion of their bars from an initial configuration to a final configuration looking like a"straight line segment," preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called "radial trees," and show that there exists a radial tree which cannot be flattened.

In this paper, we study the feedback vertex set problem for trivalent Cayley graphs, and construct a minimum feedback vertex set in trivalent Cayley graphs using the result on cube-connected cycles and the Cayley graph representation of trivalent Cayley graphs.

In this paper, we propose a new localization scheme for wireless sensor networks consisting of a huge number of sensor nodes equipped with simple wireless communication devices such as wireless LAN and Bluetooth. The proposed scheme is based on the Point-In-Triangle (PIT) test proposed by He et al. The scheme is actually implemented by using Bluetooth devices of Class 2 standard, and the performance of the scheme is evaluated in an actual environment. The result of experiments indicates that the proposed scheme could realize a localization with an error of less than 2 m.

This paper presents a modal-expansion analysis of the electromagnetically coupled coaxial dipole antenna. The analysis of the antenna problem is initially simplified using the even-odd mode excitation and then the resultant half structure is divided into two parts; one is the characterization of a coaxial feeding network and the other is the modeling of a sleeve monopole antenna driven by a coaxial line. The formally exact modal-expansion method is employed to analyze both parts. The analysis of the sleeve monopole antenna is facilitated by introducing a perfectly conducting boundary at a distance from the monopole's top end. The current distribution and input impedance of the electromagnetically coupled coaxial dipole antenna are obtained by finding expansion coefficients through enforcing the continuity of tangential field components across regional interfaces and cascading the two parts together. Numerical results for the coaxial dipole antenna's radiation characteristics are presented and discussed.

Recently with the high expectation of voice over WLAN service, to support fast inter-AP security transition in WLAN Access Point (AP) is one of the most actively investigating issues. It is also very important problem to minimize inter-AP security transition (IAPST) latency, while maintaining constantly the secure association from old AP when a station transits to new AP. With this background, this paper presents a novel association control mechanism whose objective pursues to minimize IAPST latency time and to take countermeasures against attacks of rogue transition station. Experiment shows that the proposed scheme outperforms the legacy AP over 70% with regard to the transition latency.

The perfect matched layer (PML) is formulated for the use in the constrained interpolation profile (CIP) method. Numerical results are presented to examine the performance of the proposed formulation of the PML in the case of two-dimensional TM wave. The results show that the proposed methods suppress the reflection effectively in comparison with the natural absorbing boundary condition of the CIP method. We have two methods to formulate the PML, and it is shown that the both methods have equal characteristics.

Affine projection algorithms perform well for acoustic echo cancellation and adaptive equalization. Although these algorithms typically provide fast convergence, they are unduly complex when updating the weights of the associated adaptive filter. In this paper, we propose a new subband affine projection (SAP) algorithm and a facile method for its implementation. The SAP algorithm is derived by combining the affine projection algorithm and the subband adaptive structure with the maximal decimation. In the proposed SAP algorithm, the derived weight-updating formula for the subband adaptive filter has a simple form as compared with the normalized least mean square (NLMS) algorithm. The algorithm gives improved convergence and reduced computational complexity. The efficiency of the proposed algorithm for a colored input signal is evaluated experimentally.

Live streaming is delay sensitive and can tolerate some amount of loss. The QoS Multicast for Live Streaming (QMLS) Protocol, focuses on the characteristics of live streaming. It has been shown to improve the performance of live streaming multicast by reducing the end-to-end packet loss probability. However, the placement of active routers performing the QMLS function has not been discussed. This paper proposes a dynamic method to activate and deactivate routers in order to minimize the number of active routers for each QMLS-packet flow and discusses its parameters. The results of an evaluation show that the proposed method can reduce the number of active routers for each flow and adjust the active routers according to changes in the multicast tree.

In this paper, we propose a protocol for multicast communication called Multicast Datagram Transfer Protocol (MDTP) to provide multicast for video broadcasting service on the Internet. MDTP is a one-to-many multicast communication protocol, which is constructed based on IPv4 unicast protocol by utilizing IP Router Alert Option, and it uses unicast addressing and unicast routing protocol. A mechanism is presented to allow a router to remove identical video stream, to duplicate a video stream, and to forward each copy of the duplicated video stream to its destinations. Ordinary IP routers that do not support MDTP will treat the MDTP packets as normal unicast packets. Hence, gradual deployment is possible without tunneling technique. With a delegation mechanism, MDTP router is also able to handle request from clients, and serve the requested video stream. The simulation results show that the average bandwidth usage of MDTP is close to the average bandwidth usage of IP multicast. MDTP also has greater efficiency than XCAST, and its efficiency becomes significant for a large number of clients.

Recent studies of high quality, high resolution traffic measurements have revealed that network traffic appears to be statistically self similar. Contrary to the common belief, aggregating self-similar traffic streams can actually intensify rather than diminish burstiness. Thus, traffic prediction plays an important role in network management. In this paper, Least Mean Kurtosis (LMK), which uses the negated kurtosis of the error signal as the cost function, is proposed to predict the self similar traffic. Simulation results show that the prediction performance is improved greatly over the Least Mean Square (LMS) algorithm.

A novel technique is proposed for measuring the distributed strain and temperature in a fiber with a very high resolution. This technique makes use of the jagged appearance of Rayleigh backscatter traces from a single-mode fiber measured by using a coherent OTDR with a precisely frequency-controlled light source. Our preliminary experiment indicated the possibility of measuring temperature with a resolution of better than 0.01 and a spatial resolution of one meter. This temperature resolution is two orders of magnitude better than that provided by Brillouin-based distributed sensors.

A new cell structure Power MOSFET, which exhibits a lower on-state resistance and lower gate charge than the conventional layout geometry, is proposed in this research. Vertical Power MOSFETs are generally designed by either squared (closed) cell or stripe (linear) cell geometry; each has its own advantages and drawbacks. Typically, closed cell design has lower on resistance but higher gate charge characteristics than the linear one. In this study, we propose, fabricate, and analyze a "wing cell" structure Power MOSFET, which can have lower on resistance and lower gate charge performances than the closed cell structure. In addition, the wing cell design can avoid the "closed concept" patents.

In this paper, a 2-D iteratively reweighted least squares lattice algorithm, which is robust to the outliers, is introduced and is applied to defect detection problem in textured images. First, the philosophy of using different optimization functions that results in weighted least squares solution in the theory of 1-D robust regression is extended to 2-D. Then a new algorithm is derived which combines 2-D robust regression concepts with the 2-D recursive least squares lattice algorithm. With this approach, whatever the probability distribution of the prediction error may be, small weights are assigned to the outliers so that the least squares algorithm will be less sensitive to the outliers. Implementation of the proposed iteratively reweighted least squares lattice algorithm to the problem of defect detection in textured images is then considered. The performance evaluation, in terms of defect detection rate, demonstrates the importance of the proposed algorithm in reducing the effect of the outliers that generally correspond to false alarms in classification of textures as defective or nondefective.