Thematische Bibliographien / Weakly modular graphs

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Weakly modular graphs“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Weakly modular graphs" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Weakly modular graphs"

Chalopin, Jérémie, Victor Chepoi, Hiroshi Hirai und Damian Osajda. „Weakly Modular Graphs and Nonpositive Curvature“. Memoirs of the American Mathematical Society 268, Nr. 1309 (November 2020): 0. http://dx.doi.org/10.1090/memo/1309.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Polat, Norbert. „Fixed finite subgraph theorems in infinite weakly modular graphs“. Discrete Mathematics 285, Nr. 1-3 (August 2004): 239–56. http://dx.doi.org/10.1016/j.disc.2004.02.018.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rajkumar, R., und P. Devi. „Permutability graphs of subgroups of some finite non-abelian groups“. Discrete Mathematics, Algorithms and Applications 08, Nr. 03 (August 2016): 1650047. http://dx.doi.org/10.1142/s1793830916500476.

Der volle Inhalt der Quelle

Annotation:

In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups [Formula: see text], the generalized quaternion groups [Formula: see text], the quasi-dihedral groups [Formula: see text] and the modular groups [Formula: see text]. Further, we investigate the number of edges, degrees of the vertices, independence number, dominating number, clique number, chromatic number, weakly perfectness, Eulerianness, Hamiltonicity of these graphs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pathak, Prerna, Aklesh Pariya, V. H. Badshah und Nirmala Gupta. „Fixed Point Theorems for Kannan Contractions and Weakly Contractive Mappings on a Modular Metric Space Endowed with a Graph“. Annals of Pure and Applied Mathematics 14, Nr. 1 (10.07.2017): 77–85. http://dx.doi.org/10.22457/apam.v14n1a10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Haettel, Thomas, und Jingyin Huang. „Lattices, Garside structures and weakly modular graphs“. Journal of Algebra, September 2023. http://dx.doi.org/10.1016/j.jalgebra.2023.08.034.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cheng, Miranda C. N., Ioana Coman, Davide Passaro und Gabriele Sgroi. „Quantum Modular $\widehat Z{}^G$-Invariants“. Symmetry, Integrability and Geometry: Methods and Applications, 09.03.2024. http://dx.doi.org/10.3842/sigma.2024.018.

Der volle Inhalt der Quelle

Annotation:

We study the quantum modular properties of $\widehat Z{}^G$-invariants of closed three-manifolds. Higher depth quantum modular forms are expected to play a central role for general three-manifolds and gauge groups $G$. In particular, we conjecture that for plumbed three-manifolds whose plumbing graphs have $n$ junction nodes with definite signature and for rank $r$ gauge group $G$, that $\widehat Z{}^G$ is related to a quantum modular form of depth $nr$. We prove this for $G={\rm SU}(3)$ and for an infinite class of three-manifolds (weakly negative Seifert with three exceptional fibers). We also investigate the relation between the quantum modularity of $\widehat Z{}^G$-invariants of the same three-manifold with different gauge group $G$. We conjecture a recursive relation among the iterated Eichler integrals relevant for $\widehat Z{}^G$ with $G={\rm SU}(2)$ and ${\rm SU}(3)$, for negative Seifert manifolds with three exceptional fibers. This is reminiscent of the recursive structure among mock modular forms playing the role of Vafa-Witten invariants for ${\rm SU}(N)$. We prove the conjecture when the three-manifold is moreover an integral homological sphere.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dann, Jonas, Daniel Ritter und Holger Fröning. „GraphScale: Scalable Processing on FPGAs for HBM and Large Graphs“. ACM Transactions on Reconfigurable Technology and Systems, 13.09.2023. http://dx.doi.org/10.1145/3616497.

Der volle Inhalt der Quelle

Annotation:

Recent advances in graph processing on FPGAs promise to alleviate performance bottlenecks with irregular memory access patterns. Such bottlenecks challenge performance for a growing number of important application areas like machine learning and data analytics. While FPGAs denote a promising solution through flexible memory hierarchies and massive parallelism, we argue that current graph processing accelerators either use the off-chip memory bandwidth inefficiently or do not scale well across memory channels. In this work, we propose GraphScale, a scalable graph processing framework for FPGAs. GraphScale combines multi-channel memory with asynchronous graph processing (i. e., for fast convergence on results) and a compressed graph representation (i. e., for efficient usage of memory bandwidth and reduced memory footprint). GraphScale solves common graph problems like breadth-first search, PageRank, and weakly-connected components through modular user-defined functions, a novel two-dimensional partitioning scheme, and a high-performance two-level crossbar design. Additionally, we extend GraphScale to scale to modern high-bandwidth memory (HBM) and reduce partitioning overhead of large graphs with binary packing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Weakly modular graphs"

Nasehpour, Peyman. „Content Algebras and Zero-Divisors“. Doctoral thesis, 2011. https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-201102107989.

Der volle Inhalt der Quelle

Annotation:

This thesis concerns two topics. The first topic, that is related to the Dedekind-Mertens Lemma, the notion of the so-called content algebra, is discussed in chapter 2. Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module and $c$ the function from $M$ to the ideals of $R$ defined by $c(x) = \cap \lbrace I \colon I \text{~is an ideal of~} R \text{~and~} x \in IM \rbrace $. $M$ is said to be a \textit{content} $R$-module if $x \in c(x)M $, for all $x \in M$. The $R$-algebra $B$ is called a \textit{content} $R$-algebra, if it is a faithfully flat and content $R$-module and it satisfies the Dedekind-Mertens content formula. In chapter 2, it is proved that in content extensions, minimal primes extend to minimal primes, and zero-divisors of a content algebra over a ring which has Property (A) or whose set of zero-divisors is a finite union of prime ideals are discussed. The preservation of diameter of zero-divisor graph under content extensions is also examined. Gaussian and Armendariz algebras and localization of content algebras at the multiplicatively closed set $S^ \prime = \lbrace f \in B \colon c(f) = R \rbrace$ are considered as well. In chapter 3, the second topic of the thesis, that is about the grade of the zero-divisor modules, is discussed. Let $R$ be a commutative ring, $I$ a finitely generated ideal of $R$, and $M$ a zero-divisor $R$-module. It is shown that the $M$-grade of $I$ defined by the Koszul complex is consistent with the definition of $M$-grade of $I$ defined by the length of maximal $M$-sequences in I$. Chapter 1 is a preliminarily chapter and dedicated to the introduction of content modules and also locally Nakayama modules.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Weakly modular graphs"

Chalopin, Jeremie, Victor Chepoi, Damian Osajda und Hiroshi Hirai. Weakly Modular Graphs and Nonpositive Curvature. American Mathematical Society, 2021.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Weakly modular graphs"

Hu, Qibin, Xiaotian Wang und Qian Wang. „SGC-GCN: Constructing Stronger Feature Fusion Ability Graph Convolution for Skeleton-Based Action Recognition“. In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230871.

Der volle Inhalt der Quelle

Annotation:

Skeleton-based action recognition algorithms have made extensive use of graph topologies to model the connections between human skeletal joints. Constructing graph topology models with greater representational power is key to obtaining powerful feature extractors. However, existing methods are not as effective in achieving stronger modelling of associations between physically connected joints in the human skeleton. To tackle these concerns, we put forward an innovative approach involving a distinct graph topology - a graph convolutional neural network (SGC-GCN) that amalgamates a dynamic, refined graph topology with a static, shared graph topology. The dynamic partial feature extractor (CTR-GC) and the static partial feature extractor (SGC-GC) are used in conjunction with each other to obtain a stronger feature aggregation capability in the form of static reinforcement of dynamic weaker features and to achieve the objective of strengthening the correlation modelling between interconnected joints within the human skeletal structure. The combined use of the two also introduces only a small number of additional parameters, ensuring that the refined features are not affected by the noise of statically shared features. Combining SGC-GC with the temporal modelling module has resulted in the development of SGC-GCN, a graphical convolutional network with even greater feature aggregation capability. Our network demonstrates a remarkable performance surpassing existing advanced methods on the dataset(NTU RGB+D), yielding substantial advancements in action recognition accuracy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Weakly modular graphs"

Lin, Xin. „Advancing weakly supervised semantic segmentation using class activation map augmented with graph attention module“. In 3rd International Conference on High Performance Computing and Communication Engineering (HPCCE 2023), herausgegeben von Danilo Pelusi und Haw Su Cheng. SPIE, 2024. http://dx.doi.org/10.1117/12.3026286.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Zheng, und Liang Zhao. „Unsupervised Deep Subgraph Anomaly Detection (Extended Abstract)“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/730.

Der volle Inhalt der Quelle

Annotation:

Effectively mining anomalous subgraphs in networks is crucial for various applications, including disease outbreak detection, financial fraud detection, and activity monitoring in social networks. However, identifying anomalous subgraphs poses significant challenges due to their complex topological structures, high-dimensional attributes, multiple notions of anomalies, and the vast subgraph space within a given graph. Classical shallow models rely on handcrafted anomaly measure functions, limiting their applicability when prior knowledge is unavailable. Deep learning-based methods have shown promise in detecting node-level, edge-level, and graph-level anomalies, but subgraph-level anomaly detection remains under-explored due to difficulties in subgraph representation learning, supervision, and end-to-end anomaly quantification. To address these challenges, this paper introduces a novel deep framework named Anomalous Subgraph Autoencoder (AS-GAE). AS-GAE leverages an unsupervised and weakly supervised approach to extract anomalous subgraphs. It incorporates a location-aware graph autoencoder to uncover anomalous areas based on reconstruction mismatches and introduces a supermodular graph scoring function module to assign meaningful anomaly scores to subgraphs within the identified anomalous areas. Extensive experiments on synthetic and real-world datasets demonstrate the effectiveness of our proposed method.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Murata, Naokazu, Kinji Tamakawa, Ken Suzuki und Hideo Miura. „Micro Texture Dependence of Mechanical Properties of Electroplated Copper Thin Films Used for Thin Film Interconnection“. In ASME 2009 InterPACK Conference collocated with the ASME 2009 Summer Heat Transfer Conference and the ASME 2009 3rd International Conference on Energy Sustainability. ASMEDC, 2009. http://dx.doi.org/10.1115/interpack2009-89079.

Der volle Inhalt der Quelle

Annotation:

Electroplated copper thin films have been used for interconnection of semiconductor devices. Both the mechanical and electrical properties of the films were found to be quite different from those of bulk material, and thus, the reliability of the devices is not so high as to be expected. The main reason for the difference was found to be their micro texture. When the films consist of fine columnar grains with weak grain boundaries, their mechanical properties show strong anisotropy and complicated fracture mode. Thus, the fatigue strength of the electroplated copper thin films was measured under uniaxial stress. The mechanical properties such as the yield stress, fracture elongation and Young’s modulus of each film were quite different from those of bulk copper due to their unique micro structure. The micro texture of each film was observed by using SEM (Scanning Electro Microscope) and SIM (Scanning Ion Microscope). The low-cycle fatigue strength varied drastically depending on their micro texture, while the high-cycle fatigue strength was almost same. The fracture surfaces were observed by SEM after the fatigue test. It was found that there were two fracture modes under the fatigue test. One was a typical ductile fracture, and the other was brittle one even under the fatigue load higher than its yield stress. The crack seemed to propagate in the grains when the ductile fracture occurred since typical striations and dimples were observed clearly on the fractured surfaces. On the other hand, the crack seemed to propagate along grain boundaries of columnar grains when the brittle fracture occurred. No striations or dimples remained on the fractured surfaces. One of the reasons for this brittle fracture can be explained by cooperative grain boundary sliding of the films which consist of fine columnar grains with weak grain boundaries. These results clearly indicated that the fatigue strength of the electroplated copper thin films varies depending on their micro structure. Since the initial micro texture was found to change significantly even after the annealing at temperatures lower than 300°C, the effect of the thermal history of them after electroplating on both their micro texture and fatigue strength was investigated quantitatively. Not only the average grain size, but also the crystallographic structure of the films changed significantly depending on their thermal history, and thus, the fatigue strength of the films varied drastically. It is important, therefore, to control the micro texture of the films for assuring their reliability.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!