A leakage-aware Coordinated Scheduling/Coordinated Beamforming (CS/CB) scheme for heterogeneous networks with layered limited feedback is proposed. In particular, all pico cells cooperatively select an optimal beamforming vector for the macro cell within a CoMP cluster so as to minimizing leakage power from the macro cell. Simulations show that the proposed scheme outperforms the conventional non-CoMP scheme with perfect channel state information at teansmitter (CSIT). Furthermore, the feedback amount and scheduler complexity is decreased greatly.

We study the security of AES in the open-key setting by showing an analysis on hash function modes instantiating AES including Davies-Meyer, Matyas-Meyer-Oseas, and Miyaguchi-Preneel modes. In particular, we propose preimage attacks on these constructions, while most of previous work focused their attention on collision attacks or distinguishers using non-ideal differential properties. This research is based on the motivation that we should evaluate classical and important security notions for hash functions and avoid complicated attack models that seem to have little relevance in practice. We apply a recently developed meet-in-the-middle preimage approach. As a result, we obtain a preimage attack on 7 rounds of Davies-Meyer AES and a second preimage attack on 7 rounds of Matyas-Meyer-Oseas and Miyaguchi-Preneel AES. Considering that the previous best collision attack only can work up to 6 rounds, the number of attacked rounds reaches the best in terms of the classical security notions. In our attacks, the key is regarded as a known constant, and the attacks thus can work for any key length in common.

We propose the asynchronous receiver-initiated MAC protocol with the stair-like sleep mode; each node reduces its own sleep time by the sleep-change-rate depending on the number of hops from the source to the sink in wireless sensor networks (WSNs). Using the stair-like sleep approach, our protocol achieves high delivery ratio, low packet delay, and high energy efficiency due to the reduction in idle listening time. Our protocol can formulate the upper bound of the idle listening time because of the feature that the sleep time decreases in a geometric progression, and the reduction of the idle listening time is obtained by using the stair-like sleep approach. In our proposed scheme, the sink calculates the sleep change rate based on the number of hops from the source to the sink. By using the control packets which have the role of the acknowledgment (ACK), our proposed protocol can achieve the stair-like sleep with no additional control packets. In addition, even in the network condition that multi-targets are detected, and the number of hops to the sink are changed frequently, our proposed protocol can change the sleep change rate adaptively because the sink can always obtain the number of hops from the source to the sink. Simulation results show that the proposed protocol can improve the performance in terms of the packet delivery ratio, the packet delay, and the energy efficiency compared to the conventional receiver-initiated MAC (RI-MAC) protocol.

We present a novel point of interest (POI) construction approach based on street-level imagery (SLI) such as Google StreetView. Our method consists of: (1) the creation of a conflation map between an SLI trace and a vector map; (2) the detection of the corresponding buildings between the SLI scene and the conflation map; and (3) POI name extraction from a signboard in the SLI scene by user-interactive text recognition. Finally, a POI is generated through a combination of the POI name and attributes of the building object on a vector map. The proposed method showed recall of 92.99% and precision of 97.10% for real-world POIs.

IP fast rerouting has widely been studied for realizing millisecond-order recovery on pure IP networks. This paper proposes IP fast rerouting using backup topologies against concurrent double failures. The main issue in recovering from multiple failures is avoiding forwarding loops. To avoid forwarding loops, we propose a deterministic forwarding algorithm, which estimates the concurrently occurring failures from the packet header information. We also propose an efficient backup topology design algorithm which is both loop-free and which reduces the number of backup topologies. Our key idea is preparing the adequate diversity of backup routes for arbitrary source and destination pairs by combination of backup topologies. For efficient computation of diverse routes, we propose a similarity comparison-based algorithm between the original topology and the backup topologies. Our algorithm can achieve nearly optimal loop-free restoration from double failures on realistic topologies without explicit failure notification.

To clarify the characteristics of high-speed electrostatic discharge (ESD) events, we use two kinds of discharge electrodes: sphere- and cylinder-shape ones. We measure the energy level of ESD waveforms with charging voltages of 0.25, 0.5, and 1.0 kV. We find that the cylindrical electrode yields higher high-speed ESD energies, especially when the charging voltage is high; this indicates that the discharge gap shape is an important factor in ESD events.

Reed-Solomon (RS) codes are widely used in digital communication and storage systems. Unlike usual VLSI approaches, this paper presents a high throughput fully programmable Reed-Solomon decoder on a multi-core processor. The multi-core processor platform is a 2-Dimension mesh array of Single Instruction Multiple Data (SIMD) cores, and it is well suited for digital communication applications. By fully extracting the parallelizable operations of the RS decoding process, we propose multiple optimization techniques to improve system throughput, including: task level parallelism on different cores, data level parallelism on each SIMD core, minimizing memory access, and route length minimized task mapping techniques. For RS(255, 239, 8), experimental results show that our 12-core implementation achieve a throughput of 4.35 Gbps, which is much better than several other published implementations. From the results, it is predictable that the throughput is linear with the number of cores by our approach.

This paper introduces new FPGA design of user-monitoring system for power management of PC display. From the camera readings the system detects whether the user looks at the screen or not and produces signals to control the display backlight. The system provides over 88% eye detection accuracy at 8f/s image processing rate. We describe new eye-tracking algorithm and hardware and present the results of its experimental evaluation in prototype display power management system.

A novel and compact electro-optic modulator implemented by a combination of a 12 multimode interference (MMI) coupler and an integrated Mach-Zehnder interferometer (MZI) modulator consisting of a microring and a phase modulator (PM) is presented and analyzed theoretically. It is shown that the proposed modulator offers both ultra-linearity and high output RF gain simultaneously, with no requirements for complicated and precise direct current (DC) control.

In content services where people purchase and download large-volume contents, minimizing network traffic is crucial for the service provider and the network operator since they want to lower the cost charged for bandwidth and the cost for network infrastructure, respectively. Traffic localization is an effective way of reducing network traffic. Network traffic is localized when a client can obtain the requested content files from other a near-by altruistic client instead of the source servers. The concept of the peer-assisted content distribution network (CDN) can reduce the overall traffic with this mechanism and enable service providers to minimize traffic without deploying or borrowing distributed storage. To localize traffic effectively, content files that are likely to be requested by many clients should be cached locally. This paper presents a novel traffic engineering scheme for peer-assisted CDN models. Its key idea is to control the behavior of clients by using content-oriented incentive mechanism. This approach enables us to optimize traffic flows by letting altruistic clients download content files that are most likely contributed to localizing traffic among clients. In order to let altruistic clients request the desired files, we combine content files while keeping the price equal to the one for a single content. This paper presents a solution for optimizing the selection of content files to be combined so that cross traffic in a network is minimized. We also give a model for analyzing the upper-bound performance and the numerical results.

A high-speed low-complexity time-multiplexing Reed-Solomon-based forward error correction architecture based on the pipelined truncated inversionless Berlekamp-Massey algorithm is presented in this paper. The proposed architecture has very high speed and very low hardware complexity compared with conventional Reed-Solomon-based forward error correction architectures. Hardware complexity is improved by employing a truncated inverse Berlekamp-Massey algorithm. A high-speed and high-throughput data rate is facilitated by employing a three-parallel processing pipelining technique and modified syndrome computation block. The time-multiplexing method for pipelined truncated inversionless Berlekamp-Massey architecture is used in the parallel Reed-Solomon decoder to reduce hardware complexity. The proposed architecture has been designed and implemented with 90-nm CMOS technology. Synthesis results show that the proposed 16-channel Reed-Solomon-based forward error correction architecture requires 417,600 gates and can operate at 640 MHz to achieve a throughput of 240 Gb/s. The proposed architecture can be readily applied to Reed-Solomon-based forward error correction devices for next-generation short-reach optical communications.

In this paper, we propose a novel incremental method for discovering latent variables from multivariate data with high efficiency. It integrates non-Gaussianity and an adaptive incremental model in an unsupervised way to extract informative features. Our proposed method discovers a small number of compact features from a very large number of features and can still achieve good predictive performance in EEG signals. The promising EEG signal classification results from our experiments prove that this approach can successfully extract important features. Our proposed method also has low memory requirements and computational costs.

We propose three operation modes, namely, DCF uplink, Downlink, and CTS uplink modes to solve the unfairness problem between uplink and downlink as well as improve the performance of delay and throughput. The proposed scheme only requires modifying AP's functionalities without any changes of STAs, and is fully backward compatible to the legacy DCF. Its analytical result is validated against simulation and performance evaluation shows the proposed scheme is superior to the traditional IEEE 802.11 WLAN.

In this letter, we consider a control problem of a chain of integrators where there is an uncertain delay in the input and sensor noise. This is an output feedback control result over [10] in which a state feedback control is suggested. The several generalized features are: i) output feedback control is developed instead of full state feedback control, ii) uncertain delay in the input is allowed, iii) all states are derived to be arbitrarily small under uncertain sensor noise.

This paper proposes a bit-split string matcher architecture for a memory-efficient hardware-based parallel pattern matching engine. In the proposed bit-split string matcher, multiple finite-state machine (FSM) tiles share match vectors to reduce the required number of stored match vectors. By decreasing the memory size for storing match vectors, the total memory requirement can be minimized.

In this paper, we examine a new P2P traffic localization approach that exploits peer selection adaptation (i.e., preferring peers who are likely to provide better performance), called Netpherd. Netpherd enables peers to communicate with local domain peers by manipulating networking performance across network domains (i.e., adding an artificial delay to inter-domain traffic). Our feasibility study shows that Netpherd reduces the inter-domain traffic by influencing peer selection adaptation. Netpherd also improves download performance of the peers who know many local domain peers. We discuss one guideline to improve Netpherd based on the feasibility study and verify the guideline with evaluation results.

In recent years, there has been an increasing demand with regard to available elemental services provided by independent firms for compositing new services. Currently, however, whenever it is difficult to maintain the required level of quality of a new composite web service, assignment of the new computer's resources as provisioning at the data center is not always effective, especially in the area of performance for composite web service providers. Thus, a new approach might be required. This paper presents a new control method aiming to maintain the performance requirements for composite web services. There are three aspects of our method that are applied: first of all, the theory of constraints (TOC) proposed by E.M. Goldratt ; secondly, an evaluation process in the non-linear feed forward controlling method: and finally multiple trials in applying policies with verification. In particular, we will discuss the architectural and theoretical aspects of the method in detail, and will show the insufficiency of combining the feedback controlling approach with TOC as a result of our evaluation.

Scalable video coding with different modulation and coding schemes (MCSs) applied to different video layers is very appropriate for wireless multicast services because it can provide different video quality to different users according to their channel conditions, and a promising solution to handle packet losses induced by fading wireless channels is the use of layered hybrid FEC/ARQ scheme according to light-weight feedback messages from users about how many packets they have received. It is important to choose an appropriate MCS for each layer, decide how many parity packets in one layer should be transmitted, and determine the resources allocated to multiple video sessions to apply scalable video coding to wireless multicast streaming. We prove that such resource allocation problem is NP-hard and propose an approximate optimal algorithm with a polynomial run time. The algorithm can get the optimal transmission configuration to maximize the expected utility for all users where the utility can be a generic non-negative, non-decreasing function of the received rate. The results from simulations revealed that our algorithm offer significant improvements to video quality over a nave algorithm, an optimal algorithm without feedback from users, and an algorithm with feedback from designated users, especially in scenarios with multiple video sessions and limited radio resources.

In this letter, we derive a lower bound on the diversity multiplexing tradeoff (DMT) in multiple-input multiple-output (MIMO) nonorthogonal amplify-and-forward (NAF) cooperative channels with resolution-constrained channel state feedback. It is shown that power control based on the feedback improves the DMT performance significantly in contrast to the no-feedback case. For instance, the maximum diversity increase is exponential in K with K-level feedback.

We observe that the state-of-the-art power-saving mechanisms (PSM) for IEEE 802.16e is neither optimal in terms of delay nor in terms of energy consumption. We propose a new PSM which achieves the optimality in terms of the average buffering delay without increasing energy consumption. In order to do so, we derive a formula which relates the average buffering delay to sleep intervals. Simulation results show that our scheme surpasses the BTE algorithm (used by the current IEEE 802.16e Mobile Stations) by 56.75–76% and the PSID algorithm by 8.52–24.39% in terms of the delay-energy consumption product.