Results 71 to 80 of about 87,896 (215)

Adapting the Dejour classification of trochlear dysplasia from qualitative radiograph‐ and CT‐based assessments to quantitative MRI‐based measurements

Knee Surgery, Sports Traumatology, Arthroscopy, EarlyView.
Abstract Purpose To adapt the current D. Dejour trochlear dysplasia classification (v2.0) to only rely on quantitative magnetic resonance imaging (MRI) measurements (v3.0) to maximize objectivity and repeatability. Methods A consecutive series of adult knee MRIs were divided into objective patellar instability (OPI, n = 127) or controls (n = 103 ...
David H. Dejour, Edoardo Giovanetti de Sanctis, Jacobus H. Müller, Etienne Deroche, Tomas Pineda, Amedeo Guarino, Cécile Toanen, Patellofemoral Imaging Group, Andrea Amarossi, Alexandre Baujard, Nicolas Cance, Julien Dartus, Paolo Ferrua, Stefano Pasqualotto, Francesco Puglia, Sophie Putman, Mo Saffarini   +16 more
wiley   +1 more source

Thermo‐Optically Tunable Mid‐Infrared Bandpass Filters Comprising Ultra‐Thin Silicon‐on‐Sapphire Metasurfaces

Laser &Photonics Reviews, EarlyView.
Ultra‐thin, tunable bandpass filters are a pathway to realizing mid‐infrared spectrometers that are compact, low power, and performant. The authors elicit 141 nanometres of passband tunability in the mid‐infrared in silicon on sapphire zero‐contrast gratings by exploiting silicon's high thermo‐optic coefficient.
Benjamin J. Russell, Sivacarendran Balendhran, Jiajun Meng, Kenneth B. Crozier   +3 more
wiley   +1 more source

Comparative Evaluation of Neural Networks and Transfer Learning for Predicting Mechanical Properties of 3D‐Printed Bone Scaffolds

Macromolecular Materials and Engineering, EarlyView.
This study compares Convolutional Neural Networks (CNNs) and Transfer Learning (TL) for predicting key mechanical properties (volume fraction, Poisson's ratio, and elastic modulus) of 3D‐printed bone scaffolds. Using image‐based inputs derived from Body Centred Cubic lattice structures, CNNs outperformed ResNet‐based TL models in accuracy. The proposed
S. Mohsen Zahedi, Aboozar Taherkhani, Reza Baserinia, S. Abolfazl Zahedi, Hafiz Muhammad Asad Ali, Meisam Abdi   +5 more
wiley   +1 more source

gammaSTAR: A framework for the development of dynamic, real‐time capable MR sequences

Magnetic Resonance in Medicine, EarlyView.
Abstract Purpose To present the real‐time capability and advanced MR sequence library of the MR sequence development framework gammaSTAR. Methods The presented platform consists of four different components: (1) a frontend for sequence development combined with a Python backend for sequence generation; (2) a Lua backend for the creation of hardware ...
Simon Konstandin, Matthias Günther, Daniel C. Hoinkiss   +2 more
wiley   +1 more source

Machine Learning‐Assisted Sensitivity Analysis for Stochastic Fatigue Life Modeling of Metals

International Journal of Mechanical System Dynamics, EarlyView.
ABSTRACT Predicting fatigue life with precision requires more than isolated evaluations of mechanical properties; it requires an integrated approach that captures the interdependencies between various parameters, including elastic modulus, tensile strength, yield strength, and strain‐hardening exponent.
Tran C. H. Nguyen, N. Vu‐Bac
wiley   +1 more source

Improved Regression Tree Models Using Generalization Error‐Based Splitting Criteria

Naval Research Logistics (NRL), EarlyView.
ABSTRACT Despite the widespread application of machine learning (ML) approaches such as the regression tree (RT) in the field of data‐driven optimization, overfitting may impair the effectiveness of ML models and thus hinder the deployment of ML for decision‐making.
Ying Yang, Shuaian Wang, Gilbert Laporte
wiley   +1 more source

Precedence‐Constrained Shortest Path

Networks, EarlyView.
ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing, Dennis John, Corinna Mathwieser   +2 more
wiley   +1 more source

Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes

Networks, EarlyView.
ABSTRACT The b$$ b $$‐matching problem is a well‐known generalization of the classical matching problem with various applications in operations research and computer science. Given an undirected graph, each vertex v$$ v $$ has a capacity bv$$ {b}_v $$, indicating the maximum number of times it can be matched, while edges can also be used multiple times.
Jenny Segschneider, Arie M. C. A. Koster
wiley   +1 more source

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations

Networks, EarlyView.
ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin, Sergiy Butenko, Mykyta Makovenko, Petar Momcilovic, Oleg A. Prokopyev   +4 more
wiley   +1 more source

Using Machine Learning to Understand and Manage the Transformation of Peer Donors to Organizational Donors

Nonprofit Management and Leadership, EarlyView.
ABSTRACT Peer‐to‐peer fundraising has become a popular funding approach for nonprofit organizations, generating quick revenue and a promising opportunity for donor base expansion by transforming peer donors into organizational donors following their peer donation.
Laura Hesse
wiley   +1 more source