In this article, we propose a PI passivity-based controller, applicable to large class of switched power converters, that ensures global state regulation desired equilibrium point. A solution problem requires full state-feedback, which makes it practically unfeasible. To overcome limitation construct observer is implementable with measurements are available in practical applications. The recons...

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...

Proxel-based simulation is a new and deterministic approach to analysing discrete stochastic models and studying their behaviour. Unfortunately, as it is the case with the deterministic approaches it suffers from the well-known state-space explosion problem, nevertheless having an advantage with respect to the other approaches. The proxelbased method benefits from the way it generates and store...

Cross-app collaboration via inter-component communication is a fundamental mechanism on Android. Although it brings the benefits such as functionality reuse and data sharing, a threat called component hijacking is also introduced. By hijacking a vulnerable component in victim apps, an attack app can escalate its privilege for originally prohibited operations. Many prior studies have been perfor...

The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations that are faster in the uncontended case. Pragmatic contention management techniques appear to be effective at facilitating progress in practice, but, as far as we know, none guarantees progress. We present a transformation that ...

Cantor’s diagonalization idea: reminder. Most mathematicians are familiar with diagonalization from Cantor’s proof that the set of all real numbers is not countable. Indeed, if it was countable, i.e., if we could enumerate all (decimal) real numbers d1d2 . . . di.f1 . . . fj . . . into a sequence d (k) 1 d (k) 2 . . . d (k) i .f (k) 1 . . . f (k) j . . ., k = 1, 2, . . ., then we would be able ...

A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains constructed with the squaring function which gives the possibility to construct a one-way chain of whose length is unbounded in practice. Although the computational cost is somewhat increased, compared to the use of hash...