Results 211 to 220 of about 8,762 (265)
This study shows that a PARP inhibitor combined with anlotinib, administered as bridging therapy, preconditions the tumor microenvironment to enhance the infiltration and antitumor activity of subsequently infused CAR‐T cells across preclinical ovarian cancer models, supporting bridging therapy as a promising strategy to address limited CAR‐T cell ...
Huayi Li +20 more
wiley +1 more source
A Robotic Testing Platform for Pipelined Discovery of Resilient Dielectric Elastomer Actuators
This work introduces a robotic testing platform enabling high‐throughput, multi‐parameter lifetime mapping of linear dielectric elastomer actuators (DEAs). By integrating programmable high‐voltage control and automated electromechanical measurements, the system identifies material and operating conditions that double actuator lifetime.
Ang (Leo) Li +10 more
wiley +1 more source
This work identified CPD3a as a potent, stable C‐nucleoside cordycepin derivative. When formulated into microneedle array for topical treatment, it ameliorated psoriasis by rebalancing immunity and enhancing antioxidant defenses. ABSTRACT Psoriasis is a chronic inflammatory disorder characterized by immune dysregulation and epidermal hyperplasia ...
Wenfang Pan +7 more
wiley +1 more source
A Small‐Molecule DEPTAC Rescues Cognitive Deficits by Targeted Dephosphorylation of Pathological Tau
TP2 is a fully synthetic small‐molecule dephosphorylation‐targeting chimera that recruits endogenous PP2A‐Bα to Tau, enabling targeted removal of pathological phosphate modifications. In two tauopathy mouse models, systemic TP2 reduces Tau pathology, preserves neuronal and synaptic integrity, improves neuroimmune homeostasis, and rescues cognition ...
Fei Sun +12 more
wiley +1 more source
In this study, MPDA NPs were engineered to encapsulate CTT. To further increase renal accumulation of CTT, L‐serine was conjugated to the surface of the MPDA nanoparticles (CTT/MPDA@L‐Ser NPs). CTT/MPDA@L‐Ser NPs inhibit DPEP1 activity, thereby restoring ferroptosis defense mechanisms through upregulation of GPX4 and SLC7A11 expression, ultimately ...
Wanbing Qin +12 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Systems Integration '90. Proceedings of the First International Conference on Systems Integration, 2002
A general methodology for solving variations and generalizations of the vehicle routing problem (VRP) is discussed. A notation for specifying and solving a wide variety of such problems is described. The notation has two parts: a static graph-theoretic structure called a hierarchical constraint graph (HCG) and a control structure called a policy.
Bruce MacLeod, Robert Moll
openaire +2 more sources
A general methodology for solving variations and generalizations of the vehicle routing problem (VRP) is discussed. A notation for specifying and solving a wide variety of such problems is described. The notation has two parts: a static graph-theoretic structure called a hierarchical constraint graph (HCG) and a control structure called a policy.
Bruce MacLeod, Robert Moll
openaire +2 more sources
Capacitated Vehicle Routing on Trees
Operations Research, 1991T = (V, E) is a tree with nonnegative weights associated with each of its vertices. A fleet of vehicles of capacity Q is located at the depot represented by vertex v1. The Capacitated Vehicle Routing Problem on Trees (TCVRP) consists of determining vehicle collection routes starting and ending at the depot such that: the weight associated with any ...
Labbé, Martine +2 more
openaire +4 more sources
The rendezvous vehicle routing problem
Optimization Letters, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce L. Golden +2 more
openaire +1 more source
Vehicle Routing with Time Windows
Operations Research, 1987In vehicle routing problems with time windows, a fixed fleet of vehicles of limited capacity is available at a depot to serve a set of clients with given demands. Each client must be visited within a given time window. We describe a branch-and-bound method that minimizes the total route length, and present some computational results.
Antoon W. J. Kolen +2 more
openaire +2 more sources

