A transducer with a wide step from a post-wall waveguide to a hollow waveguide width is proposed which is tolerant against the aperture offset. The modes in the step width of about 1.50 wavelengths are stable for the aperture offset and the fields are not so perturbed while in the conventional stepped structure with step width of about 1.00 wavelength, the higher evanescent mode of TE30 is excessively enhanced by the aperture offset. The operation of the transducer with the wider step is robust for the fabrication errors in the millimeter wave band. It is also suggested that the anti-symmetrical TE20 mode which is excited only by non-zero offset or the misalignment of the aperture exists in both structures and can not be the dominant factor for the improvement. The transducers are designed and fabricated at 61.25 GHz using PTFE substrate with glass fiber of εr=2.17. The bandwidth for the reflection lower than -15 dB is almost unchanged (6.30-6.60 GHz) for the offset from -0.2 mm to 0.2 mm, while it is degraded in the conventional stepped structure, from 7.65 GHz for no offset to 3.30-5.70 GHz for the same range of the offset.

In this article, we propose a vehicle positioning method that can estimate positions of cars even in areas where the GPS is not available. For the estimation, each car measures the relative distance to a car running in front, communicates the measurements with other cars, and uses the received measurements for estimating its position. In order to estimate the position even if the measurements are received with time-delay, we employed the time-delay tolerant Kalman filtering. For sharing the measurements, it is assumed that a car-to-car communication system is used. Then, the measurements sent from farther cars are received with larger time-delay. It follows that the accuracy of the estimates of farther cars become worse. Hence, the proposed method manages only the states of nearby cars to reduce computing effort. The authors simulated the proposed filtering method and found that the proposed method estimates the positions of nearby cars as accurate as the distributed Kalman filtering.

In this paper, we propose a method for selecting n-mode singular vectors in higher-order singular value decomposition. We select the minimum number of n-mode singular vectors, when the upper bound of a least-squares cost function is thresholded. The reduced n-ranks of all modes of a given tensor are determined automatically and the tensor is represented with the minimum number of dimensions. We apply the selection method to simultaneous low rank approximation of matrices. Experimental results show the effectiveness of the n-mode singular vector selection method.

This paper presents a new methodology, Beacognition, for real-time discovery of the associations between a signal space and arbitrarily defined regions, termed as Semantically Meaningful Areas (SMAs), in the corresponding physical space. It lets the end users develop semantically meaningful location systems using standard 802.11 network beacons as they roam through their environment. The key idea is to discover the unique associations using a beacon popularity model. The popularity measurements are then used to localize the mobile devices. The beacon popularity is computed using an election' algorithm and a new recognition model is presented to perform the localization task. We have implemented such a location system in a five story campus building. The comparative results show significant improvement in localization by achieving on average 83% SMA and 88% Floor recognition rate in less than one minute per SMA training time.

We compared SAR distributions in major anatomical structures of the brain of a homogeneous and a heterogeneous model using FDTD calculations. Our results proved a good correlation between SAR values in lobes of the brain where tumors may arise more frequently. However SAR values at some specific locations were shown to be under or overestimated.

In this paper, we propose an image completion algorithm which takes advantage of the countless number of images available on Internet photo sharing sites to replace occlusions in an input image. The algorithm 1) automatically selects the most suitable images from a database of downloaded images and 2) seamlessly completes the input image using the selected images with minimal user intervention. Experimental results on input images captured at various locations and scene conditions demonstrate the effectiveness of the proposed technique in seamlessly reconstructing user-defined occlusions.

Automatic adjustment methods for efficient, precise positioning and release of a virtual 3D object by direct hand manipulation in an immersive virtual reality environment are described and evaluated. The proposed methods are release adjustment, position adjustment, viewpoint adjustment, and virtual hand size adjustment. Combining these methods enables users to manipulate a virtual object efficiently and precisely. An experimental evaluation showed that these methods were effective and useful in terms of the number of task completions and the subjective preference, particularly for a small virtual target.

In this letter, a theoretical analysis of bit error probability for 4-state convolutional code with Max-Log-maximum a posteriori probability (MAP) decoding is presented. This technique employs an iterative calculation of probability density function of the state metric per one transition, and gives the exact bit error probability for all signal-to-noise power ratio.

When the number of users in a service area increases in mobile multimedia services, no individual user can obtain satisfactory radio resources such as bandwidth and signal power because the resources are limited and shared. A solution for such a problem is user-position control. In the user-position control, the operator informs users of better communication areas (or spots) and navigates them to these positions. However, because of subjective costs caused by subjects moving from their original to a new position, they do not always attempt to move. To motivate users to contribute their resources in network services that require resource contributions for users, incentive-rewarding mechanisms have been proposed. However, there are no mechanisms that distribute rewards appropriately according to various subjective factors involving users. Furthermore, since the conventional mechanisms limit how rewards are paid, they are applicable only for the network service they targeted. In this paper, we propose a novel incentive-rewarding mechanism to solve these problems, using an external evaluator and interactive learning agents. We also investigated ways of appropriately controlling rewards based on user contributions and system service quality. We applied the proposed mechanism and reward control to the user-position control, and demonstrated its validity.

A scheme of the superimposing additional data signal in the time domain for orthogonal frequency division multiplexing (OFDM) system is proposed. The proposed scheme has a tradeoff between the degree of freedom for data transmission and inter-carrier interference (ICI), which provides the flexibility of data rate decision when the finite number of modulation and coding levels are available for the given channel condition. A performance analysis of the bit error rate (BER) confirms this tradeoff. In simulation on the practical environment which experiences multipath fading and error of channel estimation, the results show that much improvement of spectral efficiency has been achieved while keeping as nearly good bit error rate as the conventional OFDM. Moreover, the single carrier transmission of the superimposed additional data in the time domain also gives an opportunity of boosting the signal power up to the peak to average power ratio (PAPR) margin of the OFDM system.

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.

The system level performance of a superposition coded broadcast/unicast service overlay system is considered. Cellular network for unicast service only is considered as interference limited system, where increasing the transmission power does not help improve the network throughput especially when the frequency reuse factor is close to 1. In such cases, the amount of power that does not contribute to improving the throughput can be considered as "unused." This situation motivates us to use the unused power for broadcast services, which can be efficiently provided in OFDM based single frequency networks as in digital multimedia broadcast systems. In this paper, we investigate the performance of such a broadcast/unicast overlay system in which a single frequency broadcast service is superimposed over a unicast cellular service. Alternative service multiplexing using FDM/TDM is also considered for comparison.

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.

Sensor node localization is an important issue in wireless sensor networks (WSNs) due to the dynamic nature of sensor deployment. Generally, in wireless sensor network localization, the absolute positions of certain anchor nodes are required based on the use of global positioning systems, then all the other nodes are approximately localized using various algorithms based on a coordinate system of the anchors. This paper proposes a neighbor position-based localization algorithm (NPLA) that can greatly enhance the positioning accuracy when compared with current overlapping connectivity localization algorithms that attempt to use the observation of connectivity to a set of anchors to determine a node's position. The proposed method localizes the sensor nodes using both the anchors' positions and neighbor node information. However, unlike existing overlapping-based methods, the proposed NPLA does not assume the same radio transmission range. A simulation study is used to demonstrate the positioning accuracy of the proposed method with different anchor and sensor node densities.

In deep-submicron technologies, process variations can significantly affect the performance and yield of VLSI chips. As a countermeasure to the variations, post-silicon tuning has been proposed. Deskew, where the clock timing of flip-flops (FFs) is tuned by inserted programmable delay elements (PDEs) into the clock tree, is classified into this method. We propose a novel deskew method that decides the delay values of the elements by measuring a small amount of FFs' clock timing and presuming the rest of FFs' clock timings based on a statistical model. In addition, our proposed method can determine the discrete PDE delay value because the rewriting constraint satisfies the condition of total unimodularity.

Motivated by the recent works of coded cooperation this letter presents a composite signal structure based coded cooperation technique. Our proposed protocol performs well in both slow and fast fading whereas, conventional coded cooperation is ineffective in fast fading. We develop the bounds on BER and FER of our proposal. Simulations confirm our developed bound and shows that the proposed coded cooperation protocol outperforms direct transmission in both fast and slow fading environments.

The passive and sparse reduced-order modeling of a RLC network is presented, where eigenvalues and eigenvectors of the original network are used, and thus the obtained macromodel is more accurate than that provided by the Krylov subspace methods or TBR procedures for a class of circuits. Furthermore, the proposed method is applied to low pass filtering of a reduced-order model produced by these methods without breaking the passivity condition. Therefore, the proposed eigenspace method is not only a reduced-order macromodeling method, but also is embedded in other methods enhancing their performances.

In this paper, we introduce a method for recognizing a subject complex object in real world environment. We use a three dimensional model described by line segments of the object and the data provided by a three-axis orientation sensor attached to the video camera. We assume that existing methods for finding line features in the image allow at least one model line segment to be detected as a single continuous segment. The method consists of two main steps: generation of pose hypotheses and then evaluation of each pose in order to select the most appropriate one. The first stage is three-fold: model visibility, line matching and pose estimation; the second stage aims to rank the poses by evaluating the similarity between the projected model lines and the image lines. Furthermore, we propose an additional step that consists of refining the best candidate pose by using the Lie group formalism of spatial rigid motions. Such a formalism provides an efficient local parameterization of the set of rigid rotation via the exponential map. A set of experiments demonstrating the robustness of this approach is presented.

In MIMO systems, the channel identification is important to distinguish transmitted signals from multiple transmit antennas. One of the most typical channel identification schemes is to employ a code division multiplexing (CDM) based scheme in which a unique spreading code is assigned to distinguish both BS and MS antenna elements. However, by increasing the number of base stations and transmit antenna elements, large spreading codes and pilot symbols are required to distinguish the received power from all the connectable BS, as well as to identify all the CSI for the combination of transmitter and receiver antenna elements. Furthermore, the complexity of maximum likelihood detection (MLD) for implementation of MIMO is a considerable work. To reduce these problems, in this paper, we propose the parallel detection algorithm using multiple QR decompositions with permuted channel matrix (MQRD-PCM) with discrete pilot signal assignment and iterative channel identification for MIMO/OFDM.

Recently, for more efficient filtering of XML data, YFilter system has been suggested to exploit the prefix commonalities that exist among path expressions. Sharing the prefix commonality gives the benefit of improving filtering performance through the tremendous reduction in filtering machine size. However, exploiting the postfix commonality can also be useful for an XML filtering situation. For example, when a stream of XML messages does not have any defined schema, or users cannot remember the defined schema exactly, users often use the partial matching path queries which begins with the descendant axis ("//"), e.g., '//science/article/title', '//entertainment/article/title', and '//title'. If so, the registered XPath queries are most likely to have the postfix commonality, e.g., the sample queries share the partial path expressions 'article/title' and 'title'. Therefore, in this paper, we introduce a bottom-up filtering approach exploiting the postfix commonality against the top-down approach of YFilter exploiting the prefix commonality. Some experimental results show that our method has better filtering performance when registered XPath queries mainly consist of the partial matching path queries with the postfix commonality.