We report an SRAM with a 90% reduction of active-leakage power achieved by controlling the supply voltage. In our design, the supply voltage of a selected row in the SRAM goes up to 1 V, while that in other memory cells that are not selected is kept at 0.3 V. This suppresses active leakage because of the drain-induced barrier lowering (DIBL) effect. To avoid unexpected flips in the memory cells, the wordline voltage is controlled so that it is always lower than the supply voltage in the proposed SRAM, with a self-alignment timing generator. The additional area overhead of the timing generator is 3.5%.

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.

In human-computer interaction, Fitts' law has been applied in one-dimensional pointing task evaluation for some decades, and the usage of effective target width (We) in Fitts' law has been accepted as an international standard in ISO standards 9241-9 [4]. However, the discussion on the concrete methods for calculating We has not been developed comprehensively nor have the different methods of calculation been integrated. Therefore, this paper focuses on a detailed description and a comparison of the two main We calculation methods. One method is mapping all the abscissa data in one united relative coordinate system to perform the calculation (called CC method) and the other is dividing the data into two groups and mapping them in two separate coordinate systems (called SC method). We tested the accuracy of each method and compared both methods in a highly controlled experiment. The experiments' results and data analysis show that the CC method is better than the SC method for human computer interface modeling. These results will be instrumental for future application of Fitts' law.

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.

We developed a selective-capacitance constant-charge-injection programming (CCIP) scheme to achieve high programming throughput in multilevel assist-gate (AG)-AND flash memories. In the conventional CCIP scheme, only one type of capacitance for storing programming charge was used for all levels of multilevel cells. The proposed scheme utilized multiple types of capacitance to minimize the programming time of all levels by using optimized capacitance values for each Vth level. In 4-Gbit AG-AND flash memories, a local bit line capacitance is utilized for mid-level programming, and the sum of local and global bit line capacitance is utilized for top-level programming. In addition, we developed a verify-less programming scheme which reduces top-level programming time because it is not necessary to verify the top-level of multilevel cells in AND flash memory architecture. A programming throughput of 10 MB/s is achieved using the proposed schemes. This is 1.6 times faster than the throughput with conventional CCIP.

Capacitive and inductive crosstalk noises are expected to be more serious in advanced technologies. However, capacitive and inductive crosstalk noises in the future have not been concurrently and sufficiently discussed quantitatively, though capacitive crosstalk noise has been intensively studied solely as a primary factor of interconnect delay variation. This paper quantitatively predicts the impact of capacitive and inductive crosstalk in prospective processes, and reveals that interconnect scaling strategies strongly affect relative dominance between capacitive and inductive coupling. Our prediction also makes the point that the interconnect resistance significantly influences both inductive coupling noise and propagation delay. We then evaluate a tradeoff between wire cross-sectional area and worst-case propagation delay focusing on inductive coupling noise, and show that an appropriate selection of wire cross-section can reduce delay uncertainty at the small sacrifice of propagation delay.

This paper proposes a new identifier scheme for Internet Indirection Infrastructure (i3). i3 is an overlay network on top of IP, and realizes rendezvous-based communications. It provides a general solution to deal with communication primitives such as host mobility, multicast and anycast. Although i3 provides flexible communication mechanisms, it is not optimized for mobile and wireless communications. Thus, three key problems still remain to be addressed: header overhead, multiple trigger updates and detection of a close i3 server after handover. The proposed identifier scheme, called local ID, significantly reduces the overhead without sacrificing the flexibility of i3. In a typical case, the local ID makes the total header size nearly half that of the original protocol. This paper also discusses how to adapt the local ID to various types of i3 primitives, so that a mobile host can receive all the benefits of i3 communications.

This paper addresses the issue of deafness in MAC (Medium Access Control) protocols for wireless ad hoc networks using directional antennas. Directional antennas are expected to provide significant improvements over omni-directional antennas in ad hoc networks, such as high spatial reuse and range extension. Recently, several MAC protocols using directional antennas, typically referred to as directional MAC protocols, have been proposed for ad hoc networks. However, directional MAC protocols inherently introduce new kinds of problems arising from directivity. One major problem is deafness, caused by a lack of state information of neighbor nodes, whether idle or busy. This paper proposes DMAC/DA (Directional MAC with Deafness Avoidance) to overcome the deafness problem. DMAC/DA modifies the previously proposed MAC protocol, MDA (MAC protocol for Directional Antennas), to reduce the number of control messages and also maintain the ability to handle deafness. In DMAC/DA, WTS (Wait To Send) frames are simultaneously transmitted by the transmitter and the receiver after the successful exchange of directional RTS (Request To Send) and CTS (Clear To Send) to notify the on-going communication to potential transmitters that may experience deafness. The experimental results show that DMAC/DA outperforms existing directional MAC protocols, such as DMAC (Directional MAC) and MDA, in terms of throughput, control overhead and packet drop ratio under the different values of parameters such as the number of flows and the number of beams. In addition, qualitative evaluation of 9 MAC protocols is presented to highlight the difference between DMAC/DA and existing MAC protocols.

From the introduction of CodeRed and Slammer worms, it has been learned that the early detection of worm epidemics is important in order to reduce the damage resulting from outbreaks. A prominent characteristic of Internet worms is the random selection of subsequent targets. In this paper, we propose a new worm detection mechanism by checking the random distribution of destination addresses in network traffic. The proposed mechanism constructs a matrix from network traffic and checks the rank of the matrix in order to detect the spreading of Internet worms. From the fact that a random binary matrix holds a high rank value, ADUR (Anomaly Detection Using Randomness check) is proposed for detecting unknown worms based on the rank of the matrix. From experiments on various environments, it is demonstrated that the ADUR mechanism effectively detects the spread of new worms in the early stages, even when there is only a single host infected in a monitoring network. Also, we show that ADUR is highly sensitive so that the worm epidemic can be detectable quickly, e.g., three times earlier than the infection of 90% vulnerable hosts.

Hierarchical Mobile IPv6 (HMIPv6) was designed to reduce the long handover time associated with MIPv6 by employing a hierarchy of Mobile Anchor Points (MAPs). However, the selection of MAP and its load status critically affect the system performance. Thus, in this paper, we introduce two novel dynamic MAP selection schemes for HMIPv6, that relieve overloaded MAPs as well as select a more suitable MAP according to each Mobile Node (MN)'s up-to-date mobility towards reducing inter-domain handover, resulting in saving the overall signaling cost. Further, we develop an analytical model of the average signaling cost for inter-domain handover to investigate the performance of another existing approach with its basis on IETF HMIPv6 as well as our schemes. We also perform simulations to evaluate the performance of our proposed schemes. It is shown via simulation and numerical results that the proposed dynamic MAP selection schemes can significantly reduce the number of inter-domain handovers and the average signaling cost as well as distribute load over multiple MAPs compared to the other existing approaches.

The model selection for neural networks is an essential procedure to get not only high levels of generalization but also a compact data model. Especially in terms of getting the compact model, neural networks usually outperform other kinds of machine learning methods. Generally, models are selected by trial and error testing using whole learning samples given in advance. In many cases, however, it is difficult and time consuming to prepare whole learning samples in advance. To overcome these inconveniences, we propose a hybrid on-line learning system for a radial basis function (RBF) network that repeats quick learning of novel instances by rote during on-line periods (awake phases) and repeats pseudo rehearsal for model selection during out-of-service periods (sleep phases). We call this system Incremental Learning with Sleep (ILS). During sleep phases, the system basically stops the learning of novel instances, and during awake phases, the system responds quickly. We also extended the system so as to shorten the periodic sleep periods. Experimental results showed the system selects more compact data models than those selected by other machine learning systems.

Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of the faulty elements is n-2 or less, and it has a fault-free Hamiltonian path between any pair of nonfaulty nodes if the number of the faulty elements is n-3 or less.

This paper proposes a maximum likelihood sequence estimation (MLSE) for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of fast frequency-flat fading channels. This method that linearly predicts the fading complex envelope derives its linear prediction coefficients by the method of Lagrange multipliers, and does not require data of decision-feedback or information on the channel parameters such as the maximum Doppler frequency in contrast to conventional ones. Computer simulations under fast fading conditions demonstrate that the proposed method with an appropriate degree of polynomial approximation is superior in BER performance to the conventional method that estimates the coefficients by the RLS algorithm using a training sequence.

A daisy chain of current-driven transmitters in inductive-coupling complementary metal oxide semiconductor (CMOS) links is presented. Transmitter power can be reduced since current is reused by multiple transmitters. Eight transceivers are arranged with a pitch of 20 µm in 0.18 µm CMOS. Transmitter power is reduced by 35% without sacrificing either the data rate (1 Gb/s/ch) or BER (<10-12) by using a 4-transmitter daisy chain. A coding technique for efficient use of daisy chain transmitters is also proposed. With the proposed coding technique, additional power reduction can be achieved.

The effects of wall reflection on indoor MIMO channel capacity are statistically investigated with consideration of the average received power, the effective degrees of freedom (EDOF) of multipaths and the eigenvalues of transfer channel covariance matrix. It is found that the stronger wall reflection can lead to higher MIMO channel capacity.

We propose a gradient-limited affine projection algorithm (GL-APA), which can achieve fast and double-talk-robust convergence in acoustic echo cancellation. GL-APA is derived from the M-estimation-based nonlinear cost function extended for evaluating multiple error signals dealt with in the affine projection algorithm (APA). By considering the nonlinearity of the gradient, we carefully formulate an update equation consistent with multiple input-output relationships, which the conventional APA inherently satisfies to achieve fast convergence. We also newly introduce a scaling rule for the nonlinearity, so we can easily implement GL-APA by using a predetermined primary function as a basis of scaling with any projection order. This guarantees a linkage between GL-APA and the gradient-limited normalized least-mean-squares algorithm (GL-NLMS), which is a conventional algorithm that corresponds to the GL-APA of the first order. The performance of GL-APA is demonstrated with simulation results.

Digital watermarking is a technique that aims at hiding a message signal in a multimedia signal for copyright claim, authentication, device control, or broadcast monitoring, etc. In this paper, we focus on embedding watermarks into still images, where the watermarks themselves can be binary sequences or grayscale images. We propose to scramble the watermark bits with pseudo-noise (PN) or orthogonal codes before they are embedded into an image. We also try to incorporate error correction coding (ECC) into the watermarking scheme, anticipating reduction of the watermark bit error rate (WBER). Due to the similarity between the PN/orthogonal-coded watermarking and the spread spectrum communication, it is natural that, following similar derivations regarding data BER in digital communications, we derive certain explicit quantitative relationships regarding the tradeoff between the WBER, the watermark capacity (i.e. the number of watermark bits) and the distortion suffered by the original image, which is measured in terms of the embedded image's signal-to-noise ratio (abbreviated as ISNR). These quantitative relationships are compactly summarized into a so-called tradeoff triangle, which constitutes the major contribution of this paper. For the embedding of grayscale watermarks, an unequal error protection (UEP) scheme is proposed to provide different degrees of robustness for watermark bits of different degrees of significance. In this UEP scheme, optimal strength factors for embedding different watermark bits are sought so that the mean squared error suffered by the extracted watermark, which is by itself a grayscale image, is minimized while a specified ISNR is maintained.

In this paper, Integration of Fractional Gaussian Window transform (IFRGWT) is proposed for the parameter estimation of linear FM (LFM) signal; the proposal is based on the integration of the Fractional Fourier transform modified by Gaussian Window. The peak values can be detected by adjusting the standard deviation of Gaussian function and locating the optimal rotated angles. And also the parameters of the signal can be estimated well. As an application, detection and parameter estimation of multiple LFM signals are investigated in low signal-to-noise ratios (SNRs). The analytic results and simulations clearly demonstrate that the method is effective.

In this paper we focus on the numerical simulation of the mixing behaviors of distributed superconducting junction arrays at 1.2 THz. A novel type of superconducting tunnel junctions, i.e., NbN/AlN/Nb, which have a relatively high gap voltage (4.3 mV) and can reach a critical current density as high as several tens of kA/cm2, are proposed for this characterization along with conventional Nb/AlOx/Nb junctions. The former is incorporated with a NbN/SiO2/Al tuning circuit, and the latter with a Nb/SiO2/Al and a NbTiN/SiO2/Al tuning circuits. The noise performance, local-oscillator power requirement, IF bandwidth, and optimum embedding impedance are thoroughly characterized for the two types of distributed superconducting junction arrays.

Recently, we proposed space-time block coded-joint transmit/receive antenna diversity (STBC-JTRD) for narrow band transmission in a frequency-nonselective fading channel; it allows an arbitrary number of transmit antennas while limiting the number of receive antennas to 4. In this paper, we extend STBC-JTRD to the case of frequency-selective fading channels and propose frequency-domain STBC-JTRD for broadband direct sequence-spread spectrum (DSSS) signal transmission. A conditional bit error rate (BER) analysis is presented. The average BER performance in a frequency-selective Rayleigh fading is evaluated by Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation of the signal transmission. Performance comparison between frequency-domain STBC-JTRD transmission and joint space-time transmit diversity (STTD) and frequency-domain equalization (FDE) reception is also presented.