Results 51 to 60 of about 1,157,729 (290)

Hamiltonian Dynamics in the Theory of Abstraction [PDF]

open access: yes, 2012
This paper deals with fluid flow dynamics which may be Hamiltonian in nature and yet chaotic.Here we deal with sympletic invariance, canonical transformations and stability of such Hamiltonian flows. As a collection of points move along, it carries along
Ganguly, Subhajit   +1 more
core   +1 more source

Hamiltonian paths and hamiltonian connectivity in graphs

open access: yesDiscrete 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   +3 more sources

Triangle-different Hamiltonian paths

open access: yesJournal of Combinatorial Theory, Series B, 2018
Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian paths is equal to the number of balanced bipartitions of the ground set, answering a question of ...
István Kovács, Daniel Soltész
openaire   +5 more sources

Hamiltonian path based shadow removal [PDF]

open access: yesProcedings of the British Machine Vision Conference 2005, 2005
For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost as an object crosses over a shadow boundary. Recently, it has been shown that it is possible to remove shadows from images.
Fredembach, Clément, Finlayson, Graham
openaire   +2 more sources

Hamiltonian path, routing, broadcasting algorithms for connected square network graphs

open access: yesEngineering Science and Technology, an International Journal, 2023
Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant.
Burhan Selçuk   +1 more
doaj   +1 more source

Construction of discrete-time model for port-controlled Hamiltonian systems with applications [PDF]

open access: yes, 2006
The issues of constructing a discrete-time model for Hamiltonian systems are in general different from those for dissipative systems. We propose an algorithm for constructing an approximate discrete-time model, which guarantees Hamiltonian conservation ...
Astolfi, A.,   +4 more
core   +1 more source

De-Signing Hamiltonians for Quantum Adiabatic Optimization [PDF]

open access: yesQuantum, 2020
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization.
Elizabeth Crosson   +3 more
doaj   +1 more source

FBSDEs with time delayed generators:L-P-solutions, differentiability, representation formulas and path regularity [PDF]

open access: yes, 2011
We extend the work of Delong and Imkeller (2010) [6,7] concerning backward stochastic differential equations with time delayed generators (delay BSDEs). We give moment and a priori estimates in general L-p-spaces and provide sufficient conditions for the
Gonçalo dos Reis   +5 more
core   +1 more source

Covalent Functionalization of 2D Semiconductors: A Roadmap to Advanced Electronic Devices

open access: yesAdvanced Functional Materials, EarlyView.
This Review presents recent advances in the covalent functionalization strategies for two‐dimensional semiconductors and their implementation in modern technologies. Layered materials are modified through diverse molecular chemistries (e.g., thiols, diazonium salts, alkyl halides, and electron‐deficient species) to tailor their surface properties ...
Ramiro Quirós‐Ovies   +2 more
wiley   +1 more source

A new optimization-driven path planning method with probabilistic completeness for wheeled mobile robots

open access: yesMeasurement + Control, 2019
Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map.
Bo You   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy