Computer and information sciences topic list of research papers
-
Using CafeOBJ to Mechanise Refactoring Proofs and Application
Abstract In this paper we show how rewriting systems, in particular CafeOBJ, can be used to automatically prove refactoring rules. In addition, a small case study that illustrates the application of a refactoring rule in an arbitrary program is also ...
2007 / Antonio Carvalho Júnior, Leila Silva, Márcio Cornélio -
Annotations for Defining Interactive Instructions to Interpreter Based Program Visualization Tools
Abstract An interpreter based visualization tool can be used for creating visualization exercises that engage the student to work with the visualization instead of just watching it passively. This article describes how to make the interpreter...
2007 / Essi Lahtinen, Tuukka Ahoniemi -
Restructuring Paradigm Models for the ToolBus Architecture: A Case Study
Abstract In this paper we report on an implementation case study regarding the coordination description language Paradigm. We show how to restructure existing Paradigm models to facilitate their efficient implementation on a software coordination...
2006 / A.W. Stam, L.P.J. Groenewegen, E.P. de Vink -
Implementing a Distributed Mobile Calculus Using the IMC Framework
Abstract In the last decade, many calculi for modelling distributed mobile code have been proposed. To assess their merits and encourage use, implementations of the calculi have often been proposed. These implementations usually consist of a limited ...
2007 / Lorenzo Bettini, Rocco De Nicola, Daniele Falassi, Michele Loreti -
A Computational Definition of the Notion of Vectorial Space
Abstract We usually define an algebra by a set, some operations defined on this set and some propositions that the algebra must validate. In some cases, we can replace these propositions by an algorithm on terms constructed upon these operations...
2005 / Pablo Arrighi, Gilles Dowek -
Stochastic Bigraphs
Abstract In this paper we present a stochastic semantics for Bigraphical Reactive Systems. A reduction and a labelled stochastic semantics for bigraphs are defined. As a sanity check, we prove that the two semantics are consistent with each other....
2008 / Jean Krivine, Robin Milner, Angelo Troina -
Structuring Optimizing Transformations and Proving Them Sound
Abstract A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious. To reduce the efforts required, we identify a set of common...
2007 / Aditya Kanade, Amitabha Sanyal, Uday Khedker -
Separate Compilation of Polychronous Specifications
Abstract As code generation for synchronous programs requires strong safety properties to be satisfied, compositionality becomes a difficult goal to achieve. Most synchronous languages, such as Esterel, Lustre or Signal require a given module or...
2008 / Julien Ouy, Jean-Pierre Talpin, Loïc Besnard, Paul Le Guernic -
New Trends in Large Scale Distributed Systems Simulation2011 / Ciprian Dobre, Florin Pop, Valentin Cristea
-
Green IT: Case Studies
Abstract In 2008, Murugesan [1] has defined Green computing or Green IT as the study and practice of designing, manufacturing, using, and disposing of computers, servers, and associated subsystems such as monitors, printers, storage devices,...
2012 / Chibli Joumaa, Seifedine Kadry -
An Application of the Modification of Slow Start Algorithm in Campus Network
Abstract For the problems existing in TCP/IP congestion control method, a modified slow start algorithm is introduced to the internal services of campus network to make congestion control method more effective. Network simulation results show that:...
2012 / Xiao Wenxian, Liu Zhen, Gao Guohong, Wan Wenlong -
APTCC: Auto Parallelizing Translator From C To CUDA
Abstract This paper proposes APTCC, Auto Parallelizing Translator from C to CUDA, a translator from C code to CUDA C without any directives. CUDA C is a programming language for general purpose GPU (GPGPU). CUDA C requires us a special programming...
2011 / Takehiko Nawata, Reiji Suda -
Pattern mining from saccadic motion data
Abstract A saccade contains fixations between rapid movements. Human movements are often saccadic in a fast forwarding video tape. In this paper, we present a novel model for pattern representation and pattern matching in saccadic motions, by...
2010 / Peter Liang, Yingzhen Yang, Yang Cai -
Issues and considerations regarding sharable data sets for recommender systems in technology enhanced learning
Abstract This paper raises the issue of missing data sets for recommender systems in Technology Enhanced Learning that can be used as benchmarks to compare different recommendation approaches. It discusses how suitable data sets could be created...
2010 / Hendrik Drachsler, Toine Bogers, Riina Vuorikari, Katrien Verbert, Erik Duval, et al. -
Implementation of gray-level clustering algorithm for image segmentation
Abstract The watershed algorithm is an important technique for image segmentation which converts the gray-level image to a segmented image. We propose a watershed algorithm based on the mean value, the standard deviation of the histogram and the...
2010 / A.R. Kavitha, C. Chellamuthu -
A groupware system for virtual product innovation management2007 / Kathryn Cormican, David O'Sullivan
-
Adaptive-Compression Based Congestion Control Technique for Wireless Sensor Networks2010 / Joa-Hyoung Lee, In-Bum Jung
-
A fast near-optimum block truncation coding method using a truncated K-means algorithm and inter-block correlation
Abstract Block truncation coding (BTC) is an efficient image compression method which finds application in diverse fields. The basic problem can be viewed as a two-level quantization process. However, efficient ways for optimal threshold...
2010 / Yan Yang, Qiqiang Chen, Yi Wan -
A VMD Plugin for NAMD Simulations on Amazon EC2
Abstract VMD and NAMD are two major molecular dynamics simulation software packages, which can work together for mining structural information of bio-molecules. Carrying out such molecular dynamics simulations can help researchers to understand the...
2012 / Adam K.L. Wong, Andrzej M. Goscinski -
Reachability Analysis in BioAmbients
Abstract We rephrase results, previously proved by Busi and Zavattaro on Mobile Ambients, characterizing a fragment of BioAmbients –without restriction and merge– in which a generalized form of reachability turns out to be decidable. ...
2009 / Gianluigi Zavattaro