Salman Sohrabi, Jifu Tan, Doruk Erdem Yunus et al. · Biomicrofluidics · 2018
Isolating cells of interest from a heterogeneous population has been of critical importance in biological studies and clinical applications. In this study, a novel approach is proposed for utilizing an active ciliary system in microfluidic devices to separate particles based on their physical properties. In this approach, the bottom of the microchannel is covered with an equally spaced cilia array of various patterns which is actuated by an external stimuli. 3D simulations are carried out to study cilia-particle interaction and isolation dynamic in a microfluidic channel. It is observed that these elastic hair-like filaments can influence particle's trajectories differently depending on their biophysical properties. This modeling study utilizes immersed boundary method coupled with the lattice Boltzmann method. Soft particles and cilia are implemented through the spring connected network model and point-particle scheme, respectively. It is shown that cilia array with proper stimulation is able to continuously and non-destructively separate cells into subpopulations based on their size, shape, and stiffness. At the end, a design map for fabrication of a programmable microfluidic device capable of isolating various subpopulations of cells is developed. This biocompatible, label-free design can separate cells/soft microparticles with high throughput which can greatly complement existing separation technologies.
Cited by 6Open access
Cheng-Shan Guo, Yanan Yu, Zhengping Hong · Optics Communications · 2010
Cited by 76
Rui Yang, Mel Siegel · Research Showcase @ Carnegie Mellon University (Carnegie Mellon University) · 2018
Robotics Institute
Cited by 0Open access
Balaram Behera · arXiv (Cornell University) · 2020
The quest for efficient sorting is ongoing, and we will explore a graph-based\nstable sorting strategy, in particular employing comparison graphs. We use the\ntopological sort to map the comparison graph to a linear domain, and we can\nmanipulate our graph such that the resulting topological sort is the sorted\narray. By taking advantage of the many relations between Hamiltonian paths and\ntopological sorts in comparison graphs, we design a Divide-and-Conquer\nalgorithm that runs in the optimal $O(n \\log n)$ time. In the process, we\nconstruct a new merge process for graphs with relevant invariant properties for\nour use. Furthermore, this method is more space-efficient than the famous {\\sc\nMergeSort} since we modify our fixed graph only.\n
Cited by 0Open access
V. I. Donev · 2024
In this paper, we present a specific task from the topic of sorting algorithms, where an array of non-repeating numeric data is sorted by direct positioning. Such a task arises frequently in practice and provides fertile ground for analysis tools in various spheres of life.
Cited by 0
Mounir Hamdi, Chunming Qiao, Yi Pan et al. · 1999
The reconfigurable array with slotted optical buses (RASOB) has recently received a lot of attention from the research community. In this paper, we first discuss the reconfiguration methods and communication capabilities of the RASOB architecture. Then, we use this architecture for the implementation of efficient sorting algorithms on the 1D RASOB and the 2D RASOB. Our parallel sorting algorithm on the 1D RASOB is based on an efficient divide-and-conquer scheme. It sorts N data items using N processors in O(k) communication cycles where k is the size of the data items to be sorted in bits. We further develop a parallel sorting algorithm on the 2D RASOB based on the sorting algorithm on the 1D RASOB in conjunction with the well known Rotatesort algorithm. Similarly, this algorithm sorts N data items on a 2D RASOB of size N in O(k) communication cycles. These sorting algorithms are much more efficient than state-of-the-art sorting algorithms on reconfigurable arrays of processors with electronic buses using the same
Cited by 0
A.-L. Deman, Lucie Descamps, Samir Mekkaoui et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2019
Cited by 2
Philip Baback Alipour, Matteus Magnusson, Martin W. Olsson et al. · arXiv (Cornell University) · 2015
This report covers an intelligent decision support system (IDSS), which handles an efficient and effective way to rapidly inspect containerized cargos for defection. Defection is either cargo exposure to radiation, physical damages such as holes, punctured surfaces, iron surface oxidation, etc. The system uses a sorting array triangulation technique (SAT) and surface damage detection (SDD) to conduct the inspection. This new technique saves time and money on finding damaged goods during transportation such that, instead of running $n$ inspections on $n$ containers, only 3 inspections per triangulation or a ratio of $3:n$ is required, assuming $n > 3$ containers. The damaged stack in the array is virtually detected contiguous to an actually-damaged cargo by calculating nearby distances of such cargos, delivering reliable estimates for the whole local stack population. The estimated values on damaged, somewhat damaged and undamaged cargo stacks, are listed and profiled after being sorted by the program, thereby submitted to the manager for a final decision. The report describes the problem domain and the implementation of the simulator prototype, showing how the system operates via software, hardware with/without human agents, conducting real-time inspections and management per se.
Cited by 0Open access
Amitava Datta Robyn Owens Subbiah Soundaralakshmi, Amitava Datta, Robyn Owens et al. · 2007
We present two fast algorithms for sorting on a linear array with a recongurable pipelined bus system (LARPBS), one of the recently proposed parallel architectures based on optical buses. In our rst algorithm, we sort N numbers in O(log N log log N) worst-case time using N processors. In our second algorithm, we sort N numbers in O((log log N) 2 ) worst-case time using N 1+ processors, for any xed such that 0 < < 1. Our algorithms are based on a novel deterministic sampling scheme for merging two sorted arrays of length N each in O(log log N) time on an LARPBS with N processors. To our knowledge, the previous best sorting algorithm on this architecture has a running time of O((log N) 2 ) using N processors. Index Terms { recongurable bus, optical bus, pipelined communication, deterministic sampling, merging, sorting algorithm. This research is partially supported by an Australian Research Council (ARC) Grant. y Corresponding author. z Department of Computer Scien...
Cited by 0
Muhammad Zaki Musyaffa, Karunia Raharjo, Mohd Faiz et al. · JEIS Jurnal Elektro dan Informatika Swadharma · 2025
The development of information technology has transformed data storage from physical to digital formats. However, digital data is difficult to access and verify without an effective sorting mechanism in place. This study compares the memory usage efficiency and execution time of the array sorting algorithm with two traditional sorting algorithms, bubble sort and quick sort, using a quantitative comparative method, all implemented in Python. Experiments were conducted on random numerical data sets of 100, 1.000, and 10.000 elements. Results show that the Array Sorting Algorithm excels in computational speed, with average times of 231.500, 352.500, and 1.214.150 nanoseconds for each data scale. However, it requires slightly larger memory (2.320 – 84.304 bytes). In contrast, Bubble Sort is the slowest but most memory-efficient, while Quick Sort is intermediate in both aspects. On the other hand, the Array Sorting Algorithm recorded relatively higher memory usage compared to the traditional sorting algorithms, Bubble Sort and Quick Sort. Based on these findings, algorithm selection should be based on the primary need. The Array Sorting Algorithm can be used when execution speed is a priority, and Bubble Sort is suitable for environments with memory constraints and small datasets. At the same time, Quick Sort offers a balance between speed and memory usage efficiency. Perkembangan teknologi informasi telah mentransformasi penyimpanan data dari format fisik ke digital. Namun, tanpa mekanisme pengurutan yang efektif, data digital sulit diakses dan diverifikasi. Penelitian ini membandingkan efisiensi penggunaan memori dan waktu eksekusi Array Sorting Algorithm dengan dua algoritma pengurutan tradisional, Bubble Sort dan Quick Sort menggunakan metode komparatif kuantitatif., semuanya diimplementasikan dalam bahasa Phyton. Eksperimen dilakukan pada kumpulan data numerik acak berukuran 100, 1.000, dan 10.000 elemen. Hasil menunjukkan bahwa Array Sorting Algorithm unggul dalam kecepatan komputasi dengan rata-rata waktu 231.500, 352.500, dan 1.214.150 nanodetik untuk masing-masing skala data, namun memerlukan memori sedikit lebih besar (2.320 – 84.304 byte), sedangkan Bubble Sort paling lambat namun paling hemat memori, dan Quick Sort menengah di kedua aspek. Di sisi lain, Array Sorting Algorithm mencatatkan pemakaian memori yang relatif lebih tinggi dibanding algoritma pengurutan tradisional Bubble Sort dan Quick Sort. Berdasarkan hasil dari temuan ini pemilihan algoritma harus didasarkan pada kebutuhan utama, Array Sorting Algorithm bisa digunakan saat kecepatan eksekusi menjadi prioritas, Bubble Sort cocok untuk lingkungan dengan keterbatasan memori dan dataset berukuran kecil, sedangkan Quick Sort menawarkan keseimbangan antara kecepatan dan efisiensi penggunaan memori
Cited by 0Open access
J. Carbonell, José E. Solsona, Nóra Szász et al. · ArXiv.org · 2025
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 merge sort and merging algorithms as instances of these schemas, thereby arriving at a fully recursive formulation. Further, the analysis of the tree of subproblems arising from the partition facilitates the design of loop invariants that allow to derive a fully iterative version (sometimes called bottom-up merge sort) that does not employ a stack. We show how the use of the provided schemas conveniently conducts the formalization and actual verification in Dafny. The whole method is also applicable to deriving variants of quicksort, which we sketch.
Cited by 0Open access
Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 1999
Elsevier’s Scopus, the largest abstract and citation database of peer-reviewed literature. Search and access research from the science, technology, medicine, social sciences and arts and humanities fields.
Cited by 0
Ju-wook Jang · 2007
In this paper, we present a parallel SIMD algorithm for sorting of N numbers of log N bits each on a mesh connected array without comparators. While most previous AT²-optimal sorting algorithms on the mesh explicitly or implicitly assume O(1) time comparison of two operands of O(log N) bits, our algorithm does not require O(1) time comparison. Rather we assume O(log N) time comparison, which makes our algorithm realizable with current VLSI technology. To retain the AT² optimality with increased ( by a factor of O(log N) ) comparison time, we develop a new mapping technique which combines radix sort, shear sort, block merge and column sort in a creative way. The time complexity of sorting of N numbers on a (two-dimensional) mesh of size N 1=2 \\Theta N 1=2 without comparotors is O(N 1=2 ).
Cited by 0
Akihiro Isozaki, Yuta Nakagawa, Mun Hong Loo et al. · Science Advances · 2020
Droplet microfluidics has become a powerful tool in precision medicine, green biotechnology, and cell therapy for single-cell analysis and selection by virtue of its ability to effectively confine cells. However, there remains a fundamental trade-off between droplet volume and sorting throughput, limiting the advantages of droplet microfluidics to small droplets (<10 pl) that are incompatible with long-term maintenance and growth of most cells. We present a sequentially addressable dielectrophoretic array (SADA) sorter to overcome this problem. The SADA sorter uses an on-chip array of electrodes activated and deactivated in a sequence synchronized to the speed and position of a passing target droplet to deliver an accumulated dielectrophoretic force and gently pull it in the direction of sorting in a high-speed flow. We use it to demonstrate large-droplet sorting with ~20-fold higher throughputs than conventional techniques and apply it to long-term single-cell analysis of <i>Saccharomyces cerevisiae</i> based on their growth rate.
Cited by 89Open access
Yuzhi Shi, Haitao Zhao, L. K. Chin et al. · Nano Letters · 2020
Optical tweezers are versatile tools capable of sorting microparticles, yet formidable challenges are present in the separation of nanoparticles smaller than 200 nm. The difficulties arise from the controversy on the requirement of a tightly focused light spot in order to create strong optical forces while a large area is kept for the sorting. To overcome this problem, we create a near-field potential well array with connected tiny hotspots in a large scale. This situation can sort nanoparticles with sizes from 100 to 500 nm, based on the differentiated energy depths of each potential well. In this way, nanoparticles of 200, 300, and 500 nm can be selectively trapped in this microchannel by appropriately tuning the laser power. Our approach provides a robust and unprecedented recipe for optical trapping and separation of nanoparticles and biomolecules, such that it presents a huge potential in the physical and biomedical sciences.
Cited by 67
A.-L. Deman, Lucie Descamps, Samir Mekkaoui et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2019
International audience
Cited by 0
Mun Hong Loo, Yuta Nakagawa, Soo Hyeon Kim et al. · Electrophoresis · 2021
Droplet microfluidics has emerged as a powerful tool for a diverse range of biomedical and industrial applications such as single-cell analysis, directed evolution, and metabolic engineering. In these applications, droplet sorting has been effective for isolating small droplets encapsulating molecules, cells, or crystals of interest. Recently, there is an increased interest in extending the applicability of droplet sorting to larger droplets to utilize their size advantage. However, sorting throughputs of large droplets have been limited, hampering their wide adoption. Here, we report our demonstration of high-throughput fluorescence-activated droplet sorting of 1 nL droplets using an upgraded version of the sequentially addressable dielectrophoretic array (SADA), which we reported previously. The SADA is an array of electrodes that are individually and sequentially activated/deactivated according to the speed and position of a droplet passing nearby the array. We upgraded the SADA by increasing the number of driving electrodes constituting the SADA and incorporating a slanted microchannel. By using a ten-electrode SADA with the slanted microchannel, we achieved fluorescence-activated droplet sorting of 1 nL droplets at a record high throughput of 1752 droplets/s, twice as high as the previously reported maximum sorting throughput of 1 nL droplets.
Cited by 15
Ushnik Chakrabarti, Binoy Kumar Karmakar · 2025
Partial shading significantly reduces the power output of rooftop solar photovoltaic (SPV) systems, which are a key component in modern home energy solutions. While Dynamic Array Reconfiguration (DAR) is a proven technique to address this issue, most existing methods are computationally intensive and too complex for integration into low-cost, embedded systems. This paper presents a novel DAR technique based on a Basic Sorting Approach (BSA). Unlike conventional methods, the proposed BSA is computationally lightweight and designed for straightforward implementation in microcontroller-based consumer devices. Furthermore, the method is mathematically proven to guarantee optimal power output under any shading pattern, a crucial advantage not provided by existing approaches. Validation through both detailed simulations and a small-scale laboratory setup confirms that the BSA-based DAR consistently delivers superior performance. This approach is a major advance in providing more efficient and accessible solar energy for the mass market of rooftop SPV systems, where partial shading is unavoidable.
Cited by 0Open access
Philip Baback Alipour, Matteus Magnusson, Martin W. Olsson et al. · arXiv (Cornell University) · 2015
This report covers an intelligent decision support system (IDSS), which\nhandles an efficient and effective way to rapidly inspect containerized cargos\nfor defection. Defection is either cargo exposure to radiation, physical\ndamages such as holes, punctured surfaces, iron surface oxidation, etc. The\nsystem uses a sorting array triangulation technique (SAT) and surface damage\ndetection (SDD) to conduct the inspection. This new technique saves time and\nmoney on finding damaged goods during transportation such that, instead of\nrunning $n$ inspections on $n$ containers, only 3 inspections per triangulation\nor a ratio of $3:n$ is required, assuming $n > 3$ containers. The damaged stack\nin the array is virtually detected contiguous to an actually-damaged cargo by\ncalculating nearby distances of such cargos, delivering reliable estimates for\nthe whole local stack population. The estimated values on damaged, somewhat\ndamaged and undamaged cargo stacks, are listed and profiled after being sorted\nby the program, thereby submitted to the manager for a final decision. The\nreport describes the problem domain and the implementation of the simulator\nprototype, showing how the system operates via software, hardware with/without\nhuman agents, conducting real-time inspections and management per se.\n
Cited by 1Open access
Ju-Wook Jang · 1998
In this paper, we present a parallel SIMD algorithm for sorting of N numbers of log N bits each on a mesh connected array without comparators. While most previous AT 2 -optimal sorting algorithms on the mesh explicitly or implicitly assume O#1# time comparison of two operands of O#log N# bits, our algorithm does not require O#1# time comparison. Rather we assume O#log N# time comparison, which makes our algorithm realizable with current VLSI technology. To retain the AT 2 optimality with increased ( by a factor of O#log N# ) comparison time, we develop a new mapping technique which combines radix sort, shear sort, block merge and column sort in a creative way. The time complexity of sorting of N numbers on a (two-dimensional) mesh of size N 1=2 #N 1=2 without comparotors is O#N 1=2 #. 1 Introduction The problem of sorting numbers on a two-dimensional array has been extensively studied and the lower bound is achieved for the mesh connected parallel computer[3, 4, 6, 8] an...
Cited by 0