Damage Mechanisms in Tapered Composite Structures Under Static and Fatigue Loading

In this work an integrated computational/experimental approach was developed to validate the predictive capabilities of State-of-the-Art (SoA) Progressive Damage Analysis (PDA) methods and tools. Specifically, a tapered composite structure incorporating ply-drops typical in the aerospace industry to spatially vary structural thickness was tested under static tension and cyclic tension fatigue loads. The data acquired from these tests included quantitative metrics such as pre-peak stiffness, peak load, location of delamination damage onset, and growth of delaminations as functions of applied static and fatigue loads. It was shown that the PDA tools were able to predict the pre-peak stiffness and peak load within 10% of experimental average, thereby meeting and exceeding the pre-defined success criteria. Additionally, it was shown that the PDA tools were able to accurately predict the location of delamination onset and satisfactorily predict delamination growth under static tension loading. Overall, good correlations were achieved between modeling and experiments

Firefly: a browser-based interactive 3D data visualization tool for millions of data points

We present Firefly, a new browser-based interactive tool for visualizing 3D particle data sets. On a typical personal computer, Firefly can simultaneously render and enable real-time interactions with > ~10 million particles, and can interactively explore datasets with billions of particles using the included custom-built octree render engine. Once created, viewing a Firefly visualization requires no installation and is immediately usable in most modern internet browsers simply by visiting a URL. As a result, a Firefly visualization works out-of-the-box on most devices including smartphones and tablets. Firefly is primarily developed for researchers to explore their own data, but can also be useful to communicate results to researchers/collaborators and as an effective public outreach tool. Every element of the user interface can be customized and disabled, enabling easy adaptation of the same visualization for different audiences with little additional effort. Creating a new Firefly visualization is simple with the provided Python data pre-processor (PDPP) that translates input data to a Firefly-compatible format and provides helpful methods for hosting instances of Firefly both locally and on the internet. In addition to visualizing the positions of particles, users can visualize vector fields (e.g., velocities) and also filter and color points by scalar fields. We share three examples of Firefly applied to astronomical datasets: 1) the FIRE cosmological zoom-in simulations, 2) the SDSS galaxy catalog, and 3) Gaia DR3. A gallery of additional interactive demos is available at https://alexbgurvi.ch/Firefly.Comment: 25 pages, 8 figures. Submitting to ApjS, comments welcome

Estudio del Sistema Regional de Innovación Córdoba

Este estudio toma como punto de partida la importancia de la innovación para el desarrollo económico regional, que se traduce tanto en una mejora en la performance de las empresas como en el adelanto económico y social de su entorno. La innovación es el resultado de un proceso sistémico, en el que actores sociales realizan intercambios para producir bienes, servicios y/o procesos. Esta tesis comprende un Modelo Hipotético sobre el funcionamiento del sistema y una Caracterización del Sistema Regional de Innovación Córdoba (SRI-C), que explica ese funcionamiento a través de la descripción de la estructura de actores, sus relaciones e intercambios y el entorno socioeconómico y productivo. La hipótesis que orienta el trabajo es que la “necesidad concurrente” de generar riqueza de los actores socio-económicos, primera variable, determina la “institucionalización del sistema regional de innovación”, segunda variable. La puesta en funcionamiento de este modelo en Córdoba muestra que la “necesidad de generar riqueza” local se satisface principalmente a través de alternativas productivas y comerciales que no generan suficientes situaciones de intercambios de conocimientos para la “institucionalización del sistema regional de innovación”.publishedVersio

On Remoteness Functions of Exact Slow kk-NIM with k+1k+1 Piles

Given integer $n$ and $k$ such that $0 < k \leq n$ and $n$ piles of stones, two player alternate turns. By one move it is allowed to choose any $k$ piles and remove exactly one stone from each. The player who has to move but cannot is the loser. Cases $k=1$ and $k = n$ are trivial. For $k=2$ the game was solved for $n \leq 6$. For $n \leq 4$ the Sprague-Grundy function was efficiently computed (for both the normal and mis\`ere versions). For $n = 5,6$ a polynomial algorithm computing P-positions was obtained. Here we consider the case $2 \leq k = n-1$ and compute Smith's remoteness function, whose even values define the P-positions. In fact, an optimal move is always defined by the following simple rule: if all piles are odd, keep a largest one and reduce all other; if there exist even piles, keep a smallest one of them and reduce all other. Such strategy is optimal for both players, moreover, it allows to win as fast as possible from an N-position and to resist as long as possible from a P-position.Comment: 20 page

The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average

We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadow-vertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring $(\mathbb{R} \cup \{-\infty\}, \max, +)$. The key ingredient in our approach is that the shadow-vertex pivoting rule can be transferred to tropical polyhedra, and that its computation reduces to optimal assignment problems through Pl\"ucker relations.Comment: 17 pages, 7 figures, appears in 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part

Second Stage String Fragmentation Model

A string model, advocated by Bowler, provides a physical and intuitive picture of heavy quark fragmentation. When supplemented by an ad hoc factor of (1-z), to suppress fragmentation near z=1, it supplies an excellent fit to the data. We extend Bowler's model by accounting for the further decay of the massive mesonic states produced by the initial string breaking. We find that each subsequent string break and cascade decay beyond the first, introduces a factor of (1-z). Furthermore we find that including a finite mass for the quarks, which pop out of the vacuum and split the string, forces the first string breaking to produce massive states requiring further decay. This sequence terminates at the second stage of fragmentation where only relatively "light" heavy meson systems are formed. Thus we naturally account for the phenomenologically required factor of (1-z). We also predict that the ratio of (primary) fragments-vector/(vector plus scalar) should be .61. Our second stage string fragmentation model provides an appealing picture of heavy quark fragmentation.Comment: 15 page

On the Rational Type 0f Moment Angle Complexes

In this note it is shown that the moment angle complexes Z(K;(D^2,,S^1)) which are rationally elliptic are a product of odd spheres and a diskComment: This version avoids the use of an incorrect result from the literature in the proof of Theorem 1.3. There is some text overlap with arXiv:1410.645

Generation of small-scale structures in the developed turbulence

The Navier-Stokes equation for incompressible liquid is considered in the limit of infinitely large Reynolds number. It is assumed that the flow instability leads to generation of steady-state large-scale pulsations. The excitation and evolution of the small-scale turbulence is investigated. It is shown that the developed small-scale pulsations are intermittent. The maximal amplitude of the vorticity fluctuations is reached along the vortex filaments. Basing on the obtained solution, the pair correlation function in the limit $r\to 0$ is calculated. It is shown that the function obeys the Kolmogorov law $r^{2/3}$.Comment: 18 page

Semiclassical Decay of Excited String States on Leading Regge Trajectories

We study the decay of hadrons based on a semiclassical string model. By including quark mass effects we find that the width to mass ratio \G/m is an increasing function of $m$, which increases most rapidly for massive quarks. This is consistent with the available data. The decay probability of hadrons on the leading Regge trajectories is computed taking the effect of the string rotation into account. The resulting decay probability is no longer uniform along the length of the string but varies in a manner that is in qualitative agreement with the available data. We argue in favour of possible experiments that would test our predictions more accurately and help open a window to the nonperturbative aspects of QCD.Comment: 15 PAGES, UR-1326, ER-40685-776, SU-4240-55

Three-way symbolic tree-maps and ultrametrics

Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis and have been used in areas such as psychology and phylogenetics, where three-way data tables can arise. Special examples of such dissimilarities are three-way tree-metrics and ultrametrics, which arise from leaf-labelled trees with edges labelled by positive real numbers. Here we consider three-way maps which arise from leaf-labelled trees where instead the interior vertices are labelled by an arbitrary set of values. For unrooted trees, we call such maps three-way symbolic tree-maps; for rooted trees, we call them three-way symbolic ultrametrics since they can be considered as a generalization of the (two-way) symbolic ultrametrics of Bocker and Dress. We show that, as with two- and three-way tree-metrics and ultrametrics, three-way symbolic tree-maps and ultrametrics can be characterized via certain k-point conditions. In the unrooted case, our characterization is mathematically equivalent to one presented by Gurvich for a certain class of edge-labelled hypergraphs. We also show that it can be decided whether or not an arbitrary three-way symbolic map is a tree-map or a symbolic ultrametric using a triplet-based approach that relies on the so-called BUILD algorithm for deciding when a set of 3-leaved trees or triplets can be displayed by a single tree. We envisage that our results will be useful in developing new approaches and algorithms for understanding 3-way data, especially within the area of phylogenetics