نتایج جستجو برای: locating
تعداد نتایج: 12620 فیلتر نتایج به سال:
using piezoelectric patches the stress concentration around a hole on a plate under tension is reduced and controlled. to attain the reduction in stress two placements for piezoelectric patches is investigated. the first location is top/bottom of the hole with compression induced strain and the second is left/right of the hole with tension induced strains to control the stress flow. the result ...
Let c be a proper k-coloring of a connected graph G. Let Π = {S1, S2, . . . , Sk} be the induced partition of V (G) by c, where Si is the partition class having all vertices with color i. The color code cΠ(v) of vertex v is the ordered k-tuple (d(v, S1), d(v, S2), . . . , d(v, Sk)), where d(v, Si) = min{d(v, x)|x ∈ Si}, for 1 ≤ i ≤ k. If all vertices of G have distinct color codes, then c is ca...
Purpose – The purpose of this paper is to develop a facade for seamlessly using locating services and enabling easy development of an application with indoor and outdoor location information without being aware of the difference of individual services. To achieve this purpose, in this paper, a unified locating service, called KULOCS (Kobe-University Unified LOCating Service), which horizontally...
constructionof underground dams is a practical solution to save groundwater in alluvium watersheds, particularly in arid and semi-arid regions where surface water scarcity is an environmental challenge. considering socio-economic and environmental benefits of underground dams, the accurate locating is the primary consideration for dam construction. the new technologies and methods are a step to...
design and expansion of distribution systems seems inevitable in view of the need to satisfy the rise in energy consumption in a technical and economical way. optimal location, sizing and determining the service area of substations is one of the principle problems in expansion of distribution systems. also uncertainty is one of the important factors that increase risk of exact decision makings....
One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms , this paper presents a hierarchical and manageable resource locating model (HMRLM)which can provide P2P networks with scalability and manageability.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید