We demonstrate three-dimensional trapping and orientation of individual Au nanorods by using laser light slightly detuned from their longitudinal plasmon mode. Detuning to the long-wavelength side of the resonance allows stable trapping for several minutes, with an exponential dependence of trapping time on laser power (consistent with a Kramer's escape process). Detuning to the short-wavelengt...

We derive a model to describe decoherence of atomic clouds in atom-chip traps taking the excited states of the trapping potential into account. We use this model to investigate decoherence for a single trapping well and for a pair of trapping wells that form the two arms of an atom interferometer. Including the discrete spectrum of the trapping potential gives rise to a decoherence mechanism wi...

Dielectrophoresis can potentially be used as an efficient trapping tool in the fabrication of molecular devices. For nanoscale objects, however, the Brownian motion poses a challenge. We show that the use of carbon nanotube electrodes makes it possible to apply relatively low trapping voltages and still achieve high enough field gradients for trapping nanoscale objects, e.g., single molecules. ...

We demonstrate bowtie apertures that were designed and fabricated by a lift-off process to optically trap individual, 30 nm, silica-coated quantum dots (scQD). Simulations and experiments confirm the trapping capability of the system with a relatively low continuous wave trapping flux of 1.56 MW/cm at 1064 nm. Additionally, the scQD emits upon trapping via two-photon excitation from the trappin...

LDPC codes are used in many applications, however, their error correcting capabilities are limited by the presence of stopping sets and trappins sets. Trappins sets and stopping sets occur when specific low-wiehgt error patterns cause a decoder to fail. Trapping sets were first discovered with investigation of the error floor of the Margulis code. Possible solutions are constructions which avoi...

Designing appropriate techniques to effectively control the trapping process in complex systems towards desirable efficiency is of paramount importance in the study of trapping problem. In this paper, we present three different methods guiding trapping process in a scale-free small-world network with a deep trap positioned at an initial node. All the proposed approaches dominate the trapping pr...

Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density paritycheck (LDPC) codes, and are well investigated in coding theory. In this paper, we make connections between cages and trapping sets. In particular, starting from a cage (or a modified cage), we c...

We present a methodology to search for harmful subgraphs in the Tanner graph of a regular column-weightthree low-density parity-check (LDPC) code. These harmful subgraphs, which are more commonly known under the name “trapping sets,” cause a degradation in the error correcting performance of LDPC codes in the high signal-to-noise ratio (SNR) region. Our method of searching for trapping sets uti...