Wyniki wyszukiwania - BazTech

1

Application of game tree structures in the process of obtaining knowledge

Deptuła Adam

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2020

|

z. 144

43--57

EN

Purpose: The purpose of the article is to present dependency graphs and parametric game tree structures as tools in generating and acquiring knowledge. Design/methodology/approach: The thematic scope of work concerns the author's method of generating graphs and decision trees. The scope of work includes the analysis of computational assumptions of guidelines supporting knowledge generation and decision making. Findings: The paper presents a method of generating game tree structures that allow to change the values of decision parameters in the issues of decision making and knowledge generation. Research limitations/implications: Further development directions of the presented issues should be conducted in the field of computer implementation of the developed algorithms. Practical implications: The most important in this regard will be the selection of the optimal programming environment with the possibility of installing the program in laboratory room systems for decision support and knowledge management for students. At a later stage, the use of tools in various problems in companies with a managerial and technical profile. Social implications: The application of method can improve the quality of decision alignment and give access to problem solving of various technical problems. Originality/value: A novelty is the use of parametric game tree structures as an alternative method to induction trees and multi-valued logical trees. Because game structures, unlike other methods, are built directly from the graph.

2

Invariant Structures and Dependence Relations

Janicki R., Kleijn J., Koutny M., Mikulski Ł.

Fundamenta Informaticae

|

2017

|

Vol. 155, nr 1/2

1--29

EN

A step trace is an equivalence class of step sequences which can be thought of as different observations of the same underlying concurrent history. Equivalence is determined on basis of a step alphabet that describes the relations between events in terms of potential simultaneity and sequentialisability. Step traces cannot be represented by standard partial orders, but require so-called invariant structures, extended order structures that capture the phenomena of mutual exclusion and weak causality. In this paper, we present an effective way of deciding whether an invariant structure represents a step trace over a given step alphabet. We also describe a method by which one can check whether a given invariant structure can represent a step trace over any step alphabet. Moreover, if the answer is positive, the method provides a suitable step alphabet.

3

Dynamic tile free scheduling for code with acyclic inter-tile dependence graphs

Bielecki W., Skotnicki P.

Computer Science

|

2017

|

Vol. 18 (2)

195--216

EN

Free scheduling is a task ordering technique under which instructions are executed as soon as their operands become available. Coarsening the grain of computations under the free schedule, by means of using groups of loop nest statement instances (tiles) in place of single statement instances, increases the locality of data accesses and reduces the number of synchronization events, and as a consequence improves program performance. The paper presents an approach for code generation that allows for the free schedule for tiles of arbitrarily nested affine loops at run-time. The scope of the applicability of the introduced algorithms is limited to tiled loop nests whose inter-tile dependence graphs are cycle-free. The approach is based on the polyhedral model. Results of experiments with the PolyBench benchmark suite, demonstrating significant tiled code speed-up, are discussed.

4

Concurrent Start Tiling of Stencil Computations based on the Transitive Closure of a Data Dependence Graph

Bielecki W., Skotnicki P.

Przegląd Elektrotechniczny

|

2015

|

R. 91, nr 11

167-170

EN

Stencil computations stand at the core of a wide range of scientific and engineering solutions. Load-balanced execution of stencil kernels, allowing for full utilization of processing units from the very beginning, is therefore the subject of a considerable amount of research. This paper presents a novel approach to generating parallel tiled code of stencil loops, based on the application of the transitive closure of a data dependence graph and a combination of the polyhedral model and the iteration space slicing framework.

PL

Iteracyjne obliczenia, będące funkcja wartości punktów pewnej przestrzeni w czasie, stanowią podstawe˛ szerokiego zakresu rozwiązań naukowych i inżynieryjnych. Efektywne wykonanie realizujących je pętli programowych, poprzez pełne i zrównowaz˙one wykorzystanie dostępnych jednostek obliczeniowych od samego początku, jest przedmiotem znacznej liczby badań. Artykuł prezentuje nowe podejście do blokowania omawianych pętli, bazujące na zastosowaniu domknięcia przechodniego grafu zależności danych oraz technice podziału przestrzeni iteracji.

5

Podobieństwa i różnice kompleksowych struktur rozgrywających parametrycznie w badaniu własności dynamicznych układów maszynowych

Deptuła A., Partyka M. A.

Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki

|

2012

|

Nr 3

314-325

PL

W opracowaniu przedstawiono zastosowanie grafów zależności i drzew rozgrywających parametrycznie do analizy i syntezy własności dynamicznych układów maszynowych. Podano rozkłady grafu od różnych wierzchołków początkowych oraz podobieństwa i różnice w kompleksowych strukturach drzewiastych, które opisują dopuszczalne podukłady danego układu maszynowego. Uwzględniono możliwość znalezienia wspólnej części wszystkich struktur rozgrywających parametrycznie z rozpisaniem na oddzielne parametry konstrukcyjne i/lub eksploatacyjne.

EN

The paper concerns the application of dependence graphs and game tree-structures for the analysis and synthesis of the dynamic properties of machine systems. Graph distributions starting from various beginning vertices are presented in this paper. In order to illustrate the acceptable subsystems of parent machine system, similarities and differences between complex parametric trees are also given. It is also possible to find the part common to all the game tree-structures and describe it over separate design or operational parameters.

6

Application of dependence graphs and game trees for decision decomposition for machine systems

Deptuła A., Partyka M. A.

Journal of Automation Mobile Robotics and Intelligent Systems

|

2011

|

Vol. 5, No. 4

17-26

EN

The paper concerns application of dependence graphs and parametric game trees for analysis and synthesis of dynamic properties of machine systems. Different graph solutions mean connections of input and output quantities as well as constructional parameters. The method of dependence graph distribution into the game tree structure was described. Multiple vertex numeration was introduced in order to determine subordination of elements in the system, and the additional time vertex allowed to obtain the structure with the closed loop of the feedback. The obtained graph solutions were evaluated taking into account decision decomposition into single constructional and/or service parameters.

7

Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes

Gdawiec K., Domańska D.

International Journal of Applied Mathematics and Computer Science

|

2011

|

Vol. 21, no 4

757-767

EN

One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from the partitioned iterated function system. The proposed method uses local analysis of the shape, which improves the recognition rate. The effectiveness of our method is shown on two test databases. The first one was created by the authors and the second one is the MPEG7 CE-Shape-1PartB database. The obtained results show that the proposed methodology has led to a significant improvement in the recognition rate.

8

Zastosowanie grafów zależności i łańcuchów markowa w badaniu własności dynamicznych układów maszynowych

Deptuła A.

Zeszyty Naukowe. Mechanika / Politechnika Opolska

|

2010

|

z. 96

17-18

EN

The paper concerns application of dependence graphs and Markov chains for analysis and synthesis of dynamic properties of machine systems. Different graph solutions mean connections between input and output data as well as design parameters. Markov chains describe the changes of state of the system which depends on change of dependence graph into game tree-structures.

9

Badanie własności dynamicznych układów maszynowych z uwzględnieniem wielokrotnej numeracji wierzchołkowej dla drzew rozgrywających parametrycznie

Deptuła A., Partyka M. A.

Napędy i Sterowanie

|

2010

|

R. 12, nr 3

140-147

PL

W opracowaniu przedstawiono zastosowanie grafów zależności i drzew rozgrywających parametrycznie do analizy i syntezy własności dynamicznych układów maszynowych. Różne rozwiązania grafowe oznaczają powiązania wielkości wejściowych, wyjściowych oraz parametrów konstrukcyjnych. Wprowadzono szczegółowy opis zamiany rozkładu grafu zależności na strukturę drzewiastą rozgrywającą parametrycznie. Przeprowadzono ocenę informacyjną otrzymanych rozwiązań grafowych dla optymalizacji konstrukcji z uwzględnieniem dekompozycji decyzyjnej na pojedyncze parametry konstrukcyjne i/lub eksploatacyjne. Wprowadzono wielokrotną numerację wierzchołkową jednoznacznie określającą podporządkowanie elementów w układzie.

EN

The paper concerns application of dependence graphs and game tree-structures for analysis and synthesis of dynamic properties of machine systems. Different graph solutions mean connections between input and output data as well as design parameters. The paper includes a detailed description of change of dependence graph distribution into game tree-structures. The authors analysed the obtained graph solutions for optimization of structures including decision decomposition for single structuraI and/or service parameters. Multiple vertex numeration determining position of elements in the system was introduced.

10

Application of game graphs in optimization of dynamic system structures

Deptuła A., Partyka M. A.

International Journal of Applied Mechanics and Engineering

|

2010

|

Vol. 15, no 3

647-656

EN

The paper concerns the application of dependence graphs and game trees for analysis and synthesis of dynamic properties of machine systems. Various graph solutions mean connections of input and output quantities as well as design parameters. The method of the dependence graph distribution on the game tree structure was described. Introduction of an additional initial vertex renders it possible to obtain a structure with the closed loop of feedback. Thus, a dependence between the input signal and the true value of the output signal was defined. The obtained graph solutions were assessed in order to determine an acceptable solution and selection of a proper optimization procedure for the machine system.