Fingerprinting is a technique to add identifying marks to each copy of digital contents in order to enhance traceability to a distribution system. Collusion attacks, in which the attackers collect two or more fingerprinted copies and try to generate an untraceable copy, are considered to be a threat for the fingerprinting system. With the aim of enhancing collusion security to the fingerprinting system, several collusion secure codes, such as c-frameproof code, c-secure frameproof code and c-identifiable parent property code, have been proposed. Here, c indicates the maximum number of colluding users. However, a practical construction of the above codes is still an issue because of the tight restrictions originated from their combinatorial properties. In this paper, we introduce an evaluation of frameproof, secure frameproof, and identifiable parent property by the probability that a code has the required property. Then, we focus on random codes. For frameproof and secure frameproof properties, we estimate the average probability that random codes have the required property where the probability is taken over the random construction of codes and random construction of coalitions. For the estimation, we assume the uniform distribution of symbols of random codes and the symbols that the coalitions hold. Therefore, we clarify the adequacy of the assumptions by comparison with numerical results. The estimates and numerical results resemble, which implies the adequacy of the assumption at least in the range of the experiment.

The paper reports a compact and high performance dual-band bandpass filter (BPF) using two types of dual-mode resonators. The dual mode cross shaped resonator and the three dual mode ring resonators in the designed dual-band BPF are excited to control the first and second passband, respectively. It is shown that the designed and fabricated dual-band BPF has narrow bandwidths and very sharp attenuation rate due to the existence of the transmission zeros. The frequency response of the designed dual-band BPF shows good agreement between the simulations and experiments.

We propose efficient secret sharing schemes realizing general access structures. Our proposed schemes are perfect secret sharing schemes and include Shamir's (k, n)-threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes.

In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett's reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of Eisenstein integers. The implementation of these families is efficient by using our method.

The reliability of a 266 nm cw (continuous-wave) solid-state laser under the influence of purge gas was considered. Scatterers on a mirror during long-term operation were ammonium sulfate (NH4SO4). The synthesis of ammonium sulfate was related to the amount of water in the purge gas. UV power decreased by scatterers when the purge was not conducted.

This innovative traffic-monitoring-system makes it possible to observe data-communication traffic on an oscilloscope-style display. It provides an efficient way of evaluating streaming-data quality. The monitoring system has a high time-resolution traffic value sampling function and a real-time data representation/recording mechanism that operate in synchrony. The user can directly evaluate the traffic shape with the monitoring system. In this paper, after describing the concept of the traffic monitoring system, we will describe a prototype built with programmable network equipment called A-BOX. We will then review a performance evaluation and other experimental results to prove that our monitoring system is suitable for video streaming.

Wind power generation occupies an important position as a new non-fossil energy in recent years, and the plant scale has been rapidly expanding as wind-farm. Since they are often built in topographically inconvenient places, the remote monitoring system has been required. Ethernet had been said to be unsuitable to the industrial network, it is one of the strong options because of its low cost and easiness to apply. In this case, it is important to secure the throughput enough for updating the data of numerous wind turbines within a fixed time. In order to achieve this, we adopted User Datagram Protocol/Internet Protocol (UDP/IP) and the multi-thread method to make the overhead of software small as possible. This paper presents the scheme of powerful network using Ethernet with multi-thread and multi-cast. The relation between the number of threads and total throughputs of network is clarified. The design procedure to derive the optimum number of threads is shown. And it is demonstrated that this scheme provide the local network of wind-farm with sufficient performance.

In this paper we present the exact expressions for the bit error probability over a Gaussian noise channel of coded QAM using single error correcting integer codes. It is shown that the proposed integer codes have a better performance with respect to the lower on the bit error probability for trellis coded modulation.

The methodologies of product-line engineering emphasize proactive reuse to construct high-quality products more quickly that are less costly. Requirement engineering for software product families differs significantly from requirement engineering for single software products. The requirements for a product line are written for the group of systems as a whole, with requirements for individual systems specified by a delta or an increment to the generic set. Therefore, it is necessary to identify and explicitly denote the regions of commonality and points of variation at the requirement level. In this paper, we suggest a method of producing requirements that will be a core asset in the product line. Briefly, requirements for families of similar systems (i.e. domain) are collected and generalized which are then analyzed and modeled. The domain requirement as a core asset explicitly manages the commonality and variability. Through this method, the reuse of domain requirements can be enhanced. As a result, the cost and time of software development can be reduced and the productivity increased while significantly reducing error in the requirements.

The multiple space-time trellis codes (M-STTC) structure is one of the Multiple Input Multiple output (MIMO) schemes providing high transmission rate and diversity and coding gain without bandwidth expansion. In this paper, an M-STTC system is proposed wherein the transmitter employs a multiple space-time TCM for the fast fading channel and the receiver has a decoding order block, several whitening processors, STTC decoders, and interference cancellers. The proposed layered receiver adopts a whitening process instead of a minimum mean squared error (MMSE) estimator, which is widely used in the BLAST type receiver. An optimum decoding order scheme is also planned since it gives at least a 2 dB gain in the proposed system in the fast flat Rayleigh fading channel of fd Tc = 1/3 at the FER of 10-2. For an M-STTC system employing two STTCs with four transmit and receive antennas, the layered receiver with whitening process obtains a 5 dB gain over the coded layered space-time processing in the fast flat Rayleigh fading channel at the FER of 10-2.

With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.

To implement a fast and reliable question-answering system in Korean, we propose a two-pass answer indexer using co-occurrence information between answer candidates and adjacent content words. The two-pass indexer scans documents twice for obtaining local scores and global scores. Then, the two-pass indexer calculates the degrees of association between answer candidates and co-occurring content words. Using this technique, the proposed QA system shortens the response time and enhances the precision.

This paper treats the least-squares linear filtering and smoothing problems of discrete-time signals from uncertain observations when the random interruptions in the observation process are modelled by a sequence of independent Bernoulli random variables. Using an innovation approach we obtain the filtering algorithm and a general expression for the smoother which leads to fixed-point, fixed-interval and fixed-lag smoothing recursive algorithms. The proposed algorithms do not require the knowledge of the state-space model generating the signal, but only the covariance information of the signal and the observation noise, as well as the probability that the signal exists in the observed values.

A fully integrated current-steering 10-b CMOS Digital-to-Analog Converter with on-chip terminated resistors is presented. In order to improve the device-mismatching problem of internal termination resistors, a self-calibrated current bias circuit is designed. With the self-calibrated current bias circuit, the gain error of the output voltage swing is reduced within 0.5%. For the purpose of reducing glitch noises, furthermore, a novel current switch based on a deglitching circuit is proposed. The prototype circuit has been fabricated with a 3 V 0.35 µm 2-poly 3-metal CMOS technology, and it occupies 1350 µm750 µm silicon area with 45 mW power consumption. The measured INL and DNL are within 0.5LSB, respectively. The measured SFDR is about 65 dB, when an input signal is about 8 MHz at 100 MHz clock frequency.

This paper presents a multiple-voltage high-level synthesis approach for low power DSP applications using algorithmic transformation techniques. Our approach is motivated by maximization of task mobilities in that the increase of mobilities may raise the possibility of assigning tasks to low-voltage components. The mobility means the ability to schedule the starting time of a task. It is defined as the distance between its as-late-as-possible (ALAP) schedule time and its as-soon-as-possible (ASAP) schedule time. To earn task mobilities, we use loop shrinking, retiming and unfolding techniques. The loop shrinking can first reduce the iteration period bound (IPB) and, then, the others are employed for shortening the iteration period (IP) as much as possible. The minimization of IP results in high task mobilities. Finally, we can assign tasks with high mobilities to low-voltage components and, thus, minimize energy under resource and latency constraints. With considering the overhead of level conversion, our approach can achieve significant power reduction. In the case of the third-order IIR filter, the proposed approach can save up to 40.2% of power consumption.

In this paper, a compact and wideband printed monopole antenna is proposed. The proposed antenna is fed by CPW line and has two stubs for impedance matching. A simple monopole element has resonance frequency of 2.5 GHz (low resonance frequency). High resonance frequency of 5.5 GHz and wideband characteristic can be achieved by adjusting the position and size of stubs. The designed antenna has dimension of 0.125 λ0 height and 0.16 λ0 width where λ0 is the free-space wavelength at 2.5 GHz. The measured bandwidth of the antenna is 3.56 GHz (2.47-6.03 GHz) for S11 less than -10 dB. FDTD method is used to analyze the proposed antenna with wideband characteristic.

Radio frequency (RF) microwave can be used to predict glucose concentration in a sample. This paper presents preliminary results in determining the concentration by measuring relative permittivity in the solutions of distilled water, saline, human serum, and human blood containing glucose. In the experiments, sensitivity for detecting glucose concentration in blood solutions was almost 57 mg/dl at the frequency of approximately 5.8 GHz.

We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.

In multicarrier code division multiple access (MC-CDMA) systems, the orthogonality among the spreading codes is destroyed because the channels exhibit frequency-selective fading and the despreading stage performs gain control; that is, inter-code interference (ICI) can significantly degrade system performance. This paper proposes an optimum spreading code assignment method that reflects our analysis of ICI for up and downlink MC-CDMA cellular systems over correlated frequency-selective Rayleigh fading channels. At first, we derive theoretical expressions for the desired-to-undesired signal power ratio (DUR) as a quantitative representation of ICI; computer simulation results demonstrate the validity of the analytical results. Next, based on the ICI imbalance among code pairs, we assign specific spreading codes to users to minimize ICI (in short, to maximize the multiplexing performance); our proposed method considers the quality of service (QoS) policy of users or operators. We show that the proposed method yields better performance, in terms of DUR, than the conventional methods. The proposed method can maximize the multiplexing performance of a MC-CDMA cellular system once the channel model, spreading sequence, and combining strategy have been set. Three combining strategies are examined at the despreading stage for the uplink, equal gain combining (EGC), orthogonality restoring combining (ORC), and maximum ratio combining (MRC), while two are considered for the downlink, EGC and MRC.

The growth of the Internet has resulted in an increasing need for personalized information systems. The paper describes an autonomous agent, the Web Robot Agent or WebBot, which integrates with the web and acts as a personal recommendation system that cooperates with the user in order to identify interesting pages. The Apriori algorithm extracts the characteristics of the web pages in the form of association words that are semantically related and mines a bag of association words. Using hybrid components from collaborative filtering and content-based filtering, this hybrid recommendation system can overcome the shortcomings associated with traditional recommendation systems. In this paper, we present an improved recommendation system, which uses the user preference mining through hybrid 2-way filtering. The proposed method was tested on a database, and its effectiveness compared with existent methods was proven in on-line experiments.