Search results for "Network Topology"
showing 10 items of 192 documents
Locally Convex Quasi *-Algebras of Operators
2011
This note is mainly concerned with locally convex quasi C*-normed *-algebras which arise as completions of C*-algebras of operators under certain topologies. Their importance is made clear by the representation theory of abstract locally convex quasi C*-normed *-algebras, investigated in previous papers and whose basic aspects are also overviewed here.
Connectivity Influences on Nonlinear Dynamics in Weakly-Synchronized Networks: Insights from Rössler Systems, Electronic Chaotic Oscillators, Model a…
2019
Natural and engineered networks, such as interconnected neurons, ecological and social networks, coupled oscillators, wireless terminals and power loads, are characterized by an appreciable heterogeneity in the local connectivity around each node. For instance, in both elementary structures such as stars and complex graphs having scale-free topology, a minority of elements are linked to the rest of the network disproportionately strongly. While the effect of the arrangement of structural connections on the emergent synchronization pattern has been studied extensively, considerably less is known about its influence on the temporal dynamics unfolding within each node. Here, we present a compr…
Optimisation of direct digital frequency synthesisers based on CORDIC
2001
Methods to simplify digital frequency synthesizers based on the co-ordinate rotation digital computer (CORDIC) algorithm are presented. Application of these methods leads to performance enhancement, compared with the topologies previously proposed in the literature. For a given output precision, hardware resources are reduced and spur-free dynamic range is increased.
A note on Taskinen's counterexamples on the problem of topologies of Grothendieck
1989
By the work of Taskinen (see [4, 5]), we know that there is a Fréchet space E such that Lb(E, l2) is not a (DF)-space. Moreover there is a Fréchet–Montel space F such that is not (DF). In this second example, the duality theorem of Buchwalter (cf. [2, §45.3]) can be applied to obtain that and hence is a (gDF)-space (cf. [1, Ch. 12 or 3, Ch. 8]). The (gDF)-spaces were introduced by several authors to extend the (DF)-spaces of Grothendieck and to provide an adequate frame to consider strict topologies.
L-fuzzy syntopogenous structures, Part I: Fundamentals and application to L-fuzzy topologies, L-fuzzy proximities and L-fuzzy uniformities
2013
Abstract We introduce the concept of an L-fuzzy syntopogenous structure where L is a complete lattice endowed with an implicator ↦ : L × L → L satisfying certain properties (in particular, as L one can take an MV-algebra). As special cases our L-fuzzy syntopogenous structures contain classical Csaszar syntopogenous structures, Katsaras–Petalas fuzzy syntopogenous structures as well as fuzzy syntopogeneous structures introduced in the previous work of the second named author (A. Sostak, Fuzzy syntopogenous structures, Quaest. Math. 20 (1997) 431–461). Basic properties of the category of L-fuzzy syntopogenous spaces are studied; categories of L-fuzzy topological spaces, L-fuzzy proximity spac…
Relations between structure and estimators in networks of dynamical systems
2011
The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
Hub-Centered Gene Network Reconstruction Using Automatic Relevance Determination
2012
Network inference deals with the reconstruction of biological networks from experimental data. A variety of different reverse engineering techniques are available; they differ in the underlying assumptions and mathematical models used. One common problem for all approaches stems from the complexity of the task, due to the combinatorial explosion of different network topologies for increasing network size. To handle this problem, constraints are frequently used, for example on the node degree, number of edges, or constraints on regulation functions between network components. We propose to exploit topological considerations in the inference of gene regulatory networks. Such systems are often…
Resistant Microbial Cooccurrence Patterns Inferred by Network Topology
2015
ABSTRACT Although complex cooccurrence patterns have been described for microbes in natural communities, these patterns have scarcely been interpreted in the context of ecosystem functioning and stability. Here we constructed networks from species cooccurrences between pairs of microorganisms which were extracted from five individual aquatic time series, including a dystrophic and a eutrophic lake as well as an open ocean site. The resulting networks exhibited higher clustering coefficients, shorter path lengths, and higher average node degrees and levels of betweenness than those of random networks. Moreover, simulations demonstrated that taxa with a large number of cooccurrences and place…
Optimization on ports activation towards energy efficient data center networks
2018
Nowadays, Internet of thing including network support (i.e. checking social media, sending emails, video conferencing) requires smart and efficient data centers to support these services. Hence, data centers become more important and must be able to respond to ever changing service requirements and application demands. However, data centers are classified as one of the largest consumers of energy in the world. Existing topologies such as ScalNet improves the data center scalability while leading to enormous amounts of energy consumption. In this paper, we present a new energy efficient algorithm for ScalNet called Green ScalNet. The proposed topology strikes a compromise between maximizing …