Results 191 to 200 of about 9,360 (297)

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

New Drain Spacing Formulas Using the Variational Iteration Method

open access: yesIrrigation and Drainage, EarlyView.
ABSTRACT In this study, the drain spacing is computed using the variational iteration method (VIM) to the linearized Boussinesq equation. By applying at most two iterations of the VIM method under three different initial condition scenarios, three equations for drain spacing calculation were derived. These equations predict values of drain spacing that
George Kargas   +2 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

Home - About - Disclaimer - Privacy