Results 41 to 50 of about 2,476,475 (293)

A minimum spanning tree analysis of the Polish stock market

open access: yesJournal of Economics and Management, 2022
Aim/purpose – This article aims to explore the network topology of the stock market in Poland during the COVID-19 pandemic.
Tomeczek Artur F.
doaj   +1 more source

Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis

open access: yesFEBS Letters, EarlyView.
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee   +7 more
wiley   +1 more source

Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm

open access: yesIJID (International Journal on Informatics for Development), 2014
Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj   +1 more source

A minimal cellulosome‐like system in Cellulosilyticum lentocellum

open access: yesFEBS Open Bio, EarlyView.
Cellulose‐degrading bacteria typically use cellulosomes, large multi‐enzyme complexes on a scaffold protein. In Cellulosilyticum lentocellum, we characterise a far smaller arrangement, a single scaffold bound to one cellulase through a single cohesin‐dockerin interaction.
John Allan   +2 more
wiley   +1 more source

Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif   +17 more
wiley   +1 more source

Air‐Pressure–Actuated Vibroacoustic Metamaterial With Tunable Bandgap: Design, Modeling, and Characterization

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal   +2 more
wiley   +1 more source

A MINIMUM SPANNING TREE BASED METHOD FOR UAV IMAGE SEGMENTATION [PDF]

open access: yesISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016
This paper proposes a Minimum Span Tree (MST) based image segmentation method for UAV images in coastal area. An edge weight based optimal criterion (merging predicate) is defined, which based on statistical learning theory (SLT).
P. Wang, Z. Wei, W. Cui, Z. Lin
doaj   +1 more source

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch   +3 more
wiley   +1 more source

Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem

open access: yesJournal of Numerical Analysis and Approximation Theory, 2005
We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj   +2 more sources

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

open access: yesJournal of Applied Mathematics, 2012
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj   +1 more source

Home - About - Disclaimer - Privacy