Results 91 to 100 of about 120,514 (220)

Using the S‐DIKW framework to transform data visualization into data storytelling

Journal of the Association for Information Science and Technology, Volume 76, Issue 5, Page 803-818, May 2025.
Abstract Communicating insights from data effectively requires design skills, technical knowledge, and experience. Data must be accurately represented with aesthetically pleasing visuals and engaging text to effectively communicate to the intended audience.
Angelica Lo Duca, Kate McDowell
wiley   +1 more source

A New Characterization of Unichord-Free Graphs

Discussiones Mathematicae Graph Theory, 2015
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by ...
McKee Terry A.
doaj   +1 more source

Dissipative CLT‐Based Seismic Upgrading System for RC‐Framed Structures: Experimental Characterization, Numerical Modelling, and Design Guidelines

Earthquake Engineering &Structural Dynamics, Volume 54, Issue 6, Page 1775-1796, May 2025.
ABSTRACT This paper investigates a seismic retrofit technique named e‐CLT, which is part of the solution for integrated seismic and energy rehabilitation of buildings developed in the framework of the research project e‐SAFE funded by the European Union's Horizon 2020 research and innovation program.
Francesca Barbagallo, Erika Licciardello, Edoardo Michele Marino, Claudio Mazzotti, Luca Pozza   +4 more
wiley   +1 more source

Strongly Unichord-Free Graphs

Discussiones Mathematicae Graph Theory, 2019
Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly ...
McKee Terry A.
doaj   +1 more source

Locally chordal graphs [PDF]

arXiv
A graph is locally chordal if, locally at each vertex, it is chordal, i.e. composed of cliques glued along a tree. In addition to extending many classic characterizations of chordal graphs, we show that locally chordal graphs are precisely those graphs $G$ which can be decomposed into cliques arranged in the shape of a high-girth graph.
arxiv  

Ibudilast Protects Retinal Bipolar Cells From Excitotoxic Retinal Damage and Activates the mTOR Pathway

Glia, Volume 73, Issue 5, Page 905-927, May 2025.
Main Points Ibudilast, a MIF and PDE inhibitor, preserves the form and function of the retina, especially bipolar cells, during excitotoxic damage. Ibudilast upregulates multiple signaling pathways, including mTOR, in damaged Müller glia and bipolar cells.
Sumaya Hamadmad, Tyler Heisler‐Taylor, Sandeep Goswami, Evan Hawthorn, Sameer Chaurasia, Dena Martini, Diana Summitt, Ali Zatari, Rahaf Shalash, Misha Sohail, Elizabeth G. Urbanski, Kayla Bernstein, Julie Racine, Abhay Satoskar, Heithem M. El‐Hodiri, Andy J. Fischer, Colleen M. Cebulla   +16 more
wiley   +1 more source

AMR‐Wind: A Performance‐Portable, High‐Fidelity Flow Solver for Wind Farm Simulations

Wind Energy, Volume 28, Issue 5, May 2025.
ABSTRACT We present AMR‐Wind, a verified and validated high‐fidelity computational‐fluid‐dynamics code for wind farm flows. AMR‐Wind is a block‐structured, adaptive‐mesh, incompressible‐flow solver that enables predictive simulations of the atmospheric boundary layer and wind plants.
Michael B. Kuhn, Marc T. Henry de Frahan, Prakash Mohan, Georgios Deskos, Matt Churchfield, Lawrence Cheung, Ashesh Sharma, Ann Almgren, Shreyas Ananthan, Michael J. Brazell, Luis A. Martínez‐Tossas, Regis Thedin, Jon Rood, Philip Sakievich, Ganesh Vijayakumar, Weiqun Zhang, Michael Sprague   +16 more
wiley   +1 more source

Modeling Multivariate Spatial Dependencies Using Graphical Models. [PDF]

N Engl J Stat Data Sci, 2023
Dey D, Datta A, Banerjee S.
europepmc   +1 more source

Structural and Spectral Properties of Chordal Ring, Multi-ring and Mixed Graphs [PDF]

arXiv
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of chordal multi-ring (CMR), chordal ring mixed (CRM), and chordal multi-ring mixed (CMRM) graphs.
arxiv  

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs [PDF]

arXiv, 2018
Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A graph $G$ is chordal if and only if every minimal vertex separator is a clique.
arxiv