Lachlan B. MICHAEL Masao NAKAGAWA
Inter-vehicle communication has aroused much interest because of its goal of reducing traffic accidents. In a non-platooning situation, where vehicles travel freely, multiple hop (MH) inter-vehicle communication has not yet been examined. In this paper a simple MH broadcast protocol is proposed, and shown to be effective. The effect of several parameters important to a MH network, such as maximum number of hops and data rate, are investigated. Multiple hop is shown to be superior to the conventional single hop (SH) system using non-platoon inter-vehicle communication.
Jeng-Long LEOU Jiunn-Ming HUANG Shyh-Kang JENG Hsueh-Jyh LI
In this paper, we apply the discrete wavelet transform (DWT) and the discrete wavelet packet transform (DWPT) with the Daubechies wavelet of order 16 to effectively solve for the electromagnetic scattering from a one-dimensional inhomogeneous slab. Methods based on the excitation vector and the [Z] matrix are utilized to sparsify an MoM matrix. As we observed, there are no much high frequency components of the field in the dielectric region, hence the wavelet coefficients of the small scales components (high frequency components) are very small and negligible. This is different from the case of two-dimensional scattering from perfect conducting objects. In the excitation-vector-based method, a modified excitation vector is introduced to extract dominant terms and achieve a better compression ratio of the matrix. However, a smaller compression ratio and a tiny relative error are not obtained simultaneously owing to their deletion of interaction between different scales. Hence, it is inferior to the [Z]-matrix-based methods. For the [Z]-marix-based methods, our numerical results show the column-tree-based DWPT method is a better choice to sparsify the MoM matrix than DWT-based and other DWPT-based methods. The cost of a matrix-vector multiplication for the wavelet-domain sparse matrix is reduced by a factor of 10, compared with that of the original dense matrix.
Hφholdt, van Lint and Pellikaan proposed a generalization of one-point AG codes, called the evaluation codes. We show that an evaluation code from a weight function can be constructed as Miura's generalization of one-point AG codes. Hence we can construct a one-point AG code as good as a given evaluation code from a weight function.
Geun-Min CHOI Hiroshi MORITA Jong-Soo KIM Tadahiro OHMI
The growth behavior of copper particle on crystalline and amorphous silicon surfaces has been investigated. The study reveals that the growth behavior of copper particle depends on the substrate condition. When samples are intentionally contaminated in ultrapure water, both crystalline and amorphous silicon surfaces show no difference in their contamination levels. However, copper particles were not observed on an amorphous silicon surface except dipping in dilute CuCl2 solution. The copper concentration on an amorphous silicon surface after dipping in a 0.5% HF solution is similar to the level after contaminating in ultrapure water. The copper contamination level on a crystalline silicon surface, except from CuCl2 solution, decreased two orders of magnitude as compared with ultrapure water. The copper impurity level on crystalline silicon surface was reduced by two orders by cleaning in a sulfuric acid-hydrogen peroxide mixture. The sulfuric acid-hydrogen peroxide mixture cleaning was not effective on an amorphous silicon surface. When native oxide pre-existed on an amorphous silicon surface before contamination, however, the sulfuric acid-hydrogen peroxide mixture cleaning was effective for removing copper impurity. Our results suggest that copper contamination on an amorphous silicon surface have the characteristics of bonding directly with silicon and/or existing in the native oxide, in contrast with the situation on crystalline silicon surface. After contamination with 1000 ppm copper in CuF2 solution, the etch rate of an amorphous silicon film in a 0.5% HF solution was approximately one order of magnitude faster than that of crystalline silicon. This is attributed to the difference in crystalline structure between crystalline silicon and amorphous silicon.
Masato TAJIMA Keiji TAKIDA Zenshiro KAWASAKI
In this paper, we state some noteworthy facts in connection with simplification of the BCJR algorithm using the bidirectional Viterbi algorithm (BIVA). That is, we clarify the necessity of metric correction in the case that the BIVA is applied to reliability estimation, where information symbols uj obey non-uniform probability distributions.
Dong-Ho KIM You-Ze CHO Jong-Hee PARK
This paper investigates the performance of relative rate (RR) switch algorithms for available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. An RR switch can be implemented differently according to the congestion detection and notification methods used. This paper proposes three implementation schemes for an RR switch using various congestion detection and notification methods, and then analyzes the allowed cell rate (ACR) of a source and the queue length at a switch in steady state. The upper and lower bounds for the maximum and minimum queue lengths are also determined for each scheme, respectively, thereby investigating the effects of ABR parameter values on a queue length. Furthermore, a selection method for rate increase factor (RIF) and rate decrease factor (RDF) parameter values is suggested to prevent buffer overflow and underflow.
Hideki NODA Katsuya HARADA Eiji KAWAGUCHI
This paper presents an improved method of speaker verification using the sequential probability ratio test (SPRT), which can treat the correlation between successive feature vectors. The hidden Markov model with the mean field approximation enables us to consider the correlation in the SPRT, i. e. , using the mean field of previous state, probability computation can be carried out as if input samples were independent each other.
Conor O'DONOGHUE Cyril J. BURKLEY
In order to guarantee pairwise independence of codewords in an ensemble of convolutional codes it is necessary to consider time-varying codes. However, Seguin has shown that the pairwise independence property is not strictly necessary when applying the random coding argument and on this basis he derives a new random coding bound for rate 1/n fixed convolutional codes. In this paper we show that a similar random coding bound can be obtained for rate k/n fixed convolutional codes.
Junichi HORI Yoshiaki SAITOH Tohru KIRYU
In the present paper we shall examine the real-time restoration of biomedical signals under additive noises. Biomedical signals measured by instruments such as catheter manometers, ambulatory electrocardiographs and thermo-dilution sensors are susceptible to distortion and noise. Therefore, such signals must be restored to their original states. In the present study, nonstationary biomedical signals are observed and described using a mathematical model, and several restoration filters that are composed of a series of applications of this model are proposed. These filters restored band-limited approximations of the original signals in real-time. In addition, redundancy is introduced into these restoration filters in order to suppress additive noise. Finally, an optimum filter that accounts for restoration error and additive noise is proposed.
In this paper, we present simulation algorithms among enhanced mesh models. The enhanced mesh models here include reconfigurable mesh and mesh with multiple broadcasting. A reconfigurable mesh (RM) is a processor array that consists of processors arranged to a 2-dimensional grid with a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors during the execution of programs. A horizontal-vertical RM (HV-RM) is obtained from the general RM model, by restricting the network topology it can take to the ones in which each bus segment must be along row or column. A mesh with multiple broadcasting (MWMB) is an enhanced mesh, which has additional broadcasting buses endowed to every row and column. We present two algorithms:1) an algorithm that simulates a HV-RM of size nn time-optimally in θ(n) time on a MWMB of size nn, and 2) an algorithm that simulates a RM of size nn in θ(log2 n) time on a HV-RM of size nn. Both algorithms use a constant number of storage in each processor. Furthermore, we show that a RM of size nn can be simulated in θ((n/m)2 log n log m) time on a HV-RM of size mm, in θ ((n/m)2 m log n log m) time on a MWMB of size mm (m < n). These simulations use θ((n/m)2) storage in each processor, which is optimal.
Dynamical theory of cellular automata on groups is developed. Main results are non-Euclidean extensions of Sato and Honda's results on the dynamics of Euclidean cellular automata. The notion of the period of a configuration is redefined in a more group theoretical way. The notion of a co-finite configuration substitutes the notion of a periodic configuration, where the new term is given to it to reflect and emphasize the importance of finiteness involved. With these extended or substituted notions, the relations among period preservablity, injectivity, and Poisson stability of parallel maps are established. Residually finite groups are shown to give a nice topological property that co-finite configurations are dense in the configuration space.
In order to improve the efficiency of the feature extraction of backpropagation (BP) learning in layered neural networks, model switching for changing the function model without altering the map is proposed. Model switching involves map preserving reduction of units by channel fusion, or addition of units by channel installation. For reducing the model size by channel fusion, two criteria for detection of the redundant channels are addressed, and the local link weight compensations for map preservation are formulated. The upper limits of the discrepancies between the maps of the switched models are derived for use as the unified criterion in selecting the switching model candidate. In the experiments, model switching is used during the BP training of a layered network model for image texture classification, to aid its inefficiency of feature extraction. The results showed that fusion and re-installation of redundant channels, weight compensations on channel fusion for map preservation, and the use of the unified criterion for model selection are all effective for improved generalization ability and quick learning. Further, the possibility of using model switching for concurrent optimization of the model and the map will be discussed.
Hiroki TAKAHASHI Masayuki NAKAJIMA
In pattern recognition using neural networks, it is very difficult for researchers or users to design optimal neural network architecture for a specific task. It is possible for any kinds of neural network architectures to obtain a certain measure of recognition ratio. It is, however, difficult to get an optimal neural network architecture for a specific task analytically in the recognition ratio and effectiveness of training. In this paper, an evolutional method of training and designing feedforward neural networks is proposed. In the proposed method, a neural network is defined as one individual and neural networks whose architectures are same as one species. These networks are evaluated by normalized M. S. E. (Mean Square Error) which presents a performance of a network for training patterns. Then, their architectures evolve according to an evolution rule proposed here. Architectures of neural networks, in other words, species, are evaluated by another measurement of criteria compared with the criteria of individuals. The criteria assess the most superior individual in the species and the speed of evolution of the species. The species are increased or decreased in population size according to the criteria. The evolution rule generates a little bit different architectures of neural network from superior species. The proposed method, therefore, can generate variety of architectures of neural networks. The designing and training neural networks which performs simple 3 3 and 4 4 pixels which include vertical, horizontal and oblique lines classifications and Handwritten KATAKANA recognitions are presented. The efficiency of proposed method is also discussed.
This paper demonstrates the necessity of special handling mechanisms for type (or sort) information when learning logic programs on the basis of background knowledge that includes type hierarchy. We have developed a novel relational learner RHB, which incorporates special operations to handle the computing of the least general generalization (lgg) of examples and the code length of logic programs with types. It is possible for previous learners, such as FOIL, GOLEM and Progol, to generate logic programs that include type information represented as is_a relations. However, this expedient has two problems: one in the computation of the code length and the other in the performance. We will illustrate that simply adding is_a relations to background knowledge as ordinary literals causes a problem in computing the code length of logic programs with is_a literals. Experimental results on artificial data show that the learning speed of FOIL exponentially slows as the number of types in the background knowledge increases. The hypotheses generated by GOLEM are about 30% less accurate than those of RHB. Furthermore, Progol is two times slower than RHB. Compared to the three learners, RHB can efficiently handle about 3000 is_a relations while still achieving a high accuracy. This indicates that type information should be specially handled when learning logic programs with types.
Yu-Luen CHEN Ying-Ying SHIH Walter H. CHANG Fuk-Tan TANG May-Kuen WONG Te-Son KUO
This paper reports on the development of an eyeglass-type infrared-controlled telephone communication interface for the disabled. This system is comprised of four major components: A) a headset; B) an infrared transmitting module; C) an infrared receiving/signal-processing module; and D) a main controller, the Intel-8951 microprocessor. The headset with a tongue-touch panel, a wireless earphone, and a wireless microphone. The infrared transmitting module utilizes a tongue touch panel via tongue-touch circuitry which is converted to an infrared beam and a low power laser (<0.1 mW) beam. The infrared receiving/signal-processing module, receives the infrared beam and fine tunes the unstable infrared beam into standard pulses which are used as control signals. The main controller is responsible for detecting the input signals from the infrared receiving/signal-processing module and verifying these signals with the mapping table in its memory. After the signal is verified, it is released to control the keys of the telephone interface. This design concept was mainly based on the idea that the use of an infrared remote module fastened to the eyeglasses could allow the convenient control of the dialing motion on the keys of a telephone's dialing-pad which are all modified with infrared receiving/signal-processing modules. The disabled are competent for some of work, such as a telephone operator. The increase of opportunity to do a job for the disabled would help them live independently.
Abbas SANDOUK Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
In this paper, we consider an integrated voice and data system over CDMA Slotted-ALOHA (CDMA S-ALOHA). We investigate its performance when multi-code CDMA (MC-CDMA) is applied as a multi-rate scheme to support users which require transmission with different bit rates. Two different classes of data users are transmitted together with voice. Performance measurement is obtained in respect of throughput for data and outage probability for voice. Moreover, we consider the Modified Channel Load Sensing Protocol (MCLSP) as a traffic control to improve the throughput of data. As a result, we show that the MC-CDMA technique is an effective one to obtain good throughput for data users at an acceptable voice outage probability. Furthermore, we show that with MCLSP, the throughput of data can be improved to reach a constant value even at a high offered load of data users.
Haruo OGIWARA Voltaire Balisnomo BAJO
Iterative decoding of serially concatenated code is extended to punctured trellis-coded modulation. A system configuration, a decoding algorithm and a performance evaluation method are proposed. It realizes a total coding rate of m/(m+1) by puncturing parity bits. Simulation results indicate that the proposed system shows no flattening effect which is observed in parallel concatenated system and realizes BER of 10-6 at Eb/N0=4.43 dB even with a small interleaver of size 2047.
Youngjin MOON Changhwan OH Kiseon KIM
This paper proposes a novel MAC scheme over APON based on the cell arrival timing information to provide residential and small business customers with multimedia services. The proposed scheme supports the frame format of ITU-T recommendation G.983 and also provides diverse ATM service classes such as CBR, rtVBR, nrtVBR, ABR, and UBR traffics. Each service is allocated on the basis of priority and cell arrival timing information. Especially, the CBR and rtVBR services, which are sensitive to delay and CDV, are allocated with higher priority and more exact arrival timing resolution which is achieved with specific coding and ranging procedure. For the proposed MAC scheme, we present grant field format, minislot format, and bandwidth allocation algorithm. Computer simulation results show that the performance of the proposed scheme is significantly improved in terms of CDV and delay time in case of CBR and rtVBR services, comparing with the normal FIFO scheme.
Jiunn-Ming HUANG Jeng-Long LEOU Shyh-Kang JENG Jenn-Hwan TARNG
Effective wavelets to solve electromagnetic integral equations are proposed. It is based on the same construction procedure as Daubechies wavelets but with mix-phase to obtain maximum sparsity of moment matrix. These new wavelets are proved to have excellent performance in non-zero elements reduction in comparison with minimum-phase wavelet transform (WT). If further sparsity is concerned, wavelet packet (WP) transform can be applied but increases the computational complexity. In some cases, the capability of non-zero elements reduction by this new wavelets even better than WP with minimum-phase wavelets and with less computational efforts. Numerical experiments demonstrate the validity and effectiveness of the new wavelets.
Ken'ichi KAWANISHI Yoshitaka TAKAHASHI Toyofumi TAKENAKA
We propose a traffic measurement system which uses trap and polling methods. To obtain its performance we consider a queueing model with a single server and evaluate a packet delay. In our multi-cast traffic, packets are modeled as a batch with a batch size distribution {gk}. The batch arrival process is observed as two processes on the basis of batch size. For a batch whose size is more than or equal to a threshold L, the batch will be trapped by our traffic measurement system (in queueing model, it will enter a queue immediately after its arrival). For a batch whose size is less than L, it will be observed at a polling cycle T (in queueing model, it will be temporarily stored in a buffer and all these small batches will be cyclically noticed with a cycle T). We analyze this queueing model by a diffusion approximation and compare the packet delay observed by our traffic measurement system with the L=1 original batch arrival model. Evaluating the results of the diffusion approximation, we illustrate that our traffic measurement system has functions not only to give an accurate estimation of the mean waiting time but also reduce the number of measurements by choosing appropriate parameters L and T.