This paper describes numerical analyses of the distance-dependent gain variation that exists in gain measurements based on the Friis transmission formula for typical broadband antennas, including double-ridged guide horn and log-periodic dipole array antennas. The analyses are performed by simulating gain measurements using the method of moments with higher-order basis functions and the finite integration method. In addition, we propose approximate techniques to determine the antenna phase center by exploiting the distance dependence of the gain. Simulation and experimental results show the effectiveness of using the location of the phase center to accurately determine the far-field gain at reduced antenna separation distances.

Information-centric networking (ICN) is a promising architecture and has attracted much attention in the area of future Internet architectures. As one of the key technologies in ICN, in-network caching can enhance content retrieval at a global scale without requiring any special infrastructure. In this paper, we propose a workload-aware caching policy, LRU-GT, which allows cache nodes to protect newly cached contents for a period of time (guard time) during which contents are protected from being replaced. LRU-GT can utilize the temporal locality and distinguish contents of different popularity, which are both the characteristics of the workload. Cache replacement is modeled as a semi-Markov process under the Independent Reference Model (IRM) assumption and a theoretical analysis proves that popular contents have longer sojourn time in the cache compared with unpopular ones in LRU-GT and the value of guard time can affect the cache hit ratio. We also propose a dynamic guard time adjustment algorithm to optimize the performance. Simulation results show that LRU-GT can reduce the average hops to get contents and improve cache hit ratio.

Oblivious RAM (ORAM) schemes, the concept introduced by Goldreich and Ostrovsky, are very useful technique for protecting users' privacy when storing data in remote untrusted servers and running software on untrusted systems. However they are usually considered impractical due to their huge overhead. In order to reduce overhead, many improvements have been presented. Thanks to these improvements, ORAM schemes can be considered practical on cloud environment where users can expect huge storage and high computational power. Especially for private information retrieval (PIR), some literatures demonstrated they are usable. Also dedicated PIRs have been proposed and shown that they are usable in practice. Yet, they are still impractical for protecting software running on untrusted systems. We first survey recent researches on ORAM and PIR. Then, we present a practical software-based memory protection scheme applicable to several environments. The main feature of our scheme is that it records the history of accesses and uses the history to hide the access pattern. We also address implementing issues of ORAM and propose practical solutions for these issues.

The goal of dimension reduction is to represent high-dimensional data in a lower-dimensional subspace, while intrinsic properties of the original data are kept as much as possible. An important challenge in unsupervised dimension reduction is the choice of tuning parameters, because no supervised information is available and thus parameter selection tends to be subjective and heuristic. In this paper, we propose an information-theoretic approach to unsupervised dimension reduction that allows objective tuning parameter selection. We employ quadratic mutual information (QMI) as our information measure, which is known to be less sensitive to outliers than ordinary mutual information, and QMI is estimated analytically by a least-squares method in a computationally efficient way. Then, we provide an eigenvector-based efficient implementation for performing unsupervised dimension reduction based on the QMI estimator. The usefulness of the proposed method is demonstrated through experiments.

Cloud computing, a novel distributed paradigm to provide powerful computing capabilities, is usually adopted by developers and researchers to execute complicated IoT applications such as complex workflows. In this scenario, it is fundamentally important to make an effective and efficient workflow application scheduling and execution by fully utilizing the advantages of the cloud (as virtualization and elastic services). However, in the current stage, there is relatively few research for workflow scheduling in cloud environment, where they usually just bring the traditional methods directly into cloud. Without considering the features of cloud, it may raise two kinds of problems: (1) The traditional methods mainly focus on static resource provision, which will cause the waste of resources; (2) They usually ignore the performance fluctuation of virtual machines on the physical machines, therefore it will lead to the estimation error of task execution time. To address these problems, a novel mechanism which can estimate the probability distribution of subtask execution time based on background VM load series over physical machines is proposed. An elastic performance fluctuations-aware stochastic scheduling algorithm is introduced in this paper. The experiments show that our proposed algorithm can outperform the existing algorithms in several metrics and can relieve the influence of performance fluctuations brought by the dynamic nature of cloud.

We proposed a through-hole based transformer between microstrip line and post-wall waveguide (PWW). The transformer is based on a through-hole which is electrically separated from top and bottom broad walls of a waveguide by ring-shaped spaces. The proposed transformer shows a considerable merit compared with a conventional one based on blind-via in terms of fabrication and cost because it can be realized by through-holes in general printed-circuit-board technology. We selected liquid crystal polymer (LCP) as the material of substrates because of its lower dielectric loss and easy fabrication. The transformer was fabricated and measured. The loss associated with the mode conversion is estimated to be around 0.32,dB, and the bandwidth for a reflection smaller than $-15$,dB is 8,GHz, i.e., from 59 to 67,GHz.

This paper presents a graph-based approach to designing arithmetic circuits over Galois fields (GFs) using normal basis representations. The proposed method is based on a graph-based circuit description called Galois-field Arithmetic Circuit Graph (GF-ACG). First, we extend GF-ACG representation to describe GFs defined by normal basis in addition to polynomial basis. We then apply the extended design method to Massey-Omura parallel multipliers which are well known as typical multipliers based on normal basis. We present the formal description of the multipliers in a hierarchical manner and show that the verification time can be greatly reduced in comparison with those of the conventional techniques. In addition, we design GF exponentiation circuits consisting of the Massey-Omura parallel multipliers and an inversion circuit over composite field GF(((22)2)2) in order to demonstrate the advantages of normal-basis circuits over polynomial-basis ones.

We design a full-order observer for discrete-time linear time-invariant systems with constant output delays. The observer design is based on the output delay model expressed by a two-dimensional state variable, with discrete-time and space independent variables. Employing a discrete-time state transformation, we construct an explicit strict Lyapunov function that enables us to prove the global exponential stability of the full-order observer error system with an explicit estimate of the exponential decay rate. The numerical example demonstrates the design of the full-order observer and illustrates the validity of the exponential stability.

Differential games are considered an extension of optimal control problems, which are used to formulate centralized control problems in smart grids. Optimal control theory is used to study systems consisting of one agent with one objective, whereas differential games are used to formulate systems consisting of multiple agents with multiple objectives. Therefore, a differential-game-theoretic approach is appropriate for formulating decentralized demand-side energy management systems where there are multiple decision-making entities interacting with each other. Moreover, in many smart grid applications, we need to obtain information for control via communication systems. To formulate the influence of communication availability, differential game theory is also promising because the availability of communication is considered as part of an information structure (i.e., feedback or open-loop) in differential games. The feedback information structure is adopted when information for control can be obtained, whereas the open-loop information structure is applied when the information cannot be obtained because of communication failure. This paper proposes a comprehensive framework for evaluating the performance of demand-side actors in a demand-side management system using each control scheme according to both communication availability and sampling frequency. Numerical analysis shows that the proposed comprehensive framework allows for an analysis of trade-off for decentralized and centralized control schemes.

We propose a new algorithm to suppress both stationary background noise and nonstationary directional interference noise in a speech enhancement system that employs the generalized sidelobe canceller. Our approach builds on advances in generalized sidelobe canceller design involving the transfer function ratio. Our system is composed of three stages. The first stage estimates the transfer function ratio on the acoustic path, from the nonstationary directional interference noise source to the microphones, and the powers of the stationary background noise components. Secondly, the estimated powers of the stationary background noise components are used to execute spectral subtraction with respect to input signals. Finally, the estimated transfer function ratio is used for speech enhancement on the primary channel, and an adaptive filter reduces the residual correlated noise components of the signal. These algorithmic improvements give consistently better performance than the transfer function generalized sidelobe canceller when input signal-to-noise ratio is 10 dB or lower.

In non-destructive testing (NDT), ultrasonic echo is often an overlapping multi-echo signals with noise. However, the accurate estimation of ultrasonic time-of-flight (TOF) is essential in NDT. In this letter, a novel method for TOF estimation through envelope is proposed. Firstly, the wavelet denoising technique is applied to the noisy echo to improve the estimation accuracy. Then, the Hilbert transform (HT) is used in ultrasonic signal processing in order to extract the envelope of the echo. Finally, the TOF of each component of multi-echo signals is estimated by the local maximum point of signal envelope. Furthermore, the time resolution of time-overlapping ultrasonic echoes is discussed. Numerical simulation has been carried out to show the performances of the proposed method in estimating TOF of ultrasonic signal.

This letter describe target classification from the synthesized active sonar returns from targets. A fractional Fourier transform is applied to the sonar returns to extract shape variation in the fractional Fourier domain depending on the highlight points and aspects of the target. With the proposed features, four different targets are classified using two neural network classifiers.

This paper proposes a sound source orientation estimation method that is suitable for a distributed microphone arrangement. The proposed method is based on orientation-extended beamforming (OEBF), which has four features: (a) robustness against reverberations, (b) robustness against noises, (c) free arrangements of microphones and (d) feasibility for real-time processing. In terms of (a) and (c), since OEBF is based on a general propagation model using transfer functions (TFs) that include all propagation phenomena such as reflections and diffractions, OEBF causes no model errors for the propagation phenomena, and is applicable to arbitrary microphone arrangements. Regarding (b), OEBF overcomes noise effects by incorporating three additional processes (Amplitude extraction, time-frequency mask and histogram integration) that are also proposed in this paper. As for (d), OEBF is executable in real-time basis as the execution process is the same as usual beamforming processes. A numerical experiment was performed to confirm the theoretical validity of OEBF. The results showed that OEBF was able to estimate sound source positions and orientations very precisely. Practical experiments were carried out using a 96-channel microphone array in real environments. The results indicated that OEBF worked properly even under reverberant and noisy environments and the averaged estimation error was given only 4°.

Local descriptors, Local Binary Pattern (LBP) and Scale Invariant Feature Transform (SIFT) are widely used in various computer applications. They emphasize different aspects of image contents. In this letter, we propose to combine them in sparse coding for categorizing scene images. First, we regularly extract LBP and SIFT features from training images. Then, corresponding to each feature, a visual word codebook is constructed. The obtained LBP and SIFT codebooks are used to create a two-dimensional table, in which each entry corresponds to an LBP visual word and a SIFT visual word. Given an input image, LBP and SIFT features extracted from the same positions of this image are encoded together based on sparse coding. After that, spatial max pooling is adopted to determine the image representation. Obtained image representations are converted into one-dimensional features and classified by utilizing SVM classifiers. Finally, we conduct extensive experiments on datasets of Scene Categories 8 and MIT 67 Indoor Scene to evaluate the proposed method. Obtained results demonstrate that combining features in the proposed manner is effective for scene categorization.

Recently the word-based stream ciphers have been the subject of a considerable amount of research. The theory of such stream ciphers requires the study of the complexity of a multisequence. Let S1, S2, . . . , Sm be m N-ary sequences of period T, i.e., a multisequence. The relationship between the joint N-adic complexity and the number of the nonzero columns of the generalized Fourier transform for the N-ary multisequence is determined which generalizes the well-known result about the joint linear complexity and the generalized Fourier transform for a multisequence to the case of the joint N-adic complexity.

Wide area virtualization of wireless transceivers by centrally managed software radio systems is a way to efficiently share the resources for supporting a variety of wireless protocols. In order to enable wide-area virtualization of wireless transceivers, the authors have developed a mechanism to deliver the radio space information which is quantized broadband radio wave information including the radio signals to the transceivers. Delivery mechanism consists of a distribution server which distributes radio space corresponding to the request of the client such as the center frequency and the bandwidth and a client which uses the radio space information. Accumulation of the distribution servers which deliver radio space information simultaneously to a large number of clients will contribute to build an infrastructure for any clients ubiquitously distributed over the globe. In this paper, scale-out architecture of a distribution server is proposed to deliver unlimitedly broadband radio space information to unlimited number of clients. Experimental implementation indicates the architecture to be a scale-out solution, while the number of clients is restricted by the computer resources of the distribution server. The band pass filter processing for individual client in the distribution server consumes the dominant part of the processing power, and the number of CPU cores is the upper limit of clients supportable for the distribution server in the current operating system implementation. The logical increase of the number of CPU cores by hardware multithreading does not contribute to relax this limit. We also discuss the guidance architecture or building server derived from these conclusions.

In a sector of a single cell, due to the fading characteristic of wireless channels, several decode-and-forward relay stations are deployed to form a two-hop relay-assisted multicast system. We propose two schemes for the system, the first scheme combines the use of space-time code and distributed space-time code (DSTC), and the second one combines the use of DSTC and maximum ratio combining. We give an outage probability analysis for both of them. Based on this analysis, we manage to maximize the spectral efficiency under a preset outage probability confinement by finding out the optimal power allocation and relay location strategies. We use genetic algorithms to verify our analysis and numerical results show that the schemes proposed by us significantly outperform the scheme in previous work. We also show the effect of path loss exponent on the optimal strategy.

We analyze the outage probability of the multiuser two-way relay network (TWRN) where the N-th best mobile user (MU) out of M MUs and the base station (BS) exchange messages with the aid of an amplify-and-forward relay. In the analysis, we focus on the practical unbalanced Nakagami-m fading between the MUs-relay link and the relay-BS link. We also consider both perfect and outdated channel state information (CSI) between the MUs and the relay. We first derive tight closed-form lower bounds on the outage probability. We then derive compact expressions for the asymptotic outage probability to explicitly characterize the network performance in the high signal-to-noise ratio regime. Based on our asymptotic results, we demonstrate that the diversity order is determined by both Nakagami-m fading parameters, M, and N when perfect CSI is available. When outdated CSI is available, the diversity order is determined by Nakagami-m fading parameters only. In addition, we quantify the contributions of M, N, and the outdated CSI to the outage probability via the array gain.

Energy harvesting technology was introduced into wireless sensor networks (WSNs) to solve the problem of the short lifetimes of sensor nodes. The technology gives sensor nodes the ability to convert environmental energy into electricity. Sufficient electrical energy can lengthen the lifetime and improve the quality of service of a WSN. This paper proposes a novel use of mutual information to evaluate data transmission behavior in the energy harvesting WSNs. Data at a sink for a node deteriorates over time until the next periodic transmission from the node is received. In this paper, we suggest an optimized intermittent transmission method for WSNs that harvest energy. Our method overcomes the problem of information deterioration without increasing energy cost. We show that by using spatial correlation between different sensor nodes, our proposed method can mitigate information deterioration significantly at the sink.

A directional array radiator is presented, the aim of which is to enhance the sound of the television in a particular direction and hence provide a volume boost to improve speech intelligibility for the hard of hearing. The sound radiated by the array in other directions is kept low, so as not to increase the reverberant level of sound in the listening room. The array uses 32 loudspeakers, each of which are in phase-shift enclosures to generate hypercardioid directivity, which reduces the radiation from the back of the array. The loudspeakers are arranged in 8 sets of 4 loudspeakers, each set being driven by the same signal and stacked vertically, to improve the directivity in this plane. This creates a 3D beamformer that only needs 8 digital filters to be made superdirective. The performance is assessed by means of simulations and measurements in anechoic and reverberant environments. The results show how the array obtains a high directivity in a reverberant environment.