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

Networked Computing in Wireless Sensor Networks for Structural Health Monitoring

Networked Computing in Wireless Sensor Networks for Structur...

Conference on Nondestructive Characterization for Composite Materials, Aerospace Engineering, Civil Infrastructure, and Homeland Security

作者： Jindal, Apoorva Liu, Mingyan Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

ISBN: (纸本)9780819485458

This paper studies the problem of distributed computation over a wireless network of resource constrained sensor nodes. In particular, we focus our attention on sensor networks used for structural health monitoring. Within this context, the heaviest computation is to determine the singular value decomposition (SVD) to extract mode shapes (eigenvectors) of a structure. Compared to collecting raw vibration data and performing SVD at a central location, computing SVD within the network can result in a significantly smaller energy consumption and delay. Recent results have proposed methods to decompose SVD into components that can be carried out in a distributed way. The focus of this paper is to determine a near-optimal communication structure that enables the distribution of this computation and the reassembly of the final results, with the objective of minimizing energy consumption subject to a computational delay constraint. We show that this reduces to a generalized clustering problem;a cluster forms a unit on which a component of the overall computation is performed. We establish that this problem is NP-hard. By relaxing the delay constraint, we derive a lower bound to this problem. We also show that the optimal solution to the unconstrained problem has a simple structure that reveals insights into the solution of the original constrained problem. We then propose an integer linear program (ILP) to solve the constrained problem exactly as well as an approximate algorithm with a proven approximation ratio. We also present a distributed version of the approximate algorithm. Numerical results are presented.

关键词： distributed computation SVD Wireless Sensor Networks Clustering Structural Health Monitoring

来源：评论

学校读者我要写书评

暂无评论

Coordinating Evolution: An Open, Peer-to-Peer Architecture for a Self-adapting Genetic Algorithm 1

引用

12th International Conference on Enterprise Information Systems (ICEIS 2010)

作者： Chatzinikolaou, Nikolaos Univ Edinburgh Sch Informat Edinburgh Midlothian Scotland

ISBN: (数字)9783642198021

ISBN: (纸本)9783642198014

In this paper we present an agent-based, peer-to-peer genetic algorithm capable of self-adaptation. We describe a preliminary architecture to that end, in which each agent is executing a local copy of a GA. using initially random parameters (currently restricted to the mutation rate for the purposes of experimentation). These GA agents are optimised themselves through the use of an evolutionary process of selection and recombination. Agents are selected according to the tness of their respective populations, and during the recombination phase they exchange individuals from their population as well as their optimisation parameters, which is what lends the system its self-adaptive properties. This allows the execution of "optimal optimisations" without the burden of tuning the evolutionary process by hand. Thanks to its parameter-less operation, our platform becomes more accessible and appealing to people outside the evolutionary computation community, and therefore a valuable tool in the eld of enterprise information systems. Initial empirical evaluation of the peer to peer architecture demonstrates better harnessing of the available resources, as well as added robustness and improved scalability.

关键词： Genetic algorithms distributed computation Multi-agent learning Agent coordination

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Complex Systems: From Antenna Circuits to Power Grids

Large-Scale Complex Systems: From Antenna Circuits to Power ...

引用

作者： Lavaei, Javad California Institute of Technology

学位级别：Ph.D.

This dissertation is motivated by the lack of scalable methods for the analysis and synthesis of different large-scale complex systems appearing in electrical and computer engineering. The systems of interest in this work are power networks, analog circuits, antenna systems, communication networks and distributed control systems. By combining theories from control and optimization, the high-level objective is to develop new design tools and algorithms that explicitly exploit the physical properties of these practical systems (e.g., passivity of electrical elements or sparsity of network topology). To this end, the aforementioned systems are categorized intro three classes of systems, and then studied in Parts I, II, and III of this dissertation, as explained below: Power networks: In Part I of this work, the operation planning of power networks using efficient algorithms is studied. The primary focus is on the optimal power flow (OPF) problem, which has been studied by the operations research and power communities in the past 50 years with little success. In this part, it is shown that there exists an efficient method to solve a practical OPF problem along with many other energy-related optimization problems such as dynamic OPF or security-constrained OPF. The main reason for the successful convexification of these optimization problems is also identified to be the physical properties of a power circuit, especially the passivity of transmission lines. Circuits and systems: Motivated by different applications in power networks, electromagnetics and optics, Part II of this work studies the fundamental limits associated with the synthesis of a particular type of linear circuit. It is shown that the optimal design of the parameters of this type of circuit can be performed in polynomial time if the circuit is passive and there are sufficient number of controllable (unknown) parameters. This result introduces a trade-off between the design simplicity and the implementatio

关键词： Convex Optimization Power Networks Communication Networks distributed computation Smart Grid Control

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING AND EVALUATING THE COORDINATION LAYER AND TIME-SYNCHRONIZATION OF A NEW PROTOCOL FOR INDUSTRIAL COMMUNICATION NETWORKS

IMPLEMENTING AND EVALUATING THE COORDINATION LAYER AND TIME-...

引用

作者： ULAS TURAN Middle East Technical University

学位级别：硕士

Currently automation components of large-scale industrial systems are realized with dis- tributed controller devices that use local sensor/actuator events and exchange shared events with communication networks. Fast paced improvement of Ethernet provoked its usage in in- dustrial communication networks. The incompatibility of standard Ethernet protocol with the real-time requirements encouraged industry and academic researchers to provide a resolution for this problem. However, the existing solutions in the literature suggest a static bandwidth allocation for each controller device which usually leads to an inefficient bandwidth use. Dy- namic distributed Dependable Real-time Industrial Communication Protocol (D3RIP) family dynamically updates the necessary bandwidth allocation according to the messages generated by the control application. D3RIP is composed of two protocols; interface layer that provides time-slotted access to the shared medium based on an accurate clock synchronization of the distributed controller devices and coordination layer that decides the ownership of real-time slots. In this thesis, coordination layer protocol of D3RIP family and the IEEE 1588 time synchronization protocol is implemented and tested on the real hardware system that resem- bles a factory plant floor. In the end, we constructed a system that runs an instance of D3RIP family with 3ms time-slots that guarantees 6.6ms latency for the real-time packets of control application. The results proved that our implementation may be used in distributed controller realizations and encouraged us to further improve the timing constraints.

关键词： Industrial communication real-time distributed computation Ethernet

来源：评论

学校读者我要写书评

暂无评论

Location-Aided Fast distributed Consensus in Wireless Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第12期56卷 6208-6227页

作者： Li, Wenjun Dai, Huaiyu Zhang, Yanbing N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observed that by overcoming the diffusive behavior of reversible chains, certain nonreversible chains lifted from reversible ones mix substantially faster than the original chains. In this paper, the idea of Markov chain lifting is studied to accelerate the convergence of distributed consensus, and two general pseudoalgorithms are presented. These pseudoalgorithms are then instantiated through a class of location-aided distributed averaging (LADA) algorithms for wireless networks, where nodes' coarse location information is used to construct nonreversible chains that facilitate distributed computing and cooperative processing. Our first LADA algorithm is designed for grid networks;for a k x k grid network, it achieves an epsilon-averaging time of O(k log(epsilon(-1))). Based on this algorithm, in a wireless network with transmission range r, an epsilon-averaging time of O(r(-1) log(epsilon(-1))) can be attained through a centralized algorithm. Subsequently, a distributed LADA algorithm is presented, achieving the same scaling law in averaging time as the centralized scheme in wireless networks for all r satisfying the connectivity requirement;the constructed chain also attains the optimal scaling law in terms of an important mixing metric, the fill time, in its class. Finally, a cluster-based LADA algorithm is proposed, which, requiring no central coordination, provides the additional benefit of reduced message complexity compared with the distributed LADA algorithm.

关键词： Clustering distributed computation distributed consensus message complexity mixing time nonreversible Markov chains time complexity

来源：评论

学校读者我要写书评

暂无评论

A local asynchronous distributed privacy preserving feature selection algorithm for large peer-to-peer networks

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2010年第3期24卷 341-367页

作者： Das, Kamalika Bhaduri, Kanishka Kargupta, Hillol Stinger Ghaffarian Technol Inc IDU Grp NASA Ames Res Ctr Moffett Field CA 94035 USA Mission Critical Technol Inc IDU Grp NASA Ames Res Ctr Moffett Field CA 94035 USA Univ Maryland Dept CSEE Baltimore MD 21250 USA AGNIK LLC Baltimore MD USA

In this paper we develop a local distributed privacy preserving algorithm for feature selection in a large peer-to-peer environment. Feature selection is often used in machine learning for data compaction and efficient learning by eliminating the curse of dimensionality. There exist many solutions for feature selection when the data are located at a central location. However, it becomes extremely challenging to perform the same when the data are distributed across a large number of peers or machines. Centralizing the entire dataset or portions of it can be very costly and impractical because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, dynamic nature of the data/network, and privacy concerns. The solution proposed in this paper allows us to perform feature selection in an asynchronous fashion with a low communication overhead where each peer can specify its own privacy constraints. The algorithm works based on local interactions among participating nodes. We present results on real-world dataset in order to test the performance of the proposed algorithm.

关键词： Privacy preserving Data mining Feature selection distributed computation

来源：评论

学校读者我要写书评

暂无评论

distributed estimation of global parameters in delay-tolerant networks

引用

COMPUTER COMMUNICATIONS 2010年第13期33卷 1472-1482页

作者： Guerrieri, Alessio Carreras, Iacopo De Pellegrini, Francesco Miorandi, Daniele Montresor, Alberto CREATE NET I-38100 Trento Italy Univ Trent I-38100 Trento Italy

distributed estimation of global parameters in intermittently connected mobile networks is a challenging research issue. In this paper, we introduce and evaluate different approaches, based on gossiping techniques as well as population protocols. The performance of the mechanisms proposed is shown to depend heavily on the specific features of the underlying mobility patterns. We then present how the various methods proposed can be applied to dynamically tune the parameters characterizing a popular relaying strategy (spray-and-wait) for delay-tolerant networks. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Delay-tolerant networks distributed computation distributed estimation Aggregation protocols Population protocols

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical distributed Situation Assessment Model Based on Bayesian Networks

A Hierarchical Distributed Situation Assessment Model Based ...

引用

2nd IEEE International Conference on Advanced Computer Control

作者： Nong, Jing Wang, Lei Yin, Huilin Tongji Univ Sch Elect & Informat Engn Shanghai 200092 Peoples R China Tongji Univ Chinese German Sch Postgrad Studies Shanghai 200092 Peoples R China

ISBN: (纸本)9781424458479

Situation assessment (SA) is one of the important processes in military decision. As a component of battlefield data fusion and decision support, SA is not easy to be realized ideally by using one particular technology in practice. Like any other complex military process, it requires the cooperation of lots of information processing technology. This paper describe a mechanism for constructing probabilistic models to represent and analyze uncertainties and assessing battlefield state based on a hierarchical distributed fusion processing of incoming information which can help commanders and analysts to model and assess the dynamic evolving situational state easily. We adopted a hierarchy distributed DBN model which can process information hierarchically and cooperatively through higher-level dynamic Bayesian networks and distributed lower-level dynamic Bayesian networks. And a 3-layer distributed computation environment is also introduced. The hierarchy distributed DBN can generate an accurate and efficient assessment of the battlespace and suitable for military hierarchical organizations.

关键词： data fusion situation assessment Bayesian networks dynamic Bayesian networks distributed computation

来源：评论

学校读者我要写书评

暂无评论

A Scalability Metric Based on Beowulf Cluster System

A Scalability Metric Based on Beowulf Cluster System

引用

9th International Symposium on distributed Computing and Applications to Business, Engineering and Science (DCABES 2010)

作者： Zhu, Yongzhi Cao, Baoxiang Qufu Normal Univ Coll Comp Sci RiZhao 276826 Peoples R China

ISBN: (纸本)9780769541105

Along with the rapid development of parallel computing technology and the popularity of Beowulf cluster system, the scalability of parallel algorithm-machine combinations, which measures the capacity of a parallel algorithm to effectively utilize an increasing number of processors, becomes more and more important. This ratio of parallel overhead to computation is reviewed in this paper, the merit and deficiencies of this metric are pointed out. Then in order to apply the distributed parallel computation environment based on Beowulf cluster it is improved, obtain the new extensible function which reflects the scalability of distributed parallel systems more directly and precisely when the size of machines and the scale of problems are extending in the environment of Beowulf cluster. Finally, the new metric is used to analyze and prove the scalability of parallel algorithms and Beowulf cluster.

关键词： scalability iso ratio of parallel overhead to computation Beowulf cluster distributed computation

来源：评论

学校读者我要写书评

暂无评论

kiltera: a language for timed, event-driven, mobile and distributed simulation 10

kiltera: a language for timed, event-driven, mobile and dist...

引用

14th IEEE/ACM International Symposium on distributed Simulation and Real-Time Applications (DS-RT 2010)

作者： Posse, Ernesto Dingel, Juergen Queens Univ Sch Comp Appl Formal Methods Grp Kingston ON Canada

ISBN: (纸本)9780769542515

kiltera is a language for modelling, analysis and simulation of time-sensitive, event-driven systems with support for (channel) mobility, introduced in [21]. In this paper we present an updated version of the language to support distributed computation. We present the language from an informal perspective and discuss its implementation based on event-scheduling and time-warp for distributed simulation. We also present a non-trivial application to modelling load-balancing in server farms.

关键词： Modelling language discrete event simulation distributed computation distributed discrete-event simulation distributed simulation event scheduling event-driven simulation kiltera load-balancing modelling mobile simulation resource allocation scheduling server farm simulation language timed simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：