نتایج جستجو برای: ą
تعداد نتایج: 40 فیلتر نتایج به سال:
Finding important nodes in a graph and measuring their importance is a fundamental problem in the analysis of social networks, transportation networks, biological systems, etc. Among the most popular such metrics of importance are graph centrality, betweenness centrality (BC), and reach centrality (RC). These measures are also very related to classic notions like diameter and radius. Roditty an...
Naujai atsiradę priepuoliai nėštumo metu yra reta, bet gana sudėtinga situacija. Priepuoliai atsiranda dėl priežasčių, kurias galima priskirti trims kategorijoms: anksčiau diagnozuota arba naujai atsiradusi epilepsija, su nėštumu nesusijusių būklių ir nėštumui specifiškos dažnai pasitaikančios būklės, ypač eklampsija. Elektroencefalografija (EEG) neurovizualiniai tyrimai padeda diferencijuoti š...
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs An “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n lar...
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs Anc “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n la...
In this paper, we analyze the iteration-complexity of Generalized Forward–Backward (GFB) splitting algorithm, as proposed in [2], for minimizing a large class of composite objectives f` řn i“1 hi on a Hilbert space, where f has a Lipschitzcontinuous gradient and the hi’s are simple (i.e. their proximity operators are easy to compute). We derive iterationcomplexity bounds (pointwise and ergodic)...
Abstract. Let Λ ă SLp2,Zq be a finitely generated Fuchsian group of the second kind, and v,w be two primitive vectors in Z ́ 0. We consider the set S “ txvγ,wy : γ P Λu, where x ̈, ̈y is the standard inner product in R. Using some infinite co-volume lattice point counting techniques developed by Bourgain, Kontorovich and Sarnak, and Gamburd’s 5/6 spectral gap, we show that if Λ has parabolic eleme...
The antioxidant, antimicrobial and anticancer activity of n-hexane extract Mollugo nudicaulis Lam. is interest. antioxidant the was determined by separate methods radical scavenging assays. Antimicrobial analyzed disc diffusion method on fungi species, gram positive negative species. potential plant evaluated A2780 cell lines MTT assay. Results exposed that, M.nudicaulis possess comparable sign...
Concerted rotations of a self-focused varied line-space diffraction grating about its groove axis and surface normal define a new geometric class of monochromator. Defocusing is canceled, while the scanned wavelength is reinforced at fixed conjugate distances and horizontal deviation angle. This enables high spectral resolution over a wide band, and is of particular advantage at grazing reflect...
These are beautiful results that clarify the behavior of random left-c.e. reals. It has long been understood that all random left-c.e. reals are “essentially interchangeable”. One of the key arguments for this heuristic was given by Kučera and Slaman [8], who showed that, up to multiplicative constants, we cannot approximate one random leftc.e. real faster than another (see Lemma 1.1). The conv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید