Sciweavers

TRS
2008
13 years 7 months ago
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
Andrzej W. Przybyszewski
TRS
2008
13 years 7 months ago
A Model of User-Oriented Reduct Construction for Machine Learning
An implicit assumption of many machine learning algorithms is that all attributes are of the same importance. An algorithm typically selects attributes based solely on their statis...
Yiyu Yao, Yan Zhao, Jue Wang, Suqing Han
TRS
2008
13 years 7 months ago
Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
Wojciech Jaworski
TRS
2008
13 years 7 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
TOPNOC
2008
13 years 7 months ago
Model Driven Testing Based on Test History
Abstract. We consider software systems consisting of a single component running one sequential process only. We model such software systems as a special class of transition systems...
Isaac Corro Ramos, Alessandro Di Bucchianico, Lusi...
TOPNOC
2008
13 years 7 months ago
Translating Message Sequence Charts to other Process Languages Using Process Mining
Message Sequence Charts (MSCs) are a well known language for specifying scenarios that describe how different actors (e.g., system components, people, or organizations) interact. M...
Kristian Bisgaard Lassen, Boudewijn F. van Dongen
TOPNOC
2008
13 years 7 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
TOPNOC
2008
13 years 7 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...
TOPNOC
2008
13 years 7 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
TOPNOC
2008
13 years 7 months ago
Constructive Alignment for Teaching Model-Based Design for Concurrency
"How can we make sure our students learn what we want them to?" is the number one question in teaching. This paper is intended to provide the reader with: i) a general a...
Claus Brabrand