نتایج جستجو برای: r etheta e cluster points

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

2010
Franz Hackl Michael E. Kummer Rudolf Winter-Ebmer

Basu (2006) argues that the prevalence of 99 cent prices in shops can be explained with rational consumers who disregard the rightmost digits of the price. This bounded rational behaviour leads to a Bertrand equilibrium with positive markups. We use data from an Austrian price comparison site and find results highly compatible with Basu’s theory. We can show that price points in particular pric...

2007
PAUL ERDÖS

The present note contains some elementary remarks on sets defined by simple geometric properties. Our main tool will be the Lebesgue density theorem. First we introduce a few notations : d(a, b) denotes the distance from a to b and Six, r) the open sphere of center x and radius r. A point x of a set A is said to be of metric density 1 if to every e there exists a ô such that AC\S{x, r) , r < 5,...

2015
Jens Vygen

Here we are given a finite connected undirected graph (V,E) (so V is the set of vertices and E the set of edges) and weights on the edges, i.e., c(e) ∈ R for all e ∈ E. The task is to find a set T ⊆ E such that (V, T ) is a (spanning) tree and ∑ e∈T c(e) is minimum. (Recall that a tree is a connected graph without cycles.) The figure below shows on the left a set V of eight points in the Euclid...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید باهنر کرمان - دانشکده ریاضی و کامپیوتر 1388

r حلقه دلخواه و یکدار است. فرض کنید ،(prim, (r) ، max,(r) ، spec(r) ) spec,(r) مجموعه همه ایده¬آل¬های اول راست(اول چپ، بیشین راست، اولیه راست) از r و ur(er)={pϵ spec r(r) | e ∉ p} باشد. همچنین فرض کنید a=u _(peprim,(r) ) specr^p(r) باشد، جایی که specrp(r) ={qϵ spec r(r) |(r/q)r ḻ =p} . در این پایان¬نامه ما به بررسی ارتباط برخی خواص حلقه و شرایط توپولوژیک روی (spec r(r و خواص توپولوژی زاریسکی ضع...

2007
D. B. Powell E. A. Lee W. C. Newman S. S. Bhattacharyya J. Buck S. Ha D. G. Messerschmitt L. J. Hendren G. R. Gao E. R. Altman J. L. Hennessy D. A. Patterson W. H. Ho

Managing the buffering of data along arcs is a critical part of compiling a synchronous dataflow (SDF) program. This paper shows how dataflow properties can be analyzed at compile-time to make buffering more efficient. Since the target code corresponding to each node of an SDF graph is normally obtained from a hand-optimized library of predefined blocks, the efficiency of data transfer between ...

2017
Dominic Dwyer

Wang, M., Barasheed, O., Rashid, H., Booy, R., El Bashir, H., Haworth, E., Ridda, I., Holmes, E., Dwyer, D., Nguyen Van Tam, J., et al (2015). A cluster-randomised controlled trial to test the efficacy of facemasks in preventing respiratory viral infection among Hajj pilgrims. Journal of Epidemiology and Global Health, 5, 181-189. [More Inf...

In the present paper, we investigate the notion of I -statistical convergence and introduce I -st limit points and I -st cluster points of real number sequence and also studied some of its basic properties.

1998
Vladik Kreinovich Hung T. Nguyen Scott A. Starks

In many real life decision making situations in particu lar in processing satellite images we have an enormous amount of information to process To speed up the in formation processing it is reasonable to rst classify the situations into a few meaningful classes clusters nd the best decision for each class and then for each new situation to apply the decision which is the best for the correspond...

2002
F. D. BECCHETTI F. D. Becchetti

The 12C(6Li, d)160 reaction has been studied at E ( ~ L i ) = 90.2 MeV with a magnetic spectrometer. Spectra up to E x ~ 30 MeV in 160 have been obtained and decay line widths, F~ .. . . have been extracted for broad levels. Known a-cluster states ( J " = 2 +, E x = 6.9 MeV; J ~ = 4 +, E x = 10.35 MeV) are preferentially populated and exhibit sharply forward peaked angular distributions in cont...

2016
Alexandre Rok Shakhar Smorodinsky

In this paper, we extend the weak r -net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak r -net of cardinality O(r d(d+1) 2 log r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of...

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

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