Computer and information sciences topic list of research papers
-
Simulation System of Car Crash Test in C-NCAP Analysis Based on an Improved Apriori Algorithm*
Abstract In order to analysis car crash test in C-NCAP, an improved algorithm is given based on Apriori algorithm in this paper. The new algorithm is implemented with vertical data layout, breadth first searching, and intersecting. It takes...
2012 / LI Xiang -
A Data Preprocessing Algorithm for Classification Model Based On Rough Sets
Abstract Aimed to solve the limitation of abundant data to constructing classification modeling in data mining, the paper proposed a novel effective preprocessing algorithm based on rough sets. Firstly, we construct the relation Information System...
2012 / Li Xiang-wei, Qi Yian-fang -
Security in cognitive wireless sensor networks. Challenges and open problems2012 / Alvaro Araujo, Javier Blesa, Elena Romero, Daniel Villanueva
-
Regular Model Checking Using Inference of Regular Languages
Abstract Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a...
2005 / Peter Habermehl, Tomáš Vojnar -
A Software Certification Consortium and its Top 9 Hurdles
Abstract In August of 2007 and December of 2007, North American academic researchers, industry representatives and regulators were invited to meetings in Washington and Minneapolis, respectively, with the goal of forming a Software Certification...
2009 / John Hatcliff, Mats Heimdahl, Mark Lawford, Tom Maibaum, Alan Wassyng, et al. -
Managing Proof Documents for Asynchronous Processing
Abstract Asynchronous proof processing is a recent approach at improving the usability and performance of interactive theorem provers. It builds on a simple metaphor: the user edits a proof document while the prover checks its consistency in the...
2009 / Holger Gast -
Programming Languages For Interactive Computing
Abstract Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination. By contrast most applications are interactive: they...
2008 / Roly Perera -
First Steps Towards a Visualization-Based Computer Science Hypertextbook as a Moodle Module
Abstract Hypertextbooks for Computer Science contents present an interesting approach to better support learners and integrate algorithm animations into the learning materials. We have developed a prototype for integrating a selection of the...
2009 / Guido Rößling, Teena Vellaramkalayil -
Programmed Strategies for Program Verification
Abstract Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property assertions written in...
2007 / Richard B. Kieburtz -
Coordination Models Based on a Formal Model of Distributed Object Reflection
Abstract We propose a family of models of coordination of distributed object systems representing different views, with refinement relations between the different views. We start with distributed objects interacting via asynchronous message passing. ...
2006 / Carolyn L. Talcott -
Ensuring UML Models Consistency Using the OCL Environment2004 / Dan Chiorean, Mihai Paşca, Adrian Cârcu, Cristian Botiza, Sorin Moldovan
-
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard
Abstract We show that checking weak bisimulation equivalence of two context-free processes (also called BPA-processes) is EXPTIME-hard, even under the condition that the processes are normed. Fur- thermore, checking weak regularity (finiteness up to ...
2004 / Richard Mayr -
Applications of Algebra and Coalgebra in Scientific Modelling
Abstract In computer science, the algebra–coalgebra duality serves as a formal framework for connecting the perspectives of state-based and behavior-based models. In other sciences such as ecology, these perspectives are seemingly harder to...
2010 / Michael Hauhs, Baltasar Trancón y Widemann -
Lazy Constraint Imposing for Improving the Path Constraint
Abstract In this paper we propose a lazy constraint imposing mechanism for improving the path constraint in GRASPER, a state-of-the-art graph constraint solver, having obtained very promising results in terms of both time and space in solving an...
2009 / Ruben Duarte Viegas, Francisco Azevedo -
Counter Abstraction in the CSP/FDR setting
Abstract In this paper we consider an adaptation of counter abstraction for the CSP/FDR setting. The technique allows us to transform a concurrent system with an unbounded number of agents into a finite-state abstraction. The systems to which the...
2009 / Tomasz Mazur, Gavin Lowe -
Modeling Fresh Names in the π-calculus Using Abstractions
Abstract In this paper, we model fresh names in the π-calculus using abstractions with respect to a new binding operator θ. Both the theory and the metatheory of the π-calculus benefit from this simple extension. The operational semantics of this...
2004 / Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan -
A Process Calculus of Atomic Commit
Abstract This article points out a strong connection between process calculi and atomic commit. Process calculus rendezvous is an abstract semantics for atomic commitment. An implementation of process-calculus rendezvous is an atomic commit...
2004 / Laura Bocchi, Lucian Wischik -
A Formal Framework for Structural Reconfiguration of Components under Behavioural Adaptation
Abstract A major asset of modern systems is to dynamically reconfigure systems to cope with failures or component updates. Nevertheless, designing such systems with off-the-shelf components is hardly feasible: components are black-boxes that can...
2010 / Antonio Cansado, Carlos Canal, Gwen Salaün, Javier Cubo -
Preface2008 / Roberto Bruni, Dániel Varró
-
State Dependent IO-Monads in Type Theory
Abstract We introduce the notion of state dependent interactive programs for Martin-Löf Type Theory. These programs are elements of coalgebras of certain endofunctors on the presheaf category S → ...
2007 / Markus Michelbrink, Anton Setzer