For a partially unknown linear systems, we present systematic control design approach based on generated data from measurements of closed-loop experiments with suitable test controllers. These are used to improve the achieved performance and reduce uncertainty about parts system. This is through parametrization auspicious controllers convex relaxation techniques robust control, which guarantees...

This article considers the problem of identifying guarantees rights employer as a separate category. In its normative definition, concept guarantee (Art. 164 Labor Code Russian Federation) has been lacking any reference to employer, but this does not mean that employer’s powers can be exercised without compliance with legal resources and means. Here, employee’s responsibilities are dubbed group...

Providing model explanations has gained significant popularity recently. In contrast with the traditional feature-level explanations, concept-based can provide in form of high-level human concepts. However, existing explanation methods implicitly follow a two-step procedure that involves intervention. Specifically, they first need to be involved define (or extract) concepts, and then manually c...

We1 propose a mechanism for providing long term quality of service in deflection networks. Our proposed protocol is in fact a call admission control (CAC) scheme based on session probing combined with a feedback technique that allows a station originating a new session to notify other stations about its bandwidth requirements. This CAC scheme works in an environment in which there are no explic...

Considerable amounts of data, including process event data, are collected and stored by organisations nowadays. Discovering a process model from recorded process event data is the aim of process discovery algorithms. Many techniques have been proposed, but none combines scalability with quality guarantees, e.g. can handle billions of events or thousands of activities, and produces sound models ...

We show that for any data set in any metric space, it is possible to construct a hierarchical clustering with the guarantee that for every k, the induced k-clustering has cost at most eight times that of the optimal k-clustering. Here the cost of a clustering is taken to be the maximum radius of its clusters. Our algorithm is similar in simplicity and efficiency to common heuristics for hierarc...