Results 91 to 100 of about 92,446 (202)
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
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
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
In this issue, Elmaleh et al. demonstrate that the E425K mutation in DNAJC7, associated with amyotrophic lateral sclerosis, selectively abolishes one of a co‐chaperone's dual functions. High‐resolution NMR confirmed that the mutation leaves the protein's structure intact while paralyzing its communication with the Hsp70 machinery.
Tsung‐Sheng Chiang +2 more
wiley +1 more source
Forest type influence on Heliconia‐dipteran interaction networks
Responses to forest type depended on the developmental stage of dipterans. Bract traits and forest type influenced larval abundance, but forest type had no impact on adult alpha and beta diversity. Heliconia‐dipteran interaction networks showed a nested pattern for both forest types.
Diana M. Méndez‐Rojas +5 more
wiley +1 more source
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Forced Multi-Agent Bipartite Consensus Control: Application to Quadrotor Formation Flying
This work investigates the multi-agent bipartite consensus problem in the presence of switching antagonistic interactions. For leaderless multi-agent systems communicating over a structurally balanced sign graph with switching antagonistic interactions ...
Jose A. Guerrero +3 more
doaj +1 more source
Distance Biregular Bipartite Graphs
A bipartite connected graph \(B\) is called distance biregular if for every pair of vertices \(x,y\) the number of neighbours \(z\) of \(y\) such that \(d(x,z) = d(x,y) - 1\) depends only on the distance \(d(x,y)\) and the stable components containing \(x\) and \(y\). In particular all vertices of the stable component \(G\) resp.
openaire +2 more sources
Subsquares in Random Latin Squares and Rectangles
ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux +3 more
wiley +1 more source

