Flow-induced pruning of branched systems and brittle reconfiguration

Whereas most plants are flexible structures that undergo large deformations under flow, another process can occur when the plant is broken by heavy fluid-loading. We investigate here the mechanism of such possible breakage, focusing on the flow-induced pruning that can be observed in plants or aquatic vegetation when parts of the structure break under flow. By computation on an actual tree geometry, a 20-yr-old walnut tree (Juglans Regia L.) and comparison with simple models, we analyze the influence of geometrical and physical parameters on the occurrence of branch breakage and on the successive breaking events occurring in a tree-like structure when the flow velocity is increased. We show that both the branching pattern and the slenderness exponent, defining the branch taper, play a major role in the breakage scenario. We identify a criterion for branch breakage to occur before breakage of the trunk. In that case, we show that the successive breakage of peripheral branches allows the plant to sustain higher flow forces. This mechanism is therefore similar to elastic reconfiguration, and can be seen as a second strategy to overcome critical events, possibly a widespread solution in plants and benthic organisms.Comment: 9 pages, 9 figure

A space-averaged model of branched structures

Many biological systems and artificial structures are ramified, and present a high geometric complexity. In this work, we propose a space-averaged model of branched systems for conservation laws. From a one-dimensional description of the system, we show that the space-averaged problem is also one-dimensional, represented by characteristic curves, defined as streamlines of the space-averaged branch directions. The geometric complexity is then captured firstly by the characteristic curves, and secondly by an additional forcing term in the equations. This model is then applied to mass balance in a pipe network and momentum balance in a tree under wind loading.Comment: 10 pages, 11 figure

Drag Reduction, from Bending to Pruning

Most plants and benthic organisms have evolved efficient reconfiguration mechanisms to resist flow-induced loads. These mechanisms can be divided into bending, in which plants reduce their sail area through elastic deformation, and pruning, in which the loads are decreased through partial breakage of the structure. In this work, we show by using idealized models that these two mechanisms or, in fact, any combination of the two, are equally efficient to reduce the drag experienced by terrestrial and aquatic vegetation.Comment: 5 pages, 5 figure

Phase-space methods in nuclear reactions around the Fermi energy

Some prescriptions for in-medium complex particle production in nuclear reactions are proposed. They have been implemented in two models to simulate nucleon-nucleus (nIPSE) and nucleus-nucleus (HIPSE) reactions around the Fermi energy \cite{Lac04,Lac05}. Our work emphasizes the effect of randomness in cluster formation, the importance of the nucleonic Fermi motion as well as the role of conservation laws. The key role of the phase-space exploration before and after secondary decay is underlined. This is illustrated in the case of two debated issues: the memory loss of the entrance channel in central collisions and the $(N,Z)$ partitions after the pre-equilibrium stage.Comment: Proceedings of the IWM2005 workshop, Catane (Italy), Nov. 2005. DOWNLOAD HIPSE program at: http://caeinfo.in2p3.fr/theorie/theory_lacroix.htm

Transport congestion events detection (TCED): towards decorrelating congestion detection from TCP

TCP (Transmission Control Protocol) uses a loss-based algorithm to estimate whether the network is congested or not. The main difficulty for this algorithm is to distinguish spurious from real network congestion events. Other research studies have proposed to enhance the reliability of this congestion estimation by modifying the internal TCP algorithm. In this paper, we propose an original congestion event algorithm implemented independently of the TCP source code. Basically, we propose a modular architecture to implement a congestion event detection algorithm to cope with the increasing complexity of the TCP code and we use it to understand why some spurious congestion events might not be detected in some complex cases. We show that our proposal is able to increase the reliability of TCP NewReno congestion detection algorithm that might help to the design of detection criterion independent of the TCP code. We find out that solutions based only on RTT (Round-Trip Time) estimation are not accurate enough to cover all existing cases. Furthermore, we evaluate our algorithm with and without network reordering where other inaccuracies, not previously identified, occur

Understanding the impact of TFRC feedbacks frequency over long delay links

TFRC is a transport protocol specifically designed to carry multimedia streams. TFRC does not enable a reliable and in order data delivery services. However the mechanism is designed to be friendly with TCP flows and thus, enables a control congestion algorithm. This congestion control relies in a feedback mechanism allowing receivers to communicate to the senders an experienced drop rate. Several studies attempted to adapt TFRC to a wide range of network conditions and topologies. Although the current TFRC RFC writes that there is little gain from sending a large number of feedback messages per RTT, recent studies have shown that in long-delay contexts, such as satellite-based networks, the performance of TFRC can be greatly improved by increasing the feedback frequency. Nevertheless, currently it is not clear how and why this increase may improve the performance of TFRC. Therefore, in this paper, we aim at understanding the impact that multiple feedback per RTT may have (i) on the key parameters of TFRC (RTT, drop rate, and sending rate) and (ii) on the network parameters (reactiveness and link utilization).We also provide a detailed description of the micro-mechanisms at the origin of the improvements of the TFRC behaviour when multiple feedback per RTT are delivered, and determine the context where such feedback frequencies should be applied

Towards an incremental deployment of ERN protocols: a proposal for an E2E-ERN hybrid protocol

We propose an architecture based on a hybrid E2E-ERN approach to allow incremental deployment of ERN (Explicit Rate Notification) protocols in heterogeneous networks. The proposed IP-ERN architecture combines E2E (End-to-End)and ERN protocols and uses the minimum between both congestion windows to perform. Without introducing complex operation, the resulting E2E-ERN protocol provides inter and intra protocol fairness and benefits from all ERN protocol advantages when possible. We detail the principle of this novel IP-ERN architecture and show that this architecture is highly adaptive to the network dynamic and is compliant with IPv4, IPv6 as well as IP-in-IP tunneling solutions

SatERN: a PEP-less solution for satellite communications

In networks with very large delay like satellite IPbased networks, standard TCP is unable to correctly grab the available resources. To overcome this problem, Performance Enhancing Proxies (PEPs), which break the end-to-end connection and simulate a receiver close enough to the sender, can be placed before the links with large delay. Although splitting PEPs does not modify the transport protocol at the end nodes, they prevent the use of security protocols such as IPsec. In this paper, we propose solutions to replace the use of PEPs named SatERN. This proposal, based on Explicit Rate Notification (ERN) protocols over IP, does not split connections and is compliant with IP-in-IP tunneling solutions. Finally, we show that the SatERN solution achieves high satellite link utilization and fairness of the satellite traffic

Methodological Process for the Teaching of Computer Programming based on Computational Thinking: Case Study

In academia, it is common to identify the problem solving process based on computational thinking, as the traditional method of programming teaching. However, students would first have to develop the four types of thinking involved in this process, in order to develop successfully the programming skills. Therefore is required from the beginning of the learning process a method that provides students with a contextualization, allowing the configuration of their own language, which propitiates the development of analytical thinking for the construction of solutions for increasingly complex problems. This paper describes a methodological process of computer programming teaching based on the computational thinking process, by integrating components that promote the development of analytical thinking. Finally, we present a case study with STEM undergraduate students as participants

Preparation of zinc peroxide nanoparticles by laser ablation of solid in liquids

In the last decade, there has been interest on the synthesis and characterization of Zinc peroxide (ZnO2) due to its potential applications as biocide, bactericide, inorganic oxidant and so on. ZnO2 can be obtained as a powder with a cubic structure and has been utilized as a precursor to obtain Zinc oxide (ZnO). ZnO2 can be considered as an oxygen reservoir since when it is heated at relatively low temperatures oxygen is released. Various approaches have been utilized to synthetize ZnO2 powders like sol-gel, organometallic precursors, hydrothermal, Laser Ablation of Solids in Liquids (LASL), and so on. While the hydrothermal route is one of the most utilized methods to obtain ZnO2, the LASL technique has only been utilized by the Gondal´s group to synthesize zinc peroxide nanoparticles. Escobedo et al. have been reported a study of the vibrational properties of ZnO2 NPs synthesized by the hydrothermal method. Additionally, they present results of XRD, TEM and by thermal analysis determine the decomposition temperature of their ZnO2 NPs. Recently, the Escobedo-Morales’s group has reported a green method to prepare ZnO nanostructures employing as starting material ZnO2 (prepared by hydrothermal method