Temat: mechanisms - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Extending the UML for modelling variability for system families
Autorzy:: Robak, S.
Franczyk, B.
Politowicz, K.
Powiązania:: https://bibliotekanauki.pl/articles/907979.pdf
Data publikacji:: 2002
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informatyka
object-oriented software engineering
system families
commonality and variability
feature diagram
UML extensibility mechanisms
Opis:: The process of modelling and developing commonality and variability for system families should be supported by suitable methods and notations. The object-oriented methods and their notations, which are used at present, focus on the development of a single system at a time. In this paper we analyse feature models as a representation of the common parts and variants contained in a system family, and propose using a feature diagram as a basic representation of commonality, variability and dependencies. We examine various approaches to customizing the standard modelling language UML to model system families and propose how to extend the UML for the purposes of modelling variants in object-oriented analysis and design techniques. We recommend the use of UML standard lightweight extensibility mechanisms (stereotypes combined with tagged values) without changing the UML metamodel. This enables us to join the advantages of feature models with UML and provides the traceability of a concept throughout system development. An application of lightweight UML extension mechanisms allows the existing standard UML modelling tools to be used without any adaptations. An example of an application illustrates our approach.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 285-298
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Redundancy-based intrusion tolerance approaches moving from classical fault tolerance methods
Autorzy:: Di Giandomenico, Felicita
Masetti, Giulio
Chiaradonna, Silvano
Powiązania:: https://bibliotekanauki.pl/articles/2172130.pdf
Data publikacji:: 2022
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: intrusion tolerance
cyberattack
diversity based redundancy
protection mechanisms
tolerancja na włamania
atak cybernetyczny
mechanizm ochronny
Opis:: Borrowing from well known fault tolerant approaches based on redundancy to mask the effect of faults, redundancy-based intrusion tolerance schemes are proposed in this paper, where redundancy of ICT components is exploited as a first defense line against a subset of compromised components within the redundant set, due to cyberattacks. Features to enhance defense and tolerance capabilities are first discussed, covering diversity-based redundancy, confusion techniques, protection mechanisms, locality policies and rejuvenation phases. Then, a set of intrusion tolerance variations of classical fault tolerant schemes (including N Version Programming and Recovery Block, as well as a few hybrid approaches) is proposed, by enriching each original scheme with one or more of the previously introduced defense mechanisms. As a practical support to the system designer in making an appropriate choice among the available solutions, for each developed scheme a schematic summary is provided, in terms of resources and defense facilities needed to tolerate f value failures and k omission failures, as well as observations regarding time requirements. To provide an example of more detailed analysis, useful to set up an appropriate intrusion tolerance configuration, a trade-off study between cost and additional redundancy employed for confusion purposes is also carried out.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 701--719
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Architectures of Granular Information and Their Robustness Properties: a Shadowed Sets Approach
Autorzy:: Pedrycz, W.
Powiązania:: https://bibliotekanauki.pl/articles/908294.pdf
Data publikacji:: 1999
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informacja szczegółowa
zbiór rozmyty
dane zaszumione
niepewność
multiplekser
information granulation and information granules
fuzzy sets
shadowed sets
noisy data
uncertainty
generalized multiplexer
switching mechanisms
Opis:: This paper addresses an important issue of information of granulation and relationships between the size of information granules and the ensuing robustness aspects. The use of shadowed sets helps identify and quantify absorption properties of set-based information granules. Discussed is also a problem of determining an optimal level of information granulation arising in the presence of noisy data. The study proposes a new architecture of granular computing involving continuous and granulated variables. Numerical examples are also included.
Źródło:: International Journal of Applied Mathematics and Computer Science; 1999, 9, 2; 435-455
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: A hierarchical decomposition of decision process Petri nets for modeling complex systems
Autorzy:: Clempner, J.
Powiązania:: https://bibliotekanauki.pl/articles/907753.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: hierarchia
rozkład
składnik wielokrotnego użycia
proces decyzyjny
stabilność
optymalizacja
metoda Lyapunova
DPPN
hierarchy
decomposition
structuring mechanisms
re-usable components
decision process
stability
Lyapunov methods
optimization
Opis:: We provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the mark-dynamic properties, we show that the HDPPN theoretic notions of (local and global) equilibrium and stability are those of the DPPN. As a result in the trajectory-dynamic properties framework, we obtain equivalent characterizations of that of the DPPN for final decision points and stability. We show that the HDPPN mark-dynamic and trajectory-dynamic properties of equilibrium, stability and final decision points coincide under some restrictions. We propose an algorithm for optimum hierarchical trajectory planning. The hierarchical decomposition process is presented under a formal treatment and is illustrated with application examples.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 349-366
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "mechanisms" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język