Reducing complexity in tree-like computer interconnection networks
β Scribed by Javier Navaridas; Jose Miguel-Alonso; Francisco Javier Ridruejo; Wolfgang Denzel
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 676 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
When implementing dynamical systems for information processing, a well-defined set of computational primitives should be constructed to represent the state space. Based on the specific collective behavior of Freeman's computational model of the olfactory cortex, we study the computation of reduced K
A bifurcating tree-like network consists of a single inlet channel, which bifurcates over several levels to uniformly distributed microchannels that are vertically connected to a second network for fluid return. Here we introduce a one-dimensional model that considers convective heat transfer from
## Abstract In this paper we establish the exact boundary observability of unsteady flows in a treeβlike network of open canals with general topology. Copyright Β© 2008 John Wiley & Sons, Ltd.