23 papers · ranked by Valyu relevance
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the balanced -way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on nodes, our goal is to partition the node set into parts of size at most (1 + ) · each, while minimizing the cost of the partitioning, defined as the number of cut…
Marcelo Fonseca Faraj, Christof Schulz
Partitioning a graph into balanced blocks such that few edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge graphs are streaming algorithms, which use low computational resources. In this work, we present a shared-memory streaming multi-recursive…
Franz Classe, Christoph Kern
Differential item functioning (DIF) is a common challenge when examining latent traits in large scale surveys. In recent work, methods from the field of machine learning such as model-based recursive partitioning have been proposed to identify subgroups with DIF when little theoretical guidance and many potential…
Manlio Migliorati, Marica Manisera, Paola Zuccolotto
In this contribution, we investigate the importance of Oliver’s Four Factors, proposed in the literature to identify a basketball team’s strengths and weaknesses in terms of shooting, turnovers, rebounding and free throws, as success drivers of a basketball game. In order to investigate the role of each factor in the…
Zhifei Li, Hongbo Wen
Identifying causal directions among variables via data-driven approaches is a research hotspot. Researchers now focus on detecting causal direction heterogeneity among multiple variables (variables more than two) when covariates cause such heterogeneity. This study combines the structural equation likelihood function…
Wumwi Sun, Hongwei Liu, Xiaoyu Wang
The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and propose a recursive bipartition algorithm based on the subspace minimization conjugate…
Leo Kotipalo, Markus Battarbee, Yann Pfau-Kempf, Vertti Tarvus + 1 more
'Minna Palmroth'] We consider first hypergraph partitioning via an algorithm called parallel hypergraph partitioner (PHG); this is done by partitioning a simplified grid and then attempting to optimize the solution on the finer grid. The second and third are the geometric methods of recursive coordinate bisection (RCB)…
Omnes Loïc, Angel Eric, Bartet Pierre, Radvanyi François + 1 more
The accurate prediction of RNA secondary structure, and pseudoknots in particular, is of great importance in understanding the functions of RNAs since they give insights into their folding in three-dimensional space. However, existing approaches often face computational challenges or lack precision when dealing with…
Alexander F. Siegenfeld, Yaneer Bar-Yam, António Lopes
Ashby’s law of requisite variety allows a comparison of systems with their environments, providing a necessary (but not sufficient) condition for system efficacy: A system must possess at least as much complexity as any set of environmental behaviors that require distinct responses from the system. However, to account…
Carbonell Juan Pablo, Solsona, José E., Szasz + 3 more
We provide full certifications of two versions of merge sort of arrays in the verification-aware programming language Dafny. We start by considering schemas for applying the divide-and-conquer or partition method of solution to specifications given by pre- and post-conditions involving linear arrays. We then derive the…
Marius Tacke, Matthias Busch, Kevin Linka, Christian Cyron + 1 more
Datasets often incorporate various functional patterns related to different aspects or regimes, which are typically not equally present throughout the dataset. We propose a novel partitioning algorithm that utilizes competition between models to detect and separate these functional patterns. This competition is induced…
Shijie Xu, Akira Onoda
Phylogenetics has been widely used in molecular biology to infer the evolutionary relationships among species. With the rapid development of sequencing technology, genomic data with thousands of sites becomes increasingly common in phylogenetic analysis, while heterogeneity among sites arises as one of the major…
Panagiotis Sioulas, Ioannis Mytilinis, Anastasia Ailamaki
Analytical tools often require real-time responses for highly concurrent parameterized workloads. A common solution is to answer queries using materialized subexpressions, hence reducing processing at runtime. However, as queries are still processed individually, concurrent outstanding computations accumulate and…
Authors not listed
We present a simple yet efficient random (brute-force) algorithm for constructing solvated molecular systems. By placing solvent molecules at random positions and orientations within a simulation box, we circumvent the complexities typically associated with more sophisticated packing algorithms. The main computational…
Siyu Yun, Xinsheng Wang, Giovanni Angiulli
As the core engine of electronic design automation (EDA) tools, the efficiency of Boolean Satisfiability Problem (SAT) solver largely determines the cycle of integrated circuit research and development. The effectiveness of SAT solvers has steadily turned into the key bottleneck of circuit design cycle due to the…
Felix Teufel, Magnús Halldór Gíslason, José Juan Almagro Armenteros, Alexander Rosenberg Johansen + 2 more
'José Juan Almagro\xa0Armenteros' 'Alexander\xa0Rosenberg Johansen' 'Ole Winther' 'Henrik Nielsen'] Title: Abstract When splitting biological sequence data for the development and testing of predictive models, it is necessary to avoid too-closely related pairs of sequences ending up in different partitions. If this is…
Adriano R. Lameira, Madeleine E. Hardus, Andrea Ravignani, Teresa Raimondi + 1 more
Recursive procedures that allow placing a vocal signal inside another of similar kind provide a neuro-computational blueprint for syntax and phonology in spoken language and human song. There are, however, no known vocal patterns among nonhuman primates arranged in self-embedded combinations that evince vocal recursion…
Eleen Y. Shum, Janice H. Lai, Sixing Li, Haeun G. Lee + 5 more
Digital PCR (dPCR) was first conceived for single molecule quantitation. However, current dPCR systems often require DNA templates to share partitions due to limited partitioning capacities. Here, we introduce Ultra-dPCR, a next generation dPCR system where DNA counting is performed in a single-molecule regimen through…
Qi Zhang, Chang Liu, Stephen Wu, Ryo Yoshida
In the last few years, de novo molecular design using machine learning has made great technical progress but its practical deployment has not been as successful. This is mostly owing to the cost and technical difficulty of synthesizing such computationally designed molecules. To overcome such barriers, various methods…
Authors not listed
Accurately modeling the dynamics of open quantum systems is critical for advancing quantum technologies, yet traditional methods often struggle with balancing accuracy and efficiency. Machine learning (ML) offers a promising alternative, particularly through recursive models that predict system evolution based on the…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Authors not listed
We develop a highly parallelizable algorithm to calculate long-range electrostatic interactions named the Gauss-Legendre-Spherical-t (GLST) cubature method. Motivated by our recent spherical grid and treecode method, we utilize the Gauss-Legendre quadrature for integration over a finite range and spherical t-design for…
Andrew Simmonett, Bernard Brooks, Thomas Darden
Evaluation of noncovalent electrostatic interactions is the dominant bottleneck in classical molecular dynamics simulations, and evaluation of Coulombic matrix elements similarly limits quantum mechanical self consistent field calculations. These difficulties are a result of the Coulomb operator’s slow decay, which…