Results 131 to 140 of about 43,364 (297)
The 0-1 inverse maximum stable set problem [PDF]
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal.
Yerim Chung, Marc Demange
core
ML Workflows for Screening Degradation‐Relevant Properties of Forever Chemicals
The environmental persistence of per‐ and polyfluoroalkyl substances (PFAS) necessitates efficient remediation strategies. This study presents physics‐informed machine learning workflows that accurately predict critical degradation properties, including bond dissociation energies and polarizability.
Pranoy Ray +3 more
wiley +1 more source
SDS‐CRISPR for Single‐Nucleotide Variant Detection
Structure‐disruption‐sensitive CRISPR (SDS‐CRISPR) converts structural instability into single‐nucleotide precision, thereby overcoming mismatch tolerance in canonical Cas12a and enabling versatile diagnostics across DNA, RNA, and microRNA targets. When applied to rapid IDH1 mutation detection for glioma genotyping and integrated with lateral‐flow ...
Xin Guan +12 more
wiley +1 more source
Perfect Roman domination in middle graphs [PDF]
Kijung Kim
doaj +1 more source
Some classes of strongly perfect graphs
A graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equal to the maximum number of mutually adjacent vertices in it.
Ravindra, G.
core +1 more source
The 3rd‐generation magnetic super‐stable mineralizer M‐MgAl‐700 features a core‐shell structure, strong superparamagnetism, large surface area, and abundant oxygen defects. It achieves exceptional Cd(II) and As(V) mineralization capacities, reducing both pollutants in co‐contaminated water and soil to meet national standards.
Haoran Wang +9 more
wiley +1 more source
Coordinated graphs and clique graphs of clique-Helly perfect graphs
Publicación ISIA new class of graphs related to perfect graphs is defined in this work: coordinated graphs. A graph G is coordinated if the cardinality of a maximum set of cliques of H with a common vertex is equal to the cardinality of a minimum ...
Groshaus, Marina +2 more
core
After spinal cord injury, adult microglia remain persistently activated with chronic PRMT6 (protein arginine methyltransferase 6) upregulation. Prmt6 deficiency or inhibition reestablishes microglial homeostasis and promotes a scar‐limited repairment, enhancing axonal regrowth.
Weilin Peng +9 more
wiley +1 more source
CMOS‐Integrated Synaptic Photoreceptor Chip Inspired by Insect Visual Processing
CMOS‐integrated Si QDs/ReS2 synaptic photoreceptor array mimics the parallel processing and wavelength‐selective strategy of insect vision. By combining intrinsic ultraviolet‐violet sensitivity with synaptic plasticity, the chip enables frontend sensory redundancy reduction without external filters, offering a scalable pathway toward lowpower ...
Jian Chai +25 more
wiley +1 more source
The Structure of Claw-Free Perfect Graphs [PDF]
In 1988, Chvátal and Sbihi [4] proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs.
Matthieu Plumettaz, Maria Chudnovsky
core

