Presentation slide composition is an important job for knowledge workers. Instead of starting from scratch, users tend to make new presentation slides by reusing existing ones. A primary challenge in slide reuse is to select desired materials from a collection of existing slides. The state-of-the-art solution utilizes texts and images in slides as well as file names to help users to retrieve the materials they want. However, it only allows users to choose an entire slide as a query but does not support the search for a single element such as a few keywords, a sentence, an image, or a diagram. In this paper, we investigate content-based search for a variety of elements in presentation slides. Users may freely choose a slide element as a query. We propose different query processing methods to deal with various types of queries and improve the search efficiency. A system with a user-friendly interface is designed, based on which experiments are performed to evaluate the effectiveness and the efficiency of the proposed methods.

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 recent development of communication devices and wireless network technologies continues to advance the new era of the Internet and telecommunications. The various “things”, which include not only communication devices but also every other physical object on the planet, are also going to be connected to the Internet, and controlled through wireless networks. This concept, which is referred to as the “Internet of Things (IoT)”, has attracted much attention from many researchers in recent years. The concept of IoT can be associated with multiple research areas such as body area networks, Device-to-Device (D2D) communications networks, home area networks, Unmanned Aerial Vehicle (UAV) networks, satellite networks, and so forth. Also, there are various kinds of applications created by using IoT technologies. Thus, the concept of the IoT is expected to be integrated into our society and support our daily life in the near future. In this paper, we introduce different classifications of IoT with examples of utilizing IoT technologies. In addition, as an example of a practical system using IoT, a tsunami detection system (which is composed of a satellite, sensor terminals, and an active monitoring system for real-time simultaneous utilization of the devices) is introduced. Furthermore, the requirements of the next generation systems with the IoT are delineated in the paper.

As the development of Internet-of-Things is moving towards large scale industry, such as logistic and manifacturing, there is a need for end-users to get involved in the process of creating IoT easily. In this paper, we introduce PaperIO, a paper-based 3D I/O interface, in which a single piece of paper can be sensed and actuated at the same time in three dimensions using the technology of selective inductive power transmission. With this technology, paper material with multiple embedded receivers, can not only selectively receive inductive power to perform paper-computing behavior, but also work as input sensors to communicate with power transmitter wirelessly. This technology allows the creation of paper-based sensor and actuators, and forms an Interent of Embedded Paper-craft. This paper presents the detailed implementation of the system, results of the technical experiments, and a few sample applications of the presented paper-based 3D I/O interface, and finally discusses the future plan of this research.

Understanding the structure and evolution of spatial-temporal networks is crucial for different fields ranging from urbanism to epidemiology. As location based technologies are pervasively used in our daily life, large amount of sensing data has brought the opportunities to study human activities and city dynamics. Ubiquitous cell phones can be such a sensor to analyze the social connection and boundaries of geographical regions. In this paper, we exploit user mobility based on large-scale mobile phone records to study urban areas. We collect the call data records from 1 million anonymous subscribers of 8 weeks and study the user mobility flux between different regions. First we construct the urban areas as a spatial network and use modularity detection algorithm to study the intrinsic connection between map areas. Second, another generative model which is widely used in linguistic context is adopted to explore the functions of regions. Based on mobile call records we are able to derive the partitions which match boundaries of the administrative districts. Our results can also catch the dynamics of urban area as the basis for city planning and policy making.

As new systems and applications are introduced for next-generation wireless systems, the propagation channels in which they operate need to be characterized. This paper discusses propagation channels for four types of next-generation systems: (i) distributed Multiple-Input Multiple-Output (MIMO) and Cooperative MultiPoint (CoMP) systems, which require the characterization of correlation between channels from a mobile station to different base stations or access points; (ii) device-to-device communications, where propagation channels are characterized by strong mobility at both link ends (e.g., in vehicle-to-vehicle communications), and/or significant impact of moving shadowing objects; (iii) full-dimensional MIMO, where antenna arrays extend in both the horizontal and vertical dimension, so that azimuthal and elevation dispersion characteristics of the channel become relevant, and (iv) millimeter wave Wireless Local Area Network (WLAN) and cellular communication systems, where the high carrier frequency leads to a change (compared to microwave communications) concerning which propagation processes are dominant. For each of these areas, we give an overview of measurements and models for key channel properties. A discussion of open issues and possible future research avenues is also provided.

More recently, there has been a growing interest in the study of wireless sensor network (WSN) technologies for Interest of Things (IoT). To improve the positioning accuracy of mobile station under the non-line-of-sight (NLOS) environment, a localization algorithm based on the single-hidden layer feedforward network (SLFN) using extreme learning machine (ELM) for WSN is proposed in this paper. Optimal reduction in the time difference of arrival (TDOA) measurement error is achieved using SLFN optimized by ELM. Compared with those traditional learning algorithms, ELM has its unique feature of a higher generalization capability at a much faster learning speed. After utilizing the ELM by randomly assigning the parameters of hidden nodes in the SLFN, the competitive performance can be obtained on the optimization task for TDOA measurement error. Then, based on that result, Taylor algorithm is implemented to deal with the position problem of mobile station. Experimental results show that the effect of NLOS propagation is reduced based on our proposed algorithm by introducing the ELM into Taylor algorithm. Moreover, in the simulation, the proposed approach, called Taylor-ELM, provides better performance compared with some traditional algorithms, such as least squares, Taylor, backpropagation neural network based Taylor, and Chan positioning methods.

In this paper, we propose a texture descriptor based on amplitude distribution and phase distribution of the discrete Fourier transform (DFT) of an image. One dimensional DFT is applied to all the rows and columns of an image. Histograms of the amplitudes and gradients of the phases between adjacent rows/columns are computed as the feature descriptor, which is called aggregated DFT (ADFT). ADFT can be easily combined with completed local binary pattern (CLBP). The combined feature captures both global and local information of the texture. ADFT is designed for isotropic textures and demonstrated to be effective for roughness classification of castings. Experimental results show that the amplitude part of ADFT is also discriminative in describing anisotropic textures and it can be used as a complementary descriptor of local texture descriptors such as CLBP.

In this letter, we present a new method of alleviating the deterioration in the quality of real-time video service during vertical handover (VHO). The proposed method stochastically delays the starting time of the service disruption of VHO in order to reduce the number of lost frames caused by the inter-frame dependency of multi-layered video traffic. The results show that the proposed method significantly decreases the average frame loss time at the sacrifice of an increased handover execution time by one half of the group of picture (GOP) interval of the video traffic.

This paper proposes low-power voltage-mode/current-mode hybrid circuits to realize an arbitrary two-variable logic function and a full-adder function. The voltage and current mode can be selected for low-power operations at low and high frequency, respectively, according to speed requirement. An nMOS pass transistor network is shared to realize voltage switching and current steering for the voltage- and current-mode operations, respectively, which leads to high utilization of the hardware resources. As a result, when the operating frequency is more than 1.15,GHz, the current mode of the hybrid logic circuit is more power-efficient than the voltage mode. Otherwise, the voltage mode is more power-efficient. The power consumption of the hybrid two-variable logic circuit is lower than that of the conventional two-input look-up table (LUT) using CMOS transmission gates, when the operating frequency is more than 800,MHz. The delay and area of the hybrid two-variable logic circuit are increased by only 7% and 13%, respectively

Gallium nitride high electron mobility transistors (GaN HEMTs) were developed for millimeter-wave high power amplifier applications. The device with a gate length of 80 nm and an InAlN barrier layer exhibited high drain current of more than 1.2 A/mm and high breakdown voltage of 73,V. A cut-off frequency $ extrm{f}_{ extrm{T}}$ of 113,GHz and maximum oscillation frequency $ extrm{f}_{ extrm{max}}$ of 230,GHz were achieved. The output power density reached 1 W/mm with a linear gain of 6.4,dB at load-pull measurements at 90,GHz. And we extracted equivalent circuit model parameters of the millimeter-wave InAlN/GaN HEMT and showed that the model was useful in simulating the millimeter-wave power performance. Also, we report a preliminary constant bias stress test result.

Two types of 3D folded dipole antenna with feed line (FDAFL) were reported for a small terminal, which covered WiMAX 2.5/3.5GHz bands and WLAN 2.4GHz band. In this study, folded monopole antenna (FMA) is proposed as a variant of FDAFL. We show the broadband characteristics of FMA and determine the most suitable configuration of FMA array for realizing MIMO system. Also, a multiband variant is created by introducing a parasitic element to FMA. The result is a multiband FMA array with parasitic elements operating at 5GHz band of WiMAX and WLAN as well as WiMAX 2.5/3.5GHz bands and WLAN 2.4GHz band with total antenna efficiency of between 70% to 96% and the envelope correlation coefficient of less than 0.02. Finally, a prototype antenna is implemented, and we confirm the validity of the simulation by comparison to measured results.

This paper proposes a noise reduction method for impact noise with damped oscillation caused by clinking a glass, hitting a bottle, and so on. The proposed method is based on the zero phase (ZP) signal defined as the IDFT of the spectral amplitude. When the target noise can be modeled as the sum of the impact part and the damped oscillation part, the proposed method can reduce them individually. First, the proposed method estimates the damped oscillation spectra and subtracts them from the observed spectra. Then, the impact part is reduced by replacing several samples of the ZP observed signal. Simulation results show that the proposed method improved 10dB of SNR of real impact noise.

Sound source localization (SSL), with a binaural input in practical environments, is a challenging task due to the effects of noise and reverberation. In psychoacoustic research field, one of the theories to explain the mechanism of human perception in such environments is the well-known equalization-cancellation (EC) model. Motivated by the EC theory, this paper investigates a binaural SSL method by integrating EC procedures into a beamforming technique. The principle idea is that the EC procedures are first utilized to eliminate the sound signal component at each candidate direction respectively; direction of sound source is then determined as the direction at which the residual energy is minimal. The EC procedures applied in the proposed method differ from those in traditional EC models, in which the interference signals in rooms are accounted in E and C operations based on limited prior known information. Experimental results demonstrate that our proposed method outperforms the traditional SSL algorithms in the presence of noise and reverberation simultaneously.

Boneh et al. proposed the new idea of pairing-based cryptography by using the composite order group instead of prime order group. Recently, many cryptographic schemes using pairings of composite order group were proposed. Miller's algorithm is used to compute pairings, and the time of computing the pairings depends on the cost of calculating the Miller loop. As a method of speeding up calculations of the pairings of prime order, the number of iterations of the Miller loop can be reduced by choosing a prime order of low Hamming weight. However, it is difficult to choose a particular composite order that can speed up the pairings of composite order. Kobayashi et al. proposed an efficient algorithm for computing Miller's algorithm by using a window method, called Window Miller's algorithm. We can compute scalar multiplication of points on elliptic curves by using a window hybrid binary-ternary form (w-HBTF). In this paper, we propose a Miller's algorithm that uses w-HBTF to compute Tate pairing efficiently. This algorithm needs a precomputation both of the points on an elliptic curve and rational functions. The proposed algorithm was implemented in Java on a PC and compared with Window Miller's Algorithm in terms of the time and memory needed to make their precomputed tables. We used the supersingular elliptic curve y2=x3+x with embedding degree 2 and a composite order of size of 2048-bit. We denote w as window width. The proposed algorithm with w=6=2·3 was about 12.9% faster than Window Miller's Algorithm with w=2 although the memory size of these algorithms is the same. Moreover, the proposed algorithm with w=162=2·34 was about 12.2% faster than Window Miller's algorithm with w=7.

This note presents a new approach for the robustness of Hurwitz polynomials under coefficient perturbation. The s-domain Hurwitz polynomial is transformed to the z-domain polynomial by the bilinear transformation. Then an approach based on the Rouché theorem introduced in the literature is applied to compute a crude bound for the allowable coefficient variation such that the perturbed polynomial maintains the Hurwitz stability property. Three methods to obtain improved bounds are also suggested. The results of this note are computationally more efficient than the existing direct s-domain approaches especially for polynomials of higher degree. Furthermore examples indicate that the exact bound for the coefficient variation can be obtained in some cases.

In this letter, we combine minimum-shift keying (MSK) with physical-layer network coding (PNC) to form a new scheme, i.e., MSK-PNC, for two-way relay channels (TWRCs). The signal detection of the MSK-PNC scheme is investigated, and two detection methods are proposed. The first one is orthogonal demodulation and mapping (ODM), and the second one is two-state differential detection (TSDD). The error performance of the proposed MSK-PNC scheme is evaluated through simulations.

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.

This paper focuses on the S-parameter method that is a basic method for measuring the input impedance of balanced-fed antennas. The basic concept of the method is summarized using the two-port network, and it is shown that the method can be enhanced to the unbalanced antennas using a formulation based on incident and reflected waves. The compensation method that eliminates the influence of a measurement jig and the application of the S-parameter method for the measurement of a radiation pattern with reduced unbalanced currents are explained. Further, application of the method for measuring the reflection and coupling coefficients of multiple antennas is introduced. The measured results of the input impedance of a dipole antenna, radiation patterns of a helical antenna on a small housing, and S-parameters of multiple antennas on a small housing are examined, and the measured results obtained with the S-parameter method are verified.

We have proposed an intruder detection method by using multiple-input multiple-output (MIMO) channels. Although the channel capacity for MIMO transmission is severely degraded in time-variant channels, we can take advantage of this feature in MIMO sensor applications. For MIMO sensors, the accurate estimation of channel state information (CSI) is essential. Moreover, the transceiver should be simplified from the viewpoint of saving power. Narrowband signals such as minimum shift keying (MSK) and offset quaternary phase shift keying signals are effective and are used in sensor network systems. However, because the timing and carrier offsets between the transmitter and receiver are relatively large compared to the symbol rate, accurate CSI estimation is impossible given the severe constraints imposed by the timing and carrier offsets. To solve this issue, a signal synchronization method for the CSI estimation using a narrowband MSK signal has been proposed. In this paper, we propose a new CSI estimation method for arbitrary amplitude and phase modulation schemes for the MIMO sensor. The key point of the proposed method is that control signals (unique words) are mapped so as not to pass through the origin of the complex I/Q plane. The estimation accuracy of the proposed method is evaluated via a computer simulation. Moreover, the basic performance by the proposed CSI estimation method is verified when considering intruder detection by MIMO sensor.