We present an automated formulation mechanism that facilitates the inclusion of batches of geometrically distributed size in Markov modulated, multiprocessor queues of finite or infinite capacity. This provides a practical approach for the analytical modelling of many present day communication and computer systems, e.g. the Internet and mobile networks. Geometric distributions can be scaled and...

We illustrate several adaptive algorithms for the solutions of bi-infinite singular linear systems. Such algorithms are realized from exact iterative schemes (e.g., Richardson, steepest-descent methods, matching pursuit) by finite dimensional approximations of each iteration, performed with a greedy approach. We show that these algorithms are convergent and optimal with respect to certain spars...

It is known that many integrable systems can be reduced from self-dual Yang-Mills equations. The formal solution space to the self-dual Yang-Mills equations is given by the so called ADHM construction, in which the solution space are graded by vector spaces with dimensionality concerning topological index. When we consider a reduced self-dual system such as the Bogomol’nyi equations, in terms o...

Port based network modeling of complex lumped parameter physical systems naturally leads to a generalized Hamiltonian formulation of its dynamics. The resulting class of open dynamical systems are called “Port-Hamiltonian systems” [12] which are defined using a Dirac structure, the Hamiltonian and dissipative elements. This formulation has been successfully extended to classes of distributed pa...