检索结果-内蒙古大学图书馆

37th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Wang, Jue Ino, Fumihiko Ke, Jing Osaka Univ Grad Sch Informat Sci & Technol Osaka Japan Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai Peoples R China

ISBN: (纸本)9798350337662

This paper introduces a novel parallel relaxed flooding (PRF) algorithm for Voronoi diagram generation. The algorithm takes a set of reference points extracted from an image as input and assigns each GPU thread a partition of the image domain to perform parallel flooding computation. Our PRF algorithm has three advantages as follows. (1) The PRF algorithm divides an image domain into subregions for concurrent flooding computation. To achieve high parallelism, a point selection method is incorporated to remove dependencies between different subregions. (2) We exploit the sparsity of the input point data with a k-d tree. With the k-d tree data structure, the point selection step achieves high efficiency, and the amount of CPU-GPU data transfer is reduced. (3) We propose a relaxed flooding method, which achieves more accurate results and decreases memory traffic compared to the traditional flooding method. In addition to these advantages, we provide an empirical method to determine the appropriate parameter in the point selection step for high performance, given an expected error rate. We evaluated the performance of our method on multiple datasets. Compared with the state-of-the-art parallel banding algorithm, our method achieved an average speed-up of 4.6x on the randomly generated datasets with a point density of 0.01%, and 6.8x on nuclei segmentation datasets. The code of the PRF algorithm is publicly available.

关键词： parallel computing Voronoi diagram flooding algorithm k-d tree GPU

来源：评论

学校读者我要写书评

暂无评论

Enhanced flooding algorithms introducing the concept of biotic growth

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2005年第3期E88B卷 903-910页

作者： Tode, H Wada, M Kinoshita, K Masaki, T Murakami, K Osaka Univ Dept Informat Networking Suita Osaka 5650871 Japan

A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. In particular, the flooding algorithm is greatly effective in the heterogeneous and dynamic network environment such as so-called ubiquitous networks, whose topology is indefinite or changes dynamically and whose nodal function may be simple and less intelligent. Actually, it is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantages: it causes the message congestion in the network, and eventually increases the processing time until the flooding control is finished. In this paper, we propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes.

关键词： flooding algorithm ubiquitous network sensor network ad-hoc network biotic growth

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive characteristics segmentation optimized algorithm of weld defects based on flooding

Self-adaptive characteristics segmentation optimized algorit...

引用

Conference on Signal Processing, Sensor Fusion, and Target Recognition XXII

作者： Dang Changying Gao Jianmin Wang Zhao Chen Fumin Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Shaanxi Peoples R China

ISBN: (纸本)9780819495365

In order to improve the accuracy and efficiency of weld defect segmentation in automatic radiographic nondestructive testing and evaluation(NDT&E), an effective weld defect segmentation algorithm based on flooding has been developed, which has the self-adaptive characteristics. Firstly, the defect's feature points are extracted from the scale space of radiographic films. Based on the information of defect points, the seed points and seed domains of defect discrimination are adaptively determined, in which the defect segmentation seed will be searched. Then, aiming at the sparsity of weld defects and canyon characteristics of 3D topographic map of defect regions, the drip-watering and water flooding have been used for reference. The flooding is carried out by using line-flooding algorithm, in which water starts from defect seed points and flows to the neighbor regions in order. On the basis of the flooding-area change and flooding-level ascending velocity, the defect segmentation threshold values are determined and the weld defects also are segmented from the radiographic films. At last, the comparative experiments have been carried out to compare the proposed algorithm with the watershed segmentation algorithm and background subtraction segmentation algorithm. And the experiment results confirm that the proposed algorithm obviously improves the accuracy and efficiency of weld defect's segmentation.

关键词： Radiographic testing defect segmentation flooding algorithm defect-seed point self-adaptive characteristics

来源：评论

学校读者我要写书评

暂无评论

Natural Image Segmentation Based on Tree Equipartition, Bayesian flooding and Region Merging

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2011年第8期20卷 2276-2287页

作者： Panagiotakis, Costas Grinias, Ilias Tziritas, Georgios Univ Crete Multimedia Informat Lab Dept Comp Sci Iraklion 71409 Greece

We propose a general purpose image segmentation framework, which involves feature extraction and classification in feature space, followed by flooding and merging in spatial domain. Region growing is based on the computed local measurements and distances from the distribution of features describing the different classes. Using the properties of the label dependent distances spatial coherence is ensured, since the image features are described globally. The distribution of the features for the different classes are obtained by block-wise unsupervised clustering based on the construction of the minimum spanning tree of the blocks' grid using the Mallows distance and the equipartition of the resulting tree. The final clustering is obtained by using the k-centroids algorithm. With high probability and under topological constraints, connected components of the maximum likelihood classification map are used to compute a map of initially labelled pixels. An efficient flooding algorithm is introduced, namely, Priority Multi-Class flooding algorithm (PMCFA), that assign pixels to labels using Bayesian dissimilarity criteria. A new region merging method, which incorporates boundary information, is introduced for obtaining the final segmentation map. Therefore, the merging stage is based on region features and edge localization. Segmentation results on the Berkeley benchmark data set demonstrate the effectiveness of the proposed methods.

关键词： Bayesian statistical analysis flooding algorithm image segmentation minimum spanning tree region growing region merging tree partition

来源：评论

学校读者我要写书评

暂无评论

Termination of amnesiac flooding

引用

DISTRIBUTED COMPUTING 2023年第2期36卷 193-207页

作者： Hussak, Walter Trehan, Amitabh Loughborough Univ Comp Sci Epinal Way Le Loughborough LE11 3TU Leics England Univ Durham Comp Sci Stockton Rd Durham DH1 3LE England

We consider a stateless `amnesiac' variant of the stateful distributed network flooding algorithm, expanding on our conference papers [PODC'19, STACS'20]. flooding begins with a set of source `initial' nodes I seeking to broadcast a message M in rounds, in a network represented by an undirected graph (G, E) with set of nodes G and edges E. In every round, nodes with M send M to all neighbours from which they did not receive M in the previous round. Nodes do not remember earlier rounds, raising the possibility that M circulates indefinitely. Stateful flooding overcomes this by nodes recording every message circulated and ignoring M if received again. This overhead was assumed to be necessary. We show that almost optimal broadcast can still be achieved without this overhead. We prove that amnesiac flooding terminates on every finite graph and derive sharp bounds for termination times. Define (G, E) to be I-bipartite if the quotient graph, contracting all nodes in I to a single node, is bipartite. We prove that, if d is the diameter and e( I) the eccentricity of the set I, flooding terminates in e( I) rounds if (G, E) is I-bipartite and j rounds with e( I) < j <= e( I)+ d + 1 <= 2d + 1 if ( G, E) is non I-bipartite. The separation in the termination times can be used for distributed discovery of topologies/distances in graphs. Termination is guaranteed if edges are lost during flooding but not, in general, if there is a delay at an edge. However, the cases of single-edge fixed delays of duration tau rounds in single-source bipartite graphs terminate by round 2d + tau- 1, and all cases of multiple-edge fixed delays in multiple-source cycles terminate.

关键词： flooding algorithm Network algorithms Graph bipartiteness Process termination Communication Broadcast

来源：评论

学校读者我要写书评

暂无评论

On the Termination of flooding 37

On the Termination of Flooding

引用

37th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Hussak, Walter Trehan, Amitabh Loughborough Univ Comp Sci Loughborough Leics England

ISBN: (纸本)9783959771405

flooding is among the simplest and most fundamental of all graph/network algorithms. Consider a (distributed network in the form of a) finite undirected graph G with a distinguished node v that begins flooding by sending copies of the same message to all its neighbours and the neighbours, in the next round, forward the message to all and only the neighbours they did not receive the message from in that round and so on. We assume that nodes do not keep a record of the flooding event, thus, raising the possibility that messages may circulate infinitely even on a finite graph. We call this history-less process amnesiac flooding (to distinguish from a classic distributed implementation of flooding that maintains a history of received messages to ensure a node never sends the same message again). flooding will terminate when no node in G sends a message in a round, and, thus, subsequent rounds. As far as we know, the question of termination for amnesiac flooding has not been settled - rather, non-termination is implicitly assumed. In this paper, we show that surprisingly synchronous amnesiac flooding always terminates on any arbitrary finite graph and derive exact termination times which differ sharply in bipartite and non-bipartite graphs. In particular, synchronous flooding terminates in e rounds, where e is the eccentricity of the source node, if and only if G is bipartite, and, otherwise, in j rounds where e < j <= e+ d+ 1 and d is the diameter of G. Since e is bounded above by d, this implies termination times of at most d and of at most 2d + 1 for bipartite and non-bipartite graphs respectively. This suggests that if communication/broadcast to all nodes is the motivation, the history-less amnesiac flooding is asymptotically time optimal and obviates the need for construction and maintenance of spanning structures like spanning trees. Moreover, the clear separation in the termination times of bipartite and non-bipartite graphs may suggest possible mechanisms for dis

关键词： flooding algorithm Network algorithms Distributed algorithms Graph theory Termination Bipartiteness Communication Broadcast

来源：评论

学校读者我要写书评

暂无评论

flooding in Secure Wireless Sensor Networks Student contribution 17

Flooding in Secure Wireless Sensor Networks Student contribu...

引用

10th International Conference on Security of Information and Networks (SIN)

作者： Bondu, Jimmy Mishra, Anupal Laxmi, Vijay Gaur, Manoj Singh Bordeaux Grad Sch Engn ENSEIRB MATMECA Bordeaux France VIT Univ Vellore Tamil Nadu India Malaviya Natl Inst Technol Jaipur Rajasthan India Indian Inst Technol Jammu Jammu & Kashmir India

ISBN: (纸本)9781450353038

The flooding algorithm remains one of the simplest and most effective ways to quickly disseminate information across all nodes in a Wireless Sensor Network. Though fast, this algorithm remains un-secure as the packets can be intercepted by malice agents to reveal the information. In this paper, simulations of a flooding algorithm in Sensor Networks secured by a Random Key Pre-distribution model are presented. We conducted these simulations on ns-3 over a theoretical Peer-to-peer and a standard based IEEE 802.15.4 network. This is followed by a demonstration of the robustness of the network through a random black hole attack.

关键词： Wireless Sensor Networks flooding algorithm Blackhole attack Network simulator-3

来源：评论

学校读者我要写书评

暂无评论

Analyzing Throughput of MANET with Reduced Packet Loss

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第1期97卷 565-578页

作者： Muthukumaran, N. Anna Univ Chennai Tamil Nadu India Francis Xavier Engn Coll Tirunelveli 627003 Tamil Nadu India

This research paper analyses the throughput capacity of Mobile Ad hoc Network (MANET) with reduced packet loss. The nodes are then discovered using Medium Access Control (MAC) 802.11 protocol. It has the capability to discover the neighbor nodes automatically and the next node of the throughput for each node is determined using flooding algorithm. In this algorithm, each node try to forward every information to every one of its nearest source node and then it receives the acknowledgement from the destination nodes. After initializing the source and destination node, the shortest path between the source and destination node is determined using K- Nearest Neighbor (KNN) algorithm. It calculates the distance between the nodes and sort the nearest neighbor based on the minimum distance. The routing is performed with the help of Dynamic Source Routing (DSR) algorithm which allows each dispatcher to decide on and control the routes used in routing packets. The packet loss gets reduced by considering the throughput of nodes. Here the Operating System is Linux Simulation software and then Network Simulator version 2 tool was used.

关键词： MANET MAC protocol KNN algorithm Dynamic Source Routing algorithm flooding algorithm Throughput Packet loss

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of Localization algorithm Based on the N-hop Anchors for Wireless Sensor Networks 8

Performance Comparison of Localization Algorithm Based on th...

引用

8th IEEE International Symposium on Next-Generation Electronics (ISNE)

作者： Zhang, Yanhe Ding, Yingqiang Zhengzhou Univ Sch Informat Engn Zhengzhou Peoples R China

ISBN: (纸本)9781728120621

In order to overcome the shortcomings of existing location algorithms, which can't make full use of the location information of multi-hop anchor nodes, and obtain the ideal result of node localization, a new range-free location algorithm for wireless sensor networks is proposed in this paper n-hop anchors' connection relationship-based localization (NHCRL) algorithms. The key point of this algorithm is that to use anchor nodes with different hop values as geometric constraints of unknown node positions, and then to reduce their location areas continuously to achieve the purpose of accurate positioning. The simulation results show that under the same conditions, compared with the traditional location algorithm, NHCRL has higher location accuracy.

关键词： wireless sensor network (WSN) range-free multi-hop anchor nodes geometric constraint flooding algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on LAP Routing algorithm based on Traversal Tree 28

Research on LAP Routing Algorithm based on Traversal Tree

引用

28th Chinese Control and Decision Conference

作者： Shi, Lan Xie, Zihao Lv, Jianhui Northeastern Univ Coll Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China

ISBN: (纸本)9781467397148

In the OSPF (Open Shortest Path First) protocol, using the traditional flooding algorithm to convergence network topology will produce a large amount of redundant information and cause the waste of communication resources. LAP (Limitation Arrangement Principle) routing algorithm is introduced in this paper, which can be able to effectively solve the above problems. An LAP routing algorithm based on the traversal tree is proposed. The results show, when the number of links increases, the number of communications will reduce sharply during the network topology convergence completed by the BFS (Breadth First Search) traversal LAP routing algorithm. Compared with flooding algorithm, LAP routing algorithm based on the BFS traversal tree has less number of communications when the number of links between the nodes exceeds a threshold value. LAP routing algorithm improves the overall efficiency of the network topology convergence.

关键词： OSPF protocol flooding algorithm LAP routing algorithm traversal tree

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：