2,871 research outputs found
LP records
Digital copies were created from a selection of items in the original hard copy Fay Singer South African Jewish Music Centre collection held in DOMUS in the Music Library, Stellenbosch University.Note about LP records from Gwynne Schrire (Robins) of the Cape Jewish Seniors
Oblivious Algorithms for the Max-kAND Problem
Motivated by recent works on streaming algorithms for constraint satisfaction problems (CSPs), we define and analyze oblivious algorithms for the Max-kAND problem. This is a class of simple, combinatorial algorithms which round each variable with probability depending only on a quantity called the variable’s bias. Our definition generalizes a class of algorithms defined by Feige and Jozeph (Algorithmica '15) for Max-DICUT, a special case of Max-2AND.
For each oblivious algorithm, we design a so-called factor-revealing linear program (LP) which captures its worst-case instance, generalizing one of Feige and Jozeph for Max-DICUT. Then, departing from their work, we perform a fully explicit analysis of these (infinitely many!) LPs. In particular, we show that for all k, oblivious algorithms for Max-kAND provably outperform a special subclass of algorithms we call "superoblivious" algorithms.
Our result has implications for streaming algorithms: Generalizing the result for Max-DICUT of Saxena, Singer, Sudan, and Velusamy (SODA'23), we prove that certain separation results hold between streaming models for infinitely many CSPs: for every k, O(log n)-space sketching algorithms for Max-kAND known to be optimal in o(√n)-space can be beaten in (a) O(log n)-space under a random-ordering assumption, and (b) O(n^{1-1/k} D^{1/k}) space under a maximum-degree-D assumption. Even in the previously-known case of Max-DICUT, our analytic proof gives a fuller, computer-free picture of these separation results
LP Decoding Excess over Symmetric Channels
We consider the problem of Linear Programming (LP) decoding of binary linear codes. The LP excess lemma was introduced by the first author, B. Ghazi, and R. Urbanke (IEEE Trans. Inf. Th., 2014) as a technique to trade crossover probability for 'LP excess' over the Binary Symmetric Channel. We generalize the LP excess lemma to discrete, binary-input, Memoryless, Symmetric and LLR-Bounded (MSB) channels. As an application, we extend a result by the first author and H. Audah (IEEE Trans. Inf. Th., 2015) on the impact of redundant checks on LP decoding to discrete MSB channels. © 2015 IEEE
A Sobolev estimate for radial lp-multipliers on a class of semi-simple lie groups
Let G be a semi-simple Lie group in the Harish-Chandra class with maximal compact subgroup K. Let ΩK be minus the radial Casimir operator. Let 1 4 dim(G/K) < SG < 1 2 dim(G/K), s ∈ (0, SG] and p ∈ (1,∞) be such that(1 p - 1 2 )< s 2SG . Then, there exists a constant CG,s,p > 0 such that for every m ∈ L∞(G) ∩ L2(G) bi-K-invariant with m ∈ Dom(Ωs K) and Ωs K(m) ∈ L2SG/s(G) we have, (0.1) ∥Tm : Lp(G) → Lp( G)∥ ≤ CG,s,p∥Ωs K(m)∥ L2SG/s(G), where Tm is the Fourier multiplier with symbol m acting on the noncommutative Lp-space of the group von Neumann algebra of G. This gives new examples of Lp-Fourier multipliers with decay rates becoming slower when p approximates 2.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Analysi
Stability properties of stochastic maximal Lp-regularity
In this paper we consider Lp-regularity estimates for solutions to stochastic evolution equations, which is called stochastic maximal Lp-regularity. Our aim is to find a theory which is analogously to Dore’s theory for deterministic evolution equations. He has shown that maximal Lp-regularity is independent of the length of the time interval, implies analyticity and exponential stability of the semigroup, is stable under perturbation and many more properties. We show that the stochastic versions of these results hold
Generalized rational approximation in interpolating subspaces of Lp(μ)
AbstractWe extend the geometric approach of Cheney and Loeb in [2] to the problem of approximation in Lp(μ) by “admissable” generalized rational functions. We obtain a characterization for locally best approximations and find the interpolating condition sufficient for their local unicity. Our results are comparable to those for the linear approximation problem as investigated by Singer and Ault, Deutsch, Morris, and Olson
PROPAGATION OF LP//0//1 AND LP//1//1 MODES IN COUPLED OPTICAL FIBERS.
The author studied the propagation of the fundamental mode, called the LP//0//1 mode, of a single-mode optical fiber and the LP//1//1 mode, the next higher-order mode, in two long lengths of fiber coupled together. This was done by launching light having a wavelength below the cut-off wavelength of the fiber. The effect of lateral misalignment at the coupled junctions was investigated. The results are explained in terms of excitation of the modes at this junction
Life of a Yellow Kid: an audiovisual electro-pop LP
The basis of this project is to compose, record, produce and mix an eleven song album (LP) with a visualizer, logo and design for each track. The author designed all of the artworks for the songs and LP and produced videos and content for said LP. Also, the author combined all of his influences from electronic music and other genres to create something new to expand the limits of electronic music. This album was influenced by works of artists like Madeon, Porter Robinson, Louis The Child, Urboi, Medasin, Fred Again.. and The Weeknd. Song-writing, recording, sound design, creative production techniques, mixing, graphic design and audiovisual production were the skills and tools necessary for the completion of this LP. The main focus of the LP was to combine different genres of music, like Electro-pop, UK Garage, Pop, House and Drum and Bass. Also this album is about personal experiences of the author and it covers different feelings throughout the LP, creating a sunset literally and figuratively within the album.
This paper was written without any assistance from generative artificial intelligence.https://remix.berklee.edu/graduate-studies-production-technology/1378/thumbnail.jp
Tеорема Литтлвуда - Пелі про простори Lp(t)(ℝⁿ)
We point out that if the Hardy–Littlewood maximal operator is bounded on the space Lp(t)(ℝ), 1 1 , the Littlewood–Paley operator is bounded on Lp(t) (ℝⁿ), 1 1, оператор Літтлвуда - Пелі обмежений на Lp(t)(Rⁿ),1 < a ≤ p(t) ≤ b<∞,t ∈ R, тоді і тільки тоді, коли p(t)= const.The author was supported by grant GNSF / STO 7 / 3-171
Tеорема Литтлвуда - Пелі про простори Lp(t)(ℝⁿ)
We point out that if the Hardy–Littlewood maximal operator is bounded on the space Lp(t)(ℝ), 1 1 , the Littlewood–Paley operator is bounded on Lp(t) (ℝⁿ), 1 1, оператор Літтлвуда - Пелі обмежений на Lp(t)(Rⁿ),1 < a ≤ p(t) ≤ b<∞,t ∈ R, тоді і тільки тоді, коли p(t)= const.The author was supported by grant GNSF / STO 7 / 3-171
- …
