Computer and information sciences topic list of research papers
-
A Hybrid Harmony Search Algorithm for Solving Dynamic Optimisation Problems
Abstract Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should...
2014 / Ayad Mashaan Turky, Salwani Abdullah, Nasser R. Sabar -
Approach for Measuring Change-induced Complexity based on the Production Architecture.
Abstract Handling complexity will be a necessity for manufacturing companies to assert themselves against global competitors in highly volatile markets. Therefore complexity is an important target value in planning and operating production systems,...
2014 / Florian Schoettl, Max-Christian Paefgen, Udo Lindemann -
OS Support for Load Scheduling on Accelerator-based Heterogeneous Systems
Abstract The involvement of accelerators is becoming widespread in the field of heterogeneous processing, performing computation tasks through a wide range of applications. With the advent of the various computing architectures existing currently,...
2014 / Ayman Tarakji, Niels Ole Salscheider, David Hebbeker -
System Dynamics in E-health Policy Making and the “Glocal” Concept
Abstract Developing a sound e-health system requires appropriate e-health policy. To enhance acceptable policies, policy makers need to consider aspects and components as well as issues of e-health policy. This paper discusses the use of “System...
2014 / Arash Ghazvini, Zarina Shukur -
Global GAMMA: A Distributed Implementation of GAMMA Using Global Computing
Abstract It is commonly known that writing and debugging parallel programs is more difficult than sequential programs (using traditional imperative or functional programming languages). Gamma, which is formalism for programming by multiset...
2013 / Salim Ghanemi, Ahmed A. Al Damegh -
Software reuse in a paralysis dataset based on categorical clustering and the Pearson distribution
Abstract Software reuse is the process of building software applications that make use of formerly developed software components. In this paper, we explain the benefits that can be obtained from using statistical procedures for prescribing...
2013 / M. Bhanu Sridhar, Y. Srinivas, M.H.M. Krishna Prasad -
An Empirical Investigation of Similarity-driven Trust Dynamics in Social Networks
Abstract Designing applications for group decision-making requires an understanding of how opinions are developed in a social network. In many situations, trust is the most important factor that determines the social dynamics of opinions. The goal...
2013 / Yugo Hayashi, Victor Kryssanov -
On the Relations between Disjunctive and Linear Logic Programming
Abstract In this paper we investigate the relationship between Disjunctive Logic Programming as defined in [13] and a subset of Linear Logic, namely the fragment of LinLog [2] which corresponds to Andreoli and Pareschi's LO [3]. We analyze the two...
2004 / Marco Bozzano, Giorgio Delzanno, Maurizio Martelli -
Bibliography2005 /
-
A Set-Theoretical Approach for the Induction of Inheritance Hierarchies
Abstract An approach for the automatic construction of inheritance hierarchies is presented. It is based on the strict set-theoretical point of view in the mathematical theory of Formal Concept Analysis. The resulting hierarchies are concept...
2005 / Wiebke Petersen -
Circular Reference Attributed Grammars - their Evaluation and Applications
Abstract This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs). While RAGs allow the direct and easy specification of non-locally dependent information, CAGs allow iterative fixed-point...
2005 / Eva Magnusson, Görel Hedin -
Uphill self-control2010 /
-
CoCasl at Work — Modelling Process Algebra
Abstract CoCasl[11], a recently developed coalgebraic extension of the algebraic specification language Casl[2], allows for modelling systems in terms of inductive datatypes as well as of co-inductive process types. Here, we...
2004 / Till Mossakowski, Markus Roggenbach, Lutz Schröder -
Invariants of monadic coalgebras
Abstract In this paper we consider invariants of computations described by monadic coalgebras, that is, coalgebras for a functor endowed with the structure of a monad. Following the idea of Pöschel and Rößsiger, we propose another concept of...
2004 / Dragan Mašulović -
On integrating rules into the Semantic Web
Abstract The Semantic Web effort of W3C aims at enhancing the web with reasoning capabilities. The approach is to design several tightly related (“layered”) languages for description of web resources and reasoning about them. This note briefly...
2004 / Jan Maluszyński -
Modelling and Validating a multiple-configuration railway signalling system using SDL
Abstract This paper discusses some issues about the usage of SDL and related commercial SDL support tools for the validation of a railway signalling system: in particular, the issue of the multiple configurations presented by this system is...
2004 / Alessandro Fantechi, Emilio Spinicci -
Non-Uniform Hypercoherences
Abstract In [BE01], Bucciarelli and Ehrhard propose a general tool for building a wide class of models of linear logic where a formula is interpreted as a set (the web) together with a kind of phase valued “coherence relation”. These interpretations ...
2004 / Pierre Boudes -
Granularity and the Development of Concurrent Programs
Abstract Interference is what makes the design of concurrent programs difficult. In the case of shared-variables, interference manifests itself as state changes; but the issue of interference is also present with communication-based concurrency. In...
2004 / C.B. Jones -
Reducibility
Abstract A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type Ω. Sufficient conditions for its application are derived. This method...
2004 / Silvia Ghilezan, Silvia Likavec -
Extending Timed Automata for Compositional Modeling Healthy Timed Systems
Abstract We introduce the notion of Timed I/O Components as Timed Automata “á la” Alur & Dill where an “admissible” I/O interface is declared. That notion has, what we consider, a key modeling property: non-zeno preservation under...
2004 / Víctor Braberman, Alfredo Olivero