Abstract: This paper deals with using of prevailing operation
system MS Office (SmartArt...) for mathematical models, using
DYVELOP (Dynamic Vector Logistics of Processes) method. It
serves for crisis situations investigation and modelling within the
organizations of critical infrastructure. In first part of paper, it will be
introduced entities, operators, and actors of DYVELOP method. It
uses just three operators of Boolean algebra and four types of the
entities: the Environments, the Process Systems, the Cases, and the
Controlling. The Process Systems (PrS) have five “brothers”:
Management PrS, Transformation PrS, Logistic PrS, Event PrS and
Operation PrS. The Cases have three “sisters”: Process Cell Case,
Use Case, and Activity Case. They all need for the controlling of
their functions special Ctrl actors, except ENV – it can do without
Ctrl. Model´s maps are named the Blazons and they are able
mathematically - graphically express the relationships among entities,
actors and processes. In second part of this paper, the rich blazons of
DYVELOP method will be used for the discovering and modelling of
the cycling cases and their phases. The blazons need live PowerPoint
presentation for better comprehension of this paper mission. The
crisis management of energetic crisis infrastructure organization is
obliged to use the cycles for successful coping of crisis situations.
Several times cycling of these cases is necessary condition for the
encompassment for both emergency events and the mitigation of
organization´s damages. Uninterrupted and continuous cycling
process brings for crisis management fruitfulness and it is good
indicator and controlling actor of organizational continuity and its
sustainable development advanced possibilities. The research reliable
rules are derived for the safety and reliable continuity of energetic
critical infrastructure organization in the crisis situation.
Abstract: The notions of I-vague normal groups with membership
and non-membership functions taking values in an involutary dually
residuated lattice ordered semigroup are introduced which generalize
the notions with truth values in a Boolean algebra as well as those
usual vague sets whose membership and non-membership functions
taking values in the unit interval [0, 1]. Various operations and
properties are established.
Abstract: Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
Abstract: The notions of I-vague groups with membership and
non-membership functions taking values in an involutary dually
residuated lattice ordered semigroup are introduced which generalize
the notions with truth values in a Boolean algebra as well as those
usual vague sets whose membership and non-membership functions
taking values in the unit interval [0, 1]. Moreover, various operations
and properties are established.