Many of the network topology design problems include CMST, which means to find a minimum cost tree that connects all the nodes of the network to the central node with some capacity constraint. The links of edges have associated costs that could be based on their distance, capacity, quality of line etc, and the nodes have their associated demand. Usually most of the network obtained from CMST ar...

Presented to the Society, December, 1955 under the title ^4 necessary condition for nonoscillation of a system of second order differential equations, and August, 1956; received by the editors August 2, 1956. 1 These results were obtained while the author held a National Science Foundation grant, NSF-G1825 and was at Yale University. Now at the University of Utah. 2 This paper contains a biblio...

We solve by a genetic algorithm (GA), three NPhard, constrained, minimal spanning tree (MST) problems on a complete graph using a novel encoding for the genotype which ensures feasibility of the search space when performing crossover and mutation and when initializing the population. By employing a feasible encoding the standard, mainstream, GA paradigm is preserved allowing us to capture the f...

INTRODUCTION Atypical hemolytic uremic syndrome (aHUS) is a rare thrombotic microangiopathy characterized by overactivation of the alternative complement pathway. This syndrome is associated with severe clinical manifestations, a tendency to recur, and, until recently, a poor long-term prognosis (Noris & Remuzzi, 2009). With conventional supportive therapy, the expected rate of graft failure af...

In this article, we analyze the oscillation behavior of half-linear differential equation $$\big( r(t) t^{p-1} \Phi(x')\big)' + \frac{s(t)}{t \log^pt} \Phi(x) = 0, \quad \Phi(x)=|x|^{p-1}\text{sgn} x, p > 1. $$ Applying modified Prufer angle and a general averaging technique over unbounded intervals, prove an criterion for studied equation. We point out that presented is new even in linear c...

Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from end-to-end path metrics between OD (Origin – Destination) pairs. The approac...