Computer and information sciences topic list of research papers
-
Based on Two and Three Dimensional Technology to quickly build a Virtual Battlefield
Abstract Virtual battlefield environment is the use of computer technology, graphics technology and virtual reality technology to the real battle space in the computer. As technology advances and development, virtual battlefield environment system...
2012 / Gao Ying, MA Xiao-hui, Jiang Tao, XU Zhi-guo -
Technical Requirements for DER Integration Architectures
Abstract Information and Communication technology (ICT) and the integration of Distributed Energy Resources (DER) are two of the most important parts of the future smart grid, so it is necessary to analyze their interaction. In that context,...
2012 / Mathias Uslar, Sebastian Rohjans, Michael Specht -
Random graph generative model for Folksonomy network structure approximation
Abstract The analysis of social networks has received much attention in recent years. Most social structures are represented as unipartite graphs or bipartite affiliation networks. However, more complex topologies are becoming popular within social...
2010 / Szymon Chojnacki, Mieczysław Kłopotek -
Model-driven adaptation of question answering systems for ambient intelligence by integrating restricted-domain knowledge
Abstract Ambient Intelligence (AmI) requires Question Answering (QA) systems for providing intuitive interfaces to state natural language questions and obtaining precise answers related to some specific topic. Therefore, adapting QA systems to new...
2011 / Katia Vila, Jose-Norberto Maźon, Antonio Ferŕandez -
Visualization in Computational Science
Abstract This section and the papers that follow relate to to the workshop on Visualization in Computational Science which is held at the Tenth International Conference on Computational Science (ICCS2010) in Amsterdam, the Netherlands. This workshop ...
2010 / Robert G. Belleman -
Quality assurance in biomedical engineering COOP-educational training program: Planning, implementation and analysis
Abstract The paper sets selected definitions of terms which are important to apply for the interactions of all participants in a cooperative and educational training program COOP. It describes details how the COOP program is developed to closely...
2011 / Tarek Elsarnagawy, Ahmad Alhamwi -
Formal Relationships Between Geometrical and Classical Models for Concurrency
Abstract A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality between events, conflicts and schedules due to resource accesses, ...
2012 / Éric Goubault, Samuel Mimram -
Characterizing Computable Analysis with Differential Equations
Abstract The functions of Computable Analysis are defined by enhancing the capacities of normal Turing Machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as Real Recursive...
2008 / Manuel L. Campagnolo, Kerry Ojakian -
Guaranteeing Correctness Properties of a Java Card Applet
Abstract The paper describes an experiment in which a framework for model checking Java byte code, combined with the application of runtime monitoring techniques through code rewriting, was used to guarantee correctness properties of a Java Card...
2005 / Lars-Åke Fredlund -
Dynamic Shortest Paths Containers
Abstract Using a set of geometric containers to speed up shortest path queries in a weighted graph has been proven a useful tool for dealing with large sparse graphs. Given a layout of a graph G=(V,E), we store, for each edge (u,v)∈E, the bounding...
2004 / Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis -
Virtual-Machine Abstraction and Optimization Techniques
Abstract Many users and companies alike feel uncomfortable with execution performance of interpreters, often also dismissing their use for specific projects. Specifically virtual machines whose abstraction level is higher than that of the native...
2009 / Stefan Brunthaler -
Sequent Calculi for ‘Generally’
Abstract Logics of ‘generally’ (LG's) were introduced for handling assertions with some versions of vague notions (e.g. ‘generally’, ‘most’, ‘several’), which occur often in ordinary language and in science. LG's provide a framework for distinct...
2008 / Leonardo Bruno Vana, Paulo A.S. Veloso, Sheila R.M. Veloso -
A Component Assembly Approach Based On Aspect-Oriented Generative Domain Modeling
Abstract We present an approach towards automatic component assembly based on aspect-oriented generative domain modeling. It involves the lifecycle covering the component specification generation, and subsequent assembly of implementation components ...
2005 / Fei Cao, Barrett R. Bryant, Carol C. Burt, Rajeev R. Raje, Andrew M. Olson, et al. -
Present and Absent Sets: Abstraction for Testing of Reactive Systems with Databases
Abstract We present a new abstraction of reactive systems interacting with databases. This abstraction is intended to be used for model-based testing. We abstract the database into two sets: present set and absent set, and present a proof of this...
2010 / Petur Olsen, Kim G. Larsen, Arne Skou -
A Compact Linear Translation for Bounded Model Checking
Abstract We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to the Separated Normal Form encoding proposed in [Frisch, A., D....
2007 / Paul B. Jackson, Daniel Sheridan -
Preface2006 / Jacques Carette, William M. Farmer
-
Preface2004 / Jean-Marie Favre, Mike Godfrey, Andreas Winter
-
An Observational Theory for Mobile Ad Hoc Networks
Abstract We propose a process calculus to study the observational theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove...
2007 / Massimo Merro -
On the Observational Theory of the CPS-calculus
Abstract We study the observational theory of Thielecke's (recursive) CPS-calculus, a target language for CPS transforms designed to bring out the jumping, imperative nature of continuation-passing. We define a labelled transition...
2006 / Massimo Merro, Corrado Biasi -
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
Abstract We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over...
2004 / Gerth Stølting Brodal, Riko Jacob