Results 91 to 100 of about 435,592 (297)
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
Advanced Functional Materials, EarlyView.A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
IEEE Access, 2020 Robot calibration of an industrial robot is of importance for those applications requiring high positioning accuracy. The use of numerical optimization techniques to identify the accurate kinematic parameters and tackle the residual errors for improving ...
Jen-Chung Hsiao +3 more
doaj +1 more source
Constructing Confidence Sets for the Matrix Completion Problem [PDF]
, 2018 In the present note we consider the problem of constructing honest and adaptive confidence sets for the matrix completion problem. For the Bernoulli model with known variance of the noise we provide a realizable method for constructing confidence sets that adapt to the unknown rank of the true matrix.
Carpentier, Alexandra +2 more
openaire +2 more sources
Photonic Engineering Enables All‐Passive Upconversion Imaging with Low‐Intensity Near‐Infrared Light
Advanced Functional Materials, EarlyView.A passive upconversion imaging system enables the observation of scenes illuminated by low‐intensity incoherent near‐infrared light from 750 to 930 nm, by converting it into the visible without the use of external power. The upconverter is enabled by triplet–triplet annihilation in a bulk heterojunction, with absorption enhanced by plasmonic resonators
Rabeeya Hamid +13 more
wiley +1 more source
The doubly negative matrix completion problem
Linear Algebra and its Applications, 2005 This paper deals with the types of graphs assuring the existence of doubly negative matrix completions of partial doubly negative matrices of order \(n\). It is shown that every partial doubly negative matrix whose associated graph is a \(p\)-chordal graph has a doubly negative matrix completion if and only if \(p\) = 1.
Araújo, C. Mendes +2 more
openaire +2 more sources
Advanced Functional Materials, EarlyView.This research presents a novel implantable bio‐battery, GF‐OsG, tailored for diabetic bone repair. GF‐OsG generates microcurrents in high‐glucose conditions to enhance vascularization, shift macrophages to the M2 phenotype, and regulate immune responses.
Nanning Lv +10 more
wiley +1 more source
Strong NP-completeness of a matrix similarity problem
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. BRIMKOV +3 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.Lead halide perovskite nanocrystals are promising scintillators but suffer from reabsorption losses and limited compatibility with high‐Z additives. Hybridization of CsPbBr3 nanocrystals with PbBr2‐passivated HfO2 nanoparticle sensitizers, achieved during or after synthesis, produces stable composites with maintained optical quality, improved ...
Francesco Bruni +17 more
wiley +1 more source
BMC Pediatrics, 2018 Background Preterm infants are especially vulnerable to pain. The intensive treatment often necessary for their survival unfortunately includes many painful interventions and procedures.
Emma Olsson +10 more
doaj +1 more source
The N-matrix completion problem under digraphs assumptions
Linear Algebra and its Applications, 2004 A real partial matrix is an \(n \times n\) array in which some entries are specified, while the remaining entries are free to be chosen. An \(n \times n\) partial matrix is said to be \textit{combinatorially symmetric} if the \((i,j)\) entry is specified if and only if the \((j,i)\) entry is specified, and non-combinatorially symmetric in the opposite ...
Araújo, C. Mendes +2 more
openaire +2 more sources