Results 91 to 100 of about 190,756 (265)
In graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher along an edge. The fugitive tries to avoid capture by moving along unguarded paths. The search number of a graph is the
Barrière Figueroa, Eulalia +6 more
openaire +3 more sources
A Knowledge‐Based Approach for Understanding and Managing Additive Manufacturing Data
Additive manufacturing processes generate a large amount of data. Effectively managing, understanding, and retrieving information from this data remains a major challenge. Therefore, we propose an ontology‐based approach to integrate heterogeneous data, enable semantic queries, and support decision‐making.
Mina Abd Nikooie Pour +5 more
wiley +1 more source
Privacy-preserving graph similarity search with attribute-based access control
Graph-structured data are integral to applications like social networks, biological systems, cybersecurity, and fraud detection. Outsourcing these data to public clouds offers scalability but raises privacy concerns, as encryption is required before ...
Shawal Khan +3 more
doaj +1 more source
This study examines how pore shape and manufacturing‐induced deviations affect the mechanical properties of 3D‐printed lattice materials with constant porosity. Combining µ‐CT analysis, FEM, and compression testing, the authors show that structural imperfections reduce stiffness and strength, while bulk material inhomogeneities probably enhance ...
Oliver Walker +5 more
wiley +1 more source
A Reinforcement Learning Approach for Graph Rule Learning
We study the problem of learning rules for graphs. Traditional methods often suffer from large search spaces due to the enumeration of all candidate rules. Although some recent neural logic methods are more efficient in learning rules, they are generally
Zhenzhen Mai +5 more
doaj +1 more source
Dimensi Metrik Graf Kr+mKsr, m, r, s, En
The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj +1 more source
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
We introduce a nucleic acid nanoparticle (NANP) platform designed to be rrecognized by the human innate immune system in a regulated manner. By changing chemical composition while maintaining constant architectural parameters, we identify key determinants of immunorecognition enabling the rational design of NANPs with tunable immune activation profiles
Martin Panigaj +21 more
wiley +1 more source
An Iterated Tabu Search Approach for the Clique Partitioning Problem
Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint ...
Gintaras Palubeckis +2 more
doaj +1 more source
A multivalent antiviral platform based on honeycomb‐shaped DNA nanostructures (HC–Urumin) is developed to enhance the potency and breadth of the host defense peptide Urumin. Through spatially patterned trimeric presentation, HC–Urumin disrupts influenza A virus entry, improves cell viability, and reduces disease severity in vivo‐offering a modular and ...
Saurabh Umrao +11 more
wiley +1 more source

