24 papers · ranked by Valyu relevance
Ahmed A. Zaki Diab, Ashraf M. Abdelhamid, Hamdy M. Sultan
This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue.…
Arsineh Boodaghian Asl, Jayanth Raghothama, Adam S. Darwich, Sebastiaan Meijer
'Sebastiaan Meijer'] Hospitals are complex systems, and the flow of patients is dynamic and nonlinear in such systems. Network representation allows flow algorithms to observe bottlenecks as candidates for optimisation. To model the dynamic behaviour of the patient flow, we need to consider the variability in arrival…
Jiaxin Jiang, Yunxiang Zhao, Lyu Xu, Byron Choi + 3 more
—Transaction flow networks are crucial in detecting illicit activities such as wash trading, credit card fraud, cashback arbitrage fraud, and money laundering. Our collaborator, Grab, a leader in digital payments in Southeast Asia, faces increasingly sophisticated fraud patterns in its transaction flow networks. In…
Zengkai Wang, Weizhi Liao, Xiaoyun Xia, Zijia Wang + 3 more
'Heming Jia' 'Xuewen Xia'] Routing and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm. Specifically, we introduce a flow grouping method that leverages the greatest common divisor to optimize…
Gramoz Goranci, Monika Henzinger
The maximum flow problem is one of the cornerstone and the most studied problem in combinatorial optimization. It is often used as subroutine for solving other prominent graph problems (e.g., Gomory-Hu Trees [8], Sparsest Cut [17]), performing divide-and-conquer on graphs and has found several applications across many…
Juntong Luo, Scott Sallinen, Matei Ripeanu
—Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for relatively simple algorithms like PageRank, breadth-first search, and connected…
Ron Sheinin, Shai Dulberg, Ayelet Kaminitz, Roded Sharan + 1 more
Cell-cell crosstalk involves simultaneous interactions of multiple receptors and ligands, followed by downstream signaling cascades working through receptors converging at dominant transcription factors which then integrate and propagate multiple signals into a cellular response. Single cell RNAseq of multiple cell…
Authors not listed
Fragment-based drug design (FBDD) has become a key approach in structure-based drug discovery, allowing researchers to systematically develop molecular fragments into potent ligands. Although recent generative AI models, such as diffusion-based approaches, show great potential for designing new molecules, applying them…
Shruthi Kannappan, Ashwina Kumar, Rupesh Nasre
MaxFlow is a fundamental problem in graph theory and combinatorial optimisation, used to determine the maximum flow from a source node to a sink node in a flow network. It finds applications in diverse domains, including computer networks, transportation, and image segmentation. The core idea is to maximise the total…
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Expander graphs are known to be robust to edge deletions in the following sense: for any online sequence of edge deletions e1, e2, . . . , ek to an m-edge graph G that is initially a ϕexpander, the algorithm can grow a set P ⊆ V such that at any time t, G[V \ P] is an expander of the same quality as the initial graph G…
Francisco Sena, Eliel Ingervo, Shahbaz Khan, Andrey Prjibelski + 2 more
A decomposition of a network flow is a set of weighted paths whose superposition equals the flow. The problem of characterising and computing safe walks for flow decompositions has so far seen only a partial solution by restricting the flow decomposition to consist of paths, and the graph to be directed and acyclic…
Krishneel Deo, Kaylash Chaudhary, Mansour Assaf, Ahyoung Lee
Quality of Service (QoS) is a mechanism used in computer networks to prioritize, classify, and treat packets differently based on certain criteria. This helps the switching devices to schedule and reorder packets if there is congestion in the network. Edge routers experience high traffic congestion as a result of…
Ke Chen, Abhishek Talesara, Sanchal Thakkar, Mingfu Shao
The minimum flow decomposition problem abstracts a set of key tasks in bioinformatics, including metagenome and transcriptome assembly. These tasks, collectively known as multi-assembly, aim to reconstruct multiple genomic sequences from reads obtained from mixed samples. The reads are first organized into a directed…
Fernando H. C. Dias, Alexandru I. Tomescu
Minimum flow decomposition (MFD) is a common problem across various fields of Computer Science, where a flow is decomposed into a minimum set of weighted paths. However, in Bioinformatics applications, such as RNA transcript or quasi-species assembly, the flow is erroneous, since is obtained from noisy read coverages.…
Sebastiano Montante, Daniel Yokosawa, Leon Li, Alexander Butyaev + 17 more
Manual flow cytometry gating requires up to one hour per sample with 32% inter-expert variability, creating critical bottlenecks in immunological research reproducibility. To address this, we developed flowMagic, a machine learning algorithm for automated gating that is trained on both expert-curated data (template…
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams + 1 more
'Alexandru I. Tomescu'] Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning, to bioinformatics. In some applications we look for a decomposition that is optimal with respect to some property, such as the number of paths used…
Authors not listed
Self-driving laboratories (SDLs) promise accelerated scientific discovery and product development by closing the loop between robotic execution and AI/ML-driven decision making. In practice, however, SDL orchestration remains fragmented; workflows are typically encoded as laboratory-specific scripts or bespoke…
Anna Kriuchechnikova, Tatiana Levdik, Alexey Brazhe
Many living systems self-organize into tree-like hierarchical branching patterns. How the function of these systems is shaped by their morphology, and whether it reflects optimization of any resource or cost draws a sustained interest. Applications in computational biology and biomimetics require tools to generate…
Simon Scherrer, Jo Vliegen, Arish Sateesan, Hsu‐Chun Hsiao + 2 more
'Nele Mentens' 'Adrian Perrig'] Abstract—Modern DDoS defense systems rely on probabilistic monitoring algorithms to identify flows that exceed a volume threshold and should thus be penalized. Commonly, classic sketch algorithms are considered sufficiently accurate for usage in DDoS defense. However, as we show in this…
Man Tianxing, Mikhail Lushnov, Dmitry I. Ignatov, Yulia Alexandrovna Shichkina + 3 more
Researchers working in various domains are focusing on extracting information from data sets by data mining techniques. However, data mining is a complicated task, including multiple complex processes, so that it is unfriendly to non-computer researchers. Due to the lack of experience, they cannot design suitable…
Authors not listed
Photoredox catalysis plays an important role in the synthesis of pharmaceutically relevant compounds, such as C(sp3)-rich tertiary amines. The difficulty of identifying underlying mechanistic models for such novel transformations, coupled with the large reaction space of this reaction class, mean that developing a…
Jiyizhe Zhang, Naoto Sugisawa, Kobi Felton, Shinichiro Fuse + 1 more
Amide bond formation is one of the most prevalent reactions in pharmaceutical industry, among which the Schotten-Baumann reaction has attracted attention as a potential green amide formation approach. However, the use of water in the reaction system often causes undesired hydrolysis and can generate a multiphase…
Authors not listed
Digital twins are virtual companions for the design, scale-up, and control of chemical processes. Equipping digital twins with mechanistic models of their mirrored unit operation expands their range of applicability compared to pure data-driven models. As constructing mechanistic models requires time, effort, and…
Authors not listed
Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture…