modeling and simulation of processing plants are widely used in industry. construction of a mathematical model for a plant is a time-consuming and error-prone task. in light of extensive advancements in computer science (both hardware and software), computers are becoming a necessary instrument in industrial activities. many software tools for modeling, simulation and optimization of processing...

The use of end-to-end multicast traffic measurements has been recently proposed as a means to infer network internal characteristics as packet link loss rate and delay. In this paper, we propose an algorithm that infers the multicast tree topology based on these end-to-end measurements. Differently from previous approaches which make only partial use of the available information, this algorithm...

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

In this paper we propose schemes for topology aggregation in large networks. Topology aggregation is needed due to two main reasons. First, it is not possible to advertise the full topology information of a network due to the excessive complexity involved. Secondly, it may be required to keep the internal topology hidden for security reasons. The main issue in topology aggregation is, given a n...

in this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  and we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. also, we prove that  right and product stabilizers are filters and if they are ...

In nonstandard topology we can describe a given topology by the neighbourhood-monads of the standard points (see Sari, chapter 6 in Diener and Diener [2]). Calling an internal point near-standard if it is contained in the neighbourhood-monad of some standard point and remote otherwise we give some statements about locally finite families and paracompact spaces in terms of nearstandard and remot...

We present a generic topology library that is based on topological space and combinatorial properties. A notation is introduced whereby data structures can be described by their topological cell dimensions and internal combinatorial properties. A common interface for different types of data structures is presented. Various issues of iteration of these data structures can be explained from the t...