Results 1  10
of
22,699
Accurate whole human genome sequencing using reversible terminator chemistry. Nature 456: 53–59
, 2008
"... ..."
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a long time, ‘variational ’ problems have been identified mostly with the ‘calculus of variations’. In that venerable subject, built around the minimization of integral functionals, constraints were relatively simple and much of the focus was on infinitedimensional function spaces. A major theme was the exploration of variations around a point, within the bounds imposed by the constraints, in order to help characterize solutions and portray them in terms of ‘variational principles’. Notions of perturbation, approximation and even generalized differentiability were extensively investigated. Variational theory progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 415 (40 self)
 Add to MetaCart
In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accurate. We propose a new way of measuring the smoothness of a numerical solution, emulating the idea of minimizing the total variation of the approximation, which results in a 5th order WENO scheme for the case r = 3, instead of the 4th order with the original smoothness measurement by Liu et al. This 5 th order WENO scheme is as fast as the 4 th order WENO scheme of Liu et al. and, both schemes are about twice as fast as the 4th order ENO schemes on vector supercomputers and as fast on serial and parallel computers. For Euler systems of gas dynamics, we suggest to compute the weights from pressure and entropy instead of the characteristic values to simplify the costly characteristic procedure. The resulting WENO schemes are about twice as fast as the WENO schemes using the characteristic decompositions to compute weights, and work well for problems which donot contain strong shocks or strong reflected waves. We also prove that, for conservation laws with smooth solutions, all WENO schemes are convergent. Many numerical tests, including the 1D steady state nozzle flow problem and 2D shock entropy waveinteraction problem, are presented to demonstrate the remarkable capability of the WENO schemes, especially the WENO scheme using the new smoothness measurement, in resolving complicated shock and flow structures. We have also applied Yang's artificial compression method to the WENO schemes to sharpen contact discontinuities.
Conformal deformation of a Riemannian metric to constant curvature
 J. Diff. Geome
, 1984
"... A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe&apos ..."
Abstract

Cited by 318 (0 self)
 Add to MetaCart
A wellknown open question in differential geometry is the question of whether a given compact Riemannian manifold is necessarily conformally equivalent to one of constant scalar curvature. This problem is known as the Yamabe problem because it was formulated by Yamabe [8] in 1960, While Yamabe's paper claimed to solve the problem in the affirmative, it was found by N. Trudinger [6] in 1968 that Yamabe's paper was seriously incorrect. Trudinger was able to correct Yamabe's proof in case the scalar curvature is nonpositive. Progress was made on the case of positive scalar curvature by T. Aubin [1] in 1976. Aubin showed that if dim M> 6 and M is not conformally flat, then M can be conformally changed to constant scalar curvature. Up until this time, Aubin's method has given no information on the Yamabe problem in dimensions 3, 4, and 5. Moreover, his method exploits only the local geometry of M in a small neighborhood of a point, and hence could not be used on a conformally flat manifold where the Yamabe problem is clearly a global problem. Recently, a number of geometers have been interested in the conformally flat manifolds of positive scalar curvature where a solution of Yamabe's problem gives a conformally flat metric of constant scalar curvature, a metric of some geometric interest. Note that the class of conformally flat manifolds of positive scalar curvature is closed under the operation of connected sum, and hence contains connected sums of spherical space forms with copies of Sι X Sn~ι. In this paper we introduce a new global idea into the problem and we solve it in the affirmative in all remaining cases; that is, we assert the existence of a positive solution u on M of the equation
SPARSKIT: a basic tool kit for sparse matrix computations  Version 2
, 1994
"... . This paper presents the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate exchange of software and data between researchers in sparse matrix computations. Our starting point is the Harwell/Boei ..."
Abstract

Cited by 317 (22 self)
 Add to MetaCart
. This paper presents the main features of a tool package for manipulating and working with sparse matrices. One of the goals of the package is to provide basic tools to facilitate exchange of software and data between researchers in sparse matrix computations. Our starting point is the Harwell/Boeing collection of matrices for which we provide a number of tools. Among other things the package provides programs for converting data structures, printing simple statistics on a matrix, plotting a matrix profile, performing basic linear algebra operations with sparse matrices and so on. Work done partly at CSRD, university of Illinois and partly at RIACS (NASA Ames Research Center). Current address: Computer Science Dept., University of Minnesota, Minneapolis, MN 55455. This work was supported in part by the NAS Systems Division, via Cooperative Agreement NCC 2387 between NASA and the University Space Research Association (USRA) and in part by the Department of Energy under grant DEFG02...
On the Effectiveness of RouteBased Packet Filtering for Distributed DoS Attack Prevention in PowerLaw Internets
 In Proc. ACM SIGCOMM
, 2001
"... Denial of service (DoS) attack on the Internet has become a pressing problem. In this paper, we describe and evaluate routebased distributed packet filtering (DPF), a novel approach to distributed DoS (DDoS) attack prevention. We show that DPF achieves proactiveness and scalability, and we show tha ..."
Abstract

Cited by 276 (7 self)
 Add to MetaCart
Denial of service (DoS) attack on the Internet has become a pressing problem. In this paper, we describe and evaluate routebased distributed packet filtering (DPF), a novel approach to distributed DoS (DDoS) attack prevention. We show that DPF achieves proactiveness and scalability, and we show that there is an intimate relationship between the effectiveness of DPF at mitigating DDoS attack and powerlaw network topology. The salient features of this work are twofold. First, we show that DPF is able to proactively filter out a significant fraction of spoofed packet flows and prevent attack packets from reaching their targets in the first place. The IP flows that cannot be proactively curtailed are extremely sparse so that their origin can be localizedi.e., IP traceback to within a small, constant number of candidate sites. We show that the two proactive and reactive performance effects can be achieved by implementing routebased filtering on less than 20% of Internet autonomous system (AS) sites. Second, we show that the two complementary performance measures are dependent on the properties of the underlying AS graph. In particular, we show that the powerlaw structure of Internet AS topology leads to connectivity properties which are crucial in facilitating the observed performance effects.
Dong Lu Applications of SRPT Scheduling with Inaccurate Information
"... The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield the smallest mean response time, and recently it was proven its performance gain over Processor Sharing (PS) usually does not come at the expense of large jobs. However, despite the many advantages of ..."
Abstract
 Add to MetaCart
The Shortest Remaining Processing Time (SRPT) scheduling policy was proven, in the 1960s, to yield the smallest mean response time, and recently it was proven its performance gain over Processor Sharing (PS) usually does not come at the expense of large jobs. However, despite the many advantages of SRPT scheduling, it is not widely applied. One important reason for the sporadic application of SRPT scheduling is that accurate job size information is often unavailable. Our previous work addressed the performance and fairness issues of SRPT scheduling when job size information is inaccurate. We found that SRPT (and FSP) scheduling outperforms PS as long as there exists a (rather small) amount of correlation between the estimated job size and the actual job size. In the work we summarize here, we have developed job size estimation techniques to support the application of SRPT to web server and PeertoPeer server side scheduling. We have evaluated our techniques with extensive simulation studies and real world implementation and measurement.
DONG Energy
, 2012
"... Safety under project reference number 0325307. The authors are responsible for the content of this publication. ..."
Abstract
 Add to MetaCart
Safety under project reference number 0325307. The authors are responsible for the content of this publication.
Results 1  10
of
22,699