In this paper, the problem on secure communication based on chaos synchronization is investigated. The dual channel information transmitting technology is proposed to increase the security of secure communication system. Based on chaos synchronization, a new digital secure communication scheme is presented for a class of master-slave systems. Finally some numerical simulation examples are given to demonstrate the effectiveness of the given results.

This paper investigates an adaptive movable access point (AMAP) system and explores its feasibility in a static indoor classroom environment with an applied wireless local area network (WLAN) system. In the AMAP system, the positions of multiple access points (APs) are adaptively moved in accordance with clustered user groups, which ensures effective coverage for non-uniform user distributions over the target area. This enhances the signal to interference and noise power ratio (SINR) performance. In order to derive the appropriate AP positions, we utilize the k-means method in the AMAP system. To accurately estimate the position of each user within the target area for user clustering, we use the general methods of received signal strength indicator (RSSI) or time of arrival (ToA), measured by the WLAN systems. To clarify the basic effectiveness of the AMAP system, we first evaluate the SINR performance of the AMAP system and a conventional fixed-position AP system with equal intervals using computer simulations. Moreover, we demonstrate the quantitative improvement of the SINR performance by analyzing the ToA and RSSI data measured in an indoor classroom environment in order to clarify the feasibility of the AMAP system.

Various applications have been realized on mobile computers such as smart phones and tablet computers. Because mobile computers have smaller monitors than conventional computers, strategies to develop user interfaces differ from conventional computer applications. For example, contents in a window are reduced or divided into multiple windows on mobile computers. To realize usable applications in this situation, usability evaluations are important. Although various usability evaluation methods for mobile computers have been proposed, few evaluate applications and identify problems automatically. Herein we propose a systematic usability evaluation method. In our method, operation histories by users are recorded and analyzed to identify steps with usability problems. Our method automatically analyzes usability problems, allowing usability evaluations in software development to be implemented easily and economically. As a case study, the operation histories were recorded and analyzed when 20 subjects operated an application on a tablet computer. Our method automatically identified many usability problems, confirming its effectiveness.

This paper proposes MRO-PUF, a new architecture for ring-oscillator-based physically unclonable functions (PUFs) with enhanced resistance against machine learning attacks. In the proposed PUF, an instantaneous output value of a ring oscillator is used as a response, whereas the most existing PUFs directly use propagation delays to determine the response. Since the response of the MRO-PUF is non-linear and discontinuous as the delay of the ring oscillator increases, the prediction of the response by machine learning attacks is difficult. Through the performance evaluation of the MRO-PUF with simulations, it achieves 15 times stronger resistance against machine learning attacks using a support vector machine compared to the existing ones such as an arbiter PUF and a bistable ring PUF. The MRO-PUF also achieves a sufficient level of the basic performance of PUFs in terms of uniqueness and robustness.

A penta-band antenna based on the mu-negative transmission line is presented for radio frequency (RF) energy harvesting application. The antenna utilizes five radiation modes; two quarter wavelength resonances, three quarter wavelength resonance, zeroth order resonance, and first order resonance. The parasitic radiating strip antenna generates quarter wavelength resonance radiation. The dual band antenna based on two unit cell mu-negative (MNG) transmission line gives birth to the zeroth order resonance (ZOR) mode and the first order resonance (FOR) mode. The parasitic radiating strip and dual band antenna based on two unit mu-negative (MNG) transmission line are magnetically coupled by a feed monopole with gap. This feed monopole, simultaneously, radiates at quarter and three quarter wavelength resonance frequency to cover the other bands. The multi-mode coupling mechanism of this penta-band antenna is well modeled by our derived equivalent circuit. The measured radiation efficiencies are more than 87% over the entire penta-band.

A vertex subset F ⊆ V(G) is called a cyclic vertex-cut set of a connected graph G if G-F is disconnected such that at least two components in G-F contain cycles. The cyclic vertex connectivity is the cardinality of a minimum cyclic vertex-cut set. In this paper, we show that the cyclic vertex connectivity of the trivalent Cayley graphs TGn is equal to eight for n ≥ 4.

Approximate computing is a promising solution for future energy-efficient designs because it can provide great improvements in performance, area and/or energy consumption over traditional exact-computing designs for non-critical error-tolerant applications. However, the most challenging issue in designing approximate circuits is how to guarantee the pre-specified computation accuracy while achieving energy reduction and performance improvement. To address this problem, this paper starts from the state-of-the-art general approximate adder model (GeAr) and extends it for more possible approximate design candidates by relaxing the design restrictions. And then a maximum-error-distance-based performance/accuracy formulation, which can be used to select the performance/energy-accuracy optimal design from the extended design space, is proposed. Our evaluation results show the effectiveness of the proposed method in terms of area overhead, performance, energy consumption, and computation accuracy.

For the reconstruction of the feedback polynomial of a synchronous scrambler placed after a convolutional encoder, the existing algorithms require the prior knowledge of a dual word of the convolutional code. To address the case of a dual word being unknown, a new algorithm for the reconstruction of the feedback polynomial based on triple correlation characteristic of an m-sequence is proposed. First, the scrambled convolutional code sequence is divided into bit blocks; the product of the scrambled bit blocks with a dual word is proven to be an m-sequence with the same period as the synchronous scrambler. Second, based on the triple correlation characteristic of the generated m-sequence, a dual word is estimated; the generator polynomial of the generated m-sequence is computed by two locations of the triple correlation peaks. Finally, the feedback polynomial is reconstructed using the generator polynomial of the generated m-sequence. As the received sequence may contain bit errors, a method for detecting triple correlation peaks based on the constant false-alarm criterion is elaborated. Experimental results show that the proposed algorithm is effective. Ulike the existing algorithms available, there is no need to know a dual word a priori and the reconstruction result is more accurate. Moreover, the proposed algorithm is robust to bit errors.

Quadrant silicon avalanche photodiodes (APDs) were fabricated by standard 0.18µm CMOS process, and were characterized at 405nm wavelength for Blu-ray applications. The size of each APD element is 50×50µm2. The dark current was 10pA at low bias voltage, and low crosstalk of about -80dB between adjacent APD elements was achieved. Although the responsivity is less than 0.1A/W at low bias voltage, the responsivity is enhanced to more than 1A/W at less than 10V bias voltage due to avalanche amplification. The wide bandwidth of 1.5GHz was achieved with the responsivity of more than 1A/W, which is limited by the capacitance of the APD. We believe that the fabricated quadrant APD is a promising photodiode for multi-layer Blu-ray system.

Location information is meaningful information for future ITS (Intelligent Transport Systems) world. Especially, the accuracy of the information is required because the accuracy decides the quality of ITS services. For realization of high precision positioning, Kinematic positioning technique has been attracting attention. The Kinematic positioning requires the configuration of many positioning parameters. However, the configuration is difficult because optimal parameter differs according to user's environment. In this paper, we will propose an estimation method of optimal parameter according to the environment. Further, we will propose an elimination method of unreliable positioning results. Hereby, we can acquire extensively only the reliable positioning results. By using the actual vehicle traveling data, the ability and the applicable range of the proposed method will be shown. The result will show that our proposed method improves the acquision rate of reliable positioning results and mitigates the acquision rate of the unreliable positioning results.

Cellular heterogeneous networks (HetNets) with densely deployed small cells can effectively boost network capacity. The co-channel interference and the prominent energy consumption are two crucial issues in HetNets which need to be addressed. Taking the traffic variations into account, this paper proposes a theoretical framework to analyze spectral efficiency (SE) and energy efficiency (EE) considering jointly further-enhanced inter-cell interference coordination (FeICIC) and spectrum allocation (SA) via a stochastic geometric approach for a two-tier downlink HetNet. SE and EE are respectively derived and validated by Monte Carlo simulations. To create spectrum and energy efficient HetNets that can adapt to traffic demands, a non-convex optimization problem with the power control factor, resource partitioning fraction and number of subchannels for the SE and EE tradeoff is formulated, based on which, an iterative algorithm with low complexity is proposed to achieve the sub-optimal solution. Numerical results confirm the effectiveness of the joint FeICIC and SA scheme in HetNets. Meanwhile, a system design insight on resource allocation for the SE and EE tradeoff is provided.

The concept of witness hiding was proposed by Feige and Shamir as a natural relaxation of zero-knowledge. Prior constructions of witness hiding protocol for general hard distribution on NP language consist of at least three rounds. In this paper we construct a two-round witness hiding protocol for all hard distributions on NP language. Our construction is based on two primitives: point obfuscation and adaptive witness encryption scheme.

Response property is a kind of liveness property. Response property problem is defined as follows: Given two activities α and β, whenever α is executed, is β always executed after that? In this paper, we tackled the problem in terms of Workflow Petri nets (WF-nets for short). Our results are (i) the response property problem for acyclic WF-nets is decidable, (ii) the problem is intractable for acyclic asymmetric choice (AC) WF-nets, and (iii) the problem for acyclic bridge-less well-structured WF-nets is solvable in polynomial time. We illustrated the usefulness of the procedure with an application example.

We present a new action classification method for skeletal sequence data. The proposed method is based on simple nonparametric feature matching without a learning process. We first augment the training dataset to implicitly construct an exponentially increasing number of training sequences, which can be used to improve the generalization power of the proposed action classifier. These augmented training sequences are matched to the test sequence with the relaxed dynamic time warping (DTW) technique. Our relaxed formulation allows the proposed method to work faster and with higher efficiency than the conventional DTW-based method using a non-augmented dataset. Experimental results show that the proposed approach produces effective action classification results for various scales of real datasets.

Most conventional research on target motion analysis (TMA) based on least squares (LS) has focused on performing asymptotically unbiased estimation with inaccurate measurements. However, such research may often yield inaccurate estimation results when only a small set of measurement data is used. In this paper, we propose an accurate TMA method even with a small set of bearing measurements. First, a subset of measurements is selected by a random sample consensus (RANSAC) algorithm. Then, LS is applied to the selected subset to estimate target motion. Finally, to increase accuracy, the target motion estimation is refined through a bias compensation algorithm. Simulated results verify the effectiveness of the proposed method.

We target the estimation of antenna patterns of distributed array antenna (DAA) systems for satellite communications. Measuring DAA patterns is very difficult because of the large antenna separations involved, more than several tens of wavelengths. Our goal is to elucidate the accuracy of the DAA pattern estimation method whose inputs are actual antenna pattern data and array factors by evaluating their similarity to actually measured DAA radiation patterns. Experiments on two Ku band parabolic antennas show that their patterns can be accurately estimated even if we change the conditions such as frequency, antenna arrangement and polarization. Evaluations reveal that the method has high estimation accuracy since its errors are better than 1dB. We conclude the method is useful for the accurate estimation of DAA patterns.

Geosocial networking allows users to interact with respect to their current locations, which enables a group of users to determine where to meet. This calls for techniques that support processing of Multiple-user Location-based Keyword (MULK) queries, which return a set of Point-of-Interests (POIs) that are 'close' to the locations of the users in a group and can provide them with potential options at the lowest expense (e.g., minimizing travel distance). In this paper, we formalize the MULK query and propose a dynamic programming-based algorithm to find the optimal result set. Further, we design two approximation algorithms to improve MULK query processing efficiency. The experimental evaluations show that our solutions are feasible and efficient under various parameter settings.

Heterogeneous Small Cell Network (HSCN) will have wide application given its ability to improve system capacity and hot spot coverage. In order to increase the efficiency of spectrum and energy, a great deal of research has been carried out on radio resource management in HSCN. However, it is a remarkable fact that the user experience in terms of traffic rate demands has been neglected in existing research with excessive concentration on network capacity and energy efficiency. In this paper, we redefined the energy efficiency (EE) and formulate the joint optimization problem of user experience and energy efficiency maximization into a mixed integer non-linear programming (MINLP) problem. After reformulating the optimization problem, the joint subchannel (SC) allocation and power control algorithm is proposed with the help of cluster method and genetic algorithm. Simulation results show that the joint SC allocation and power control algorithm proposed has better performance in terms of user experience and energy consumption than existing algorithms.

In this paper, the problem of lifetime extension of wireless sensor networks (WSNs) with redundant sensor nodes deployed in 3D vegetation-covered fields is modeled, which includes building communication models, network model and energy model. Generally, such a problem cannot be solved by a conventional method directly. Here we propose an Artificial Bee Colony (ABC) based optimal grouping algorithm (ABC-OG) to solve it. The main contribution of the algorithm is to find the optimal number of feasible subsets (FSs) of WSN and assign them to work in rotation. It is verified that reasonably grouping sensors into FSs can average the network energy consumption and prolong the lifetime of the network. In order to further verify the effectiveness of ABC-OG, two other algorithms are included for comparison. The experimental results show that the proposed ABC-OG algorithm provides better optimization performance.

In this paper, we study simultaneous wireless information and power transfer (SWIPT) in two-way relay channels where two users exchange information with each other via a multi-antenna relay node. The signals forwarded by the relay node are also used to supply the power to two users. We formulate a max-min optimization problem aiming to maximize the minimum harvested energy between two users to achieve fairness. We jointly optimize the relay beamforming matrix and allocating powers at the two users subject to the quality of service (QoS) constraints. To be specific, we consider the amplify-and-forward (AF) relay strategy and the time splitting SWIPT strategy. To this end, we propose two different time splitting protocols to enable relay to supply power to two users. To solve the non-convex joint optimization problem, we propose to split the original optimization problem into two subproblems and solving them iteratively to obtain the final solution. It is shown that the first subproblem dealing with the beamforming matrix can be optimally solved by using the technique of relaxed semidefinite programming (SDR), and the second subproblem, which deals with the power allocation, can be solved via linear programming. The performance comparison of two schemes as well as the one-way relaying scheme are provided and the effectiveness of the proposed schemes is verified.