21 papers · ranked by Valyu relevance
Aniruddha R. Upadhye, Chaitanya Kolluru, Lindsey Druschel, Luna Al Lababidi + 13 more
Vagus nerve stimulation (VNS) is FDA approved for stroke rehabilitation, epilepsy and depression; however, the underlying vagus functional anatomy underlying the implant is poorly understood. We used microCT to quantify fascicular structure and neuroanatomy within human cervical vagus nerves. Fascicles split or merged…
Daniel Kornai, Xiyun Jiao, Jiayi Ji, Tomáš Flouri + 2 more
'Robert Thomson'] Title: Abstract The multispecies coalescent (MSC) model accommodates genealogical fluctuations across the genome and provides a natural framework for comparative analysis of genomic sequence data from closely related species to infer the history of species divergence and gene flow. Given a set of…
Huan Gao, Yanqing Cen, Bo Liu, Xianghui Song + 3 more
'Felipe Jiménez'] To solve the problems of congestion and accident risk when multiple vehicles merge into the merging area of a freeway, a platoon split collaborative merging (PSCM) method was proposed for an on-ramp connected and automated vehicle (CAV) platoon under a mixed traffic environment composed of…
Haoqiang Wang, Yong Wang, Sheng Yan, Xin Du + 2 more
We introduce an innovative approach to address a significant challenge in interaction recognition, specifically the capture of correlation features between different interaction body parts. These features are often overlooked by traditional graph convolution networks commonly used in interaction recognition tasks. Our…
Sumathi Subbarayan, G. Hannah Grace
Introduction Clustering high-dimensional and noisy data remains challenging for conventional expectation-maximization (EM) methods as overlapping clusters, sparse features, and outliers can lead to covariance degeneracy and unstable parameter estimates. This research aims to improve clustering performance in…
Alexandra Yang
| 1 | Introduction | | 2 | | --- | --- | --- | --- | | 2 | Related Research | | 2 | | 3 | Installation | | 3 | | 4 | Benchmarking | | 3 | | 5 | Single Processor Sorting Algorithms | | 3 | | | 5.1 Sequential Merge Sort | | 3 | | | 5.2 | Python Built-in Sort | 4 | | | 5.3 Multiprocessing Merge Sort | | 4 | | | 5.3.1 |…
Daniel Kornai, Tomáš Flouri, Ziheng Yang
The multispecies coalescent (MSC) model accommodates genealogical fluctuations across the genome and provides a natural framework for comparative analysis of genomic sequence data to infer the history of species divergence and gene flow. Given a set of populations, hypotheses of species delimitation (and species…
He, Yujun, Zhao, Hangdong + 10 more
Minimizing intermediate results is critical for efficient multi-join query processing. Although the seminal Yannakakis algorithm offers strong guarantees for acyclic queries, cyclic queries remain an open challenge. In this paper, we propose SplitJoin, a framework that introduces split as a first-class query operator.…
Brendan Celii, Stelios Papadopoulos, Zhuokun Ding, Paul G. Fahey + 54 more
We are now in the era of millimeter-scale electron microscopy (EM) volumes collected at nanometer resolution (1; Consortium et al., 2021). Dense reconstruction of cellular compartments in these EM volumes has been enabled by recent advances in Machine Learning (ML) (3; 4; 5; 6). Automated segmentation methods produce…
Benjamin D. Redelings, Mark T. Holder
The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supetree construction algorithm iteratively calls Aho’s Build algorithm thousands of times in order to assess the compatability of different phylogenetic…
Lixiang Zhang, Lin Lin, Jia Li, Mark Alber
Multi-view data can be generated from diverse sources, by different technologies, and in multiple modalities. In various fields, integrating information from multi-view data has pushed the frontier of discovery. In this paper, we develop a new approach for multi-view clustering, which overcomes the limitations of…
Yinqi Cai
We study the problem of cutting a length-n string of positive real numbers into k pieces so that every piece has sum at least b. The problem can also be phrased as transforming such a string into a new one by merging adjacent numbers. We discuss connections with other problems and present several algorithms in…
Trevor Gokey, David L. Mobley
Molecular mechanics force fields require a chemical perception model to assign parameters to molecules. A recent advancement in force fields is the use of the SMARTS substructure query language as the perception model. Although it is straightforward to write SMARTS patterns to define new force field parameters, it is…
Shiming Lin, Bifang Huang, Li-li Zhao, Fei Xu + 4 more
'Xuanyang Chen' 'Shiqiang Lin' 'Joseph Gillespie'] Gene cloning is an important step in investigating gene structure and function. To verify gene sequence, Sanger sequencing is used, which may produce several overlapping sequencing files that need to be merged before alignment to the target gene sequence is performed.…
Vladimir Batagelj
Recently some books dealing with the theoretical and algorithmic background of traditional aggregation functions were published. A problem with traditional aggregation is that often too much information is discarded thus reducing the precision of the obtained results. A much better, preserving more information…
Aleksander Łukasiewicz, Jakub Tětek, Pavel Veselý
Space-efficient estimation of quantiles in massive datasets is a fundamental problem with numerous applications in data monitoring and analysis. While theoretical research led to optimal algorithms, such as the Greenwald-Khanna algorithm or the KLL sketch, practitioners often use other sketches that perform…
Authors not listed
Genetic Algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for…
Kyungwoo Lee, Manman Ren, Ellis Hoag
Function merging is a pivotal technique for reducing code size by combining identical or similar functions into a single function. While prior research has extensively explored this technique, it has not been assessed in conjunction with function outlining and linker's identical code folding, despite substantial common…
Gunther Schadow, Yulia Borodina, Victorien Delannée, Wolf-Dietrich Ihlenfeldt + 2 more
There are numerous formats and data models for describing reaction-related data. However, each offers only a limited coverage of the multitude of information that can be of interest to a broad user base in the context of chemical reactions. Structured Product Labeling (SPL) is a robust yet fairly light public XML…
Alex Barceló, Anna Queralt, Toni Cortés
Task-based programming models have proven to be a robust and versatile way to approach development of applications for distributed environments. They provide natural programming patterns with high performance. However, execution on this paradigm can be very sensitive to granularity –i.e., the quantity and execution…
Wei Lyu, Goetz Graefe
In database systems, joins are often expensive despite many years of research producing numerous join algorithms. Precomputed and materialized join views deliver the best query performance, whereas traditional indexes, used as pre-sorted inputs for merge joins, permit very efficient maintenance. Neither traditional…