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

16th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2015

作者： Montes, Isabel Chua, Jaymari Cruz, Michelangelo Remillano, Augusto Young, Joseph Darwin Ocampo, Roel Festin, Cedric Computer Networks Laboratory Electrical and Electronics Engineering Institute University of the Philippines Diliman Philippinese United States Networks and Distributed Systems Group Department of Computer Science University of the Philippines Diliman Philippinese United States

ISBN: (纸本)9781479984619

High quality video streaming for mobile users is difficult to achieve in some areas of the world due to poor broadband capacity and sparse network coverage. We propose a bandwidth-sharing scheme to allow users with limited uplink bandwidth to borrow idle bandwidth from nearby access points and provide these users the opportunity to experience higher quality video than what their own bandwidth could normally support. We developed a Linux kernel implementation of a multipath less-than-best-effort (MP-LBE) protocol for bandwidth scavenging and demonstrated, through testbed experiments, that video quality may be improved through bandwidth sharing. This may bring us closer to the 'video everywhere' vision even as incremental upgrades are made on broadband Internet infrastructure. © 2015 IEEE.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Chemofluidic Oscillators: Autonomous Chemical Oscillator Circuit Based on Bidirectional Chemical-Microfluidic Coupling (Adv. Mater. Technol. 1/2016)

引用

Advanced Materials Technologies 2016年第1期1卷

作者： Georgi Paschew Jörg Schreiter Andreas Voigt Cesare Pini Joseph Páez Chávez Merle Allerdißen Uwe Marschner Stefan Siegmund René Schüffny Frank Jülicher Andreas Richter Polymeric Microsystems Institute of Semiconductors and Microsystems Faculty of Electrical and Computer Engineering and Center for Advancing Electronics Dresden Technische Universität Dresden 01062 Dresden Germany Highly-Parallel VLSI-Systems and Neuromorphic Circuits Institute of Circuits and Systems Faculty of Electrical and Computer Engineering and Center for Advancing Electronics Dresden Technische Universität Dresden 01062 Dresden Germany Polymeric Microsystems Institute of Semiconductors and Microsystems Faculty of Electrical and Computer Engineering and Center for Advancing Electronics Dresden & Research Training Group GRK 1865 “Hydrogel-Based Microsystems” Technische Universität Dresden 01062 Dresden Germany Center for Dynamics Department of Mathematics Technische Universität Dresden 01062 Dresden Germany Facultad de Ciencias Naturales y Matemáticas Escuela Superior Politécnica del Litoral Km. 30.5 Vía Perimetral Guayaquil Ecuador Microsystems Technology Institute of Semiconductors and Microsystems Faculty of Electrical and Computer Engineering Technische Universität Dresden 01062 Dresden Germany Center for Dynamics Department of Mathematics and Center for Advancing Electronics Dresden Technische Universität Dresden 01062 Dresden Germany Max Planck Institute for the Physics of Complex Systems 01187 Dresden Germany Center for Advancing Electronics Dresden Technische Universität Dresden 01062 Dresden Germany

来源：评论

学校读者我要写书评

暂无评论

Democratic elections in faulty distributed systems

Democratic elections in faulty distributed systems

引用

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Himanshu, Chauhan Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas Austin TX United States

ISBN: (纸本)9783642356674

In this paper, we show that for elections in distributed systems the conversion from non-binary choices to binary choices does not always provide optimal results when the preferences of nodes are not identical. With this observation, we study the problem of conducting democratic elections in distributed systems in the form of social choice and social welfare functions with three or more candidates. We present some impossibility and possibility results for distributed democratic elections in presence of Byzantine behavior. We also discuss some existing election schemes, and present a new approach that attempts to mitigate the effects of Byzantine *** analyze the performance of these schemes through simulations to compare their efficacy in producing the most desirable social welfare rankings. © Springer-Verlag 2013.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Maximal antichain lattice algorithms for distributed computations

Maximal antichain lattice algorithms for distributed computa...

引用

14th International Conference on distributed Computing and Networking, ICDCN 2013

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642356674

The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previously known algorithm by Nourine and Raynoud [NR99, NR02] to construct the lattice takes O (n2m) time where n is the number of events in the computation, and m is the size of the lattice of maximal antichains. The algorithm by Jourdan, Rampon and Jard [JRJ94] takes O ((n + w2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new online incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes O (mw2 log w L) time and O (wL w log n) space where wL is the width of the lattice of maximal antichains. The lower space complexity makes our algorithm applicable for online global predicate detection in a distributed system. For the purposes of analyzing offline traces, we also propose new enumeration algorithms to traverse the lattice. © Springer-Verlag 2013.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Lattice completion algorithms for distributed computations

Lattice completion algorithms for distributed computations

引用

16th International Conference on Principles of distributed systems, OPODIS 2012

作者： Garg, Vijay K. Parallel and Distributed Systems Lab. Department of Electrical and Computer Engineering University of Texas at Austin Austin TX 78712 United States

ISBN: (纸本)9783642354755

A distributed computation is usually modeled as a finite partially ordered set (poset) of events. Many operations on this poset require computing meets and joins of subsets of events. The lattice of normal cuts of a poset is the smallest lattice that embeds the poset such that all meets and joins are defined. In this paper, we propose new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed for distributed computing applications and have lower time or space complexity than those of existing algorithms. We also show applications of this lattice to the problems in distributed computing such as finding the extremal events and detecting global predicates. © 2012 Springer-Verlag.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Risk-based modelling for managing privacy protection

Risk-based modelling for managing privacy protection

引用

Canadian Conference on electrical and computer engineering (CCECE)

作者： Afshan Samani Hamada H. Ghenniwa Jagath Samarabandu Cooperative Distributed Systems Engineering Group Department of Electrical and Computer Engineering University of Western Ontario London Canada Department of Electrical and Computer Engineering University of Western Ontario London Canada

Privacy is one of the challenges in Cooperative distributed systems (CDSs) in open environments where entities can desirably work collaboratively. One way of dealing with this challenge is to evaluate the negative risk of operations on shared information in a collaborative setting. In this paper, we propose a Hierarchical Fuzzy Inference System (HFIS) to assess risk of privacy violation during the interaction among entities. In this work, we have identified and categorized major influential elements of privacy and adapted them as the base for the proposed HFIS. The accuracy of the risk assessment system in managing privacy situations is verified and validated against predefined privacy violation scenarios.

关键词： Privacy Contracts Risk management Law Joining processes Context Sensitivity

来源：评论

学校读者我要写书评

暂无评论

System monitoring with metric-correlation models

引用

IEEE Transactions on Network and Service Management 2011年第4期8卷 348-360页

作者： Jiang, Miao Munawar, Mohammad A. Reidemeister, Thomas Ward, Paul A.S. Shoshin Distributed Systems Group Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada

Modern software systems expose management metrics to help track their health. Recently, it was demonstrated that correlations among these metrics allow errors to be detected and their causes localized. Prior research shows that linear models can capture many of these correlations. However, our research shows that several factors may prevent linear models from accurately describing correlations, even if the underlying relationship is linear. Common phenomena we have observed include relationships that evolve, relationships with missing variables, and heterogeneous residual variance of the correlated metrics. Usually these phenomena can be discovered by testing for heteroscedasticity of the underlying linear models. Such behaviour violates the assumptions of simple linear regression, which thus fail to describe system dynamics correctly. In this paper we address the above challenges by employing efficient variants of Ordinary Least Squares regression models. In addition, we automate the process of error detection by introducing the Wilcoxon Rank-Sum test after proper correlations modeling. We validate our models using a realistic Java-Enterprise-Edition application. Using fault-injection experiments we show that our improved models capture system behavior accurately. © 2011 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

A cooperative game-theory model for bandwidth allocation in multi-hop wireless networks

A cooperative game-theory model for bandwidth allocation in ...

引用

2011 IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2011

作者： Jiang, Miao Ward, Paul A.S. Shoshin Distributed Systems Group Department of Electrical and Computer Engineering University of Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781457720147

The use of multi-hop wireless networks is extensive and growing. Such networks often have no single administrative authority. As such, they are best modeled by game theory. Existing approaches to this problem have focused on competitive game-theory analysis. In this paper we study the problem from the perspective of cooperative game theory. We assume that nodes wish to maximize their individual utility and cooperate solely for the purpose of increasing that utility. By assuming that the utility of a node is equal to its bandwidth, and by adopting the KS-Raiffa solution to cooperation, we are able to compute the fair bandwidth allocation in two-hop wireless networks. We then generalize these results to arbitrary multi-hop wireless networks. By assuming that any node can perform denial-of-service attack on the network, we are able to prove that Raiffa cooperation will result in temporal fairness in the network. Our results suggest that the ideal MAC for a wireless network will be one based on KS-Raiffa solution. © 2011 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

The Design and Software Implementation of a MAC Protocol for Body-Coupled Communication systems

The Design and Software Implementation of a MAC Protocol for...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Breva, Alberto Caballero Argyriou, Antonios Distributed Sensor Systems Group Philips Research Netherlands Department of Electrical and Computer Engineering University of Thessaly Volos 38221 Greece Center for Research and Technology Hellas (CERTH) Thessaloniki 57001 Greece

ISBN: (纸本)9781424492688

Body-coupled communication (BCC) is a technology that is based on the use of capacitively-coupled electric fields over the human body. In this paper we highlight the design and implementation of a medium access control (MAC) protocol specifically designed to meet the requirements of BCC-enabled body area networks (BANs). We propose a set of specific protocol enhancements over well-known MAC protocols that are based on the concept of low-power listening. We present the proposed protocol in conjunction with the embedded software implementation for the prototype hardware platform. The purpose of this approach is to demonstrate that several protocol enhancements were motivated by observations on the actual BCC hardware and its intricacies. Finally, we present a series of experiments under real conditions.

关键词： MAC protocol body coupled communication low energy consumption

来源：评论

学校读者我要写书评

暂无评论

Fused Data Structures for Handling Multiple Faults in distributed systems

Fused Data Structures for Handling Multiple Faults in Distri...

引用

International Conference on distributed Computing systems

作者： Bharath Balasubramanian Vijay K. Garg Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering University of Texas Austin USA

The paper describes a technique to correct crash faults in large data structures hosted on distributed servers, based on the concept of fused backups. The prevalent solution to this problem is replication. To correct f crash faults among n distinct data structures, replication requires nf additional replicas. If each of the primaries contains O(m) nodes of O(s) size each, this translates to O(nmsf) total backup space. Our technique uses a combination of erasure correcting codes and selective replication to correct f crash faults using just f additional backups consuming O(msf) total backup space, while incurring minimal overhead during normal operation. Since the data is maintained in the coded form, recovery is costly as compared to replication. However, in a system with infrequent faults, the savings in space outweighs the cost of recovery. We explore the theory and algorithms for these fused backups and provide a library of such backups for all the data structures in the Java 6 Collection framework. Our experimental evaluation confirms that fused backups are space-efficient as compared to replication (almost n times), while they cause very little overhead for updates. Many real world distributed systems such as Amazon's Dynamo data store use replication to achieve reliability. An alternate, fusion-based design can result in significant savings in space as well as other resources such as power.

关键词： Servers computer crashes Indexes Arrays Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：