Results 91 to 100 of about 2,495,395 (314)
Advanced Functional Materials, EarlyView.A previously unreported coordination motif stabilising single Fe atoms by indigo chelation and pyridyl coordination on Au(111) has been revealed. By using planar tritopic pyridyl linkers (TPyB), extended 2D porous networks of indigo3(TPyB)2Fe6 form. These networks can be crystalline or vitreous and offer an environment where individual coordination ...
Hongxiang Xu +9 more
wiley +1 more source
Monitoring Layout and Optimisation Method Based on Minimum Weighted Vertices of Roads
Applied SciencesBy analyzing the coverage model of cameras, a surveillance camera network model based on road vertex coverage is proposed, and an optimized deployment method for cameras based on the Minimum Weighted Vertex Cover (MWVC) model is given.
Li Wang +3 more
doaj +1 more source
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem
IEEE Access, 2019 Since the membrane algorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membrane algorithms, the membranes have two functions: container and comparator.
Ping Guo, Changsheng Quan, Haizhu Chen
semanticscholar +1 more source
Reconfigurable Microenvironments Uncover Mechano‐Sensing Timescales and Direct Cell Polarity
Advanced Functional Materials, EarlyView.A synthetic DNA‐crosslinked cell culture matrix enables control over the mechanical microenvironment surrounding cells. Independent tuning of stiffness and stress relaxation uncovers distinct timescales of mechano‐sensing that regulate cell behavior.
Syuan‐Ku Hsiao +4 more
wiley +1 more source
Solving Vertex Cover Problem Using DNA Tile Assembly Model
Journal of Applied Mathematics, 2013 DNA tile assembly models are a class of mathematically distributed and parallel biocomputing models in DNA tiles. In previous works, tile assembly models have been proved be Turing-universal; that is, the system can do what Turing machine can do. In this
Zhihua Chen +3 more
doaj +1 more source
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj +1 more source
Artificial Compound Eye for Clear Vision in Harsh Environment
Advanced Functional Materials, EarlyView.Artificial compound eye (CE) with exceptional imaging and motion tracking capturing the movement of a spider and swinging thread with a wide field of view. Surface modifications ensure clear vision of alphabetic letters in rain and fog. Images captured in fog with CE remains visible 3 times longer than simple eyes (SE).
Kehinde Kassim +6 more
wiley +1 more source
On estimation of extremal entries of the principal eigenvector of a graph
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component ...
Prohelika Das, Bipanchy Buzarbarua
doaj +1 more source
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
Theory and Applications of Graphs, 2017 An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem [PDF]
, 2021 Yang Wang +2 more
openalex +1 more source