Addressing ecological challenges from a quantum computing perspective
Abstract With increased access to data and the advent of computers, the use of statistical tools and numerical simulations is becoming commonplace for ecologists. These approaches help improve our understanding of ecological phenomena and their underlying mechanisms in increasingly complex environments.
Maxime Clenet +2 more
wiley +1 more source
Making Bipartite Graphs DM-Irreducible
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component.
Bérczi, Kristóf +3 more
openaire +2 more sources
Adjective‐based qualitative comparative analysis: Relating immobility situations across contexts
Short Abstract This paper introduces an adjective‐based qualitative comparative method for analysing complex lived experiences across diverse contexts. By identifying, harmonising, and relationally comparing salient descriptive adjectives derived from qualitative data, the approach enables structured yet interpretively rich cross‐case comparison ...
Josef Novotný +5 more
wiley +1 more source
Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms
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 +2 more
wiley +1 more source
DBGE: Employee Turnover Prediction Based on Dynamic Bipartite Graph Embedding
The issue of employee turnover is always critical for companies, and accurate predictions can help them prepare in time. Most past studies on employee turnover have focused on analyzing impact factors or using simple network centrality measures.
Xinjun Cai +6 more
doaj +1 more source
Planted Bipartite Graph Detection
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erdős-Rényi random graph over $n$ vertices with edge density $q$.
Asaf Rotenberg +2 more
openaire +2 more sources
Artificial intelligence streamlines scientific discovery of drug–target interactions
Abstract Drug discovery is a complicated process through which new therapeutics are identified to prevent and treat specific diseases. Identification of drug–target interactions (DTIs) stands as a pivotal aspect within the realm of drug discovery and development. The traditional process of drug discovery, especially identification of DTIs, is marked by
Yuxin Yang, Feixiong Cheng
wiley +1 more source
The use of different types of networks, alone and in combination, for drug target identification
Current therapeutic approaches often focus on targeting clinical symptoms or peripheral phenotypes rather than the underlying molecular mechanisms, or endophenotypes, that drive diseases. While symptom‐based drugs can alleviate discomfort, they do not necessarily alter disease progression and may overlook opportunities for prevention or early ...
Paolo Parini
wiley +1 more source
Multi-view Clustering Based on Bipartite Graph Cross-view Graph Diffusion [PDF]
Multi-view clustering is an research hotspots in the field of unsupervised learning.Recently,the method based on cross-view graph diffusion uses the complementary information between multiple views to obtain a unified graph for clustering on the basis of
WANG Jinfu, WANG Siwei, LIANG Weixuan, YU Shengju, ZHU En
doaj +1 more source
Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham +2 more
wiley +1 more source

