Deep Hierarchical Networks

2012 ◽  
pp. 915-915
Keyword(s):  
Hierarchical Networks

The Political Economy of Rural-Urban Conflict

2017 ◽  
Author(s):  
Topher L. McDougal
Keyword(s):  
Political Economy ◽  
Urban Areas ◽  
The State ◽  
Hierarchical Networks ◽  
Capital Cities ◽  
Trade Networks ◽  
Rural And Urban Areas ◽  
Rural And Urban ◽  
Economic Relationship ◽  
Relationship Of

In some cases of insurgency, the combat frontier is contested and erratic, as rebels target cities as their economic prey. In other cases, it is tidy and stable, seemingly representing an equilibrium in which cities are effectively protected from violent non-state actors. What factors account for these differences in the interface urban-based states and rural-based challengers? To explore this question, this book examines two regions representing two dramatically different outcomes. In West Africa (Liberia and Sierra Leone), capital cities became economic targets for rebels, who posed dire threats to the survival of the state. In Maoist India, despite an insurgent ideology aiming to overthrow the state via a strategy of progressive city capture, the combat frontier effectively firewalls cities from Maoist violence. This book argues that trade networks underpinning the economic relationship between rural and urban areas—termed “interstitial economies”—may differ dramatically in their impact on (and response to) the combat frontier. It explains rebel predatory tendencies toward cities as a function of transport networks allowing monopoly profits to be made by urban-based traders. It explains combat frontier delineation as a function of the social structure of the trade networks: hierarchical networks permit elite–elite bargains that cohere the frontier. These factors represent what might be termed respectively the “hardware” and “software” of the rural–urban economic relationship. Of interest to any student of political economy and violence, this book presents new arguments and insights about the relationships between violence and the economy, predation and production, core and periphery.

Fuzzy-set-based hierarchical networks for information fusion in computer vision

1992 ◽  
Vol 5 (2) ◽  
pp. 335-350 ◽  
Author(s):  
Raghu Krishnapuram ◽  
Joonwhoan Lee
Keyword(s):  
Computer Vision ◽  
Information Fusion ◽  
Fuzzy Set ◽  
Hierarchical Networks

scholarly journals Percolation of hierarchical networks and networks of networks

2018 ◽  
Vol 98 (5) ◽  
Author(s):  
Louis M. Shekhtman ◽  
Shlomo Havlin
Keyword(s):  
Hierarchical Networks

Experiments on Hierarchical Networks

2019 ◽  
pp. 373-386
Author(s):  
Rui Valadas
Keyword(s):  
Hierarchical Networks

scholarly journals Lifetime and Energy Efficiency Improvement Techniques for Hierarchical Networks

2019 ◽  
Vol 9 (1S6) ◽  
pp. 62-72
Keyword(s):  
Cost Effective ◽  
Residual Energy ◽  
Efficiency Improvement ◽  
Hierarchical Networks ◽  
Energy Efficiency Improvement ◽  
Battery Capacity ◽  
Time Scheduling ◽  
Network Operation ◽  
Simulation Results ◽  
Hole Detection

The detection points are the detection points in the space of network. The properties of detection points include cost effective materials and longer battery capacity. WSN can span variety of applications like sensing of data related to environment entities, detection of enemy vehicles. Lifetime ratio defines the efficiency of the WSN network operation. There are multiple techniques which can help in improvement of Network Lifetime (NL) spanning from transmission nature, data connections, formation of System and time scheduling. This paper provides the analysis of how energy consumption happens and its effect on lifetime ratio. LEACH and CHEF algorithms responsible for hierarchical kind of routing are discussed in detail with simulation results. The parameters used for comparison includes delay, hops, consumption of energy. Non-Hole detection points, Hole detection points, Non-Hole to Hole Ratio, residual energy, routing overhead and throughput.

scholarly journals A Note on a New General Family of Deterministic Hierarchical Networks

2019 ◽  
Vol 19 (02) ◽  
pp. 1950005
Author(s):  
C. DALFÓ ◽  
M. A. FIOL
Keyword(s):  
Real Life ◽  
Small Diameter ◽  
Stochastic Methods ◽  
Local Algorithm ◽  
Hierarchical Networks ◽  
Binomial Tree ◽  
Scale Free ◽  
Local Clustering ◽  
Specific Rule

It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarchical. Although most of the models are based on stochastic methods, some deterministic constructions have been recently proposed, because this allows a better computation of their properties. Here a new deterministic family of hierarchical networks is presented, which generalizes most of the previous proposals, such as the so-called binomial tree. The obtained graphs can be seen as graphs on alphabets (where vertices are labeled with words of a given alphabet, and the edges are defined by a specific rule relating different words). This allows us the characterization of their main distance-related parameters, such as the radius and diameter. Moreover, as a by-product, an efficient shortest-path local algorithm is proposed.

Sign in / Sign up

Export Citation Format

Share Document