نتایج جستجو برای: gabriel marcel and tillich

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

Journal: :CoRR 2011
Abhijeet Khopkar Sathish Govindarajan

Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) were proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the gr...

2004
Gabriel Virella

CLINICAL CHEMISTRY, Vol. 24, No. 3, 1978 515 Fig. 1. Results of an experiment designed to determine whether formation of Iysozyme-anti-lysozyme complexes changes the electrophoretic mobility of the enzyme (A, B) Stained electrophoresis and corresponding imprint of two samples of serum from a sheet immunized with human lgG. one of them having previously been incubated with lysozyme (S+ L). Notic...

2001
Gabriel Germán Subir Sarkar

We show that the scale of the inflationary potential may be the electroweak scale or even lower, while still generating an acceptable spectrum of primordial density perturbations. Thermal effects readily lead to the initial conditions necessary for low scale inflation to occur, and even the moduli problem can be evaded if there is such an inflationary period. We discuss how low scale inflationa...

2004

It was stated by Paul Tillich in 1929 that “The boundary is the best place for acquiring knowledge” [1]. His quotation comes neither from mineralogy nor from surface chemistry but from theology, and is a reminder that boundaries are the places where changes take place and it is there that processes of change can often be properly understood. In the case of minerals, the boundary is the surface ...

2018
Christopher Harding

This article explores the scope of 'religion-psy dialogue' in the mid-twentieth century, via a case study from Japan: Kosawa Heisaku, a Buddhist psychoanalyst based in Tokyo. By putting this case study in brief comparative perspective, with the conversation that took place in 1965 between Paul Tillich and Carl Rogers, the article discusses both the promise and the pitfalls of the modern and con...

2004
Piet J. A. M. Kerkhof Marcel A. M. Geboers

Piet J.A.M. Kerkhof and Marcel A.M. Geboers (Transport Phenomena Group, Department of Chemical Engineering and Chemistry, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands, email: [email protected]) © 2004 Piet J.A.M. Kerkhof & Marcel A.M. Geboers, Prepared for Presentation at AIChE Annual Meeting, November 8, 2004, Session [198] – Fundamental Research in Tra...

1996
Giuseppe Liotta

In the context of robust computational geometry we focus on the problem of computing and checking Gabriel graphs with algorithms that are not aaected by degenaracies and have low arithmetic demand. A simple and practical linear-time algorithm is presented that constructs the Gabriel Graph of a nite point set on the plane from its Delaunay diagram. The degree of the algorithm, i.e. a measure of ...

2008
BO CHEN

Let Λ be a radical-square zero algebra over an algebraically closed field k with radical r and Γ = Λ/r 0 r Λ/r ! be the associated hereditary algebra. There is a well-known functor F : modΛ→modΓ which induces a stable equivalence. We show that the functor F keeps Gabriel-Roiter measures and Gabriel-Roiter factors. Thus one may study the Gabriel-Roiter measure for Λ using F and known facts for h...

2009
Prosenjit Bose Jean Cardinal Sébastien Collette Erik D. Demaine Belén Palop Perouz Taslakian Norbert Zeh

We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with βskeletons for β ∈ [0, 1] (such as sublinear spanning ratio) with the added benefit of planarity (and consequently linear size and local routability).

Journal: :CoRR 2014
Ahmad Biniaz Anil Maheshwari Michiel H. M. Smid

Given a set P of n points in the plane, the order-k Gabriel graph on P , denoted by k-GG, has an edge between two points p and q if and only if the closed disk with diameter pq contains at most k points of P , excluding p and q. We study matching problems in k-GG graphs. We show that a Euclidean bottleneck perfect matching of P is contained in 10-GG, but 8-GG may not have any Euclidean bottlene...

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

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