Computer and information sciences topic list of research papers
-
Procedure to Match the Supply Chain Network Design with a Products’ Architecture
Abstract Supply chain network (SCN) performance is a driver of a manufacturing firms’ competitive ability due to their concentration on core competences. Suppliers provide the majority of the product, represented through its product architecture...
2014 / Florian G.H. Behncke, Florian M.A. Walter, Udo Lindemann -
A Comparison of Software Defined Network (SDN) Implementation Strategies
Abstract Software defined networking (SDN) is an emerging approach to handle data forwarding and control separately. The notion of programmability has central importance in SDN. Two implementation strategies; proprietary and open source, are shaping ...
2014 / Muhammad H. Raza, Shyamala C. Sivakumar, Ali Nafarieh, Bill Robertson -
Motor Learning in Physical Interfaces for Computational Problem Solving
Abstract Continuous Interactive Simulation (CIS) maps computational problems concerning the control of dynamical systems to physical tasks in a 3D virtual environment for users to perform. However, deciding on the best mapping for a particular...
2014 / Rohan McAdam -
Evaluation of the Effect of Step Size on Delta Modulation for Photoplethysmogram Compression
Abstract In this paper, delta modulation (DM) is employed as a compression technique for a high-resolution photoplethysmogram (PPG) signal. To accommodate both clean PPG and signals affected by motion artifacts, the effect of step size is evaluated...
2014 / K.S. Chong, E. Zahedi, K.B. Gan, M.A. Mohd Ali -
Sequential blind source separation based exclusively on second-order statistics developed for a class of periodic signals2006 / M.G. Jafari, Wenwu Wang, J.A. Chambers, T. Hoya, A. Cichocki
-
Cutting Up Is Hard To Do
Abstract The Graph k-Cut problem is that of finding a set of edges of minimum total weight, in an edge-weighted graph, such that their removal from the graph results in a graph having at least k connected components. An algorithm with a running time ...
2004 / Rodney G. Downey, Vladimir Estivill-Castro, Michael Fellows, Elena Prieto, Frances A. Rosamund -
Information Systems Research and Development at CCLRC2004 / Juan C. Bicarregui
-
Analysis of Scheduling Behaviour using Generic Timed Automata
Abstract A method for dynamic, automated analysis of the behaviour of real-time programs under different scheduling algorithms is presented. Each scheduling algorithm is defined by a generic timed automaton which can be instantiated with data for a...
2004 / Thorsten Gerdsmeier, Rachel Cardell-Oliver -
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
Abstract This paper provides a case-study in the field of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language ...
2005 / J.I. den Hartog, E.P. de Vink, J.W. de Bakker -
Model Theoretic Syntax and Parsing
Abstract In general, model-theoretic approaches to syntax aim to describe the syntactic structures of natural languages by means of logical formulae so that the structures are models of these formulae. However, in practice, the ...
2005 / Adi Palm -
Preface
Abstract Foreword This volume contains the proceedings of the Third International Workshop on Run-time Verification (RV '03). RV '03 was held on July 13, 2003, as a satellite workshop of the International Conference of...
2005 / Oleg Sokolsky, Mahesh Viswanathan -
Galois Connections in Categorial Type Logic
Abstract The introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are order-preserving; in this paper instead, we consider the addition of order-reversing, Galois...
2005 / Carlos Areces, Raffaella Bernardi, Michael Moortgat -
Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation
Abstract Generalized parsing technology provides the power and flexibility to attack real-world parsing applications. However, many programming languages have syntactical ambiguities that can only be solved using semantical analysis. In this paper...
2005 / M.G.J. van den Brand, A.S. Klusener, L. Moonen, J.J. Vinju -
A Timed Rewriting Logic Semantics for SDL: A Case Study of the Alternating Bit Protocol
Abstract SDL is an industrial standard formal description technique for telecommunication systems. Despite its wide spread use and industrial importance it lacks at present an adequate formal semantics integrating its static, dynamic, and real-time...
2005 / L.J. Steggles, Piotr Kosiuczenko -
An Open Visualization Framework for Metamodel-Based Modeling Languages
Abstract In the paper, we propose an automated, SVG-based visualization framework for modeling languages defined by metamodeling techniques. Our framework combines XML standards with existing graph transformation and graph drawing technologies in...
2005 / Péter Domokos, Daniel Varró -
Attribute Reduction in the Bayesian Version of Variable Precision Rough Set Model
Abstract The article presents a parametric Bayesian extension of the rough set model, where the set approximations are defined by using the prior probability as a reference. It is shown that the quality of the Bayesian rough set models can be...
2004 / Wojciech Ziarko -
Modal Operators for Coequations
Abstract We present the dual to Birkhoff's variety theorem in terms of predicates over the carrier of a cofree coalgebra. We then discuss the dual to Birkhoff's completeness theorem, showing how closure under deductive rules dualizes to yield two...
2004 / Jesse Hughes -
Computable Queries for Object Oriented Databases
Abstract A relational database can be considered as a finite structure for a finite relational signature in first-order logic, i.e., there are no function symbols. Interpreting the logic over this signature in such structures allows the...
2004 / Klaus-Dieter Schewe, Jose-Maria Turull-Torres -
The probability nesting game
Abstract We investigate the first order predicate logic of probability and establish the game theoretic tools to prove that this language does not support unnesting of the probability operator. This is contrasted with the probabilistic prepositional ...
2005 / Danièle Beauquier, Yoram Hirshfeld, Alexander Rabinovich, Anatol Slissenko -
One Complexity Theorist's View of Quantum Computing
Abstract The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools...
2005 / Lance Fortnow