The multiple-input multiple-output (MIMO) performance of the modulated scattering antenna array (MSAA) is analyzed numerically for the first time in indoor environment based on an approach to hybridization of the Volterra series method and method of moments (MoM) in this letter. Mutual coupling effect between the Modulated scattering element (MSE) and the normal antenna element is also considered in this analysis. It is found that MIMO performance of the MSAA is improved with reducing the array spacing of the MSAA in 4 different indoor receiving areas. At the same time, the simulated results of the MSAA are compared with those of the dipole antenna array at the same condition.

Ubiquitous computing and communication are the key technology for achieving economic growth, sustainable development, safe and secure community towards a ubiquitous network society. Although the technology alone cannot solve the emerging problems, it is important to deploy services everywhere and reach real people with sensor enabled smart phones or devices. Using these devices and wireless sensor networks, we have been creating various types of ubiquitous services which support our everyday life. In this paper, we describe ubiquitous services based on a HOT-SPA model and discuss challenges in creating new ubiquitous services with smart enablers such as smart phones, wireless sensor nodes, social media, and cloud services. We first classify various types of ubiquitous service and introduce the HOT-SPA model which is aimed at modeling ubiquitous services. Several ubiquitous services, such as DIY smart object services, Twitthings, Airy Notes, and SensingCloud, are described. We then address the challenges in creating advanced ubiquitous services by enhancing coupling between a cyber and a physical space.

In this letter, we propose a Partially Observable Markov Decision Process (POMDP) based Distributed Adaptive Opportunistic Spectrum Access (DA-OSA) Strategy for Cognitive Ad Hoc Networks (CAHNs). In each slot, the source and destination choose a set of channels to sense and then decide the transmission channels based on the sensing results. In order to maximize the throughput for each link, we use the theories of sequential decision and optimal stopping to determine the optimal sensing channel set. Moreover, we also establish the myopic policy and exploit the monotonicity of the reward function that we use, which can be used to reduce the complexity of the sequential decision.

This paper describes a new technique for the design of 3-terminal regulators in which the output voltage level can be adjusted without additional terminals or extra off-chip components. This circuit restricts the increase in the number of terminal pins by using a pin as both a voltage supply output and a voltage setup input. The voltage setup information is introduced using a serial control signal from outside the chip. Using the intermediate voltage level between the supply voltage and the regulator output, the adjustment data in the internal nonvolatile memory are safely updated without noise disturbance. To input the setup information into the chip in a stable manner, we developed a new 1-wire serial interface which combines key pattern matching and burst signal detection. To ensure high reliability, we suggested a quantitative method for evaluating the influence of noise in our new interface using a simple model with superimposed random noise. Circuits additional to those for a conventional 3-terminal regulator, include a 1-wire serial communication circuit, a low-capacity non-volatile memory, and a digital to analog (D/A) converter. A test chip was developed using 0.35 µm standard CMOS process, and there was almost no overhead to the conventional 3-terminal regulator in both chip area and power dissipation. In an on-board test with the test chip, we confirmed successful output voltage adjustment from 1.0 V to 2.7 V with approximately 6.5 mV precision.

Recent Location Based Services (LBS) extend not only information services such as car navigation services, but supporting various applications such as augmented reality and emergency services in ubiquitous computing environments. However location based services in the ubiquitous computing environment bring several security issues such as location privacy and forgery. While the privacy of the location based service is considered as the important security issue, security against location forgery is less considered. In this paper, we propose improved Han et al.'s protocol [1] that provides more lightweight computation. Our proposed model also improves the credibility of LBS by deploying multiple location sensing technologies.

Video applications such as video conferencing among multiple users and video surveillance systems require multiple video connections and QoS guarantee. These days the video systems equipped with IEEE 802.11 LAN interfaces allows a broadband wireless access to the Internet at a reasonable price. However, according to the current IEEE 802.11e HCCA standard, if more than two video sessions are to be established simultaneously, some of them must share the TXOP because the available number of TSIDs for video transmission is restricted to two. In order to resolve this problem, we devise a scheme which can establish up to 13 video sessions by slightly modifying the frame structure while maintaining the compatibility with the current standard. Our scheme is implemented on the NCTUns 4.0 network simulator, and evaluated numerically in terms of throughput, delay, and PSNR. Also real video clips are used as input to our simulation. The results showed that our scheme guarantees the transmission bandwidth requested by each video session.

This paper presents a simplifying method of the two previous fault attacks to pairing and the Miller algorithms based on a practical fault assumption. Our experimental result shows that the assumption is feasible and easy to implement.

IP Datacast over DVB-H has been adopted as a core technology to build complete end-to-end mobile broadcast TV systems. In order for this technology to be successful in the market, provisioning of acceptable QoE (Quality of Experience) to the users, as well as a wide range of business models to the service providers, is essential. In this paper, we analyze the channel zapping time, which is an important metric to measure QoE for mobile broadcast TV services. In particular, we clarify primary components that determine the channel zapping time for protected services in IP Datacast over DVB-H. Our analysis is based on the data gathered during the trial service of the OMA-BCAST Smartcard profile in Singapore, Asia. Based on the analysis, we show that a significant reduction in channel zapping time can be achieved by optimizing the transmission parameters related to the key derivation time and the synchronization time between the content stream and the key stream.

In the present paper, a method for extracting user interest by constructing a hierarchy of words from social bookmarking (SBM) tags and emphasizing nouns based on the hierarchical structure (folksonomy) is proposed. Co-occurrence of the SBM tags basically have a semantic relationship. As a result of an experimental evaluation using the user profiles on Twitter, the authors discovered that the SBM tags and their word hierarchy have a rich vocabulary for extracting user interest.

We propose a scheduling method called SCQ (Smoothly Changing Queue) which can control service rate by bulk size of video streaming services such as IPTV and VoD. Since SCQ allows queue length to change smoothly, video streaming services can be stably provided with low jitter. Queueing analysis results show that SCQ can more stably deliver video streaming with low jitter and loss than existing AQMs or queue length-based rate control methods.

Energy conservation is an important issue in mobile ad hoc networks (MANET), where the terminals are always supplied with limited energy. A new routing protocol is presented according to the study on the influence of low-energy nodes in ad hoc networks. The novel routing protocol (energy sensing routing protocol, ESRP) is based on the energy sensing strategy. Multiple strategy routing and substitute routing are both adopted in this paper. Referring to the level of the residual energy and the situation of energy consumption, different routes are chosen for packets transmission. The local maintenance is adopted, which can reduce packets retransmission effectively when the link breaks. We focus on the network lifetime most in all performances. The evaluation is done in comparison with other routing protocols on NS2 platform, and the simulation results show that this routing protocol can prolong the network lifetime and balance energy consumption effectively.

Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.

In this letter, a multiuser cooperative network with multiple relays is introduced, and two decode-and-forward (DF) cooperation schemes are proposed aiming at outage-optimal and fair user scheduling, respectively. The outage probability and asymptotic expressions of symbol error probability (SEP) are derived to evaluate these two schemes. Analysis and simulations show that both schemes can achieve full diversity order, which is the combination of cooperative diversity and multiuser diversity.

In this paper, a soft-error-tolerant BILBO (Built-In Logic Block Observer) FF (flip-flop) is presented. The proposed FF works as a soft-error-tolerant FF in system operations and as a BILBO FF in manufacturing testing. The construction of the proposed FF is based on that of an existing soft-error-tolerant FF, namely a BISER (Built-In Soft Error Resilience) FF. The proposed FF contains a reconfigurable C-element with XNOR calculation capability, which works as a C-element for soft-error-tolerance during system operations and as an XNOR gate employed in linear feedback shift registers (LFSRs) during manufacturing testing. The evaluation results shown in this paper indicate that the area of the proposed FF is 8.5% smaller than that of a simple combination of the existing BISER and BILBO FFs. In addition, the sum of CLK-Q delay and D-CLK setup times on system operations for the proposed FF is 19.7% shorter than that for the combination.

This paper proposes a novel blind multiuser detection scheme using CMA (Constant Modulus Algorithm) adaptive array. In the proposed scheme, the received signal is processed in two steps. In the primary step, only one user is captured by the CMA adaptive array, and at the same time, the other users' directions of arrival (DOA) are estimated. In the secondary step, initial weight vectors are set based on the estimated DOAs, and it processes with CMAs again to capture the other users in parallel. Thus, all the users are detected exactly and recovered separately. The Least-squares CMA is applied as an optimization algorithm to improve the performance of the proposed scheme, and the performances using the proposed scheme with linear arrays and circular arrays are discussed in detail. Simulation results are presented to verify the performance of the proposed scheme.

In order to realize multi-service in TDS-OFDM system, a novel multiplexing scheme based on space time block code is proposed along with the corresponding demultiplexing method with low complexity. Simulations show the presented scheme can not only achieve full diversity gain, but also effectively improve the system capacity.

In this letter, we propose an efficient signal detection method for uplink multiuser systems based on collaborative spatial multiplexing (CSM). The proposed method achieves near-optimal performance and shows only 0.8 dB loss at the target frame error rate (FER) of 10-2. Moreover, the error performance of each user is almost the same in the proposed method, which is an important property in a multiuser MIMO system where each user's error performance must satisfy some fixed error rate criteria.

Previous research illustrates that LRU replacement policy is not efficient when applications exhibit a distant re-reference interval. Recently RRIP policy is proposed to improve the performance for such kind of workloads. However, the lack of access recency information in RRIP confuses the replacement policy to make the accurate prediction. To enhance the robustness of RRIP for recency-friendly workloads, we propose an Dynamic Adaptive Insertion and Re-reference Prediction (DAI-RRP) policy which evicts data based on both re-reference prediction value and the access recency information. DAI-RRP makes adaptive adjustment on insertion position and prediction value for different access patterns, which makes the policy robust across different workloads and different phases. Simulation results show that DAI-RRP outperforms LRU and RRIP. For a single-core processor with a 1 MB 16-way set last-level cache (LLC), DAI-RRP reduces CPI over LRU and Dynamic RRIP by an average of 8.1% and 2.7% respectively. Evaluations on quad-core CMP with a 4 MB shared LLC show that DAI-RRP outperforms LRU and Dynamic RRIP (DRRIP) on the weighted speedup metric by an average of 8.1% and 15.7% respectively. Furthermore, compared to LRU, DAI-RRP consumes the similar hardware for 16-way cache, or even less hardware for high-associativity cache. In summary, the proposed policy is practical and can be easily integrated into existing hardware approximations of LRU.

Every time-series has its own linear trend, the directionality of a time-series, and removing the linear trend is crucial to get more intuitive matching results. Supporting the linear detrending in subsequence matching is a challenging problem due to the huge number of all possible subsequences. In this paper we define this problem as the linear detrending subsequence matching and propose its efficient index-based solution. To this end, we first present a notion of LD-windows (LD means linear detrending). Using the LD-windows we then present a lower bounding theorem for the index-based matching solution and show its correctness. We next propose the index building and subsequence matching algorithms. We finally show the superiority of the index-based solution.

Multi-site MIMO (Multiple Input Multiple Output) is a key technology that will enable next generation cellular networks to achieve high throughput in cell edge areas. However, a multi-site single-user MIMO system is subject to performance degradation in terms of cell throughput due to the expense of additional assignments of radio resources to cell edge user equipment. This paper presents a BS-cooperation scheduling scheme for a multi-site single-user MIMO cellular system. The proposed BS-cooperation scheduling scheme aims to maintain cell throughput while improving cell edge user throughput. The proposed scheme employs two policies with respect to the assignment of radio resource to the user equipment with multi-site connection. One is to control the opportunities for radio resource assignment to user equipment with a multi-site connection to avoid the excessive assignment of radio resources and to maintain cell throughput. The other policy governs the decision as to whether the user equipment operates with a multi-site connection or not, making it possible for the multi-site connection to contribute to the improvement in user throughput in the cell edge areas. The simulation results show that the proposed scheme is effective from the perspective of both cell throughput and cell edge user throughput.