Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  system structure
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Queuing system with variable server number
100%
|
|
tom nr 4
63-65
EN
Description of main characteristics of Mass Maintenance Systems is given. Problems of queuing system effectiveness due to loss of time for both arrivals while waiting for service and for servers waiting for arrivals are discussed. System with changeable number of servers is proposed. Calculations are made in order to find out what is influence of main queuing system parameters on the total operational cost regarding time losses. It is shown that decision about system structure depends mainly on system service index and server initial cost.
2
Content available remote Monomial subdigraphs of reachable and controllable positive discrete-time systems
88%
|
|
nr 1
159-166
EN
A generic structure of reachable and controllable positive linear systems is given in terms of some characteristic components (monomial subdigraphs) of the digraph of a non-negative a pair. The properties of monomial subdigraphs are examined and used to derive reachability and controllability criteria in a digraph form for the general case when the system matrix may contain zero columns. The graph-theoretic nature of these criteria makes them computationally more efficient than their known equivalents. The criteria identify not only the reachability and controllability properties of positive linear systems, but also their reachable and controllable parts (subsystems) when the system does not possess such properties.
EN
The paper concerns application of dependence graphs and parametric game trees for analysis and synthesis of dynamic properties of machine systems. Different graph solutions mean connections of input and output quantities as well as constructional parameters. The method of dependence graph distribution into the game tree structure was described. Multiple vertex numeration was introduced in order to determine subordination of elements in the system, and the additional time vertex allowed to obtain the structure with the closed loop of the feedback. The obtained graph solutions were evaluated taking into account decision decomposition into single constructional and/or service parameters.
PL
W referacie przedstawiono założenia do budowy modelu Systemu Logistycznego Polski (LSP). Wyróżniono elementy punktowe oraz liniowe modelu. Zastosowano formalizację matematyczną do opisu jego struktury. Przedstawiono założenia do budowy modelu LSP oraz założenia ogólne odwzorowania struktury LSP. Następnie zaprezentowano odwzorowanie elementów LSP i powiązań transportowych między nimi w formie analitycznej i graficznej.
EN
The paper presents assumptions for the construction of Logistics System of Poland (LSP) Model. The point-wise and line-wise elements of the model are highlighted. The mathematical formalization was applied to describe its structure with assumptions for constructing LSP model as well as general assumptions for LSP structure mapping. Then the mapping of LSP elements and connections between them was presented in analytical and graphical form.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.