Computer and information sciences topic list of research papers
-
Linux Cluster in Theory and Practice: A Novel Approach in Teaching Cluster Computing Based on the Intel Atom Platform
Abstract Current trends and studies on future architectures show, that the complexity of parallel computer systems is increasing steadily. Hence, the industry requires skilled employees, who have in addition to the theoretical fundamentals,...
2011 / Andy Georgi, Stefan Höhlig, Robin Geyer, Wolfgang E. Nagel -
Multi-level Optimization of Matrix Multiplication for GPU-equipped Systems
Abstract This paper presents results of our study on double-precision general matrix-matrix multiplication (DGEMM) for GPU-equipped systems. We applied further optimization to utilize the DGEMM stream kernel previously implemented for a Cypress GPU...
2011 / Kazuya Matsumoto, Naohito Nakasato, Tomoya Sakai, Hideki Yahagi, Stanislav G. Sedukhin -
A Review on Video Security Using Visual Cryptosystem
Abstract Computer abstracted algorithms ascertain altar in real-time video and actuate basal action advice in adjustment to ascertain the absolute object. This advice is encoded as a light-weight beck of activity- based meta-data that can be...
2016 / Ajay B. Gadicha, M.V. Sarode -
An FPTAS for optimizing a class of low-rank functions over a polytope2012 / Shashi Mittal, Andreas S. Schulz
-
Game Semantics for Quantum Stores
Abstract This paper presents a game semantics for a simply-typed λ-calculus equipped with quantum stores. The quantum stores are equipped with quantum operations as commands which give the language enough expressiveness to encode any quantum...
2008 / Yannick Delbecque, Prakash Panagaden -
Waterwall: a cooperative, distributed firewall for wireless mesh networks2013 / Leonardo Maccari, Renato Cigno
-
Data Refinement with Probability in Mind
Abstract The definition of data refinement between datatypes is expressed in terms of all programs that invoke procedures of the types. As a result it is laborious to check. Simulations provide sound conditions that, being ‘static’, facilitate...
2009 / T.M. Rabehaja, J.W. Sanders -
Remarks on Σ–definability without the equality test over the Reals
Abstract In this paper we study properties of Σ–definability over the reals without the equality test which is one of the main concepts in the logical approach to computability over continuous data [Korovina, Margarita V., and Oleg V. Kudinov, The...
2008 / Andrei Morozov, Margarita Korovina -
Multiparty Contract Signing Over a Reliable Network
Abstract Most contract signing protocols make use of a trusted third party (TTP) to ensure fairness. It has been shown that in the crash network model, this is inevitable. However, for stronger networks, where misbehavior is allowed but failure...
2006 / Simona Orzan, Erik de Vink -
Communication via Mobile Vesicles in Brane Calculi
Abstract P systems and Brane calculi are two (families of) computational models inspired by the structure and the functioning of living cells. Although they have different goals there is a recent growing of interests in results that bridge the two...
2007 / Antonio Vitale, Giancarlo Mauri -
A Metamodel for Dynamic Information Generated from Object-Oriented Systems
Abstract Fully understanding object-oriented systems is difficult if one is limited to merely performing static analysis of the source code: Techniques based on dynamic analysis are needed. Several tools exist that implement techniques for analyzing ...
2004 / Abdelwahab Hamou-Lhadj, Timothy C. Lethbridge -
Model-based Kernel Testing for Concurrency Bugs through Counter Example Replay
Abstract Despite the growing need for customized operating system kernels for embedded devices, kernel development continues to suffer from high development and testing costs for several reasons, including the high complexity of the kernel code, the ...
2009 / Moonzoo Kim, Shin Hong, Changki Hong, Taeho Kim -
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Abstract Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical formalisms. The central tool for model theoretic syntax has been ...
2006 / Hans-Jörg Tiede, Stephan Kepser -
Parallel and Distributed Invariant Checking of Microcontroller Software
Abstract Formal verification techniques are recognized as promising tools for the development of embedded systems. One such technique is invariant checking, which can be applied intuitively by developers as it does not require knowledge of temporal...
2009 / Jörg Brauer, Bastian Schlich, Stefan Kowalewski -
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN
Abstract We present SPHIN, a model checker for reconfigurable hybrid systems based on the model checker SPIN. We observe that physical (analog) mobility can be modeled in the same way as logical (discrete) mobility is modeled in the π-calculus by...
2006 / Hosung Song, Kevin J. Compton, William C. Rounds -
Formalization of Component Substitutability
Abstract Component-Based Software Engineering (CBSE) is increasingly used to develop large scale software. In this context, a complex software is composed of many software components which are developed independently and which are considered as...
2008 / Meriem Belguidoum, Fabien Dagnat -
A Component Model for Separation of Control Flow from Computation in Component-Based Systems
Abstract Today's component models as well as architectural description languages (ADLs) compose components either using direct or indirect method calls. When using direct method calls, components carry out computation, originate control to and...
2006 / Kung-Kiu Lau, Vladyslav Ukis, Perla Velasco, Zheng Wang -
Recommendation Retrieval in Reputation Assessment for Peer-to-Peer Systems
Abstract Recommendation-based reputation assessment in peer-to-peer systems relies on recommendations in predicting the reputation of peers. In this paper, we discuss the effectiveness and cost metrics in the recommendation retrieval. We evaluate...
2009 / Farag Azzedin, Ahmad Ridha -
A Polyhedron Approach to Calculate Probability Distributions for Markov Chain Usage Models
Abstract Statistical usage testing of hardware/software systems is based in the main on a Markov chain usage model. This kind of model represents the expected use of the system by a usage profile, i.e. appropriate probability values that are...
2010 / Winfried Dulz, Stefan Holpp, Reinhard German -
A Chart Semantics for the Pi-Calculus
Abstract We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph...
2008 / Johannes Borgström, Andrew D. Gordon, Andrew Phillips