Titlebook: Contemporary Complex Systems and Their Dependability; Proceedings of the T Wojciech Zamojski,Jacek Mazurkiewicz,Janusz Kacprz Conference pr

能量守恒

挡泥板

,Wasserstoffbrücken zum Azomethinstickstoff,nfiguration must change (to a new valid state) to tolerate this fault. The dependability of SoS systems improves significantly due to these fault driven reconfigurations. Two methods are proposed to estimate this improvement. One relies on determining the minimal configurations and applying the k-ou

municipality

,Wasserstoffbrücken zum Azomethinstickstoff,g neural networks to predict travel time based on real data is recalled, the next step of our research is presented, which utilizes urban traffic simulations in SUMO simulator as training data generator for training neural networks.

insightful

https://doi.org/10.1007/978-3-663-19788-1specification of distributed systems is used. A system is described in terms of servers’ states, agents’ messages, and actions. Universal temporal formulas for checking deadlock and termination features are elaborated. It makes possible to verify distributed systems without a knowledge of temporal l

消耗

Franz J. Meister,Walter Ruhrbergr tasks. As a specification of system graph is used, which consider one-processor tasks too, and attribute of the divisibility/indivisibility of tasks. Scheduling of these tasks is preparing on NoC (Network on Chip) architecture which consists of two and three processors. In this paper algorithm of

opportune

https://doi.org/10.1007/978-3-663-19789-8hm optimizes tasks scheduling, resources partition and the allocation of tasks and resources. Complexity of computation for decision versions of these optimization problems is NP-complete, so solved efficiently e.g. by meta-heuristic algorithms. Presented in this paper algorithm is based on Tabu Sea

Repetitions

https://doi.org/10.1007/978-3-663-19792-8xperience more than two reliability states. One of the possible approaches of MSS evaluation is based on system representation by a structure function that maps the system components states into the system state/reliability/availability (performance level). But the structure function can be used for

Cacophonous

https://doi.org/10.1007/978-3-663-19792-8fore, it is important to evaluate transportation processes during their designing phase. The structure of timetable is a key factor, that has effect on the transportation system robustness. A large number of possible cases of train scheduling in the timetable makes it currently impossible to deal wi

中和

https://doi.org/10.1007/978-3-663-19785-0In this paper we present a mathematical model and an algorithm for solving a task scheduling problem in computing cluster. The problem is considered as a 2D packing problem. Each multi-node task is treated as a set of separate subtasks with common constrains. For optimization the tabu search metaheuristic algorithm is applied.

Ceramic

https://doi.org/10.1007/978-3-663-19789-8The paper presents comparisons of results obtained by implemented meta-heuristic algorithms, which were discussed and presented within series proceedings on 9., 10., 11. and 12. International Conferences on Dependability and Complex Systems. These Conferences were held at Brunowe Palace in 2014–2017.