Results 61 to 70 of about 115,144,832 (243)
Average Relaxations of Extremal Problems [PDF]
In this paper extremal problems that include averaging operation in constraints and objective are considered. The relaxation caused by a replacement of a problem without averaging with a problem that includes averaging is formally defined and ...
Anatoliy M. Tsirlin, Valdimir Kazakov
core
Advanced Science, EarlyView.A DLN dataset was built to analyze MABS composition versus in vitro/in vivo osteogenesis and angiogenesis. An MLP neural network, taking BG morphological parameters as input, extracts bioactive features from these datasets. A rabbit tibial defect model then validates 4D‐printed MABS for adaptability and bone regeneration in critical defects.
Xiongjie Liang +12 more
wiley +1 more source
The complexity of two graph orientation problems [PDF]
, 2012 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D. +7 more
core +1 more source
Advanced Science, EarlyView.Vascular Aβ40 corrupts GRP78 phase behavior in brain endothelial cells, sustaining IRE1α–TRAF2–JNK signaling and driving apoptosis, tight junction loss, and blood–brain barrier failure in cerebral amyloid angiopathy. Pharmacological IRE1α inhibition restores vascular integrity, reduces leakage, and improves functional outcomes, revealing a targetable ...
Honglin Zheng +19 more
wiley +1 more source
EXTREMAL PROBLEMS IN GRAPH THEORY: A COMBINATORIAL OPTIMIZATION PERSPECTIVE
Advances and Applications in Discrete MathematicsThe extremal theory of graphs considers the study of how large or small a graph invariant may be, according to certain constraints. The field crosses the overlying with combinatorial optimization, in which optimal configurations are studied under discrete conditions.
Thangathamizh, R. +2 more
openaire +2 more sources
Two problems in extremal combinatorics [PDF]
, 2022 In this thesis, we focus on two problems in extremal graph theory. Extremal graph theory consists of all problems related to optimizing parameters defined on graphs.
Neal Riasanovsky, Alex
core
CLRe: A Synergistic Dual‐Engine Framework for One‐Step Retrosynthesis Prediction
Advanced Science, EarlyView.CLRe uses a contrastive difficulty score to order pretrained seq2seq fine‐tuning for retrosynthesis. Reaction embeddings define the ranking score, and a cumulative easy‐to‐hard schedule expands from the easiest subset to the full training set while earlier examples remain active.
Tianhao Su +5 more
wiley +1 more source
Problems in extremal graphs and poset theory
, 2018 In this dissertation, we present three different research topics and results regarding such topics. We introduce partially ordered sets (posets) and study two types of problems concerning them-- forbidden subposet problems and induced-poset-saturation problems. We conclude by presenting results obtained from studying vertex-identifying codes in graphs.
openaire +3 more sources
Toward High‐Resolution Polymeric Neural Interfaces: A Practical Guide for Electron Beam Lithography
Advanced Science, EarlyView.Electron beam lithography (EBL) enables sub‐micron patterning of polymer‐based neural implants, overcoming the resolution limits of optical lithography. By addressing challenges such as charging, non‐planarity, and substrate heating, it supports higher channel density, improved miniaturization, and better long‐term tissue integration.
Hanna Karlsson‐Fernberg, Maria Asplund
wiley +1 more source
RESEARCH ON NUMBER THEORY AND SMARANDACHE NOTIONS [PDF]
, 2010 This Book is devoted to the proceedings of the Sixth International Conference on Number Theory and Smarandache Notions held in Tianshui during April 24-25, 2010.
Wenpeng, Zhang
core +1 more source