Search results for "Graph theory"

Nejaušdatu testēšana tīmekļa lietotņu saskarnēm

2021

Visaptveroša testēšana ir kritisks solis programmatūras kvalitātes nodrošināšanā. Tīmekļa lietotnēs, līdzās vienības testiem, tiek izmantoti automatizēti un manuāli sistēmas testi. Šo testu rakstīšana un izpilde prasa nozīmīgus resursus. Nejaušdatu testēšana(fuzz testing) piedāvā risinājumus automatizētai testpiemēru ģenerācijai, bet šo metožu pielietojums tīmekļa saskarņu testēšanā ir maz pētīts. Darbā tiek pētītas iespējas un grūtības nejaušdatu testēšanas metožu izmantošanā tīmekļa lietotņu nejaušdatu testēšanā. Ir piedāvātas pieejas un algoritmi nejaušināmas tīmekļa saskarnes reprezentācijas izgūšanai, testpiemēru ģenerācijai un rezultātu novērtēšanai. Tāpat tiek apspriesti šo metožu iz…

An unbounded family of log Calabi–Yau pairs

2016

We give an explicit example of log Calabi-Yau pairs that are log canonical and have a linearly decreasing Euler characteristic. This is constructed in terms of a degree two covering of a sequence of blow ups of three dimensional projective bundles over the Segre-Hirzebruch surfaces ${\mathbb F}_n$ for every positive integer $n$ big enough.

Pants complex, TQFT and hyperbolic geometry

2021

We present a coarse perspective on relations of the $SU(2)$-Witten-Reshetikhin-Turaev TQFT, the Weil-Petersson geometry of the Teichm\"uller space, and volumes of hyperbolic 3-manifolds. Using data from the asymptotic expansions of the curve operators in the skein theoretic version of the $SU(2)$-TQFT, as developed by Blanchet, Habegger, Masbaum and Vogel, we define the quantum intersection number between pants decompositions of a closed surface. We show that the quantum intersection number admits two sided bounds in terms of the geometric intersection number and we use it to obtain a metric on the pants graph of surfaces. Using work of Brock we show that the pants graph equipped with this …

About Vertex Mappings

2019

Summary In [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.

UNIQUELY HAMILTONIAN GRAPHS. A TALK IN THREE PARTS

2018

Professor of UWA Gordon Royle gives a talk in Singapour devoted to UH3 graphs, graphs with unique Hamiltonian cycle with vertex degree at least three

Using 2-colorings in the theory of uniquely Hamiltonian graphs

2019

We use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractions

Graph-matching based CTA.

2009

Separating bone, calcification, and vessels in computer tomography angiography (CTA) allows for a detailed diagnosis of vessel stenosis. This paper presents a new, graph-based technique that solves this difficult problem with high accuracy. The approach requires one native data set and one that is contrast enhanced. On each data set, an attributed level-graph is derived and both graphs are matched by dynamic programming to differentiate between bone, on one hand side, and vessel/calcification on the other hand side. Lumen and calcified regions are then separated by a profile technique. Evaluation is based on data from vessels of pelvis and lower extremities of elderly patients. Due to subst…

The long road for tailored STEMI strategies but a short path for thrombus aspiration

2020

Heart rate dynamics and lactate following high-intensity race-pace continuous vs interval workouts in highly trained athletes.

2020

AbstractPurposeThe present study aimed to compare the physiological responses of high-intensity race-pace continuous vs. interval workouts commonly used in middle-distance athletics, by means of analyzing post-exercise cardiac autonomic regulation and lactate.MethodsNineteen highly-trained 800-m male runners were asked to run a 600-m race-pace continuous workout and a 2 × 4 × 200-m interval training, counterbalanced and randomized within one week of difference. Blood lactate jointly with linear and nonlinear heart rate dynamics were assessed during the immediate 15-min recovery. Age-category (Under23-Senior vs. Juvenile-Junior) was considered as an inter-subject factor.ResultsPeak lactate w…

Neural Mechanisms of Acceptance and Commitment Therapy for Chronic Pain: A Network-Based fMRI Approach

2021

AbstractOver 100 million Americans suffer from chronic pain (CP), which causes more disability than any other medical condition in the U.S. at a cost of $560-$635 billion per year (IOM, 2011). Opioid analgesics are frequently used to treat CP. However, long term use of opioids can cause brain changes such as opioid-induced hyperalgesia that, over time, increase pain sensation. Also, opioids fail to treat complex psychological factors that worsen pain-related disability, including beliefs about and emotional responses to pain. Cognitive behavioral therapy (CBT) can be efficacious for CP. However, CBT generally does not focus on important factors needed for long-term functional improvement, i…