Computer and information sciences topic list of research papers
-
A Buffered-State Front Line Approach in Multi-tier Supplier Collaborative Project Controlling
Abstract Buffers of critical chain method have been used in multi-tier supplier collaborative project for a time. But there is still no good way to connect these buffers with current task execution information to better balance the resource using...
2012 / Xinghan Wang, Fanbin Kong, Xinguo Ming, Lei Wang -
Merged Agreement Algorithms for Domain Independent Sentiment Analysis
Abstract In this paper, we consider the problem of building models that have high sentiment classification accuracy across domains. For that purpose, we present and evaluate three new algorithms based on multi-view learning using both high-level and ...
2011 / Dinko Lambov, Sebastião Pais, Gãel Dias -
Managing Educational Resource - Student Information Systems Using BVAGQ Fragmented Database Replication Model
Abstract Significant and urgent solutions are required in order to manage educational resource efficient and effective. Data replication is one of the key components to manage the huge of resources in data grid architecture as it enhances data...
2011 / A. Noraziah, Ainul Azila Che Fauzi, Mustafa Mat Deris, Md Yazid Mohd Saman, Noriyani Mohd Zain, et al. -
Research on Key Technologies of 3D Model Retrieval Based on Semantic
Abstract Content-based three-dimensional (3D) model retrieval technology mainly reflects the physical information of model but it can not properly express the semantic information. As to this problem this article will apply user's semantic...
2012 / Siqing Luo, Li Li, Jing Wang -
An E-learning System based on Affective Computing
Abstract In recent years, e-learning as a learning system is very popular. But the current e-learning systems cannot instruct students effectively since they do not consider the emotional state in the context of instruction. The emergence of the...
2012 / Sun Duo, Lu Xue Song -
Optimal Hops-Based Adaptive Clustering Algorithm
Abstract This paper proposes an optimal hops-based adaptive clustering algorithm (OHACA). The algorithm sets an energy selection threshold before the cluster forms so that the nodes with less energy are more likely to go to sleep immediately. In...
2012 / Xin Xuan, Jian Chen, Shanshan Zhen, Yonghong Kuo -
Identification of the design variables of eLearning tools2011 / M.R. Martínez-Torres, S.L. Toral, F. Barrero
-
Complete Laziness: a Natural Semantics
Abstract Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional languages do not use plain call-by-need evaluation: they also...
2008 / François-Régis Sinot -
Pedagogical Effectiveness of Engagement Levels – A Survey of Successful Experiences
Abstract In this paper we survey experiments with program and algorithm visualizations (PAVs) where learning improvements have been detected. We analyze these experiments based on the student's level of engagement with the visualizations. There are...
2009 / Jaime Urquiza-Fuentes, J. Ángel Velázquez-Iturbide -
The ASW Protocol Revisited: A Unified View
Abstract We revisit the analysis of the ASW contract signing protocol and use a unified view of the protocol as a whole as a basis to reason about the protocol and its objectives. This line of reasoning yields a simpler and clearer model of agents...
2005 / Paul Hankes Drielsma, Sebastian Mödersheim -
Shaped Hierarchical Architectural Design
Abstract Architectural design of software systems deals with high level configuration structuring. Checking that a system belongs to a software architecture style (or shape) implies that the architecture is an instance of a structurally defined...
2004 / Dan Hirsch, Ugo Montanari -
Static Class Elements for Object-Z
Abstract Static variables and methods are part of almost every modern object-oriented programming language. Static elements are for instance indispensable for certain kinds of design patterns applied during programming. Object-oriented specification ...
2009 / Thomas Ruhroth, Heike Wehrheim -
Plug and Play the Theory of Contexts in Higher-Order Abstract Syntax2004 / Alberto Ciaffaglione, Ivan Scagnetto
-
Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs
Abstract The problem of verifying safety properties of Lustre programs with integer arithmetic have been attacked in several different ways. Abstract interpretation is used in NBAC, and inductive verification using a SAT solver is used in Luke. ...
2006 / Anders Franzén -
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC
Abstract Carrier Sense Multiple Access/Collision Detection (CSMA/CD) is the protocol for carrier transmission access in Ethernet networks (international standard IEEE 802.3). On Ethernet, any Network Interface Card (NIC) can try to send a packet in...
2005 / Marie Duflot, Laurent Fribourg, Thomas Herault, Richard Lassaigne, Frédéric Magniette, et al. -
Timed Concurrent Constraint Programming for Analysing Biological Systems
Abstract In this paper we present our first approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information constructs in ntcc can provide a suitable language for such...
2007 / Julian Gutiérrez, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia -
Handling State-Machines Specifications with GATeL
Abstract GATeL proposes a testing environment for Lustre/Scade programs. Its main component is a resolution procedure based on a CLP interpretation of its input language. This paper presents a two-tier extension of GATeL in order to take into...
2010 / Benjamin Blanc, Christophe Junke, Bruno Marre, Pascale Le Gall, Olivier Andrieu -
Towards the Formal Verification of a Java Processor in Event-B
Abstract Formal verification is becoming more and more important in the production of high integrity microprocessors. The general purpose formal method called Event-B is the latest incarnation of the B Method: it is a proof-based approach with a...
2008 / Neil Evans, Neil Grant -
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Abstract We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the...
2009 / Stefano Bistarelli, Francesco Santini -
On the Integration of Connectionist and Logic-Based Systems
Abstract It is a long-standing and important problem to integrate logic-based systems and connectionist systems. In brief, this problem is concerned with how each of these two paradigms interacts with the other and how each complements the other:...
2006 / Anthony Karel Seda