Volume
OASIcs, Volume 43
2014 Imperial College Computing Student Workshop
- Part of: Series: Open Access Series in Informatics (OASIcs)
Publication Details
- published at: 2014-10-08
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-76-7
- DBLP: db/conf/iccsw/iccsw2014
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 43, ICCSW'14, Complete Volume
Abstract
OASIcs, Volume 43, ICCSW'14, Complete Volume
Cite as
2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@Proceedings{neykova_et_al:OASIcs.ICCSW.2014,
title = {{OASIcs, Volume 43, ICCSW'14, Complete Volume}},
booktitle = {2014 Imperial College Computing Student Workshop},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014},
URN = {urn:nbn:de:0030-drops-47809},
doi = {10.4230/OASIcs.ICCSW.2014},
annote = {Keywords: Languages and Compilers, Parallel Architectures, Applicative (Functional) Programming, Parallel Programming, Requirements/Specifications Software/Program Verification, Concurrent Programming, Complexity Measures and Classes, Specifying and Verifying and Reasoning about Programs,}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Workshop Organization
Abstract
Frontmatter, Table of Contents, Preface, Workshop Organization
Cite as
2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. i-xiii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{neykova_et_al:OASIcs.ICCSW.2014.i,
author = {Neykova, Rumyana and Ng, Nicholas},
title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {i--xiii},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.i},
URN = {urn:nbn:de:0030-drops-47647},
doi = {10.4230/OASIcs.ICCSW.2014.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization}
}
Document
From academia to industry: The story of Google DeepMind
Abstract
Shane Legg left academia to cofound DeepMind Technologies in 2010, along with Demis Hassabis and Mustafa Suleyman. Their vision was to bring together cutting edge machine learning and systems neuroscience in order to create artificial agents with general intelligence. Following investments from a number of famous technology entrepreneurs, including Peter Thiel and Elon Musk, they assembled a team of world class researchers with backgrounds in systems neuroscience, deep learning, reinforcement learning and Bayesian statistics. In early 2014 DeepMind made international business headlines after it was acquired by Google. In this talk Shane covers some of the history behind DeepMind, his experience making the transition from academia to industry, how Google DeepMind performs research and finally some demos of the artificial agents that are under development.
Cite as
Shane Legg. From academia to industry: The story of Google DeepMind. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{legg:OASIcs.ICCSW.2014.1,
author = {Legg, Shane},
title = {{From academia to industry: The story of Google DeepMind}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {1--1},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.1},
URN = {urn:nbn:de:0030-drops-47650},
doi = {10.4230/OASIcs.ICCSW.2014.1},
annote = {Keywords: machine learning}
}
Document
You and Your Research and the Elements of Style
Abstract
This talk surveys advice from experts, including Richard Hamming, William Strunk, E. B. White, Donald Knuth, and others, on how to conduct your research and communicate your results.
Cite as
Philip Wadler. You and Your Research and the Elements of Style. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, p. 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{wadler:OASIcs.ICCSW.2014.2,
author = {Wadler, Philip},
title = {{You and Your Research and the Elements of Style}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {2--2},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.2},
URN = {urn:nbn:de:0030-drops-47669},
doi = {10.4230/OASIcs.ICCSW.2014.2},
annote = {Keywords: research, communication}
}
Document
History-Based Adaptive Work Distribution
Abstract
Exploiting parallelism of increasingly heterogeneous parallel architectures is challenging due to the complexity of parallelism management. To achieve high performance portability whilst preserving high productivity, high-level approaches to parallel programming delegate parallelism management, such as partitioning and work distribution, to the compiler and the run-time system. Random work stealing proved efficient for well-structured workloads, but neglects potentially useful context information that can be obtained through static analysis or monitoring at run time and used to improve load balancing, especially for irregular applications with highly varying thread granularity and thread creation patterns. We investigate the effectiveness of an adaptive work distribution scheme to improve load balancing for an extension of Haskell which provides a deterministic parallel programming model and supports both shared-memory and distributed-memory architectures. This scheme uses a less random work stealing that takes into account information on past stealing successes and failures. We quantify run time performance, communication overhead, and stealing success of four divide-and-conquer and data parallel applications for three different update intervals on a commodity 64-core Beowulf cluster of multi-cores.
Cite as
Evgenij Belikov. History-Based Adaptive Work Distribution. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 3-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{belikov:OASIcs.ICCSW.2014.3,
author = {Belikov, Evgenij},
title = {{History-Based Adaptive Work Distribution}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {3--10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.3},
URN = {urn:nbn:de:0030-drops-47671},
doi = {10.4230/OASIcs.ICCSW.2014.3},
annote = {Keywords: Adaptive Load Balancing, Work Stealing, Work Pushing, High-Level Parallel Programming, Context-Awareness}
}
Document
Everything you know is wrong: The amazing time traveling CPU, and other horrors of concurrency
Abstract
In this paper, we shall explore weak memory models, their insidious effects, and how it could happen to you! It shall explained how and why both compilers and CPUs rewrite your program to make it faster, the inevitable fallout of this, and what you can do to protect your code. We
shall craft a lock, building from a naïve and broken implementation up to a safe and correct form, and study the underlying model that requires these modifications as we go.
Cite as
Ethel Bardsley. Everything you know is wrong: The amazing time traveling CPU, and other horrors of concurrency. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 11-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{bardsley:OASIcs.ICCSW.2014.11,
author = {Bardsley, Ethel},
title = {{Everything you know is wrong: The amazing time traveling CPU, and other horrors of concurrency}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {11--18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.11},
URN = {urn:nbn:de:0030-drops-47688},
doi = {10.4230/OASIcs.ICCSW.2014.11},
annote = {Keywords: Concurrency, weak memory, compilers}
}
Document
Identifying and inferring objects from textual descriptions of scenes from books
Abstract
Fiction authors rarely provide detailed descriptions of scenes, preferring the reader to fill in the details using their imagination. Therefore, to perform detailed text-to-scene conversion from books, we need to not only identify explicit objects but also infer implicit objects. In this paper, we describe an approach to inferring objects using Wikipedia and WordNet. In our experiments, we are able to infer implicit objects such as monitor and computer by identifying explicit objects such as keyboard.
Cite as
Andrew Cropper. Identifying and inferring objects from textual descriptions of scenes from books. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 19-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{cropper:OASIcs.ICCSW.2014.19,
author = {Cropper, Andrew},
title = {{Identifying and inferring objects from textual descriptions of scenes from books}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {19--26},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.19},
URN = {urn:nbn:de:0030-drops-47690},
doi = {10.4230/OASIcs.ICCSW.2014.19},
annote = {Keywords: Text-to-Scene Conversion, Natural Language Processing, Artificial Intelligence}
}
Document
Predicate Abstraction in Program Verification: Survey and Current Trends
Abstract
A popular approach to verification of software system correctness is model checking. To achieve scalability needed for large systems, model checking has to be augmented with abstraction. In this paper, we provide an overview of selected techniques of program verification based on predicate abstraction. We focus on techniques that advanced the state-of-the-art in a significant way, including counterexample-guided abstraction refinement, lazy abstraction, and current trends in the form of extensions targeting, for example, data structures and multi-threading. We discuss limitations of these techniques and present our plans for addressing some of them.
Cite as
Jakub Daniel and Pavel Parízek. Predicate Abstraction in Program Verification: Survey and Current Trends. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 27-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{daniel_et_al:OASIcs.ICCSW.2014.27,
author = {Daniel, Jakub and Par{\'\i}zek, Pavel},
title = {{Predicate Abstraction in Program Verification: Survey and Current Trends}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {27--35},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.27},
URN = {urn:nbn:de:0030-drops-47706},
doi = {10.4230/OASIcs.ICCSW.2014.27},
annote = {Keywords: program verification, model checking, predicate abstraction, refinement}
}
Document
Automatic Verification of Data Race Freedom in Device Drivers
Abstract
Device drivers are notoriously hard to develop and even harder to debug. They are typically prone to many serious issues such as data races. In this paper, we present static pair-wise lock set analysis, a novel sound verification technique for proving data race freedom in device drivers. Our approach not only avoids reasoning about thread interleavings, but also allows the reuse of existing successful sequential verification techniques.
Cite as
Pantazis Deligiannis and Alastair F. Donaldson. Automatic Verification of Data Race Freedom in Device Drivers. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 36-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{deligiannis_et_al:OASIcs.ICCSW.2014.36,
author = {Deligiannis, Pantazis and Donaldson, Alastair F.},
title = {{Automatic Verification of Data Race Freedom in Device Drivers}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {36--39},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.36},
URN = {urn:nbn:de:0030-drops-47715},
doi = {10.4230/OASIcs.ICCSW.2014.36},
annote = {Keywords: Device Drivers, Verification, Concurrency, Data Races}
}
Document
A survey of modelling and simulation software frameworks using Discrete Event System Specification
Abstract
Discrete Event System Specification is an extension of the Moore machine formalism which is used for modelling and analyzing general systems. This hierarchical and modular formalism is time event based and is able to represent any continuous, discrete or combined discrete and
continuous systems. Since its introduction by B.P. Zeigler at the beginning of the eighties, most general modelling formalisms able to represent dynamic systems have been subsumed by DEVS. Meanwhile, the modelling and simulation (M&S) community has introduced various software
frameworks supporting DEVS-based simulation analysis capability. DEVS has been used in many application domains and this paper will present a technical survey of the major DEVS implementations and software frameworks. We introduce a set of criteria in order to highlight
the main features of each software tool, then we propose a table and discussion enabling a fast comparison of the presented frameworks.
Cite as
Romain Franceschini, Paul-Antoine Bisgambiglia, Luc Touraille, Paul Bisgambiglia, and David Hill. A survey of modelling and simulation software frameworks using Discrete Event System Specification. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 40-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{franceschini_et_al:OASIcs.ICCSW.2014.40,
author = {Franceschini, Romain and Bisgambiglia, Paul-Antoine and Touraille, Luc and Bisgambiglia, Paul and Hill, David},
title = {{A survey of modelling and simulation software frameworks using Discrete Event System Specification}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {40--49},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.40},
URN = {urn:nbn:de:0030-drops-47721},
doi = {10.4230/OASIcs.ICCSW.2014.40},
annote = {Keywords: DEVS, Framework, Survey, Modelling, Simulation}
}
Document
Calculating communication costs with Sessions Types and Sizes
Abstract
We present a small object-oriented language with communication primitives. The language allows the assignment of binary session types to communication channels in order to govern the interaction between different objects and to statically calculate communication costs. Class declarations are annotated with size information in order to determine the cost of sending and receiving objects. This paper describes our first steps in the creation of a session-based, object-oriented
language for communication optimization purposes.
Cite as
Juliana Franco, Sophia Drossopoulou, and Nobuko Yoshida. Calculating communication costs with Sessions Types and Sizes. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 50-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{franco_et_al:OASIcs.ICCSW.2014.50,
author = {Franco, Juliana and Drossopoulou, Sophia and Yoshida, Nobuko},
title = {{Calculating communication costs with Sessions Types and Sizes}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {50--57},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.50},
URN = {urn:nbn:de:0030-drops-47739},
doi = {10.4230/OASIcs.ICCSW.2014.50},
annote = {Keywords: Session types, communication, object-oriented, multicore}
}
Document
Symbolic Execution as DPLL Modulo Theories
Abstract
We show how Symbolic Execution can be understood as a variant of the DPLL(T ) algorithm, which is the dominant technique for the Satisfiability Modulo Theories (SMT) problem. In other words, Symbolic Executors are SMT solvers. This view enables us to use an SMT solver, with the ability of generating all models with respect to a set of Boolean atoms, to explore all symbolic paths of a program. This results in a more lightweight approach for Symbolic Execution.
Cite as
Quoc-Sang Phan. Symbolic Execution as DPLL Modulo Theories. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 58-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{phan:OASIcs.ICCSW.2014.58,
author = {Phan, Quoc-Sang},
title = {{Symbolic Execution as DPLL Modulo Theories}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {58--65},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.58},
URN = {urn:nbn:de:0030-drops-47746},
doi = {10.4230/OASIcs.ICCSW.2014.58},
annote = {Keywords: Symbolic Execution, Satisfiability Modulo Theories}
}
Document
Towards a Programming Paradigm for Artificial Intelligence Applications Based On Simulation
Abstract
In this work, we propose to use simulation as a key principle for programming AI applications. The approach aims at integrating techniques from different areas of AI and is based on the idea that simulated entities may freely exchange data and behavioural patterns. We introduce basic notions of a simulation-based programming paradigm and show how it can be used for implementing different scenarios.
Cite as
Jörg Pührer. Towards a Programming Paradigm for Artificial Intelligence Applications Based On Simulation. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 66-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{puhrer:OASIcs.ICCSW.2014.66,
author = {P\"{u}hrer, J\"{o}rg},
title = {{Towards a Programming Paradigm for Artificial Intelligence Applications Based On Simulation}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {66--73},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.66},
URN = {urn:nbn:de:0030-drops-47757},
doi = {10.4230/OASIcs.ICCSW.2014.66},
annote = {Keywords: Artificial Intelligence, Simulation, Programming Paradigm}
}
Document
Defining and Evaluating Learner Experience for Social Adaptive E-Learning
Abstract
Social adaptive e-learning combines, threads and balances the amount of social and adaptive features for e-learning in order to achieve high-quality Learner eXperience (LX). Evaluating a social adaptive e-learning system is a difficult task due to its complexity. It is crucial to ensure that appropriate evaluation methods and measures are used. A User-centric approach serves the empirical system evaluation using subjective user feedback on satisfaction and productivity as well as the quality of work and support, so as to verify the quality of product, detect problems, and support decisions. This paper proposes a learner-centric evaluation framework, which applies a user-centric approach, aiming to evaluate LX in social adaptive e-learning from the end-user (learner) point of view, taking into consideration both social and adaptive perspectives.
Cite as
Lei Shi. Defining and Evaluating Learner Experience for Social Adaptive E-Learning. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 74-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{shi:OASIcs.ICCSW.2014.74,
author = {Shi, Lei},
title = {{Defining and Evaluating Learner Experience for Social Adaptive E-Learning}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {74--82},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.74},
URN = {urn:nbn:de:0030-drops-47765},
doi = {10.4230/OASIcs.ICCSW.2014.74},
annote = {Keywords: Social adaptive e-learning, user-centric evaluation, learner experience}
}
Document
On Recent Advances in Key Derivation via the Leftover Hash Lemma
Abstract
Barak et al. showed how to significantly reduce the entropy loss, which is necessary in general, in the use of the Leftover Hash Lemma (LHL) to derive a secure key for many important cryptographic applications. If one wants this key to be secure against any additional short leakage, then the min-entropy of the source used with the LHL must be big enough. Recently, Berens came up with a notion of collision entropy that is much weaker than min-entropy and allows proving a version of the LHL with leakage robustness but without any entropy saving. We combine both approaches and extend the results of Barak et. al to the collision entropy. Summarizing, we obtain a version of the LHL with optimized entropy loss, leakage robustness and weak entropy requirements.
Cite as
Maciej Skorski. On Recent Advances in Key Derivation via the Leftover Hash Lemma. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 83-90, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{skorski:OASIcs.ICCSW.2014.83,
author = {Skorski, Maciej},
title = {{On Recent Advances in Key Derivation via the Leftover Hash Lemma}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {83--90},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.83},
URN = {urn:nbn:de:0030-drops-47783},
doi = {10.4230/OASIcs.ICCSW.2014.83},
annote = {Keywords: Key derivation, Leftover Hash Lemma, leakage robustness}
}
Document
Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games
Abstract
In this work we investigate infinite structures. We discuss the importance, meaning and temptation of the axiom of choice and equivalent formulations with respect to graph theory, abstract argumentation and dialogue games. Emphasis is put on maximal independent sets in graph
theory as well as preferred semantics in abstract argumentation.
Cite as
Christof Spanring. Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 91-98, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
Copy BibTex To Clipboard
@InProceedings{spanring:OASIcs.ICCSW.2014.91,
author = {Spanring, Christof},
title = {{Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games}},
booktitle = {2014 Imperial College Computing Student Workshop},
pages = {91--98},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-76-7},
ISSN = {2190-6807},
year = {2014},
volume = {43},
editor = {Neykova, Rumyana and Ng, Nicholas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.91},
URN = {urn:nbn:de:0030-drops-47776},
doi = {10.4230/OASIcs.ICCSW.2014.91},
annote = {Keywords: axiom of choice, graph theory, maximal independent sets, abstract argumentation, dialogue games}
}