標題: Titlebook: Distributed Computing and Networking; 14th International C Davide Frey,Michel Raynal,Prasun Sinha Conference proceedings 2013 Springer-Verl [打印本頁] 作者: FROM 時間: 2025-3-21 18:11
書目名稱Distributed Computing and Networking影響因子(影響力)
書目名稱Distributed Computing and Networking影響因子(影響力)學(xué)科排名
書目名稱Distributed Computing and Networking網(wǎng)絡(luò)公開度
書目名稱Distributed Computing and Networking網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Distributed Computing and Networking被引頻次
書目名稱Distributed Computing and Networking被引頻次學(xué)科排名
書目名稱Distributed Computing and Networking年度引用
書目名稱Distributed Computing and Networking年度引用學(xué)科排名
書目名稱Distributed Computing and Networking讀者反饋
書目名稱Distributed Computing and Networking讀者反饋學(xué)科排名
作者: 嫻熟 時間: 2025-3-21 23:21 作者: Filibuster 時間: 2025-3-22 04:20 作者: meditation 時間: 2025-3-22 06:41
Decentralized Erasure Coding for Efficient Data Archival in Distributed Storage Systems,vide a storage-efficient alternative to replication. This is particularly suited for . since archived data is rarely accessed. Typically, the migration to erasure-encoded storage does not leverage on the existing replication based redundancy, and simply discards (garbage collects) the excessive repl作者: 武器 時間: 2025-3-22 09:32
Transport Protocol with Acknowledgement-Assisted Storage Management for Intermittently Connected Wi limitation on the storage capability of wireless sensor networks (WSNs), the hop-by-hop transport protocols that are based on in-network storage without storage management are inappropriate to apply directly to intermittently connected WSNs. The lack of storage management leads to mote storage over作者: 廚房里面 時間: 2025-3-22 13:43 作者: 廚房里面 時間: 2025-3-22 18:48 作者: tangle 時間: 2025-3-22 21:50
Collaborative Detection of Coordinated Port Scans,on on a set of target networks. Such orchestration aims at avoiding Local Intrusion Detection Systems checks allowing each host of the GoA to send a very few number of probes to hosts of the target network. In order to detect this complex attack we propose a collaborative architecture where each tar作者: cliche 時間: 2025-3-23 03:46
Exploiting Partial-Packet Information for Reactive Jamming Detection: Studies in UWSN Environment,f a packet (not the entire one), in order to maintain a low detection probability. Prior works on reactive jamming detection were focused on terrestrial wireless sensor networks (TWSNs), and are limited in their ability to (a) detect it correctly, (b) distinguish the small corrupted part from the un作者: DOTE 時間: 2025-3-23 05:36 作者: hurricane 時間: 2025-3-23 12:17 作者: GUEER 時間: 2025-3-23 15:48
Uniform Consensus with Homonyms and Omission Failures,ults have already been proved concerning Byzantine failures in models with homonyms [10], we complete here the picture with crash and omission failures..Let . be the number of processes, . the number of processes that may be faulty (.?
作者: 期滿 時間: 2025-3-23 21:21
Democratic Elections in Faulty Distributed Systems,mal results when the preferences of nodes are not identical. With this observation, we study the problem of conducting democratic elections in distributed systems in the form of social choice and social welfare functions with three or more candidates. We present some impossibility and possibility re作者: cunning 時間: 2025-3-24 01:03
Robust Deployment of Wireless Sensor Networks Using Gene Regulatory Networks,munication between sensor nodes may fail due to different factors, such as hardware failures, energy depletion, temporal variations of the wireless channel and interference. To maximize efficiency, the sensor network deployment must be robust and resilient to such failures. One effective solution to作者: Anal-Canal 時間: 2025-3-24 02:32
Cellular Pulse Switching: An Architecture for Event Sensing and Localization in Sensor Networks,ulse switching is to abstract a single pulse, as opposed to multi-bit packets, as the information exchange mechanism. Event monitoring with conventional packet transport can be prohibitively energy-inefficient due to the communication, processing, and buffering overheads of the large number of bits 作者: 錯事 時間: 2025-3-24 08:41
Asynchrony from Synchrony,e computable..In the past, adversaries that reduce the computational power of a system as they purge messages were studied in the context of their ability to foil consensus. This paper considers the other extreme. It characterizes the limits on the power of message-adversary so that it cannot foil t作者: 調(diào)味品 時間: 2025-3-24 12:57
Maximal Antichain Lattice Algorithms for Distributed Computations,useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previo作者: 獨特性 時間: 2025-3-24 16:45
On the Analysis of a Label Propagation Algorithm for Community Detection,oth in terms of its convergence time and in terms of the “quality” of the communities detected. . is an instance of a class of community detection algorithms called . algorithms. As far as we know, most analysis of label propagation algorithms thus far has been empirical in nature and in this paper 作者: 低位的人或事 時間: 2025-3-24 19:06 作者: upstart 時間: 2025-3-24 23:58
https://doi.org/10.1007/978-3-030-36564-6describe a promising approach towards addressing this challenge that combines formal verification with systematic testing by humans. We describe an illustrative application of this approach to electronic voting in the U.S., and outline directions for future work.作者: Overstate 時間: 2025-3-25 07:05
Where Am I? Time, the Mysterious Dimensionhat provides not only end-to-end reliability and congestion control but also an innovative storage management mechanism. The proposed protocol enhances the network delivery rate without sacrificing the delivery speed even in high contention scenarios.作者: fleeting 時間: 2025-3-25 07:35 作者: narcissism 時間: 2025-3-25 12:53 作者: CYT 時間: 2025-3-25 17:00 作者: osteoclasts 時間: 2025-3-25 20:57
Democratic Elections in Faulty Distributed Systems,ch that attempts to mitigate the effects of Byzantine votes. We analyze the performance of these schemes through simulations to compare their efficacy in producing the most desirable social welfare rankings.作者: emission 時間: 2025-3-26 03:58
0302-9743 ernational Conference on Distributed Computing and Networking, ICDCN 2013, held in Mumbai, India, during January 3-6, 2013. The 27 revised full papers, 5 short papers presented together with 7 poster papers were carefully reviewed and selected from 149 submissions. The papers cover topics such as di作者: Infuriate 時間: 2025-3-26 07:36
Exploring Differences Between Countriesthe disjunction problem in an anonymous network. DISJ is self-stabilizing, meaning that the correct output is computed from an arbitrary initial configuration, and is silent, meaning that every computation of DISJ is finite. The time complexity of DISJ is .(.) rounds, where . is the size of the network. DISJ works under the ..作者: 即席演說 時間: 2025-3-26 11:05
Explaining Tolerance of Violencess of our approach is tested on real network traces. Tests show that collaboration among networks domains is mandatory to achieve accurate detection of coordinated attacks and sharp separation between GoAs that execute concurrent attacks on the same targets.作者: packet 時間: 2025-3-26 12:39
Maria Eugenia Trombini,Elizangela Valarini wireless sensor networks, called bio-inspired WSNs. Exhaustive structural analysis of the network and experimental results demonstrate that the topology of bio-inspired WSNs is robust, energy-efficient, and resilient to node and link failures.作者: CYN 時間: 2025-3-26 17:58
The Fight for the Right to Food Through analytical modeling and simulation experiments, it is shown that pulse switching can be an effective means for event based networking, which can potentially replace packet transport when the information is binary in nature.作者: 放牧 時間: 2025-3-27 00:17
Collaborative Detection of Coordinated Port Scans,ss of our approach is tested on real network traces. Tests show that collaboration among networks domains is mandatory to achieve accurate detection of coordinated attacks and sharp separation between GoAs that execute concurrent attacks on the same targets.作者: 不開心 時間: 2025-3-27 03:42
Robust Deployment of Wireless Sensor Networks Using Gene Regulatory Networks, wireless sensor networks, called bio-inspired WSNs. Exhaustive structural analysis of the network and experimental results demonstrate that the topology of bio-inspired WSNs is robust, energy-efficient, and resilient to node and link failures.作者: 沖擊力 時間: 2025-3-27 07:55 作者: 半球 時間: 2025-3-27 13:05 作者: 時代 時間: 2025-3-27 15:10
Self-stabilizing Silent Disjunction in an Anonymous Network,the disjunction problem in an anonymous network. DISJ is self-stabilizing, meaning that the correct output is computed from an arbitrary initial configuration, and is silent, meaning that every computation of DISJ is finite. The time complexity of DISJ is .(.) rounds, where . is the size of the network. DISJ works under the ..作者: 英寸 時間: 2025-3-27 18:17 作者: synovitis 時間: 2025-3-27 21:58
Conference proceedings 2013i, India, during January 3-6, 2013. The 27 revised full papers, 5 short papers presented together with 7 poster papers were carefully reviewed and selected from 149 submissions. The papers cover topics such as distributed algorithms and concurrent data structures; integration of heterogeneous wirele作者: Goblet-Cells 時間: 2025-3-28 03:11 作者: 啟發(fā) 時間: 2025-3-28 08:04
Dynamic Model of the Induction Motor,this size by a poly-logarithm. Both models yield adversaries that are much stronger than previously studied. Our randomized synchronous algorithm is formulated for . processors and . tasks, with .?≤?., where depending on the number of crashes each live processor is able to terminate dynamically with作者: Misnomer 時間: 2025-3-28 14:07 作者: stress-response 時間: 2025-3-28 17:10 作者: Mindfulness 時間: 2025-3-28 22:37
https://doi.org/10.1007/978-3-030-33204-4introduction of such an approach is unique – the existing works rely on holistic packet analysis, which degrades their performance – a fundamental issue that would substantially affect achieving real-time performance. We estimate the probability of high deviation in received signal strength (RSS) us作者: aplomb 時間: 2025-3-29 01:38
Explaining Tolerance of Violenceodes will remain connected to the sink node. We prove that the least-cost tree augmentation problem is NP-complete. Moreover, we provide an approximation algorithm with performance bound of two. The experimental evaluations of the algorithm demonstrate that the approximation algorithm performs even 作者: 平靜生活 時間: 2025-3-29 03:04
The Fight against Systemic Corruptionable if and only if .?>?2...All the proposed protocols are optimal both in the number of communication steps needed, and in the number of processes that can be faulty..All these results show, (1) that identifiers are not useful for crash and send-omission failures or when processes are numerate, (2)作者: Expediency 時間: 2025-3-29 09:47 作者: 值得 時間: 2025-3-29 15:04
The Occupied Palestinian Territoriesline incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes .(.. log..) time and .(..作者: canvass 時間: 2025-3-29 17:10 作者: Little 時間: 2025-3-29 22:16
The Fight for the Right to Foodtimes do not necessarily lead to large upload amounts. Based on these observations, we discuss possible strategies for users to gain sharing ratios efficiently, which help them to survive and thrive in private communities.作者: 漂浮 時間: 2025-3-30 00:33
Conference proceedings 2013 networking and services; multiprocessor and multi-core architectures and algorithms; resource management and quality of service; self-organization, self-stabilization, and autonomic computing; network security and privacy; high performance computing, grid computing, and cloud computing; energy-effi作者: 變化無常 時間: 2025-3-30 05:26 作者: CLOUT 時間: 2025-3-30 11:46 作者: pancreas 時間: 2025-3-30 14:30 作者: jocular 時間: 2025-3-30 16:39 作者: 舊病復(fù)發(fā) 時間: 2025-3-30 21:40 作者: Detonate 時間: 2025-3-31 02:15
Fault-Tolerant Design of Wireless Sensor Networks with Directional Antennas,odes will remain connected to the sink node. We prove that the least-cost tree augmentation problem is NP-complete. Moreover, we provide an approximation algorithm with performance bound of two. The experimental evaluations of the algorithm demonstrate that the approximation algorithm performs even 作者: Hot-Flash 時間: 2025-3-31 07:30 作者: 未完成 時間: 2025-3-31 10:11 作者: 分離 時間: 2025-3-31 16:05
Maximal Antichain Lattice Algorithms for Distributed Computations,line incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes .(.. log..) time and .(..作者: surrogate 時間: 2025-3-31 20:19 作者: indifferent 時間: 2025-4-1 00:39 作者: FILLY 時間: 2025-4-1 02:37 作者: Mirage 時間: 2025-4-1 07:07
https://doi.org/10.1007/978-3-030-36564-6lude aircraft control systems (interacting with a pilot), automobiles with self-driving features (interacting with a driver), medical devices (interacting with a doctor), and electronic voting machines (interacting with a voter). A major challenge to verifying the correct operation of such systems i作者: 大約冬季 時間: 2025-4-1 11:57
Jacques-Henri Coste,Vincent Dussolining node importance in large graphs (and was a pioneering idea behind Google’s search engine). In distributed computing alone, PageRank vectors, or more generally random walk based quantities have been used for several different applications ranging from determining important nodes, load balancing作者: 公社 時間: 2025-4-1 15:10
Dynamic Model of the Induction Motor,cted computers. This paper presents a new algorithm for the problem of using network supercomputing to perform a large collection of independent tasks, while dealing with undependable processors. The adversary may cause the processors to return bogus results for tasks with certain probabilities, and作者: 鑲嵌細工 時間: 2025-4-1 22:17 作者: 惡臭 時間: 2025-4-1 23:29
Where Am I? Time, the Mysterious Dimension limitation on the storage capability of wireless sensor networks (WSNs), the hop-by-hop transport protocols that are based on in-network storage without storage management are inappropriate to apply directly to intermittently connected WSNs. The lack of storage management leads to mote storage over作者: 音的強弱 時間: 2025-4-2 04:49 作者: Ligneous 時間: 2025-4-2 10:23
https://doi.org/10.1007/978-1-349-13961-3degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees whe
