Wyniki wyszukiwania - BazTech

1

Distance Education as an Object of Study and Reflection of Pedagogy in Poland

Tanaś M.

International Journal of Electronics and Telecommunications

|

2015

|

Vol. 61, No. 3

237-243

EN

The digitization of the media, their software and hardware combination of computers and the development of networks and their dissemination have made distance learning the subject of research, implementation of practical and scientific reflection once again. Those actions are promoted not only by the development of ICT, but also by progressive globalization, demographic changes and economic and cultural challenges. The scientific discourse is also a part of Polish experiences. The previous treatment of the subject of this paper were historical in nature, fragmentary or were descriptions of individual experiments and experiences of individual universities. Presented approach has not only a synthetic character, but also provides an outline of the original, the Polish concept of teaching - blended learning.

2

Complexity of scheduling of coupled tasks with chains precedence constraints and constant even length of the gap

Ecker K., Tanaś M.

Foundations of Computing and Decision Sciences

|

2007

|

Vol. 32, No. 3

199-212

EN

The coupled tasks scheduling was originally introduced for modelling complex radar devices. It is still used for controlling such devices and applied in similar applications. This paper considers a problem of coupled tasks scheduling on one processor, under the assumptions that all processing times are equal to 1, the gap has an exact even length and the precedence constraints are strict. Although it is proven that the problem stated above is NP-hard in the strong sense if the precedence constraints have a form of a general graph, it is possible to solve some of its relaxed versions in polynomial time. This paper containts a solution for the problem of coupled tasks scheduling with assumption that the precedence constraints graph has a form of chains and it presents an algorithm which can solve the problem with such assumption in time O(n log n).

3

Scheduling coupled tasks on a single processor

Błażewicz J., Ecker K., Kis T., Tanaś M.

Zeszyty Naukowe. Automatyka / Politechnika Śląska

|

2002

|

z. 134

53-66

EN

This paper considers a problem of coupled task scheduling on one processor, where all processing times are equal to 1, the gap has exact length h, precedence constraints are strict and the criterion is to minimize the schedule length. This problem is introduced e.g. in systems controlling radar operations. We show that the general problem is NP-hard. This paper also shows a fast approximation algorithm for chain precedence constraints.

PL

W referacie zaprezentowano problem szeregowania zadań sprzężonych na jednym procesorze, z jednostkowymi czasami wykonywania operacji, stałą długością przerwy pomiędzy operacjami, gdzie celem jest minimalizacja długości uszeregowania. Problem ten często występuje w praktyce w systemach sterowania urządzeniami radarowymi. W referacie pokazujemy NP-trudność problemu w przypadku ogólnych ograniczeń kolejnościowych oraz szybki algorytm aproksymacyjny dla ograniczeń kolejnościowych typu "łańcuch".