@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}, } @inbook{14757, abstract = {The cerebral cortex is comprised of a vast cell-type diversity sequentially generated by cortical progenitor cells. Faithful progenitor lineage progression requires the tight orchestration of distinct molecular and cellular mechanisms regulating proper progenitor proliferation behavior and differentiation. Correct execution of developmental programs involves a complex interplay of cell intrinsic and tissue-wide mechanisms. Many studies over the past decades have been able to determine a plethora of genes critically involved in cortical development. However, only a few made use of genetic paradigms with sparse and global gene deletion to probe cell-autonomous vs. tissue-wide contribution. In this chapter, we will elaborate on the importance of dissecting the cell-autonomous and tissue-wide mechanisms to gain a precise understanding of gene function during radial glial progenitor lineage progression.}, author = {Villalba Requena, Ana and Amberg, Nicole and Hippenmeyer, Simon}, booktitle = {Neocortical Neurogenesis in Development and Evolution}, editor = {Huttner, Wieland}, pages = {169--191}, publisher = {Wiley}, title = {{Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression}}, doi = {10.1002/9781119860914.ch10}, 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}, } @article{14770, abstract = {We developed LIONESS, a technology that leverages improvements to optical super-resolution microscopy and prior information on sample structure via machine learning to overcome the limitations (in 3D-resolution, signal-to-noise ratio and light exposure) of optical microscopy of living biological specimens. LIONESS enables dense reconstruction of living brain tissue and morphodynamics visualization at the nanoscale.}, author = {Danzl, Johann G and Velicky, Philipp}, issn = {1548-7105}, journal = {Nature Methods}, keywords = {Cell Biology, Molecular Biology, Biochemistry, Biotechnology}, number = {8}, pages = {1141--1142}, publisher = {Springer Nature}, title = {{LIONESS enables 4D nanoscale reconstruction of living brain tissue}}, doi = {10.1038/s41592-023-01937-5}, volume = {20}, 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}, } @article{14773, abstract = {Through a combination of idealized simulations and real-world data, researchers are uncovering how internal feedbacks and large-scale motions influence cloud dynamics.}, author = {Muller, Caroline J and Abramian, Sophie}, issn = {1945-0699}, journal = {Physics Today}, keywords = {General Physics and Astronomy}, number = {5}, publisher = {AIP Publishing}, title = {{The cloud dynamics of convective storm systems}}, doi = {10.1063/pt.3.5234}, volume = {76}, year = {2023}, } @article{14774, abstract = {Morphogen gradients impart positional information to cells in a homogenous tissue field. Fgf8a, a highly conserved growth factor, has been proposed to act as a morphogen during zebrafish gastrulation. However, technical limitations have so far prevented direct visualization of the endogenous Fgf8a gradient and confirmation of its morphogenic activity. Here, we monitor Fgf8a propagation in the developing neural plate using a CRISPR/Cas9-mediated EGFP knock-in at the endogenous fgf8a locus. By combining sensitive imaging with single-molecule fluorescence correlation spectroscopy, we demonstrate that Fgf8a, which is produced at the embryonic margin, propagates by diffusion through the extracellular space and forms a graded distribution towards the animal pole. Overlaying the Fgf8a gradient curve with expression profiles of its downstream targets determines the precise input-output relationship of Fgf8a-mediated patterning. Manipulation of the extracellular Fgf8a levels alters the signaling outcome, thus establishing Fgf8a as a bona fide morphogen during zebrafish gastrulation. Furthermore, by hindering Fgf8a diffusion, we demonstrate that extracellular diffusion of the protein from the source is crucial for it to achieve its morphogenic potential.}, author = {Harish, Rohit K and Gupta, Mansi and Zöller, Daniela and Hartmann, Hella and Gheisari, Ali and Machate, Anja and Hans, Stefan and Brand, Michael}, issn = {1477-9129}, journal = {Development}, keywords = {Developmental Biology, Molecular Biology}, number = {19}, publisher = {The Company of Biologists}, title = {{Real-time monitoring of an endogenous Fgf8a gradient attests to its role as a morphogen during zebrafish gastrulation}}, doi = {10.1242/dev.201559}, volume = {150}, year = {2023}, } @article{14775, abstract = {We establish a quantitative version of the Tracy–Widom law for the largest eigenvalue of high-dimensional sample covariance matrices. To be precise, we show that the fluctuations of the largest eigenvalue of a sample covariance matrix X∗X converge to its Tracy–Widom limit at a rate nearly N−1/3, where X is an M×N random matrix whose entries are independent real or complex random variables, assuming that both M and N tend to infinity at a constant rate. This result improves the previous estimate N−2/9 obtained by Wang (2019). Our proof relies on a Green function comparison method (Adv. Math. 229 (2012) 1435–1515) using iterative cumulant expansions, the local laws for the Green function and asymptotic properties of the correlation kernel of the white Wishart ensemble.}, author = {Schnelli, Kevin and Xu, Yuanyuan}, issn = {1050-5164}, journal = {The Annals of Applied Probability}, keywords = {Statistics, Probability and Uncertainty, Statistics and Probability}, number = {1}, pages = {677--725}, publisher = {Institute of Mathematical Statistics}, title = {{Convergence rate to the Tracy–Widom laws for the largest eigenvalue of sample covariance matrices}}, doi = {10.1214/22-aap1826}, volume = {33}, year = {2023}, } @article{14776, abstract = {Soluble chaperones residing in the endoplasmic reticulum (ER) play vitally important roles in folding and quality control of newly synthesized proteins that transiently pass through the ER en route to their final destinations. These soluble residents of the ER are themselves endowed with an ER retrieval signal that enables the cell to bring the escaped residents back from the Golgi. Here, by using purified proteins, we showed that Nicotiana tabacum phytaspase, a plant aspartate-specific protease, introduces two breaks at the C-terminus of the N. tabacum ER resident calreticulin-3. These cleavages resulted in removal of either a dipeptide or a hexapeptide from the C-terminus of calreticulin-3 encompassing part or all of the ER retrieval signal. Consistently, expression of the calreticulin-3 derivative mimicking the phytaspase cleavage product in Nicotiana benthamiana cells demonstrated loss of the ER accumulation of the protein. Notably, upon its escape from the ER, calreticulin-3 was further processed by an unknown protease(s) to generate the free N-terminal (N) domain of calreticulin-3, which was ultimately secreted into the apoplast. Our study thus identified a specific proteolytic enzyme capable of precise detachment of the ER retrieval signal from a plant ER resident protein, with implications for the further fate of the escaped resident.}, author = {Teplova, Anastasiia and Pigidanov, Artemii A. and Serebryakova, Marina V. and Golyshev, Sergei A. and Galiullina, Raisa A. and Chichkova, Nina V. and Vartapetian, Andrey B.}, issn = {1422-0067}, journal = {International Journal of Molecular Sciences}, keywords = {Inorganic Chemistry, Organic Chemistry, Physical and Theoretical Chemistry, Computer Science Applications, Spectroscopy, Molecular Biology, General Medicine, Catalysis}, number = {22}, publisher = {MDPI}, title = {{Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3}}, doi = {10.3390/ijms242216527}, volume = {24}, year = {2023}, } @article{14777, abstract = {The effects of the partial V-substitution for Ag on the thermoelectric (TE) properties are investigated for a flexible semiconducting compound Ag2S0.55Se0.45. Density functional theory calculations predict that such a partial V-substitution constructively modifies the electronic structure near the bottom of the conduction band to improve the TE performance. The synthesized Ag1.97V0.03S0.55Se0.45 is found to possess a TE dimensionless figure-of-merit (ZT) of 0.71 at 350 K with maintaining its flexible nature. This ZT value is relatively high in comparison with those reported for flexible TE materials below 360 K. The increase in the ZT value is caused by the enhanced absolute value of the Seebeck coefficient with less significant variation in electrical resistivity. The high ZT value with the flexible nature naturally allows us to employ the Ag1.97V0.03S0.55Se0.45 as a component of flexible TE generators.}, author = {Sato, Kosuke and Singh, Saurabh and Yamazaki, Itsuki and Hirata, Keisuke and Ang, Artoni Kevin R. and Matsunami, Masaharu and Takeuchi, Tsunehiro}, issn = {2158-3226}, journal = {AIP Advances}, keywords = {General Physics and Astronomy}, number = {12}, publisher = {AIP Publishing}, title = {{Improvement of thermoelectric performance of flexible compound Ag2S0.55Se0.45 by means of partial V-substitution for Ag}}, doi = {10.1063/5.0171888}, volume = {13}, year = {2023}, } @article{14778, abstract = {We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.}, author = {Chatterjee, Krishnendu and Kafshdar Goharshady, Ehsan and Novotný, Petr and Zárevúcky, Jiří and Zikelic, Dorde}, issn = {1433-299X}, journal = {Formal Aspects of Computing}, keywords = {Theoretical Computer Science, Software}, number = {2}, publisher = {Association for Computing Machinery}, title = {{On lexicographic proof rules for probabilistic termination}}, doi = {10.1145/3585391}, volume = {35}, year = {2023}, }