Results 71 to 80 of about 59,758 (255)

Robust Reinforcement Learning Control Framework for a Quadrotor Unmanned Aerial Vehicle Using Critic Neural Network

open access: yesAdvanced Intelligent Systems, Volume 7, Issue 3, March 2025.
Quadrotor unmanned aerial vehicle control is critical to maintain flight safety and efficiency, especially when facing external disturbances and model uncertainties. This article presents a robust reinforcement learning control scheme to deal with these challenges.
Yu Cai   +3 more
wiley   +1 more source

BMPCQA: Bioinspired Metaverse Point Cloud Quality Assessment Based on Large Multimodal Models

open access: yesAdvanced Intelligent Systems, EarlyView.
This study presents a bioinspired metaverse point cloud quality assessment metric, which simulates the human visual evaluation process to perform the point cloud quality assessment task. It first extracts rendering projection video features, normal image features, and point cloud patch features, which are then fed into a large multimodal model to ...
Huiyu Duan   +7 more
wiley   +1 more source

Intuitionistic Fuzzy Graphs with Categorical Properties

open access: yesFuzzy Information and Engineering, 2015
The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou   +3 more
doaj   +1 more source

On eternal domination and Vizing-type inequalities

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
We show sharp Vizing-type inequalities for eternal domination. Namely, we prove that for any graphs G and H, where is the eternal domination function, α is the independence number, and is the strong product of graphs.
Keith Driscoll   +4 more
doaj   +1 more source

Hamiltonicity and pancyclicity of cartesian products of graphs

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Čada, Roman, Flandrin, Evelyne, Li, Hao
openaire   +2 more sources

Rational Design of Donor‐Acceptor Oligomers for Enhanced Charge Separation

open access: yesAdvanced Physics Research, EarlyView.
How can molecular symmetry be broken to maximize photoinduced charge separation? Through first‐principles analysis of 22 DTP‐based donor‐acceptor ternary oligomers, this work establishes that combining architectural asymmetry with site‐selective acceptor fluorination creates an ideal electrostatic landscape for frontier orbital segregation.
Jannik Theile   +3 more
wiley   +1 more source

On the Crossing Numbers of Cartesian Products of Wheels and Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián   +2 more
doaj   +1 more source

On $H$-antimagicness of Cartesian product of graphs

open access: yesTURKISH JOURNAL OF MATHEMATICS, 2018
Summary: A graph \(G=(V(G),E(G))\) admits an \(H\)-covering if every edge in \(E\) belongs to a subgraph of \(G\) isomorphic to \(H\). A graph \(G\) admitting an \(H\)-covering is called \((a,d)\)-\(H\)-antimagic if there is a bijection \(f:V(G)\cup E(G) \to \{1,2,\dots, |V(G)|+|E(G)| \}\) such that, for all subgraphs \(H^\prime\) of \(G\) isomorphic ...
Bača, Martin   +3 more
openaire   +2 more sources

Functional models from limited data: A parametric and multimodal approach to anatomy and 3D kinematics of feeding in basking sharks (Cetorhinus maximus)

open access: yesThe Anatomical Record, EarlyView.
Abstract Basking sharks, Cetorhinus maximus (Gunnerus, Brugden [Squalus maximus], Det Kongelige Norske Videnskabers Selskabs Skrifter, 1765, vol. 3, pp. 33–49), feed by gaping their mouths and gill slits, greatly reorienting their cranial skeletons to filter food from water.
Tairan Li   +12 more
wiley   +1 more source

Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]

open access: yesTransactions on Combinatorics, 2017
‎Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj   +1 more source

Home - About - Disclaimer - Privacy