Computer and information sciences topic list of research papers
-
A new agent-based paradigm for recognition of free-hand sketches
Abstract Currently, important advances are carried out in CAD (Computer Aided Design) applications; however these advances have not taken place for CAS (Computer Aided Sketching) applications. Although natural interfaces for CAD applications are not ...
2010 / D.G. Fernández-Pacheco, J. Conesa, N. Aleixos -
A hidden Markov model for Persian part-of-speech tagging
Abstract One of the important actions in the processing of languages is part-of-speech tagging. Against of this importance, although numerous models have been presented in different languages but there is few works have been done in Persian...
2011 / Morteza Okhovvat, Behrouz Minaei Bidgoli -
Comparing barriers to using learning resources among Iranian University students and instructors
Abstract The current research aimed to study barriers of using learning resources among Iranian university students and instructors. Participants included fifty university instructors (38 males,12 females) and 300 students 156 males, 144 females)...
2011 / Farideh Hamidi, Mozhgan Khosravi Rostami, Mehrak Rahimi -
Heuristic and pattern based Merge Sort
Abstract The aim of this study is to present a stable and adaptable Merge Sort algorithm that uses the design patterns to reduce computational complexity of swaps and memory usage. The order of Settlement of elements recorded by design patterns and...
2011 / Manouchehr Zadahmad Jafarlou, Parisa Yousefzadeh Fard -
Generalizations of rough set concepts
Abstract In this paper, we generalized the notions of rough set concepts using two topological structures generated by general binary relation defined on the universe of discourse. New types of topological rough sets are initiated and studied using...
2010 / A.S. Salama, M.M.E. Abd El-Monsef -
A Formal Approach to the Verification of Networks on Chip2009 / Dominique Borrione, Amr Helmy, Laurence Pierre, Julien Schmaltz
-
Preface2012 / Lisbeth Fajstrup, Eric Goubault, Martin Raussen
-
Cascaded orthogonal space–time block codes for wireless multi-hop relay networks2013 / Rahul Vaze, Robert W Heath
-
Rule-Based Programming with Diaplan
Abstract Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall...
2005 / Frank Drewes, Berthold Hoffmann, Raimund Klein, Mark Minas -
Structural Operational Semantics and Modal Logic, Revisited
Abstract A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects. Firstly, a more abstract, conceptual proof of the main...
2010 / Bartek Klin -
Quantum Data and Control Made Easier
Abstract In this paper we define nQML, a functional quantum programming language that follows the “quantum data and control” paradigm. In comparison to Altenkirch and Grattage's QML, the control constructs of nQML are simpler and can implement...
2008 / Michael Lampis, Kyriakos G. Ginis, Michalis A. Papakyriakou, Nikolaos S. Papaspyrou -
Functionally-Generalised MOQA Operations
Abstract The programming language MOQA was designed by Michel Schellekens in [Schellekens M.: Compositional Average-Case Analysis, Preprint, submitted to the Journal of ACM (2006), 78p.; M.P. Schellekens, A Modular Calculus for the Average Cost of...
2009 / Thierry Vallee -
Relating Two Approaches to Coinductive Solution of Recursive Equations
Abstract This paper shows that the approach of [P. Aczel, J. Adámek, S. Milius, and J. Velebil, Infinite trees and completely iterative theories: a coalgebraic view, Theor. Comp. Sci., 300 (1-3):1–45, 2003; L.S. Moss, Parametric corecursion, Theor....
2004 / Bart Jacobs -
Model Checking Flight Guidance Systems: from Synchrony to Asynchrony
Abstract Model checking has become a promising automated verification technique in practice. Nevertheless, most existing model checkers are specialized for limited aspects of a system where each of them requires a certain level of expertise to use...
2005 / Yunja Choi -
Selective Data Encryption in Outsourced Dynamic Environments
Abstract The amount of information held by organizations' databases is increasing very quickly. A recently proposed solution to the problem of data management, which is becoming increasingly popular, is represented by database outsourcing. Several...
2007 / E. Damiani, S. De Capitani di Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, et al. -
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
Abstract To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close integration scheme which augments the decision procedures with...
2006 / Tobias Schmidt-Samoa -
A Learning Algorithm for Deterministic Finite Automata using JFLAP
Abstract The JFLAP package is a free, interactive visualization, and teaching tool for formal languages. JFLAP is based on the principle that a picture of a concept can be easier to understand than a textual representation. With the help of this...
2009 / Mikel Alecha, Montserrat Hermo -
From Comodels to Coalgebras: State and Arrays
Abstract We investigate the notion of a comodel of a (countable) Lawvere theory, an evident dual to the notion of model. By taking the forgetful functor from the category of comodels to Set, every (countable) Lawvere theory generates a comonad on...
2004 / John Power, Olha Shkaravska -
The Polymorphic Imperative: a Generic Approach to In-place Update
Abstract The constructor calculus supports generic operations defined over arbitrary data types including abstract data types. This paper extends the basic constructor calculus to handle constructed locations. The resulting calculus is able to...
2004 / C.B. Jay, H.Y. Lu, Q.T. Nguyen -
Analog Circuit Verification: a State of an Art
Abstract Extending formal verification methodology toward analog circuits is a very challenging task that will occupy researchers for some time. To put this challenge in context we sketch some of the history of digital circuit verification as well...
2006 / Oded Maler