In this paper, we propose a set of constraints for adaptive broad-band beamforming in the presence of angular errors. We first present spatial and frequency derivative constraints (SFDC) for the design of the quiescent beamformer response. With the wavelet-based blocking matrices, the proposed generalized sidelobe canceller (GSC) preserves the desired signal, and it is less sensitive to the broad-band noise. To make this beamformer more robust to the directional mismatch, we add a pseudo-interference algorithm in the weight adaptive process. Analysis and simulation results demonstrate that the angular beamwidth is insensitive to the input signal-to-noise ratio (SNR).

Background modeling is one of the most challenging and time consuming tasks in motion detection from video sequence. This paper presents a background independent moving object segmentation algorithm utilizing the spatio-temporal information of the last three frames. Existing three-frame based methods face challenges due to the insignificant gradient information in the overlapping region of difference images and edge localization errors. These methods extract scattered moving edges and experience poor detection rate especially when objects with slow movement exist in the scene. Moreover, they are not much suitable for moving object segmentation and tracking. The proposed method solves these problems by representing edges as segments and applying a novel segment based flexible edge matching algorithm which makes use of gradient accumulation through distance transformation. Due to working with three most recent frames, the proposed method can adapt to changes in the environment. Segment based representation facilitates local geometric transformation and thus it can make proper use of flexible matching to provide an effective solution for tracking. To segment the moving object region from the detected moving edges, we introduce a watershed based algorithm followed by an iterative background removal procedure. Watershed based segmentation algorithm helps to extract moving object with more accurate boundary which eventually achieves higher coding efficiency in content based applications and ensures a good visual quality even in the limited bit rate multimedia communication.

This paper reviews our recent progress on arrayed waveguide gratings (AWGs) using super-high-Δ silica-based planar lightwave circuit (PLC) technology and their application to integrated optical devices. Factors affecting the chip size of AWGs and the impact of increasing relative index difference Δ on the chip size are investigated, and the fabrication result of a compact athermal AWG using 2.5%-Δ silica-based waveguides is presented. As an application of super-high-Δ AWGs to integrated devices, a flat-passband multi/demultiplexer consisting of an AWG and cascaded MZIs is presented.

This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths, which may be shared with other parties, on a network of any topology. The technique can also be employed to obtain a lower-bound of the quantum communication complexity of some functions that depend on the inputs distributed over all parties on the network. As a typical application, we apply our technique to the distinctness problem of deciding whether there are a pair of parties with identical inputs, on a k-party ring; almost matching upper bounds are also given.

This paper proposes a method providing efficient test compression. The proposed method is for robust testable path delay fault testing with scan design facilitating two-pattern testing. In the proposed method, test data are interleaved before test compression using statistical coding. This paper also presents test architecture for two-pattern testing using the proposed method. The proposed method is experimentally evaluated from several viewpoints such as compression rates, test application time and area overhead. For robust testable path delay fault testing on 11 out of 20 ISCAS89 benchmark circuits, the proposed method provides better compression rates than the existing methods such as Huffman coding, run-length coding, Golomb coding, frequency-directed run-length (FDR) coding and variable-length input Huffman coding (VIHC).

The body area network (BAN) has attracted attention because of its potential for high-grade wireless communication technology and its safety and high durability. Also, human area transmission of a BAN propagating at an ultra-wide band (UWB) has been demonstrated recently. When considering the efficiency of electromagnetic (EM) propagation inside the human body for BAN and hyperthermia treatment using RF, it is important to determine the mechanism of EM dissipation in the human body. A body heating system for hyperthermia must deposit EM energy deep inside the body. Also, it is important that the EM field generated by the implant system is sufficiently strong. In this study, the specific absorption rate (SAR) distribution is simulated using an EM simulator to consider the biological transmission mechanism and its effects. To utilize the EM field distribution using an implant system for hyperthermia treatment, the SAR distribution inside the human body is simulated. As a result, the SAR distribution is concentrated on the surface of human tissue, the muscle-bolus interface, the pancreas, the stomach, the spleen and the regions around bones. It can also be concentrated in bone marrow and cartilage. From these results, the appropriate location for the implant system is revealed on the basis of the current distribution and differences in the wave impedance of interfacing tissues. The possibility of accurate data transmission and suitable treatment planning is confirmed.

This work elucidates the evolution of three generations of the laboratory information system in the National Taiwan University Hospital, which were respectively implemented in an IBM Series/1 minicomputer, a client/server and a plug-and-play HL7 interface engine environment respectively. The experience of using the HL7 healthcare information exchange in the hospital information system, laboratory information system, and automatic medical instruments over the past two decades are illustrated and discussed. The latest design challenge in developing intelligent laboratory information services is to organize effectively distributed and heterogeneous medical instruments through the message gateways. Such experiences had spread to some governmental information systems for different purposes in Taiwan; besides, the healthcare information exchange standard, software reuse mechanism, and application service provider adopted in developing the plug-and-play laboratory information system are also illustrated.

A new acceleration scheme that decreases the number of required iterations in relaxation methodology is proposed. The proposed scheme uses dynamic error prediction of an improved approximation to the solution during an iterative computation. The proposed scheme's application to circuit simulations required an average of 67.3% fewer iterations compared to un-accelerated relaxation methods.

The heterodyne laser interferometer acts as an ultra-precise measurement apparatus in semiconductor manufacture. However the periodical nonlinearity property caused from frequency cross-talk is an obstacle to improve the high measurement accuracy in nanometer scale. In order to minimize the nonlinearity error of the heterodyne interferometer, we propose a frequency cross-talk compensation algorithm using an artificial intelligence method. The feedforward neural network trained by back-propagation compensates the nonlinearity error and regulates to minimize the difference with the reference signal. With some experimental results, the improved accuracy is proved through comparison with the position value from a capacitive displacement sensor.

In this letter, we propose a hybrid authentication algorithm to alleviate the latent security problems of mobile multi-hop networks. The proposed scheme uses centralized authentication when a node first joins the network, and uses distributed authentication for the hop-by-hop authentication among multi-hop nodes. We also analyze performance of the proposed scheme.

This paper presents implementation techniques of fast Ate pairing of embedding degree 12. In this case, we have no trouble in finding a prime order pairing friendly curve E such as the Barreto-Naehrig curve y2=x3+a, a∈Fp. For the curve, an isomorphic substitution from G2 ⊂ E(Fp12 into G'2 in subfield-twisted elliptic curve E'(Fp2) speeds up scalar multiplications over G2 and wipes out denominator calculations in Miller's algorithm. This paper mainly provides about 30% improvement of the Miller's algorithm calculation using proper subfield arithmetic operations. Moreover, we also provide the efficient parameter settings of the BN curves. When p is a 254-bit prime, the embedding degree is 12, and the processor is Pentium4 (3.6 GHz), it is shown that the proposed algorithm computes Ate pairing in 13.3 milli-seconds including final exponentiation.

A static dependency pair method, proposed by us, can effectively prove termination of simply-typed term rewriting systems (STRSs). The theoretical basis is given by the notion of strong computability. This method analyzes a static recursive structure based on definition dependency. By solving suitable constraints generated by the analysis result, we can prove the termination. Since this method is not applicable to every system, we proposed a class, namely, plain function-passing, as a restriction. In this paper, we first propose the class of safe function-passing, which relaxes the restriction by plain function-passing. To solve constraints, we often use the notion of reduction pairs, which is designed from a reduction order by the argument filtering method. Next, we improve the argument filtering method for STRSs. Our argument filtering method does not destroy type structure unlike the existing method for STRSs. Hence, our method can effectively apply reduction orders which make use of type information. To reduce constraints, the notion of usable rules is proposed. Finally, we enhance the effectiveness of reducing constraints by incorporating argument filtering into usable rules for STRSs.

Eigen-beamforming (EB) transmission for multiple-input multiple-output (MIMO) systems is an effective means to maximize the receiver signal-to-noise ratio (SNR) in a noise-limited environment, but suffers a performance degradation when strong interference signals exist. In this letter, we propose an interference cancellation method for EB signals by constructing a new receive beamforming vector which jointly utilizes the EB matrix and minimum mean-square error (MMSE) spatial demultiplexing. The proposed method is shown to outperform the conventional EB receiver in the entire cell range, with a significant increase in the effective signal-to-interference plus noise ratio (SINR) near the cell boundary.

The purpose of this study is the real-time estimation of Doppler spectral moments for precipitation in the presence of ground clutter overlap. The proposed method is a frequency domain approach that uses a Gaussian model both to remove clutter spectrum and to estimate weather spectrum. The main advantage of this method is that it does not use processes like several fitting procedures and enables to estimate profiles of precipitation in a short processing time. Therefore this method is efficient for real-time radar observation with high range and time resolution. The performance of this method is evaluated based on simulation data and the observation data acquired by the Ku-band broad band radar (BBR) [1].

This paper investigates and analyzes the resistive averaging network and interpolation technique to estimate the power consumption of preamplifier arrays in a flash analog-to-digital converter (ADC). By comparing the relative power consumption of various configurations, flash ADC designers can select the most power efficient architecture when the operation speed and resolution of a flash ADC are specified. Based on the quantitative analysis, a compact 5-bit flash ADC is designed and fabricated in a 0.13-µm CMOS process. The proposed ADC consumes 180 mW from a 1.2-V supply and occupies 0.16-mm2 active area. Operating at 3.2 GS/s, the ENOB is 4.44 bit and ERBW 1.65 GHz. At 4.2 GS/s, the ENOB is 4.20 bit and ERBW 1.75 GHz. This ADC achieves FOMs of 2.59 and 2.80 pJ/conversion-step at 3.2 and 4.2 GS/s, respectively.

The wireless systems that establish multiple input multiple output (MIMO) channels through multiple antennas at both ends of the communication link, have been proved to have tremendous potential to linearly lift the capacity of conventional scalar channel. In this paper, we present two efficient decision feedback equalization algorithms that achieve optimal and suboptimal detection order in MIMO spatial multiplexing systems. The new algorithms combine the recursive matrix inversion and ordered QR decomposition approaches, which are developed for nulling cancellation interaface Bell Labs layered space time (BLAST) and back substitution interface BLAST. As a result, new algorithms achieve total reduced complexities in frame based transmission with various payload lengths compared with the earlier methods. In addition, they enable shorter detection delay by carrying out a fast hybrid preprocessing. Moreover, the operation precision insensitivity of order optimization greatly relaxes the word length of matrix inversion, which is the most computational intensive part within the MIMO detection task.

An adaptive zero forcing maximum likelihood soft input soft output (AZFML-SISO) detector for multiple input multiple output (MIMO) wireless systems is presented. Its performance in an iterative MIMO receiver is analyzed. The AZFML-SISO detector calculates the soft outputs, applying the ML approach to the list that contains only those signal vectors limited by a hypersphere around the zero forcing (ZF) solution. The performance of the algorithm is evaluated on a communication system based on the standard for single carrier broadband wireless communication IEEE 802.16, with three transmit and three receive antennas. It is shown by computer simulation that the computational complexity in an average sense of the receiver running the AZFML-SISO algorithm is reduced by 90% at the SNR values of 30 dB and by 50% for SNR values of 15 dB in comparison to the receiver with an ML detector, while the system performance degrades by less than 1 dB.

Resource search is a fundamental problem in large-scale and highly dynamic Peer-to-Peer (P2P) systems. Unstructured search approaches are widely used because of their flexibility and robustness. However, such approaches incur high communication cost. The index-dissemination-based search is a kind of efficient unstructured search approach. We investigate such approaches with respect to minimize the system communication cost. Based on a dynamic system model that peers continuously leave and join, we solve two problems. One problem is how to efficiently disseminate and maintain a given number of indices. Another is to determine the optimal number of indices for each resource object of a given popularity. Finally, we propose an optimized index dissemination scheme which is fully decentralized and self-adaptive. A remarkable advantage is that the scheme yields no additional communication cost to achieve the self-adaptive feature.

Two-Terminal Series Parallel (TTSP, for short) graphs are used as data models in applications for electric networks and scheduling problems. We propose a TTSP term graph which is a TTSP graph having structured variables, that is, a graph pattern over a TTSP graph. Let TGTTSP be the set of all TTSP term graphs whose variable labels are mutually distinct. For a TTSP term graph g in TGTTSP, the TTSP graph language of g, denoted by L(g), is the set of all TTSP graphs obtained from g by substituting arbitrary TTSP graphs for all variables in g. Firstly, when a TTSP graph G and a TTSP term graph g are given as inputs, we present a polynomial time matching algorithm which decides whether or not L(g) contains G. The minimal language problem for the class LTTSP={L(g) | g ∈ TGTTSP} is, given a set S of TTSP graphs, to find a TTSP term graph g in TGTTSP such that L(g) is minimal among all TTSP graph languages which contain all TTSP graphs in S. Secondly, we give a polynomial time algorithm for solving the minimal language problem for LTTSP. Finally, we show that LTTSP is polynomial time inductively inferable from positive data.

Image matching is an important area of research in the field of artificial intelligence, machine vision and visual navigation. This paper presents a new image matching scheme suitable for visual navigation. In this scheme, gray scale images are sliced and quantized to form sub-band binary images. The information in the binary images is then signaturized to form a vector space and the signatures are sorted as per significance. These sorted signatures are then normalized to transform the represented image pictorial features in a rotation and scale invariant form. For the image matching these two vector spaces from both the images are compared in the transformed domain. This comparison yields efficient results directly in the image spatial domain avoiding the need of image inverse transformation. As compared to the conventional correlation, this comparison avoids the wide range of square error calculations all over the image. In fact, it directly guides the solution to converge towards the estimate given by the adaptive prediction for a high speed performance in an aerial video sequence. A four dimensional solution population scheme has also been presented with a matching confidence factor. This factor helps in terminating the iterations when the essential matching conditions have been achieved. The proposed scheme gives robust and fast results for normal, scaled and rotated templates. Speed comparison with older techniques shows the computational viability of this new technique and its much lesser dependence on image size. The method also shows noise immunity at 30 dB AWGN and impulsive noise.