Results 101 to 110 of about 2,876,957 (249)

Generating Compressed Counterfactual Hard Negative Samples for Graph Contrastive Learning

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Graph contrastive learning (GCL) relies on acquiring high‐quality positive and negative samples to learn the structural semantics of the input graph. Previous approaches typically sampled negative samples from the same training batch or an irrelevant external graph.
Haoran Yang, Hongxu Chen, Xiangyu Zhao, Sixiao Zhang, Xiangguo Sun, Qian Li, Hongzhi Yin, Guandong Xu   +7 more
wiley   +1 more source

Coalition Graphs of Complete Bipartite Graphs

Academic Science Journal
A coalition in a graph G= (V, E) consists of two disjoint, non-dominating vertex subsets whose union forms a dominating set, and a coalition graph is constructed from a coalition partition by representing each part as a vertex and connecting two parts ...
Rawaa Khalil Ibrahim
doaj   +1 more source

Drivers of Host–Pathogen Community Assemblages in European Forests and Urban Green Spaces

Integrative Zoology, EarlyView.
ABSTRACT Despite advances in understanding infectious diseases, the persistence and re‐emergence of wildlife pathogens continue to raise public and veterinary health concerns. This study investigates the relationship between biodiversity and rodent‐borne diseases in Europe, focusing on habitat alterations and their impact on rodent diversity.
Vincent Sluydts, Marie Bouilloud, Maxime Galan, Hussein Alburkat, Anaïs Bordes, Vincent Bourret, Valeria Colombo, Luc DeBruyn, Lara Dutra, Jana Eccard, Jasmin Firozpoor, Romain Gallet, Maciej Grzybek, Heikki Henttonen, Jens Jacob, Andrew McManus, Tarja Sironen, Peter Stuart, Caroline Tatard, Benjamin Roche, Herwig Leirs, Nathalie Charbonnel   +21 more
wiley   +1 more source

Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3

Journal of Mathematics
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj   +1 more source

Strong Domination in Fuzzy Graphs

Fuzzy Information and Engineering, 2015
In this paper, the concept of strong domination number is introduced by using membership values of strong arcs in fuzzy graphs. The strong domination number γs of complete fuzzy graph and complete bipartite fuzzy graph is determined and bounds is ...
O.T. Manjusha, M.S. Sunitha
doaj   +1 more source

Endogenous coalition formation in policy debates

American Journal of Political Science, EarlyView.
Abstract Political actors form coalitions around their joint normative beliefs in order to influence the policy process on contentious issues such as climate change or population aging. Policy process theory maintains that learning within and across coalitions is a central predictor of policy change but has yet to explain how policy learning works ...
Philip Leifeld, Laurence Brandenberger
wiley   +1 more source

Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim, Hans Friedrich Köhn, Chia‐Yi Chiu   +2 more
wiley   +1 more source

Story2Board: A Training‐Free Approach for Expressive Visual Storytelling

Computer Graphics Forum, EarlyView.
Abstract We present Story2Board, a training‐free framework for expressive storyboard generation from natural language. Existing methods narrowly focus on subject identity, overlooking key aspects of visual storytelling such as spatial composition, background evolution, and narrative pacing.
D. Dinkevich, M. Levy, O. Avrahami, D. Samuel, D. Lischinski   +4 more
wiley   +1 more source

General Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph

International Journal of Mathematics and Mathematical Sciences, 2007
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs.
R. A. El-Shanawany, M. Sh. Higazy
doaj   +1 more source

Quantitative Metrics for Edge Bundling of Network Visualizations

Computer Graphics Forum, EarlyView.
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger, J. Miller, A. Maftei, S. G. Kobourov   +3 more
wiley   +1 more source