Wyniki wyszukiwania - BazTech

1

Extended distributive contact lattices and extended contact algebras

Ivanova Tatyana

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

69--75

EN

The notion of contact algebra is one of the main tools in mereotopology. This paper considers a generalisation of contact algebra (called extended distributive contact lattice) and the so called extended contact algebras which extend the language of contact algebras by the predicates covering and internal connectedness.

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

Models for dependable computation with multiple inputs and some hardness results

Wang Y., Desmedt Y., Burmester M.

Fundamenta Informaticae

|

2000

|

Vol. 42, Nr 1

61-73

EN

We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While there is a polynomial time algorithm for finding vertex disjoint paths in networks, we will show that the equivalent problem in computation systems with multiple inputs is NP-hard. Our main results are as follows. We present a general model for fault tolerant computation systems with multiple inputs: AND/OR graphs. We show that it is NP-hard to find two vertex disjoint solution graphs in an AND/OR graph. It follows that in the general case redundancy cannot help to achieve survivability, assuming P= NP.

4

Teoria złożoności i jej implikacje dla zarządzania organizacjami

Muszyński W.

Management

|

1999

|

Vol. 3, no 2

43-56

PL

Punktem wyjścia dla przedstawionych w pracy koncepcji jest założenie, że organizacje są z systemowego punktu widzenia, złożonymi dynamicznymi systemami nieliniowymi. W rezultacie tego założenia sformułowano i omówiono wybrane zasady i reguły jakie mogą znaleźć zastosowanie w procesach zarządzania organizacjami. Przedstawiono praktyczne zastosowania tych zasad jako ilustrację sukcesu nowych idei w zarządzaniu organizacjami.

EN

The starting point to the concept presented in this paper is the assumption that organizations are nonlinear complex dynami systems. In the result of this assumption selected principles and rules for management have been formulated and discussed. As an illustration of the new management ideas examples of these principles' and rules' applications have been presented.