Results 61 to 70 of about 954,754 (291)

A minimal cellulosome‐like system in Cellulosilyticum lentocellum

FEBS 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, Amias Alstrom‐Moore, Gary W Black   +2 more
wiley   +1 more source

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

Annals 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, Diane Demailly, Gabriella A. Horvàth, Juan Dario Ortigoza Escobar, Nathalie Dorison, Mayté Castro Jiménez, Cécile A. Hubsch, Thomas Wirth, Gun‐Marie Hariz, Sophie Huby, Morgan Dornadic, Zohra Souei, Muhammad Mushhood Ur Rehman, Simone Hemm, Mehdi Boulaymen, Eduardo M. Moraud, Jocelyne Bloch, Xavier Vasques   +17 more
wiley   +1 more source

Linear verification for spanning trees [PDF]

Combinatorica, 1984
The paper deals with the following special problem: (Q) Given an n- element set \(E=(e_ 1,...,e_ n)\), and a list of m subsets of \(\{\) 1,...,n\(\}\), \(L=(S_ 1,...,S_ m)\). Find the maxima \(M_ i=\max_{j\in S_ i}e_ j,\) \(i=1,...,m\). For the solution of the problem an algorithm is proposed which finds all maxima in linear time when only the total ...
openaire   +4 more sources

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

Advanced 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, Maximilian Holland, Klaus Drechsler, Johannes Schilp   +3 more
wiley   +1 more source

Ends in spanning trees

Discrete Mathematics, 1992
The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree
openaire   +2 more sources

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

Composites of Shellac and Silver Nanowires as Flexible, Biobased, and Corrosion‐Resistant Transparent Conductive Electrodes

Advanced Functional Materials, EarlyView.
Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein, Tiago Carneiro Gomes, Eliza Ng, Simon Rondeau‐Gagné, Tricia Breen Carmichael   +4 more
wiley   +1 more source

An Edge-Swap Heuristic for Finding Dense Spanning Trees

Theory and Applications of Graphs, 2016
Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures.
Mustafa Ozen, Hua Wang, Kai Wang, Demet Yalman   +3 more
doaj   +1 more source

Functionalizing Micro‐to‐Mesoscopic Electrode Architectures for Regulating Electron Transfer Behaviors in Electrocatalysis

Advanced Functional Materials, EarlyView.
A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao, Jiaojiao Zhang, Shideng Yuan, Xinmeng Yu, Keming Wan, Xiaoguang Duan, Zhining Wang   +6 more
wiley   +1 more source

Geometric Spanning Trees Minimizing the Wiener Index

Computing in Geometry and Topology
The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical graph representations of the non-hydrogen atoms of a molecule, is ...
Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph Mitchell   +3 more
doaj   +1 more source