نتایج جستجو برای: closures

تعداد نتایج: 4617  

Journal: :SIAM J. Scientific Computing 2010
Cory D. Hauck Ryan G. McClarren

We introduce a modification to the standard spherical harmonic closure used with linear kinetic equations of particle transport. While the standard closure is known to produce negative particle concentrations, the modification corrects this defect by requiring that the ansatz used to the close the equations is itself a non-negative function. We impose this requirement via explicit constraints i...

2012
Sebastian Biallas Jörg Brauer Andy King Stefan Kowalewski

Loop leaping is the colloquial name given to a form of program analysis in which summaries are derived for nested loops starting from the innermost loop and proceeding in a bottom-up fashion considering one more loop at a time. Loop leaping contrasts with classical approaches to finding loop invariants that are iterative; loop leaping is compositional requiring each stratum in the nest of loops...

1988
Andrew W. Appel

There are two different commonly-used evaluation methods for functional languages: normal-order graph reduction, and call-by-value execution of closure code. The former is usually more expensive per operation, but has the capability of partially evaluating functions before they are applied. The latter method usually leads to faster execution — and is thus used in most compilers — but can’t ‘‘op...

1988
Thomas M. Breuel

We describe an extension of the C++ programming language that allows the nesting of function definitions and provides lexical closures with dynamic lifetime. Our primary motivation for this extension is that it allows the programmer to define iterators for collection classes simply as member functions. Such iterators take function pointers or closures as arguments; providing lexical closures le...

2003
Ahsan Kareem Emil Simiu Fahim Sadek Michael A. Riley

Emil Simiu; Fahim Sadek; and Michael A. Riley NIST Fellow, Building and Fire Research Laboratory, National Institutes of Standards and Technology, Gaithersburg, MD 20899-8611. E-mail: [email protected] Research Structural Engineer, Building and Fire Research Laboratory, National Institutes of Standards and Technology, Gaithersburg, MD 20899-8611. E-mail: [email protected] Research Structur...

2006
D. P. Kothari

[ 1 ] E. Hirst, "Reliability rules should not ignore economics and probability," Electricity J., vol. 12, no. 7, pp. 7-8, 1999. [2] M. J. Besnir, A. S. Farag, and T. C. Cheng, "New comprehensive reliability assessment framework for power system," Energy Corners. Manage., vol. 40, no. 9, pp. 975-1007, 1999. [3] P. R. Mishra and J. C. Joshi, "Reliability estimation for components of photovoltaic ...

2004
Ekaterina Pervova

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms. However, we introduce an infinite series of groups for which that is not so, and describe the kernels of natural homomorphisms of the profinite completions on...

2003
RALF SCHIFFLER

Let U+ be the positive part of the quantized enveloping algebra U of type An. The change of basis between canonical, and PBW-basis of U+ has a geometric interpretation in terms of local intersection cohomology of some affine algebraic varieties, namely the Zariski closures of orbits of representations of a quiver of type An. In this paper we study the local rational smoothness of these orbit cl...

Journal: :Journal of Graph Theory 2012
Jochen Harant Arnfried Kemnitz Akira Saito Ingo Schiermeyer

In 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v )≥n for every pair of nonadjacent vertices u and v , then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so-called “Ore-type degree conditions”. In [R. J. Faudree, R. H. Schelp, A. Saito, and I. Schiermeyer, Discrete Math 307 (2007), 873–87...

2010
Sashi K. Kunnath YeongAe Heo Jon F. Mohle Edoardo Cosenza Fiorenzo De Cicco Andrea Prota

Edoardo Cosenza; Fiorenzo De Cicco, Ph.D.; and Andrea Prota Full Professor, Dept. of Structural Engineering, Univ. of Naples “Federico II”, Via Claudio 21, 80125 Naples, Italy. E-mail: cosenza@ unina.it Dept. of Structural Engineering, Univ. of Naples “Federico II”, Via Claudio 21, 80125 Naples, Italy. E-mail: [email protected] Assistant Professor, Dept. of Structural Engineering, Univ....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید