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

IEEE International Conference on Big Data and Smart Computing (BigComp)

作者： Baek, Jaeuk Do, Seungwon Jun, Sungwoo Lee, ChangEun ETRI Intelligent Convergence Res Lab Daejeon 34129 South Korea

ISBN: (纸本)9781665421973

In order to recognize battlefield situation or environment, one of the most important issue is to merge semantic information obtained by multiple agents. In this paper, we propose a distributed graph matching network to classify multiple agents based on graph similarity analysis. To this end, we construct a hypergraph to analyze a high-order relationship between agents (i.e., graphs). Then a hypergraph incidence matrix is used to sample a tuple of (anchor, positive, negative) agents, where triplet loss is minimized to train agent embedding vector such that the trained vectors are similar for graphs with similar topological and semantic information. To tackle the over-fitting problem caused by fixed samples of agent, we propose a hypergraph induced sample validation for online update of hyperedges in training step. Experiment results demonstrate the performance of our proposed model.

关键词： graph matching Hypergraph distributed graph Semantic information Triplet loss

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed algorithm for detection of knots and cycles in a distributed graph

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2003年第10期14卷 961-972页

作者： Manivannan, D Singhal, M Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

Knot detection in a distributed graph is an important problem and finds applications in deadlock detection in several areas such as store-and-forward networks, distributed simulation, and distributed database systems. This paper presents an efficient distributed algorithm to detect if a node is part of a knot in a distributed graph. The algorithm requires 2e messages and a delay of 2(d + 1) message hops to detect if a node in a distributed graph is in a knot (here, e is the number of edges in the reachable part of the distributed graph and d is,its diameter). A significant advantage of this algorithm is that it not only detects if a node is involved in a knot, but also finds exactly which nodes are involved in the knot. Moreover, if the node is not involved in a knot, but is only involved in a cycle, then it finds the nodes that are in a cycle with that node. We illustrate the working of the algorithm with examples. The paper ends with a discussion on how the information about the nodes involved in the knot can be used for deadlock resolution and also on the performance of the algorithm.

关键词： distributed graph distributed systems knot detection deadlock detection distributed algorithms distributed simulation

来源：评论

学校读者我要写书评

暂无评论

A Synchronized and Dynamic distributed graph structure to allow the native distribution of Multi-Agent System simulations 29

A Synchronized and Dynamic Distributed Graph structure to al...

引用

29th Euromicro International Conference on Parallel, distributed and Network-Based Processing (PDP)

作者： Breugnot, Paul Herrmann, Benedicte Lang, Christophe Philippe, Laurent UBFC DISC FEMTO ST Besancon France

ISBN: (纸本)9781665414555

Multi-Agent Systems (MAS) are naturally good candidates for large-scale parallel simulations. However, implementing MAS simulations for distributed memory architectures, such as high Performance Computing clusters, is still complex for non-experts. In this article we present the principle of a Dynamic distributed graph structure, that enables the native distribution of MAS simulations. Most of the distribution related issues such as dynamic load-balancing, time synchronization and data migration across processes can he completely automated and abstracted for the user, who can safely design distribution independent MAS models. The major interest of our contribution is the transparent management of concurrent read / write requests across distant processes, a significant feature not provided by surveyed platforms. We also present FPMAS, an open source C++ implementation of a distributed Multi-Agent System Simulation platform based on the distributed graph structure.

关键词： multii-agent systems simulation hpc distributed graph

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for knot detection in a distributed graph

A distributed algorithm for knot detection in a distributed ...

引用

31st International Conference on Parallel Processing (ICPP 2002)

作者： Manivannan, D Singhal, M Univ Kentucky Dept Comp Sci Lexington KY 40506 USA

ISBN: (纸本)0769516777

Knot detection in a distributed graph is an important problem and finds applications in several areas such as packet switching, distributed simulation, and distributed database systems. This paper presents a distributed algorithm to efficiently detect the existence of a knot in a distributed graph. The algorithm requires 2e messages and a delay of 2(d+1) message hops to detect if a node in a distributed graph is in a knot (e is the number of edges in the reachable part of the distributed graph and d is its diameter). A significant advantage of this algorithm is that it not only detects if a node is in a knot but also finds exactly which nodes are involved in the knot.

关键词： distributed graph distributed systems knot detection deadlock detection distributed algorithms distributed simulation

来源：评论

学校读者我要写书评

暂无评论

Composite Modeling based on distributed graph Transformation and the Eclipse Modeling Framework

Composite Modeling based on Distributed Graph Transformation...

引用

作者： Stefan Jurack Philipps University of Marburg

学位级别：博士

Model-driven development (MDD) has become a promising trend in software engineering for a number of reasons. Models as the key artifacts help the developers to abstract from irrelevant details, focus on important aspects of the underlying domain, and thus master complexity. As software systems grow, models may grow as well and? nally become possibly too large to be developed and maintained in a comprehensible way. In traditional software development, the complexity of software systems is tackled by dividing the system into smaller cohesive parts, so-called components, and let distributed teams work on each concurrently. The question arises how this strategy can be applied to model-driven development. The overall aim of this thesis is to develop a formalized modularization concept to enable the structured and largely independent development of in- terrelated models in larger teams. To this end, this thesis proposes component models with explicit export and import interfaces where exports declare what is provided while imports declare what it needed. Then, composite model can be connected by connecting their compatible export and import interfaces yielding so-called composite models. Suitable to composite models, a transfor- mation approach is developed which allows to describe changes over the whole composition structure. From the practical point of view, this concept especially targets models based on the Eclipse Modeling Framework (EMF). In the modeling commu- nity, EMF has evolved to a very popular framework which provides modeling and code generation facilities for Java applications based on structured data models. Since graphs are a natural way to represent the underlying structure of vi- sual models, the formalization is based on graph transformation. Incorporated concepts according to distribution heavily rely on distributed graph trans- formation introduced by Taentzer. Typed graphs with inheritance and con- tainment structures are well suited to describe the

关键词： Eclipse Modellierung graphtransformation Modellgetriebene Entwicklung distributed graph Eclipse Modeling Framework graphersetzungssystem Composite modeling Data processing Computer science

来源：评论

学校读者我要写书评

暂无评论

Keyword Search over distributed graphs with Compressed Signature

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2017年第6期29卷 1212-1225页

作者： Yuan, Ye Lian, Xiang Chen, Lei Yu, Jeffery Xu Wang, Guoren Sun, Yongjiao Northeastern Univ Dept Comp Sci Shenyang 110004 Liaoning Peoples R China UTPA Comp Sci Dept Edinburg TX 78539 USA Hong Kong Univ Sci & Technol Dept Comp Sci Clear Water Bay Hong Kong Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China

graph keyword search has drawn many research interests, since graph models can generally represent both structured and unstructured databases and keyword searches can extract valuable information for users without the knowledge of the underlying schema and query language. In practice, data graphs can be extremely large, e.g., a Web-scale graph containing billions of vertices. The state-of-the-art approaches employ centralized algorithms to process graph keyword searches, and thus they are infeasible for such large graphs, due to the limited computational power and storage space of a centralized server. To address this problem, we investigate keyword search for Web-scale graphs deployed in a distributed environment. We first give a naive search algorithm to answer the query efficiently. However, the naive search algorithm uses a flooding search strategy that incurs large time and network overhead. To remedy this shortcoming, we then propose a signature-based search algorithm. Specifically, we design a vertex signature that encodes the shortest-path distance from a vertex to any given keyword in the graph. As a result, we can find query answers by exploring fewer paths, so that the time and communication costs are low. Moreover, we reorganize the graph data in the cluster after its initial random partitioning so that the signature-based techniques are more effective. Finally, our experimental results demonstrate the feasibility of our proposed approach in performing keyword searches over Web-scale graph data.

关键词： Keyword search distributed graph

来源：评论

学校读者我要写书评

暂无评论

Thing in, a research platform for the Web of Things 27

Thing in, a research platform for the Web of Things

引用

IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Derrien, Sylvie Meye, Pierre Raipin, Phillippe Orange Labs Rennes France

Thing in is a research platform built by Orange to experiment the Web of Things. The heart of the platform consists of an object graph knowledge database. Each vertex of this graph is the representation of a connected object or an object giving information on the context in which a connected object evolves. Each edge gives information about the relation between two objects (e.g. within, owned by, adjacent to, etc.). This graph is not only shaped by the quantity but also to the diversity of information provided to the emerging IoT applications. In order to do so, Thing in relies on a strong coupling of graph-based database technologies with semantic technologies. Hence, the Thing in platform makes possible to cross heterogeneous information from billions of objects and to multiply the top use cases.

关键词： Internet of Things Web of Things distributed graph graph-database connected objects avatars digital twin

来源：评论

学校读者我要写书评

暂无评论

DDSL: Efficient Subgraph Listing on distributed and Dynamic graphs 25th

DDSL: Efficient Subgraph Listing on Distributed and Dynamic ...

引用

25th International Conference on Database Systems for Advanced Applications (DASFAA)

作者： Jian, Xun Wang, Yue Lei, Xiayu Shen, Yanyan Chen, Lei Hong Kong Univ Sci & Technol Hong Kong Peoples R China Shenzhen Univ Shenzhen Inst Comp Sci Shenzhen Peoples R China Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9783030594152;9783030594169

Subgraph listing is a fundamental problem in graph theory and has wide applications in many areas. Modern graphs can usually be large-scale and highly dynamic, which challenges the efficiency of existing subgraph listing algorithms. In this paper, we propose an efficient join-based approach, called distributed and Dynamic Subgraph Listing (DDSL), which can incrementally update the results instead of running from scratch. Extensive experiments are conducted on real-world datasets. The results show that DDSL outperforms existing methods in dealing with both static and dynamic graphs in terms of the responding time.

关键词： distributed graph Dynamic graph Subgraph listing

来源：评论

学校读者我要写书评

暂无评论

CLAN: An Efficient distributed Temporal Community Detection Protocol for MANETs 11

CLAN: An Efficient Distributed Temporal Community Detection ...

引用

11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems

作者： Dabideen, Stephen Kawadia, Vikas Nelson, Samuel C. Raytheon BBN Technol Cambridge MA 02138 USA

ISBN: (纸本)9781479960361

Real world MANETs often exhibit an inherent community structure in their topological connectivity and in the evolution of the topology over time. Such temporal community structure of MANETs has been shown to be extremely useful in improving the performance of routing and content-based routing in MANETs [1]-[4]. However, detecting temporal communities in a completely distributed and real time manner is a hard problem, and it is often performed offline with knowledge of the full network topology over time. We propose CLAN, a distributed and real-time protocol for detecting temporal communities in MANETs. CLAN is an adaptation of the Label Propagation algorithm [5] to distributed and time-varying graphs that MANETs are. A key novel component of CLAN is local rules for community rediscovery as the network evolves. CLAN also uses a weighted version of the network topology where the weights are defined using a novel notion of social entropy to promote stability of communities. Extensive simulation results demonstrate that CLAN is quick to converge, incurs minimal overhead and is as effective as centralized approaches to temporal community detection. We also demonstrate how the temporal community structure can be used by designing a hierarchical routing protocol that achieves the delivery ratio of the OLSR [6] routing protocol at a fraction of the overhead.

关键词： graph theory mobile ad hoc networks routing protocols telecommunication network topology CLAN protocol OLSR routing protocol community rediscovery content-based routing distributed graph distributed-real-time protocol efficient distributed temporal community detection protocol hard problem hierarchical routing protocol inherent community structure label propagation algorithm network topology real-world MANET social entropy temporal community structure time-varying graph topological connectivity Ad hoc networks Communities Entropy Mobile computing Network topology Protocols Routing Community detection Label propagation ad-hoc clustering Mobile ad hoc networks Network topology Hierarchical routing protocol Community structure telecommunication network topology Routing protocols Network routing protocols Mobile Computing Ad hoc networks graph theory entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：