Computer and information sciences topic list of research papers
-
Preface
Abstract This volume contains the Proceedings of the Fourth Workshop on Coalgebraic Methods in Computer Science (CMCS 2001). The Workshop was held in Genova, Italy on April 6 and 7, 2001, as a satellite event of ETAPS 2001. The aim of the CMCS...
2005 / Andrea Corradini, Marina Lenisa, Ugo Montanari -
A Graph-Theoretic Approach to Sequent Derivability in the Lambek Calculus
Abstract A graph-theoretic construction for representing the derivational side-conditions in the construction of axiomatic linkages for Lambek proof nets is presented, along with a naive algorithm that applies it to the sequent derivability problem...
2005 / Gerald Penn -
Biographies2011 /
-
Evaluation of An e-learning Scenario for Biomedical Engineers
Abstract The new co-operative blended learning concept is being developed under leadership of the TU Dresden team with collaborative partners in S axony. In th e new e-learning system TheraGnosos - Biom edical Engineering, a new framework and...
2012 / Kožuško Jan, Kuβ Julia, Abdel-Haq Anja, Weichelt Claudia, Dietrich Hans, et al. -
Case Studies in the Specification and Analysis of Protocols in Maude
Abstract We follow the method for the specification and analysis of protocols introduced in [3], further exploiting the capabilities of Maude. Our specifications are highly structured and allow the detection of type flaws, as well as replay attacks. ...
2005 / Dilia E. Rodríguez -
Terminal sequences for accessible endofunctors
Abstract We consider the behaviour of the terminal sequence of an accessible endofunctor T on a locally presentable category K. The preservation of monics by T is sufficient to imply convergence, necessarily to a terminal coalgebra. We can say much...
2005 / James Worrell -
Towards Integrated Cognitive and Interface Analysis
Abstract Using cognitive architectures to analyse the usability of human-computer interfaces is an extensively investigated strategy. A particularly powerful way to perform such analysis is through syndetic modelling, where both the interface and...
2004 / Howard Bowman, Giorgio Faconti, Mieke Massink -
Effective and sequential definition by cases on the reals via infinite signed-digit numerals
Abstract The lexicographical and numerical orders on infinite signed-digit numerals are unrelated. However, we show that there is a computable normalization operation on pairs of signed-digit numerals such that for normal pairs the two orderings...
2005 / Martín Hötzel Escardó -
Infinite Computations in Concurrent Constraint Programming
Abstract We present a fully abstract model for concurrent constraint programming which besides describing the results of terminating computations also describes the results of those non-terminating computations which are fair with respect to the...
2005 / Frank S. de Boer, Maurizio Gabbrielli -
From Proof Nets to Games
Abstract We give a class of proof nets for Intuitionistic Linear Logic with the connectives -o, !, prove a correctness criterion for them and show that a games semantics can be directly derived from these nets, along with a full completeness...
2005 / François Lamarche -
Part I2005 /
-
Minimum distance estimation of stationary and non-stationary ARFIMA processes2007 / Laura Mayoral
-
Energy Consumption Rate based Stable Election Protocol (ECRSEP) for WSNs
Abstract In recent few years Wireless Sensor Networks (WSNs) have seen an increased interest in various applications like border field security, disaster management and medical applications. So large number of sensor nodes are deployed for such...
2013 / O. Rehman, N. Javaid, B. Manzoor, A. Hafeez, A. Iqbal, et al. -
Towards coalgebraic behaviourism
Abstract In this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing behaviour by a map into a “final” coalgebra. ...
2004 / Dragan Mašulović -
Structured Modeling with GRACE1 1This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation).
Abstract In this paper, we sketch and illustrate the structuring concepts of the graph- and rule-centered modeling language GRACE, including transformation units, formal parameter units, transformation modules, and their composition to modular...
2004 / Hans-Jörg Kreowski, Giorgio Busatto, Renate Klempien-Hinrichs, Peter Knirsch, Sabine Kuske -
Three-dimensional Interactive Virtualization of University Buildings and Spaces
Abstract The environment around us provides a wealth of information. Why not bring it virtually to our screen and interact with it? Through the project at hand, real scenes created virtually by computer are provided with additional data, obtaining a ...
2013 / Pedro Sánchez Luis, Walkirio Iván González González -
Babel Treebank of Public Messages in Croatian
Abstract The paper presents the process of constructing a publicly available treebank of public messages written in Croatian. The messages were collected from various electronic sources – e-mail, blog, Facebook and SMS – and published on the Zagreb...
2013 / Danijela Merkler, Željko Agić, Ana Agić -
Open Source Interactive Map of Albania Cultural Heritage
Abstract ICTs represent strategic resources for Cultural Heritage (CH) projects. Anyway, several conditions put the success of promotion projects at risk, especially if carried out at the local level. Firstly, local scale amplifies the weight of...
2013 / Davide Di Pasquale, Antonella Lerario, Nicola Maiellaro, Paolo L. Scala -
Application of Neural Networks in Computer Security
Abstract This contribution is focused on the insurance of control system data communication via neural network technologies in connection with classical methods used in expert systems. The solution proposed defines a way of data element...
2014 / Halenar Igor, Juhasova Bohuslava, Juhas Martin, Nesticky Martin -
Scalable Autograder and LMS Integration
Abstract Autograder has been proven to be an effective and efficient judge in programming contests. The result can be delivered immediately. As an example, in International Olympiad in Informatics and ACM Inter-Collegiate Programming Contest, the...
2014 / Karol Danutama, Inggriani Liem