Computer and information sciences topic list of research papers
-
Authentication Through Hough Transformation Generated Signature on G-Let D3 Domain (AHSG)
Abstract In this paper a G-Let based authentication technique has been proposed to authenticate digital documents through Hough transform generated signature generated from original autograph. The cover image is transformed into G-Let domain to...
2014 / Madhumita Sengupta, J.K. Mandal -
On Visualizing Knowledge Flows at a University Department
Abstract The analysis of dynamic network data has become an increasingly relevant research issue, showing a high potential for applied use in organizations. To unlock its potential also for the target user group of non-domain experts, we introduce a ...
2013 / Florian Windhager, Michael Smuc, Lukas Zenk, Paolo Federico, Jürgen Pfeffer, et al. -
Prological Language Processing
Abstract We describe a Prolog-based approach to the development of language processors (such as preprocessors, frontends, evaluators, tools for software modification and analysis). The design of the corresponding environment Laptob for prological...
2004 / Ralf Lämmel, Günter Riedewald -
Sequent Calculi for the Normal Terms of the λΠ- and λΠ∑-Calculi
Abstract This paper presents two sequent calculi, requiring no clausal form for types, whose typable terms are in 1–1 correspondence with the normal terms of the λ∏- and λΠΣ-calculi. Such sequent calculi allow no permutations in the order in which...
2005 / Luís Pinto, Roy Dyckhoff -
Model Driven Performance Analysis of Enterprise Information Systems1 1This research is funded by the EU through grant IST-2001-34069 (Trusted and QoS-Aware Provision of Application Services).
Abstract This paper describes the particular motivation for performance analysis in the domain of Enterprise Information Systems (EISs) and argues that the Model Driven Architecture (MDA) is a suitable framework for integrating formal analysis...
2004 / James Skene, Wolfgang Emmerich -
Guardians for Ambient-Based Monitoring
Abstract In the Mobile Ambients of Cardelli and Gordon an ambient is a unit for mobility, which may contain processes (data) and sub-ambients. Since the seminal work of Cardelli and Gordon, several ambient-based calculi have been proposed (Seal,...
2004 / G. Ferrari, E. Moggi, R. Pugliese -
Computational Analysis of Run-time Monitoring
Abstract A run-time monitor shares computational resources, such as memory and CPU time, with the target program. Furthermore, heavy computation performed by a monitor for checking target program's execution with respect to requirement properties...
2004 / Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan -
A Scalable Agent Architecture for a Dynamic Sensor Network
Abstract Information systems for networks of small and inexpensive sensors attached to computational nodes in distributed networks will in the future be required for applications where the focus is to assess information about different ground based...
2005 / Mikael Brännström, Erland Jungert -
Prototyping and Programming with Relations
Abstract We give a survey on the use of relational algebra for problem specification and program development over relation-based discrete structures and show how the relation-algebraic prototyping and visualization tool Rel View can support this...
2004 / R. Berghammer, T. Hoffmann, B. Leoniuk, U. Milanese -
Transforming Object Oriented Models with BOTL
Abstract In many application domains, like for example B2B, B2C, or CASE, a lot of heterogeneous applications exist which have to cooperate and exchange data. A major task of system integration is the mapping of different data models, on which the...
2004 / Peter Braun, Frank Marschall -
Specification and Programming (by Graph Transformation)
Abstract In this tutorial, some basic ideas will be outlined and exemplified how graph transformation can be employed in specification and programming. In particular, some of the respective achievements of the COMPUGRAPH project will be pointed out. ...
2005 / Hans-Jörg Kreowski -
Agent-Based Material Flow2004 / Markus Klein, Mesut Özhan, Martti Piirainen
-
Models for the computational λ-calculus
Abstract We consider several different sound and complete classes of models for the computational ·-calculus, explain the definitions, and outline why one might be interested in the various classes. We first consider the class of closed -categories, ...
2005 / John Power -
Failures, Finiteness and Full Abstraction
Abstract For a simple CCS-like language a trace semantics and a failure semantics are presented. The failure semantics is shown to be fully abstract with respect to the trace semantics if and only if the set of internal actions is infinite. ...
2005 / Franck van Breugel -
As Time Goes By II
Abstract In previous papers we showed that from a suitable termination order (called ranking) one can automatically compute the worst-case time complexity of a CHR constraint simplification rule program from its program text. We combined the...
2004 / Thom Frühwirth -
Contraction of the ITCPN state space
Abstract We show here how to contract the ITCPN state space. We distinguish three levels of contraction that translate the ITCPN state space into one well timed and coherent timed automation. We consider here only equivalence based on delays. To...
2004 / H. Boucheneb, G. Berthelot -
Towards Lambda Calculus Order-Incompleteness
Abstract After Scott, mathematical models of the type-free lambda calculus are constructed by order theoretic methods and classified into semantics according to the nature of their representable functions. Selinger [48] asked if there is a lambda...
2004 / Antonino Salibra -
MExiCo: A Library for Managing Multimodal Data Collections
Abstract We present MExiCo (Multimodal Experiment Corpora), a library specifically designed for the planning, modeling, management and analysis of multimodal corpora resulting from experiments, consisting of video and audio recordings as well as...
2013 / Peter Menke, Philipp Cimiano -
A General scheme for dithering multidimensional signals, and a visual instance of encoding images with limited palettes
Abstract The core contribution of this paper is to introduce a general neat scheme based on soft vector clustering for the dithering of multidimensional signals that works in any space of arbitrary dimensionality, on arbitrary number and...
2013 / Mohamed Attia, Waleed Nazih, Mohamed Al-Badrashiny, Hamed Elsimary -
Effect of Potential Model Pruning on Different-Sized Boards in Monte-Carlo GO
Abstract Monte-Carlo GO is a computer GO program that is sufficiently competent without the knowledge expressions of IGO. Although it is computationally intensive, the computational complexity can be reduced by properly pruning the IGO game tree. In ...
2012 / Makoto Oshima, Koji Yamada, Satoshi Endo