Wyniki wyszukiwania - BazTech

1

ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations

Kryszkiewicz M.

Fundamenta Informaticae

|

2016

|

Vol. 148, nr 1/2

65--85

EN

In this paper, we propose an ACBC-evaluation formula, which delivers a flexible way of formulating different kinds of criteria for association and decision rules. We prove that rules with minimal antecedents that fulfill ACBC-evaluation formulae are key generators, which are patterns of a special type. We also show that a number of types of rough set approximations of decision classes can be expressed based on ACBC-evaluation formulae. We prove that decision rules preserving respective approximations of decision classes are rules that satisfy an ACBC-evaluation formula and that antecedents of such optimal decision rules are key generators, too. A number of properties related to particular measures of association rules and key generators are derived.

2

Decision Prediction Using Visual Patterns

Qin L., Zhong N., Lu S., Li M.

Fundamenta Informaticae

|

2013

|

Vol. 127, nr 1-4

545--560

EN

Lack of understanding of users' underlying decision making process results in the bottleneck of EB-HCI (eye movement-based human-computer interaction) systems. Meanwhile, considerable findings on visual features of decision making have been derived from cognitive researches over past few years. A promising method of decision prediction in EB-HCI systems is presented in this article, which is inspired by the looking behavior when a user makes a decision. As two features of visual decision making, gaze bias and pupil dilation are considered into judging intensions. This method combines the history of eye movements to a given interface and the visual traits of users. Hence, it improves the prediction performance in a more natural and objective way. We apply the method to an either-or choice making task on the commercial Web pages to test its effectiveness. Although the result shows a good performance only of gaze bias but not of pupil dilation to predict a decision, it proves that hiring the visual traits of users is an effective approach to improve the performance of automatic triggering in EB-HCI systems.

3

Mikroprocesorowa platforma sensorowa dla systemu oznaczania składu mieszanin gazowych

Szpakowski A.

Przegląd Elektrotechniczny

|

2010

|

R. 86, nr 10

107-110

PL

W artykule przedstawiono mikroprocesorową, modularną, wielokanałową platformę sensorową stanowiąca część projektu, którego długofalowym celem jest rozwój oraz praktyczne zastosowanie metod rozpoznawania wzorców w układach sensorowych, ze szczególnym uwzględnieniem ich wykorzystania w oznaczaniu składu mieszanin gazowych. Platforma współpracuje z komercyjnie dostępnymi sensorami bazującymi na warstwach domieszkowanego SnO2. i zapewnia rozbudowane możliwości modulacji temperatury sensorów.

EN

This article presents the microprocessor, modular, multichannel sensor platform. The platform is a part of the project, which aims the development and practical application of pattern recognition methods in sensor systems oriented on determination of gas mixtures composition. The platform is operating with commercially available SnO2-based chemical sensors and provides the sensor temperature modulation capabilities.

4

Register Cellular Automata in the Hyperbolic Plane

Grigorieff S., Margenstern M.

Fundamenta Informaticae

|

2004

|

Vol. 61, nr 1

19--27

EN

In this paper, we consider cellular automata on special grids of the hyperbolic plane: the grids are constructed on infinigons, i.e. polygons with infinitely many sides. We show that the truth of arithmetical formulas can be decided in finite time with infinite initial recursive configurations. Next, we define a new kind of cellular automata, endowed with data and more powerful operations which we call register cellular automata. This time, starting from finite configurations, it is possible to decide the truth of arithmetic formulas in linear time with respect to the size of the formula.

5

Integrating Forms of Interaction in a Distributed Model

Bandini S., Simone C.

Fundamenta Informaticae

|

2004

|

Vol. 61, nr 1

1--17

EN

The main aim of this paper is to present the formal description of the Multilayered Reaction-Diffusion Machine (MRDM, an extension of a previously introduced RDM, Reaction-Diffusion Machine) which can be seen as a generalization of Cellular Automata since it relaxes some constraints on uniformity, locality and closure. The MRDM offers a formal and computational environment where to describe, represent and simulate coordination models which explicitly require spatial features to be considered and integrates different forms of interaction. The paper is divided into two main parts. In the first one, the formal description of the MRDM is presented. In the second part the MRDM is put in relation with deterministic Turing machines; moreover we show how the MRDM, under determined constraints, collapses on a traditional CA.

6

Almost Periodic Configurations on Linear Cellular Automata

Sutner K.

Fundamenta Informaticae

|

2003

|

Vol. 58, nr 3,4

223--240

EN

We study computational properties of linear cellular automata on configurations that differ from spatially periodic ones in only finitely many places. It is shown that the degree structure of the orbits of cellular automata is the same on these configurations as on the space of finite configurations. We also show that it is undecidable whether the cellular automaton exhibits complicated behavior on configurations of sufficiently long spatial periods and exhibit cellular automata with undecidable orbits whose orbits on backgrounds of all fixed sizes are decidable.