Computer and information sciences topic list of research papers
-
The k-labeled Spanning Forest Problem
Abstract In the k-labeled Spanning Forest Problem (kLSF), given a graph G with a label (color) assigned to each edge, and an integer positive value k max we look for the minimum number of connected components that can be...
2014 / R. Cerulli, A. Fink, M. Gentili, A. Raiconi -
Experimental Evaluation of OpenStack Compute Scheduler
Abstract In the Cloud Computing model, the computing resources are provided as a service in an on-demand and dynamic fashion. Efficient and flexible resource management is among the current research issues in the cloud computing context. We present...
2013 / Oleg Litvinski, Abdelouahed Gherbi -
A case study of Augmented Reality simulation system application in a chemistry course
Abstract The comprehension of micro-worlds has always been the focus and the challenge of chemistry learning. Junior high school students’ imaginative abilities are not yet mature. As a result, they are not able to visualize microstructures...
2014 / Su Cai, Xu Wang, Feng-Kuang Chiang -
Context-free hypergraph grammars with node rewriting1 1This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation).
Abstract The generalisation of confluent node rewriting, a context-free graph grammar approach, to hypergraphs yields the most powerful known context-free technique to define hypergraph languages. This paper, which summarises part of the author's...
2004 / Renate Klempien-Hinrichs -
Interval Duration Logic
Abstract We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences...
2004 / Paritosh K. Pandya -
Improved Adaptive Channel Estimation Algorithm Based on Fast Varying Channel
Abstract This paper studied the MIMO-OFDM systems in fast time-varying channel estimation, the three adaptive channel estimation algorithms: RLS the QRD-RLS, IQRD-the RLS, used for the fast time-varying channel comparative studies, and computer...
2012 / Zhang Kefei -
A User Differential Range Error Calculating Algorithm Based on Analytic Method
Abstract To enhance the integrity, an analytic method (AM) which has less execution time is proposed to calculate the user differential range error (UDRE) used by the user to detect the potential risk. An ephemeris and clock correction calculation...
2012 / Bo SHAO, Jiansheng LIU, Ruibin ZHAO, Zhigang HUANG, Rui LI -
Extended Chirp Scaling Algorithm for Spotlight SAR
Abstract Among Synthetic Aperture Radar (SAR) image formation algorithms, the chirp scaling algorithm (CSA) is computationally highly efficient and has been practically used. In this paper, how to implement the subaperture extended CSA in a high...
2011 / Jin-ping SUN, Jun WANG, Yun-neng YUAN, Shi-yi MAO -
A Conference Reviewing System in Mobile Maude
Abstract A useful way of presenting a new language is by means of complete examples that show the language features in action. In this paper we do so for the Mobile Maude language, an extension of Maude that supports mobile computation. We implement ...
2005 / Francisco Durán, Alberto Verdejo -
Superposition
Abstract We show that the traditional notion of superposition as used for supporting parallel program design can subsume both composition and refinement relationships when non-deterministic behaviour of action-based systems is considered. For that...
2005 / Antónia Lopes, José Luiz Fiadeiro -
Intensional Semantics of System T of Gödel
Abstract This paper is a contribution to the development of a theory of behaviour of programs. We study an intensional behaviour of system T of Gödel that is devoted to capturing not which function is computed but how it is computed. This...
2005 / Pierre Valarcher -
Refactoring: Current Research and Future Trends
Abstract In this paper we provide an detailed overview of existing research in the field of software restructuring and refactoring, from a formal as well as a practical point of view. Next, we propose an extensive list of open questions that...
2005 / Tom Mens, Serge Demeyer, Bart Du Bois, Hans Stenten, Pieter Van Gorp -
Contract, renegotiation, and holdup: Results on the technology of trade and investment2012 / Kristy Buzard, Joel Watson
-
Variable-Precision Compatibility Spaces
Abstract In the paper we propose an extension of Wong, Wang, and Yao's rough set model over two universes (called the WWY-rough set model), along the lines of Ziarko's variable-precision rough set model. Within the obtained structures, called the...
2004 / Anna Gomolińska -
Deduction as an Engineering Science
Abstract Although in recent years considerable progress has been made in the theory of automated theorem proving, the use of theorem provers in practice is still more or less restricted to a limited number of academic groups. A lot of effort has...
2004 / Dieter Hutter -
Preface
Abstract This volume contains the Proceedings of the Fifteenth Conference on the Mathematical Foundations of Programming Semantics. The Conference was held on the campus of Tulane University, New Orleans, LA from April 28 to May 1, 1999. The meeting ...
2005 / Stephen Brookes, Achim Jung, Michael Mislove, Andre Scedrov -
A New 3D 12-Subiteration Thinning Algorithm Based on P-Simple Points
Abstract In this paper, we propose a new methodology based on P-simple points, in order to build a thinning algorithm. From an existent thinning algorithm A, we construct another thinning algorithm A’, such that A’ deletes at least all the points...
2004 / Christophe Lohou, Gilles Bertrand -
Deciding low levels of tree-automata hierarchy
Abstract The paper concerns hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fixpoints in the mu-calculus. It is also connected to quantifier...
2004 / Igor Walukiewicz -
From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence
Abstract In this paper we address the issue of providing a structured coalgebra presentation of transition systems with algebraic structure on states determined by an equational specification Γ. More precisely, we aim at representing such systems as ...
2005 / Andrea Corradini, Reiko Heckel, Ugo Montanari -
Distributed State Space Minimization
Abstract In [5], we have given a straightforward distributed implementation of the Kanellakis-Smolka 'naive' algorithm for reducing labeled transition systems modulo strong bisimulation. The algorithm proceeds by partition refinement, that is by...
2004 / Stefan Blom, Simona Orzan