Results 71 to 80 of about 1,860,621 (344)
Robust and Safe Autonomous Navigation for Systems With Learned SE(3) Hamiltonian Dynamics
IEEE Open Journal of Control Systems, 2022 Stability and safety are critical properties for successful deployment of automatic control systems. As a motivating example, consider autonomous mobile robot navigation in a complex environment. A control design that generalizes to different operational
Zhichao Li, Thai Duong, Nikolay Atanasov
doaj +1 more source
Advanced Healthcare Materials, EarlyView.Polymer‐based drug delivery systems can effectively overcome the limitations of free drugs in terms of solubility, stability, and plasma half‐life, yet their development has traditionally relied on time‐consuming trial‐and‐error approaches. This review highlights recent advances in applying molecular simulation to the design of polymer‐based drug ...
Ping Gao +4 more
wiley +1 more source
On reciprocal degree distance of graphs
Heliyon, 2023 Given a connected graph H, its reciprocal degree distance is defined asRDD(H)=∑x≠ydH(vx)+dH(vy)dH(vx,vy), where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H.
Mingqiang An +3 more
doaj +1 more source
Parameterized Edge Hamiltonicity
, 2014 We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al.
AA Bertossi +27 more
core +1 more source
Advanced Materials, EarlyView.A new, solution‐processable class of optical materials based on molecular hybrids of metal oxide hydrates and commodity polymers is discussed here, including their synthesis, processing into thin films, patterning, and photonic structures realized to date.
Victoria Quirós‐Cordero +9 more
wiley +1 more source
On coefficients of path polynomials
International Journal of Mathematics and Mathematical Sciences, 1984 Explicit formulae, in terms of sugraphs of the graph, are given for the first six coefficients of the simple path polynomial of a graph. From these, explicit formulae are deduced for the number of hamiltonian paths in graphs with up to six nodes.
E. J. Farrell
doaj +1 more source
AIMS Mathematics, 2021 Noise is regarded as an unavoidable component of digital image acquisition. Hence, noise removal has been considered as one of the fundamental tasks in the field of image processing. Accordingly, excellent results have been achieved by using second-order
Abdelgader Siddig +3 more
doaj +1 more source
, 2008 The imaginary-time path integral representation of the canonical partition function of a quantum system and non-equilibrium work fluctuation relations are combined to yield methods for computing free energy differences in quantum systems using non ...
B. J. Berne +11 more
core +1 more source
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected.
openaire +2 more sources
Advanced Materials, EarlyView.In this work, perovskite–chalcohalide CsPbCl3–Pb4S3Cl2 heterostructures are exploited to study the Cl→I exchange reaction and to isolate new types of intermediate structures, in particular emissive CsPbI3–CsPbCl3–Pb4S3Cl2 heterostructures, with partial I‐alloying of the CsPbCl3 domain and at the perovskite–chalcohalide interface, having a 5.6% lattice ...
Nikolaos Livakas +12 more
wiley +1 more source