Numerical and Experimental Investigation of Wire Cloth Heat Exchanger for Latent Heat Storages

Latent thermal energy storages (LTES) offer a high storage density within a narrow temperature range. Due to the typically low thermal conductivity of the applied phase change materials (PCM), the power of the storages is limited. To increase the power, an efficient heat exchanger with a large heat transfer surface and a higher thermal conductivity is needed. In this article, planar wire cloth heat exchangers are investigated to obtain these properties. They investigated the first time for LTES. Therefore, we developed a finite element method (FEM) model of the heat exchanger and validated it against the experimental characterization of a prototype LTES. As PCM, the commercially available paraffin RT35HC is used. The performance of the wire cloth is compared to tube bundle heat exchanger by a parametric study. The tube diameter, tube distance, wire diameter and heat exchanger distance were varied. In addition, aluminum and stainless steel were investigated as materials for the heat exchanger. In total, 654 variants were simulated. Compared to tube bundle heat exchanger with equal tube arrangement, the wire cloth can increase the mean thermal power by a factor of 4.20 but can also reduce the storage capacity by a minimum factor of 0.85. A Pareto frontier analysis shows that for a free arrangement of parallel tubes, the tube bundle and wire cloth heat exchanger reach similar performance and storage capacities.

Nearly free curves and arrangements: a vector bundle point of view

Over the past forty years many papers have studied logarithmic sheaves associated to reduced divisors, in particular logarithmic bundles associated to plane curves. An interesting family of these curves are the so-called free ones for which the associated logarithmic sheaf is the direct sum of two line bundles. Terao conjectured thirty years ago that when a curve is a finite set of distinct lines (i.e. a line arrangement) its freeness depends solely on its combinatorics, but this has only been proved for sets of up to 12 lines. In looking for a counter-example to Terao’s conjecture, the nearly free curves introduced by Dimca and Sticlaru arise naturally. We prove here that the logarithmic bundle associated to a nearly free curve possesses a minimal non-zero section that vanishes on one single point, P say, called the jumping point, and that this characterises the bundle. We then give a precise description of the behaviour of P. Based on detailed examples we then show that the position of P relative to its corresponding nearly free arrangement of lines may or may not be a combinatorial invariant, depending on the chosen combinatorics.

Supersolvable orders and inductively free arrangements

In this paper, we define the supersolvable order of hyperplanes in a supersolvable arrangement, and obtain a class of inductively free arrangements according to this order. Our main results improve the conclusion that every supersolvable arrangement is inductively free. In addition, we assert that the inductively free arrangement with the required induction table is supersolvable.

The freeness of Ish arrangements

International audience The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q; t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangement and posed some problems. One of them is whether the Ish arrangement is a free arrangement or not. In this paper, we verify that the Ish arrangement is supersolvable and hence free. Moreover, we give a necessary and sufficient condition for the deleted Ish arrangement to be free L’arrangement Ish a été introduit par Armstrong pour donner une nouvelle interprétation des nombres $q; t$-Catalan de Garsia et Haiman. Armstrong et Rhoades ont montré qu’il y avait des ressemblances frappantes entre l’arrangement Shi et l’arrangement Ish et ont posé des conjectures. L’une d’elles est de savoir si l’arrangement Ish est un arrangement libre ou pas. Dans cet article, nous vérifions que l’arrangement Ish est supersoluble et donc libre. De plus, on donne une condition nécessaire et suffisante pour que l’arrangement Ish réduit soit libre.

Svømmetilbud målrettet etniske kvinder, Procesevaluering af en svømmeintervention

<p><em>Evaluation of a swimming-intervention targeting female ethnical minorities.<br /> </em><em>A health-promoting intervention in Korskærparken, established by the municipality of Fredericia, has been evaluated to identify potentials and barriers in health promotion targeting ethnic minorities. Factors that had a major effect in the success of the intervention were; a nearly cost free arrangement; the target groups ownership in the intervention; the fact that cultural and gender barriers were taken into account and the recruitment of participants through the local community, mentors and other participants. Barriers included dependence on economic support and practical arrangement. </em><strong><em></em></strong></p>

The freeness of ideal subarrangements of Weyl arrangements

International audience A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set of positive roots is an ideal in the root poset, we call the corresponding arrangement an ideal subarrangement. Our main theorem asserts that any ideal subarrangement is a free arrangement and that its exponents are given by the dual partition of the height distribution, which was conjectured by Sommers-Tymoczko. In particular, when an ideal subarrangement is equal to the entire Weyl arrangement, our main theorem yields the celebrated formula by Shapiro, Steinberg, Kostant, and Macdonald. The proof of the main theorem is classification-free. It heavily depends on the theory of free arrangements and thus greatly differs from the earlier proofs of the formula. Un arrangement de Weyl est défini par l’arrangement d’hyperplans du système de racines d’un groupe de Weyl fini. Quand un ensemble de racines positives est un idéal dans le poset de racines, nous appelons l’arrangement correspondant un sous-arrangement idéal. Notre théorème principal affirme que tout sous-arrangement idéal est un arrangement libre et que ses exposants sont donnés par la partition duale de la distribution des hauteurs, ce qui avait été conjecturé par Sommers-Tymoczko. En particulier, quand le sous-arrangement idéal est égal à l’arrangement de Weyl, notre théorème principal donne la célèbre formule par Shapiro, Steinberg, Kostant et Macdonald. La démonstration du théorème principal n’utilise pas de classification. Elle dépend fortement de la théorie des arrangements libres et diffère ainsi grandement des démonstrations précédentes de la formule.