Results 301 to 310 of about 545,262 (335)
Some of the next articles are maybe not open access.

The Topology of Shareholding Networks

2005
We study the statistical properties of the network of shareholding relationships in the Italian stock market (MIB) and in two US stock markets (NYSE and NASDAQ). The networks are found to be scale free a feature which doesn't seem to be in accord with classical theories of portfolio optimization. Several statistical properties differ across markets and
Battiston S.   +2 more
openaire   +4 more sources

Dynamics and topology of idiotypic networks

Bulletin of Mathematical Biology, 1992
Jerne's idiotypic network was previously modelled using simple proliferation dynamics and a homogeneous tree as a connection structure. The present paper studies analytically and numerically the genericity of the previous results when the network connection structure is randomized, e.g., with loops and varying connection intensities.
Gérard Weisbuch, Avidan U. Neumann
openaire   +3 more sources

OLS Identification of network topologies

IFAC Proceedings Volumes, 2011
Abstract In many applications, it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry.
Materassi Donatello   +3 more
openaire   +2 more sources

Network Topologies and Network Interconnections [PDF]

open access: possible, 2001
LonTalk supports a variety of network topologies by using different transceiver types and network interconnections. The goal of this chapter is to demonstrate the possibilities and methods at that topic. Corresponding to the LAN terminology the terms repeater, bridge, router and gateway are explained and their applicability to LonTalk is represented.
Dietmar Loy   +2 more
openaire   +1 more source

Topology of the Fittest Transportation Network

Physical Review Letters, 2000
The presence or absence of loops in the emergent transportation networks, that are characterized by a minimum overall cost, is shown to depend on the convexity of the cost function for the local transportation of material. Our results are directly applicable to a variety of situations across disciplines.
BANAVAR JR   +4 more
openaire   +4 more sources

Topologically Interpenetrating Elastometric Networks

Rubber Chemistry and Technology, 1970
Abstract Several partially interpenetrating polymeric networks (IPN) were made by combining chemically different linear elastomers. The polymer combinations were deposited as films from aqueous emulsions made by mixing the individual emulsions in equal proportions. The films were crosslinked to form two superimposed networks.
Kurt C. Frisch   +2 more
openaire   +3 more sources

Transmitting on various network topologies

Networks, 1996
Summary: Architectures for interconnection networks can be represented by graphs, while vertices represent processors and edges represent communication links between processors. We use the terms vertices and processors interchangeably. Let \(G= (V, E)\) be a graph representing the topology for an interconnection network. Let \(v_0\) be a special vertex
Ting-Yi Sung   +2 more
openaire   +3 more sources

Evolving Topologies for Network Synchronization

2010 Complexity in Engineering, 2010
In this paper we describe possible decentralized strategies to adaptively synchronize complex networks of oscillators. Firstly, we review two adaptation strategies for the coupling gains in the network, and then we describe a completely decentralized strategy to select adaptively the network edges.
DE LELLIS, PIETRO   +3 more
openaire   +3 more sources

Neural Network Topology Optimization

2005
The determination of the optimal architecture of a supervised neural network is an important and a difficult task. The classical neural network topology optimization methods select weight(s) or unit(s) from the architecture in order to give a high performance of a learning algorithm.
Attik, Mohammed   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy