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

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

Journal: :Journal of Scientific Computing 2022

We develop two new ideas for interpolation on $$\mathbb {S}^2$$ . In this first part, we will introduce a simple method named Spherical Interpolation of orDER n (SIDER-n) that gives $$C^{n}$$ interpolant given $$n \ge 2$$ The idea generalizes the construction Bézier curves developed {R}$$ second part incorporates ENO philosophy and develops Essentially Non-Oscillatory (SENO) method. When underl...

2010
David L. Thompson

Difference and sameness -or identity -are correlated concepts: to understand one is to understand the other. I will distinguish two accounts of sameness and difference: first, an essentialist account of sameness against which an understanding of difference is presented as derivative; secondly, a contextualist account which relates both sameness and difference to a more fundamental horizon or co...

2009
B. Vosman

The concept of Essentially derived varieties (EDVs) was introduced in the UPOV 1991 act to protect the interests of the breeder of the initial variety. When a variety is considered as an EDV, authorisation for commercial exploitation is needed from the breeder of the initial variety. There is considerable debate going on about which approaches to use for determining essential derivation and als...

Journal: :Journal of Pure and Applied Algebra 2011

Journal: :Physics of Particles and Nuclei 1999

Journal: :Journal of the Australian Mathematical Society 1971

Journal: :Peace and Conflict: Journal of Peace Psychology 2022

2008
Helmut Friedrich

The content of Einstein's theory of gravitation is encoded in the properties of the solutions to his field equations. There has been obtained a wealth of information about these solutions in the ninety years the theory has been around. It led to the prediction and the observation of physical phenomena which confirm the important role of general relativity in physics. The understanding of the do...

2006
B. BOLLOBÁS

We consider edge colourings of the complete r-uniform hypergraph K (r) n on n vertices. How many colours may such a colouring have if we restrict the number of colours locally? The local restriction is formulated as follows: for a fixed hypergraph H and an integer k we call a colouring (H, k)-local if every copy of H in the complete hypergraph K (r) n receives at most k different colours. We in...

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

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