Gianluigi TIBERI Agostino MONORCHIO Giuliano MANARA Raj MITTRA
A novel procedure for an efficient and rigorous solution of electromagnetic scattering problems is presented. It is based on the use of universal bases that are obtained by applying the SVD procedure to PO-derived basis functions. These bases, constructed by totally bypassing any matrix-type approach, can be used for all angles of incidence and their use leads to a matrix with relatively small dimensions. The method enables us to solve 2D scattering problems in a computationally efficient and numerically rigorous manner.
Keiji GOTO Toshihide AJIKI Toru KAWANO Toyohiko ISHIHARA
When a cylindrically curved concave conducting surface is terminated abruptly at the edge, the whispering gallery (WG) mode propagating toward the edge direction is radiated into the free space from the aperture plane at the edge. In this paper, by applying the new analysis method, we shall derive a uniform geometrical theory of diffraction solution (UTD) for the electric-type WG mode radiation field applicable in the transition region near the geometrical boundaries produced by the incident modal ray on the edge of the curved surface. The UTD is represented by the summation of the solution for the geometrical ray converted from the modal ray of the WG mode and the solution for the uniform edge diffracted ray scattered at the cylindrically curved edge. By comparing with the reference solution obtained numerically from the integral representation of the radiation field, we will confirm the validity and the utility of the UTD proposed in this paper.
In CDMA cellular systems, the frequency reuse factor equals one. Therefore, the soft-handoff technology with combining macroscopic diversity was introduced to enhance the link performance. In this work, a novel macroscopic diversity combining scheme is proposed to enhance the link performance of the forward-link. The basic concept of this scheme is to integrate error correction coding into the soft-handoff technology. According to the number of soft-handoff channels, the source information is encoded by a convolutional code with a lower code rate. The coded symbols are then equally distributed to all channels from different BSs to the MS, and each channel carries a disjointed set of coded symbols. For this proposed scheme, no extra transmission power or bandwidth is required. The only cost is a slight increase of the encoding and decoding complexity of the convolutional codes. Numerical and simulation results show that a performance gain of 1 dB in bit energy-to-total noise power density ratio can be obtained as compared with the conventional scheme in the same conditions.
Heiga ZEN Tomoki TODA Masaru NAKAMURA Keiichi TOKUDA
In January 2005, an open evaluation of corpus-based text-to-speech synthesis systems using common speech datasets, named Blizzard Challenge 2005, was conducted. Nitech group participated in this challenge, entering an HMM-based speech synthesis system called Nitech-HTS 2005. This paper describes the technical details, building processes, and performance of our system. We first give an overview of the basic HMM-based speech synthesis system, and then describe new features integrated into Nitech-HTS 2005 such as STRAIGHT-based vocoding, HSMM-based acoustic modeling, and a speech parameter generation algorithm considering GV. Constructed Nitech-HTS 2005 voices can generate speech waveforms at 0.3RT (real-time ratio) on a 1.6 GHz Pentium 4 machine, and footprints of these voices are less than 2 Mbytes. Subjective listening tests showed that the naturalness and intelligibility of the Nitech-HTS 2005 voices were much better than expected.
We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.
Tomoko SUZUKI Taisuke IZUMI Fukuhito OOSHITA Toshimitsu MASUZAWA
Mobile-agent-based distributed computing is one of the most promising paradigms to support autonomic computing in a large-scale of distributed system with dynamics and diversity: mobile agents traverse the distributed system and carry out a sophisticated task at each node adaptively. In mobile-agent-based systems, a larger number of agents generally require shorter time to complete the whole task but consume more resources (e.g., processing power and network bandwidth). Therefore, it is indispensable to keep an appropriate number of agents for the application on the mobile-agent-based system. This paper considers the mobile agent population control problem in dynamic networks: it requires adjusting the number of agents to a constant fraction of the current network size. This paper proposes algorithms inspired by the single species population model, which is a well-known population ecology model. These two algorithms are different in knowledge of networks each node requires. The first algorithm requires global information at each node, while the second algorithm requires only the local information. This paper shows by simulations that the both algorithms realize self-adaptation of mobile agent population in dynamic networks, but the second algorithm attains slightly lower accuracy than the first one.
A semi-supervised classification method is presented. A robust unsupervised spectral mapping method is extended to a semi-supervised situation. Our proposed algorithm is derived by linearization of this nonlinear semi-supervised mapping method. Experiments using the proposed method for some public benchmark data reveal that our method outperforms a supervised algorithm using the linear discriminant analysis for the iris and wine data and is also more accurate than a semi-supervised algorithm of the logistic GRF for the ionosphere dataset.
In this paper we propose a novel method to inpaint highlights and to remove the specularity in the image with specular objects by the color line projection. Color line projection is the method that a color with a surface reflection component is projected near the diffuse color line by following the direction of the specular color line. We use two captured images using different exposure time so that the clue of the original color in a highlight area is searched from two images since the color at the highlight region is distorted and saturated to the illumination color. In the first step of the proposed procedure, the region corresponding to the highlight is generated and the clue of the original highlight color is acquired. In the next step, the color line is generated by the restricted region growing method around the highlight region, and the color line is divided into the diffuse color line and the specular color line. In the final step, pixels near the specular color line are projected onto near the diffuse color line by the color line projection, in which the modified random function is applied to realistically inpaint the highlight. One of advantages in our method is to find the highlight region and the clue of the original color of the highlight with ease. It also efficiently estimates the surface reflection component which is utilized to remove specularity and to inpaint the highlight. The proposed method performs the highlight inpainting and the specular removal simultaneously once the color line is generated. In addition, color line projection with the modified random function can make the result more realistic. We show experimental results from the real images and make a synthesis of the real image and the image modified by the proposed method.
This letter describes a two-band excitation model for HMM-based speech synthesis. The HMM-based speech synthesis system generates speech from the HMM training data of the spectral and excitation parameters. Synthesized speech has a typical quality of "vocoded sound" mostly because of the simple excitation model with the voiced/unvoiced selection. In this letter, two-band excitation based on the harmonic plus noise speech model is proposed for generating the mixed excitation source. With this model, we can generate the mixed excitation more accurately and reduce the memory for the trained excitation data as well.
Masanori SANO Ichiro YAMADA Hideki SUMIYOSHI Nobuyuki YAGI
We describe an online method for selecting and annotating highlight scenes in soccer matches being televised. The stadium crowd noise and the play-by-play announcer's voice are used as input signals. Candidate scenes for highlights are extracted from the crowd noise by dynamic thresholding and spectral envelope analysis. Using a dynamic threshold solves the problem in conventional methods of how to determine an appropriate threshold. Semantic-meaning information about the kind of play and the related team and player is extracted from the announcer's commentary by using domain-based rules. The information extracted from the two types of audio input is integrated to generate segment-metadata of highlight scenes. Application of the method to six professional soccer games has confirmed its effectiveness.
Yusuke AYATO Akiko TAKATSU Kenji KATO Naoki MATSUDA
In situ observations were mainly performed by using slab optical waveguide (SOWG) spectroscopy synchronized with potential step measurements to investigate the time dependent spectral change of the adsorbed heptyl viologen cation radicals (HV+
A unified representation for various kinds of speculations and global scheduling algorithms is presented. After introducing several types of local and global speculations, reviewing our conventional method called conditional vector-based list scheduling, and discussing some of its limitations, we introduce the unique notion of generalized condition vectors (GCVs), which can represent most varieties of speculations and multiple branches as a single vector. The unification of parallel branches and partially unresolved nested conditional branches is discussed. Then, a scheduling algorithm using GCVs is proposed. Experimental results show the effectiveness of the GCV-based scheduling method.
Yasuo AZUMA Masayuki KANEHARA Toshiharu TERANISHI Yutaka MAJIMA
We demonstrate single electron counting on an alkanethiol-protected Au nanodot in a double-barrier tunneling structure by noncontact atomic-force spectroscopy (nc-AFS). The Coulomb step width dependence on the Au nanodot diameter is observed. Evaluation of fractional charge Q0 and contact potential difference by nc-AFS reveals a Vd-independent voltage shift due to Q0.
Yu LIU Satoshi KOMATSU Masahiro FUJITA
Recently, system level design languages (SLDLs), which can describe both hardware and software aspects of the design, are receiving attentions. Analog mixed-signal (AMS) extensions to SLDLs enable current discrete-oriented SLDLs to describe and simulate not only digital systems but also digital-analog mixed-signal systems. In this paper, we present our work on the AMS extension to one of the system level design language--SpecC. The extended language supports designer to describe all the analog, digital and software aspects in a universal language.
Masayoshi MATSUI Akiko NAKAHARA Akiko TAKATSU Kenji KATO Naoki MATSUDA
In situ observation of the adsorption process and reduction behavior of hemoglobin adsorbed on a bare glass surface was studied using slab optical waveguide (SOWG) spectroscopy. The peak position of the absorption band of hemoglobin adsorbed on the glass surface was almost the same as that of hemoglobin in solution. This result agrees with results previously reported by our group. The adsorbed hemoglobin molecules were also reduced by sodium dithionite solution. The adsorbed hemoglobin molecules still maintained their function in this experimental condition.
Thanyapat SAKUNKONCHAK Satoshi KOMATSU Masahiro FUJITA
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making design and verification difficult tasks. In this work, we propose a synchronization verification method for system-level designs described in the SpecC language. Instead of modeling the design with timed FSMs and using a model checker for timed automata (such as UPPAAL or KRONOS), we formulate the timing constraints with equalities/inequalities that can be solved by integer linear programming (ILP) tools. Verification is conducted in two steps. First, similar to other software model checkers, we compute the reachability of an error state in the absence of timing constraints. Then, if a path to an error state exists, its feasibility is checked by using the ILP solver to evaluate the timing constraints along the path. This approach can drastically increase the sizes of the designs that can be verified. Abstraction and abstraction refinement techniques based on the Counterexample-Guided Abstraction Refinement (CEGAR) paradigm are applied.
"Cognitive radio" and "software-defined radio" (SDR) are today an important consideration in major spectrum debates in the United States. The U.S. drafted its first SDR rules in 2001, and since has continued efforts to resolve potential regulatory concerns and facilitate the benefits of the technology. At the same time, Japan has had a very rich experience in the lab with SDR, with significant achievements on many engineering topics. However, the regulatory state of SDR in Japan has not kept pace with the United States. Likewise cognitive radio, while a topic of inquiry, betrays a different focus. The paper explores why the paths for these technologies have diverged in the U.S. and Japan.
Padungkrit PRAGTONG Kazi M. AHMED Tapio J. ERKE
This paper presents the characteristics and modeling of VoIP traffic for a real network. The new model, based on measured data, shows a significant difference from the previously proposed models in terms of parameters and their effects. It is found that the effects of background noise and ringing tones have essential influences on the model. The observed distributions of talkspurt and silent durations have long-tail characteristics and considerably differ from the existing models. An additional state called "Long burst", which represents the background noise at the talker's place, is added into the continuous-time Markov process model. The other three states, "Talk", "Short silence" and "Long silence", represent the normal behavior of the VoIP user. Models for conversational speech containing the communication during the dialogue are presented. In the case of the VoIP traffic aggregation, the simplified models, which neglect the conversation's interaction, are proposed. Depending on the occurrences of background noise during the speech, the model is classified as "noisy speech" or "noiseless speech". The measured data shows that the background noise typically increases the data rate by 60%. Simulation results of aggregated VoIP traffic indicate the self-similarity, which is analogous to the measured data. Results from the measurements support the fact that except the ringing duration the conversations from both the directions can be modeled in identical manner.
Youngjoo SUH Hoirin KIM Minsoo HAHN Yongju LEE
In this letter, a new segment-level speech/nonspeech classification method based on the Poisson polling technique is proposed. The proposed method makes two modifications from the baseline Poisson polling method to further improve the classification accuracy. One of them is to employ Poisson mixture models to more accurately represent various segmental patterns of the observed frequencies for frame-level input features. The other is the soft counting-based frequency estimation to improve the reliability of the observed frequencies. The effectiveness of the proposed method is confirmed by the experimental results showing the maximum error reduction of 39% compared to the segmentally accumulated log-likelihood ratio-based method.
Younghyun JEON Sungho JEON Sanghoon LEE
It is well known that the diversity gain attained by DCA (Dynamic Channel Allocation) is generally very high over OFDM (Orthogonal Frequency Division Multiplexing)-based broadband networks. This paper introduces a numerical approach for measuring the performance gain afforded by DCA. In the mathematical analysis, the property of order statistics is adopted to derive the upper bound of the expected throughput via the use of DCA. In the simulation, it was possible to achieve a gain of 5 dB by exploiting multi-user and spectral diversities when the number of users is 16 and the total number of subcarriers is 256.