نتایج جستجو برای: locally soluble
تعداد نتایج: 168839 فیلتر نتایج به سال:
The Ottawa Regional Cancer Centre offers an Oncology Rehabilitation Program to patients with cancer. Between January 1997 and December 1998, 254 patients with cancer participated in the program. This paper describes the program and its participants. The program's strengths, limitations and future directions are also discussed.
Let m,n > 1 be integers and Pn,m be the point set of the projective (n − 1)-space (defined by [2]) over the ring Zmof integers modulo m. Let An,m = (auv) be the matrix with rows and columns being labeled by Pn,m, where auv = 1 if the inner product 〈u, v〉 = 0 and auv = 0 otherwise. Let Bn,m = An,mA t n,m. The eigenvalues of Bn,m have been studied by [1, 2, 3], where their applications in the stu...
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time than it would take to read all of the data. A large, and important, subclass of such properties turn out to be “linear”. In particular, these developments have contributed to the rich theory of probabilistically checkable proof...
We show that any q-query locally decodable code (LDC) gives a copy of `1 with small distortion in the Banach space of q-linear forms on `Np1×· · ·× ` N pq , provided 1/p1 + · · ·+1/pq ≤ 1 and where k, N , and the distortion are simple functions of the code parameters. We exhibit the copies of `1 by constructing a basis directly from “smooth” LDC decoders, thus bypassing a matching lemma often u...
In this paper we introduce the concept of topological number for locally convex topological spaces and prove some of its properties. It gives some criterions to study locally convex topological spaces in a discrete approach.
We study an approximate version of q-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A q-query (α, δ)approximate LDC is a set V of n points in R so that, for each i ∈ [d] there are Ω(δn) disjoint q-tuples (u1, . . . ,uq) in V so that span(u1, . . . ,uq) contains a unit vector whose i’th coordinate is at least α. We prove ex...
In the domain of spatial computing, it appears that platforms based on either reconfigurable datapath units or on hybrid microprocessor/logic cell organizations are in the ascendancy as they appear to offer the most efficient means of providing resources across the greatest range of hardware designs. This paper encompasses an initial exploration of an alternative organization. It looks at the e...
This article assesses insurance uptake in three community-based health insurance (CBHI) schemes located in rural parts of two of India's poorest states and offered through women's self-help groups (SHGs). We examine what drives uptake, the degree of inclusive practices of the schemes and the influence of health status on enrolment. The most important finding is that a household's socio-economic...
This article summarizes the current management of patients with newly diagnosed cervical cancer. The topics range from the management of early-stage disease to the phase III randomized studies that have established the current standard of care for patients with locally advanced cancer of the cervix. New approaches to combined-modality therapy with the goal of improving outcomes and decreasing c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید