In wireless networks, the mechanism to adaptively select a link transmission rate based on channel variations is referred to as RA (rate adaptation). The operation may have a critical impact on the upper-layer application, specifically video streaming which has strict QoS requirements. Thus, RA should consider the QoS requirements and radio conditions at the same time. In this paper, we present a CV-RA (cross-layer video-oriented rate adaptation) scheme for video transmission over multi-rate wireless networks. The transmission rate is switched in a cross-layer optimized way, by simultaneously considering video R-D (rate-distortion) characteristics as well as wireless conditions. At the radio link layer, transmission rate selection is made using cross-layer optimization. As a result of RA, the effective link throughput dynamically changes. At the application layer, video source rate is adaptively controlled using cross-layer adaptation. CV-RA is compared to three traditional RA schemes. It can realize the highest possible visual communications for any channel condition. For the previous schemes, the variations of visual quality is high due to dynamic packet error rates. In contrast, for CV-RA, visual quality improves with the channel condition.

In this paper, a frequency domain adaptive antenna array (FDAAA) algorithm is proposed for broadband single-carrier uplink transmissions in a cellular system. By employing AAA weight control in the frequency domain, the FDAAA receiver is able to suppress the multi-user interference (MUI) and the co-channel interference (CCI). In addition, the channel frequency selectivity can be exploited to suppress the inter-symbol interference (ISI) and to obtain frequency diversity (or the multi-path diversity). Another advantage of the FDAAA algorithm is that its performance is not affected by the spread of angles of arrival (AOA) of the received multi-path signal. In this study the structure of FDAAA receiver is discussed and the frequency domain signal-to-interference-plus-noise-ratio (SINR) after weight control is investigated. The performance of the FDAAA algorithm is confirmed by simulation results. It is shown that, the optimal FDAAA weight to obtain the best BER performance is that which fully cancels the interference when single-cell system is considered; On the other hand, when multi-cell cellular system is considered, the optimal FDAAA weight depends on both the cellular structure and the target signal to noise ratio (SNR) of transmit power control (TPC).

Many factors, such as noise level in the original image and the noise-removal methods that clean the image prior to performing a vectorization, may play an important role in affecting the line detection of raster-to-vector conversion methods. In this paper, we propose an empirical performance evaluation methodology that is coupled with a robust statistical analysis method to study many factors that may affect the quality of line detection. Three factors are studied: noise level, noise-removal method, and the raster-to-vector conversion method. Eleven mechanical engineering drawings, three salt-and-pepper noise levels, six noise-removal methods, and three commercial vectorization methods were used in the experiment. The Vector Recovery Index (VRI) of the detected vectors was the criterion used for the quality of line detection. A repeated measure ANOVA analyzed the VRI scores. The statistical analysis shows that all the studied factors affected the quality of line detection. It also shows that two-way interactions between the studied factors affected line detection.

We proposed and analyzed a fiber-reinforced ceramic (FRC) composite for a protection layer on top of an antenna mounted on the outer surface of aircraft. The manufactured FRC is a single-layered flat construct. To analyze the performance of the FRC, we extracted the material constant using the transmission/reflection (T/R) method. We described the relation between the pressure and strength of the FRC radome with respect to mechanical properties and analyzed the insertion loss with respect to electrical properties. We evaluated the characteristics of the FRC radome in conjunction with the horn antenna and showed that the analytic results for the FRC radome agree with the experiment results.

Channel errors may exist in Radio Frequency IDentification (RFID) systems due to low power backscattering of tags. These errors prevent the rapid identification of tags, and reducing this deterioration is an important issue. This paper presents performance analysis of various tag anti-collision algorithms and shows that the performances of RFID systems can be improved by applying a proposed robust algorithm in error-prone environments.

An area efficiency hybrid decoupling scheme is proposed to suppress the charge pump noise during F-N tunneling program in non-volatile memory (NVM). The proposed scheme is focused on suppressing the average noise power in frequency domain aspect, which is more suitable for the program error reduction in NVMs. The concept of active capacitor is utilized. Feed forward effect of the amplifier is firstly considered in the impedance analysis, and a trade-off relation between in-band and out-band frequency noise decoupling performance is shown. A fast optimization based on average noise power is made to achieve minimum error in the F-N tunneling program. Simulation results show very stable output voltage in different load conditions, the average ripple voltage is 17 mV with up to 20 dB noise-suppression-ratio (NSR), and the F-N tunneling program error is less than 5 mV for a 800 µs program pulse. A test chip is also fabricated in 0.18 µm technology. The area overhead of the proposed scheme is 2%. The measurement results show 24.4 mV average ripple voltage compared to 72.3 mV of the conventional one with the same decoupling capacitance size, while the noise power suppression achieves 15.4 dB.

Video applications such as video conferencing among multiple users and video surveillance systems require multiple video connections and QoS guarantee. These days the video systems equipped with IEEE 802.11 LAN interfaces allows a broadband wireless access to the Internet at a reasonable price. However, according to the current IEEE 802.11e HCCA standard, if more than two video sessions are to be established simultaneously, some of them must share the TXOP because the available number of TSIDs for video transmission is restricted to two. In order to resolve this problem, we devise a scheme which can establish up to 13 video sessions by slightly modifying the frame structure while maintaining the compatibility with the current standard. Our scheme is implemented on the NCTUns 4.0 network simulator, and evaluated numerically in terms of throughput, delay, and PSNR. Also real video clips are used as input to our simulation. The results showed that our scheme guarantees the transmission bandwidth requested by each video session.

A safe prime p is a prime such that (p-1)/2 is also a prime. A primality test or a safe primality test is normally a combination of trial division and a probabilistic primality test. Since the number of small odd primes used in the trial division affects the performance of the combination, researchers have studied how to obtain the optimal number of small odd primes to be used in the trial division and the expected running time of the combination for primality tests. However, in the case of safe primality tests, the analysis of the combination is more difficult, and thus no such results have been given. In this paper, we present the first probabilistic analysis on the expected running time and the optimal number of small odd primes to be used in the trial division for optimizing the tests. Experimental results show that our probabilistic analysis estimates the behavior of the safe primality tests very well.

In this letter, we propose a Partially Observable Markov Decision Process (POMDP) based Distributed Adaptive Opportunistic Spectrum Access (DA-OSA) Strategy for Cognitive Ad Hoc Networks (CAHNs). In each slot, the source and destination choose a set of channels to sense and then decide the transmission channels based on the sensing results. In order to maximize the throughput for each link, we use the theories of sequential decision and optimal stopping to determine the optimal sensing channel set. Moreover, we also establish the myopic policy and exploit the monotonicity of the reward function that we use, which can be used to reduce the complexity of the sequential decision.

The least-squares probabilistic classifier (LSPC) is a computationally-efficient alternative to kernel logistic regression. However, to assure its learned probabilities to be non-negative, LSPC involves a post-processing step of rounding up negative parameters to zero, which can unexpectedly influence classification performance. In order to mitigate this problem, we propose a simple alternative scheme that directly rounds up the classifier's negative outputs, not negative parameters. Through extensive experiments including real-world image classification and audio tagging tasks, we demonstrate that the proposed modification significantly improves classification accuracy, while the computational advantage of the original LSPC remains unchanged.

An adaptive selective retransmission algorithm for video communications based on packet importance value is proposed. The algorithm can adaptively select the retransmission threshold in realtime and efficiently manage the retransmission process in heavy loaded networks while guaranteeing acceptable video quality at the receiver.

The IP Multimedia Subsystem (IMS) establishes a session between end terminals as a client/server application in the Next Generation Network (NGN). These days, many application services are being provided as Web services. In this letter, we propose a new NGN architecture conforming to the architectural styles of Representational State Transfer (REST), which is a Web service technology for solving interoperability and traffic concentration problems in the Session Initiation Protocol (SIP).

This paper introduces a hard handover strategy with a novel adaptive hysteresis adjustment that is needed to reduce handover drop rate in 3GPP long term evolution (LTE). First of all, we adopt a Hybrid handover scheme considering both the received signal strength (RSS) and the load information of the adjacent evolved Node Bs (eNBs) as a factor for deciding the target eNB. The Hybrid scheme causes the load status between the adjacent eNBs to be largely similar. Then, we propose a modified load-based adaptive hysteresis scheme to find a suitable handover hysteresis value utilizing the feature of the small load difference between the target and serving eNBs obtained from the result of the Hybrid scheme. As a result, through the proposed modified load-based adaptive hysteresis scheme, the best target cell is very well selected according to the dynamically changing communication environments. The simulation results show that the proposed scheme provides good performance in terms of handover drop rate.

This letter investigates the performance of amplify-and-forward relaying systems using maximum ratio transmission at the source. A closed-form expression for the outage probability and a closed-form lower bound for the average bit error probability of the system are derived. Also, the approximate expressions for the outage probability and average bit error probability in the high signal-to-noise ratio regime are given, based on which the optimal power allocation strategies to minimize the outage probability and average bit error probability are developed. Furthermore, numerical results illustrate that optimizing the allocation of power can improve the system performance, especially in the high signal-to-noise ratio regime.

Orthogonal frequency division multiplexing has emerged as a promising air interface scheme for wireless broadband communications. For OFDM systems, frame synchronization has received much attention in the literature, though simple correlators are still widely used in real systems. In this letter, we present the analytical expression of the optimal frame synchronizer for OFDM systems. Frame synchronization is posed as a maximum a posteriori probability estimation. We show that the resulting frame synchronizer consists of a correlation term and a correction term. The correction term accounts for the random data surrounding a synchronization word. Numerical results show the performance gain of the proposed frame synchronizer over a correlation scheme.

A lot of improvements and optimizations for the hardware implementation of SubBytes of Rijndael, in detail inversion in F28 have been reported. Instead of the Rijndael original F28, it is known that its isomorphic tower field F((22)2)2 has a more efficient inversion. Then, some conversion matrices are also needed for connecting these isomorphic binary fields. According to the previous works, it is said that the number of 1's in the conversion matrices is preferred to be small; however, they have not focused on the Hamming weights of the row vectors of the matrices. It plays an important role for the calculation architecture, in detail critical path delays. This paper shows the existence of efficient conversion matrices whose row vectors all have the Hamming weights less than or equal to 4. They are introduced as quite rare cases. Then, it is pointed out that such efficient conversion matrices can connect the Rijndael original F28 to some less efficient inversions in F((22)2)2 but not to the most efficient ones. In order to overcome these inconveniences, this paper next proposes a technique called mixed bases. For the towerings, most of previous works have used several kinds of bases such as polynomial and normal bases in mixture. Different from them, this paper proposes another mixture of bases that contributes to the reduction of the critical path delay of SubBytes. Then, it is shown that the proposed mixture contributes to the efficiencies of not only inversion in F((22)2)2 but also conversion matrices between the isomorphic fields F28 and F((22)2)2.

This letter proposes a novel decision fusion algorithm for cooperative spectrum sensing in cognitive radio sensor networks where a reinforcement learning algorithm is utilized at the fusion center to estimate the sensing performance of local spectrum sensing nodes. The estimates are then used to determine the weights of local decisions for the final decision making process that is based on the Chair-Vashney optimal decision fusion rule. Simulation results show that the sensing accuracy of the proposed scheme is comparable to that of the Chair-Vashney optimal decision fusion based scheme even though it does not require any knowledge of prior probabilities and local sensing performance of spectrum sensing nodes.

Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.

Quantization is an important operation in digital communications systems. It not only introduces quantization noise but also changes the statistical properties of the quantized signal. Furthermore, quantization noise cannot be always considered as an additive source of Gaussian noise as it depends on the input signal probability density function. In orthogonal-frequency-division-multiplexing transmission the signal undergoes different operations which change its statistical properties. In this paper we analyze the statistical transformations of the signal from the transmitter to the receiver and determine how these effect the quantization. The discussed process considers the transceiver parameters and the channel properties to model the quantization noise. Simulation results show that the model agrees well with the simulated transmissions. The effect of system and channel properties on the quantization noise and its effect on bit-error-rate are shown. This enables the design of a quantizer with an optimal resolution for the required performance metrics.

Vulnerabilities in web applications expose computer networks to security threats. For example, attackers use a large number of normal user websites as hopping sites, which are illegally operated using malware distributed by abusing vulnerabilities in web applications on these websites, for attacking other websites and user terminals. Thus, the security threats, resulting from vulnerabilities in web applications prevent service providers from constructing secure networking environments. To protect websites from attacks based on the vulnerabilities of web applications, security vendors and service providers collect attack information using web honeypots, which masquerade as vulnerable systems. To collect all accesses resulting from attacks that include further network attacks by malware, such as downloaders, vendors and providers use high-interaction web honeypots, which are composed of vulnerable systems with surveillance functions. However, conventional high-interaction web honeypots can collect only limited information and malware from attacks, whose paths in the destination URLs do not match the path structure of the web honeypot since these attacks are failures. To solve this problem, we propose a scheme in which the destination URLs of these attacks are corrected by determining the correct path from the path structure of the web honeypot. Our Internet investigation revealed that 97% of attacks are failures. However, we confirmed that approximately 50% of these attacks will succeed with our proposed scheme. We can use much more information with this scheme to protect websites than with conventional high-interaction web honeypots because we can collect complete information and malware from these attacks.