Results 51 to 60 of about 1,735,900 (276)

Connecting Seed Lists of Mammalian Proteins Using Steiner Trees [PDF]

open access: yes, 2008
Multivariate experiments and genomics studies applied to mammalian cells often produce lists of genes or proteins altered under treatment/disease vs. control/normal conditions. Such lists can be identified in known protein-protein interaction networks to
Avi Ma'ayan, Amelia G. White
core  

Note on the Spectra of Steiner Distance Hypermatrices

open access: yesThe Electronic Journal of Combinatorics
The Steiner distance of a set of vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices. The order-$k$ Steiner distance hypermatrix of an $n$-vertex graph is the $n \times \cdots \times n$ ($k$ terms) array indexed by vertices, whose entries are the Steiner distances of their corresponding indices.
Joshua Cooper 0002, Zhibin Du
openaire   +3 more sources

Sustainable and Resilient Supply Networks: Digitalisation, Regulation and Climate Vulnerability in a Global Context

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT The growing frequency of global crises has intensified concerns regarding climate vulnerability and the resilience of global production systems. This study examines the heterogeneous effects of supply chain development and supply chain digitalisation on climate vulnerability across countries, while accounting for institutional and investment ...
Ziwei Li   +4 more
wiley   +1 more source

Graph Spanners for Group Steiner Distances

open access: yesCoRR
A spanner is a sparse subgraph of a given graph $G$ which preserves distances, measured w.r.t.\ some distance metric, up to a multiplicative stretch factor. This paper addresses the problem of constructing graph spanners w.r.t.\ the group Steiner metric, which generalizes the recently introduced beer distance metric.
Davide Bilo'   +3 more
openaire   +6 more sources

Supply Chain Sustainability and Human Capital: A Multilevel Analysis

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT This study examines how corporate sustainability practices diffuse across global supply chains and how national contextual capacity shapes this process. Drawing on stakeholder and institutional perspectives, we conceptualize ESG transmission as relational and potentially asymmetric between customers and suppliers.
Jun Xie   +5 more
wiley   +1 more source

Robust reservoir identification by multi-well cluster analysis of wireline logging data

open access: yesHeliyon, 2023
A novel clustering method is applied to well logs for improved rock type identification in hydrocarbon formations. For grouping the objects in the multi-dimensional data space, we propose a Most Frequent Value (MFV) based clustering technique applied to ...
N.P. Szabó, R. Kilik, M. Dobróka
doaj   +1 more source

Winning Consumer Trust Through Supply Chain Responsibility Communication: How Certification, Disclosure, and Beneficiary Framing Shape Credibility

open access: yesCorporate Social Responsibility and Environmental Management, EarlyView.
ABSTRACT As stakeholders increasingly demand supply chain transparency, companies face a legitimacy paradox: disclosing supply chain responsibility (SR) information is necessary to meet stakeholder expectations, yet disclosure can invite scrutiny rather than build credibility.
Julia Hartmann
wiley   +1 more source

Doped Ta3N5 Semi‐Transparent Photoanode Enabling Stable Solar Redox Flow Cell Operation

open access: yesENERGY &ENVIRONMENTAL MATERIALS, EarlyView.
Synergistic Al:TiO2 underlayer and La doping stabilize semitransparent Ta3N5 photoelectrodes for over 90 h of continuous operation in alkaline solution. The solar redox flow cell demonstrated 12 photocharge–discharge cycles at ∼55% coulombic efficiency using a K4Fe(CN)6|1,5‐DHAQ chemistry. Solar redox flow cells (SRFCs) are photoelectrochemical devices
Filipe Moisés M. Francisco   +4 more
wiley   +1 more source

On the Hyperdeterminants of Steiner Distance Hypermatrices

open access: yesThe Electronic Journal of Combinatorics
Let $G$ be a graph on $n$ vertices. The Steiner distance of a collection of $k$ vertices in $G$ is the fewest number of edges in any connected subgraph containing those vertices. The order $k$ Steiner distance hypermatrix of $G$ is the $n$-dimensional array indexed by vertices, whose entries are the Steiner distances of their corresponding indices.
openaire   +1 more source

Home - About - Disclaimer - Privacy