This paper presents the initial results of a study of an asymptotic method for calculating the received intensity of multi-path millimeter waves transmitted over an undulating surface. First, an integral expression of the received intensity is derived using a physical optics approximation. Then its zero-th order asymptotic expression is derived, using the Pearcey integral, for the case where the phase function appearing in the integrand can be approximated by a quartic polynomial. A numerical examination made at 59.5 GHz showed that the asymptotic method is in good agreement with the physical optics method, even in cases where the geometrical optics method deviates significantly from the physical optics method, and that the range of applicability of the asymptotic method has its upper bound somewhere around a transmission distance to surface undulation wavelength ratio of 2.

Distance to target is fundamental and very important information in numerous engineering fields. Many distance measurement methods using sound use the time delay of a reflected wave, which is measured in reference to the transmitted wave. This method, however, cannot measure short distances because the transmitted wave, which has not attenuated sufficiently by the time the reflected waves are received, suppresses the reflected waves for short distances. Therefore, we proposed an acoustic distance measurement method based on the interference between the transmitted wave and the reflected waves, which can measure distance in a short range. The proposed method requires a cancellation processing for background components due to the spectrum of the transmitted wave and the transfer function of the measurement system in real environments. We refer to this processing as background components cancellation processing (BGCCP). We proposed BGCCP based on subtraction or whitening. However, the proposed method had a limitation with respect to the transmitted wave or additive noise in real environments. In the present paper, we propose an acoustic distance measurement method based on the new BGCCP. In the new BGCCP, we use the calibration of a real measurement system and the whitening processing of the transmitted wave and introduce the concept of the cepstrum to the proposed method in order to achieve robustness. Although the conventional BGCCP requires the recording of the transmitted wave under the condition without targets, the new BGCCP does not have this requirement. Finally, we confirmed the effectiveness of the proposed method through experiments in real environments. As a result, the proposed method was confirmed to be valid and effective, even in noisy environments.

The effective ISFs of differential LC oscillators are derived under the assumption that the drain-to-source current is linearly dependent on the gate-to-source voltage for transistors operated in saturation. Moreover, a new interpretation of phase noise is given by examining the real vector diagram of the carrier signal, upon which the noise voltage induced by the impulse noise current is superimposed. The distinct feature of our vector diagram lies in that the noise voltage is always parallel with the horizontal axis. From the Fourier transformations of the derived effective ISFs, the phase noise of differential LC oscillators can be formulated with physical meanings in the frequency domain. The proposed theory can well describe the translation of the noise spectra when the noises from the LC-tank, the switching transistors, and the tail current source are converted into the phase noise. Theoretical predictions from our formulas agree well with the simulation results.

In this paper, side information refinement methods for Wyner-Ziv video codec are presented. In the proposed method, each block of a Wyner-Ziv frame is separated into a predefined number of groups, and these groups are interleaved to be coded. The side information for the first group is generated by the motion compensated temporal interpolation using adjacent key frames only. Then, the side information for remaining groups is gradually refined using the knowledge of the already decoded signal of the current Wyner-Ziv frame. Based on this basic concept, two progressive side information refinement methods are proposed. One is the band-wise side information refinement (BW-SIR) method which is based on transform domain interleaving, while the other is the field-wise side information refinement (FW-SIR) method which is based on pixel domain interleaving. Simulation results show that the proposed methods improve the quality of the side information and rate-distortion performance compared to the conventional side information refinement methods.

This paper proposes a resource allocation method based on TCP (Transmission Control Protocol) throughput for base station diversity systems. A goal of this study is to achieve high throughput wireless Internet access by utilizing multiple wireless links effectively. The conventional work showed that base station diversity techniques can improve TCP performance. However, the improvement depends on the wireless environment of the wireless terminal. The proposed resource allocation method allocates wireless links to a wireless terminal based on its estimated TCP throughput and current traffic of each base station. Our method can take account of some network protocols such as TCP and UDP (User Datagram Protocol) by measuring the current traffic of each base station. In addition, wireless links are preferentially assigned to the wireless terminal that has the largest performance improvement per wireless link. Therefore, the proposal provides better overall system performance than the previous technique.

This paper proposes ladder-logic programming model for sensor actuator networks. We also demonstrate optimized operations of them with central controller-based device management (CCDM) architecture. A wireless sensor actuator network consists of distributed wireless nodes, and implementing data streams and data processors onto these wireless nodes has been challenging. System programmers have to describe their instructions by a programming language, and data processors must be placed so that it optimizes, for example, total network traffic. The ladder-logic model enables the programming of them, and CCDM makes various types of optimizations feasible, including the optimization of network traffic, delivery latency, load-balancing and fault-tolerance even though these algorithms are not lightweight. In this paper, we focus on traffic reduction case, and propose two moderately complex algorithms. The experiment has shown that CCDM achieves optimizations even with such moderately complex algorithms.

We analyze subjective assessments by comparative evaluations of bulk data transmission by using two psychological methods (the method of successive categories and the constant method). From the results of the first experiment, the thresholds at which participants downloading a data file began to feel dissatisfaction with service degradation are 15.7 Mbps and 11.6 Mbps obtained by the two different methods when the throughput without the service degradation is approximately 22 Mbps. In the second experiment, we investigate the threshold of user satisfaction for various network environments. The threshold is 63% of the throughput of the user's usual network environment. Moreover, from the viewpoint of download time, users feel dissatisfaction with the quality when download time becomes 1.5 times longer. These values can be used to more effectively allocate network resources and thereby achieve higher service quality.

This paper presents a technique to enhance in-band mismatch noise reduction of multi-stage second order Dynamic Element Matching (DEM) in multi-level ΔΣ Digital-to-Analog Converters (DACs). The presented technique changes an operational behavior of multi-stage DEM to reduce mismatch noise at in-band frequency. This change improves mismatch noise shaping performance for small amplitude input signals. Simulation result using 2-stage second order DEM and a third order 17-level ΔΣ modulator with 0.5% analog element mismatch shows 3.4 dB dynamic range improvement.

In future mobile networks, the ever-increasing loads imposed by mobile Internet traffic will force the network architecture to be changed from hierarchical to flat structure. Most of the existing mobility protocols are based on a centralized mobility anchor, which will process all control and data traffic. In the flat network architecture, however, the centralized mobility scheme has some limitations, such as unwanted traffic flowing into the core network, service degradation by a single point of failure, and increased operational costs, etc. This paper proposes mobility schemes for distributed mobility control in the flat network architecture. Based on the Proxy Mobile IPv6 (PMIP), which is a well-known mobility protocol, we propose the three mobility schemes: Signal-driven PMIP (S-PMIP), Data-driven Distributed PMIP (DD-PMIP), and Signal-driven Distributed PMIP (SD-PMIP). By numerical analysis, we show that the proposed distributed mobility schemes can give better performance than the existing centralized scheme in terms of the binding update and packet delivery costs, and that SD-PMIP provides the best performance among the proposed distributed schemes.

Boosting over weak classifiers is widely used in pedestrian detection. As the number of weak classifiers is large, researchers always use a sampling method over weak classifiers before training. The sampling makes the boosting process harder to reach the fixed target. In this paper, we propose a partial derivative guidance for weak classifier mining method which can be used in conjunction with a boosting algorithm. Using weak classifier mining method makes the sampling less degraded in the performance. It has the same effect as testing more weak classifiers while using acceptable time. Experiments demonstrate that our algorithm can process quicker than [1] algorithm in both training and testing, without any performance decrease. The proposed algorithms is easily extending to any other boosting algorithms using a window-scanning style and HOG-like features.

Change history in project revisions provides helpful information on handling bugs. Existing studies on predicting bugs mainly focus on resulting bug patterns, not these change patterns. When a code hunk is copied onto several files, the set of original and copied hunks often need to be consistently maintained. We assume that it is a normal state when all of hunks survive or die in a specific revision. When partial change occurs on some duplicated hunks, they are regarded as suspicious hunks. Based on these assumptions, suspicious cases can be predicted and the project's developers can be alerted. In this paper, we propose a practical approach to detect various change smells based on revision history and code hunk tracking. The change smells are suspicious change patterns that can result in potential bugs, such as partial death of hunks, missed refactoring or fix, backward or late change. To detect these change smells, three kinds of hunks – add, delete, and modify – are tracked and analyzed by an automated tool. Several visualized graphs for each type have been suggested to improve the applicability of the proposed technique. We also conducted experiments on large-scale open projects. The case study results show the applicability of the proposed approach.

Locally linear embedding (LLE) is a well-known method for nonlinear dimensionality reduction. The mathematical proof and experimental results presented in this paper show that the neighborhood sizes in LLE must be smaller than the dimensions of input data spaces, otherwise LLE would degenerate from a nonlinear method for dimensionality reduction into a linear method for dimensionality reduction. Furthermore, when the neighborhood sizes are larger than the dimensions of input data spaces, the solutions to LLE are not unique. In these cases, the addition of some regularization method is often proposed. The experimental results presented in this paper show that the regularization method is not robust. Too large or too small regularization parameters cannot unwrap S-curve. Although a moderate regularization parameters can unwrap S-curve, the relative distance in the input data will be distorted in unwrapping. Therefore, in order to make LLE play fully its advantage in nonlinear dimensionality reduction and avoid multiple solutions happening, the best way is to make sure that the neighborhood sizes are smaller than the dimensions of input data spaces.

We propose a novel method of supervised feature projection called class-distance-based discriminant analysis (CDDA), which is suitable for automatic age estimation (AAE) from facial images. Most methods of supervised feature projection, e.g., Fisher discriminant analysis (FDA) and local Fisher discriminant analysis (LFDA), focus on determining whether two samples belong to the same class (i.e., the same age in AAE) or not. Even if an estimated age is not consistent with the correct age in AAE systems, i.e., the AAE system induces error, smaller errors are better. To treat such characteristics in AAE, CDDA determines between-class separability according to the class distance (i.e., difference in ages); two samples with similar ages are imposed to be close and those with spaced ages are imposed to be far apart. Furthermore, we propose an extension of CDDA called local CDDA (LCDDA), which aims at handling multimodality in samples. Experimental results revealed that CDDA and LCDDA could extract more discriminative features than FDA and LFDA.

In this letter, we focus on the spectrum sharing cognitive radio system, wherein a single-input multi-output cognitive fading channel is considered. Subject to the joint average interference constraint and peak interference constraint at the primary receiver, the outage capacity of the cognitive channel involving joint beamforming and power control is analyzed. We derive the optimal beamforming and power control strategy and deduce the closed-form expression for the outage capacity under Rayleigh fading model, the functional regions of two kinds of interference constraints are discussed as well. Furthermore, considering zero-outage transmission, we investigate the delay-limited capacity and introduce a new concept called the zero-outage average interference wall. Extensive simulations corroborate our theoretical results.

The processor-sharing (PS) rule arises as a natural paradigm in a variety of practical situations, including time-shared computer systems. Although there has been much work on Poisson-input queueing analysis for the PS rule, there have been few results for renewal-input GI/G/1 (PS) systems. We consider the GI/G/1 (PS) system to provide develop a two-moment approximation for the mean performance measures. We derive the relationship between the mean unfinished work and the conditional mean sojourn time for the GI/G/1 (PS) system. Using this relationship, we derive approximate formulas for the mean conditional sojourn time, mean sojourn time, and the mean number of customers in the GI/G/1 (PS) system. Numerical examples are presented to compare the approximation with exact and simulated results. We show that the proposed approximate formulas have good accuracy.

This paper presents the design consideration of a four-stage variable gain amplifier (VGA) with a wide dynamic range for receivers. The VGA uses parallel amplifiers for the first and second amplifiers in order to improve the input third-order intercept point (IIP3) in the low gain region. To investigate the behavior of the VGA, the gain and linearity analyses are newly derived for the parallel amplifiers, and are compared with the measured results. In addition, the principle of the temperature compensation is described. The gain control range of 110 dB, the IP1 dB of -11 dBm, and noise figure (NF) of 5.1 dB were measured using a 0.5 µm 26 GHz fT BiCMOS process.

A detailed analysis of a multilayer symmetric coupler employing symmetrical broad-side coupled lines is presented. We confirm that the coupler can be designed using a well-known even-odd mode analysis of two strip lines while the coupler has four strip lines. We also confirm that the previously reported poor isolation originates from port mismatching. To verify the analysis, couplers that have different dimensions are fabricated. One example exhibits a coupling loss of 4.50.5 dB, a return loss better than 15 dB, and isolation characteristics higher than 12 dB in the 6.5 to 15.1 GHz frequency range. These results agree well with the obtained simulation results. The results show that the coupler has the potential to provide tight and ideal coupling.

This paper introduces a random selection cooperation scheme that takes the Decode-and-Forward (DF) approach to solve the unfairness problem in selection cooperation. Compared to previous work which obtained fairness but introduced performance loss, the proposed scheme guarantees fairness without performance loss. Its essence is to randomly select from the relays that can ensure the successful communication between the source and the destination, rather than to select the best relay. Both a theoretical analysis and simulation results confirm that the proposed scheme could achieve fairness and introduce no performance loss. We also discuss the conditions under which the proposed scheme is practical to implement.

The aim of this study is to realize a simplified gait analysis system using wearable sensors. In this paper, a joint angle measurement method using Kalman filter to correct gyroscope signals from accelerometer signals was examined in measurement of hip, knee and ankle joint angles with a wireless wearable sensor system, in which the sensors were attached on the body without exact positioning. The lower limb joint angles of three healthy subjects were measured during gait with the developed sensor system and a 3D motion measurement system in order to evaluate the measurement accuracy. Then, 10 m walking measurement was performed under different walking speeds with a healthy subject in order to find the usefulness of the system as a simplified gait analysis system. The joint angles were measured with reasonable accuracy, and the system showed joint angle changes that were similar to those shown in a previous report as walking speed changed. It would be necessary to examine the influence of sensor attachment position and method for more stable measurement, and also to study other parameters for gait evaluation.

A new transmission scheme for OFDM systems that uses the odd discrete Fourier transform to provide frequency diversity gain is proposed. Odd DFT allows the transmission of data subcarriers in frequencies that are centred between those employed by the traditional DFT. This fact is exploited to transmit data subcarriers on the group of frequencies that gives better performance using either traditional DFT or odd DFT. As an example, by using this approach a diversity gain up to 5.3 dB at a BER of 10-4 in a typical indoor channel model can be achieved.