Susumu NAKAZAWA Shoji TANAKA Kazuyoshi SHOGEN
Satellite broadcasting in the 21-GHz band is expected to transmit large-capacity signals such as ultrahigh-definition TV. However, this band suffers from large amounts of rain attenuation. In this regard, we have been studying rain fading mitigation techniques, in which the radiation power is increased locally in the area of heavy rainfall. To design such a satellite broadcasting system, it is necessary to evaluate service availability when using the locally increased beam technique. The rain attenuation data should be derived from the rainfall rate data. We developed a method to transform rainfall rate into rain attenuation in the 21 GHz band. Then, we performed a simulation that applied the method to the analysis of the service availability for an example phased array antenna configuration. The results confirmed the service availability increased with the locally increased beam technique.
GaoYun AN JiYing WU QiuQi RUAN
In order to overcome the drawback of TVQI and to utilize the property of dimensionality increasing techniques, a novel model for Kernel TV-based Quotient Image employing Gabor analysis is proposed and applied to face recognition with only one sample per subject. To deal with illumination outliers, an enhanced TV-based quotient image (ETVQI) model is first adopted. Then for preprocessed images by ETVQI, a bank of Gabor filters is built to extract features at specified scales and orientations. Lastly, KPCA is introduced to extract final high-order and nonlinear features of extracted Gabor features. According to experiments on the CAS-PEAL face database, our model could outperform Gabor-based KPCA, TVQI and Gabor-based TVQI when they face most outliers (illumination, expression, masking etc.).
Jungsuk SONG Kenji OHIRA Hiroki TAKAKURA Yasuo OKABE Yongjin KWON
Intrusion detection system (IDS) has played a central role as an appliance to effectively defend our crucial computer systems or networks against attackers on the Internet. The most widely deployed and commercially available methods for intrusion detection employ signature-based detection. However, they cannot detect unknown intrusions intrinsically which are not matched to the signatures, and their methods consume huge amounts of cost and time to acquire the signatures. In order to cope with the problems, many researchers have proposed various kinds of methods that are based on unsupervised learning techniques. Although they enable one to construct intrusion detection model with low cost and effort, and have capability to detect unforeseen attacks, they still have mainly two problems in intrusion detection: a low detection rate and a high false positive rate. In this paper, we present a new clustering method to improve the detection rate while maintaining a low false positive rate. We evaluated our method using KDD Cup 1999 data set. Evaluation results show that superiority of our approach to other existing algorithms reported in the literature.
Yuichiro HEI Tomohiko OGISHI Shigehiro ANO Toru HASEGAWA
It is important to monitor routing protocols to ensure IP networks and their operations can maintain sufficient level of stability and reliability because IP routing is an essential part of such networks. In this paper, we focus on Open Shortest Path First (OSPF), a widely deployed intra-domain routing protocol. Routers running OSPF advertise their link states on Link State Advertisements (LSAs) as soon as they detect changes in their link states. In IP network operations, it is important for operators to ascertain the location and type of a failure in order to deal with failures adequately. We therefore studied IP network failure identification based on the monitoring of OSPF LSAs. There are three issues to consider in regard to identifying network failures by monitoring LSAs. The first is that multiple LSAs are flooded by a single failure. The second is the LSA delay, and the third is that multiple failures may occur simultaneously. In this paper, we propose a method of network failure identification based on a detailed analysis of OSPF LSA flooding that takes into account the above three issues.
This paper proposes a spectroscopic method and system for preventing spoofing of biometric authentication. One of its focus is to enhance biometrics authentication with a spectroscopic method in a multi-factor manner such that a person's unique 'spectral signatures' or 'spectral factors' are recorded and compared in addition to a non-spectroscopic biometric signature to reduce the likelihood of imposter getting authenticated. By using the 'spectral factors' extracted from reflectance spectra of real fingers and employing cluster analysis, it shows how the authentic fingerprint image presented by a real finger can be distinguished from an authentic fingerprint image embossed on an artificial finger, or molded on a fingertip cover worn by an imposter. This paper also shows how to augment two widely used biometrics systems (fingerprint and iris recognition devices) with spectral biometrics capabilities in a practical manner and without creating much overhead or inconveniencing their users.
Jae-Sik KIM Eui-Sun CHOI Young-Hie LEE Ki-Won RYU
In this study, the microwave dielectric properties of the Mg4Ta2O9 and Mg5Ta4O15 ceramics with composition ratio and sintering temperature were investigated and the dielectric resonators with these ceramics were simulated. TiO2 was doped in the Mg4Ta2O9 ceramics for improvement of temperature property. The (1-x)Mg4Ta2O9-xTiO2 and Mg5Ta4O15 ceramics were prepared by solid-state reaction method. According to the X-ray diffraction data, the (1-x)Mg4Ta2O9-xTiO2 ceramics had main phase of the Mg4Ta2O9 and MgTi2O5 peaks were appeared by additions of TiO2. In the Mg5Ta4O15 ceramics, the Mg4Ta2O9 and MgTa2O6 phase were coexisted and Mg5Ta4O15 phase was appeared with increments of sintering temperature. Microwave dielectric properties of (1-x)Mg4Ta2O9-xTiO2 ceramics were affected by MgTi2O5 and TiO2 phase. The quality factor had a little decrement compared to pure Mg4Ta2O9, but there was excellent improvement in TCRF by addition of TiO2. Densifications of the Mg4Ta2O9 and MgTa2O6 and existence of the Mg5Ta4O15 phase had influence on the microwave dielectric properties of the Mg5Ta4O15 ceramics. Dielectric constant, quality factor and TCRF of the (1-x)Mg4Ta2O9-xTiO2 and Mg5Ta4O15 ceramics sintered at 1450 were 11.5622.5, 24980186410 GHz, -36.02+19.72 ppm/ and 8.2, 89473 GHz, -10.91 ppm/, respectively. ADS was used for simulation of DR. The simulated DR with the 0.5Mg4Ta2O9-0.5TiO2 and Mg5Ta4O15 ceramics had the S21 of -35.034 dB at 11.97 GHz and -28.493 dB at 10.50 GHz, respectively.
Mousa SHAMSI Reza Aghaiezadeh ZOROOFI Caro LUCAS Mohammad Sadeghi HASANABADI Mohammad Reza ALSHARIF
Facial skin detection is an important step in facial surgical planning like as many other applications. There are many problems in facial skin detection. One of them is that the image features can be severely corrupted due to illumination, noise, and occlusion, where, shadows can cause numerous strong edges. Hence, in this paper, we present an automatic Expectation-Maximization (EM) algorithm for facial skin color segmentation that uses knowledge of chromatic space and varying illumination conditions to correct and segment frontal and lateral facial color images, simultaneously. The proposed EM algorithm leads to a method that allows for more robust and accurate segmentation of facial images. The initialization of the model parameters is very important in convergence of algorithm. For this purpose, we use a method for robust parameter estimation of Gaussian mixture components. Also, we use an additional class, which includes all pixels not modeled explicitly by Gaussian with small variance, by a uniform probability density, and amending the EM algorithm appropriately, in order to obtain significantly better results. Experimental results on facial color images show that accurate estimates of the Gaussian mixture parameters are computed. Also, other results on images presenting a wide range of variations in lighting conditions, demonstrate the efficiency of the proposed color skin segmentation algorithm compared to conventional EM algorithm.
Yasuhiro OHARA Hiroyuki KUSUMOTO Osamu NAKAMURA Jun MURAI
Failure avoidance capability is a desired feature for telecommunication networks, such as the Internet. However, not all failures can be promptly bypassed on the Internet because routing systems that are responsible for detecting and avoiding failures cannot detect all failures. Consequently, failures can interrupt internet communications for a long time, such as a few hours. This paper proposes a novel routing architecture called Drouting that enables flexible failure avoidance. In Drouting, routers calculate multipaths from a source to a destination by constructing Directed Acyclic Graphs (DAGs) that include all links in the intra-domain network graph. IP packets carry packet tags that are set by the end host. The packet tags are used to select a network path from the multipath routes. In this paper, the failure avoidance property of Drouting architecture is evaluated through comparison with another proposal, Deflection, using simulations. Simulations were performed on inferred and synthetic topologies. Drouting exhibits similar performance with Deflection in terms of the number of nexthops, the number of paths and the length of paths, while Drouting outperforms Deflection in the probability of success of failure avoidance.
Sangjin HAN Sungjin LEE Sanghoon LEE Yeonsoo KIM
This paper presents a coexistence model of IEEE 802.15.4 with IEEE 802.11b interference in fading channels and proposes two adaptive channel allocation schemes. The first avoids the IEEE 802.15.4 interference only and the second avoids both of the IEEE 802.15.4 and IEEE 802.11b interferences. Numerical results show that the proposed algorithms are effective for avoiding interferences and for maximizing network capacity since they select a channel which gives the maximum signal to noise ratio to the system.
Akinobu MAEJIMA Shuhei WEMLER Tamotsu MACHIDA Masao TAKEBAYASHI Shigeo MORISHIMA
We have developed a visual entertainment system called "Future Cast" which enables anyone to easily participate in a pre-recorded or pre-created film as an instant CG movie star. This system provides audiences with the amazing opportunity to join the cast of a movie in real-time. The Future Cast System can automatically perform all the processes required to make this possible, from capturing participants' facial characteristics to rendering them into the movie. Our system can also be applied to any movie created using the same production process. We conducted our first experimental trial demonstration of the Future Cast System at the Mitsui-Toshiba pavilion at the 2005 World Exposition in Aichi Japan.
Jang-Won LEE Mung CHIANG A. Robert CALDERBANK
We use the network utility maximization (NUM) framework to create an efficient and fair medium access control (MAC) protocol for wireless networks. By adjusting the parameters in the utility objective functions of NUM problems, we control the tradeoff between efficiency and fairness of radio resource allocation through a rigorous and systematic design. In this paper, we propose a scheduling-based MAC protocol. Since it provides an upper-bound on the achievable performance, it establishes the optimality benchmarks for comparison with other algorithms in related work.
This paper describes a novel approach for detecting fault-prone modules using a spam filtering technique. Fault-prone module detection in source code is important for the assurance of software quality. Most previous fault-prone detection approaches have been based on using software metrics. Such approaches, however, have difficulties in collecting the metrics and constructing mathematical models based on the metrics. Because of the increase in the need for spam e-mail detection, the spam filtering technique has progressed as a convenient and effective technique for text mining. In our approach, fault-prone modules are detected in such a way that the source code modules are considered text files and are applied to the spam filter directly. To show the applicability of our approach, we conducted experimental applications using source code repositories of Java based open source developments. The result of experiments shows that our approach can correctly predict 78% of actual fault-prone modules as fault-prone.
Toru EZAWA Hiroo SEKIYA Takashi YAHAGI
This paper investigates the design curves of the class DE amplifier with the nonlinear shunt capacitances for any output Q and any grading coefficient m of the diode junction in the MOSFET. The design curves are derived by the numerical calculation using Spice. The results of this paper have two important meanings. Firstly, it is clarified that the nonlinearities of the shunt capacitances affect the design curves of the class DE amplifier, especially, for low output Q. Moreover, the supply voltage is a quite important parameter to design the class DE amplifier with the nonlinear shunt capacitances. Secondly, it is also clarified that the numerical design tool using Spice, which is proposed by authors, can be applied to the derivation of the design curves. This shows the possibility of the algorithm to be a powerful tool for the analysis of the class E switching circuits. The waveforms from Spice simulations denote the validity of the design curves.
This paper proposes an efficient systolic array construction method for optimal planar systolic design of the matrix multiplication. By connection network adjustment among systolic array processing element (PE), the input/output data are jumping in the systolic array for multiplication operation requirements. Various 2-D systolic array topologies, such as square topology and hexagonal topology, have been studied to construct appropriate systolic array configuration and realize high performance matrix multiplication. Based on traditional Kung-Leiserson systolic architecture, the proposed "Jumping Systolic Array (JSA)" algorithm can increase the matrix multiplication speed with less processing elements and few data registers attachment. New systolic arrays, such as square jumping array, redundant dummy latency jumping hexagonal array, and compact parallel flow jumping hexagonal array, are also proposed to improve the concurrent system operation efficiency. Experimental results prove that the JSA algorithm can realize fully concurrent operation and dominate other systolic architectures in the specific systolic array system characteristics, such as band width, matrix complexity, or expansion capability.
Fair queueing is a service scheduling discipline to pursue the fairness among users in packet communication networks. Many fair queueing algorithms, however, have problems of computational overhead since the central scheduler has to maintain a certain performance counter for each flow of user packets based on the global virtual time. Moreover, they are not suitable for wireless networks with high probability of input channel errors due to the lack or complexity in the compensation mechanism for the recovery from the error state. In this paper, we propose a new, computationally efficient, distributed fair queueing scheme, which we call Channel-Aware Throughput Fair Queueing (CATFQ), that is applicable to both wired and wireless packet networks. In our CATFQ scheme, each flow is equipped with a counter that measures the weighted throughput achievement while it has a backlog of packets. At the end of every service to a packet, the scheduler simply selects a flow with the minimum counter value as the one from which a packet is served next. We show that the difference between any two throughput counters is bounded. Our scheme significantly reduces the scheduler's computational overhead and guarantees fair throughput for all flows. For wireless networks with error-prone channels, the service chance lost in bad channel condition is compensated quickly as the channel recovers. Our scheme suppresses the service for leading flows, brings short-term fairness for flows without channel errors, and achieves long-term fairness for all flows. These merits are verified by simulation.
Shin-ichi OHKAWA Hiroo MASUDA Yasuaki INOUE
We have proposed a random curved surface model as a new mathematical concept which enables the expression of spatial correlation. The model gives us an appropriate methodology to deal with the systematic components of device variation in an LSI chip. The key idea of the model is the fitting of a polynomial to an array of Gaussian random numbers. The curved surface is expressed by a new extension from the Legendre polynomials to form two-dimensional formulas. The formulas were proven to be suitable to express the spatial correlation with reasonable computational complexity. In this paper, we show that this approach is useful in analyzing characteristics of device variation of actual chips by using experimental data.
Yoshihisa TAKAHASHI Kentaro HIRAKI Hisakazu KIKUCHI Shogo MURAMATSU
This paper presents a color demosaicing method applied to the Bayer pattern color filter array (CFA). Reliable estimation of an edge direction, edge-directed asymmetric interpolation, and the use of color samples at immediate neighbors are considered as the key guidelines for smooth and sharp image restoration. Also, special interest is directed to local areas that are rich in high spatial frequency variations. For suppression of false colors likely to occur in those areas, a hue vector representation is introduced so that the spatial correlation between different color components may be exploited in consistent with the local constant-hue principle. Smoothing is repeated in the hue vector field a few times. Experimental results have shown preferable performances in terms of PSNR, CIELAB color difference, hue angle difference, CIE chromaticity and visual appearance, in particular resulting in less false colors.
This paper presents a novel high-speed, low-complexity two-parallel 128-point radix-24 FFT/IFFT processor for MB-OFDM ultrawideband (UWB) systems. The proposed high-speed, low-complexity FFT architecture can provide a higher throughput rate and low hardware complexity by using a two-parallel data-path scheme and a single-path delay-feedback (SDF) structure. The radix-24 FFT algorithm is also realized in our processor to reduce the number of complex multiplications. The proposed FFT/IFFT processor has been designed and implemented with 0.18-µm CMOS technology in a supply voltage of 1.8 V. The proposed two-parallel FFT/IFFT processor has a throughput rate of up to 900 Msample/s at 450 MHz while requiring much smaller hardware complexity and low power consumption.
Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.
Likun ZOU Qing CHANG Chundi XIU Qishan ZHANG
In order to estimate fast time-varying channels exactly, the Inter-Carrier Interference (ICI) caused by time-varying fading channels in Orthogonal Frequency Division Multiplexing (OFDM) systems is analyzed based on the Basis Expansion Model (BEM). A channel estimation and ICI cancellation algorithm with low complexity is proposed. A special pilot sequence is designed to minimize the cost of computing the channel state information in the proposed algorithm. Based on the property of channel frequency impulse matrix, the ICI can be canceled iteratively in frequency domain. The complexity of the algorithm is analyzed theoretically. Through simulation, the algorithm is shown to be effective in estimating channel state information and in cancelling ICI.