Volume
OASIcs, Volume 49
2015 Imperial College Computing Student Workshop (ICCSW 2015)
- Part of: Series: Open Access Series in Informatics (OASIcs)
Publication Details
- published at: 2015-09-23
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-000-2
- DBLP: db/conf/iccsw/iccsw2015
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 49, ICCSW'15, Complete Volume
Abstract
OASIcs, Volume 49, ICCSW'15, Complete Volume
Cite as
2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@Proceedings{schulz_et_al:OASIcs.ICCSW.2015,
title = {{OASIcs, Volume 49, ICCSW'15, Complete Volume}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015},
URN = {urn:nbn:de:0030-drops-54871},
doi = {10.4230/OASIcs.ICCSW.2015},
annote = {Keywords: Introductory and Survey, Processor Architectures, Multiple Data Stream Architectures (Multiprocessors), Programming Techniques, Concurrent Programming, Software Engineering, Software/Program Verification, Programming Languages, Run-Time Environments,}
}
Document
Front Matter
Frontmatter, Table of Contents, Preface, Conference Organization, Supporters and Sponsors
Abstract
Frontmatter, Table of Contents, Preface, Conference Organization, Supporters and Sponsors
Cite as
2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. i-xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{schulz_et_al:OASIcs.ICCSW.2015.i,
author = {Schulz, Claudia and Liew, Daniel},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization, Supporters and Sponsors}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {i--xiv},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.i},
URN = {urn:nbn:de:0030-drops-54723},
doi = {10.4230/OASIcs.ICCSW.2015.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization, Supporters and Sponsors}
}
Document
Keynote Talk
Google and Open Source (Keynote Talk)
Abstract
In this talk Chris DiBona will review Google's use of open source projects and the history of prominent releases like Android, Chromium, Angular.js and some 3500 other projects (though not all of them will be surveyed!). Keeping such releases on track and efficient and, in some cases, retiring them has been his focus since he started at the company. He'll review the various ways Google supports the worldwide community of software developers that it has derived so much value from. Specifically for the students assembled, Mr. DiBona will also talk about the university oriented program "The Summer of Code" which is designed to lure students into open source projects and provide for them the real world mentorship they need to become open source committers themselves. A paid internship that lasts approximately 3 months during the summer months, The Summer of Code has introduced over 10,000 developers in 123 countries to open source software development and added over 30 million lines of code to open source projects that Google and the students use every day of their lives.
Cite as
Chris DiBona. Google and Open Source (Keynote Talk). In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{dibona:OASIcs.ICCSW.2015.1,
author = {DiBona, Chris},
title = {{Google and Open Source}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {1--1},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.1},
URN = {urn:nbn:de:0030-drops-54738},
doi = {10.4230/OASIcs.ICCSW.2015.1},
annote = {Keywords: Open Source}
}
Document
Keynote Talk
Going Beyond Fact-based Question Answering (Keynote Talk)
Abstract
To solve the AI problem, we need to develop systems that go beyond answering fact-based questions. Watson has been hugely successful at answering fact-based questions, but to solve hard AI tasks like passing science tests and understanding narratives, we need to go beyond simple facts. In this talk, I discuss how the systems I have most recently worked on have approached this problem. Watson for Healthcare answers Doctor’s Dilemma medical competition questions, and WatsonPaths answers medical test preparation questions. These systems have achieved some success, but there is still a lot more to be done. Based on my experiences working on these systems, I discuss what I think the priorities should be going forward. First, to deal with the richness of human knowledge, we need to move beyond propositional logic to predicate logic. Second, to deal with the real world, we need to represent and reason about events and time. Third, to find multiple solutions and keep them distinct from one another, we need to use declarative problem solving methods like answer set programming. As one example of a formalism that embodies these three things, I review the event calculus described in my book Commonsense Reasoning. This formalism is especially useful for the narrative understanding task.
Cite as
Erik T. Mueller. Going Beyond Fact-based Question Answering (Keynote Talk). In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, p. 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{mueller:OASIcs.ICCSW.2015.2,
author = {Mueller, Erik T.},
title = {{Going Beyond Fact-based Question Answering}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {2--2},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.2},
URN = {urn:nbn:de:0030-drops-54749},
doi = {10.4230/OASIcs.ICCSW.2015.2},
annote = {Keywords: Commonsense Reasoning}
}
Document
Language Run-time Systems: an Overview
Abstract
The proliferation of high-level programming languages with advanced language features and the need for portability across increasingly heterogeneous and hierarchical architectures require a sophisticated run-time system to manage program execution and available resources. Additional benefits include isolated execution of untrusted code and the potential for dynamic optimisation, among others. This paper provides a high-level overview of language run-time systems with a focus on execution models, support for concurrency and parallelism, memory management, and communication, whilst briefly mentioning synchronisation, monitoring, and adaptive policy control. Two alternative approaches to run-time system design are presented and several challenges for future research are outlined. References to both seminal and recent work are provided.
Cite as
Evgenij Belikov. Language Run-time Systems: an Overview. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 3-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{belikov:OASIcs.ICCSW.2015.3,
author = {Belikov, Evgenij},
title = {{Language Run-time Systems: an Overview}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {3--12},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.3},
URN = {urn:nbn:de:0030-drops-54753},
doi = {10.4230/OASIcs.ICCSW.2015.3},
annote = {Keywords: Run-time Systems, Virtual Machines, Adaptive Policy Control}
}
Document
Affective Computing to Enhance E-Learning in Segregated Societies
Abstract
According to UN Women, to build stronger economies, it is essential to empower women to participate fully in economic life across all sectors. Increasing women and girls’ education enhances their chances to participate in the labor market. In certain cultures, like in Saudi Arabia, women contribution to the public economy growth is very limited. According to the World Bank, less than 20 percent of the female population participate in the labor force. This low participation rate has many reasons. One of them, is the educational level and educational quality for females. Although Saudi Arabia has about thirty three universities, opportunities are still limited for women because of the restrictions of access put upon them. A mixture of local norms, traditions, social beliefs, and principles preventing women from receiving full benefits from the educational system. Gender segregation is one of the challenges that limits the women access for education. It causes a problem due to the shortage of female faculty throughout the country. To overcome this problem, male faculty are allowed to teach female students under certain regulations and following a certain method of education delivery and interaction. However, most of these methods lack face-to-face communication between the teacher and students, which lowers the interactivity level and, accordingly, the students' engagement, and increases the need for other alternatives. The e-learning model is one of high benefit for female students in such societies. Recognizing the students' engagement is not straightforward in the e-learning model. To measure the level of engagement, the learner's mood or emotions should be taken into consideration to help understanding and judging the level of engagement. This paper is to investigate the relationship between emotions and engagement in the e-learning environment, and how recognizing the learner's emotions and change the content delivery accordingly can affect the efficiency of the e-learning process. The proposed experiment alluded to herein should help to find ways to increase the engagement of the learners, hence, enhance the efficiency of the learning process and the quality of learning, which will increase the chances and opportunities for women in such societies to participate more effectively in the labor market.
Cite as
Khaled El-Abbasy, Anastassia Angelopoulou, and Tony Towell. Affective Computing to Enhance E-Learning in Segregated Societies. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 13-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{elabbasy_et_al:OASIcs.ICCSW.2015.13,
author = {El-Abbasy, Khaled and Angelopoulou, Anastassia and Towell, Tony},
title = {{Affective Computing to Enhance E-Learning in Segregated Societies}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {13--20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.13},
URN = {urn:nbn:de:0030-drops-54763},
doi = {10.4230/OASIcs.ICCSW.2015.13},
annote = {Keywords: Affective computing, E-learning, Women Education}
}
Document
Mining Scientific Articles Powered by Machine Learning Techniques
Abstract
Literature review is one of the most important phases of research. Scientists must identify the gaps and challenges about certain area and the scientific literature, as a result of the accumulation of knowledge, should provide enough information. The problem is where to find the best and most important articles that guarantees to ascertain the state of the art on that specific domain. A feasible literature review consists on locating, appraising, and synthesising the best empirical evidences in the pool of available publications, guided by one or more research questions. Nevertheless, it is not assured that searching interesting articles in electronic databases will retrieve the most relevant content. Indeed, the existent search engines try to recommend articles by only looking for the occurrences of given keywords. In fact, the relevance of a paper should depend on many other factors as adequacy to the theme, specific tools used or even the test strategy, making automatic recommendation of articles a challenging problem. Our approach allows researchers to browse huge article collections and quickly find the appropriate publications of particular interest by using machine learning techniques. The proposed solution automatically classifies and prioritises the relevance of scientific papers. Using previous samples manually classified by domain experts, we apply a Naive Bayes Classifier to get predicted articles from real world journal repositories such as IEEE Xplore or ACM Digital. Results suggest that our model can substantially recommend, classify and rank the most relevant articles of a particular scientific field of interest. In our experiments, we achieved 98.22% of accuracy in recommending articles that are present in an expert classification list, indicating a good prediction of relevance. The recommended papers worth, at least, the reading. We envisage to expand our model in order to accept user’s filters and other inputs to improve predictions.
Cite as
Carlos A. S. J. Gulo, Thiago R. P. M. Rúbio, Shazia Tabassum, and Simone G. D. Prado. Mining Scientific Articles Powered by Machine Learning Techniques. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 21-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{gulo_et_al:OASIcs.ICCSW.2015.21,
author = {Gulo, Carlos A. S. J. and R\'{u}bio, Thiago R. P. M. and Tabassum, Shazia and Prado, Simone G. D.},
title = {{Mining Scientific Articles Powered by Machine Learning Techniques}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {21--28},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.21},
URN = {urn:nbn:de:0030-drops-54776},
doi = {10.4230/OASIcs.ICCSW.2015.21},
annote = {Keywords: Machine Learning, Text Categorisation, Text Classification, Ranking, Systematic Literature Review}
}
Document
Computing Argumentation with Matrices
Abstract
Abstract argumentation frameworks with finitely many arguments can be presented in matrix form. For this reason, the strengths and weaknesses of matrix operations are migrated from a mathematical representation to a computer science interpretation. We present matrix operation algorithms that can answer whether a given set of arguments is part of an argumentation extension.
Cite as
Evgenios Hadjisoteriou. Computing Argumentation with Matrices. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 29-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{hadjisoteriou:OASIcs.ICCSW.2015.29,
author = {Hadjisoteriou, Evgenios},
title = {{Computing Argumentation with Matrices}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {29--36},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.29},
URN = {urn:nbn:de:0030-drops-54783},
doi = {10.4230/OASIcs.ICCSW.2015.29},
annote = {Keywords: Argumentation, Semantics, Extension, Algorithm, Matrix}
}
Document
A Survey of CUDA-based Multidimensional Scaling on GPU Architecture
Abstract
The need to analyze large amounts of multivariate data raises the fundamental problem of dimensionality reduction which is defined as a process of mapping data from high-dimensional space into low-dimensional. One of the most popular methods for handling this problem is multidimensional scaling. Due to the technological advances, the dimensionality of the input data as well as the amount of processed data is increasing steadily but the requirement of processing these data within a reasonable time frame still remains an open problem. Recent development in graphics hardware allows to perform generic parallel computations on powerful hardware and provides an opportunity to solve many time-constrained problems in both graphical and non-graphical domain. The purpose of this survey is to describe and analyze recent implementations of multidimensional scaling algorithms on graphics processing units and present the applicability of these algorithms on such architectures based on the experimental results which show a decrease of execution time for multi-level approaches.
Cite as
Hasmik Osipyan, Martin Kruliš, and Stéphane Marchand-Maillet. A Survey of CUDA-based Multidimensional Scaling on GPU Architecture. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 37-45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{osipyan_et_al:OASIcs.ICCSW.2015.37,
author = {Osipyan, Hasmik and Kruli\v{s}, Martin and Marchand-Maillet, St\'{e}phane},
title = {{A Survey of CUDA-based Multidimensional Scaling on GPU Architecture}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {37--45},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.37},
URN = {urn:nbn:de:0030-drops-54798},
doi = {10.4230/OASIcs.ICCSW.2015.37},
annote = {Keywords: Dimensionality Reduction, Pattern Recognition, Graphics Hardware, Compute Unified Device Architecture, Parallel Programming}
}
Document
Modelling SO-CAL in an Inheritance-based Sentiment Analysis Framework
Abstract
Sentiment analysis is the computational study of people's opinions, as expressed in text. This is an active area of research in Natural Language Processing with many applications in social media. There are two main approaches to sentiment analysis: machine learning and lexicon-based. The machine learning approach uses statistical modelling techniques, whereas the lexicon-based approach uses 'sentiment lexicons' containing explicit sentiment values for individual words to calculate sentiment scores for documents. In this paper we present a novel method for modelling lexicon-based sentiment analysis using a lexical inheritance network. Further, we present a case study of applying inheritance-based modelling to an existing sentiment analysis system as proof of concept, before developing the ideas further in future work.
Cite as
F. Sharmila Satthar. Modelling SO-CAL in an Inheritance-based Sentiment Analysis Framework. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 46-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{satthar:OASIcs.ICCSW.2015.46,
author = {Satthar, F. Sharmila},
title = {{Modelling SO-CAL in an Inheritance-based Sentiment Analysis Framework}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {46--53},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.46},
URN = {urn:nbn:de:0030-drops-54804},
doi = {10.4230/OASIcs.ICCSW.2015.46},
annote = {Keywords: Sentiment analysis, NLP, Inheritance network, Lexicon-based}
}
Document
Interactive 3D Reconstruction: New Opportunities for Getting CAD-ready Models
Abstract
A multitude of image-based 3D reconstruction and modeling techniques exist, which have achieved significant success in recent years. However, these techniques still lack certain abilities. For example, current 3D reconstruction techniques cannot decompose an object into its individual subparts. Thus, a printed model will consist of one single monolithic piece, which does not allow composing or decomposing parts, does not allow movable or flexible parts, and does not allow manufacturing the model from multiple different materials like wood, metal, or plastic. I reviewed the work in the research area of 3D reconstruction and provide an analysis of neglected research objectives and current drawbacks. Furthermore, I propose a mock-up of an interactive tool as a guideline for future research which describes a possible architecture, user interfaces, and processing pipeline, to overcome existing drawbacks of 3D reconstruction techniques.
Cite as
Julius Schöning. Interactive 3D Reconstruction: New Opportunities for Getting CAD-ready Models. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 54-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{schoning:OASIcs.ICCSW.2015.54,
author = {Sch\"{o}ning, Julius},
title = {{Interactive 3D Reconstruction: New Opportunities for Getting CAD-ready Models}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {54--61},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.54},
URN = {urn:nbn:de:0030-drops-54814},
doi = {10.4230/OASIcs.ICCSW.2015.54},
annote = {Keywords: 3D Reconstruction, 3D Modeling, Interactive Reconstruction, CAD-ready}
}
Document
Representing Temporal Patterns in Computer-Interpretable Clinical Guidelines
Abstract
Computer-Interpretable Guidelines (CIGs) as machine-readable versions of clinical protocols have to provide appropriate constructs for the representation of different aspects of medical knowledge, namely administrative information, workflows of procedures, clinical constraints and temporal constraints. This work focuses on the latter, by aiming to develop a comprehensive representation of temporal constraints for machine readable formats of clinical protocols and provide a proper execution engine that deals with different time patterns and constraints placed on them. A model for the representation of time is presented for the CompGuide ontology in Ontology Web language (OWL) along with a comparison with the available formalisms in this field.
Cite as
António Silva, Tiago Oliveira, Paulo Novais, and José Neves. Representing Temporal Patterns in Computer-Interpretable Clinical Guidelines. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 62-69, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{silva_et_al:OASIcs.ICCSW.2015.62,
author = {Silva, Ant\'{o}nio and Oliveira, Tiago and Novais, Paulo and Neves, Jos\'{e}},
title = {{Representing Temporal Patterns in Computer-Interpretable Clinical Guidelines}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {62--69},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.62},
URN = {urn:nbn:de:0030-drops-54827},
doi = {10.4230/OASIcs.ICCSW.2015.62},
annote = {Keywords: Computer-Interpretable Guidelines, Temporal Constraints, Clinical Decision Support, Ontologies}
}
Document
Hunt for the Collapse of Semantics in Infinite Abstract Argumentation Frameworks
Abstract
In this work we discuss examples of infinite abstract argumentation frameworks (AFs). Our focus is mainly on existence of extensions of semantics such as semi-stable and stage semantics, as opposed to the collapse where some argumentation frameworks prevent any extension. We visit known examples from the literature and present novel variants. Finally, we also give insights into extension existence conditions.
Cite as
Christof Spanring. Hunt for the Collapse of Semantics in Infinite Abstract Argumentation Frameworks. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 70-77, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{spanring:OASIcs.ICCSW.2015.70,
author = {Spanring, Christof},
title = {{Hunt for the Collapse of Semantics in Infinite Abstract Argumentation Frameworks}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {70--77},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.70},
URN = {urn:nbn:de:0030-drops-54839},
doi = {10.4230/OASIcs.ICCSW.2015.70},
annote = {Keywords: Abstract Argumentation, Infinity, Argumentation Semantics, Discrete Structures}
}
Document
Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking
Abstract
In this paper, we present a Satisfiability Modulo Theory based (SMT-based) bounded model checking (BMC) method for Timed Real-Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. SMT-based bounded model checking consists in translating the existential model checking problem for a modal logic and for a model to the satisfiability problem of a quantifier-free first-order formula. We have implemented the SMT-BMC method and performed the BMC algorithm on Timed Weighted Generic Pipeline Paradigm benchmark. The preliminary experimental results demonstrate the feasibility of the method. To perform the experiments, we used the state of the art SMT-solver Z3.
Cite as
Agnieszka M. Zbrzezny and Andrzej Zbrzezny. Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 78-86, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{zbrzezny_et_al:OASIcs.ICCSW.2015.78,
author = {Zbrzezny, Agnieszka M. and Zbrzezny, Andrzej},
title = {{Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {78--86},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.78},
URN = {urn:nbn:de:0030-drops-54848},
doi = {10.4230/OASIcs.ICCSW.2015.78},
annote = {Keywords: SMT, Timed Real-Weighted Interpreted Systems, Bounded Model Checking}
}
Document
Automatic Transformation of Raw Clinical Data Into Clean Data Using Decision Tree Learning Combining with String Similarity Algorithm
Abstract
It is challenging to conduct statistical analyses of complex scientific datasets. It is a timeconsuming process to find the relationships within data for whether a scientist or a statistician. The process involves preprocessing the raw data, the selection of appropriate statistics, performing analysis and providing correct interpretations, among which, the data pre-processing is tedious and a particular time drain. In a large amount of data provided for analysis, there is not a standard for recording the information, and some errors either of spelling, typing or transmission. Thus, there will be many expressions for the same meaning in the data, but it will be impossible for analysis system to automatically deal with these inaccuracies. What is needed is an automatic method for transforming the raw clinical data into data which it is possible to process automatically. In this paper we propose a method combining decision tree learning with the string similarity algorithm, which is fast and accuracy to clinical data cleaning. Experimental results show that it outperforms individual string similarity algorithms and traditional data cleaning process.
Cite as
Jian Zhang. Automatic Transformation of Raw Clinical Data Into Clean Data Using Decision Tree Learning Combining with String Similarity Algorithm. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 87-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
Copy BibTex To Clipboard
@InProceedings{zhang:OASIcs.ICCSW.2015.87,
author = {Zhang, Jian},
title = {{Automatic Transformation of Raw Clinical Data Into Clean Data Using Decision Tree Learning Combining with String Similarity Algorithm}},
booktitle = {2015 Imperial College Computing Student Workshop (ICCSW 2015)},
pages = {87--94},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-000-2},
ISSN = {2190-6807},
year = {2015},
volume = {49},
editor = {Schulz, Claudia and Liew, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.87},
URN = {urn:nbn:de:0030-drops-54850},
doi = {10.4230/OASIcs.ICCSW.2015.87},
annote = {Keywords: Raw Clinical Data, Decision Tree Learning, String Similarity Algorithm}
}