Computer and information sciences topic list of research papers
-
AdaBoost for Feature Selection, Classification and Its Relation with SVM, A Review
Abstract In order to clarify the role of AdaBoost algorithm for feature selection, classifier learning and its relation with SVM, this paper provided a brief introduction to the AdaBoost which is used for producing a strong classifier out of weak...
2012 / Ruihu Wang -
Design of Student Information Management Database Application System for Office and Departmental Target Responsibility System
Abstract It is the inevitable outcome of higher education reform to carry out office and departmental target responsibility system, in which statistical processing of student's information is an important part of student's performance review. On the ...
2012 / Hui Zhou -
GPU computing in discrete optimization. Part II: Survey focused on routing problems2013 / Christian Schulz, Geir Hasle, André R. Brodtkorb, Trond R. Hagen
-
Web Services and Models of Computation
Abstract We review the challenges of providing Web Services, especially those this new technology will impose on models of computation.
2004 / Ugo Montanari -
CDSWS: coverage-guaranteed distributed sleep/wake scheduling for wireless sensor networks2012 / Guofang Nan, Guanxiong Shi, Zhifei Mao, Minqiang Li
-
Reo Based Interaction Model
Abstract In Component-based Software Development the integration of possibly heterogeneous and distributed components together to form a single application require mechanisms for controlling and managing the interactions among the active entities....
2006 / Silvia Amaro, Ernesto Pimentel, Ana M. Roldan -
Typed Event Structures and the π-Calculus
Abstract We propose a typing system for the true concurrent model of event structures that guarantees the interesting behavioural properties known as conflict freeness and confusion freeness. Conflict freeness is the true concurrent version of the...
2006 / Daniele Varacca, Nobuko Yoshida -
A Rewriting Semantics for a Software Architecture Description Language
Abstract Distributed and concurrent application invariably have coordination requirements. The design of those applications, composed by several (possibly distributed) components, has to consider coordination requirements comprising inter-component...
2005 / Alexandre Rademaker, Christiano Braga, Alexandre Sztajnberg -
Software Model Checking Based on Game Semantics and CSP
Abstract We present an approach for software model checking based on game semantics and CSP. Open program fragments are compositionally modelled as CSP processes which represent their game semantics. This translation is performed by a prototype...
2005 / Aleksandar Dimovski, Ranko Lazić -
COCOVILA – Compiler-Compiler for Visual Languages
Abstract A compiler-compiler for visual languages is presented. It has been designed as a framework for building visual programming environments that translate schemas into textual representation as well as into programs representing the deep...
2005 / Pavel Grigorenko, Ando Saabas, Enn Tyugu -
Global Coordination Policies for Services
Abstract An important issue of the service oriented approach is the possibility to aggregate, through programmable coordination patterns, the activities involved by service interactions. Two different approaches can be adopted to tackle service...
2009 / Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guanciale, Daniele Strollo -
Difunctorial Semantics of Object Calculus
Abstract In this paper we give a denotational model for Abadi and Cardelli's first order object calculus FOb 1+×μ (without subtyping) in the category pCpo. The key novelty of our model is its extensive use...
2005 / Johan Glimming, Neil Ghani -
Fairness of Components in System Computations
Abstract In this paper we provide a simple characterization of (weak) fairness of components as defined by Costa and Stirling in [G. Costa, C. Stirling. Weak and Strong Fairness in CCS. Information and Computation 73 (1987) 207–244]. The study is...
2005 / F. Corradini, M.R. Di Berardini, W. Vogler -
Case Study: Model Transformations for Time-triggered Languages
Abstract In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the schedule-carrying code) of the transformation, and has been...
2006 / Tivadar Szemethy -
A Scalable Evidence Based Self-Managing Framework for Trust Management
Abstract Centrally managed, traditional security systems put limits on collaborative activities among huge number of entities in current open networks (such as Grids). This requires new approaches to handling security in large distributed systems...
2007 / Mohammad Waseem Hassan, Richard McClatchey, Ian Willers -
An Interactive Driver for Goal-directed Proof Strategies
Abstract Interactive Theorem Provers (ITPs) are tools meant to assist the user during the formal development of mathematics. Automatic proof searching procedures are a desirable aid, and most ITPs supply the user with an extensive set of facilities...
2009 / Andrea Asperti, Enrico Tassi -
An Operational Semantics for Shared Messaging Communication
Abstract Shared Messaging Communication (SMC) has been introduced in [Satya Kiran M.N.V., Jayram M.N., Pradeep Rao, and S.K. Nandy. A complexity effective communication model for behavioral modeling of signal processing applications. In Proceedings...
2007 / Astrid Kiehn -
Program Extraction From Proofs of Weak Head Normalization
Abstract We formalize two proofs of weak head normalization for the simply typed lambda-calculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order reduction in the object language. Subsequently we use...
2006 / Małgorzata Biernacka, Olivier Danvy, Kristian Støvring -
TSAT++: an Open Platform for Satisfiability Modulo Theories
Abstract This paper describes TSAT++, an open platform which realizes the lazy SAT-based approach to Satisfiability Modulo Theories (SMT). SMT is the problem of determining satisfiability of a propositional combination of T-literals, where T is a...
2005 / Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Massimo Idini, Marco Maratea -
Characterization of 1-d Periodic Boundary Reversible CA
Abstract This paper reports characterization of one dimensional 3-neighborhood periodic boundary cellular automata (CA). It targets characterization of CA rules for efficient synthesis of reversible CA. The concept of reachability tree, as it has...
2009 / Sukanta Das, Biplab K. Sikdar