𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A combinatorial problem related to distributed loop networks

✍ Scribed by D.-Z. Du; D. F. Hsu; Qiao Li; Junming Xu

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
414 KB
Volume
20
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
✍ Dingyi Pei πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 433 KB πŸ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

A conductivity-dependent phase transitio
A conductivity-dependent phase transition from closed-loop to open-loop dendritic networks
✍ David Smyth; Alfred HΓΌbler πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 103 KB

## Abstract Motivated by a principle of minimum dissipation per channel length, we introduce a model for branching, hierarchical networks in an open, dissipative system. Global properties of the resulting structures are observed to scale with the ratio of conductivity in the dendrite material to co

A unified approach to network location p
A unified approach to network location problems
✍ Nickel, Stefan; Puerto, Justo πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 124 KB πŸ‘ 2 views

In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci

A neural network approach to tiling prob
A neural network approach to tiling problems
✍ T. Tambouratzis πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has

An asymptotic-numerical approach to the
An asymptotic-numerical approach to the coronal loop problem
✍ F. Verhulst; P. A. Zegeling πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 331 KB

## Abstract The coronal loop problem is characterized by mixed boundary conditions and the loop length condition, which is global. Using singular perturbation methods one can identify and construct two boundary layers at the base of the loop. Extending this to a combined asymptotic‐numerical treat