To reduce the cost of fault management in all-optical networks, it is a promising approach to detect the degradation of optical signal quality solely at the terminal points of all-optical monitoring paths. The all-optical monitoring paths must be routed so that all single-link failures can be localized using route information of monitoring paths where signal quality degradation is detected. However, route computation for the all-optical monitoring paths that satisfy the above condition is time consuming. This paper proposes a procedure for deriving the lower bounds of the required number of monitoring paths to localize all single-link failures, and proposes an efficient monitoring path computation method based on the derived lower bounds. The proposed method repeats the route computation for the monitoring paths until feasible routes can be found, while the assumed number of monitoring paths increases, starting from the lower bounds. With the proposed method, the minimum number of monitoring paths with the overall shortest routes can be obtained quickly by solving several small-scale integer linear programming problems when the possible terminal nodes of monitoring paths are arbitrarily given. Thus, the proposed method can minimize the required number of monitors for detecting the degradation of signal quality and the total overhead traffic volume transferred through the monitoring paths.

In this letter, we provide an asymptotic error rate performance evaluation of space-time block codes from coordinate interleaved orthogonal designs (STBCs-CIODs), especially in shadowed Rayleigh fading channels. By evaluating a simplified probability density function (PDF) of Rayleigh and Rayleigh-lognormal channels affecting the STBC-CIOD system, we derive an accurate closed-form approximation for the tight upper and lower bounds on the symbol error rate (SER). We show that shadowing asymptotically affects coding gain only, and conclude that an increase in diversity order under shadowing causes slower convergence to asymptotic bound due to the relatively larger loss of coding gain. By comparing the derived formulas and Monte-Carlo simulations, we validate the accuracy of the theoretical results.

Extracting named entities (NEs) and their relations is more difficult in Thai than in other languages due to several Thai specific characteristics, including no explicit boundaries for words, phrases and sentences; few case markers and modifier clues; high ambiguity in compound words and serial verbs; and flexible word orders. Unlike most previous works which focused on NE relations of specific actions, such as work_for, live_in, located_in, and kill, this paper proposes more general types of NE relations, called predicate-oriented relation (PoR), where an extracted action part (verb) is used as a core component to associate related named entities extracted from Thai Texts. Lacking a practical parser for the Thai language, we present three types of surface features, i.e. punctuation marks (such as token spaces), entity types and the number of entities and then apply five alternative commonly used learning schemes to investigate their performance on predicate-oriented relation extraction. The experimental results show that our approach achieves the F-measure of 97.76%, 99.19%, 95.00% and 93.50% on four different types of predicate-oriented relation (action-location, location-action, action-person and person-action) in crime-related news documents using a data set of 1,736 entity pairs. The effects of NE extraction techniques, feature sets and class unbalance on the performance of relation extraction are explored.

This paper proposes a method for reconstructing a smooth and accurate 3D surface. Recent machine vision techniques can reconstruct accurate 3D points and normals of an object. The reconstructed point cloud is used for generating its 3D surface by surface reconstruction. The more accurate the point cloud, the more correct the surface becomes. For improving the surface, how to integrate the advantages of existing techniques for point reconstruction is proposed. Specifically, robust and dense reconstruction with Shape-from-Silhouettes (SfS) and accurate stereo reconstruction are integrated. Unlike gradual shape shrinking by space carving, our method obtains 3D points by SfS and stereo independently and accepts the correct points reconstructed. Experimental results show the improvement by our method.

Cubic TCP, one of transport protocols designed for high bandwidth-delay product (BDP) networks, has successfully been deployed in the Internet. Multi-homed computers with multiple interfaces to access the Internet via high speed links will become more popular. In this work, we introduce an extended version of Cubic TCP for multiple paths, called MPCubic. The extension process is approached from an analysis model of Cubic by using coordinated congestion control between paths. MPCubic can spread its traffic across paths in load-balancing manner, while preserving fair sharing with regular TCP, Cubic, and MPTCP at common bottlenecks. Moreover, to improve resilience to link failure, we propose a multipath fast recovery algorithm. The algorithm can significantly reduce the recovery time of data rate after restoration of failed links. These techniques can be useful for resilient high-bandwidth applications (for example, tele-health conference) in disaster-affected areas. Our simulation results show that MPCubic can achieve stability, throughput improvement, fairness, load-balancing, and quick data rate recovery from link failure under a variety of network conditions.

In the MIMO-OFDM multiple access channel (MIMO-OFDM-MAC) uplink scenario, the base station decides the uplink parameters for multiple users based on channel state information (CSI) from each user in the system. The performance of MIMO-OFDM-MAC systems can be significantly improved by using an adaptive transmission and resource allocation schemes which consider the correlation effect of line of sight (LOS) and non line of sight (NLOS) channel conditions for different users in the system. A lot of papers have been published on resource allocation schemes for MIMO-OFDM systems. However, most of these resource allocation schemes have been considered for MIMO-OFDMA systems, where users are separated in the frequency domain and each user uses the same uplink and downlink channels in the same channel conditions. On the other hand, in the mulituser MIMO-OFDM systems, more than one user can be assigned the same frequency and channel conditions for the MIMO-OFDM broadcast channel (downlink) and MIMO-OFDM-MAC channel (uplink) are not the same. Therefore, the same resource allocation schemes for the conventional MIMO-OFDM systems can not be applied to multiuser MIMO-OFDM systems with different uplink and downlink channel conditions. Until now, most of the resource allocation schemes have been considered only for downlink MIMO-OFDM broadcast (MIMO-OFDM-BC) channel and very few papers tackle the fairness among users. Moreover, no paper considers a scheme to realize proportional data rate fairness among users in the MIMO-OFDM-MAC condition. In this paper, we propose a proportional data rate fairness resource allocation scheme with adaptive bit loading for MIMO-ODFM-MAC systems by considering the correlation effects of LOS and NLOS channel conditions in both spatial and frequency domains. Computer simulation results show that the proposed scheme can give larger system capacity while maintaining the proportional data rate fairness requirements among users in the system under the constraint of total transmit power and predetermined target BER.

The hyper H∞ filter derived in our previous work provides excellent convergence, tracking, and robust performances for linear time-varying system identification. Additionally, a fast algorithm of the hyper H∞ filter, called the fast H∞ filter, is successfully developed so that identification of linear system with impulse response of length N is performed at a computational complexity of O(N). The gain matrix of the fast filter is recursively calculated through estimating the forward and backward linear prediction coefficients of an input signal. This suggests that the fast H∞ filter may be applicable to linear prediction of the signal. On the other hand, an alternative fast version of the hyper H∞ filter, called the J-fast H∞ filter, is derived using a J-unitary array form, which is amenable to parallel processing. However, the J-fast H∞ filter explicitly includes no linear prediction of input signals in the algorithm. This work reveals that the forward and backward linear prediction coefficients and error powers of the input signal are indeed included in the recursive variables of the J-fast H∞ filter. These findings are verified by computer simulations.

In our previous research, to achieve unequal error protection (UEP), we proposed a scheme which encodes the data by randomly switching between several codes which use different signal constellations and showed the effectiveness in AWGN channels. In this letter, we propose our UEP system using MMSE-FDE for fast and selective fading by using the fact that importance levels are changed every few symbols, i.e., every block, in the proposed system. We confirmed the improvement in BER performance and the effectiveness of adaptive equalization for the proposed system in fading channels. Moreover, in fading channels we confirmed the validity of the theoretical tradeoff shown in static conditions.

To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.

Although the effect of electromagnetic interference on an implanted cardiac pacemaker due to a nearby mobile phone has been investigated, there have been few studies on the enhancement of the specific absorption rate (SAR) around an implanted cardiac pacemaker due to a nearby mobile phone. In this study, the SAR distribution around a pacemaker model embedded in a parallelepiped torso phantom when a mobile phone was nearby was numerically calculated and experimentally measured. The results of both investigations showed a characteristic SAR distribution. The system presented can be used to estimate the effects of electromagnetic interference on implanted electric circuits and thus could lead to the development of guidelines for the safe use of mobile radio terminals near people with medical implants.

This paper deals with an integral method analyzing the diffraction of a transverse electric (TE) wave by a perfectly conductive periodic surface. The conventional integral method fails to work for a critical angle of incidence. To overcome such a drawback, this paper applies the method of image Green's function. We newly obtain an image integral equation for the basic surface current in the TE case. The integral equation is solved numerically for a very rough sinusoidal surface. Then, it is found that a reliable solution can be obtained for any real angle of incidence including a critical angle.

Nowadays portable devices with multiple wireless interfaces and using multimedia services are becoming more popular on the Internet. This paper describes a family of multipath binomial congestion control algorithms for audio/video streaming, where a low variant of transmission rate is important. We extend the fluid model of binomial algorithms for single-path transmission to support the concurrent transmission of packets across multiple paths. We focus on the extension of two particular algorithms, SQRT and IIAD, for multiple paths, called MPSQRT and MPIIAD, respectively. Additionally, we apply the design technique (using the multipath fluid model) for multipath TCP (MPTCP) into the extension of SQRT and IIAD, called fbMPSQRT and fbMPIIAD, respectively. Both two approaches ensure that multipath binomial congestion control algorithms achieve load-balancing, throughput improvement, and fairness to single-path binomial algorithms at shared bottlenecks. Through the simulations and comparison with the uncoordinated protocols MPSQRT/MPIIAD, fbMPSQRT/fbMPIIAD and MPTCP, we find that our extended multipath transport protocols can preserve lower latency and transmission rate variance than MPTCP, fairly share with single-path SQRT/IIAD, MPTCP and TCP, and also can achieve throughput improvements and load-balancing equivalent to those of MPTCP under various scenarios and network conditions.

Mirrored serpentine microstrip lines are proposed for a parallel high speed digital signaling to reduce the peak far-end crosstalk (FEXT) voltage. Mirrored serpentine microstrip lines consist of two serpentine microstrip lines, each one equal to a conventional normal serpentine microstrip line. However, one serpentine microstrip line of the mirrored serpentine microstrip lines is flipped in the length direction, and thus, two serpentine microstrip lines face each other. Time domain reflectometry measurements show that the peak FEXT voltage of the mirrored serpentine microstrip lines is reduced by 56.4% of that of conventional microstrip lines and 30.0% of that of conventional normal serpentine microstrip lines.

Underlay cognitive systems allow secondary users (SUs) to access the licensed band allocated to primary users (PUs) for better spectrum utilization with the power constraint imposed on SUs such that their operation does not harm the normal communication of PUs. This constraint, which limits the coverage range of SUs, can be offset by relaying techniques that take advantage of shorter range communication for lower path loss. Symbol error rate (SER) analysis of underlay cognitive relay systems over fading channel has not been reported in the literature. This paper fills this gap. The derived SER expressions are validated by simulations and show that underlay cognitive relay systems suffer a high error floor for any modulation level.

This paper proposes an iterative maximum a posteriori (MAP) receiver for orthogonal frequency division multiplexing (OFDM) mobile communications under fast-fading conditions. The previous work in [21] developed a MAP receiver based on the expectation-maximization (EM) algorithm employing the differential model, which can allow correlated time-variation of channel impulse responses. In order to make such a MAP receiver more robust against time-variant channels, this paper proposes two new message-passing algorithms derived from factor graphs; subcarrier removal and partial turbo processing. The subcarrier removal estimates the channel frequency response by using all subcarriers other than the targeted subcarrier. Such channel estimate can be efficiently calculated by removing information on the targeted subcarrier from the estimate of the original EM algorithm that uses all the subcarriers. This modification can avoid the repetitive use of incorrectly detected signals for the channel estimation. On the other hand, the partial turbo processing performs symbol-by-symbol channel decoding by using a symbol interleaver. Owing to this process, the current channel estimate, which is more accurate due to the decoding gain, can be used as the initial channel estimate for the next symbol. Computer simulations under fast multipath fading conditions demonstrate that the subcarrier removal and the partial turbo processing can improve the error floor and the convergence speed, respectively, compared to the conventional MAP receiver.

This letter presents a method for obtaining an exact average symbol error rate (ASER) of M-phase shift keying (M-PSK) transmission for the Nth best opportunistic amplify-and-forward (OAF) relay systems over Rayleigh fading channels. This approach begins with deriving the relay selection probability when a relay is selected as the Nth best one with respect to the received signal-to-noise ratio. We then derive the modified moment generating function (MGF) for the Nth best OAF relay systems by taking the given Nth best-relay selection probability into consideration. Based on the modified MGF, we derive the exact ASER which accurately explicates the Nth best OAF relay system characteristics. Simulation results confirm the exactness of the analysis results for M-PSK transmission with respect to the number of relays, the Nth best relay selection, and the relay position.

In this paper, we derive a simple formula to generate a wide-sense systematic generator matrix(we call it quasi-systematic) B for a Reed-Solomon code. This formula can be utilized to construct an efficient interpolation based erasure-only decoder with time complexity O(n2) and space complexity O(n). Specifically, the decoding algorithm requires 3kr + r2 - 2r field additions, kr + r2 + r field negations, 2kr + r2 - r + k field multiplications and kr + r field inversions. Compared to another interpolation based erasure-only decoding algorithm derived by D.J.J. Versfeld et al., our algorithm is much more efficient for high-rate Reed-Solomon codes.

This study shows a fast simulation method of turbo codes over slow Rayleigh fading channels. The reduction of the simulation time is achieved by applying importance sampling (IS). The conventional IS method of turbo codes over Rayleigh fading channels focuses only on modification of additive white Gaussian noise (AWGN) sequences. The proposed IS method biases not only AWGNs but also channel gains of the Rayleigh fading channels. The computer runtime of the proposed method is about 1/5 of that of the conventional IS method on the evaluation of a frame error rate of 10-6. When we compare with the Monte Carlo simulation method, the proposed method needs only 1/100 simulation runtime under the condition of the same accuracy of the estimator.

Radiation integral areas are localized and reduced based upon the locality of scattering phenomena. In the high frequency, the scattering field is given by the currents, not the entire region, but on the local areas near the scattering centers, such as the stationary phase points and edge diffraction points, due to the cancelling effect of integrand in the radiation integral. The numerical calculation which this locality is implemented into has been proposed for 2-dimensional problems. The scattering field can be approximated by integrating the currents weighted by the adequate function in the local areas whose size and position are determined appropriately. Fresnel zone was previously introduced as the good criterion to determine the local areas, but the determination method was slightly different, depending on the type of scattering centers. The objective of this paper is to advance the Fresnel zone criteria in a 2-dimensional case to the next stage with enhanced generality and applicability. The Fresnel zone number is applied not directly to the actual surface but to the virtual one associated with the modified surface-normal vector satisfying the reflection law. At the same time, the argument in the weighting function is newly defined by the Fresnel zone number instead of the actual distance from the scattering centers. These two revisions bring about the following three advantages; the uniform treatment of various types scattering centers, the smallest area in the localization and applicability to 3-dimensional problems.

Sparse representation based classification (SRC) has emerged as a new paradigm for solving face recognition problems. Further research found that the main limitation of SRC is the assumption of pixel-accurate alignment between the test image and the training set. A. Wagner used a series of linear programs that iteratively minimize the sparsity of the registration error. In this paper, we propose another face registration method called three-point positioning method. Experiments show that our proposed method achieves better performance.