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

2016 4th IEEE International Conference on Cloud Computing and Intelligence Systems（IEEE CCIS2016）

作者： Zhaowei Qu Jianru Yan Sixing Yin Beijing University of Posts and Telecommunications

ISBN: (纸本)9781509012572

Due to technical bottlenecks and errors caused by artificial operation,the problem of incomplete data always exists in big data *** data imputation algorithms incur high complexity and the accuracy cannot reach the desired *** the same time,analysis and computation involved in mass data makes limitation of traditional algorithms and computing platform more *** this paper,we propose a data imputation method based on Apriori algorithm,and implement the corresponding algorithm on the distributed computing system built with *** experimental results show that the proposed algorithm outperforms a traditional data imputation algorithm in terms of efficiency and accuracy.

关键词： Association rules Data preprocessing Spark distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Cluster-Based Beaconing Process for VANET

引用

VEHICULAR COMMUNICATIONS 2015年第2期2卷 80-94页

作者： Allouche, Yair Segal, Michael Ben Gurion Univ Negev Commun Syst Engn Dept IL-84105 Beer Sheva Israel

In this paper we introduce the Cluster-Based Beacon Dissemination Process (CB-BDP) that aims to provide vehicles with a local vehicle proximity map of their vicinity. Based on this map, safety applications can be used for accident prevention by informing drivers about evolving hazardous situations. The CB-BDP is designed under the two following objectives. First, since it is used for safety applications, we want the map to be detailed and accurate as much as possible. Second, we want the map to be coordinated with nearby vehicles, thereby allowing synchronized and coordinated reactions of nearby vehicles to evolving hazardous situations. We design a cluster based aggregation-dissemination beaconing process that uses an optimized topology to distribute the vehicle proximity map. The topology is adaptive and robust in order to meet the challenging VANET conditions. An accurate and detailed map results in a heavy load of beacon messages. Our proposed scheme deals with this problem by integrating a contention-free medium access control (MAC) strategy for reliable communication. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Beacon dissemination distributed algorithm Medium access control Self-organizing topology

来源：评论

学校读者我要写书评

暂无评论

Message Complexity of distributed algorithms Revisited 3

Message Complexity of Distributed Algorithms Revisited

引用

International Conference Parallel distributed Grid Computing

作者： Mann, Behnish Arvavid, Alex Univ Northern British Columbia Prince George BC Canada

ISBN: (纸本)9781479976836

distributed systems offer many features such as resource sharing, scalability, fault tolerance and reliability. Several distributed algorithms have been proposed in literature to solve fundamental problems such as mutual exclusion and leader election in distributed systems. When more than one algorithm is invented to solve the same problem particularly in asynchronous distributed systems, their performance is compared mostly based on the message complexity. This paper reviews the concept of message complexity and offers more clarity by studying the performance of the two most popular distributed algorithms - Ricart-Agrawala's algorithm and Raymond algorithm designed to solve the mutual exclusion problem. The paper has four main contributions (i) observes how the message complexity is understood and computed in the asynchronous distributed system so far and exposes its elusiveness;(ii) offers a more suitable definition of message complexity;(iii) briefly presents the simulator designed to study the performance of the distributed algorithms using the refined metric;and finally (iv) discusses about the simulation study to illustrate the significance and usefulness of the proposed metric.

关键词： communication complexity distributed algorithms Raymond algorithm Ricart-Agrawala algorithm distributed algorithm distributed system message complexity algorithm design and analysis Complexity theory distributed algorithms Engines Measurement Network topology Topology distributed algorithms communication complexity distributed Systems algorithm design and analysis Complexity theory Network topology Engines topology

来源：评论

学校读者我要写书评

暂无评论

distributed Energy-efficient Power Control algorithm of Delay Constrained Traffic over Multi Fading Channels 12

Distributed Energy-efficient Power Control Algorithm of Dela...

引用

IEEE 12th International Conference on Dependable, Autonomic and Secure Computing (DASC)

作者： Wang, Shuai Li, Zhijun Jiang, Shouxu Harbin Inst Technol Dept Comp Sci & Technol Harbin 150006 Peoples R China

ISBN: (纸本)9781479950799

In this work, we focus on minimizing the overall network energy consumption problem under delay-constrained: N different packets from N time varying channels must be transmitted by a hard deadline of T slots. Each transmitter determines how much power to transmit with, during each time slot based on the current channel quality and the number of un transmitted bits, with the objective of minimizing overall network energy consumption. We transform the non-convex optimization problem into a geometric programming problem which has convex form and propose a distributed approximate optimization algorithm. Moreover, a lazy updating distributed algorithm is also presented for infrequent message passing. Experimental results show that the proposed distributed algorithm converges fast and the results of the distributed algorithm and results of centralized algorithm are very close.

关键词： distributed algorithm Energy-efficient Delayconstrained

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving distributed algorithm for Sparse Vector Sum

引用

BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN 2010年第2期17卷 235-242页

作者： Zhong, Sheng SUNY Buffalo Dept Comp Sci & Engn Amherst NY 14260 USA

We study the following problem: B-0 and B-1 each has a sparse input vector V-0 and V-1;for each j we need to decide whether B-0[j] + B-1[j] > t. We give a privacy-preserving algorithm, in which B-0 and B-1 do not need to reveal any information about their input vectors to each other, except the output of algorithm. Our algorithm is highly efficient.

关键词： Cryptography distributed algorithm Sparse Vector

来源：评论

学校读者我要写书评

暂无评论

Self-Organizing Access-Centric Storage Optimization in Smart Sensor Networks 7th

引用

7th International Conference on Ad Hoc Networks

作者： Grenz, Carsten Jaenen, Uwe Winizuk, Jonas Haehner, Joerg Univ Augsburg Organ Comp Augsburg Germany

ISBN: (纸本)9783319250670;9783319250663

Sensor networks are getting much more complex these days. The mixture of various low-cost sensors together with increasing computational power enables for whole new systems running a lot of different analysis and control algorithms concurrently. It is impossible to anticipate their composition and data flows a priori. Although the actual data flows are hardly predictable during design-time, we present a lightweight and self-organizing approach on how shared data stores are used to optimize the storage allocation of data during run-time. While mostly using the existing traffic to disseminate routing information, we show that our distributed algorithm significantly reduces query latencies by placing data according to the access-centric storage paradigm.

关键词： distributed algorithm In-Network Storage Routing

来源：评论

学校读者我要写书评

暂无评论

Location-free Minimum Coverage Determination in a Heterogeneous Wireless Sensor Network

Location-free Minimum Coverage Determination in a Heterogene...

引用

International Conference on Communications, Management, and Information Technology (ICCMIT)

作者： Khedr, Ahmed M. Sharjah Univ Dept Comp Sci Coll Sci Sharjah 27272 U Arab Emirates Zagazig Univ Fac Sci Dept Math Zagazig Egypt

The minimum connected cover problem is one of the most fundamental issues in wireless sensor networks, which directly affects the capability and efficiency of the wireless sensor network (WSN). Constructing a minimum connected coverage has a great relevance for network services, such as prolonged system lifetime by utilizing redundant deployment of sensor nodes where the main challenge in the design of sensor networks is the limited battery power of the sensors and the difficulty of replacing and/or recharging these batteries. Thus, it is necessary that the sensors be densely deployed and energy-efficient protocols be designed to maximize the network lifetime while meeting the specific application requirements in terms of coverage and connectivity. In this paper, we propose a new distributed algorithm to find the minimum connected cover of the queried region by discovering the redundant sensors for heterogeneous sensors, each with arbitrary sensing range and is not aware of its location or relative direction of its neighbor. We provide performance metrics to analyze the performance of our approach and the simulation results show that our approach clearly improves the network lifetime over existing algorithms. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Arbitrary sensing radius distributed algorithm Free-localization Minimum connected cover redundant sensor Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Novel Optimization Technique for Energy Demand Management via dispatchable, non dispatchable and storage devices 4

Novel Optimization Technique for Energy Demand Management vi...

引用

INTERNATIONAL CONFERENCE ON COMPUTATION OF POWER, ENERGY, INFORMATION AND COMMUNICATION

作者： Sreekanth, Sannayala Kumari, Sailaja Natl Inst Technol Warangal Andhra Pradesh India

ISBN: (纸本)9781467365246

This paper presents a novel demand side management with integration of renewable energy sources and storage devices. The presented work includes both traditional consumers and smart consumers (equipped with energy consumption schedulers, energy generation and storage devices). The users are intended to reduce their energy usage and prices by using renewable energy sources rather purchasing from the grid which can be regulated by the independent central unit by means of day ahead optimization process. The resulting grid optimization problem is formulated as a non-cooperative game. It is assumed that the independent central unit can adopt adequate pricing tariffs that differentiate the energy usage in time and level. Furthermore, we present a distributed algorithm to be run on the users' smart meters, which provide the optimal production and/or storage strategies, while preserving the privacy of the users. Finally, Simulation results confirm that the proposed approach can reduce the peak-to-average ratio of the total energy demand, the total energy costs, as well as each user's individual daily electricity charges. Moreover, the block pricing method is proved to be more beneficiary for the users compared to hourly pricing strategy

关键词： energy consumption scheduling devices distributed energy generation devices distributed energy storage devices smart grid distributed algorithm game theory

来源：评论

学校读者我要写书评

暂无评论

An Optimal distributed K-Means Clustering algorithm Based on CloudStack

An Optimal Distributed K-Means Clustering Algorithm Based on...

引用

IEEE International Conference on Information and Automation

作者： Yingchi Mao Ziyang Xu Xiaofang Li Ping Ping College of Computer and Information Engineering Hohai University College of Computer and Information Engineering Changzhou Institute of Technology

ISBN: (纸本)9781467391054

Clustering algorithm is applied to all kinds of fields, especially in the field of data mining. Due to the increasing number of the data, it's too hard for the clustering algorithm to afford the computation time in traditional computing model. When handling with big data, the corresponding algorithms of data mining have been transformed from the original single-core or single ported into the parallel and distributed processing. Parallel processing becomes the most popular way to improve the execution performace. This paper established a Hadoop distributed cluster based on the CloudStack and implemented the optimal distributed K-Means clustering algorithm based on MapReduce. The proposed optimal distributed K-Means clustering can obtain good quality of the results and the efficiency of the execution time. The experiment results show that the optimal distributed K-Means cluster algorithm can have better performance for dealing with large-scale data set.

关键词： K-Means Clustering distributed algorithm CloudStack Optimal distributed K-Means

来源：评论

学校读者我要写书评

暂无评论

An Approach of Power Allocation Scheme for Relay Communication Networks Based on Seller-Buyer Game 34

An Approach of Power Allocation Scheme for Relay Communicati...

引用

34th Chinese Control Conference (CCC)

作者： Zhang, Peng Liu, Zhixin Zhao, Ling Yang, Hongjiu Li, Xinbin Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Peoples R China Yanshan Univ Coll Mech Engn Minist Educ China Key Lab Adv Forging & Stamping Technol & Sci Qinhuangdao 066004 Peoples R China

ISBN: (纸本)9789881563897

In this paper, a robust optimization problem is formulated for decode-and-forward relay network via game theory. The uncertainty of channel gain is considered to overcome the performance degradation in practical environment. In this study, a probability threshold method is used to suppress the channel fluctuation. Besides, a seller-buyer game is formulated to jointly consider the maximum utility of source node and relay node. To reduce the overhead information exchanging, a distributed iteration algorithm is applied. Numerical results show the effectiveness of the proposed schemes, and also present the robustness of the relay network. Moreover, the proposed game is proved to converge to the unique equilibrium point.

关键词： Relay network game theory robust optimization outage probability distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：