Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 724 dari 34197, Total: 341964 data)

Thermodynamic Analysis of Interacting Nucleic Acid Strands

Nama Pengarang :
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 1)
Nomor Halaman : 65-88
Abstraksi Narasi : Motivated by the analysis of natural and engineered DNA and RNA systems, we present the first algorithm for calculating the partition function of an unpseudoknotted complex of multiple interacting nucleic acid strands. This dynamic program is based on a rigorous extension of secondary structure models to the multistranded case, addressing representation and distinguishability issues that do not arise for single?stranded structures. We then derive the form of the partition function for a fixed volume containing a dilute solution of nucleic acid complexes. This expression can be evaluated explicitly for small numbers of strands, allowing the calculation of the equilibrium population distribution for each species of complex. Alternatively, for large systems (e.g., a test tube), we show that the unique complex concentrations corresponding to thermodynamic equilibrium can be obtained by solving a convex programming problem. Partition function and concentration information can then be used to calculate equilibrium base?pairing observables. The underlying physics and mathematical formulation of these problems lead to an interesting blend of approaches, including ideas from graph theory, group theory, dynamic programming, combinatorics, convex optimization, and Lagrange duality.

Generalized Chebyshev Bounds via Semidefinite Programming

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 1)
Nomor Halaman : 52-64
Abstraksi Narasi : A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result generalizes Chebyshev’s inequality for scalar random variables. Two semidefinite programming formulations are presented, with a constructive proof based on convex optimization duality and elementary linear algebra.

A Classification of Spikes and Plateaus

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 1)
Nomor Halaman : 35-51
Abstraksi Narasi : In this paper we classify local maxima into spikes and plateaus. We give analytic definitions for spikes and plateaus in terms of a nonlocal gradient and a fourth order derivative. In higher dimensions the Hesse matrix of  is of relevance. This classification is applied to pattern formation models in mathematical physics and mathematical biology, including Cahn–Hilliard equations, chemotaxis equations, reaction?diffusion equations, Gierer–Meinhardt models, and Gray–Scott models. We show for some of these examples that the stability of spatial patterns depends on the spike versus plateau type of the solution. We prove, for example, that scalar reaction?diffusion equations in any spatial dimension cannot have stable spike steady states.

The Mathematics of Phylogenomics

Nama Pengarang : Lior Pachter
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 49 (No. 1)
Nomor Halaman : 3-31
Abstraksi Narasi : The grand challenges in biology today are being shaped by powerful high?throughput technologies that have revealed the genomes of many organisms, global expression patterns of genes, and detailed information about variation within populations. We are therefore able to ask, for the first time, fundamental questions about the evolution of genomes, the structure of genes and their regulation, and the connections between genotypes and phenotypes of individuals. The answers to these questions are all predicated on progress in a variety of computational, statistical, and mathematical fields. The rapid growth in the characterization of genomes has led to the advancement of a new discipline called phylogenomics. This discipline results from the combination of two major fields in the life sciences: genomics, i.e., the study of the function and structure of genes and genomes; and molecular phylogenetics, i.e., the study of the hierarchical evolutionary relationships among organisms and their genomes. The objective of this article is to offer mathematicians a first introduction to this emerging field, and to discuss specific mathematical problems and developments arising from phylogenomics.

Strings, Chains, and Ropes

Nama Pengarang : Edmond Levy
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 771-781
Abstraksi Narasi : Following Antman [Amer. Math. Mon., 87 (1980), pp. 359–370], we advocate a more physically realistic and systematic derivation of the wave equation suitable for a typical undergraduate course in partial differential equations. To demonstrate the utility of this derivation, three applications that follow naturally are described: strings, hanging chains, and jump ropes.

Dynamical Scaling in Smoluchowski’s Coagulation Equations: Uniform Convergence

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 745-768
Abstraksi Narasi : Smoluchowski’s coagulation equation is a fundamental mean?field model of clustering dynamics. We consider the approach to self?similarity (or dynamical scaling) of the cluster size distribution for the “solvable” rate kernels , and . In the case of continuous cluster size distributions, we prove uniform convergence of densities to a self?similar solution with exponential tail, under the regularity hypothesis that a suitable moment have an integrable Fourier transform. For discrete size distributions, we prove uniform convergence under optimal moment hypotheses. Our results are completely analogous to classical local convergence theorems for the normal law in probability theory. The proofs rely on the Fourier inversion formula and the solution for the Laplace transform by the method of characteristics in the complex plane.

Monte Carlo Tennis

Nama Pengarang : Paul K. Newton
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 722-742
Abstraksi Narasi : The probability of winning a game, set, match, or single elimination tournament in tennis is computed using Monte Carlo simulations based on each player’s probability of winning a point on serve, which can be held constant or varied from point to point, game to game, or match to match. The theory, described in Newton and Keller [Stud. Appl. Math., 114 (2005), pp. 241–269], is based on the assumption that points in tennis are independent, identically distributed (i.i.d.) random variables. This is used as a baseline to compare with the simulations, which under similar circumstances are shown to converge quickly to the analytical curves in accordance with the weak law of large numbers. The concept of the importance of a point, game, and set to winning a match is described based on conditional probabilities and is used as a starting point to model non?i.i.d.effects, allowing each player to vary, from point to point, his or her probability of winning on serve. Several non?i.i.d.models are investigated, including the “hot?hand?effect,” in which we increase each player’s probability of winning a point on serve on the next point after a point is won. The “back?to?the?wall” effect is modeled by increasing each player’s probability of winning a point on serve on the next point after a point is lost. In all cases, we find that the results provided by the theoretical curves based on the i.i.d.assumption are remarkably robust and accurate, even when relatively strong non?i.i.d.effects are introduced. We end by showing examples of tournament predictions from the 2002 men’s and women’s U.S. Open draws based on the Monte Carlo simulations. We also describe Arrow’s impossibility theorem and discuss its relevance with regard to sports ranking systems, and we argue for the development of probability?based ranking systems as a way to soften its consequences.

Globalization Techniques for Newton–Krylov Methods and Applications to the Fully Coupled Solution of the Navier–Stokes Equations

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 700-721
Abstraksi Narasi : A Newton–Krylov method is an implementation of Newton’s method in which a Krylov subspace method is used to solve approximately the linear subproblems that determine Newton steps. To enhance robustness when good initial approximate solutions are not available, these methods are usually globalized, i.e., augmented with auxiliary procedures (globalizations) that improve the likelihood of convergence from a starting point that is not near a solution. In recent years, globalized Newton–Krylov methods have been used increasingly for the fully coupled solution of large?scale problems. In this paper, we review several representative globalizations, discuss their properties, and report on a numerical study aimed at evaluating their relative merits on large?scale two? and three?dimensional problems involving the steady?state Navier–Stokes equations.

The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

Nama Pengarang : Jun Sun
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 681-699
Abstraksi Narasi : We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution at a rate determined by the second smallest eigenvalue  of the Laplacian of the weighted graph. In this paper we consider the problem of assigning transition rates to the edges so as to maximize  subject to a linear constraint on the rates. This is the problem of finding the fastest mixing Markov process (FMMP) on the graph. We show that the FMMP problem is a convex optimization problem, which can in turn be expressed as a semidefinite program, and therefore effectively solved numerically. We formulate a dual of the FMMP problem and show that it has a natural geometric interpretation as a maximum variance unfolding (MVU) problem, the problem of choosing a set of points to be as far apart as possible, measured by their variance, while respecting local distance constraints. This MVU problem is closely related to a problem recently proposed by Weinberger and Saul as a method for “unfolding” high?dimensional data that lies on a low?dimensional manifold. The duality between the FMMP and MVU problems sheds light on both problems, and allows us to characterize and, in some cases, find optimal solutions.

Mode-Locked Soliton Lasers

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 48 (No. 4)
Nomor Halaman : 629-678
Abstraksi Narasi : A comprehensive treatment is given for the formation of mode?locked soliton pulses in optical fiber and solid state lasers. The pulse dynamics is dominated by the interaction of the cubic Kerr nonlinearity and chromatic dispersion with an intensity?dependent perturbation provided by the mode?locking element in the laser cavity. The intensity?dependent perturbation preferentially attenuates low intensity electromagnetic radiation which makes the mode?locked pulses attractors of the laser cavity. A review of the broad spectrum of mode?locked laser models, both qualitative and quantitative, is considered with the basic pulse formation phenomena highlighted. The strengths and weaknesses of each model are considered with two key instabilities studied in detail: Q?switching and harmonic mode?locking. Although the numerous mode?locking models are considerably different, they are unified by the fact that stable solitons are exhibited in each case due to the intensity discrimination perturbation in the laser cavity.
← Kembali ke Halaman Utama