@article{14726, abstract = {Autocrine signaling pathways regulated by RAPID ALKALINIZATION FACTORs (RALFs) control cell wall integrity during pollen tube germination and growth in Arabidopsis (Arabidopsis thaliana). To investigate the role of pollen-specific RALFs in another plant species, we combined gene expression data with phylogenetic and biochemical studies to identify candidate orthologs in maize (Zea mays). We show that Clade IB ZmRALF2/3 mutations, but not Clade III ZmRALF1/5 mutations, cause cell wall instability in the sub-apical region of the growing pollen tube. ZmRALF2/3 are mainly located in the cell wall and are partially able to complement the pollen germination defect of their Arabidopsis orthologs AtRALF4/19. Mutations in ZmRALF2/3 compromise pectin distribution patterns leading to altered cell wall organization and thickness culminating in pollen tube burst. Clade IB, but not Clade III ZmRALFs, strongly interact as ligands with the pollen-specific Catharanthus roseus RLK1-like (CrRLK1L) receptor kinases Zea mays FERONIA-like (ZmFERL) 4/7/9, LORELEI-like glycosylphosphatidylinositol-anchor (LLG) proteins Zea mays LLG 1 and 2 (ZmLLG1/2) and Zea mays pollen extension-like (PEX) cell wall proteins ZmPEX2/4. Notably, ZmFERL4 outcompetes ZmLLG2 and ZmPEX2 outcompetes ZmFERL4 for ZmRALF2 binding. Based on these data, we suggest that Clade IB RALFs act in a dual role as cell wall components and extracellular sensors to regulate cell wall integrity and thickness during pollen tube growth in maize and probably other plants.}, author = {Zhou, Liang-Zi and Wang, Lele and Chen, Xia and Ge, Zengxiang and Mergner, Julia and Li, Xingli and Küster, Bernhard and Längst, Gernot and Qu, Li-Jia and Dresselhaus, Thomas}, issn = {1532-298X}, journal = {The Plant Cell}, keywords = {Cell Biology, Plant Science}, publisher = {Oxford University Press}, title = {{The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize}}, doi = {10.1093/plcell/koad324}, year = {2023}, } @unpublished{14732, abstract = {Fragmented landscapes pose a significant threat to the persistence of species as they are highly susceptible to heightened risk of extinction due to the combined effects of genetic and demographic factors such as genetic drift and demographic stochasticity. This paper explores the intricate interplay between genetic load and extinction risk within metapopulations with a focus on understanding the impact of eco-evolutionary feedback mechanisms. We distinguish between two models of selection: soft selection, characterised by subpopulations maintaining carrying capacity despite load, and hard selection, where load can significantly affect population size. Within the soft selection framework, we investigate the impact of gene flow on genetic load at a single locus, while also considering the effect of selection strength and dominance coefficient. We subsequently build on this to examine how gene flow influences both population size and load under hard selection as well as identify critical thresholds for metapopulation persistence. Our analysis employs the diffusion, semi-deterministic and effective migration approximations. Our findings reveal that under soft selection, even modest levels of migration can significantly alleviate the burden of load. In sharp contrast, with hard selection, a much higher degree of gene flow is required to mitigate load and prevent the collapse of the metapopulation. Overall, this study sheds light into the crucial role migration plays in shaping the dynamics of genetic load and extinction risk in fragmented landscapes, offering valuable insights for conservation strategies and the preservation of diversity in a changing world.}, author = {Olusanya, Oluwafunmilola O and Khudiakova, Kseniia and Sachdeva, Himani}, booktitle = {bioRxiv}, title = {{Genetic load, eco-evolutionary feedback and extinction in a metapopulation}}, doi = {10.1101/2023.12.02.569702}, year = {2023}, } @article{14733, abstract = {Redox flow batteries (RFBs) rely on the development of cheap, highly soluble, and high-energy-density electrolytes. Several candidate quinones have already been investigated in the literature as two-electron anolytes or catholytes, benefiting from fast kinetics, high tunability, and low cost. Here, an investigation of nitrogen-rich fused heteroaromatic quinones was carried out to explore avenues for electrolyte development. These quinones were synthesized and screened by using electrochemical techniques. The most promising candidate, 4,8-dioxo-4,8-dihydrobenzo[1,2-d:4,5-d′]bis([1,2,3]triazole)-1,5-diide (−0.68 V(SHE)), was tested in both an asymmetric and symmetric full-cell setup resulting in capacity fade rates of 0.35% per cycle and 0.0124% per cycle, respectively. In situ ultraviolet-visible spectroscopy (UV–Vis), nuclear magnetic resonance (NMR), and electron paramagnetic resonance (EPR) spectroscopies were used to investigate the electrochemical stability of the charged species during operation. UV–Vis spectroscopy, supported by density functional theory (DFT) modeling, reaffirmed that the two-step charging mechanism observed during battery operation consisted of two, single-electron transfers. The radical concentration during battery operation and the degree of delocalization of the unpaired electron were quantified with NMR and EPR spectroscopy.}, author = {Jethwa, Rajesh B and Hey, Dominic and Kerber, Rachel N. and Bond, Andrew D. and Wright, Dominic S. and Grey, Clare P.}, issn = {2574-0962}, journal = {ACS Applied Energy Materials}, keywords = {Electrical and Electronic Engineering, Materials Chemistry, Electrochemistry, Energy Engineering and Power Technology, Chemical Engineering (miscellaneous)}, publisher = {American Chemical Society}, title = {{Exploring the landscape of heterocyclic quinones for redox flow batteries}}, doi = {10.1021/acsaem.3c02223}, year = {2023}, } @inproceedings{14735, abstract = {Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition. If we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input. This “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs.}, author = {Stefo, Christos and Xiang, Zhuolun and Kokoris Kogias, Eleftherios}, booktitle = {27th International Conference on Financial Cryptography and Data Security}, isbn = {9783031477539}, issn = {0302-9743}, location = {Bol, Brac, Croatia}, pages = {3--20}, publisher = {Springer Nature}, title = {{Executing and proving over dirty ledgers}}, doi = {10.1007/978-3-031-47754-6_1}, volume = {13950}, year = {2023}, } @article{14737, abstract = {John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies.}, author = {Ivanov, Grigory and Naszódi, Márton}, issn = {1687-0247}, journal = {International Mathematics Research Notices}, keywords = {General Mathematics}, number = {23}, pages = {20613--20669}, publisher = {Oxford University Press}, title = {{Functional John and Löwner conditions for pairs of log-concave functions}}, doi = {10.1093/imrn/rnad210}, volume = {2023}, year = {2023}, } @article{14739, abstract = {Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods.}, author = {Ali, Dashti and Asaad, Aras and Jimenez, Maria-Jose and Nanda, Vidit and Paluzo-Hidalgo, Eduardo and Soriano Trigueros, Manuel}, issn = {1939-3539}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, keywords = {Applied Mathematics, Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Software}, number = {12}, pages = {14069--14080}, publisher = {IEEE}, title = {{A survey of vectorization methods in topological data analysis}}, doi = {10.1109/tpami.2023.3308391}, volume = {45}, year = {2023}, } @article{14742, abstract = {Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics. While an important role for CRs in speciation has been suggested, evidence primarily stems from theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon pairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at a macroevolutionary level has been supported by associations between species diversity and rates of evolution of CRs across phylogenies, these findings are limited to a restricted range of CRs and taxa. Now that more broadly applicable and precise CR detection approaches have become available, we address the challenges in filling some of the conceptual and empirical gaps between micro- and macroevolutionary studies on the role of CRs in speciation. We synthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life.}, author = {Lucek, Kay and Giménez, Mabel D. and Joron, Mathieu and Rafajlović, Marina and Searle, Jeremy B. and Walden, Nora and Westram, Anja M and Faria, Rui}, issn = {1943-0264}, journal = {Cold Spring Harbor Perspectives in Biology}, keywords = {General Biochemistry, Genetics and Molecular Biology}, number = {11}, publisher = {Cold Spring Harbor Laboratory}, title = {{The impact of chromosomal rearrangements in speciation: From micro- to macroevolution}}, doi = {10.1101/cshperspect.a041447}, volume = {15}, year = {2023}, } @inproceedings{14743, abstract = {Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments.}, author = {Tennage, Pasindu and Basescu, Cristina and Kokoris Kogias, Eleftherios and Syta, Ewa and Jovanovic, Philipp and Estrada-Galinanes, Vero and Ford, Bryan}, booktitle = {Proceedings of the 29th Symposium on Operating Systems Principles}, isbn = {9798400702297}, location = {Koblenz, Germany}, pages = {281--297}, publisher = {Association for Computing Machinery}, title = {{QuePaxa: Escaping the tyranny of timeouts in consensus}}, doi = {10.1145/3600006.3613150}, year = {2023}, } @article{14750, abstract = {Consider the random matrix model A1/2UBU∗A1/2, where A and B are two N × N deterministic matrices and U is either an N × N Haar unitary or orthogonal random matrix. It is well known that on the macroscopic scale (Invent. Math. 104 (1991) 201–220), the limiting empirical spectral distribution (ESD) of the above model is given by the free multiplicative convolution of the limiting ESDs of A and B, denoted as μα  μβ, where μα and μβ are the limiting ESDs of A and B, respectively. In this paper, we study the asymptotic microscopic behavior of the edge eigenvalues and eigenvectors statistics. We prove that both the density of μA μB, where μA and μB are the ESDs of A and B, respectively and the associated subordination functions have a regular behavior near the edges. Moreover, we establish the local laws near the edges on the optimal scale. In particular, we prove that the entries of the resolvent are close to some functionals depending only on the eigenvalues of A, B and the subordination functions with optimal convergence rates. Our proofs and calculations are based on the techniques developed for the additive model A+UBU∗ in (J. Funct. Anal. 271 (2016) 672–719; Comm. Math. Phys. 349 (2017) 947–990; Adv. Math. 319 (2017) 251–291; J. Funct. Anal. 279 (2020) 108639), and our results can be regarded as the counterparts of (J. Funct. Anal. 279 (2020) 108639) for the multiplicative model. }, author = {Ding, Xiucai and Ji, Hong Chang}, issn = {1050-5164}, journal = {The Annals of Applied Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {4}, pages = {2981--3009}, publisher = {Institute of Mathematical Statistics}, title = {{Local laws for multiplication of random matrices}}, doi = {10.1214/22-aap1882}, volume = {33}, year = {2023}, } @article{14751, abstract = {We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation.}, author = {Zhang, Yihan}, issn = {1557-9654}, journal = {IEEE Transactions on Information Theory}, keywords = {Computer Science Applications, Information Systems}, number = {7}, pages = {4093--4127}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Zero-error communication over adversarial MACs}}, doi = {10.1109/tit.2023.3257239}, volume = {69}, year = {2023}, } @article{14752, abstract = {Radiative cooling of the lowest atmospheric levels is of strong importance for modulating atmospheric circulations and organizing convection, but detailed observations and a robust theoretical understanding are lacking. Here we use unprecedented observational constraints from subsidence regimes in the tropical Atlantic to develop a theory for the shape and magnitude of low‐level longwave radiative cooling in clear‐sky, showing peaks larger than 5–10 K/day at the top of the boundary layer. A suite of novel scaling approximations is first developed from simplified spectral theory, in close agreement with the measurements. The radiative cooling peak height is set by the maximum lapse rate in water vapor path, and its magnitude is mainly controlled by the ratio of column relative humidity above and below the peak. We emphasize how elevated intrusions of moist air can reduce low‐level cooling, by sporadically shading the spectral range which effectively cools to space. The efficiency of this spectral shading depends both on water content and altitude of moist intrusions; its height dependence cannot be explained by the temperature difference between the emitting and absorbing layers, but by the decrease of water vapor extinction with altitude. This analytical work can help to narrow the search for low‐level cloud patterns sensitive to radiative‐convective feedbacks: the most organized patterns with largest cloud fractions occur in atmospheres below 10% relative humidity and feel the strongest low‐level cooling. This motivates further assessment of favorable conditions for radiative‐convective feedbacks and a robust quantification of corresponding shallow cloud dynamics in current and warmer climates.}, author = {Fildier, B. and Muller, Caroline J and Pincus, R. and Fueglistaler, S.}, issn = {2576-604X}, journal = {AGU Advances}, keywords = {General Earth and Planetary Sciences}, number = {3}, publisher = {American Geophysical Union}, title = {{How moisture shapes low‐level radiative cooling in subsidence regimes}}, doi = {10.1029/2023av000880}, volume = {4}, year = {2023}, } @article{14753, abstract = {Several fixed-target experiments reported J/ψ and ϒ polarizations, as functions of Feynman x (xF) and transverse momentum (PT), in three different frames, using different combinations of beam particles, target nuclei, and collision energies. Despite the diverse and heterogeneous picture formed by these measurements, a detailed look allows us to discern qualitative physical patterns that inspire a simple empirical model. This data-driven scenario offers a good quantitative description of the J/ψ and ϒ(1S) polarizations measured in proton- and pion-nucleus collisions, in the xF 0.5 domain: more than 80 data points (not statistically independent) are well reproduced with only one free parameter. This study sets the context for future low-PT quarkonium polarization measurements in proton- and pion-nucleus collisions, such as those to be made by the AMBER experiment, and shows that such measurements provide significant constraints on the poorly-known parton distribution functions of the pion.}, author = {Faccioli, Pietro and Krätschmer, Ilse and Lourenço, Carlos}, issn = {1873-2445}, journal = {Physics Letters B}, keywords = {Nuclear and High Energy Physics}, publisher = {Elsevier}, title = {{Low-pT quarkonium polarization measurements: Challenges and opportunities}}, doi = {10.1016/j.physletb.2023.137871}, volume = {840}, year = {2023}, } @article{14754, abstract = {The large-scale laminar/turbulent spiral patterns that appear in the linearly unstable regime of counter-rotating Taylor–Couette flow are investigated from a statistical perspective by means of direct numerical simulation. Unlike the vast majority of previous numerical studies, we analyse the flow in periodic parallelogram-annular domains, following a coordinate change that aligns one of the parallelogram sides with the spiral pattern. The domain size, shape and spatial resolution have been varied and the results compared with those in a sufficiently large computational orthogonal domain with natural axial and azimuthal periodicity. We find that a minimal parallelogram of the right tilt significantly reduces the computational cost without notably compromising the statistical properties of the supercritical turbulent spiral. Its mean structure, obtained from extremely long time integrations in a co-rotating reference frame using the method of slices, bears remarkable similarity with the turbulent stripes observed in plane Couette flow, the centrifugal instability playing only a secondary role.}, author = {Wang, B. and Mellibovsky, F. and Ayats López, Roger and Deguchi, K. and Meseguer, A.}, issn = {1471-2962}, journal = {Philosophical Transactions of the Royal Society A}, keywords = {General Physics and Astronomy, General Engineering, General Mathematics}, number = {2246}, publisher = {The Royal Society}, title = {{Mean structure of the supercritical turbulent spiral in Taylor–Couette flow}}, doi = {10.1098/rsta.2022.0112}, volume = {381}, year = {2023}, } @article{14755, abstract = {We consider the sharp interface limit for the scalar-valued and vector-valued Allen–Cahn equation with homogeneous Neumann boundary condition in a bounded smooth domain Ω of arbitrary dimension N ⩾ 2 in the situation when a two-phase diffuse interface has developed and intersects the boundary ∂ Ω. The limit problem is mean curvature flow with 90°-contact angle and we show convergence in strong norms for well-prepared initial data as long as a smooth solution to the limit problem exists. To this end we assume that the limit problem has a smooth solution on [ 0 , T ] for some time T > 0. Based on the latter we construct suitable curvilinear coordinates and set up an asymptotic expansion for the scalar-valued and the vector-valued Allen–Cahn equation. In order to estimate the difference of the exact and approximate solutions with a Gronwall-type argument, a spectral estimate for the linearized Allen–Cahn operator in both cases is required. The latter will be shown in a separate paper, cf. (Moser (2021)).}, author = {Moser, Maximilian}, issn = {1875-8576}, journal = {Asymptotic Analysis}, keywords = {General Mathematics}, number = {3-4}, pages = {297--383}, publisher = {IOS Press}, title = {{Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result}}, doi = {10.3233/asy-221775}, volume = {131}, year = {2023}, } @article{14756, abstract = {We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2. To construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category.}, author = {Carqueville, Nils and Szegedy, Lorant}, issn = {1663-487X}, journal = {Quantum Topology}, keywords = {Geometry and Topology, Mathematical Physics}, number = {3}, pages = {467--532}, publisher = {European Mathematical Society}, title = {{Fully extended r-spin TQFTs}}, doi = {10.4171/qt/193}, volume = {14}, year = {2023}, } @inproceedings{14758, abstract = {We present a flexible and efficient toolchain to symbolically solve (standard) Rabin games, fair-adversarial Rabin games, and 2 1/2 license type-player Rabin games. To our best knowledge, our tools are the first ones to be able to solve these problems. Furthermore, using these flexible game solvers as a back-end, we implemented a tool for computing correct-by-construction controllers for stochastic dynamical systems under LTL specifications. Our implementations use the recent theoretical result that all of these games can be solved using the same symbolic fixpoint algorithm but utilizing different, domain specific calculations of the involved predecessor operators. The main feature of our toolchain is the utilization of two programming abstractions: one to separate the symbolic fixpoint computations from the predecessor calculations, and another one to allow the integration of different BDD libraries as back-ends. In particular, we employ a multi-threaded execution of the fixpoint algorithm by using the multi-threaded BDD library Sylvan, which leads to enormous computational savings.}, author = {Majumdar, Rupak and Mallik, Kaushik and Rychlicki, Mateusz and Schmuck, Anne-Kathrin and Soudjani, Sadegh}, booktitle = {35th International Conference on Computer Aided Verification}, isbn = {9783031377082}, issn = {1611-3349}, location = {Paris, France}, pages = {3--15}, publisher = {Springer Nature}, title = {{A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties}}, doi = {10.1007/978-3-031-37709-9_1}, volume = {13966}, year = {2023}, } @article{14759, abstract = {Proper operation of electro-optic I/Q modulators relies on precise adjustment and control of the relative phase biases between the modulator’s internal interferometer arms. We present an all-analog phase bias locking scheme where error signals are obtained from the beat between the optical carrier and optical tones generated by an auxiliary 2 MHz 𝑅𝐹 tone to lock the phases of all three involved interferometers for operation up to 10 GHz. With the developed method, we demonstrate an I/Q modulator in carrier-suppressed single-sideband mode, where the suppressed carrier and sideband are locked at optical power levels <−27dB relative to the transmitted sideband. We describe a simple analytical model for calculating the error signals and detail the implementation of the electronic circuitry for the implementation of the method.}, author = {Wald, Sebastian and Diorico, Fritz R and Hosten, Onur}, issn = {2155-3165}, journal = {Applied Optics}, keywords = {Atomic and Molecular Physics, and Optics, Engineering (miscellaneous), Electrical and Electronic Engineering}, number = {1}, pages = {1--7}, publisher = {Optica Publishing Group}, title = {{Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone}}, doi = {10.1364/ao.474118}, volume = {62}, year = {2023}, } @inproceedings{14768, abstract = {In all state-of-the-art sketching and coreset techniques for clustering, as well as in the best known fixed-parameter tractable approximation algorithms, randomness plays a key role. For the classic k-median and k-means problems, there are no known deterministic dimensionality reduction procedure or coreset construction that avoid an exponential dependency on the input dimension d, the precision parameter $\varepsilon^{-1}$ or k. Furthermore, there is no coreset construction that succeeds with probability $1-1/n$ and whose size does not depend on the number of input points, n. This has led researchers in the area to ask what is the power of randomness for clustering sketches [Feldman WIREs Data Mining Knowl. Discov’20].Similarly, the best approximation ratio achievable deterministically without a complexity exponential in the dimension are $1+\sqrt{2}$ for k-median [Cohen-Addad, Esfandiari, Mirrokni, Narayanan, STOC’22] and 6.12903 for k-means [Grandoni, Ostrovsky, Rabani, Schulman, Venkat, Inf. Process. Lett.’22]. Those are the best results, even when allowing a complexity FPT in the number of clusters k: this stands in sharp contrast with the $(1+\varepsilon)$-approximation achievable in that case, when allowing randomization.In this paper, we provide deterministic sketches constructions for clustering, whose size bounds are close to the best-known randomized ones. We show how to compute a dimension reduction onto $\varepsilon^{-O(1)} \log k$ dimensions in time $k^{O\left(\varepsilon^{-O(1)}+\log \log k\right)}$ poly $(n d)$, and how to build a coreset of size $O\left(k^{2} \log ^{3} k \varepsilon^{-O(1)}\right)$ in time $2^{\varepsilon^{O(1)} k \log ^{3} k}+k^{O\left(\varepsilon^{-O(1)}+\log \log k\right)}$ poly $(n d)$. In the case where k is small, this answers an open question of [Feldman WIDM’20] and [Munteanu and Schwiegelshohn, Künstliche Intell. ’18] on whether it is possible to efficiently compute coresets deterministically.We also construct a deterministic algorithm for computing $(1+$ $\varepsilon)$-approximation to k-median and k-means in high dimensional Euclidean spaces in time $2^{k^{2} \log ^{3} k / \varepsilon^{O(1)}}$ poly $(n d)$, close to the best randomized complexity of $2^{(k / \varepsilon)^{O(1)}}$ nd (see [Kumar, Sabharwal, Sen, JACM 10] and [Bhattacharya, Jaiswal, Kumar, TCS’18]).Furthermore, our new insights on sketches also yield a randomized coreset construction that uses uniform sampling, that immediately improves over the recent results of [Braverman et al. FOCS ’22] by a factor k.}, author = {Cohen-Addad, Vincent and Saulpic, David and Schwiegelshohn, Chris}, booktitle = {2023 IEEE 64th Annual Symposium on Foundations of Computer Science}, location = {Santa Cruz, CA, United States}, pages = {1105--1130}, publisher = {IEEE}, title = {{Deterministic clustering in high dimensional spaces: Sketches and approximation}}, doi = {10.1109/focs57990.2023.00066}, year = {2023}, } @inproceedings{14771, abstract = {Pruning—that is, setting a significant subset of the parameters of a neural network to zero—is one of the most popular methods of model compression. Yet, several recent works have raised the issue that pruning may induce or exacerbate bias in the output of the compressed model. Despite existing evidence for this phenomenon, the relationship between neural network pruning and induced bias is not well-understood. In this work, we systematically investigate and characterize this phenomenon in Convolutional Neural Networks for computer vision. First, we show that it is in fact possible to obtain highly-sparse models, e.g. with less than 10% remaining weights, which do not decrease in accuracy nor substantially increase in bias when compared to dense models. At the same time, we also find that, at higher sparsities, pruned models exhibit higher uncertainty in their outputs, as well as increased correlations, which we directly link to increased bias. We propose easy-to-use criteria which, based only on the uncompressed model, establish whether bias will increase with pruning, and identify the samples most susceptible to biased predictions post-compression. Our code can be found at https://github.com/IST-DASLab/pruned-vision-model-bias.}, author = {Iofinova, Eugenia B and Peste, Elena-Alexandra and Alistarh, Dan-Adrian}, booktitle = {2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition}, issn = {2575-7075}, location = {Vancouver, BC, Canada}, pages = {24364--24373}, publisher = {IEEE}, title = {{Bias in pruned vision models: In-depth analysis and countermeasures}}, doi = {10.1109/cvpr52729.2023.02334}, year = {2023}, } @article{14772, abstract = {Many coupled evolution equations can be described via 2×2-block operator matrices of the form A=[ A B C D ] in a product space X=X1×X2 with possibly unbounded entries. Here, the case of diagonally dominant block operator matrices is considered, that is, the case where the full operator A can be seen as a relatively bounded perturbation of its diagonal part with D(A)=D(A)×D(D) though with possibly large relative bound. For such operators the properties of sectoriality, R-sectoriality and the boundedness of the H∞-calculus are studied, and for these properties perturbation results for possibly large but structured perturbations are derived. Thereby, the time dependent parabolic problem associated with A can be analyzed in maximal Lpt -regularity spaces, and this is applied to a wide range of problems such as different theories for liquid crystals, an artificial Stokes system, strongly damped wave and plate equations, and a Keller-Segel model.}, author = {Agresti, Antonio and Hussein, Amru}, issn = {0022-1236}, journal = {Journal of Functional Analysis}, keywords = {Analysis}, number = {11}, publisher = {Elsevier}, title = {{Maximal Lp-regularity and H∞-calculus for block operator matrices and applications}}, doi = {10.1016/j.jfa.2023.110146}, volume = {285}, year = {2023}, }