| H. Rootzen. Extremes of moving averages of stable processes. Annals Probab., 6: 847--869, 1978. Department of Mathematics, City College, New York, NY 10031, USA E-mail address : mbmarcus@earthlink.net Department of Mathematics, University of Tennessee, Knoxville, TN 39996, USA E-mail address : rosinski@math.utk.edu |
....2 (O F ) and the value of the zeta function of F at 1 when F is a totally real eld. For abelian number elds, this conjecture has been con rmed up to powers of 2 [7] In [12] a 2 rank formula for K 2 (O F ) was given by Tate. Some results on the 4 rank of K 2 (O F ) were given in [9] 10] and [13]. To gain further insight on the 4 rank of K 2 (O F ) we consider the following speci c families of elds. In this paper we deal with the 4 rank of the Milnor K group K 2 (O) for the quadratic number elds Q ( p pl) Q ( p 2pl) Q ( p pl) Q( p 2pl) for primes p 7 mod 8, l 1 mod 8 ....
A. Vazzana, 4-ranks of K 2 of rings of integers in quadratic number elds, Ph.D. Thesis, University of Michigan, 1998. Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803 E-mail address : osburn@math.lsu.edu
.... and finegrained guarantees about the integrity of data abstraction boundaries (e.g. validity of capabilities or kernel data) Although we have worked out many of the theoretical underpinnings for SCC (and indeed, most of the theory is based on old and well known principles from logic, type theory [2, 9], and formal verification [4, 7] there are many difficult problems that remain to be solved. In particular, we do not know at this point the most practical way to generate the certificates. We have thus set out to gain some preliminary experience, both to measure the benefits and to identify the ....
Martin-L of, P. A theory of types. Technical Report 71--3, Department of Mathematics, University of Stockholm, 1971.
....carried out if the function OE is replaced by . Based on the functions OE, and other smoothing functions, a number of non interior path following algorithms have recently been proposed that are globally convergent or globally linearly convergent and possess rapid local convergence properties [2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 20, 21, 25, 27, 28]. Interested readers are referred to [3] for more references. In [3] Burke and Xu propose the first non interior predictor corrector algorithm for monotone LCP. The central idea is to apply Newton s method to equations of the form F (x; y; v for various choices of the right hand side v ....
, Analysis of a non--interior continuation method based on Chen--Mangasarian smoothing functions for complementarity problems. Department of Mathematics, Box 345350, University of Washington, Seattle, WA 98195, U. S. A., July, 1997.
....corrector steps are based on finitely terminating backtracking procedures and as such are easily implemented. A number of non interior path following algorithms have recently been proposed that are globally convergent or globally linearly convergent and possess rapid local convergence properties [2, 3, 4, 5, 7, 8, 10, 11, 13, 18, 19, 23, 25, 26]. The papers [7, 8, 11, 19] are not path following algorithms and do not establish global rates of convergence. In [7] Chen, Qi, and Sun consider smoothing methods for box constrained variational inequalities and established the global convergence and the local super linear convergence of their ....
....two backtracking line searches are required to obtain both global linear and local super linear convergence. In [3] Chen and Chen use a new technique for dynamically updating the neighborhood of the central path in order to establish global convergence and local super linear convergence. In [23], Tseng combines proof techniques developed in [22] for infeasible interior point methods with the neighborhood ideas for non interior point methods to obtain a global linear convergence for infeasible non interior path following methods. The search direction is a combination of a centering step ....
, Analysis of a non--interior continuation method based on Chen--Mangasarian smoothing functions for complementarity problems. Department of Mathematics, Box 345350, University of Washington, Seattle, WA 98195, U. S. A., July, 1997.
.... Berkeley Packet Filters [12] Software Fault Isolation [24] and programming in the safe subset of Modula 3 [1, 9, 17] Although we have worked out many of the theoretical underpinnings for PCC (and indeed, most of the theory is based on old and well known principles from logic, type theory [4, 11], and formal verification [5, 6, 8] there are many difficult problems that remain to be solved before the approach can be considered practical. To mention just one here, we do not know at this moment what is the most practical way to generate the safety proofs. A more in depth discussion of ....
....for the Internet Checksum. On input the packet start address is in r 16 and its length in r 17 . 8 Practical Difficulties Although we have worked out many of the theoretical underpinnings for PCC (and indeed, most of the theory is based on old and well known principles from logic, type theory [4, 11], and formal verification [5, 6, 8] there are many difficult problems that remain to be solved. In this section we discuss some of the problematic issues that were brought to light by our experiment. Fortunately we think that we have found good practical solutions to the part of the PCC ....
Martin-L of, P. A theory of types. Technical Report 71--3, Department of Mathematics, University of Stockholm, 1971.
.... does not exploit the fact that file descriptors are represented as integers (by incrementing a file descriptor, for example) Although we have worked out many of the theoretical underpinnings for PCC (and indeed, most of the theory is based on old and well known principles from logic, type theory [4, 11], and formal verification [5, 6, 8] there are many difficult problems that remain to be solved. In particular we do not know at this point the most practical way to generate the proofs. We have thus set out to gain some preliminary experience, both to measure the benefits and to identify the ....
Martin-L of, P. A theory of types. Technical Report 71--3, Department of Mathematics, University of Stockholm, 1971.
No context found.
H. Rootzen. Extremes of moving averages of stable processes. Annals Probab., 6: 847--869, 1978. Department of Mathematics, City College, New York, NY 10031, USA E-mail address : mbmarcus@earthlink.net Department of Mathematics, University of Tennessee, Knoxville, TN 39996, USA E-mail address : rosinski@math.utk.edu
....their behavior is qualitatively the same, or different. Eventually, of course, one would want to look directly at two dimensional problems. At the moment, there are many unsolved problem associated with multidimensional flow; multiple characteristics may not be the most significant. Yuxi Zheng, [Zhe98], has investigated models which display eigenvalue coincidence and eigenvector deficiency everywhere. Among kinematic equations, these are the systems that also have trace zero (See the second to last paragraph of Section 1. Zheng s algorithm finds flux functions, both kinematic and general, ....
....for example on astronomical scales, ERS96, SZ89] Typically, the characteristics are linearly degenerate, and singularities appear in the solutions which resemble Dirac ffi functions supported on curves. An example is analysed by Bouchut in [Bou94] see also the discussion and references in [Zhe98]. 2.2. The Crossing of Eigenvalues. Twenty years ago, H. C. Kranzer and B. L. Keyfitz solved two Riemann problems which were almost the first examples of nonstrictly hyperbolic systems. They were both systems of two equations. It is convenient to use the notation U = u 1 ; u 2 ) r cos ; r ....
Y. Zheng, Systems of conservation laws with incomplete sets of eigenvectors everywhere, A Volume Dedicated to Professor Xiaqi Ding's 70th Birthday, to appear, 1998. Department of Mathematics, University of Houston, Houston, Texas 77204-3476 E-mail address: keyfitz@uh.edu Department of Mathematics, University of Houston, Houston, Texas 77204-3476 E-mail address: mora@math.uh.edu
....there exists some mouse M such that A Delta = R M, we actually describe M in terms of the large cardinal axioms which it satisfies. Independently, and using entirely different techniques, Woodin has shown that A Delta is a mouse set for Delta = Delta 1 (J (R) for all limit ordinals . See [St4]. Woodin s proof shows only that there exists some mouse M such that A Delta = R M. The mouse M is not described in terms of the large cardinal axioms which it satisfies. Now we turn to the topic of the current paper. In this paper we will show that A Delta is a mouse set, for Delta = the ....
J. R. Steel, A theorem of woodin's on mouse sets, Unpublished notes, 1996. Department of Mathematics, Florida International University, Miami, FL 33199 E-mail address: rudomine@fiu.edu 23
.... SMOOTHING FOR COMPLEMENTARITY PROBLEMS 3 Smoothing methods of this kind were considered, e.g. by Chen and Harker [6] Chen and Mangasarian [9] Kanzow [26] Gabriel and Mor e [20] Burke and Xu [3, 43] Xu [41, 42] Hotta and Yoshise [23] Chen and Ye [11] Chen and Chen [4] Jiang [24] and Tseng [40]. In particular, the paper [3] by Burke and Xu initiated much of the recent research in this area. The disadvantage of smoothing methods is that they usually require F to be at least a P 0 function in order to guarantee that the linear systems (4) are solvable. It seems difficult to make ....
P. Tseng: Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. Technical Report, Department of Mathematics, University of Washington, Seattle, WA, July 1997.
No context found.
Bridge estimation of the probability density at a point, con Geo Nicholls, Department of Mathematics, Auckland University, New Zealand, 2000.
No context found.
J.D. Ullman Principles of Database Systems, Computer Science Press, 1983. Department of Mathematics, University of Michigan, Ann Arbor E-mail address : saugata@math.lsa.umich.edu
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC