Now showing items 15793-15812 of 32312

    • Low-threshold lasing action in photonic crystal slabs enabled by Fano resonances 

      Chua, Song-Liang; Chong, Yidong; Stone, A. Douglas; Soljacic, Marin; Bravo-Abad, Jorge (Optical Society of America, 2011-01)
      We present a theoretical analysis of lasing action in photonic crystal surface-emitting lasers (PCSELs). The semiclassical laser equations for such structures are simulated with three different theoretical techniques: exact ...
    • Low-threshold terahertz quantum-cascade lasers with one-well injector operating up to 174 K 

      Kumar, Sushil; Hu, Qing; Reno, John L. (Institute of Electrical and Electronics Engineers, 2009-08)
      We report operation of v ~ 2.7 THz quantum-cascade lasers (QCLs) up to 174 K. A new three-well active region, one-well injector scheme is utilized to lower the operating current densities. While the temperature performance ...
    • Low-Transition-Temperature Mixtures (LTTMs) for Dissolving Proteins and for Drug Formulation 

      Su, Erzheng; Klibanov, Alexander M. (Springer US, 2015-08)
      Several diverse proteins are found to readily dissolve in neat low-transition-temperature mixtures (LTTMs). They undergo no irreversible denaturation in such unusual solvents, and the resistance of hen egg-white lysozyme ...
    • Low-Variance Monte Carlo Simulation of Thermal Transport in Graphene 

      Landon, Colin Donald; Hadjiconstantinou, Nicolas (American Society of Mechanical Engineers (ASME), 2012-11)
      ue to its unique thermal properties, graphene has generated considerable interest in the context of thermal management applications. In order to correctly treat heat transfer in this material, while still reaching device-level ...
    • A low-voltage energy-sampling IR-UWB digital baseband employing quadratic correlation 

      Chandrakasan, Anantha P.; Mercier, Patrick Philip; Bhardwaj, Manish; Daly, Denis C. (Institute of Electrical and Electronics Engineers, 2010-06)
      This paper describes a digital baseband designed for use in a non-coherent IR-UWB system. Owing to the nonlinear statistics introduced by the energy-sampling RF front-end, the baseband employs a new quadratic correlation ...
    • Low-volume multiplexed proteolytic activity assay and inhibitor analysis through a pico-injector array 

      Ng, Ee Xien; Jing, Tengyang; Chen, Chia-Hung; Miller, Miles Aaron; Lauffenburger, Douglas A (Royal Society of Chemistry (RSC), 2014-12)
      Secreted active proteases, from families of enzymes such as matrix metalloproteinases (MMPs) and ADAMs (a disintegrin and metalloproteinases), participate in diverse pathological processes. To simultaneously measure multiple ...
    • Lower and upper bounds for linkage discovery 

      Choi, Sung-Soon; Jung, Kyomin; Moon, Byung-Ro (Institute of Electrical and Electronics Engineers, 2009-02)
      For a real-valued function f defined on {0,1}n , the linkage graph of f is a hypergraph that represents the interactions among the input variables with respect to f . In this paper, lower and upper bounds for the number ...
    • A lower bound for distributed averaging algorithms on the line graph 

      Tsitsiklis, John N.; Olshevsky, Alexander (Institute of Electrical and Electronics Engineers (IEEE), 2011-02)
      We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose state consists of a single real number and ...
    • Lower Bound on Expected Communication Cost of Quantum Huffman Coding 

      Anshu, Anurag; Garg, Ankit; Yao, Penghui; Harrow, Aram W (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016-09)
      Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some known ensemble and needs ...
    • A lower bound on the performance of dynamic curing policies for epidemics on graphs 

      Drakopoulos, Kimon; Koksal, Asuman E.; Tsitsiklis, John N (Institute of Electrical and Electronics Engineers (IEEE), 2016-02)
      We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected ...
    • Lower bounds for nodal sets of eigenfunctions 

      Colding, Tobias; Minicozzi, William (Springer-Verlag, 2011-03)
      We prove lower bounds for the Hausdorff measure of nodal sets of eigenfunctions.
    • Lower Bounds for Randomized Consensus under a Weak Adversary 

      Attiya, Hagit; Censor-Hillel, Keren (Society for Industrial and Applied Mathematics, 2010-12)
      This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer $k$, the probability that an $f$-resilient randomized ...
    • Lower bounds for sparse recovery 

      Indyk, Piotr; Do Ba, Khanh; Price, Eric C.; Woodruff, David P. (Society for Industrial and Applied Mathematics, 2010-01)
      We consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying x|| ^x||1 [less than or equal to] C min[subscript k]-sparse ...
    • Lower bounds on nonnegative rank via nonnegative nuclear norms 

      Fawzi, Hamza; Parrilo, Pablo A. (Springer-Verlag, 2014-11)
      The nonnegative rank of an entrywise nonnegative matrix A ∈ R[m×n over +] is the smallest integer r such that A can be written as A = UV where U ∈ R[m×r over +] and V ∈ R[r×n over +] are both nonnegative. The nonnegative ...
    • Lower bounds on Ricci curvature and quantitative behavior of singular sets 

      Cheeger, Jeff; Naber, Aaron Charles (Springer-Verlag, 2012-03)
      Let Yn denote the Gromov-Hausdorff limit M[superscript n][subscript i][d[subscript GH] over ⟶]Y[superscript n] of v-noncollapsed Riemannian manifolds with Ric[subscript M[superscript n][subscript i]] ≥ −(n−1). The ...
    • Lower bounds on the estimation error in problems of distributed computation 

      Como, Giacomo; Dahleh, Munther A. (Institute of Electrical and Electronics Engineers, 2009-02)
      Information-theoretic lower bounds on the estimation error are derived for problems of distributed computation. These bounds hold for a network attempting to compute a real-vector-valued function of the global information, ...
    • Lower bounds on the performance of Analog to Digital Converters 

      Osqui, Mitra; Megretski, Alexandre; Roozbehani, Mardavij (Institute of Electrical and Electronics Engineers (IEEE), 2012-03)
      This paper deals with the task of finding certified lower bounds for the performance of Analog to Digital Converters (ADCs). A general ADC is modeled as a causal, discrete-time dynamical system with outputs taking values ...
    • Lower Bounds on the Rate of Learning in Social Networks 

      Ozdaglar, Asuman E.; Acemoglu, Daron; Lobel, Inna; Dahleh, Munther A. (Institute of Electrical and Electronics Engineers, 2009-07)
      e study the rate of convergence of Bayesian learning in social networks. Each individual receives a signal about the underlying state of the world, observes a subset of past actions and chooses one of two possible actions. ...
    • Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive 

      Gasarch, William; Haeupler, Bernhard (Electronic Journal of Combinatorics, 2011-03)
      The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has a monochromatic arithmetic progression of length k. The existence of such an n for any k is due to van der Waerden but ...
    • Lower central series of a free associative algebra over the integers and finite fields 

      Bhupatiraju, Surya; Jordan, David; Kuszmaul, William; Li, Jason; Etingof, Pavel I. (Elsevier, 2012-09)
      Consider the free algebra A[subscript n] generated over Q by n generators x[subscript 1],…,x[subscript n]. Interesting objects attached to A=A[subscript n] are members of its lower central series, L[subscript i] = L[subscript ...