Recent results for semiproper systems are extended. The notion of prime decompositions for semiproper systems is introduced and used to derive a necessary and sufficient stability criterion for a subclass of semiproper systems. It is shown that a previously developed spatial decomposition procedure can be used to obtain a prime decomposition. In addition toâ€¦ (More)

2009 WRI World Congress on Computer Science andâ€¦

2009

Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between theâ€¦ (More)

Given a weighted directed hypergraph H = (V,EH ;w), where w : EH â†’ R+, we consider the problem of embedding all weighted directed hyperedges on a mixed cycle, which consists of undirected and directed links. The objective is to minimize the maximum congestion of any undirected or directed link in the mixed cycle. In this paper, we first formulate this newâ€¦ (More)

A time-varying linear dynamical system of the form dx/dt=A(t)x is said to be proper if A(t)=f(t,G), for some (scalar) primitive function f(t, lambda ) and (constant) generating matrix G. In a recent (1987) paper, the authors showed that finite-form analytic solutions and stability information for proper systems dx/dt=A(t)x can be obtained using theâ€¦ (More)

This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial algorithm for the GCEP problem, no matter the graph is acyclic or not. Furthermore, we investigate twoâ€¦ (More)