In this paper, we present a general object tracking method based on a newly proposed pixel-wise clustering algorithm. To track an object in a cluttered environment is a challenging issue because a target object may be in concave shape or have apertures (e.g. a hand or a comb). In those cases, it is difficult to separate the target from the background completely by simply modifying the shape of the search area. Our algorithm solves the problem by 1) describing the target object by a set of pixels; 2) using a K-means based algorithm to detect all target pixels. To realize stable and reliable detection of target pixels, we firstly use a 5D feature vector to describe both the color ("Y, U, V") and the position ("x, y") of each pixel uniformly. This enables the simultaneous adaptation to both the color and geometric features during tracking. Secondly, we use a variable ellipse model to describe the shape of the search area and to model the surrounding background. This guarantees the stable object tracking under various geometric transformations. The robust tracking is realized by classifying the pixels within the search area into "target" and "background" groups with a K-means clustering based algorithm that uses the "positive" and "negative" samples. We also propose a method that can detect the tracking failure and recover from it during tracking by making use of both the "positive" and "negative" samples. This feature makes our method become a more reliable tracking algorithm because it can discover the target once again when the target has become lost. Through the extensive experiments under various environments and conditions, the effectiveness and efficiency of the proposed algorithm is confirmed.

The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming languages. Knuth and Bendix have proposed a procedure known as the KB procedure for generating a complete TRS. A TRS cannot, however, directly handle higher-order functions that are widely used in functional programming languages. In this paper, we propose a higher-order KB procedure that extends the KB procedure to the framework of a simply-typed term rewriting system (STRS) as an extended TRS that can handle higher-order functions. We discuss the application of this higher-order KB procedure to a certification technique called inductionless induction used in program verification, and its application to fusion transformation, a typical kind of program transformation.

Minimizing the Side Lobe Level (SLL) and attain highest achievable Beam Collection Efficiency (BCE) is a critical goal for Solar Power Station/Satellite (SPS). If all antennas are uniformly excited then the main beam will carry only a part of the total energy due to the higher SLL. SLL is decreased and BCE is increased by adopting edge tapering for SPS. But edge tapering is a complex technical problem for SPS. So an optimization is needed between uniform amplitude distribution and edge tapering system. We have derived a new method of edge tapering called Isosceles Trapezoidal Distribution (ITD) edge tapering. Only a small number of antennas from each side of the phased array antenna are tapered in this method. ITD edge tapering is almost uniform so it is technically better. We have compared different amplitude distribution systems; uniform, Gaussian, Dolph-Chebyshev and the newly derived ITD method. The SLL reduction in ITD is even lower than those of other kinds of edge tapering. Therefore the amount of losing power in the SLL in ITD is lower. As a result the interference level becomes lower and BCE becomes higher in this method. The higher BCE and better SLL performance than those with uniform distribution can be achieved in ITD with phase error and under unit failed condition.

For more efficient data transmissions, a new MLP/BP-based channel equalizer is proposed to compensate for multi-path fading in wireless applications. In this work, for better system performance, we apply the soft output and the soft feedback structure as well as the soft decision channel decoding. Moreover, to improve packet error rate (PER) and bit error rate (BER), we search for the optimal scaling factor of the transfer function in the output layer of the MLP/BP neural networks and add small random disturbances to the training data. As compared with the conventional MLP/BP-based DFEs and the soft output MLP/BP-based DFEs, the proposed MLP/BP-based soft DFEs under multi-path fading channels can improve over 3-0.6 dB at PER=10-1 and over 3.3-0.8 dB at BER=10-3.

This paper proposes a novel signal estimation method that uses a tensor product expansion. When a bivariable function, which is expressed by two-dimensional matrix, is subjected to conventional tensor product expansion, two single variable functions are calculated by minimizing the mean square error between the input vector and its outer product. A tensor product expansion is useful for feature extraction and signal compression, however, it is difficult to separate global noise from other signals. This paper shows that global noise, which is observed in almost all input signals, can be estimated by using a tensor product expansion where absolute error is used as the error function.

A fully integrated broadband up-conversion mixer with low power consumption is demonstrated on 90 nm CMOS technology in this paper. This mixer has a single-ended input and a multi-layer stacked Marchand balun is used for converting the differential output of the single-balanced mixer topology to a single-ended output. This balun employs inductive coupling between two metal layers and includes slotted shields to reduce substrate losses. The circuit size is 650 µm570 µm. At 22.1 GHz, the integrated mixer achieves a conversion gain of 2 dB with a maximum power dissipation of only 11.1 mW from a 1.2 V dc power supply at LO power of 5 dBm. Input referred 1-dB compression point is -14.8 dBm. The LO and RF return loss are better than 10 dB for frequencies between 20-26 GHz.

The propagation characteristics of the leaky TE mode in a two-dimensional photonic crystal waveguide is analyzed using the Fourier series expansion method combined with the Chew's perfectly matched layer (PML). The complex propagation constant and mode field profiles are numerically tested in detail. It is shown that the leakage phenomena can be well modeled by choosing the PML parameters in proper range.

This study proposes a novel structure of index-guiding square photonic crystal fibers (SPCF) having simultaneously ultra-flattened chromatic dispersion characteristics and low confinement losses in a wide wavelength range. The finite difference method (FDM) with anisotropic perfectly matched layers (PMLs) is used to analyze the various properties of square PCF. The findings reveal that it is possible to design five-ring PCFs with a flattened negative chromatic dispersion of 0-1.5 ps/(nm.km) in a wavelength range of 1.27 µm to 1.7 µm and a flattened chromatic dispersion of 01.15 ps/(nm.km) in a wavelength range of 1.25 µm to 1.61 µm. Simultaneously it also exhibited that the confinement losses are less than 10-9 dB/m and 10-10 dB/m in the wavelength range of 1.25 µm to 1.7 µm.

In this paper, we address how to construct efficient retransmission trees for reliable multicast. Efficiency of retransmission trees mainly depends on locations of repairers, which are in charge of retransmitting lost packets. We propose an algorithm for each receiver to find a repairer for efficient recovery. The resulting tree for retransmission is organized by pairs of a receiver and a repairer which is the host "nearest" to the receiver among the multicast group members "nearer" to the sender. We formally prove that the proposed algorithm realizes reliable multicast with only constant times of a lower bound cost achievable through impractical router support. We also evaluate the algorithm through extensive simulations.

A novel ratio-oriented definition based on 2T2R (Two transistors & two phase change resistors) phase change memory (PCM) cell structure is proposed to gain a high density by multilevel storage. In this novel solution, no reference is needed and good robustness remains still as conventional 2T2R, which is crucial when feature size scales to nanometer technology node. A behavioral SPICE model together with a preliminary simulation proves the idea to be feasible, and further optimization has been carried out. In addition, based on the ratio-oriented definition, a simpler and faster Error Control Coding (ECC) can be realized with n-Error-detection feasible.

This paper addresses the problem of inter-domain QoS routing with Service Level Agreements (SLA) for data transport between peering domains, using virtual-trunk type aggregates. The problem is formally stated and formulated in Integer Linear Programming. As a practical solution, we define the QoS_INFO extension to the BGP routing protocol, conveying three different QoS metrics (light load delay, assigned bandwidth and a congestion alarm), and a path selection algorithm using a combination of these metrics. We present simulation results of QoS_INFO, standard BGP, and BGP with the QoS_NLRI extension, and compare them with the optimal route set provided by the ILP formulation. The results show that our proposal yields better QoS than standard BGP or BGP with the QoS_NLRI extension, since it is able to efficiently avoid congested paths, and that the impact of QoS_INFO in route stability is relatively low.

Time-frequency-selective, equivalently time-variant multipath, fading channels in orthogonal frequency division multiplexing (OFDM) systems introduce intercarrier interference (ICI), resulting in severe performance degradation. To suppress the effect of ICI, several symbol detection methods have been proposed, all of which are based on the observation that most of the ICI's power is distributed near the desired subcarrier. However, these methods usually ignore the channel variation in a OFDM symbol block by fixing the number of considered ICI terms. Therefore, we propose a novel frequency-domain symbol detection method with moderate complexity, which adaptively determines the number of ICI terms within each OFDM symbol block.

This letter proposes a broadcast scheme for use in ad hoc networks using variable-range transmission power. Preserving energy and ensuring a high delivery ratio of broadcast packets are crucial tasks for broadcasting in ad hoc networks. Using individual broadcast relaying nodes to dynamically vary the transmission range can help saving power and reduce interference during communication. We analyzed the performance of the proposed scheme and compared it to other prevalent broadcast schemes for wireless ad hoc networks based on common-range transmission power.

A normal-distribution-function-shaped superconducting tunnel junction (NDF-STJ) which consists of Nb/Al-AlOx/Al/Nb has been fabricated as an X-ray detector. Current - voltage characteristics were measured at 0.4 K using three kinds of STJs, which have the dispersion parameters σ of 0.25, 0.45 and 0.75. These STJs showed very low subgap leakage current of about 5 nA. By irradiating with 5.9 keV X-rays, we obtained the spectrum of these NDF-STJs. They showed good energy resolution with small magnetic fields of below 3 mT, which is about one-tenth of those for conventional-shaped STJs.

A new approach for solution of the Tensor-Volume Integral Equation (TVIE) using Galerkin-based moment method (MoM) for three-dimensional dielectric bodies is proposed. Two problems of plane wave scattering by a dielectric sphere and a thin-wire antenna in close proximity to a dielectric body are investigated. In both cases, cubic modeling is applied and a combination of entire-domain and sub-domain basis functions, including three-dimensional polynomial functions with different degrees is utilized for field expansion inside dielectric bodies. Power polynomial is adopted for this purpose and its property is discussed over the proposed mixed-domain MoM formulation. Numerical examples show that based on the proposed method, a relative fast algorithm and suitable accuracy are achieved compared with conventional MoM. The accuracy of the proposed method is verified by comparing it with the Mie theory, conventional MoM and the FDTD method.

The performance of a new APSK receiver is analyzed using numerical simulation. The proposed receiver eliminates the penalty caused by SPM-induced phase-shift of optical pulses by employing three sub-modules and an amplitude-pattern controlled switch for each DPSK tributary. The interplay between SPM, IXPM, and XPM determines the performance of the proposed receiver for single-channel and WDM transmission.

We propose a model for constructing a multilayered boundary in an information system to defend against intrusive anomalies by correlating a number of parametric anomaly detectors. The model formulation is based on two observations. First, anomaly detectors differ in their detection coverage or blind spots. Second, operating environments of the anomaly detectors reveal different information about system anomalies. The correlation among observation-specific anomaly detectors is first formulated as a Partially Observable Markov Decision Process, and then a policy-gradient reinforcement learning algorithm is developed for an optimal cooperation search, with the practical objectives being broader overall detection coverage and fewer false alerts. A host-based experimental scenario is developed to illustrate the principle of the model and to demonstrate its performance.

This paper proposes a two-dimensional self-matching receiver for Free Space Optics (FSO) communication system using chaotic spatial synchronization. This system is able to obtain the information of two-dimensional code from received pattern. This paper considers that proposed system is applied to two applications. The first application is image transmission. This paper shows that applying proposed system to image transmission enables to restore the desired image, which doesn't require strict alignment of receiver, and evaluates transmission optical power. The second application is Code Division Multiplexing (CDM). This paper shows that applying proposed system to CDM system enables to demodulate desired digital signals regardless of the uncertainty of received position. Moreover, the required transmission optical power and bit error rate performance are obtained by computer simulation.

Performance analysis of ultra-fast all-optical analog-to-digital converter using optical multiple-level thresholding module based on self-frequency shift in fiber is described. In analog-to-digital conversion, the purposes of optical sampling and optical quantization are in the possibility of the speed-up of sampling and quantization processes using various ultra-fast nonlinear phenomena depending on an intensity of a light. The result of analysis indicates that the number of achievable quantized levels of the proposed approach is in the increasing tendency with an increase in the peak power of an input pulse.

This paper presents an admission control technique for multi-carrier systems with an FRF(frequency reuse factor) of 1. The FRF of 1 is very attrative for more improved channel throughput but the forward link capacity is rapidly decreased at the cell boundary region due to the increase in the ICI(InterCell Interference). By measuring a region-based channel capacity and deriving a closed form of blocking probability, a QoS(Quality of Service) maintenance technique and mobility model can be acquired. In the simulation, the proposed scheme demonstrates a blocking probability reduction of up to 40% compared to the cell-based link capacity scheme.