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

10th IEEE International Conference on High Performance Computing and Communications

作者： Fu, Huaiguo Foghlu, Micheal O. Waterford Inst Technol Telecommun Software & Syst Grp Waterford Ireland

ISBN: (纸本)9780769533520

Large, dense-packed and high-dimensional data mining is one challenge of frequent closed itemset mining for association analysis, although frequent closed itemset mining is efficient approach to reduce the complexity of mining frequent quent itemsets. This paper proposes a distributed algorithm to address the challenge of discovering frequent closed itemsets in large, dense-packed and high-dimensional data. The algorithm partitions the search space of frequent closed itemsets into independent nonoverlapping subspaces that can be e extracted independently to generate frequent closed itemsets. The algorithm can generate frequent closed itemsets according to dense priority: the closed itemset more dense or more frequent will be generated preferentially. The experimental results show the algorithm is efficient to extract frequent closed itemsets in large data.

关键词： Frequent closed itemset mining Association analysis Concept lattice Partition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Enhanced distributed algorithm for Area Skyline Computation Based on Apache Spark 16th

An Enhanced Distributed Algorithm for Area Skyline Computati...

引用

16th International Conference on Knowledge Science, Engineering and Management (KSEM)

作者： Li, Chen Cao, Yang Zhu, Ye Zhang, Jinli Annisa, Annisa Cheng, Debo Tang, Huidong Jiang, Shuai Maruyama, Kenta Morimoto, Yasuhiko Nagoya Univ Grad Sch Informat Nagoya Aichi Japan Deakin Univ Ctr Cyber Resilience & Trust Geelong Vic Australia Beijing Univ Technol Beijing Peoples R China IPB Univ Dept Comp Sci Bogor Indonesia Univ South Australia STEM Adelaide SA Australia Hiroshima Univ Grad Sch Engn Hiroshima Japan

ISBN: (纸本)9783031402913;9783031402920

Skyline computations are a way of finding the best data points based on multiple criteria for location-based decision-making. However, as the input data grows larger, these computations become slower and more challenging. To address this issue, we propose an efficient algorithm that uses Apache Spark, a platform for distributed processing, to perform area skyline computations faster and more salable. Our algorithm consists of three main phases: calculating distances between data points, generating distance tuples, and computing the skyline. In the second phase, we apply a technique called local partial skyline extraction, which reduces the amount of data that needs to be sent from each executor (a parallel processing unit) to the driver (a central processing unit). The driver then computes the final skyline from the received data and creates filters to eliminate irrelevant points. Our experiments show that our algorithm can significantly reduce the data size and the computation time of the area skyline.

关键词： Area skyline query distributed algorithm Apache Spark

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for painting by a swarm of randomly deployed robots under limited visibility model

引用

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS 2018年第5期15卷

作者： Das, Deepanwita Mukhopadhyaya, Srabani Birla Inst Technol Mesra Lalpur Extens Ctr Ranchi 834001 Bihar India Natl Inst Technol Durgapur Durgapur W Bengal India

This article studies the problem of painting an obstacle free rectangular region by a swarm of mobile robots. Initially the robots are deployed randomly within the target area subject to the condition that the distribution is d*-dense, where d* = root 3d/2, and a robot can view up to a distance d. By d*-dense, it is meant that if all the robots are projected on a horizontal line, then the distance between two consecutive robots must be less than or equal to d*. Non-consideration of the popular CORDA ( computational) model in the field of area coverage by swarm robots has been addressed here. The proposed algorithm assumes CORDA model. The robots follow a completely distributed algorithm to paint the region. The robots do not need to be synchronous, but they are assumed to have equal velocities. However, the proposed algorithm supports the robots with different speed. In that case, if r is the given upper bound on the ratios of the speeds of any two robots, then the initial distribution has to be D*-dense, where D* = d/4 root(3 - r) (r + 5) 1 <= r < 3.

关键词： distributed algorithm robot swarm limited visibility painting

来源：评论

学校读者我要写书评

暂无评论

VSEP: A distributed algorithm for Graph Edge Partitioning 15th

VSEP: A Distributed Algorithm for Graph Edge Partitioning

引用

15th International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Zhang, Yu Liu, Yanbing Yu, Jing Liu, Ping Guo, Li Chinese Acad Sci Inst Informat Engn Beijing 100093 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

ISBN: (纸本)9783319271613;9783319271606

With the exponential growth of graph structured data in recent years, parallel distributed techniques play an increasingly important role in processing large-scale graphs. Since strong connections exist between vertices in graph data, the high communication cost for transforming boundary data is unavoidable in the distributed techniques. How to partition a large graph into several partitions with low coupling and balanced scale becomes a critical problem. Most of research in the literature studies vertex partitioning methods, which leads us to reconsider an alternative approach for edge partitioning. In this paper, we propose a distributed algorithm for graph partition based on edge partitioning, named as VSEP. A novel vertex permutation method is used to partition the large graphs iteratively. Experimental results indicate that VSEP reduces the number of times vertices are cut by about 10% similar to 20% comparing with a state-of-the-art algorithm while retains the scale balance.

关键词： Big graph Edge partitioning distributed algorithm Approximated algorithm Graph engine

来源：评论

学校读者我要写书评

暂无评论

Research of distributed algorithm Based on Usage Mining

Research of Distributed Algorithm Based on Usage Mining

引用

2nd International Workshop on Knowledge Discovery Data Mining

作者： Han, Qingtian Gao, Xiaoyan Naval Aeronaut & Astronaut Univ Dept Control Engn Yantai Peoples R China Shandong Business Inst Dept Informat Engn Yantai Peoples R China

ISBN: (纸本)9780769535432

Web mining applies the data mining, the artificial intelligence and the chart technology and so on to the web data and traces users' visiting characteristics, and then extracts the users' using pattern. This article will study on Web Mining algorithm based on Usage Mining. And it also produces the design mentality of the electronic commerce website application algorithm. Web usage mining is an application of data mining technology to mining the data of the web server log file. It can discover the browsing patterns of user and some kind of correlations between the web pages. Web usage mining provides the support for the web site design, providing personalization server and other business making decision, etc. This algorithm is simple, effective and easy to realize, it is suitable to the web usage mining demand of construct a low cost B2C website.

关键词： data mining distributed algorithm web usage mining

来源：评论

学校读者我要写书评

暂无评论

The distributed algorithm Design Based on Web Service

The Distributed Algorithm Design Based on Web Service

引用

2nd International Conference on E-Business and Information System Security (EBISS)

作者： Pan Bin Guo Hong-xia Liu Kun Chengdu Univ Technol Coll Informat Management Chengdu Peoples R China Chengdu Univ Coll Elect & Informat Engn Chengdu Peoples R China Southwest Oil & Gas Field Co Inst Res Dev & Explorat Chengdu Peoples R China

ISBN: (纸本)9781424458950

Take the forward reasoning algorithm as an example, this paper describes how to design a distributed algorithm with WEB service technology. Based on message passing programming model, the partitioning, communication and the task-scheduling of distributed algorithm are discussed. Finally, the distributed algorithm has been implemented with .NET platform, and tested by the parallel performance measures, and then the results are analyzed.

关键词： WEB service distributed algorithm forward reasoning .NET platform performance testing

来源：评论

学校读者我要写书评

暂无评论

A Deterministic distributed algorithm for Reasoning with Connected Row-Convex Constraints 16

A Deterministic Distributed Algorithm for Reasoning with Con...

引用

16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)

作者： Kong, Shufeng Lee, Jae Hee Li, Sanjiang Univ Technol Sydney Fac Engn & IT Ctr Quantum Software & Informat Sydney NSW Australia

ISBN: (纸本)9781510855076

The class of CRC constraints generalizes several tractable classes of constraints and is expressive enough to model problems in domains such as temporal reasoning, geometric reasoning, and scene labelling. This paper presents the first distributed deterministic algorithm for connected row-convex (CRC) constraints. Our distributed (partial) path consistency algorithm efficiently transforms a CRC constraint network into an equivalent constraint network, where all constraints are minimal (i.e., they are the tightest constraints) and generating all solutions can be done in a backtrackfree manner. When compared with the state-of-the-art distributed algorithm for CRC constraints, which is a randomized one, our algorithm guarantees to generate a solution for satisfiable CRC constraint networks and it is applicable to solve large networks in real distributed systems. The experimental evaluations show that our algorithm outperforms the state-of-the-art algorithm in both practice and theory.

关键词： Connected row-convex constraints deterministic algorithm distributed algorithm decomposable network

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed algorithm for Power Loss Minimizing in Smart Grid

A Novel Distributed Algorithm for Power Loss Minimizing in S...

引用

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Wei, Chao Fadlullah, Zubair Md. Kato, Nei Stojmenovic, Ivan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Heilongjiang Univ Sch Informat Sci & Technol Harbin 150080 Peoples R China Deakin Univ SIT Melbourne Vic Australia King Abdulaziz Univ Jeddah Saudi Arabia SEECS Univ Ottawa Ottawa ON Canada

ISBN: (纸本)9781479949342

Because power generation of renewable resources are unstable and demands of the customers are time-varying, the supply power and demands of the customers are always unequal. To meet the demands of the customers, power is transmitted from primary power generation to secondary power generation. It will cause high power loss. To solve this problem, a distributed algorithm is proposed in this paper. By using the algorithm, the micro-grids are able to exchange power with their neighbors so as to minimize the total power losses of the smart grid. Moreover, communication overhead (bandwidth) is reduced, comparing with centralized algorithm. Through computer simulations, we demonstrate that the proposed algorithm can lead to near-optimal result for alleviating the average power loss per microgrid and reduce the communication overhead significantly in contrast with the centralized approach.

关键词： distributed algorithm micro grid smart grid

来源：评论

学校读者我要写书评

暂无评论

Nearly Optimal distributed algorithm For Computing Betweenness Centrality 36

Nearly Optimal Distributed Algorithm For Computing Betweenne...

引用

36th IEEE International Conference on distributed Computing Systems (ICDCS)

作者： Hua, Qiang-Sheng Fan, Haoqiang Ai, Ming Qian, Lixiang Li, Yangyang Shi, Xuanhua Jin, Hai Huazhong Univ Sci & Technol Sch Comp Sci & Technol Serv Comp Technol & Syst Lab Big Data Technol & Syst LabCluster & Grid Comp L Wuhan Hubei Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing Peoples R China

ISBN: (纸本)9781509014828

In this paper, we propose an O(N) time distributed algorithm for computing betweenness centralities of all nodes in the network where N is the number of nodes. Our distributed algorithm is designed under the widely employed CONGEST model in the distributed computing community which limits each message only contains O(logN) bits. To our best knowledge, this is the first linear time deterministic distributed algorithm for computing the betweenness centralities in the published literature. We also give a lower bound for distributively computing the betweenness centrality under the CONGEST model as O(D+N/logN) where D is the diameter of the network. This implies that our distributed algorithm is nearly optimal.

关键词： betweenness centrality communication complexity Congest Model distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for finding maximum barrier coverage in wireless sensor networks

A distributed algorithm for finding maximum barrier coverage...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： He, Jun Shi, Hongchi SW Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781424456383

Constructing sensor barriers to detect intruders crossing restricted regions, such as country borders, is one of the major application categories for wireless sensor networks. In this paper, we present a distributed algorithm to find the maximum number of disjoint sensor barriers in wireless sensor networks. Our solution works for any sensor deployment, for any size and shape of a covered region, and even for heterogeneous sensor nodes. In particular, our algorithm is distributed and works perfectly in an asynchronous communication environment. It utilizes the property of wireless channel and has lower complexity compared with other algorithms. For a deployment of n sensors, our algorithm spends O(n(2)) messages and O(n(2)) time.

关键词： disjoint sensor barrier distributed algorithm intruder detection maximum barrier coverage safety systems sensor deployment sensor placement wireless sensor networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：