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

International Conference on Information, Intelligence, systems and Applications

作者： Constantinos Patsakis Agusti Solanas Distributed Systems Group School of Computer Science and Statistics Trinity College UNESCO Chair in Data Privacy Department Computer Engineering & Mathematics Universitat Rovira i Virgili

ISBN: (纸本)9781479907694

Business models based on offering free services to people in exchange for their data are gaining importance and prevalence. The most prominent examples are social networks and, more recently, mobile social networks. However, this trend is endangering users' privacy. We do not discuss the ethical and legal issues derived from this business model. Notwithstanding, we believe that users might have better and more privacy-aware alternatives enabling them to trade their privacy on their own. Thus, we introduce the concept of "Privacy as a Product" (PaaP) and we propose and describe a framework and a protocol based on the Raykova-Vo-Bellovin-Malkin protocol that enables users to share private data without the need for trusting the infrastructure (e.g. a social network).We show that our proposal is feasible in terms of computational and storage overhead. Hence, our solution opens the door to the new concept of "Privacy as a Product" and could be the foundation for implementations of privacy-aware social networks in which privacy plays a more central role, like in the healthcare sector.

关键词： Privacy Social Networks Secure Multiparty Computation M-Health

来源：评论

学校读者我要写书评

暂无评论

A blueprint for switching between secure routing protocols in wireless multihop networks

A blueprint for switching between secure routing protocols i...

引用

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Marc Werner Jörg Kaiser Matthias Hollick Elias Weingärtner Klaus Wehrle Department of Computer Science Secure Mobile Networking Laboratory (SEEMOO) Technische Universität Darmstadt Darmstadt Germany Department of Computer Science Chair of Communication and Distributed Systems (COMSYS) RWTH Aachen University Aachen Germany

A plethora of (secure) routing protocols exists for wireless multihop networks. These protocols are mostly tailored to meet the performance and security requirements of specific application scenarios. As a result, the protocols cannot easily be adapted to novel application demands, organically growing networks, etc. We argue that the modular design of routing protocols and security mechanisms can remove the key limitations of today's monolithic routing protocols. We show the feasibility of a modular routing approach for wireless multihop networks using the example of a wireless mesh network. In particular, we demonstrate that a dynamic switch between protocol modules is possible at runtime by means of simulation as well as testbed experimentation. We further demonstrate that the security associations and the key material can be reutilized for bootstrapping novel protocol modules, thus minimizing the control overhead.

关键词： Routing protocols Switches Routing Cryptography Delays

来源：评论

学校读者我要写书评

暂无评论

Phase optimization for control/fusion applications in dynamically composed sensor networks

Phase optimization for control/fusion applications in dynami...

引用

International Workshop on Robot Sensing (ROSE)

作者： Sebastian Zug André Dietrich Christoph Steup Tino Brade Thomas Petig Department for Distributed Systems Otto-von-Guericke Universität Magdeburg Magdeburg Germany Department of Computer Science and Engineering Chalmers University of Technology Göteborg Sweden

The variable acquisition of distributed sensor perception promises an effective utilization of these data across different applications. Multiple observations enable an increase in the quality of the system output. However, the dynamic composition disables all off-line optimization approaches, especially for sensor-application-scheduling. This paper addresses the need for an online adjustment of periodically working sensors and fusion/control applications. Based on a number of common goals - e.g., minimization of the variance of sensor data or the age of data sets - we deduce different metrics. For one aspect, the number of input counts, we propose a mathematical description and apply related optimizations. We use an an example analysis to illustrate further research goals.

关键词： Optimization Robot sensing systems Delays Probability density function Process control

来源：评论

学校读者我要写书评

暂无评论

Multi-agent multi-issue negotiations with incomplete information: A Genetic Algorithm based on discrete surrogate approach

Multi-agent multi-issue negotiations with incomplete informa...

引用

Congress on Evolutionary Computation

作者： Ahmed Kattan Yew-Soon Ong Edgar Galván-López AI Real-World Applications Lab Computer Science Department UQU Saudi Arabia School of Computer Engineering Nanyang Technological University Singapore Distributed Systems Group School of Computer Science and Statistics Trinity College Dublin Ireland

ISBN: (纸本)9781479904532

In this paper we present a negotiation agent based on Genetic Algorithm (GA) and Surrogate Modelling for a multi-player multi-issue negotiation model under incomplete information scenarios to solve a resource-allocation problem. We consider a multi-lateral negotiation protocol by which agents make offers sequentially in consecutive rounds until the deadline is reached. Agents' offers represent suggestions about how to divide the available resources among all agents participating in the negotiation. Each agent may “Accept” or “Reject” the offers made by its opponents through selecting the “Accept” or “Reject” option. The GA is used to explore the space of offers and surrogates used to model the behaviours of individual opponent agents for enhanced genetic evolution of offers that is agreeable upon all agents. The GA population comprises of solution individuals that are formulated as matrices where a specialised three different search operators that take the matrix representation into considerations are considered. Experimental studies of the proposed negotiation agent under different scenarios demonstrated that the negotiations by the agents completed in agreement before the deadline is reached, while at the same time, maximising profits.

关键词： Space exploration Mathematical model Approximation methods Genetic algorithms Computational modeling Equations Sociology

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

International Journal of Metadata, Semantics and Ontologies 2014年第2期9卷 81-82页

作者： Malki, Mimoun Flory, Andreá Evolutionary Engineering and Distributed Information Systems Laboratory-EEDIS Computer Science Department Djillali Liabes University of Sidi Bel Abbes B.P. 89 22000 Sidi Algeria Laboratoire d'InfoRmatique en Image et Systeámes d'information Computer Science Department Institut National des Sciences Appliqueáes de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne cedex France

来源：评论

学校读者我要写书评

暂无评论

Multi-agent programming contest 2013: The teams and the design of their systems

Multi-agent programming contest 2013: The teams and the desi...

引用

1st International Workshop on Engineering Multi-Agent systems, EMAS 2013

作者： Ahlbrecht, Tobias Bender-Saebelkampf, Christian De Brito, Maiquel Christensen, Nicolai Christian Dix, Jürgen Franco, Mariana Ramos Heller, Hendrik Hess, Andreas Viktor Heßler, Axel Hübner, Jomi Fred Jensen, Andreas Schmidt Johnsen, Jannick Boese Köster, Michael Li, Chengqian Liu, Lu Morato, Marcelo Menezes Ørum, Philip Bratt Schlesinger, Federico Schmitz, Tiago Luiz Sichman, Jaime Simão De Souza, Kaio Siqueira Uez, Daniela Maria Villadsen, Jørgen Werner, Sebastian Woller, Øyvind Grønland Zatelli, Maicon Rafael Department of Informatics Clausthal University of Technology Julius-Albert-Str. 4 38678 Clausthal-Zellerfeld Germany Dept. of Computer Science Sun Yat-sen University Guangzhou 510006 China Algorithms Logic and Graphs Section Department of Applied Mathematics and Computer Science Technical University of Denmark Matematiktorvet DK-2800 Kongens Lyngby Denmark Brazil Distributed Artificial Intelligence Laboratory Technische Universität Berlin Germany Department of Automation and Systems Engineering Federal University of Santa Catarina CP 476 88040-900 Florianópolis - SC Brazil

ISBN: (纸本)9783642453427

Five teams participated in the Multi-Agent Programming Contest in 2013: All of them gained experience in 2012 already. In order to better understand which paradigms they used, which techniques they considered important and how much work they invested, the organisers of the contest compiled together a detailed list of questions (circa 50). This paper collects all answers to these questions as given by the teams. © 2013 Springer-Verlag.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Using semantics in the selection mechanism in Genetic Programming: A simple method for promoting semantic diversity

Using semantics in the selection mechanism in Genetic Progra...

引用

Congress on Evolutionary Computation

作者： Edgar Galván-López Brendan Cody-Kenny Leonardo Trujillo Ahmed Kattan Distributed Systems Group School of Computer Science and Statistics Trinity College Dublin Ireland Doctorado en Ciencias de la Ingeniería Instituto Tecnológico de Tijuana Mexico AI Real-World Applications Lab Computer Science Department UQU Saudi Arabia

ISBN: (纸本)9781479904532

Research on semantics in Genetic Programming (GP) has increased over the last number of years. Results in this area clearly indicate that its use in GP considerably increases performance. Many of these semantic-based approaches rely on a trial-and-error method that attempts to find offspring that are semantically different from their parents over a number of trials using the crossover operator (crossover-semantics based - CSB). This, in consequence, has a major drawback: these methods could evaluate thousands of nodes, resulting in paying a high computational cost, while attempting to improve performance by promoting semantic diversity. In this work, we propose a simple and computationally inexpensive method, named semantics in selection, that eliminates the computational cost observed in CSB approaches. We tested this approach in 14 GP problems, including continuous- and discrete-valued fitness functions, and compared it against a traditional GP and a CSB approach. Our results are equivalent, and in some cases, superior than those found by the CSB approach, without the necessity of using a “brute force” mechanism.

关键词： Semantics Sociology Statistics Vectors Genetic programming Computational efficiency Context

来源：评论

学校读者我要写书评

暂无评论

POSTER: Towards measuring warning readability

POSTER: Towards measuring warning readability

引用

2012 ACM Conference on computer and Communications Security, CCS 2012

作者： Harbach, Marian Fahl, Sascha Muders, Thomas Smith, Matthew Distributed Systems and Security Group Department of Computer Science Leibniz Universität Hannover Germany

ISBN: (纸本)9781450316507

Security systems frequently rely on warning messages to convey important information, especially when a machine is not able to assess a situation automatically. For a long time, researchers have investigated the effects of warning messages to optimise their reception by a user. Design guidelines and best practises help the developer or interaction designer to adequately channel urgent information. In this poster, we investigate the application of readability measures to assess the difficulty of the descriptive text in warning messages. Adapting such a measure to fit the needs of warning message design allows objective feedback on the quality of a warning's descriptive text. An automated process will be able to assist software developers and designers in creating more readable and hence more understandable security warning messages. We present an initial exploration of the use of readability measures on the descriptive text of warning messages. Existing measures were evaluated on warning messages extracted from current browsers using an experimental study with 15 undergrad students. While our data did not yield conclusive results yet, we argue that readability measures can provide valuable assistance when implementing security systems. Copyright © 2012 ACM.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

Goal delegation without goals: BDI agents in harmony with OCMAS principles

Goal delegation without goals: BDI agents in harmony with OC...

引用

10th German Conference on Multiagent System Technologies, MATES 2012

作者： Pokahr, Alexander Braubach, Lars Distributed Systems and Information Systems Computer Science Department University of Hamburg Vogt-Kölln-Str. 30 22527 Hamburg Germany

ISBN: (纸本)9783642336898

The BDI model is concerned with the rational action of an individual agent. At the multi-agent layer especially coordination among agents is an important factor that determines how overall system goals can be accomplished. Thus, from a software engineering perspective it is desirable to extend the BDI programming model to the multi-agent layer and make BDI concepts also useable for coordination among agents. A severe problem with existing approaches that tried to follow this path e.g. by proposing a BDI teamwork model is that they violate the OCMAS principles stating that no assumptions on agent architectures should be made on the multi-agent level. If OCMAS principles are violated the kinds of agents that can participate in coordination is limited ab initio to a specific sort such as BDI. In this paper we propose a new goal delegation mechanism that allows for both. On the one hand, BDI agents can delegate their normal goals to other agents and on the other hand these goals are not represented explicitly on the multi-agent level so that also non-BDI agents can act as receivers and help accomplishing a goal. © 2012 Springer-Verlag.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A localized algorithm based on minimum cost arborescences for the MECBS problem with asymmetric edge costs

A localized algorithm based on minimum cost arborescences fo...

引用

3rd International ICST Conference on Ad Hoc Networks, ADHOCNETS 2011

作者： Barboza, Frederico Assis, Flávio LaSiD - Distributed Systems Laboratory DCC - Department of Computer Science UFBA - Federal University of Bahia Salvador Bahia Brazil

ISBN: (纸本)9783642290954

In this paper we describe a (distributed) localized approximation algorithm for the MECBS (Minimum Energy Consumption Broadcast Subgraph) problem with asymmetric edge costs, called LMCA (Localized algorithm for energy-efficient broadcast based on Local Minimum Cost Arborescences). Given a directed weighted graph G = (V, E) with edge weight function w and a source node s, the MECBS problem consists of finding a range assignment to V such that the induced graph contains a spanning directed tree rooted at s with minimized cost. This problem can be efficiently solved for some specific cases, but it is NP-hard in the general case. To the best of our knowledge, LMCA is the first localized algorithm to the MECBS problem with asymmetric edge costs (without restricting the way how edge costs might be asymmetric). We compared LMCA with blind flooding and with two alternative solutions we designed for the problem, LMCP and LBIPAsym (a variation of LBIP for the case of asymmetric edge costs). In our experiments, LMCA outperformed these algorithms. We additionally present and evaluate two slight variations of LMCA, called LMCAc and LMCAfl. © 2012 ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：