نتایج جستجو برای: locally
تعداد نتایج: 80020 فیلتر نتایج به سال:
we commence by using from a new norm on l1(g) the -algebra of all integrable functions on locally compact group g, to make the c-algebra c(g). consequently, we find its dual b(g), which is a banach algebra so-called fourier-stieltjes algebra, in the set of all continuous functions on g. we consider most of important basic theorems about this algebra. this consideration leads to a rather com...
در این پایان نامه روشی برای تطبیق مدل زبانی ارائه شده است. این روش، برمبنای ترکیب الگوریتم کاهش بعد locally linear embedding و مدل زبانی n-gram عمل میکند. الگوریتم locally linear embedding در کاهش ابعاد ساختار داده اصلی را حفظ مینماید. لذا انتظار داریم ساختار کلی ماتریس سند-کلمه در این کاهش بعد دچار خدشه زیاد نگردد. الگوریتم ارائه شده، با استفاده از زبان c++ و بهره گیری از توابع موجود در ابزاره...
Assistant Professor, Department of Surgical Oncology, Acharya Tulsi Regional Cancer Treatment & Research Centre, Bikaner Consulting Oncosurgeon, Department of Surgical Oncology, Saviour Multispecialty Hospital, Ahmedabad Retd.Professor & Chief of Surgical Oncology, Department of Surgical Oncology, Gujarat Cancer & Research Institute, Ahmedabad Plastic Surgeon, Department of Surgical Oncology, G...
this is a survey article on centralizers of finite subgroups in locally finite, simple groups or lfs-groups as we will call them. we mention some of the open problems about centralizers of subgroups in lfs-groups and applications of the known information about the centralizers of subgroups to the structure of the locally finite group. we also prove the following: let $g$ be...
Locally Decodable codes(LDC) support decoding of any particular symbol of the input message by reading constant number of symbols of the codeword, even in presence of constant fraction of errors. In a recent breakthrough [9], Yekhanin constructed 3-query LDCs that hugely improve over earlier constructions. Specifically, for a Mersenne prime p = 2−1, binary LDCs of length 2O(n1/t) for infinitely...
Following an active period of policy development and implementation in the 1990s,1 there have been two national great leaps forward that tackled geographical health inequalities in Australia in the new century. In 2000, in the context of growing disaffection in the rural electorate,2 the then health minister, Michael Wooldridge, was responsible for a federal Budget centrepiece of $562 million, ...
Matching families are one of the major ingredients in the construction of locally decodable codes (LDCs) and the best known constructions of LDCs with a constant number of queries are based on matching families. The determination of the largest size of any matching family in Zm, where Zm is the ring of integers modulo m, is an interesting problem. In this paper, we show an upper bound of O((pq)...
it is proved here that if $g$ is a locally graded group satisfying the minimal condition on subgroups which are not locally supersoluble, then $g$ is either locally supersoluble or a vcernikov group. the same conclusion holds for locally finite groups satisfying the weak minimal condition on non-(locally supersoluble) subgroups. as a consequence, it is shown that any infinite locally graded gro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید