More Like this

1. Energy Harvesting Performance of a Flapping Foil with Leading Edge Motion

   Prier, M. (April 2019, Dissertation)

   F or c e d at a f or a fl a p pi n g f oil e n er g y h ar v e st er wit h a cti v e l e a di n g e d g e m oti o n o p er ati n g i n t h e l o w r e d u c e d fr e q u e n c y r a n g e i s c oll e ct e d t o d et er mi n e h o w l e a di n g e d g e m oti o n aff e ct s e n er g y h ar v e sti n g p erf or m a n c e. T h e f oil pi v ot s a b o ut t h e mi dc h or d a n d o p er at e s i n t h e l o w r e d u c e d fr e q u e n c y r a n g e of 𝑓𝑓 𝑓𝑓 / 𝑈𝑈 ∞ = 0. 0 6 , 0. 0 8, a n d 0. 1 0 wit h 𝑅𝑅 𝑅𝑅 = 2 0 ,0 0 0 − 3 0 ,0 0 0 , wit h a pit c hi n g a m plit u d e of 𝜃𝜃 0 = 7 0 ∘ , a n d a h e a vi n g a m plit u d e of ℎ 0 = 0. 5 𝑓𝑓 . It i s f o u n d t h at l e a di n g e d g e m oti o n s t h at r e d u c e t h e eff e cti v e a n gl e of att a c k e arl y t h e str o k e w or k t o b ot h i n cr e a s e t h e lift f or c e s a s w ell a s s hift t h e p e a k lift f or c e l at er i n t h e fl a p pi n g str o k e. L e a di n g e d g e m oti o n s i n w hi c h t h e eff e cti v e a n gl e of att a c k i s i n cr e a s e d e arl y i n t h e str o k e s h o w d e cr e a s e d p erf or m a n c e. I n a d diti o n a di s cr et e v ort e x m o d el wit h v ort e x s h e d di n g at t h e l e a di n g e d g e i s i m pl e m e nt f or t h e m oti o n s st u di e d; it i s f o u n d t h at t h e m e c h a ni s m f or s h e d di n g at t h e l e a di n g e d g e i s n ot a d e q u at e f or t hi s p ar a m et er r a n g e a n d t h e m o d el c o n si st e ntl y o v er pr e di ct s t h e a er o d y n a mi c f or c e s. 

   more » « less
2. Production of $$\omega $$ mesons in pp collisions at $$\mathbf {\sqrt{s}=7\,\text {TeV}}$$

   https://doi.org/10.1140/epjc/s10052-020-08651-y  

   Acharya, S.; Adamová, D.; Adler, A.; Adolfsson, J.; Aggarwal, M. M.; Agha, S.; Aglieri Rinella, G.; Agnello, M.; Agrawal, N.; Ahammed, Z.; et al (December 2020, The European Physical Journal C)

   null (Ed.)

   Abstract The invariant differential cross section of inclusive $$\omega (782)$$ ω ( 782 ) meson production at midrapidity ( $$|y|<0.5$$ | y | < 0.5 ) in pp collisions at $$\sqrt{s}=7\,\hbox {TeV}$$ s = 7 TeV was measured with the ALICE detector at the LHC over a transverse momentum range of $$2< p_{\mathrm {T}}< 17\,\hbox {GeV}/c$$ 2 < p T < 17 GeV / c . The $$\omega $$ ω meson was reconstructed via its $$\omega \rightarrow \pi ^+\pi ^-\pi ^0$$ ω → π + π - π 0 decay channel. The measured $$\omega $$ ω production cross section is compared to various calculations: PYTHIA 8.2  Monash 2013 describes the data, while PYTHIA 8.2 Tune 4C overestimates the data by about 50%. A recent NLO calculation, which includes a model describing the fragmentation of the whole vector-meson nonet, describes the data within uncertainties below $$6\,\hbox {GeV}/c$$ 6 GeV / c , while it overestimates the data by up to 50% for higher $$p_{\mathrm {T}}$$ p T . The $$\omega /\pi ^0$$ ω / π 0 ratio is in agreement with previous measurements at lower collision energies and the PYTHIA calculations. In addition, the measurement is compatible with transverse mass scaling within the measured $$p_{\mathrm {T}}$$ p T  range and the ratio is constant with $$C^{\omega /\pi ^{0}}= 0.67 \pm 0.03 \text {~(stat)~} \pm 0.04 \text {~(sys)~}$$ C ω / π 0 = 0.67 ± 0.03 (stat) ± 0.04 (sys) above a transverse momentum of $$2.5\,\hbox {GeV}/c$$ 2.5 GeV / c . 

   more » « less
3. Magnetic field reveals vanishing Hall response in the normal state of stripe-ordered cuprates

   https://doi.org/10.1038/s41467-021-24000-3  

   Shi, Zhenzhong; Baity, P. G.; Terzic, J.; Pokharel, Bal K.; Sasagawa, T.; Popović, Dragana (December 2021, Nature Communications)

   null (Ed.)

   Abstract The origin of the weak insulating behavior of the resistivity, i.e. $${\rho }_{xx}\propto {\mathrm{ln}}\,(1/T)$$ ρ x x ∝ ln ( 1 / T ) , revealed when magnetic fields ( H ) suppress superconductivity in underdoped cuprates has been a longtime mystery. Surprisingly, the high-field behavior of the resistivity observed recently in charge- and spin-stripe-ordered La-214 cuprates suggests a metallic, as opposed to insulating, high-field normal state. Here we report the vanishing of the Hall coefficient in this field-revealed normal state for all $$T\ <\ (2-6){T}_{{\rm{c}}}^{0}$$ T < ( 2 − 6 ) T c 0 , where $${T}_{{\rm{c}}}^{0}$$ T c 0 is the zero-field superconducting transition temperature. Our measurements demonstrate that this is a robust fundamental property of the normal state of cuprates with intertwined orders, exhibited in the previously unexplored regime of T and H . The behavior of the high-field Hall coefficient is fundamentally different from that in other cuprates such as YBa 2 Cu 3 O 6+ x and YBa 2 Cu 4 O 8 , and may imply an approximate particle-hole symmetry that is unique to stripe-ordered cuprates. Our results highlight the important role of the competing orders in determining the normal state of cuprates. 

   more » « less
4. Quantum Time-Space Tradeoffs for Matrix Problems

   Beame, Paul; Kornerup, Niels; Whitmeyer, Michael (November 2025, arXivorg)

   We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices A, including the discrete Fourier transform (DFT) matrix, we prove that quantum circuits with at most T input queries and S qubits of memory require T = Ω(n^2/S) to compute matrix-vector product Ax for x ∈ {0, 1}^n. We similarly prove that matrix multiplication for n × n binary matrices requires T = Ω(n^3/√S). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e. AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for n × n Boolean matrix multiplication to T = Ω(n^{2.5}/S^{1/4}) from T = Ω(n^{2.5}/S^{1/2}). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits. 

   more » « less
5. On the Power of Adaptivity for Function Inversion

   https://doi.org/10.4230/LIPIcs.ITC.2024.5  

   Gajulapalli, Karthik; Golovnev, Alexander; King, Samuel (January 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)

   Aggarwal, Divesh (Ed.)

   We study the problem of function inversion with preprocessing where, given a function f : [N] → [N] and a point y in its image, the goal is to find an x such that f(x) = y using at most T oracle queries to f and S bits of preprocessed advice that depend on f. The seminal work of Corrigan-Gibbs and Kogan [TCC 2019] initiated a line of research that shows many exciting connections between the non-adaptive setting of this problem and other areas of theoretical computer science. Specifically, they introduced a very weak class of algorithms (strongly non-adaptive) where the points queried by the oracle depend only on the inversion point y, and are independent of the answers to the previous queries and the S bits of advice. They showed that proving even mild lower bounds on strongly non-adaptive algorithms for function inversion would imply a breakthrough result in circuit complexity. We prove that every strongly non-adaptive algorithm for function inversion (and even for its special case of permutation inversion) must have ST = Ω(N log (N) log (T)). This gives the first improvement to the long-standing lower bound of ST = Ω(N log N) due to Yao [STOC 90]. As a corollary, we conclude the first separation between strongly non-adaptive and adaptive algorithms for permutation inversion, where the adaptive algorithm by Hellman [TOIT 80] achieves the trade-off ST = O(N log N). Additionally, we show equivalence between lower bounds for strongly non-adaptive data structures and the one-way communication complexity of certain partial functions. As an example, we recover our lower bound on function inversion in the communication complexity framework. 

   more » « less