𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds for mixtures of an arbitrary number of materials

✍ Scribed by Cristian Barbarosie

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
136 KB
Volume
24
Category
Article
ISSN
0170-4214

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

This paper studies the problem of bounding the effective conductivity coefficients of mixtures made of several materials, in given proportions. Lower and upper bounds are obtained, and the optimality of these bounds is proven under certain hypotheses. Also, necessary and sufficient conditions for a mixture to attain the bounds are described. Some of the results were already known, but we give simpler proofs. Copyright Β© 2001 John Wiley & Sons, Ltd.

πŸ“œ SIMILAR VOLUMES

Bounds on the Number of Units for Comput
Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons
✍ Michel Cosnard; Pascal Koiran; HΓ©lΓ¨ne Paugam-Moisy πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 291 KB

Multilayer perceptrons can compute arbitrary dichotomies of a set of \(N\) points of \([0,1]^{d}\). The minimal size of such networks was studied by Baum (1988, J. Complexity 4, 193-215) using the parameter \(N\). In this paper, we show that this question can be addressed using another parameter, th

A lower bound on the independence number
A lower bound on the independence number of arbitrary hypergraphs
✍ Thiele, Torsten πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 3 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies Ξ±(H) β‰₯ v∈V f (d