Results 191 to 200 of about 1,596 (244)

Polymer informatics: Integrating data‐driven strategies, advanced machine learning, and automated synthesis for next‐generation polymer design

open access: yesInfoScience, EarlyView.
Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam   +6 more
wiley   +1 more source

Artificial intelligence–driven decoupling structure–activity relationship for lithium‐ion batteries

open access: yesInfoScience, EarlyView.
Artificial intelligence can efferently accelerate the high‐throughput screening of battery materials, the analysis of multiphase mechanisms, and the precise prediction of capacity and cycle life. This review systematically summarizes the applications of machine learning (ML) in decoupling the complex structure‐activity relationships of lithium‐ion ...
Tao Wang   +6 more
wiley   +1 more source

Discrimination, Social Support, and Identity Development in Relation to Career Agency Among LGB Emerging Adults: A Latent Profile Analysis

open access: yesJournal of Adolescence, EarlyView.
ABSTRACT Introduction Emerging adulthood is a critical developmental period for identity consolidation and career preparation, yet lesbian, gay, and bisexual (LGB) emerging adults often face intersecting challenges during this stage. Using a person‐centered approach, this study explored heterogeneity in developmental experiences among LGB emerging ...
Jeongeun Park
wiley   +1 more source

Improving the Finite Sample Estimation of Average Treatment Effects Using Double/Debiased Machine Learning With Propensity Score Calibration

open access: yesJournal of Applied Econometrics, EarlyView.
ABSTRACT Double/debiased machine learning (DML) uses for estimating an average treatment effect (ATE) a double‐robust score function that relies on the prediction of nuisance functions, such as the propensity score, which is the probability of treatment assignment given covariates.
Daniele Ballinari, Nora Bearth
wiley   +1 more source

Sense of Coherence in the Perinatal Period: A Longitudinal Growth Mixture Modeling Analysis

open access: yesJournal of Clinical Psychology, EarlyView.
ABSTRACT Objectives Previous studies have established that higher Sense of Coherence (SoC) predicts lower pregnancy‐specific distress, fewer delivery complications, and increased birth satisfaction. However, less is known about how SoC typically changes over pregnancy, birth, and postnatally and the risk factors and protective factors contributing to ...
Kelsey Perrykkad   +4 more
wiley   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen   +2 more
wiley   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang   +3 more
wiley   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová   +3 more
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy