Results 41 to 50 of about 36,738 (263)

Efficacy and Safety Analysis of Roxarestat in Regulating Renal Anemia in Patients on Maintenance Hemodialysis

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye   +33 more
wiley   +1 more source

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Similarity-based parameter transferability in the quantum approximate optimization algorithm

open access: yesFrontiers in Quantum Science and Technology, 2023
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda   +10 more
doaj   +1 more source

Aplicación de la búsqueda tabú en regresión no lineal

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2009
We implement the combinatorial optimization technique known as tabu search in the parameter estimation problem in a given non linear model. For the generation of neighbors, the implementation is based on a discretization of the parameter space, which is ...
Mario A. Villalobos   +2 more
doaj   +1 more source

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

open access: yesFEBS Letters, EarlyView.
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho   +3 more
wiley   +1 more source

A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine

open access: yesIEEE Access, 2021
Ising machines are promising alternatives to solve combinatorial optimization problems, which search for their quasi-optimal solutions with high speed and high accuracy.
Keisuke Fukada   +3 more
doaj   +1 more source

Phosphatidylinositol 4‐kinase as a target of pathogens—friend or foe?

open access: yesFEBS Letters, EarlyView.
This graphical summary illustrates the roles of phosphatidylinositol 4‐kinases (PI4Ks). PI4Ks regulate key cellular processes and can be hijacked by pathogens, such as viruses, bacteria and parasites, to support their intracellular replication. Their dual role as essential host enzymes and pathogen cofactors makes them promising drug targets.
Ana C. Mendes   +3 more
wiley   +1 more source

Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent

open access: yesResults in Physics
Combinatorial optimization has wide and high-value applications in many fields of science and industry, but solving general combinatorial optimization problems is non-deterministic polynomial time (NP) hard.
Xin Yi   +5 more
doaj   +1 more source

OPTIMIZATION FOR ONE CLASS OF COMBINATORIAL PROBLEMS UNDER UNCERTAINTY

open access: yesAdaptivni Sistemi Avtomatičnogo Upravlinnâ, 2019
We formalize uncertainty and compromise solution concepts, compromise criteria and conditions for a sufficiently common class of combinatorial optimization problems which functional contains a linear convolution of weights and of arbitrary numerical ...
A. A. Pavlov
doaj   +1 more source

Home - About - Disclaimer - Privacy