|Most engineering systems are designed on the basis of a steady, or static, state. However, dynamic e ects must also be considered. This paper presents GABSys (Genetic Algorithm-Bond Graph System), a tool for approximating design optimality for multi-dimensional dynamic systems. Although GABSys does require the assistance of an engineer, it can be used to \automatically" generate solutions to d...

Given a locally finite connected infinite graph G, let the interval [pmin(G), pmax(G)] be the smallest interval such that if p > pmax(G) then every 1-independent bond percolation model on G with bond probability p percolates, and for p < pmin(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in p...

Bond graphs offer a domain-neutral graphical technique for representing power flows in a physical system. They are particularly powerful for representing systems that operate in multiple energy domains, such as thermal models of electronic circuits, mechanical vibrations in acoustic systems, etc. A bond graph library was created for Modelica with graphical Dymola support. The library is present...

Abstract A novel method of modeling centrifugal compression systems for surge control purposes by using bond graphs is presented. By using the bond graph method, we get a simple description of compression systems based on physical phenomena and it is straight forward to get the dynamic equations. It is demonstrated that several active surge control methods can be represented by the same bond gr...

The work analyses typical uses of attribute-like relations in conceptual graphs and identifies general sources of failure to convey intended meaning. These include relations that do not contain a semantic bond between their arguments, semantically superfluous concept types, and confusion between first-order and second-order levels. The analysis focuses on the semantics of physical quantities an...

The existence or nonexistence of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree correlations and their connection with spreading phenomena. We obtain some general expressions that allow the computation of the transition threshold...

I’d like to take a moment to follow up on our observations about percolation in real-world graphs from last lecture. First, I should say that the phenomenon that we observed–that these graphs did not evidence a sharp threshold–seems to be pretty well understood. Newman (the book) has an analysis of situtations like this under the configuration model, which I’ll explain in a moment, but under no...

We show that usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of Nash-Williams’s theorem on cycle-decomposition of graphs, and finally we obtain some new decomposition the...

By an eigenvalue comparison-technique[20], the expected return probability of the delayed random walk on critical Bernoulli bond percolation clusters on the twodimensional Euclidean lattice is estimated. The results are generalised to invariant percolations on unimodular graphs with almost surely finite clusters. The approach involves using the special property of cartesian products of finite g...

In this paper, we prove that every contraction-critical 2-connected infinite graph has no vertex of finite degree and contains uncountably many ends. Then, by investigating the distribution of contractible edges in a 2-connected locally finite infinite graph G, we show that the closure of the subgraph induced by all the contractible edges in the Freudenthal compactification of G is 2-arc-connec...