Results 31 to 40 of about 494,508 (266)

Counting Problems and Clones of Functions [PDF]

open access: yes2009 39th International Symposium on Multiple-Valued Logic, 2009
Counting solutions of various combinatorial problems is a well established and intensively studied area of theoretical computer science. Its applications range from networking to statistical physics. The central question in this area is the complexity of and algorithms for problems of this type. It turns out that in many important cases these questions
openaire   +2 more sources

Early Body Mass Index z‐Score Change and Resolution of Severe Malnutrition in Children With Sickle Cell Anemia in a Low‐Income Setting: A Prospective Single‐Arm Extension Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Children with sickle cell anemia (SCA) in low‐income settings are at risk of severe malnutrition, but optimal nutritional management has not been established. We evaluated an intensified ready‐to‐use therapeutic food (RUTF) regimen in children with persistent severe malnutrition after initial treatment and assessed whether early ...
Safiya Gambo   +9 more
wiley   +1 more source

The angular value distribution of analytic and random analytic functions (in Ukrainian) [PDF]

open access: yesМатематичні Студії, 2012
Let $ainmathbb{C}$, $f(z)=sum c_nz^n$ be an analyticfunction in the disk $|z|
P. V. Filevych, M. P. Mahola
doaj  

Function Synthesis for Maximizing Model Counting

open access: yes, 2023
Given a boolean formula $Φ$(X, Y, Z), the Max\#SAT problem asks for finding a partial model on the set of variables X, maximizing its number of projected models over the set of variables Y. We investigate a strict generalization of Max\#SAT allowing dependencies for variables in X, effectively turning it into a synthesis problem.
Thomas Vigouroux   +3 more
openaire   +2 more sources

Comparative Drug Response Profiling in Neuroblastoma Cell Lines and Patient‐Derived Tumor Organoids

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT High‐risk neuroblastoma remains a leading cause of pediatric cancer mortality, and improved preclinical models are needed to guide therapeutic developments. We screened seven high‐risk neuroblastoma cell lines and three patient‐derived tumor organoids with 528 compounds alongside bone marrow controls, and compared them with external datasets ...
Krzysztof Wierbiłowicz   +12 more
wiley   +1 more source

YOLO POD: a fast and accurate multi-task model for dense Soybean Pod counting

open access: yesPlant Methods, 2023
Background The number of soybean pods is one of the most important indicators of soybean yield, pod counting is crucial for yield estimation, cultivation management, and variety breeding. Counting pods manually is slow and laborious.
Shuai Xiang   +4 more
doaj   +1 more source

Counting Dimensions of L-Harmonic Functions [PDF]

open access: yesThe Annals of Mathematics, 2000
14 pages, published version, abstract added in ...
Li, Peter, Wang, Jiaping
openaire   +3 more sources

Retrospective Analysis of Donor Lymphocyte Infusions in Pediatric Patients With Mixed Chimerism After Hematopoietic Stem Cell Transplantation

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Allogeneic hematopoietic stem cell transplantation (alloHSCT) is an essential therapy for several malignant and nonmalignant diseases, but relapse and graft loss remain the principal threats to its success. Routine monitoring of chimerism and minimal residual disease (MRD) enables early detection of imminent recurrence and guides ...
Carmen Junk   +10 more
wiley   +1 more source

Pediatric Idiopathic Multicentric Castleman Disease Is Often Severe But Responsive to Siltuximab

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Idiopathic multicentric Castleman disease (iMCD) is a potentially fatal immunologic disorder marked by widespread lymphadenopathy and inflammation. Siltuximab, an interleukin‐6 (IL‐6) inhibitor, is the only FDA‐approved treatment for adult patients with iMCD.
Bridget Austin   +17 more
wiley   +1 more source

Counting Homomorphisms and Partition Functions

open access: yesCoRR, 2011
Homomorphisms between relational structures are not only fundamental mathematical objects, but are also of great importance in an applied computational context. Indeed, constraint satisfaction problems (CSPs), a wide class of algorithmic problems that occur in many different areas of computer science such as artificial intelligence or database theory ...
Martin Grohe, Marc Thurley
openaire   +4 more sources

Home - About - Disclaimer - Privacy