Wyniki wyszukiwania - BazTech

1

Model systemu do przekształceń formuł algorytmów

Markuszewski T.

Pomiary Automatyka Kontrola

|

2011

|

R. 57, nr 2

201-204

PL

W artykule przedstawiono budowę złożonego komputerowego systemu do przekształceń formuł algorytmów przy wykorzystaniu właściwości operacji algebry algorytmów. Budowany model systemu nazwano komputerowym systemem optymalizacji (KSO) i dokonano jego dekompozycji na dwóch poziomach, poziomie systemu i podsystemu. Na poziomie systemu w logiczny sposób wyodrębniono podsystemy pełniące oraz wspomagające zadania optymalizacji formuł algorytmów, a na poziomie podsystemu utworzono unitermy zmienne i funkcyjne. Dla opisania modelu systemu wykorzystano algebrę algorytmów. Fragment modelu systemu zaimplementowano w języku C#.

EN

The model of algorithm algebra formulae optimization system is presented in the paper. The decomposition of the system into subsystems is performed using algebra algorithm expressions, and is described in terms of the expressions. The following algorithm algebra operation optimization subsystem models are formed: sequencing, elimination, parallelization, reversing, cycle operations, basic subsystem, subsystem introducing additional condition, subsystem rendering data accessible, and the one generating indices for xml code of algorithm formula. The basic subsystem model and the rendering data accessible one in the 3rd section there are described. Algorithm algebra expressions there are used consistently. Models are composed of variables and functional uniterms, which are also used by other subsystems. Variables are used for the data storage. Functional uniterms of the basic subsystem there are the following: extracting, substituting the xml code fragment, checking the separator kind in the uniterm, as well as the one checking if the uniterm is a number. Additionally there are included functional uniterms absorbing other uniterms, and the one informing on optimization process run. The basic and rendering data models are implemented in C# . In conclusions some advantages of both the algorithm formula optimization computer system and model decomposition into subsystem are given. Bibliography contains a set of intuitive and formal works describing the algorithms algebra.

2

Algebra algorytmów w przykładach

Piaskowy A.

Pomiary Automatyka Kontrola

|

2010

|

R. 56, nr 2

189-192

PL

Artykuł zawiera opis podstawowych operacji algebraicznych jakie można stosować w algorytmice. Przedstawiono kilka prostych przykładów ilustrujących możliwości i aplikacje tematyki. Każda operacja została odzwierciedlona w języku C, bądź została porównana z odpowiadającym jej schematem blokowym.

EN

Algebra of algorithms is a form of mathematical description of an algorithm. The algorithm described in form of formulas can be subjected to algebraic operations and transformations. Properties of these operations are defined in an axiomatic way. The mathematic description of the algorithm is simple, intuitive, and allows to subsequent automatic generation of program code. The main advantage of such approach is possibility to analyze the algorithm at any level of nesting. Some functions (blocks) the algorithm can be treated as uniterms, thus one can look into what happens inside them. A description of basic algebraic operations that can be applied in the study of algorithm operations is presented in the paper. It has been quoted two of the most elementary examples in order to better acquaint with the subject. Each operation is reflected in the C language, and is compared with the corresponding block diagram. Langton algorithm is analyzed as well as the function approximation algorithm for finding the 3-rd order polynomial. These algorithms are described and presented in the form of block diagrams as well as using formulas of algebra algorithms.

3

Comparison Of Three Algorithms For Assignment Of Drivelane Gains In A Selected Traffic Network

Ruchaj M.

Zeszyty Naukowe. Elektryka / Politechnika Opolska

|

2009

|

z. 62

61-62

EN

This paper presents a comparison of three algorithms for assigning the drivelane gains: the longest queue algorithm, the relative longest queue algorithm and the most congested node algorithm. For the comparison two factor are specified: total waiting queue length vs. time and average waiting time vs. time.