Results 11 to 20 of about 76,908 (313)
Total Proper Connection and Graph Operations [PDF]
A graph is said to be total-colored if all the edges and vertices of the graph are colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident ...
Yingying Zhang, Xiaoyu Zhu
openaire +2 more sources
Connective $K$-theory and Adams operations [PDF]
We investigate the relations between the Grothendieck group of coherent modules of an algebraic variety and its Chow group of algebraic cycles modulo rational equivalence. Those are in essence torsion phenomena, which we attempt to control by considering the action of the Adams operations on the Brown–Gersten–Quillen spectral ...
Haution O., Merkurjev A. S.
openaire +3 more sources
Operations in connective K-theory
In this article we classify additive operations in connective K-theory with various torsion-free coefficients. We discover that the answer for the integral case requires understanding of the $\hat{\mathbb{Z}}$ one. Moreover, although integral additive operations are topologically generated by Adams operations, these are not reduced to infinite linear ...
Merkurjev, Alexander, Vishik, Alexander
openaire +2 more sources
First-order Logic with Connectivity Operators
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size. However, FO cannot express the very simple algorithmic question whether two vertices are connected.
Nicole Schirrmacher +2 more
openaire +5 more sources
Document Binarization Based on Connected Operators [PDF]
An original binarization method based on connected operators is proposed in this paper. Connected operators enable to filter and/or segment an image by preserving its contours. The proposed binarization method enables to extract relevant document objects by means of the component-tree structure.
Naegel, Benoît, Wendling, Laurent
openaire +1 more source
Proper Vertex Connection and Graph Operations [PDF]
A path in a vertex-colored graph is a vertex-proper path if any two internal adjacent vertices differ in color. A vertex-colored graph is proper vertex k-connected if any two vertices of the graph are connected by k disjoint vertex-proper paths of the graph.
Yingying Zhang, Xiaoyu Zhu
openaire +2 more sources
The geometric νSMEFT: operators and connections
Abstract We write down a geometric realization of the Standard Model Effective Field Theory (SMEFT) extended by nf flavours of light sterile neutrinos, a so-called geoνSMEFT. As with the geoSMEFT introduced by Helset, Martin and Trott, we show that a refactorization of the νSMEFT’s operator product expansion is possible, such that ...
openaire +5 more sources
Maine Medical Center Quality and Safety Storyboards: Operational Excellence as Platform for Improvement [PDF]
Physician and other healthcare learners and clinicians must prepare to assume an active role in the design, implementation, and improvement of emerging models of health care delivery while concurrently improving quality, workflow efficiency and safety ...
core +2 more sources
Leveraging the Operational Excellence Platform for Improvement: Strengthening Culture of Safety [PDF]
Senior leaders drive the culture change by demonstrating their own commitment to safety and providing the resources to achieve results. Their consistent and sustained messages about safety help advance a culture of safety 1.
Nayak, Suneela +3 more
core +1 more source
Modelling and calculations of unsymmetrical multi-bolted connections treated as a system for different bolt models and contact layer models between the joined parts are presented. The modelling refers to preloaded and externally loaded connections.
Rafał GRZEJDA
doaj +1 more source

