Results 51 to 60 of about 107,276 (264)
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
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
Designing classes’ interfaces for neural network graph model
An approach to testing artificial neural networks is described. The model of neural network is based on graph theory, and operations that are used in theoretical works devoted to graphs, trees, paths, cycles, and circuits.
Yuri Leonidovich Karpov +4 more
doaj +1 more source
Orthogonal Tree Decompositions of Graphs [PDF]
This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bag from the second decomposition. We show that every graph in each of the following classes has a tree decomposition and a linear-sized path decomposition with bounded intersections: (1 ...
Vida Dujmović +4 more
openaire +3 more sources
A chiral photodetector capable of selectively distinguishing left‐ and right‐handed circularly polarized light is experimentally demonstrated. The device, which features a nanopatterned electrode inverse‐designed by a genetic algorithm within a metal–dielectric–metal nanocavity that incorporates a vacuum‐deposited small‐molecule multilayer, exhibits ...
Kyung Ryoul Park +3 more
wiley +1 more source
Online graph exploration on trees, unicyclic graphs and cactus graphs [PDF]
We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the searcher's goal is to visit every vertex of the graph before returning to the start node on a tour as short as ...
openaire +3 more sources
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration
Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley +1 more source
System Response Analysis and Model Order Reduction, Using Conventional Method, Bond Graph Technique and Genetic Programming [PDF]
This research paper basically explores and compares the different modeling and analysis techniques and than it also explores the model order reduction approach and significance.
Lubna Moin, Vali Uddin, Shahid Ali
doaj
On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k.
Matsumura Hajime
doaj +1 more source
Parallel 3D Bioprinting on SLIPS‐Microarrays
This work introduces the first truly parallel 3D bioprinting method, enabling both the simultaneous fabrication of hundreds of cell laden hydrogel 3D structures and their HTS in individual liquid compartments. By integrating Digital Light Processing (DLP) stereolithography with functional micropatterns, the platform decouples printing time from array ...
Julius von Padberg +3 more
wiley +1 more source

