The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Bifurcation analysis is performed to a power-factor-correction (PFC) boost converter to examine the fast-scale instability problem. Computer simulations and analysis reveal the po...
C. K. Michael Tse, Octavian Dranga, Herbert H. C. ...
In financial risk management, a coherent risk measure equals the maximum expected loss under several different probability measures, which are analogous to systems in ranking and ...