Results 111 to 120 of about 586,356 (320)

Closed orders and closed graphs

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Crupi Marilena
doaj   +1 more source

s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs [PDF]

open access: green, 2022
Dibyayan Chakraborty   +3 more
openalex   +1 more source

Evaluation of a novel EHR sidecar application to display RA clinical outcomes during clinic visits: results of a stepped‐wedge cluster randomized pragmatic trial

open access: yesArthritis Care &Research, Accepted Article.
Objective We developed a novel EHR sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk   +16 more
wiley   +1 more source

Association Between Symptomatic Knee Osteoarthritis and Target Glycemic Control in Individuals with Type 2 Diabetes

open access: yesArthritis Care &Research, Accepted Article.
Objective Knee osteoarthritis (OA) commonly affects individuals with Type 2 diabetes (T2DM) and is associated with increased risk of diabetes‐related complications. To better understand potential mechanisms, we examined the association between symptomatic knee OA and glycemic control in individuals with T2DM.
Lauren K. King   +10 more
wiley   +1 more source

On Generalizations of Pairwise Compatibility Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri   +3 more
doaj   +1 more source

Optimized Time–Frequency Analysis for Induction Motor Fault Detection Using Hybrid Differential Evolution and Deep Learning Techniques

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva   +4 more
wiley   +1 more source

Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley   +1 more source

Interval line graphs

open access: yesDiscrete Mathematics, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Synergistic Roles of FAHD‐1 and PYC‐1 in Mitochondrial Function, Behavior, and Longevity in C. elegans

open access: yesAdvanced Biology, EarlyView.
FAHD‐1 and PYC‐1 catalyze opposing mitochondrial reactions that regulate oxaloacetate homeostasis in Caenorhabditis elegans. Using single and double knockouts, this study reveals that both enzymes shape locomotion, reproduction, respiration, and lifespan.
Riccardo Giaquinta   +3 more
wiley   +1 more source

Interval Edge-Colorings of Cartesian Products of Graphs I

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers.
Petrosyan Petros A.   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy