Computer and information sciences topic list of research papers
-
Model Development of a Virtual Learning Environment to Enhance Lean Education
Abstract Modern day industry is becoming leaner by the day. This demands engineers with an in-depth understanding of lean philosophies. Current methods for teaching lean include hands-on projects and simulation. However, simulation games available...
2011 / Akalpit Gadre, Elizabeth Cudney, Steven Corns -
Research on Comprehensive Evaluation of Knowledge Capital of Power Enterprise Based on Membership Conversion
Abstract Based on the knowledge capital theory, the article attempts to conduct a research on the evaluation of the electric power enterprise's knowledge capital. Firstly this paper explained the theory of knowledge capital, and analyzed the...
2012 / Yao Ligen, Li Miaomiao -
E-portfolio in Lifelong Learning Applications
Abstract In today's world, with the expansion of technology, new pursuits and in parallel with that, new concepts such as life long learning and e-portfolio emerge. Ever-growing technology removes the borders of learning and results in continuous...
2011 / Mehmet Fatih Baris, Nilgun Tosun -
A Multi-thread Data Flow Solution Applying to Java Extension
Abstract The multi-core processors environment is increasingly popular, the parallel studies of application program for this architecture has become the focus. In object-oriented program design language, often use the thread to implement an...
2012 / Li Chen -
Preface2007 / Ella Roubtsova
-
A Case Study in Matching Test and Proof Coverage
Abstract This paper studies the complementarity of test and deductive proof processes for Java programs specified in JML (Java Modeling Language). The proof of a program may be long and difficult, especially when automatic provers give up. When a...
2007 / Y. Ledru, L. du Bousquet, F. Dadeau, F. Allouti -
The Power of Closed Reduction Strategies2007 / Sandra Alves, Maribel Fernández, Mario Florido, Ian Mackie
-
Applications of Hierarchical Reasoning in the Verification of Complex Systems
Abstract In this paper we show how hierarchical reasoning can be used to verify properties of complex systems. Chains of local theory extensions are used to model a case study taken from the European Train Control System (ETCS) standard, but...
2007 / Swen Jacobs, Viorica Sofronie-Stokkermans -
The Importance of Being (A Little Bit) Discrete
Abstract We compare the hybrid, stochastic, and differential semantics for stochastic Concurrent Constraint Programming, focussing on the exhibited behavior of models and their robustness. By investigating in detail two case studies, a circadian...
2009 / Luca Bortolussi, Alberto Policriti -
Time Constrained Verification of Analog Circuits using Model-Checking Algorithms
Abstract In this contribution we present algorithms for model checking of analog circuits enabling the specification of time constraints. Furthermore, a methodology for defining time-based specifications is introduced. An already known method for...
2006 / Darius Grabowski, Daniel Platte, Lars Hedrich, Erich Barke -
Branching Bisimulation Congruence for Probabilistic Systems
Abstract The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define another branching bisimulation in the more general model...
2008 / Nikola Trčka, Sonja Georgievska -
Representing Model Theory in a Type-Theoretical Logical Framework
Abstract We give a comprehensive formal representation of first-order logic using the recently developed module system for the Twelf implementation of the Edinburgh Logical Framework LF. The module system places strong emphasis on signature...
2009 / Fulya Horozal, Florian Rabe -
Generalized Mignotte's Sequences Over Polynomial Rings
Abstract This paper introduces the generalization of Mignotte modular secret sharing over the polynomial rings. Mignotte proposed threshold secret sharing over the ring of integers. We extend his method for the ring of polynomials which is Euclidean ...
2007 / Tatyana Galibus, Genadii Matveev -
jSynoPSys – A Scenario-Based Testing Tool based on the Symbolic Animation of B Machines
Abstract This paper presents the jSynoPSys tool that implements the concept of Scenario-Based Testing from B machines. This consists in describing execution scenarios, expressed as regular expressions over the operations of the system, coupled with...
2009 / Frédéric Dadeau, Régis Tissot -
Normal Form Simulation for McCarthy's Amb
Abstract This paper presents co-inductive operational theories of program refinement and equivalence, called whnf similarity and whnf simulation equivalence, for the λ-calculus extended with McCarthy's ambiguous choice operator amb. The associated...
2006 / Soren B. Lassen -
Using Template Haskell for Abstract Interpretation
Abstract Metaprogramming consists of writing programs that generate or manipulate other programs. Template Haskell is a recent extension of Haskell, currently implemented in the Glasgow Haskell Compiler, giving support to metaprogramming at compile...
2007 / Clara Segura, Carmen Torrano -
Goal-ontology approach for modeling and designing ETL processes
Abstract The data warehouse (DW) system’s design involves several tasks such as defining DW requirements, modeling DW schemas, and specifying ETL processes operations, and these have been studied and practiced for many years. However, the common...
2011 / Azman Ta’a, Mohd Syazwan Abdullah -
OpenMP application profiling — state of the art and directions for the future
Abstract OpenMP is a successful approach to writing threaded parallel applications. This article describes the state of the art in performance profiling OpenMP applications, covering vendor performance tools and platform independent techniques. The...
2010 / Karl Fürlinger -
The value of information in multi-armed bandits with exponentially distributed rewards
Abstract We consider a class of multi-armed bandit problems where the reward obtained by pulling an arm is drawn from an exponential distribution whose parameter is unknown. A Bayesian model with independent gamma priors is used to represent our...
2011 / Ilya O. Ryzhov, Warren B. Powell -
Sparse Jacobian Computation Using ADIC2 and ColPack
Abstract Many scientific applications benefit from the accurate and efficient computation of derivatives. Automatically generating these derivative computations from an applications source code offers a competitive alternative to other approaches,...
2011 / Sri Hari Krishna Narayanan, Boyana Norris, Paul Hovland, Duc C. Nguyen, Assefaw H. Gebremedhin