21 papers · ranked by Valyu relevance
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Suluk Chaikhan, Suphakant Phimoltares, Chidchanok Lursinsap, Mohamed Hammad
'Mohamed Hammad'] Big streaming data environment concerns a complicated scenario where data to be processed continuously flow into a processing unit and certainly cause a memory overflow problem. This obstructs the adaptation of deploying all existing classic sorting algorithms because the data to be sorted must be…
Daniel Bascones, Borja Morcillo
—Sorting is one of the fundamental problems in computer science. Playing a role in many processes, it has a lower complexity bound imposed by O(n log n) when executing on a sequential machine. This limit can be brought down to sublinear times thanks to parallelization techniques that increase the number of comparisons…
Amir Hossein Jalilvand, Faeze S. Banitaba, Seyedeh Newsha Estiri, Sercan Aygün + 1 more
'Sercan Aygün' 'M. Hassan Najafi'] Abstract—Sorting is a fundamental operation in various applications and a traditional research topic in computer science. Improving the performance of sorting operations can have a significant impact on many application domains. For highperformance sorting, much attention has been…
Hriday Jain, Ketan Sabale, Aditya Shastri, Hiren Kumar Thakkar + 1 more
Sorting is a foundational primitive in modern data processing, influencing the execution speed of high-performance data pipelines. However, the algorithmic landscape is currently bifurcated by a pervasive "Stability Tax": practitioners must sacrifice either order preservation for high throughput or execution speed for…
Adawiya Ali Hamzah, Abbas Fadhil Abbas
The automated sorting systems are used in the industrial sectors to increase the rate of production. This research developed the sorting system by using a vision machine to detect the matching of capturing image with the storage base image. The system will be matching and sorting in real-time with 5 cm/s conveyor belt…
Parviz Afereidoon
This paper introduces persiansort, new stable sorting algorithm inspired by Persian rug. Persiansort does not have the weaknesses of mergesort under scenarios involving nearly sorted and partially sorted data, also utilizing less auxiliary memory than mergesort and take advantage of runs. Initial experimental showed…
Babu Bassa
In this communication the author describes a software tool named "ChameleonSort". The software program, developed by the present author is useful in the sorting of biological sequence variants like those accumulating mutations while diverging from the common ancestors. Examples include viral protein variants, protein…
Cass Alexandru, Vikraman Choudhury, Jurriaan Rot, Niels van der Weide
'Niels van der Weide'] The paper "Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the framework of bialgebraic semantics to define sorting algorithms. From distributive laws between functors they construct pairs of sorting algorithms using both folds and unfolds. Pairs of sorting algorithms arising…
Julia Golonka, Filip Krużel, Rosario Schiano Lo Moriello
Resource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint. This study evaluates six sorting algorithms-Bubble Sort, Insertion Sort…
Mohammed Alaa Ala’anzy, Nurdaulet Tolendi, Baizhan Baubek, Abdulmohsen Algarni + 1 more
Sorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets. However, parallel sorting divides the task across multiple processing units, enabling faster results by processing data simultaneously.…
Randolph T. Bushman, Tanya M. Tebcherani, Alhassan S. Yasin
In this paper, we introduce and prove QR Sort, a novel non-comparative integer sorting algorithm. This algorithm uses principles derived from the Quotient-Remainder Theorem and Counting Sort subroutines to sort input sequences stably. QR Sort exhibits the general time and space complexity O ( + + ), where denotes the…
Kianoush Banaie Boroujeni, Thilo Womelsdorf, Sabine Kastner
Identifying single units from extracellularly recorded neural signals is critical for understanding brain circuit dynamics. With the advancements of large-scale recordings, efficient and precise automated spike sorting methods have become essential. Existing approaches face challenges with channel quality variability…
Aldrik H. Velders, Lisette van Lieshout, Erik A. T. Brienen, Benedict Diederich + 1 more
Microparticles are ubiquitous and span from living matter to microplastics to inorganic materials. Their detection and identification must be more accessible and time efficient. Microfluidic devices can filter microparticles from liquids, but fabricating microfluidics with lateral resolutions of a few tens of microns…
Samuel Garcia, Chris Halcrow, Charlie Windolf, Zachary M. McKenzie + 5 more
Spike sorting is an algorithmic process that extracts the activity of individual neurons from extracellular electrophysiology recordings. With the ballooning use of high density probes, such as Neuropixels, this essential processing step is increasingly becoming time consuming and computationally expensive. Although…
Kai Uwe Barthel, Florian Tim Barthel, Peter Eisert, Nico Hezel + 1 more
'Konstantin Schall'] Visually sorted grid layouts provide an efficient method for organizing high-dimensional vectors in two-dimensional space by aligning spatial proximity with similarity relationships. This approach facilitates the effective sorting of diverse elements ranging from data points to images, and enables…
Zeinab Mohammadi, Daniel Denman, Achim Klug, Tim C. Lei
Sorting neural voltages measured from a multichannel neural probe to extract the single unit activities of neuronal firing, especially in real-time, remains a significant technical challenge, largely due to the large amount of acquired data and the technical difficulties involved in processing and classifying these…
Brian L. Trippe, Buwei Huang, Erika A. DeBenedictis, Brian Coventry + 4 more
Sort-seq assays are a staple of the biological engineering toolkit, allowing researchers to profile many groups of cells based on any characteristic that can be tied to fluorescence. However, current approaches, which segregate cells into bins deterministically based on their measured fluorescence, introduce systematic…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Rikki M. Garner, Sean E. McGeary, Allon M. Klein, Sean G. Megason
The organization of cells into spatial patterns is a fundamental aspect of multicellularity. One major mechanism underlying tissue patterning is adhesion-based cell sorting, in which a heterogeneous mixture of different cell types spontaneously separates into distinct domains based on cell type-specific differences in…
Zhihao Lan, WanZhen Liang
The variational quantum eigensolver (VQE) algorithm can simulate the chemical systems such as molecules in the noisy intermediate-scale quantum devices and shows promising applications in quantum chemistry simulations. The accuracy and computational cost of the VQE simulations are determined by the underlying Ansätze.…