We consider a queueing system with multiple heterogeneous servers serving a multiclass population. The classes are distinguished by time costs. All customers have i.i.d. service requirements. Arriving customers do not see the instantaneous queue occupancy. Arrivals are randomly routed to one of the servers and the routing probabilities are determined centrally to optimize the expected waiting c...

This paper proposes a connection weighting scheme of a complex-valued Hopfield neural network for associative memory constrained by given attractive domain. Both equilibrium conditions and stability analysis results are used in the synthesis procedure. We solve the equilibrium equation by singular value decomposition technique and obtain a general solution of the connection weight matrix with a...

For the nonlinear analysis of structures using the well known Newton-Raphson Method, the tangent stiffness matrices of the elements must be constructed in each iteration. Due to the high expense required to find the exact tangent stiffness matrices, researchers have developed novel innovations into the Newton-Raphson method to reduce the cost and time required by the analysis. In this paper, a ...

Linear response analysis in the nonequilibrium steady state (Gaussian regime) provides two independent fluctuation-response relations. One, in the form of the symmetric matrix, manifests the departure from the equilibrium formula through the quantity so-called irreversible circulation. The other, in the antisymmetric form, connects the asymmetries in the fluctuation and the response function. T...

A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke– Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-d...