This paper suggests utterance verification system using state-level log-likelihood ratio with frame and state selection. We use hidden Markov models for speech recognition and utterance verification as acoustic models and anti-phone models. The hidden Markov models have three states and each state represents different characteristics of a phone. Thus we propose an algorithm to compute state-level log-likelihood ratio and give weights on states for obtaining more reliable confidence measure of recognized phones. Additionally, we propose a frame selection algorithm to compute confidence measure on frames including proper speech in the input speech. In general, phone segmentation information obtained from speaker-independent speech recognition system is not accurate because triphone-based acoustic models are difficult to effectively train for covering diverse pronunciation and coarticulation effect. So, it is more difficult to find the right matched states when obtaining state segmentation information. A state selection algorithm is suggested for finding valid states. The proposed method using state-level log-likelihood ratio with frame and state selection shows that the relative reduction in equal error rate is 18.1% compared to the baseline system using simple phone-level log-likelihood ratios.

This paper analyzes the ergodic capacity of the MIMO multi-keyhole channel, assuming that the channel state information (CSI) is available only at the receiver. We first derive new closed-form expressions for marginal probability density function (pdf) of the single unordered eigenvalue as well as joint pdf of ordered eigenvalues of the channel matrix in a simple and general framework. With these statistical results, we then present an exact closed-form expression for the ergodic capacity. We analyze tight bounds on the exact capacity and propose a new tight lower bound. We also investigate the asymptotic capacity performances in low-signal-to-noise-ratio (SNR) and high-SNR regimes to gain further insights. All our results apply for arbitrary number of keyholes and antennas. Numerical simulations are presented to validate our theoretical analysis.

Analytical solutions for the frequency-dependent transmission line model parameters of a stranded coaxial cable, which are not trivial due to the complex geometry, are presented and discussed in this paper. A frequency-dependent effective conductor radius of a stranded wire coaxial cable is proposed to estimate the internal impedance using the Bessel function solutions of a solid wire coaxial cable. The performance of the proposed model is verified by electromagnetic field solver simulation and by experimental measurement. The results show that the proposed model successfully calculates the broadband frequency-dependent RLGC model parameters and characteristic impedance of a stranded wire coaxial cable with high accuracy.

Existence of backward TE volume modes which are to be identified as Magnetostatic Wave (MSW) in anisotropic single-negative slab with partly negative permeability tensor component have already been revealed by present authors. In this paper, detailed modal analysis has been carried out for this kind of TE volume modes to find out their novel and peculiar properties. From these numerical results, it has been clarified that dispersion curve of the lowest order mode for thicker slab has a frequency of turning point below which both forward and backward waves can be simultaneously observed and also there is a critical slab thickness for each order of TE volume modes to exist.

In this paper, we suggest a new probabilistic model of semantic role labeling, which uses the frameset of the predicate as explicit linguistic knowledge for providing global information on the predicate-argument structure that local classifier is unable to catch. The proposed model consists of three sub-models: role sequence generation model, frameset generation model, and matching model. The role sequence generation model generates the semantic role sequence candidates of a given predicate by using the local classification approach, which is a widely used approach in previous research. The frameset generation model estimates the probability of each frameset that the predicate can take. The matching model is designed to measure the degree of the matching between the generated role sequence and the frameset by using several features. These features are developed to represent the predicate-argument structure information described in the frameset. In the experiments, our model shows that the use of knowledge about the predicate-argument structure is effective for selecting a more appropriate semantic role sequence.

For fast egomotion of a camera, computing feature correspondence and motion parameters by global search becomes highly time-consuming. Therefore, the complexity of the estimation needs to be reduced for real-time applications. In this paper, we propose a compound omnidirectional vision sensor and an algorithm for estimating its fast egomotion. The proposed sensor has both multi-baselines and a large field of view (FOV). Our method uses the multi-baseline stereo vision capability to classify feature points as near or far features. After the classification, we can estimate the camera rotation and translation separately by using random sample consensus (RANSAC) to reduce the computational complexity. The large FOV also improves the robustness since the translation and rotation are clearly distinguished. To date, there has been no work on combining multi-baseline stereo with large FOV characteristics for estimation, even though these characteristics are individually are important in improving egomotion estimation. Experiments showed that the proposed method is robust and produces reasonable accuracy in real time for fast motion of the sensor.

In this paper, we propose a rational m-out-of-n secret sharing scheme, a dealer wishes to entrust a secret with a group of n players such that any subset of m or more players can reconstruct the secret, but a subset of less than m players cannot learn anything about the secret. The reconstruction protocol of our scheme is fair and stable in the rational settings, allowing all players to obtain the designated secret. Our scheme is based on RSA-OAEP with the distributed decryption. The security of our scheme relies on a computational assumption and uses the random oracles. The size of each share in our scheme is independent of the utility function and the computation cost of the reconstruction protocol is constant. Moreover, our scheme prevents the attacks with at most m-1 coalitions.

In this paper, we propose a bandwidth-scalable stereo audio coding method based on a layered structure. The proposed stereo coding method encodes super-wideband (SWB) stereo signals and is able to decode either wideband (WB) stereo signals or SWB stereo signals, depending on the network congestion. The performance of the proposed stereo coding method is then compared with that of a conventional stereo coding method that separately decodes WB or SWB stereo signals, in terms of subjective quality, algorithmic delay, and computational complexity. Experimental results show that when stereo audio signals sampled at a rate of 32 kHz are compressed to 64 kbit/s, the proposed method provides significantly better audio quality with a 64-sample shorter algorithmic delay, and comparable computational complexity.

In the present paper, the performance of cooperative relaying networks with adaptive relaying scheme selection is analyzed. Cooperative relaying is a new technique to achieve spatial diversity gain by using neighboring stations. However, when multiple stations transmit simultaneously, the number of interference signals increases. Therefore, the introduction of cooperative relaying in radio communication systems does not always increase the network capacity due to the co-channel interference. Therefore, in order to achieve high spectral efficiency, it is necessary to select cooperative relaying or non-cooperative relaying adaptively. Assuming both centralized and decentralized adaptive controls, the spectrum efficiency is evaluated. The performance under decentralized control is evaluated using a game-theoretic approach. Simulation results show that the introduction of cooperative relaying with centralized control always increases the spectral efficiency. On the other hand, Simulation results also show that, when each source selects a relaying scheme independently and selfishly to maximize its own spectral efficiency, the introduction of the cooperative relaying may reduce the spectral efficiency due to the increase in the number of interference signals.

An inversion method of bridge height over water by polarimetric synthetic aperture radar (SAR) is developed. A geometric ray description to illustrate scattering mechanism of a bridge over water surface is identified by polarimetric image analysis. Using the mapping and projecting algorithm, a polarimetric SAR image of a bridge model is first simulated and shows that scattering from a bridge over water can be identified by three strip lines corresponding to single-, double-, and triple-order scattering, respectively. A set of polarimetric parameters based on the de-orientation theory is applied to analysis of three types scattering, and the thinning-clustering algorithm and Hough transform are then employed to locate the image positions of these strip lines. These lines are used to invert the bridge height. Fully polarimetric image data of airborne Pi-SAR at X-band are applied to inversion of the height and width of the Naruto Bridge in Japan. Based on the same principle, this approach is also applicable to spaceborne ALOSPALSAR single-polarization data of the Eastern Ocean Bridge in China. The results show good feasibility to realize the bridge height inversion.

By using multiple repeated signal replicas to formulate the accumulative observed noisy signal sequence (AONSS) or the differential observed noisy signal sequence (DONSS) in the hybrid ARQ system, a novel data-aided maximum likelihood (DA ML) SNR estimation and a blind ML SNR estimation technique are proposed for the AWGN channel. It is revealed that the conventional DA ML estimate is a special case of the novel DA ML estimate, and both the proposed DA ML and the proposed blind ML SNR estimation techniques can offer satisfactory SNR estimation without introducing significant additional complexity to the existing hybrid ARQ scheme. Based on the AONSS, both the generalized deterministic and the random Cramer-Rao lower bounds (GCRLBs), which include the traditional Cramer-Rao lower bounds (CRLBs) as special cases, are also derived. Finally, the applicability of the proposed SNR estimation techniques based on the AONSS and the DONSS are validated through numerical analysis and simulation results.

In this paper, we propose a new modeling method to express discrete-time hybrid systems with parameter uncertainty as a mixed logical dynamical (MLD) model. In analysis and control of hybrid systems, there are problem formulations in which convex polyhedra are computed, but for high-dimensional systems, it is difficult to solve these problems within a practical computation time. The key idea of this paper is to use an interval method, which is one of the classical methods in verified numerical computation, and to regard an interval as an over-approximation of a convex polyhedron. By using the obtained MLD model, analysis and synthesis of robust control systems are formulated.

In this paper, a new video frame interpolation method based on image morphing for frame rate up-conversion is proposed. In this method, image features are extracted by Scale-Invariant Feature Transform in each frame, and their correspondence in two contiguous frames is then computed separately in foreground and background regions. By using the above two functions, the proposed method accurately generates interpolation frames and thus achieves frame rate up-conversion.

In the near future, wireless local area networks (WLANs) will overlap to provide continuous coverage over a wide area. In such ubiquitous WLANs, a mobile node (MN) moving freely between multiple access points (APs) requires not only permanent access to the Internet but also continuous communication quality during handover. In order to satisfy these requirements, an MN needs to (1) select an AP with better performance and (2) execute a handover seamlessly. To satisfy requirement (2), we proposed a seamless handover method in a previous study. Moreover, in order to achieve (1), the Received Signal Strength Indicator (RSSI) is usually employed to measure wireless link quality in a WLAN system. However, in a real environment, especially if APs are densely situated, it is difficult to always select an AP with better performance based on only the RSSI. This is because the RSSI alone cannot detect the degradation of communication quality due to radio interference. Moreover, it is important that AP selection is completed only on an MN, because we can assume that, in ubiquitous WLANs, various organizations or operators will manage APs. Hence, we cannot modify the APs for AP selection. To overcome these difficulties, in the present paper, we propose and implement a proactive AP selection method considering wireless link condition based on the number of frame retransmissions in addition to the RSSI. In the evaluation, we show that the proposed AP selection method can appropriately select an AP with good wireless link quality, i.e., high RSSI and low radio interference.

Switching a communication path from one Access Point (AP) to another in inter-domain WLANs is a critical challenge for delay-sensitive applications such as Voice over IP (VoIP) because communication quality during handover (HO) is more likely to be deteriorated. To maintain VoIP quality during HO, we need to solve many problems. In particular, in bi-directional communication such as VoIP, an AP becomes a bottleneck with the increase of VoIP calls. As a result, packets queued in the AP buffer may experience a large queuing delay or packet losses due to increase in queue length or buffer overflow, thereby causing the degradation of VoIP quality for the Mobile Nodes (MNs) side. To avoid this degradation, MNs need to appropriately and autonomously execute HO in response to the change in wireless network condition, i.e., the deterioration of wireless link quality and the congestion state at the AP. In this paper, we propose an HO decision strategy considering frame retries, AP queue length, and transmission rate at an MN for maintaining VoIP quality during HO. Through simulation experiments, we then show that our proposed method can maintain VoIP quality during HO by properly detecting the wireless network condition.

Networking technologies have recently been evolving and network applications are now expected to support flexible composition of upper-layer network services, such as security, QoS, or personal firewall. We propose a multi-platform framework called FreeNA* that extends existing applications by incorporating the services based on user definitions. This extension does not require users to modify their systems at all. Therefore, FreeNA is valuable for experimental system usage. We implemented FreeNA on both Linux and Microsoft Windows operating systems, and evaluated their functionality and performance. In this paper, we describe the design and implementation of FreeNA including details on how to insert network services into existing applications and how to create services in a multi-platform environment. We also give an example implementation of a service with SSL, a functionality comparison with relevant systems, and our performance evaluation results. The results show that FreeNA offers finer configurability, composability, and usability than other similar systems. We also show that the throughput degradation of transparent service insertion is 2% at most compared with a method of directly inserting such services into applications.

This paper presents new approaches for the estimation of range between the preceding vehicle and the experimental vehicle, estimation of vehicle size and its projective size, and dynamic camera calibration. First, our proposed approaches adopt a camera model to transform coordinates from the ground plane onto the image plane to estimate the relative position between the detected vehicle and the camera. Then, to estimate the actual and projective size of the preceding vehicle, we propose a new estimation method. This method can estimate the range from a preceding vehicle to the camera based on contact points between its tires and the ground and then estimate the actual size of the vehicle according to the positions of its vertexes in the image. Because the projective size of a vehicle varies with respect to its distance to the camera, we also present a simple and rapid method of estimating a vehicle's projective height, which allows a reduction in computational time for size estimation in real-time systems. Errors caused by the application of different camera parameters are also estimated and analyzed in this study. The estimation results are used to determine suitable parameters during camera installation to suppress estimation errors. Finally, to guarantee robustness of the detection system, a new efficient approach to dynamic calibration is presented to obtain accurate camera parameters, even when they are changed by camera vibration owing to on-road driving. Experimental results demonstrate that our approaches can provide accurate and robust estimation results of range and size of target vehicles.

Let G(s)=C(sI - A)-1B+D be a given system where entries of A,B,C,D are polynomials in a parameter k. Then H∞ norm || G(s) ||∞ of G(s) is a function of k, and [9] presents an algorithm to express 1/(||G(s) ||∞)2 as a root of a bivariate polynomial, assuming feedthrough term D to be zero. This paper extends the algorithm in two ways: The first extension is the form of the function to be expressed. The extended algorithm can treat, not only H∞ norm, but also functions that appear in the celebrated KYP Lemma. The other extension is the range of the frequency. While H∞ norm considers the supremum of the maximum singular value of G(i ω) for the infinite range 0 ≤ω ≤ ∞ of ω, the extended algorithm treats the norm for the finite frequency range ω ≤ ω ≤ ω- (ω, ω- ∈ R ∪ ∞). Those two extensions allow the algorithm to be applied to wider area of control problems. We give illustrative numerical examples where we apply the extended algorithm to the computation of the frequency-restricted norm, i.e., the supremum of the maximum singular value of G(i ω) (ω- ≤ ω ≤ ω-).

A new type of mode converter that converts TE30 to TE10 mode is proposed. As an example of the ease of fabrication, holes can be drilled at the top of a metallic waveguide and dielectric rods inserted. This converter is useful for application as a power divider or power combiner.

In this paper, we focus on the adaptive resource allocation issue for uplink OFDMA systems. The resources are allocated according to a proportional fairness criterion, which can strike an alterable balance between fairness and efficiency. Optimization theory is used to analyze the multi-constraint resource allocation problem and some heuristic characteristics about the optimal solution are obtained. To deal with the cohesiveness of the necessary conditions, we resort to bargaining theory that has been deeply investigated in game theory. Firstly, we summarize some assumptions about bargaining theory and show their similarities with the resource allocation process. Then we propose a priority-ranked bargaining model, whose primary contribution is applying the economic thought to the resource allocation process. A priority-ranked bargaining algorithm (PRBA) is subsequently proposed to permit the base station to auction the subcarriers one by one according to the users' current priority. By adjusting the predefined rate ratio flexibly, PRBA can achieve different degrees of fairness among the users' capacity. Simulation results show that PRBA can achieve similar performance of the max-min scheme and the NBS scheme in the case of appropriate predefined rate ratio.