PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On Computing Extensions and Restrictions of Information Systems Noting Some Order Properties
100%
Pałasiński M. , Pancerz K.
|
|
tom Vol. 101, nr 1/2
91-103
EN
The aim of this paper is to give the basic view on computing consistent extensions and restrictions of information systems noting some order properties of information system families. Information systems are understood in the Pawlak’s sense as the systems of knowledge representation. The extension appears if we add to the original information system some new objects corresponding to the known attribute values. Analogously, the restriction appears if we remove from the original information system some objects. Presented observations enable us to find proper descriptions (preserving some features) of concurrent systems whose behavior is represented by means of information systems.
2
Content available remote Towards an Object-Oriented Programming Language for Physarum Polycephalum Computing : A Petri Net Model Approach
100%
Schumann A. , Pancerz K.
|
2014
|
tom Vol. 133, nr 2/3
271--285
EN
Our research is focused on creation of a new object-oriented programming language for Physarum polycephalum computing. Physarum polycephalum is a one-cell organism that can be used for developing a biological architecture of different abstract devices, among others, the digital ones. In the paper, we use an abstract graphical language in the form of Petri nets to describe the Physarum polycephalum behavior. Petri nets are a good formalism to assist designers and support hardware design tools, especially in developing concurrent systems. At the beginning stage considered in this paper, we show how to build Petri net models, and next implement them as Physarum polycephalum machines, of basic logic gates AND, OR, NOT, and simple combinational circuits on the example of the 1-to-2 demultiplexer.
3
Content available remote A Rough Set Approach to Information Systems Decomposition
100%
Pancerz K. , Suraj Z.
Fundamenta Informaticae
|
2013
|
tom Vol. 127, nr 1-4
257--272
EN
The aim of this paper is to present the methods and algorithms of information systems decomposition. In the paper, decomposition with respect to reducts and the so-called global decomposition are considered. Moreover, coverings of information systems by components are discussed. An essential difference between two kinds of decomposition can be observed. In general, global decomposition can deliver more components of a given information system. This fact can be treated as some kind of additional knowledge about the system. The proposed approach is based on rough set theory. To demonstrate the usefulness of this approach, we present an illustrative example coming from the economy domain. The discussed decomposition methods can be applied e.g. for design and analysis of concurrent systems specified by information systems, for automatic feature extraction, as well as for control design of systems represented by experimental data tables.
4
Content available remote Restriction-Based Concurrent System Design Using the Rough Set Formalism
100%
Suraj Z. , Pancerz K.
|
|
tom Vol. 67, nr 1-3
233-247
EN
Design of concurrent systems under various constraints is an important problem in real-life applications in many domains (for example, automatics, robotics, software engineering) and has earlier been discussed in the literature using different formalisms. In this paper some approaches to the concurrent system design based on restrictions will be considered. In our approaches, we will use the rough set formalism. The coloured Petri nets (CP-nets) will be used to model designed concurrent systems.
5
Content available remote Computer-aided analysis of data from evaluation sheets of subjects with autism spectrum disorders
80%
Pancerz K. , Derkacz A. , Mich O. , Gomula J.
|
|
tom Vol. 12, no. 3
109--116
EN
In this paper, we deal with the problem of the initial analysis of data from evaluation sheets of subjects with autism spectrum disorders (ASDs). In the research, we use an original evaluation sheet including questions about competencies grouped into 17 spheres. An initial analysis is focused on the data preprocessing step including the filtration of cases based on consistency factors. This approach enables us to obtain simpler classifiers in terms of their size (a number of nodes and leaves in decision trees and a number of classification rules).
6
Content available remote Computer diagnosis of laryngopathies based on temporal pattern recognition in speech signal
80%
Szkoła J. , Pancerz K. , Warchoł J.
|
2010
|
tom Vol. 6, no. 12
75--80
EN
The research concerns designing computer methods of a non-invasive diagnosis of selected larynx diseases. The proposed approach is based on a signal analysis in the time domain. Two diseases are considered: Reinke's edema and laryngeal polyp. The paper presents a medical background, basic problems, a proposed procedure for the computer tool, and experiments carried out using this procedure.
7
Content available remote Ant-Based Clustering in Delta Episode Information Systems Based on Temporal Rough Set Flow Graphs
80%
Pancerz K. , Lewicki A. , Tadeusiewicz R. , Warchoł J.
Fundamenta Informaticae
|
2013
|
tom Vol. 128, nr 1-2
143--158
EN
In the paper, we focus on ant-based clustering time series data represented by means of the so-called delta episode information systems. A clustering process is made on the basis of delta representation of time series, i.e., we are interested in characters of changes between two consecutive data points in time series instead of original data points. Most algorithms use similarity measures to compare time series. In the paper, we propose to use a measure based on temporal rough set flow graphs. This measure has a probabilistic character and it is considered in terms of the Decision Theoretic Rough Set (DTRS) model. To perform ant-based clustering, the algorithm based on the versions proposed by J. Deneubourg, E. Lumer and B. Faieta as well as J. Handl et al. is used.
8
Content available Ant-based extraction of rules in simple decision systems over ontological graphs
80%
Pancerz K. , Lewicki A. , Tadeusiewicz R.
|
|
tom Vol. 25, no. 2
377--387
EN
In the paper, the problem of extraction of complex decision rules in simple decision systems over ontological graphs is considered. The extracted rules are consistent with the dominance principle similar to that applied in the dominance-based rough set approach (DRSA). In our study, we propose to use a heuristic algorithm, utilizing the ant-based clustering approach, searching the semantic spaces of concepts presented by means of ontological graphs. Concepts included in the semantic spaces are values of attributes describing objects in simple decision systems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.