检索结果-内蒙古大学图书馆

Time-frequency and time-scale canonical representations of doubly spread channels

学校读者我要写书评

暂无评论

Time-frequency and time-scale canonical representations of d...

European Signal Processing Conference (EUSIPCO)

作者： Radu Balan H. Vincent Poor Scott Rickard Sergio Verdú Siemens Corporate Research Princeton New Jersey Program in Applied and Computational Mathematics Princeton University Princeton New Jersey U.S.A Electronic and Electrical Engineering Department University College Dublin Ireland

A general technique for the generation of canonical channel models and demonstrate the application of the technique to time-frequency and time-scale integral kernel operators is developed. As an example, the derivation of Sayeed/Aazhang's time-frequency canonical channel characterization that forms the basis for the time-frequency RAKE receiver is shown. Then, a canonical time-scale channel model for wideband communication is developed.

关键词： Abstracts Generators

Density-based and transport-based core-periphery structures in networks

学校读者我要写书评

暂无评论

Physical Review E 2014年第3期89卷 032810-032810页

作者： Sang Hoon Lee Mihai Cucuringu Mason A. Porter Oxford Centre for Industrial and Applied Mathematics Mathematical Institute University of Oxford Oxford OX2 6GG United Kingdom Program in Applied and Computational Mathematics (PACM) Princeton University Fine Hall Washington Road Princeton New Jersey 08544-1000 USA Department of Mathematics University of California Los Angeles Los Angeles California 90095 USA CABDyN Complexity Centre University of Oxford Oxford OX1 1HP United Kingdom

Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks—including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

关键词： MESOSCALE convective complexes -- Computer simulation COMMUNITY organization TRANSPORTATION SOCIAL networks DENSITY MARKOV processes DEPENDENCY (Imperialism)

Singularities of quantum control landscapes

学校读者我要写书评

暂无评论

Physical Review A 2012年第1期86卷 013405-013405页

作者： Re-Bing Wu Ruixing Long Jason Dominy Tak-San Ho Herschel Rabitz Department of Automation Tsinghua University Beijing 100084 China and Center for Quantum Information Science and Technology TNList Beijing 100084 China Department of Chemistry Princeton University Princeton New Jersey 08544 USA Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA

Quantum control landscape theory was formulated to assess the ease of finding optimal control fields in simulations and in the laboratory. The landscape is the observable as a function of the controls, and a primary goal of the theory is the analysis of landscape features. In what is referred to as the kinematic picture of the landscape, prior work showed that the landscapes are generally free of traps that could halt the search for an optimal control at a suboptimal observable value. The present paper considers the dynamical picture of the landscape, seeking the existence of singular controls, especially of a nonkinematic nature along with an assessment of whether they correspond to traps. We analyze the necessary and sufficient conditions for singular controls to be kinematic or nonkinematic critical solutions and the likelihood of their being encountered while maximizing an observable. An algorithm is introduced to seek singular controls on the landscape in simulations along with an associated Hessian landscape analysis. Simulations are performed for a large number of model finite-level quantum systems, showing that all the numerically identified kinematic and nonkinematic singular critical controls are not traps, in support of the prior empirical observations on the ease of finding high-quality optimal control fields.

关键词： QUANTUM theory LANDSCAPES COMPUTER simulation OPTIMAL control theory ALGORITHMS

GLOBAL SOLUTIONS TO THE SUPERCOOLED STEFAN PROBLEM WITH BLOW-UPS: REGULARITY AND UNIQUENESS

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Delarue, François Nadtochiy, Sergey Shkolnikov, Mykhaylo Université Côte d’Azur CNRS Laboratoire J.A. Dieudonné Nice France Department of Applied Mathematics Illinois Institute of Technology ChicagoIL60616 United States ORFE Department Bendheim Center for Finance and Program in Applied & Computational Mathematics Princeton University PrincetonNJ08544 United States

We consider the supercooled Stefan problem, which captures the freezing of a supercooled liquid, in one space dimension. A probabilistic reformulation of the problem allows to define global solutions, even in the presence of blow-ups of the freezing rate. We provide a complete description of such solutions, by relating the temperature distribution in the liquid to the regularity of the ice growth process. The latter is shown to transition between (i) continuous differentiability, (ii) Hölder continuity, and (iii) discontinuity. In particular, in the second regime we rediscover the square root behavior of the growth process pointed out by Stefan in his seminal paper [Ste89] from 1889 for the ordinary Stefan problem. In our second main theorem, we establish the uniqueness of the global solutions, a first result of this kind in the context of growth processes with singular self-excitation when blow-ups are *** Codes 80A22, 35B44, 60H30, 35B05 Copyright © 2019, The Authors. All rights reserved.

关键词： Supercooling

Biwhitening reveals the rank of a count matrix

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Landa, Boris Zhang, Thomas T.C.K. Kluger, Yuval Program in Applied Mathematics Yale University United States Department of Electrical and Systems Engineering University of Pennsylvania United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University United States Department of Pathology Yale University School of Medicine United States

Estimating the rank of a corrupted data matrix is an important task in data analysis, most notably for choosing the number of components in PCA. Significant progress on this task was achieved using random matrix theory by characterizing the spectral properties of large noise matrices. However, utilizing such tools is not straightforward when the data matrix consists of count random variables, e.g., Poisson, in which case the noise can be heteroskedastic with an unknown variance in each entry. In this work, we consider a Poisson random matrix with independent entries, and propose a simple procedure termed biwhitening for estimating the rank of the underlying signal matrix (i.e., the Poisson parameter matrix) without any prior knowledge. Our approach is based on the key observation that one can scale the rows and columns of the data matrix simultaneously so that the spectrum of the corresponding noise agrees with the standard Marchenko-Pastur (MP) law, justifying the use of the MP upper edge as a threshold for rank selection. Importantly, the required scaling factors can be estimated directly from the observations by solving a matrix scaling problem via the Sinkhorn-Knopp algorithm. Aside from the Poisson, our approach is extended to families of distributions that satisfy a quadratic relation between the mean and the variance, such as the generalized Poisson, binomial, negative binomial, gamma, and many others. This quadratic relation can also account for missing entries in the data. We conduct numerical experiments that corroborate our theoretical findings, and showcase the advantage of our approach for rank estimation in challenging regimes. Furthermore, we demonstrate the favorable performance of our approach on several real datasets of single-cell RNA sequencing (scRNA-seq), High-Throughput Chromosome Conformation Capture (Hi-C), and document topic *** Codes 62H12, 62H25. Copyright © 2021, The Authors. All rights reserved.

关键词： Random variables

Unusually Dense Crystal Packings of Ellipsoids

学校读者我要写书评

暂无评论

Physical Review Letters 2004年第25期92卷 255506-255506页

作者： Aleksandar Donev Frank H. Stillinger P. M. Chaikin Salvatore Torquato Program in Applied and Computational Mathematics Princeton University Princeton New Jersey 08544 USA Materials Institute Princeton New Jersey 08544 USA Department of Chemistry Princeton University Princeton New Jersey 08544 USA Department of Physics Princeton University Princeton New Jersey 08544 USA

In this Letter, we report on the densest-known packings of congruent ellipsoids. The family of new packings consists of crystal arrangements of spheroids with a wide range of aspect ratios, and with density φ always surpassing that of the densest Bravais lattice packing φ≈0.7405. A remarkable maximum density of ϕ≈0.7707 is achieved for maximal aspect ratios larger than 3, when each ellipsoid has 14 touching neighbors. Our results are directly relevant to understanding the equilibrium behavior of systems of hard ellipsoids, and, in particular, the solid and glassy phases.

关键词： .aspect ratios ellipsoids Spheroids Jersey USA densest lattice packing Crystal Packings Princeton New congruent maximal aspect

Parallel block-preconditioned monolithic solvers for fluid-structure-interaction problems

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Jodlbauer, D. Langer, U. Wick, T. Doctoral Program on Computational Mathematics Johannes Kepler University Altenbergerstr. 69 LinzA-4040 Austria Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstr. 69 LinzA-4040 Austria Institut für Angewandte Mathematik Leibniz Universität Hannover Welfengarten 1 Hannover30167 Germany

In this work, we consider the solution of fluid-structure interaction problems using a monolithic approach for the coupling between fluid and solid subproblems. The coupling of both equations is realized by means of the arbitrary Lagrangian-Eulerian framework and a nonlinear harmonic mesh motion model. Monolithic approaches require the solution of large, ill-conditioned linear systems of algebraic equations at every Newton step. Direct solvers tend to use too much memory even for a relatively small number of degrees of freedom, and, in addition, exhibit superlinear grow in arithmetic complexity. Thus, iterative solvers are the only viable option. To ensure convergence of iterative methods within a reasonable amount of iterations, good and, at the same time, cheap preconditioners have to be developed. We study physics-based block preconditioners, which are derived from the block LDU-factorization of the FSI Jacobian, and their performance on distributed memory parallel computers in terms of two- and three-dimensional test cases permitting large deformations.65N30, 65M60, 49M15, 35Q74 Copyright © 2018, The Authors. All rights reserved.

关键词： Iterative methods

Multigoal-oriented error estimates for non-linear problems

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Endtmayer, B. Langer, U. Wick, T. Doctoral Program on Computational Mathematics Johannes Kepler University Altenbergerstr. 69 LinzA-4040 Austria Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstr. 69 LinzA-4040 Austria Institut für Angewandte Mathematik Leibniz Universität Hannover Welfengarten 1 Hannover30167 Germany

In this work, we further develop multigoal-oriented a posteriori error estimation with two objectives in mind. First, we formulate goal-oriented mesh adaptivity for multiple functionals of interest for nonlinear problems in which both the Partial Differential Equation (PDE) and the goal functionals may be nonlinear. Our method is based on a posteriori error estimates in which the adjoint problem is used and a partition-of-unity is employed for the error localization that allows us to formulate the error estimator in the weak form. We provide a careful derivation of the primal and adjoint parts of the error estimator. The second objective is concerned with balancing the nonlinear iteration error with the discretization error yielding adaptive stopping rules for Newton's method. Our techniques are substantiated with several numerical examples including scalar PDEs and PDE systems, geometric singularities, and both nonlinear PDEs and nonlinear goal functionals. In these tests, up to six goal functionals are simultaneously controlled. Copyright © 2018, The Authors. All rights reserved.

关键词： Newton-Raphson method

OnsagerNet: Learning stable and interpretable dynamics using a generalized Onsager principle

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yu, Haijun Tian, Xinyuan Weinan, E. Li, Qianxiao NCMIS LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China Department of Mathematics The Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States Department of Mathematics National University of Singapore Singapore119077 Singapore Institute of High Performance Computing A*STAR Singapore138632 Singapore

We propose a systematic method for learning stable and physically interpretable dynamical models using sampled trajectory data from physical processes based on a generalized Onsager principle. The learned dynamics are autonomous ordinary differential equations parameterized by neural networks that retain clear physical structure information, such as free energy, diffusion, conservative motion and external forces. For high dimensional problems with a low dimensional slow manifold, an autoencoder with metric preserving regularization is introduced to find the low dimensional generalized coordinates on which we learn the generalized Onsager dynamics. Our method exhibits clear advantages over existing methods on benchmark problems for learning ordinary differential equations. We further apply this method to study Rayleigh-Bénard convection and learn Lorenz-like low dimensional autonomous reduced order models that capture both qualitative and quantitative properties of the underlying dynamics. This forms a general approach to building reduced order models for forced dissipative *** Codes 76E30, 34D20, 68T05/07, 82C35 Copyright © 2020, The Authors. All rights reserved.

关键词： Ordinary differential equations