In this paper, we present and analyze a predictive closed-loop power control (CLPC) scheme which employs a comb-type sample arrangement to effectively compensate multiple power control group (PCG) delays over mobile fading channels. We consider both least squares and recursive least squares filters in our CLPC scheme. The effects of channel estimation error, prediction filter error, and power control bit transmission error on the performance of the proposed CLPC method along with competing non-predictive and predictive CLPC schemes are thoroughly investigated. Our results clearly indicate the superiority of the proposed scheme with its improved robustness under non-ideal conditions. Furthermore, we carry out a Monte-Carlo simulation study of a 55 square grid cellular network and evaluate the user capacity. Capacity improvements up to 90% are observed for a typical cellular network scenario.

Liquid crystal (LC) lenses that have hole-patterned electrodes and are driven by two voltages used as imaging devices are reported. Two different LC lenses are applied in image formation systems. One LC lens is used with a polarizer in a relay lens scope, and another LC lens that is polarization independent is used in a TV lens. Both LC lenses play roles of focusing elements in lens systems; objects are separately brought into focus by the LC lenses. Very sharp black-and-white and color images are formed by the systems.

To fully utilize the limited battery energy of mobile electronic devices, we propose an adaptive adjustment method of processing quality for multiple image stream tasks running with widely varying execution times. This adjustment method completes the worst-case executions of the tasks with a given budget of energy, and maximizes the total reward value of processing quality obtained during their executions by exploiting the probability distribution of task execution times. The proposed method derives the maximum reward value for the tasks being executable with arbitrary processing quality, and near maximum value for the tasks being executable with a finite number of processing qualities. Our evaluation on a prototype system shows that the proposed method achieves larger reward values, by up to 57%, than the previous method.

The information technology revolution has transformed all aspects of our society including critical infrastructures and led a significant shift from their old and disparate business models based on proprietary and legacy environments to more open and consolidated ones. Supervisory Control and Data Acquisition (SCADA) systems have been widely used not only for industrial processes but also for some experimental facilities. Due to the nature of open environments, managing SCADA systems should meet various security requirements since system administrators need to deal with a large number of entities and functions involved in critical infrastructures. In this paper, we identify necessary access control requirements in SCADA systems and articulate access control policies for the simulated SCADA systems. We also attempt to analyze and realize those requirements and policies in the context of role-based access control that is suitable for simplifying administrative tasks in large scale enterprises.

In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word u ∈Σ+, every element of λ(cp(u)) is d-primitive iff it is square-free, where cp(u) is the set of all cyclic-permutations of u, and λ(cp(u)) is the set of all primitive roots of it. Next we show that pmqn is a primitive word for every n, m ≥1 and primitive words p, q, under the condition that |p| = |q| and (m, n) ≠ (1, 1). We also give a condition of disjunctiveness for a language.

In this paper, we proposed a new high-rate oblique deposition method using two sputtering sources to obtain SiO2 films for a liquid crystal alignment layer. One sputtering source that operates in a metal mode supplies Si atoms to a substrate, and the other source that operates in an oxide mode supplies oxygen radicals to a substrate. To reduce the gas pressure of a deposition chamber and make the two sputtering sources operate in different modes, the sputtering sources were separated from the deposition chamber with stainless meshes, and Ar and oxygen gases were introduced separately through the two sputtering sources, i.e., Ar gas was introduced through the Si supply source and oxygen gas was introduced through the oxygen radical source. When Ar gas of 30 sccm and oxygen gas of 4 sccm were introduced into the system, the gas pressure of the deposition chamber was maintained below 1.7 mTorr and the films deposited at an incidence angle of more than 70 showed an elongated inclined columnar structure. Under this condition, a deposition rate of 30 nm/min was realized even at an incidence angle above 70, where most of the Si atoms incident to the substrate were supplied by the Si supply source and the oxygen radical source supplied oxygen radicals and promoted the oxidation of the film.

This paper proposes a novel channel estimation method for iterative equalization in MIMO systems. The proposed method incorporates co-channel interference (CCI) cancellation in the channel estimator and the channel estimation is successively performed with respect to each stream. Accuracy of channel estimation holds the key to be successfully converged the iterative equalization and decoding process. Although the channel estimates can be re-estimated by means of LS (Least Square) channel estimation using tentative decisions obtained in the iterative process, its performance is severely limited in a MIMO system because of erroneous decisions and ill-conditioned channel estimation matrix. The proposed method can suppress the above effects by means of CCI cancellation and successive channel estimation. Computer simulation confirms that the proposed channel estimation method can accurately estimate the channel, and the receiver with iterative equalization and the proposed method achieves excellent decoding performance in a MIMO-SM system.

Partial transmit sequence (PTS) is a well known technique used to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. However, it has relatively high complexity due to the computation of multiple inverse fast Fourier transforms (IFFTs). To reduce this complexity, we use intermediate signals within a decimation in frequency (DIF) radix IFFT and propose a new PTS subblocking technique which requires the computation of only partial IFFTs. Performance results are presented which show a PAPR reduction similar to that with other techniques such as original PTS (O-PTS). Further, we show that complexity reduction can be achieved with either low or high radix IFFT algorithms.

Multipath energy capture and inter-symbol interference (ISI) are two intractable problems in high-data-rate Ultra-wideband (UWB) systems. To tackle the problems and simplify the receiver, we propose an adaptive interference avoidance scheme based on Pre-RAKE combining technique. The symbol repetition period (SRP) is regarded a changeable parameter in an ordered set to avoid severe interference paths and guarantee high data-rate. The set is known to both the transmitter and receiver. The index of the selected SRP is then sent to the receiver to coordinate the transmitter and receiver. The SRP can be updated adaptively according to the variations of the channels. Both theoretical analysis and simulations show that the ISI is mitigated and the transmission rate is improved simultaneously compared to the constant SRP transmission scheme.

One of the most well-studied problems in data mining is computing the collection of frequent itemsets in large transactional databases. Since the introduction of the famous Apriori algorithm [14], many others have been proposed to find the frequent itemsets. Among such algorithms, the approach of mining closed itemsets has raised much interest in data mining community. The algorithms taking this approach include TITANIC [8], CLOSET+ [6], DCI-Closed [4], FCI-Stream [3], GC-Tree [5], TGC-Tree [16] etc. Among these algorithms, FCI-Stream, GC-Tree and TGC-Tree are online algorithms work under sliding window environments. By the performance evaluation in [16], GC-Tree [15] is the fastest one. In this paper, an improved algorithm based on GC-Tree is proposed, the computational complexity of which is proved to be a linear combination of the average transaction size and the average closed itemset size. The algorithm is based on the essential theorem presented in Sect. 4.2. Empirically, the new algorithm is several orders of magnitude faster than the state of art algorithm, GC-Tree.

We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the amount of a secret key that can be extracted from the mismatched measurements. Our lower bound shows that we can extract a secret key from the mismatched measurements with certain quantum channels, such as the channel over which the Hadamard matrix is applied to each qubit with high probability. Moreover, the entropic uncertainty principle implies that one cannot extract the secret key from both matched measurements and mismatched ones simultaneously, when we use the standard information reconciliation and privacy amplification procedure.

In an orthogonal frequency division multiplexing (OFDM) receiver with direct-conversion architecture, carrier frequency offset (CFO) and direct-current offset (DCO), which cause severe performance degradation, need to be estimated and compensated. Recently, by investigating the subspace of OFDM signal after coarse DCO cancellation using time-domain average, we have proposed a nullspace-based estimator (NSE), for blind CFO and DCO estimation. In this paper, based on an analysis of the cost function of the NSE, we propose a common nullspace based estimator (CNSE). It is shown that by matching the frequency occupation of the received OFDM signal with CFO and DCO, the CNSE can achieve the full performance potential of the NSE. Also, the performance analysis reveals that the CNSE can asymptotically approach the Cramer-Rao bound (CRB) of OFDM CFO estimation in the presence of DCO. Finally the analysis results are confirmed by simulations.

Video transmission over mobile worldwide interoperability for microwave access (WiMAX) can be serverly degraded due to the effect of fading and handoff. In this paper, we propose a channel adaptive error resilience scheme for video transmission over mobile WiMAX. When the channel condition begins to trigger handoff, the current frame is stored in the long-term memory for the forward error correction, and the following frames are encoded by using double motion vectors (MVs) in the sense of multi-hypothesis motion compensation. Even if a whole frame is lost, we can reconstruct the following frames using the stored frame in the long-term memory. However, the error propagation still remains in this forward error resilience method. To refresh the erroneous frames to the decoder, the encoder utilizes the channel adaptive refreshing (CAR). In the CAR, the channel rate is first predicted using channel parameter, a carrier to interference and noise ratio (CINR), and the encoder adaptively determines the number of blocks to be encoded in the intra mode based on the feedback information. Performance evaluations are presented to demonstrate the effectiveness of the proposed method.

The measurements for Multiple Access Interference (MAI) problems and the improvement of the data rate are key issues on the advanced wireless networks. In this paper, the nonorthogonal Code Shift Keying Code Division Multiple Access (CSK/CDMA) with received-power adaptive access control scheme is proposed. In our system, a user who is ready to send measures the received power from other users, and then the user decides whether to transmit or refrain from transmission according to the received power and a pre-decided threshold. Not only overcoming the MAI problems, but our system also improve the throughput performance. The throughput performance of the proposed system is evaluated by theoretical analysis. Consequently, the nonorthogonal CSK/CDMA system improves by applying received-power adaptive access control. It was also found that the throughput performance of the nonorthogonal CSK/CDMA system is better than that of the orthogonal CSK/CDMA system at any Eb/N0. We conclude that the nonorthogonal CSK/CDMA system with received-power adaptive access control scheme is expected to be effective in advanced wireless networks.

During the execution of precise ranging in the time domain, the most important fact to consider is how to achieve an accurate estimate of the time corresponding to first arrival of the transmitter. However, it is difficult to extract an estimate of the time-of-arrival (TOA) through use of a simple correlator due to degradation on correlation, and in the case where the pulse repetition interval (PRI) is less than the maximum excess delay (MED). In order to enhance the correlation capability, this paper proposes a TOA estimation method that obeys a threshold predetermined in a non-coherent system using multiple-mask operation (MMO). The performance of the proposed scheme is verified by conducting simulations under two different types of channel situations. The simulation results show that the proposed scheme performs well even in a dense indoor multipath environment and with the existence of multiple simultaneously operating piconets (SOPs).

The frequency domain binaural model (FDBM) has been previously proposed to localize multiple sound sources. Since the method requires only two input signals and uses interaural phase and level differences caused by the diffraction generated by the head, flexibility in application is very high when the head is considered as an object. When an object is symmetric with respect to the two microphones, the performance of sound source localization is degraded, as a human being has front-back confusion due to the symmetry in a median plane. This paper proposes to reduce the degradation of performance on sound source localization by a combination of the microphone pair outputs using the FDBM. The proposed method is evaluated by applying to a security camera system, and the results showed performance improvement in sound source localization because of reducing the number of cones of confusion.

We propose an effective voice-based gender identification method using a support vector machine (SVM). The SVM is a binary classification algorithm that classifies two groups by finding the voluntary nonlinear boundary in a feature space and is known to yield high classification performance. In the present work, we compare the identification performance of the SVM with that of a Gaussian mixture model (GMM)-based method using the mel frequency cepstral coefficients (MFCC). A novel approach of incorporating a features fusion scheme based on a combination of the MFCC and the fundamental frequency is proposed with the aim of improving the performance of gender identification. Experimental results demonstrate that the gender identification performance using the SVM is significantly better than that of the GMM-based scheme. Moreover, the performance is substantially improved when the proposed features fusion technique is applied.

Phase noise (PHN) can cause the common phase error (CPE) and the inter-carrier interference (ICI), both of which impair the accurate channel estimation in orthogonal frequency division multiplexing (OFDM) systems. In this letter, we build a new signal model parameterized by the channel impulse response, the CPE and the ICI. Based on this model, we derive the maximum likelihood estimator (MLE) and the minimum mean square error estimator (MMSEE). Simulation results show that the proposed schemes significantly improve the performance of OFDM systems in the presence of PHN.

Using query-by-sketch we propose an application to efficiently create collages with some user interaction. Using rough color strokes that represent the target collage, images are automatically retrieved and segmented to create a seamless collage. The database is indexed using simple geometrical and color features for each region, and histograms that represent these features for each image. The image collection is then queried by means of a simple paint tool. The individual segments retrieved are added to the collage using Poisson image editing or alpha matting. The user is able to modify the default segmentations interactively, as well as the position, scale, and blending options for each object. The resulting collage can then be used as an input query to find other relevant images from the database.

A component framework for building and operating visual interfaces for context-aware services in ubiquitous computing environments is presented. By using a compound-document technology, it provides physical entities, places, stationary or mobile computing devices, and services with visual components as multimedia representations to enable them to be annotated and controlled them. It can automatically assemble visual components into a visual interface for monitoring and managing context-aware services according to the spatial-containment relationships between their targets in the physical world by using underlying location-sensing systems. End-users can manually deploy and customize context-aware services through user-friendly GUI-based manipulations for editing documents. This paper presents the design for this framework and describes its implementation and practical applications in user/location-aware assistant systems in two museums.