11 papers · ranked by Valyu relevance
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…
Michael C. Robitaille, Jeff M. Byers, Joseph A. Christodoulides, Marc P. Raphael
Cell segmentation is crucial to the field of cell biology, as the accurate extraction of cell morphology, migration, and ultimately behavior from time-lapse live cell imagery are of paramount importance to elucidate and understand basic cellular processes. Here, we introduce a novel segmentation approach centered…
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…
Xiaoxin Ye, Joshua W K Ho
Flow cytometry is a popular technology for quantitative single-cell profiling of cell surface markers. It enables expression measurement of tens of cell surface protein markers in millions of single cells. It is a powerful tool for discovering cell sub-populations and quantifying cell population heterogeneity.…
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…
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…
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…
Mingfu Shao, Carl Kingsford
Motivated by transcript assembly and multiple genome assembly problems, in this paper, we study the following minimum path flow decomposition problem: given a directed acyclic graph G = (V,E) with source s and sink t and a flow f, compute a set of s-t paths P and assign weight w(p) for p ∈ P such that , and |P| is…
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…
Tianhao Wang, Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting + 3 more
'Yung H. Tsin' 'Sheung-Hung Poon' 'Chun-Hsi Huang'] The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, V*h}, where each V**i is maximized, such that for any two vertices x and y in V**i…
Menachem Sklarz, Michal Gordon, Vered Chalifa-Caspi
Bioinformatics workflows (WFs) in general, and those involving High Throughput Sequencing data in particular, typically involve executing a sequence of programs on raw sequence files from as many as thousands of samples. Management of these WFs is laborious and error-prone. We have developed NeatSeq-Flow, a python…