Effect of fibre configurations on mechanical properties of flax/tannin composites.

Flax reinforced tannin-based composites have a potential to be used in vehicle applications due to the environmental advantages and good mechanical properties. In this paper, the effects of fibre configuration on mechanical properties of flax/tannin composites were investigated for nonwoven and woven fabric lay-up angles (UD, [0°, 90°]2 and [0°, +45°, 90°, -45°]2). The tannin/flax composites were prepared by compression moulding. The manufactured specimens were then characterized for quasi-static tensile properties, dynamic mechanical properties and low-energy impact performance. Failure mechanism was further investigated using microscopy and demonstrated the need for further adhesion improvements. The study shows that the UD fabric reinforced composite performs better in tensile strength and modulus whereas [0°, +45°, 90°, -45°]2 composite provides the best impact energy absorption performance

Fabrication and mechanical analysis of mimosa tannin and commercial flax fibers biocomposites

International audienceComposites were prepared by impregnating commercial nonwoven and unidirectional flax fibers mats, with a mimosa tannin/hexamine resin without addition of NaOH as it was described in previous papers and with improved results. The influence of various parameters was observed: the curing cycle including temperature, time, pressure, the moisture content, and the number of fiber mats the composites were made of. A new two-step method was investigated: full drying of the pre-impregnated mats for storage first and then rehydratation just before pressing. The composites obtained gave good modulus of elasticity and tensile strength in traction as well as a good resistance to water swelling for composites prepared with 50% matrix resin/50% natural fibers. Best results appear to be obtained using a slow curing at low temperature (130 degrees C for 35min) with moisture content of 20% on dry material

EIDORS: an open software for EIT adapted for geophysical purposes

National audienc

Symbolic Model Checking for Real-Time Systems

We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a $\mu$-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzero execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed $\mu$-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs-those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory

Symbolic Model Checking for Real-time Systems

We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a -calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" real-time programs---those whose safety..