Results 111 to 120 of about 153,964 (249)
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jendrol’, Stanislav +2 more
openaire +2 more sources
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 +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 +4 more
wiley +1 more source
The FEBS Journal, EarlyView.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
Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3
Journal of MathematicsLet 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
Covering a graph by complete bipartite graphs
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdős, P., Pyber, L.
openaire +2 more sources
The R203W substitution drives PACS‐1 syndrome by disrupting intramolecular regulation
The FEBS Journal, EarlyView.The middle region (MR) of PACS‐1 controls engagement with specific partner proteins. This manuscript presents the structure of the Furin binding region (FBR) and how interactions with partners are regulated through the interplay between a basic patch in the FBR and an acidic cluster in the MR.
Troy C. Krzysiak +7 more
wiley +1 more source
Post‐transcriptional regulatory networks: The dynamic interplay of RNA‐binding proteins
The FEBS Journal, EarlyView.Post‐transcriptional gene expression regulation is controlled by RNA‐binding proteins (RBPs), which influence many processes including splicing, localization, translation, and decay. Rather than acting alone, RBPs bind RNAs combinatorially, forming complex, context‐dependent regulatory networks.
Lena A. Street +2 more
wiley +1 more source
Cluttered orderings for the complete bipartite graph
Discrete Applied Mathematics, 2005 To minimize the access cost in large disk arrays (RAID) Cohen, Colbourn, and Froncek introduced and investigated in a series of papers the concept of (d, f)-cluttered orderings of various set systems, d, f ∈ N.
Meinard Müller +2 more
semanticscholar +1 more source
International Transactions in Operational Research, EarlyView.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