This paper is concerned with exploring an extended approach for the stability analysis and synthesis for Markovian jump nonlinear systems (MJNLSs) via fuzzy control. The Takagi-Sugeno (T-S) fuzzy model is employed to represent the MJNLSs with incomplete transition description. In this paper, not all the elements of the rate transition matrices (RTMs), or probability transition matrices (PTMs) are assumed to be known. By fully considering the properties of the RTMs and PTMs, sufficient criteria of stability and stabilization is obtained in both continuous and discrete-time. Stabilization conditions with a mode-dependent fuzzy controller are derived for Markovian jump fuzzy systems in terms of linear matrix inequalities (LMIs), which can be readily solved by using existing LMI optimization techniques. Finally, illustrative numerical examples are provided to demonstrate the effectiveness of the proposed approach.

The fading channel model is seen as an important approach that can efficiently capture the basic time-varying properties of wireless channels, while physical layer security is a promising approach to providing a strong form of security. This paper focuses on the fundamental performance study of applying physical layer security to achieve secure and reliable information transmission over the fading wire-tap channel. For the practical scenario where the main channel is correlated with the eavesdropper channel but only the real time channel state information (CSI) of the main channel is known at the transmitter, we conduct a comprehensive study on the fundamental performance limits of this system by theoretically modeling its secrecy capacity, transmission outage probability and secrecy outage probability. With the help of these theoretical models, we then explore the inherent performance tradeoffs under fading wire-tap channel and also the potential impact of channel correlation on such tradeoffs.

A D2D (Device-to-Device) communication system needs to cope with inter-cell interference and other types of interferences between cellular network and D2D links. As a result, macro user equipments, particularly those located near a cell edge, will suffer from serious link performance degradation. We propose a novel interference avoidance mechanism assisted by the SRN (Shared Relay Node) in this letter. The SRN not only performs data re-transmission as a typical type-II relay, but has several newly defined features to avoid interference between cellular network and D2D links. The superb performance by the proposed scheme is evaluated through extensive system level simulations.

This paper introduces a comparison of three automatic gait generation methods for quadruped robots: GA (Genetic Algorithm), GP (genetic programming) and CPG (Central Pattern Generator). It aims to provide a useful guideline for the selection of gait generation methods. GA-based approaches seek to optimize paw locus in Cartesian space. GP-based techniques generate joint trajectories using regression polynomials. The CPGs are neural circuits that generate oscillatory output from an input coming from the brain. Optimizations for the three proposed methods are executed and analyzed using a Webots simulation of the quadruped robot built by Bioloid. The experimental comparisons and analyses provided herein will be an informative guidance for research of gait generation method.

2-time slot cooperative relay can be used to increase the cell-edge throughput. Adaptive data modulation further improves the throughput. In this paper, we introduce adaptive modulation to single-carrier (SC) cooperative decode-and-forward (DF) relay. The best modulation combination for mobile-terminal (MT)-relay station (RS) and RS-base station (BS) links is determined for the given local average signal-to-noise power ratios (SNRs) of MT-BS, MT-RS and RS-BS links. According to the modulation combination, the ratio of time slot length of the MT-RS link (first time slot) and the RS-BS link (second time slot) is changed. It is shown by computer simulation that the use of adaptive modulation can achieve higher throughput than fixed modulation and reduces by about 9dB the required normalized total transmit SNR for a 10%-outage throughput of 0.8 bps/Hz compared to direct transmission.

This paper presents 10-Gbit/s bidirectional and 20-Gbit/s unidirectional wireless data transmission systems using 120-GHz-band finline orthomode transducers (OMTs). A new finline OMT was fabricated with two improved designs, to adapt it to the data transmission characteristics of the 120-GHz-band wireless link. One improvement is higher isolation between orthogonal ports and the other is lower group delay variation. The measured isolation is more than 59dB at the carrier frequency of the 120-GHz-band wireless link, and the measured group delay variation is 43ps. Using the finline OMT, we developed 10-Gbit/s bidirectional and 20-Gbit/s unidirectional wireless equipment that can transmit two channels of 10-Gbit/s data using polarization multiplexing. With this wireless equipment, we succeeded in 10-Gbit/s bidirectional and 20-Gbit/s unidirectional wireless data transmission, which leads to successful seamless connection to 10 Gigabit Ethernet and 12-ch high definition television signal transmission.

Spectrum sensing is one of the methods to identify available white spaces for secondary usage which was specified by the regulators. However, signal quality to be sensed can plunge to a very low signal-to-noise-ratio due to signal propagation and hence readings from individual sensors will be unreliable. Distributed sensing by the cooperation of multiple sensors is one way to cope with this problem because the diversity gain due to the combining effect of data captured at different position will assist in detecting signals that might otherwise not be detected by a single sensor. In effect, the probability of detection can be improved. We have implemented a distributed sensing system to evaluate the performance of different cooperative sensing algorithms. In this paper we describe our implementation and measurement experience which include the system design, specification of the system, measurement method, the issues and solutions. This paper also confirms the performance enhancement offered by distributed sensing algorithms, and describes several ideas for further enhancement of the sensing quality.

Designing a medium access control (MAC) protocol is a key for implementing any practical wireless network. In general, a MAC protocol is responsible for coordinating users in accessing spectrum resources. Given that a user in cognitive radio(CR) networks do not have priority in accessing spectrum resources, MAC protocols have to perform dynamic spectrum access (DSA) functions, including spectrum sensing, spectrum access, spectrum allocation, spectrum sharing and spectrum mobility, beside conventional control procedure. As a result, designing MAC protocols for CR networks requires more complicated consideration than that needed for conventional/primary wireless network. In this paper, we focus on two major perspectives related to the design of a CR-MAC protocol: dynamic spectrum access functions and network infrastructure. Five DSA functions are reviewed from the point of view of MAC protocol design. In addition, some important factors related to the infrastructure of a CR network including network architecture, control channel management, the number of radios in the CR device and the number of transmission data channels are also discussed. The remaining challenges and open research issues are addressed for future research to aim at obtaining practical CR-MAC protocols.

This paper reports the use of haptic augmented reality in breast tumor palpation. In general, lumps in the breast are stiffer than surrounding tissues, allowing us to haptically detect them through self-palpation. The goal of the study is to assist self-palpation of lumps by haptically augmenting stiffness around lumps. The key steps are to estimate non-linear stiffness of normal tissues in the offline preprocessing step, detect areas that show abnormally stiffer responses, and amplify the difference in stiffness through a haptic augmented reality interface. The performance of the system was evaluated in a user-study, demonstrating the potential of the system.

In this letter, we propose an energy-aware source routing protocol for maximizing the network lifetime in mobile ad hoc networks. We define a new routing cost by considering both transmit and receive power consumption and remaining battery level in each node simultaneously and present an efficient route discovery procedure to investigate the proposed routing cost. Intensive simulation verifies that the proposed routing protocol has similar performance to the conventional routing protocols in terms of the number of transmission hops, transmission rate, and energy consumption while significantly improving the performance with respect to network lifetime.

Television white spaces (TVWS) are locally and/or temporally unused portions of TV bands. After TVWS regulations were passed in the USA, more and more regulators have been considering efficient use of TVWS. Under the condition that the primary user, i.e., terrestrial TV broadcasting system, is not interfered, various secondary users (SUs) may be deployed in TVWS. In Japan, the TVWS regulations started with broadcast-type SUs and small-area broadcasting systems, followed by voice radio. This paper aims to provide useful insights for more efficient utilization of TVWS as one of the options to meet the continuously increasing demand for wireless bandwidth. TVWS availability in Japan is analyzed using graphs and maps. As per the regulations in Japan, for TV broadcasting service, a protection contour is defined to be 51dBµV/m, while the interference contour for SU is defined to be 12.3dBµV/m. We estimate TVWS availability using these two regulation parameters and the minimum separation distances calculated on the basis of the ITU-R P.1546 propagation models. Moreover, we investigate and explain the effect of two important factors on TVWS availability. One is the measures to avoid adjacent channel interference, while the other is whether the SU has client devices with interference ranges beyond the interference area of the master device. Furthermore, possible options to increase available TVWS channels are discussed.

This paper presents the design and proof-of-concept validation of a novel network-assisted spectrum coordination (NASCOR) service for improved radio coexistence in future shared spectrum bands. The basic idea is to create an overlay network service for dissemination of spectrum usage information between otherwise independent radio devices and systems, enabling them to implement decentralized spectrum coexistence policies that reduce interference and improve spectrum packing efficiency. The proposed method is applicable to unlicensed band and shared spectrum systems in general (including femtocells), but is particularly relevant to emerging TV white spaces and cognitive radio systems which are still in need of scalable and accurate solutions for both primary-to-secondary and secondary-to-secondary coordination. Key challenges in enabling a network layer spectrum coordination service are discussed along with the description of our system architecture and a detailed case-study for a specific example of spectrum coordination: client-AP association optimization in dense networks. Performance gains are evaluated through large-scale simulations with multiple overlapping networks, each consisting of 15-35 access points and 50-250 clients in a 0.5×0.5 sq.km. urban setting. Results show an average of 150% improvement in random deployments and upto 7× improvements in clustered deployments for the least-performing client throughputs with modest reductions in the mean client throughputs.

A fast and accurate architecture exploration for high performance and low energy VLIW data-path is proposed. The main contribution is a method to find Pareto optimal FU structures, i.e., the optimal number of FUs and the best instruction assignment for each FU. The proposed architecture exploration method is based on GA and enables the effective exploration of vast solution space. Experimental results showed that proposed method was able to achieve fast and accurate architecture exploration. For most cases, the estimation error was less than 1%.

In this paper, we present a new four parameter estimator of sampled sinusoidal signals that does not require iteration. Mathematically, the four parameters (frequency, phase, magnitude, and dc offset) of sinusoidal signals can be obtained when four data points are given. In general, the parameters have to be calculated with iteration since the equations are nonlinear. In this paper, we point out that the four parameters can be obtained analytically if the four data points given are measured using a fixed sampling interval. Analytical expressions for the four parameters are derived using the signal differences. Based on this analysis, we suggest an algorithm of estimating the four parameters from N data samples corrupted by noise without iteration. When comparing with the IEEE-1057 method which is based on the least-square method, the proposed algorithm does not require the initial guess of the parameters for iteration and avoid the convergence problem. Also, the number of required numerical operations for estimation is fixed if N is determined. As a result, the processing time of parameter estimation is much faster than the least-square method which has been confirmed by numerical simulations. Simulation results and the quantitative analysis show that the estimation error of the estimated parameters is less than 1.2 times the square root of the Cramer-Rao bounds when the signal to noise ratio is larger than 20dB.

Text Categorization (TC) is a task of classifying a set of documents into one or more predefined categories. Centroid-based method, a very popular TC method, aims to make classifiers simple and efficient by constructing one prototype vector for each class. It classifies a document into the class that owns the prototype vector nearest to the document. Many studies have been done on constructing prototype vectors. However, the basic philosophies of these methods are quite different from each other. It makes the comparison and selection of centroid-based TC methods very difficult. It also makes the further development of centroid-based TC methods more challenging. In this paper, based on the observation of its general procedure, the centroid-based text classification is treated as a kind of ranking task, and a unified framework for centroid-based TC methods is proposed. The goal of this unified framework is to classify a text via ranking all possible classes by document-class similarities. Prototype vectors are constructed based on various loss functions for ranking classes. Under this framework, three popular centroid-based methods: Rocchio, Hypothesis Margin Centroid and DragPushing are unified and their details are discussed. A novel centroid-based TC method called SLRCM that uses a smoothing ranking loss function is further proposed. Experiments conducted on several standard databases show that the proposed SLRCM method outperforms the compared centroid-based methods and reaches the same performance as the state-of-the-art TC methods.

The paper presents a survey on OpenFlow related technologies that have been proposed as a means for researchers, network service creators, and others to easily design, test, and deploy their innovative ideas in experimental or production networks to accelerate research activities on network technologies. Rather than having programmability within each network node, separated OpenFlow controllers provide network control through pluggable software modules; thus, it is easy to develop new network control functions in executable form and test them in production networks. The emergence of OpenFlow has started various research activities. The paper surveys these activities and their results.

A data-driven controller has been proposed for nonlinear systems, and its effectiveness has been also shown. However, according to this control scheme, considerable large computation burden is required in on-line learning to update the database. The on-line limit its implementation in industrial processes. In this paper, a controller design scheme is proposed, which enables us to update the database in an off-line manner.

This paper summarizes the current status of regulations, standardization efforts and trials around the world regarding white space (WS) communications, especially television band WS (TVWS). After defining WS communication systems configurations and function and the categories of white space database, the TVWS regulations in United States, United Kingdom, and Japan are summarized. Then regarding status of standardization for TVWS devices, IEEE 802 and IEEE 1900 standards are summarized. Finally ongoing pilot projects and trials of WS communications in the world are summarized, and trends and future direction of research on WS communication systems are summarized.

This paper addresses the discrete abstraction problem for stochastic nonlinear systems with continuous-valued state. The proposed solution is based on a function, called the bisimulation function, which provides a sufficient condition for the existence of a discrete abstraction for a given continuous system. We first introduce the bisimulation function and show how the function solves the problem. Next, a convex optimization based method for constructing a bisimulation function is presented. Finally, the proposed framework is demonstrated by a numerical simulation.

In this paper, we proposed reduction operators of timed Petri net for efficient model checking. Timed Petri nets are used widely for modeling and analyzing systems which include time concept. Analysis of the system can be done comprehensively with model checking, but there is a state-space explosion problem. Therefore, previous researchers proposed reduction methods and translation methods to timed automata to perform efficient model checking. However, there is no reduction method which consider observability and there is a trade-off between the amount of description and the size of state space. In this paper, first, we have defined a concept of timed behavioral inheritance. Next, we have proposed reduction operators of timed Petri nets based on timed behavioral inheritance. Then, we have applied our proposed operators to an artificial timed Petri net. Moreover, the results show that the reduction operators which consider observability can reduce the size of state space of the original timed Petri nets within the experiment.