نتایج جستجو برای: modified neighbor on path mnop
تعداد نتایج: 8579138 فیلتر نتایج به سال:
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems . This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facil...
مقدار تبخیر و تعرق حقیقی مزرعه یونجه واقع در باجگاه بوسیله روش تعادل آبیاری در 9 کرت آزمایشی و دولیسمتر از نوع وزنی بمنظور تعیین آب مصرفی گیاه یونجه تعیین شد. در طول مدت آزمایش مقدار آب موجود در خاک بوسیله نمونه برداری وزنی از خاک و دستگاه نوترون متر تعیین و مقدار تشعشع رسیده از خورشید بزمین و ساعات آفتابی روز نیز اندازه گیری شد. مقدار تبخیر و تعرق پتانسیل بوسیله روشهای modified blaney-criddle ...
A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types of boundary vertices: peripheral, contour and eccentric vertices, including a realization theorem that not only corrects a wrong statement detected in [2], but also improves it. We also prove that t...
In wireless sensor networks (WSNs), sensor nodes have stringent energy and computation requirements. Since they are left unattended, an adversary can generate false report attacks through compromised nodes. This would result in an increased number of verifications to filter these reports, causing waste of scarce energy resources. In this paper, we propose energy-efficient path configuration met...
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). This paper innovatively puts forward the concept of “time-slice” to make full use of the respective advantages of single copy strategy and multiple-copy strategy thus getting a right balance between high message delivery ratio and low network overloads. We ...
In this paper, we propose an enhancement to DSR, called DSR with Connection-Aware Link-state Exchange aNd DiffERentiation (DSRCALENDER). Specifically, to effectively collect and disseminate neighbor link states to nodes which may potentially use them, we devise a neighbor link-state information exchange mechanism: once a connection has been established, the neighbor link-state information is ex...
Folksonomies, otherwise known as Collaborative Tagging Systems, enable Internet users to share, annotate and search for online resources with user selected labels called tags. Tag recommendation, the suggestion of an ordered set of tags during the annotation process, reduces the user effort from a keyboard entry to a mouse click. By simplifying the annotation process tagging is promoted, noise ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید