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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance gaps between OpenMP and OpenCL for multi-core CPUs

Performance gaps between OpenMP and OpenCL for multi-core CP...

引用

41st International Conference on parallel Processing Workshops, ICPPW 2012

作者： Shen, Jie Fang, Jianbin Sips, Henk Varbanescu, Ana Lucia Parallel and Distributed Systems Group Delft University of Technology Netherlands Department of Computer Systems VU University Amsterdam Netherlands

ISBN: (纸本)9780769547954

OpenCL and OpenMP are the most commonly used programming models for multi-core processors. They are also fundamentally different in their approach to parallelization. In this paper, we focus on comparing the performance of OpenCL and OpenMP. We select three applications from the Rodinia benchmark suite (which provides equivalent OpenMP and OpenCL implementations), and carry out experiments with different datasets on three multi-core platforms. We see that the incorrect usage of the multi-core CPUs, the inherent OpenCL fine-grained parallelism, and the immature OpenCL compilers are the main reasons that lead to the OpenCL poorer performance. After tuning the OpenCL versions to be more CPU-friendly, we show that OpenCL either outperforms or achieves similar performance in more than 80% of the cases. Therefore, we believe that OpenCL is a good alternative for multi-core CPU programming. © 2012 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Locality in continuous fitness-valued cases and genetic programming difficulty

Advances in Intelligent Systems and Computing

引用

Advances in Intelligent systems and Computing 2013年 175 ADVANCES卷 41-56页

作者： Galvan, Edgar Trujillo, Leonardo McDermott, James Kattan, Ahmed Distributed Systems Group School of Computer Science and Statistics Trinity College Dublin Ireland Departamento de Ingeniería Eléctrica y Electrónica Instituto Tecnológico de Tijuana Tijuana BC Mexico EvoDesignOpt MIT CSAIL Cambridge MA United States Computer Science Department Loughborough University Loughborough United Kingdom

ISBN: (纸本)9783642315183

It is commonly accepted that a mapping is local if it preserves neighbourhood. In Evolutionary Computation, locality is generally described as the property that neighbouring genotypes correspond to neighbouring phenotypes. Locality has been classified in one of two categories: high and low locality. It is said that a representation has high locality if most genotypic neighbours correspond to phenotypic neighbours. The opposite is true for a representation that has low locality. It is argued that a representation with high locality performs better in evolutionary search compared to a representation that has low locality. In this work, we explore, for the first time, a study on Genetic Programming (GP) locality in continuous fitnessvalued cases. For this, we extended the original definition of locality (first defined and used in Genetic Algorithms using bitstrings) from genotype-phenotype mapping to the genotype-fitness mapping. Then, we defined three possible variants of locality in GP regarding neighbourhood. The experimental tests presented here use a set of symbolic regression problems, two different encoding and two different mutation operators. We show how locality can be studied in this type of scenarios (continuous fitness-valued cases) and that locality can successfully been used as a performance prediction tool. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Making cost-based query optimization asymmetry-aware

Making cost-based query optimization asymmetry-aware

引用

8th International Workshop on Data Management on New Hardware, DaMoN 2012 - In Conjunction with ACM SIGMOD/PODS Conference

作者： Bausch, Daniel Petrov, Ilia Buchmann, Alejandro Technische Universität Darmstadt Department of Computer Science Databases and Distributed Systems Group Hochschulstraße 10 64289 Darmstadt Germany

ISBN: (纸本)9781450314459

The architecture and algorithms of database systems have been built around the properties of existing hardware technologies. Many such elementary design assumptions are 20 - 30 years old. Over the last five years we witness multiple new I/O technologies (e.g. Flash SSDs, NV-Memories) that have the potential of changing these assumptions. Some of the key technological differences to traditional spinning disk storage are: (i) asymmetric read/write performance;(ii) low latencies;(iii) fast random reads;(iv) endurance issues. Cost functions used by traditional database query optimizers are directly influenced by these properties. Most cost functions estimate the cost of algorithms based on metrics such as sequential and random I/O costs besides CPU and memory consumption. These do not account for asymmetry or high random read and inferior random write performance, which represents a significant mismatch. In the present paper we show a new asymmetry-aware cost model for Flash SSDs with adapted cost functions for algorithms such as external sort, hash-join, sequential scan, index scan, etc. It has been implemented in PostgreSQL and tested with TPC-H. Additionally we describe a tool that automatically finds good settings for the base coefficients of cost models. After tuning the configuration of both the original and the asymmetry-aware cost model with that tool, the optimizer with the asymmetry-aware cost model selects faster execution plans for 14 out of the 22 TPC-H queries (the rest being the same or negligibly worse). We achieve an overall performance improvement of 48% on SSD. © 2012 ACM.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Performance Gaps between OpenMP and OpenCL for Multi-core CPUs

Performance Gaps between OpenMP and OpenCL for Multi-core CP...

引用

International Conference on parallel Processing Workshops (ICPPW)

作者： Jie Shen Jianbin Fang Henk Sips Ana Lucia Varbanescu Parallel and Distributed Systems Group Delft University of Technology Netherlands Department of Computer Systems VU University Amsterdam Netherlands

关键词： Kernel Programming parallel processing Performance evaluation Arrays Hardware

来源：评论

学校读者我要写书评

暂无评论

Interconnectedness of complex systems of internet of things through social network analysis for disaster management

Interconnectedness of complex systems of internet of things ...

引用

2012 4th International Conference on Intelligent Networking and Collaborative systems, INCoS 2012

作者： Zelenkauskaite, Asta Bessis, Nik Sotiriadis, Stelios Asimakopoulou, Eleana Department of Telecommunications Indiana University Bloomington IN United States Distributed and Intelligent Systems Research Group University of Derby Derby United Kingdom Department of Computer Science and Technology University of Bedfordshire Luton United Kingdom

ISBN: (纸本)9780769548081

This visionary paper presents the Internet of Things paradigm in terms of interdependent dynamic dimensions of objects and their properties. Given that in its current state Internet of Things (IoT) has been viewed as a paradigm based on hierarchical distribution of objects, evaluation of the dynamic nature of the hierarchical structures faces challenges in its evaluation and analysis. Within this in mind, our focus is on the area of complex social networks and the dynamic social network construction within the context of IoT. This is by highlighting and addressing the tagging issues of the objects to the real-world domain such as in disaster management, these are in relation to their hierarchies and interrelation within the context of social network analysis. Specifically, we suggest to investigate and deepen the understanding of the IoT paradigm through the application of social network analysis as a method for interlinking objects - and thus, propose ways in which IoT could be subsequently interlinked and analyzed through social network analysis approach - which provides possibilities for linking of the objects, while extends it into real-world domain. With this in mind, we present few applications and key characteristics of disaster management and the social networking analysis approach, as well as, foreseen benefits of its application in the IoT domain. © 2012 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Disaster management and profile modelling of IoT objects: Conceptual parameters for interlinked objects in relation to social network analysis

Disaster management and profile modelling of IoT objects: Co...

引用

2012 4th International Conference on Intelligent Networking and Collaborative systems, INCoS 2012

ISBN: (纸本)9780769548081

In recent years, the emergence of ubiquitous and pervasive computing suggests the radical transformation of the Internet to incorporate physical objects. The transformation suggests the enabling of a new form of communication and interaction style that incorporates people, their smart devices and their physical objects through the utilization of distributed sensors spread in the environment. In this study, we propose extending Internet of Things (IoT) by modelling an IoT enabled smart environment as a whole, representing the dynamic communication and interaction among all objects (users, devices, physical objects and sensors). This is by recognizing and categorizing objects' properties in the form of a generic profile. We also reflect this in a disaster management context. That is by identifying which of the parameters of these smart objects are fixed, constant and persistent over time and which parameters are actually change over time, i.e. those characterized by their transient and dynamic nature. Thus, through the process of communication and interaction of the objects, we analyze parameters by demonstrating their static and/or dynamic properties as well as those supporting context-aware variables which are evident in disaster scenarios. To achieve these goals, we designed the persistent or temporal relationships to encompass internal information of smart-objects, along with their characteristics that actually depict their capacity to offer services to users by properties' matchmaking. The interlinked relationships represent a 'social network' providing a terrain of flexible scenarios that would lead to tailored parameters to fit user preferences. To enable communication among them in a dynamic dimension we utilized a distributed topology in which communication could occur indirectly between objects. Finally, we detailed a generic - but equally applicable for disaster management - case scenario in which we used graph theory to demonstrate how embedded intelligenc

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：