One of the most promising applications of a mobile ad hoc network is a vehicular ad hoc network (VANET). Each vehicle is aware of its position information by GPS or other methods, so position-based routing is a useful approach in VANET. The position-based routing protocol can be classified roughly into a next-hop forwarding method and a directed flooding method. We evaluate performance of both methods by analytic approach and compare them in this paper. From the evaluation results, we conclude that it is effective for the position-based routing to choose either the next-hop forwarding method or the directed flooding method according to the environment. Then we propose the hybrid transmission method which can select one of them according to the environment, and clarify that the proposed method can keep the packet delivery ratio at a high level and reduce the delay time.

Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.

Due to the dynamics of topology and resources, Call Admission Control (CAC) plays a significant role for increasing resource utilization ratio and guaranteeing users' QoS requirements in wireless/mobile networks. In this paper, a dynamic multi-threshold CAC scheme is proposed to serve multi-class service in a wireless/mobile network. The thresholds are renewed at the beginning of each time interval to react to the changing mobility rate and network load. To find suitable thresholds, a reward-penalty model is designed, which provides different priorities between different service classes and call types through different reward/penalty policies according to network load and average call arrival rate. To speed up the running time of CAC, an Optimized Genetic Algorithm (OGA) is presented, whose components such as encoding, population initialization, fitness function and mutation etc., are all optimized in terms of the traits of the CAC problem. The simulation demonstrates that the proposed CAC scheme outperforms the similar schemes, which means the optimization is realized. Finally, the simulation shows the efficiency of OGA.

On the basis of the RF characteristics of p-type diamond field-effect transistors (FETs) with hydrogen surface termination, we establish an equivalent circuit (EQC) model. From comparisons of three cases we reveal that to represent the device performance in the EQC, the source, gate, and drain resistance should be considered but that the gate-source and gate-drain resistance can be ignored. The features of diamond FETs are (1) a plateau of the gate capacitance in a certain gate voltage range. (2) maximum fT and fMAX cut-off frequencies near the threshold gate voltage, and (3) a high fMAX/fT ratio 3.8. We discuss these features in terms of the energy barrier between the gate metal and the two-dimensional hole channel and drift region below the gate.

A distributed algorithm that uses the MVDR (minimum variance distortionless response) combiner and the local information to adjust the power and weight (combining weight) is proposed for joint diversity and power control in wireless networks. The proposed algorithm limits the power according to a constraint and has the property that if the SINR (signal to interference and noise ratio) requirement is achieved, then the condition of this achievement will hold after every discrete time. We prove that the power and weight of the proposed algorithm converge to the optimal feasible power and weight that minimize the total power consumption. Simulation results also show that the MVDR combiner gets lower average power level per user and higher probability of success in meeting the SINR requirement than other combiners.

"Dive into the Movie (DIM)" is a name of project to aim to realize a world innovative entertainment system which can provide an immersion experience into the story by giving a chance to audience to share an impression with his family or friends by watching a movie in which all audience can participate in the story as movie casts. To realize this system, several techniques to model and capture the personal characteristics instantly in face, body, gesture, hair and voice by combining computer graphics, computer vision and speech signal processing technique. Anyway, all of the modeling, casting, character synthesis, rendering and compositing processes have to be performed on real-time without any operator. In this paper, first a novel entertainment system, Future Cast System (FCS), is introduced which can create DIM movie with audience's participation by replacing the original roles' face in a pre-created CG movie with audiences' own highly realistic 3D CG faces. Then the effects of DIM movie on audience experience are evaluated subjectively. The result suggests that most of the participants are seeking for higher realism, impression and satisfaction by replacing not only face part but also body, hair and voice. The first experimental trial demonstration of FCS was performed at the Mitsui-Toshiba pavilion of the 2005 World Exposition in Aichi Japan. Then, 1,640,000 people have experienced this event during 6 months of exhibition and FCS became one of the most popular events at Expo.2005.

Although it is very important to conduct listening tests when constructing a practical sound field reproduction system based on wave field synthesis, listening tests are very expensive. A localization model of synthesized sound images that predicts the results of listening tests is proposed. This model reduces the costs of constructing a reproduction system because it makes it possible to omit the listening tests. The proposed model uses the precedence effect and predicts the direction of synthesized sound images based on the inter-aural time difference. A comparison of the results predicted by the proposed model and the localized results of listening tests shows that the model accurately predicts the localized results.

Digital video encapsulates the time series of a frame (still) images, where overall video quality can be obtained by using the quality of each frame image and the temporal information between the frame image. Coding of video produces degradation of these two types of information. These degradations can be classified as spatial degradation (static degradation) of a frame images and temporal degradation between frame image (dynamic degradation). In the framework of video quality evaluation it is necessary to consider those degradations, because their contents are strongly interdependable and quantification is problematic for these degradations. Therefore, the development of an objective video quality assessment method for single video quality requires to investigate how much static degradation and dynamic degradation affect single video quality. In this research, single video quality was predicted highly accuratly by using frame quality as static degradation and frame rate information as dynamic degradation.

The TFT-LCD image has non-uniform brightness that is the major difficulty of finding the visible defect called Mura in the field. To facilitate Mura detection, background signal shading should level off and Mura signal must be amplified. In this paper, Mura signal amplification and background signal flattening method is proposed based on human visual system (HVS). The proposed DC normalized contrast sensitivity function (CSF) is used for the Mura signal amplification and polynomial regression (PR) is used to level off the background signal. In the enhanced image, tri-modal thresholding segmentation technique is used for finding Dark and White Mura at the same time. To select reliable defect, falsely detected invisible region is eliminated based on Weber's Law. By the experimental results of artificially generated 1-d signal and TFT-LCD image, proposed algorithm has novel enhancement results and can be applied to real automated inspection system.

This letter describes a new QR-decomposition maximum likelihood detector that is combined with frequency-domain equalization for single-carrier transmission based multiple-input multiple-output systems. By utilizing the equalized substreams to adjust the frequency selectivity in corresponding substreams in subsequent stages, the packet error rate performances of the proposed detector is superior to that of the minimum mean squared error receiver by a factor of the receive antenna diversity gain.

This paper investigates suitable indexing techniques to enable efficient content-based audio retrieval in large acoustic databases. To make an index-based retrieval mechanism applicable to audio content, we investigate the design of Locality Sensitive Hashing (LSH) and the partial sequence comparison. We propose a fast and efficient audio retrieval framework of query-by-content and develop an audio retrieval system. Based on this framework, four different audio retrieval schemes, LSH-Dynamic Programming (DP), LSH-Sparse DP (SDP), Exact Euclidian LSH (E2LSH)-DP, E2LSH-SDP, are introduced and evaluated in order to better understand the performance of audio retrieval algorithms. The experimental results indicate that compared with the traditional DP and the other three compititive schemes, E2LSH-SDP exhibits the best tradeoff in terms of the response time, retrieval accuracy and computation cost.

In this paper, we show that motion sharpening phenomenon can be explained as a form of visual masking for a special case where a video sequence is composed of alternate frames with different level of sharpness. A frame of higher sharpness behaves to mask the ambiguity of a subsequent frame of lower sharpness and hence preserves the perceptive quality of the whole sequence. Borrowing the mechanism for visual masking, we formulated a quantitative model for deriving the minimum spatial frequency conditions which preserves the subjective quality of the frames being masked. The quantitative model takes into account three fundamental properties of the video signals, namely the size of motion, average luminance and the power of each frequency components. The psychophysical responses towards the changes of these properties are obtained through subjective assessment tests using video sequences of simple geometrical patterns. Subjective experiments on natural video sequences show that more than 75% of viewers could make no distinction between the original sequence and the one processed using the quantitative model.

As THz wave has the advantages of enough resolution and penetration to materials, it has been examined to be used for the imaging system. The propagation distance of THz wave is limited to be short. That is also the advantage for application to the indoor wireless communication etc. For the achievement of the ultra-high frequency oscillator (and concurrently transmitter) device, the properties of small, electronic excitation, the antenna constructed and being on the wafer are important. For the purpose, the Negative differential resistance Dual channel transistor (NDR-DCT) proposed by AIST is utilized. In this paper, as an initial theoretical analysis, we simulated the oscillation frequency of this device at about 100 GHz-1THz within the Terahertz band on which the above applications was expected. The equivalent circuit model of NDR-DCT was shown based on the analogy with the resonant tunnelling diode (RTDs), and the antenna as the resonance circuit part was designed by the numerical analysis. The possibility of the THz oscillation of this device was confirmed. The slit reflector that we proposed can realize the slot antenna on the device effectively and is suitable for three terminal structure semiconductor. its manufacturing is relatively easy.

To estimate the impact of electromagnetic disturbances on multi-carrier wireless systems, a method for converting an amplitude probability distribution (APD) of disturbance measured at a frequency to be valid for another frequency is presented. The conversion uses two parameters, the receiver noise power of the APD measuring equipment and a scale factor that can be estimated from a measured disturbance spectrum. The method is based on the assumption that the difference in measurement frequency affects only the relative scale of the probability distribution of band-limited disturbance amplitude, and is applicable to disturbances of practically importance such as 1) continuous or pulse-modulated wideband Gaussian noise, 2) disturbance with a much narrower bandwidth than receiver bandwidth B, and 3) repetitive short pulses with similar waveforms with an interval much longer than 1/B. The validity of the proposed method is examined by measurements of actual disturbances.

A useful optimization problem to help solve various base station layout problems in multihop wireless networks is formulated. By solving the proposed generalized formula, the relation between the permissible largest number of hops and the minimum base station density necessary to cover an entire service area while guaranteeing a specified QoS is easily calculated. Our formula is extendable to other allocation problems by replacing parameters. The energy-cost transformation and scope of the multihop effect are also presented.

In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences scheduling schemes in a way that each scheduled packet should be ensured to be completely transmitted within the scheduled frames. We formulate the PFS problem as an optimization problem. Based on the observations on the structure of optimal solutions, we propose a heuristic scheduling algorithm that consists of two stages. First, subcarriers are allocated among users without considering the packet length constraint. Then on the second stage, subcarrier readjustment is done in a way that surplus subcarriers from length-satisfied users are released and allocated among length-unsatisfied users. The objective is to provide proportional fairness among users while guaranteeing complete transmission of each scheduled packet. Simulation results show that the proposed scheme has quite close performance to the optimal scheme in terms of Multi-carrier Proportional Fairness Measure (MCPFM), throughput and average packet delay.

A new sinusoidal modeling approach for the analysis-by-synthesis (AbS) of parameters that characterize a linear combination of damped sinusoids is proposed. In addition to the typical sinusoidal parameters, two different damping factors, which represent the time-varying nature of speech, were used to efficiently reduce the modeling error. Even though the proposed model does not employ the overlap-adding synthesis or smoothly interpolative synthesis scheme, it shows substantially better modeling performance in the synthesis of voiced and transient segments.

A family of linear subspace classifiers called local subspace classifier (LSC) outperforms the k-nearest neighbor rule (kNN) and conventional subspace classifiers in handwritten digit classification. However, LSC suffers very high sensitivity to image transformations because it uses projection and the Euclidean distances for classification. In this paper, I present a combination of a local subspace classifier (LSC) and a tangent distance (TD) for improving accuracy of handwritten digit recognition. In this classification rule, we can deal with transform-invariance easily because we are able to use tangent vectors for approximation of transformations. However, we cannot use tangent vectors in other type of images such as color images. Hence, kernel LSC (KLSC) is proposed for incorporating transform-invariance into LSC via kernel mapping. The performance of the proposed methods is verified with the experiments on handwritten digit and color image classification.

Three-dimensional visualization using jigsaw-puzzle-like glyphs, or shapes, is proposed as a means of representing grammatical constraints in programming. The proposed visualization uses 3D glyphs such as convex, concave, and wireframe shapes. A semantic constraint, such as a type constraint in an assignment, is represented by an inclusive match between 3D glyphs. An application of the proposed visualization method to a subset of the Java programming language is demonstrated. An experimental evaluation showed that the 3D glyphs are easier to learn and enable users to more quickly understand their relationships than 2D glyphs and 1D symbol sequences.

We study in this paper the subchannel access and the rate assignment for the multicarrier multi-cell networks. For subchannel access, we show from theoretic results and simulation results that the scheme with only one user per cell in each subchannel outperforms the scheme with multiple users per cell in each subchannel. For rate assignment, a distributed rate assignment is proposed to assign the rate for all subchannels. The proposed rate assignment need not measure the channel gains and uses only local information to iteratively adjust the transmitting power and data rate. We prove that the aggregate rate can be increased by increasing the number of iterations in the proposed rate assignment.