13976369
Design of a nanosensor array architecture
This paper describes a nanowire sensor array architecture for high-speed, high-accuracy sensor systems. The chip has very simple processing elements (PEs) in a massively parallel architecture, in which each PE is directly connected to seven sensors. A sampling rate of 100 ns is enough to realized high-speed sensing feedback for electronic nose. We aim to create a very simple architecture, because a compact design is required ton integrate as many PEs as possible on a single chip. A widely used, easy to implement estimator-minimum distance classifier is introduced to realize the pattern recognition. A sample design is implemented in VHDL and has been simulated and synthesized using TSMC 0.25 standard cell library and a commercial 0.16 standard cell library.
14760977
A nanosensor array-based VLSI gas discriminator
Chemiresistive nanowires can be organized as cross-reactive sensor arrays to mimic the human olfactory system in terms of sensing and discriminating various gases and odors. This paper presents a single chip gas discrimination system that integrates a cross-reactive array of chemiresistive nanosensors with an underlying VLSI pattern classifier to accurately and efficiently identify the gas/odor to which the system is exposed. The main focus of the work is on the design of the underlying VLSI pattern classifier and its interaction with the nanosensors.
11714898
On the number of limit cycles of a cubic polynomials Hamiltonian system under quintic perturbation
Abstract This paper is concerned with the number and distribution of limit cycles of a cubic Hamiltonian system under quintic perturbation. By using the bifurcation theory and the method of detection function, we obtain that this system exists at least 14 limit cycles with the distribution C 9 1 ⊃ [ C 1 1 + 2 ( C 3 2 ⊃ 2 C 1 2 ) ] . These results in the paper are useful for the study of the weakened Hilbert’s 16th problem.
14985315
Spin-transfer torque magnetoresistive content addressable memory (CAM) cell structure design with enhanced search noise margin
This paper presents a new memory cell structure for content addressable memory (CAM) based on magnetic tunneling junction (MTJ). Each CAM cell uses a pair of differential MTJs as basic storage element and incorporates transistors to greatly improve the cell search noise margin at low sensing current. Using the same design principle, we further develop an area-efficient cell structure for ternary CAM (TCAM), which occupies about 25% less area compared with directly using two CAM cells to form one TCAM cell. The effectiveness of the proposed CAM and TCAM cell structures has been demonstrated by circuit simulation at 0.18 mum CMOS technology.
7423569
Global Analysis of Stochastic bifurcation in Duffing System
Stochastic bifurcation of a Duffing system subject to a combination of a deterministic harmonic excitation and a white noise excitation is studied in detail by the generalized cell mapping method using digraph. It is found that under certain conditions there exist two stable invariant sets in the phase space, associated with the randomly perturbed steady-state motions, which may be called stochastic attractors. Each attractor owns its attractive basin, and the attractive basins are separated by boundaries. Along with attractors there also exists an unstable invariant set, which might be called a stochastic saddle as well, and stochastic bifurcation always occurs when a stochastic attractor collides with a stochastic saddle. As an alternative definition, stochastic bifurcation may be defined as a sudden change in character of a stochastic attractor when the bifurcation parameter of the system passes through a critical value. This definition applies equally well either to randomly perturbed motions, or to p...
1287667
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and manipulation. Most existing methods work on image pixels or color segments which are computationally expensive. Some methods require extensive manual inputs, static cameras, and/or rigid scenes. In this paper we propose a fully automatic foreground segmentation method based on sequential clustering of sparse image features. The sparseness makes the method computationally efficient. We use both edge and corner points extracted from each video frame. A joint spatio-temporal linear regression method is developed to compute sparse motion layers of M consecutive frames jointly under the temporal consistency constraint. Once the sparse motion layers have been identified for each frame, the corresponding dense motion layers are created using the Markov Random Field (MRF) model. The MRF model assigns the rest of the image pixels to the motion layers by considering both the color attributes and the spatial relations between each pixel and its surrounding edge/corner points. Experimental evaluations on videos taken by webcams show the effectiveness of the proposed method.
5881297
Deep Learning with Kernel Regularization for Visual Recognition
In this paper we aim to train deep neural networks for rapid visual recognition. The task is highly challenging, largely due to the lack of a meaningful regular-izer on the functions realized by the networks. We propose a novel regularization method that takes advantage of kernel methods, where an oracle kernel function represents prior knowledge about the recognition task of interest. We derive an efficient algorithm using stochastic gradient descent, and demonstrate encouraging results on a wide range of recognition tasks, in terms of both accuracy and speed.