Computer and information sciences topic list of research papers
-
Hierarchical Video Summarization Extraction Algorithm in Compressed Domain
Abstract In this paper, a hierarchical video summarization representation algorithm was proposed for video analysis in compressed domain. In particular, Rough Sets(RS) theory is introduced for video analysis to inrease the efficiency of algorithm....
2012 / Li Xiang-wei, Zhao Li-dong, Zhao Kai -
3D point cloud registration based on a purpose-designed similarity measure2012 / Carlos Torre-Ferrero, José R Llata, Luciano Alonso, Sandra Robla, Esther G Sarabia
-
A Low-Cost BIST Scheme for Test Vector Embedding in Accumulator-Generated Sequences2008 / Ioannis Voyiatzis
-
Designing Interactive Applications to Support Novel Activities2013 / Hyowon Lee, Nazlena Mohamad Ali, Lynda Hardman
-
Security Policies Enforcement Using Finite Edit Automata
Abstract Edit automata have been introduced by J. Ligatti et al. as a model for security enforcement mechanisms which work at run time. In a distributed interacting system, they play a role of monitor that runs in parallel with a target program and...
2009 / Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte -
A Transformational Approach to Prove Outermost Termination Automatically
Abstract We present transformations from a generalized form of left-linear TRSs, called quasi left-linear TRSs, to TRSs such that outermost termination of the original TRS can be concluded from termination of the transformed TRS. In this way we can...
2009 / Matthias Raffelsieper, Hans Zantema -
Non-Interference Control Synthesis for Security Timed Automata
Abstract In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Automata, is addressed for the first time. We first discuss a...
2007 / Guillaume Gardey, John Mullins, Olivier H. Roux -
On the Optimality of Register Saturation
Abstract In an optimizing compiler, the register allocation process is still a crucial phase since it allows to reduce spill code that damages the performances. The register constraints are generally taken into account during the instruction...
2005 / Sid-Ahmed-Ali Touati -
A Large-Scale Experiment in Executing Extracted Programs
Abstract It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction can generate the corresponding programs automatically. Previous ...
2006 / Luís Cruz-Filipe, Pierre Letouzey -
Pillar 3 and Modelling of Stakeholders’ Behaviour at the Commercial Bank Website during the Recent Financial Crisis
Abstract The paper analyses domestic and foreign market participants’ interests in mandatory Basel 2, Pillar 3 information disclosure of a commercial bank during the recent financial crisis. The authors try to ascertain whether the purposes of Basel ...
2013 / Michal Munk, Anna Pilkova, Jozef Kapusta, Peter Svec, Martin Drlik -
A New Hybrid Algorithm for FPGA Routing
Abstract A new routing algorithm is proposed for FPGA to improve the increasing transformation cost of pseudo-Boolean Satisfiability algorithm in the routing process. The approach combines advantages of pseudo-Boolean Satisfiability and geometric...
2012 / Yulan Tang, Jianhui Chen -
eScience: Building our Body of Knowledge
Abstract This paper describes the need for an eScience BoK, particularly as a resource for educators. eScience is a term representing the computational technology and techniques utilised when undertaking research. As eScience matures, stakeholders,...
2011 / Valerie Maxville -
Using ATL for Checking Models
Abstract Working with models often requires the ability to assert the compliance of a given model to a given set of constraints. Some tools are able to check OCL invariants on UML models. However, there are very few tools able to do the same for any ...
2006 / Jean Bézivin, Frédéric Jouault -
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Abstract Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [Mignotte, M., How to share a secret, in: T. Beth, editor, Cryptography-Proceedings of the Workshop on Cryptography, Burg Feuerstein, 1982,...
2007 / Sorin Iftene -
Preface2008 / Fabio Massacci, Frank Piessens
-
Plugging a Space Leak with an Arrow
Abstract The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations using streams and continuations lead to potentially serious time ...
2007 / Hai Liu, Paul Hudak -
Strengthening the Zipper
Abstract The zipper is a well known design pattern for providing a cursor-like interface to a data structure. However, the classic treatise by Huet only scratches the surface of some of its potential applications. In this paper we take inspiration...
2010 / Tristan O.R. Allwood, Susan Eisenbach -
The Better Bubbling Lemma
Abstract BCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, JSL 48 (1983), 931–940] relies for its modeling of λ calculus in intersection type filters on a key...
2007 / Robert K. Meyer -
Object-Oriented Connector-Component Architectures
Abstract This paper presents an important extension of our contribution to FESCA '04, which presented a generic framework for connector architectures. These architectures were defined by components, consisting of a body specification and a set of...
2005 / H. Ehrig, B. Braatz, M. Klein, F. Orejas, S. Pérez, et al. -
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Abstract This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC_PROVE, which calls CVC Lite and translates the resulting proof object back to HOL-Light. As a result, we obtain a highly trusted...
2006 / Sean McLaughlin, Clark Barrett, Yeting Ge