作者: Hemiplegia 時(shí)間: 2025-3-21 23:42 作者: 允許 時(shí)間: 2025-3-22 02:37 作者: CLAN 時(shí)間: 2025-3-22 05:10
Labeling Schemes for Tree Representationgraphs). We show that for every graph . and port numbering there exists a spanning tree . for which ..(.) = .(. log log .). We give a tight bound of .(.) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port assignments. We conclude by discussing some appli作者: 蕁麻 時(shí)間: 2025-3-22 09:59 作者: phase-2-enzyme 時(shí)間: 2025-3-22 13:30
A State-Space Search Approach for Optimizing Reliability and Cost of Execution in Distributed Sensor the optimal one. The sub-optimal solution required 8-35% less computation, at the cost of 2.5-15% deviation from the optimal solution in terms of average energy spent per sensor node. Both the .. and greedy .. algorithms have been shown to distribute energy consumption more uniformly across sensors作者: phase-2-enzyme 時(shí)間: 2025-3-22 18:20
Ricardo Gomez Gomez,Sylvain Clercrms .(.) work to join the algorithm. Specifically, no constant-time, word-sized, wait-free LL/SC algorithm that does not require the knowledge of . exists. In this paper, we present such an algorithm.作者: 開始從未 時(shí)間: 2025-3-22 23:31
Audrey L. Karperien,Herbert F. Jelinek applying new compression method for MBR used as key in R-Tree and by considering cache to prevent bottleneck due to speed difference between main memory and CPU. The experimental results indicate that the proposed CLUR-Tree enhances update performance and gives a good retrieval performance simultaneously.作者: 珊瑚 時(shí)間: 2025-3-23 02:38 作者: PAC 時(shí)間: 2025-3-23 07:54
A Composite Index of Aid Fragmentatione that no resources are wasted on those connections which cannot deliver an unacceptable signal quality, this paper uses an event-driven simulation which incorporates on-line BER calculations. A call request is accepted only if the BER at the destination node is less than 10.; otherwise it is rejected.作者: Anthropoid 時(shí)間: 2025-3-23 11:00
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processesrms .(.) work to join the algorithm. Specifically, no constant-time, word-sized, wait-free LL/SC algorithm that does not require the knowledge of . exists. In this paper, we present such an algorithm.作者: BLANK 時(shí)間: 2025-3-23 14:48 作者: 過(guò)份好問(wèn) 時(shí)間: 2025-3-23 18:30
Optimizing Lifetime and Routing Cost in Wireless Networksoring other parameter, each method fails to achieve the objective of other. The proposed routing protocol suggests a tradeoff between these two parameters, and ensures a balanced utilization to achieve maximum overall performance.作者: GREG 時(shí)間: 2025-3-23 23:57 作者: Defense 時(shí)間: 2025-3-24 04:47 作者: Corral 時(shí)間: 2025-3-24 07:16 作者: hallow 時(shí)間: 2025-3-24 12:20
A Certain Philosophical Context,stems located at PlanetLab member institutions at different locations over the world. This enabled simulation of real world Internet conditions. The study shows that the ROWA protocol performs better than the Majority Voting under no-site-failure conditions in terms of response time, communication overhead and growing number of users.作者: 可以任性 時(shí)間: 2025-3-24 15:45 作者: Hirsutism 時(shí)間: 2025-3-24 20:40 作者: CULP 時(shí)間: 2025-3-25 02:44
Reliable Time Synchronization Protocol in Sensor Networks Considering Topology Changesopology. Simulation results show that RTSP has about 10% better performance than TPSN in synchronization accuracy. The number of messages in RTSP is 10%~30% lower than that in TPSN when there are topology changes.作者: 助記 時(shí)間: 2025-3-25 06:53 作者: CULP 時(shí)間: 2025-3-25 11:27 作者: 得意牛 時(shí)間: 2025-3-25 12:24 作者: glacial 時(shí)間: 2025-3-25 15:55
Self-stabilizing Publish/Subscribe Protocol for P2P Networksst case where ., ., and . denote respectively the number of nodes, edges, and the maximum degree of a node in the system graph (network). We also propose a a space efficient way to utilize this self-stabilizing publish/subscribe scheme, which allows flexibility in implementations.作者: palette 時(shí)間: 2025-3-25 22:43 作者: violate 時(shí)間: 2025-3-26 02:49
Audrey L. Karperien,Herbert F. Jelinekl routes that is considered is governed by the minimum reliability requirements. Simulation experiments are conducted that show that multipath routing can increase the reliability, and dissipate energy more evenly among the nodes.作者: mosque 時(shí)間: 2025-3-26 05:32
Ma?gorzata Ko?odziej,Przemys?aw Waliszewskin proposed. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead. We also present an asynchronous recovery algorithm based on the checkpointing algorithm.作者: right-atrium 時(shí)間: 2025-3-26 11:00
Multifractal Analysis in Neuroimaging areas of cognition, and distribution computing. It is also hoped that the brain network structure studied through scale-free, small world, and clustering concepts may facilitate better understanding and design of brain-computer interface (BCI) systems.作者: Instantaneous 時(shí)間: 2025-3-26 13:13 作者: Audiometry 時(shí)間: 2025-3-26 19:28 作者: 通便 時(shí)間: 2025-3-26 23:54 作者: 憎惡 時(shí)間: 2025-3-27 02:52 作者: indigenous 時(shí)間: 2025-3-27 06:47
Ahmed Fuad,Mukhtar Al-Hashimi,Allam Hamdane ports of each node. The . tree labeling . gives each node . of . a label containing the port numbers of all the . edges incident to .. The . tree labeling . labels each node . by the number of the port leading from . to its parent in the tree. Our measure of interest is the worst case and total le作者: RUPT 時(shí)間: 2025-3-27 13:29
Integrated Circuits and SystemsA message vocabulary of size two (i.e., single-bit messages) suffices to encode and transmit messages of arbitrary finite length over such channels. This note proves that single-bit messages are insufficient once channels potentially deliver duplicate messages. In particular, it is shown that no pro作者: Gustatory 時(shí)間: 2025-3-27 14:04 作者: Delude 時(shí)間: 2025-3-27 21:21 作者: 吞下 時(shí)間: 2025-3-28 01:04
No Inert Learning Accepted at Foxfire!1,such that every point in the region is covered by at least one base-station, and the maximum range assigned is minimized. The algorithm proposed in this paper uses Voronoi diagram, and it works for covering a convex region of arbitrary shape. Experimental results justify the efficiency of our algori作者: AER 時(shí)間: 2025-3-28 02:30 作者: Oscillate 時(shí)間: 2025-3-28 10:19 作者: 預(yù)防注射 時(shí)間: 2025-3-28 12:47
Audrey L. Karperien,Herbert F. Jelinek near real-time. So it is needed to design the index structure for supporting the frequent updates and fast retrieval of data efficiently. In this paper, CLUR-Tree (Cache-conscious Lazy Update R-Tree) is proposed, which is a spatial index for efficient processing of frequent updates of data streams 作者: Barter 時(shí)間: 2025-3-28 15:48
Fractal Analysis in Neurological Diseasesess sensor and ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. In ad hoc networks, movement of nodes a作者: 返老還童 時(shí)間: 2025-3-28 20:42
Audrey L. Karperien,Herbert F. Jelineknt a multipath source routing algorithm that uses a ranking technique to distinguish between the quality of different routes for the same source-destination pair. A ranking coefficient is calculated for each route based on three different metrics- energy, delay and reliability. The number of paralle作者: Cholesterol 時(shí)間: 2025-3-29 01:58
Audrey L. Karperien,Herbert F. Jelinekodes, running out of energy or crashes in the network, the topology of sensor networks changes very frequently. In the proposed method, synchronization error is decreased by creating a hierarchical tree with lower depth and reliability is improved by maintaining and updating the information of candi作者: 軌道 時(shí)間: 2025-3-29 06:21
Multifractal Analysis in Neuroimagingountered in social, information, technological, and biological networks. The underlying conclusions may, in future, lead to interesting studies in the areas of cognition, and distribution computing. It is also hoped that the brain network structure studied through scale-free, small world, and cluste作者: NEXUS 時(shí)間: 2025-3-29 07:40
Ma?gorzata Ko?odziej,Przemys?aw Waliszewskicess involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance. To overcome this problem, checkpoint staggering under which checkpoints by various processes are taken in a staggered manner, has bee作者: maroon 時(shí)間: 2025-3-29 11:30
Library of Philosophy and Religionysis of the recovery (stabilization) time of the protocol after arbitrary failures in the network. The protocol converges in at most . time in the worst case where ., ., and . denote respectively the number of nodes, edges, and the maximum degree of a node in the system graph (network). We also prop作者: meretricious 時(shí)間: 2025-3-29 18:51
https://doi.org/10.1007/978-1-349-04412-2m is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiations of checkpointing and at most one data fault per process. However, several processes may be faulty.作者: Externalize 時(shí)間: 2025-3-29 22:34
A Certain Philosophical Context,emand and expectations. The key to achieving these goals of scalability, robustness and responsiveness lies in the practices of caching and replication. Quorum Consensus is a popular protocol used for data replication. This paper describes an implementation of two special cases of Quorum Consensus p作者: 機(jī)械 時(shí)間: 2025-3-30 03:00 作者: 小丑 時(shí)間: 2025-3-30 06:33
A Composite Index of Aid Fragmentationhas been studied. This paper considers both switch-induced crosstalk and the crosstalk induced by the multiplexers and demultiplexers. Fixed routing and fixed-alternate routing of connection requests have been considered. First-fit and random wavelength assignment algorithms have been employed. A cr作者: 調(diào)味品 時(shí)間: 2025-3-30 11:01 作者: aesthetic 時(shí)間: 2025-3-30 12:32
0302-9743 Overview: 978-3-540-30959-8978-3-540-32428-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CHIDE 時(shí)間: 2025-3-30 17:42 作者: 大包裹 時(shí)間: 2025-3-31 00:21 作者: contrast-medium 時(shí)間: 2025-3-31 04:14
Smart University and Artificial IntelligenceRecently there have been a number of efforts to study issues related to coordination and control algorithms for systems of multiple autonomous mobile robots (also known as .) from the viewpoint of distributed computing. This paper reviews the literature in the area and discusses some open problems and future research directions.作者: Entropion 時(shí)間: 2025-3-31 05:26 作者: PHIL 時(shí)間: 2025-3-31 11:49 作者: 使乳化 時(shí)間: 2025-3-31 14:53
https://doi.org/10.1007/11603771Middleware; Signatur; ad-hoc networks; algorithms; artificial intelligence; communication protocols; distr作者: hypertension 時(shí)間: 2025-3-31 17:59 作者: 強(qiáng)制性 時(shí)間: 2025-3-31 23:54
Placing a Given Number of Base Stations to Cover a Convex Regionsuch that every point in the region is covered by at least one base-station, and the maximum range assigned is minimized. The algorithm proposed in this paper uses Voronoi diagram, and it works for covering a convex region of arbitrary shape. Experimental results justify the efficiency of our algorithm and the quality of the solution produced.作者: organism 時(shí)間: 2025-4-1 05:22
Self-stabilizing Checkpointing Algorithm in Ring Topologym is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiations of checkpointing and at most one data fault per process. However, several processes may be faulty.作者: 單調(diào)性 時(shí)間: 2025-4-1 07:36
Labeling Schemes for Tree Representatione ports of each node. The . tree labeling . gives each node . of . a label containing the port numbers of all the . edges incident to .. The . tree labeling . labels each node . by the number of the port leading from . to its parent in the tree. Our measure of interest is the worst case and total le作者: Factorable 時(shí)間: 2025-4-1 12:54
