Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 2,376 papers for “array sorting”
Aleksandr Voevoda, Polubinsky Vladimir, Romannikov Dmitrii · Science Bulletin of the Novosibirsk State Technical University · 2016
, . , , , , / , . , , , . . , , . , , , - - . .
Cited by 1Open access
Xing Zhao, Yuyang Sun, Jing Bu et al. · Applied Optics · 2011
An on-chip optical trapping and sorting system composed of a microchamber and a microlens array (MLA) is demonstrated. The MLA focuses the incident light into multiple confocal spots to trap the particles within the microchamber. The SiO(2)/ZrO(2) solgel material is introduced in the fabrication of MLA for its unique optical and chemical characters. Moreover, in order to prove the effectiveness of the system, experimental demonstration of multibeam trapping and locked-in transport of micropolymer particles in the microchamber is implemented. The system may easily be integrated as microfluidic devices, offering a simple and efficient solution for optical trapping and sorting of biological particles in lab-on-a-chip technologies.
Cited by 19
Ge Nong, Sen Zhang, Wai Hong Chan · 2009
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm.The SA-IS algorithm is novel because of the LMS-substrings used for the problem reduction and the pure induced-sorting (specially coined for this algorithm)used to propagate the order of suffixes as well as that of LMS-substrings, which makes the algorithm almost purely relying on induced sorting at both its crucial steps.The pure induced-sorting renders the algorithm an elegant design and in turn a surprisingly compact implementation which consists of less than 100 lines of C code.The experimental results demonstrate that this newly proposed algorithm yields noticeably better time and space efficiencies than all the currently published linear time algorithms for SA construction.
Cited by 146
James B. Heaney · Optical Engineering · 1993
The simultaneous measurement of the spectrally and spatially variant transmittance of a linear variable order-sorting filter in a manner that closely resembles its conditions of actual use is described. The transmittance of a prototype order-sorting filter was measured in the 400- to 880-nm wavelength region by illuminating it with the output beam of a spectrophotometer while the filter was attached to the front of a 30 x 32 pixel silicon array detector. The filter was designed to be used in the output beam of a grating spectrometer to prevent the dispersal of higher diffracted orders onto an array detector. Areas of the filter that were spatially matched to the corresponding detector pixel column had measured peak transmittances of about 90% that were uniform to within ±1.5% along a given column. Transmittances for incident wavelengths shorter than the desired bandpass, corresponding to the order overlap region, were measured in the 3 x 10<sup>-3</sup> range. Line spread function measurements made with the array detector indicated no significant beam spreading caused by inserting the filter into the beam.
Cited by 0
Meng Lian, Libang Mao, Zhe Li et al. · Advanced Photonics Research · 2022
Optical tweezers are considered as a revolution, allowing for manipulating particles ranging in scale from a few hundred nanometers (nm) to several micrometers (μm). Near‐field optical force allows effective trapping of a broad range of entities, from atom to living cells. Yet, there are formidable challengings for existing on‐chip photonic trapping techniques to simultaneously handle at will multiple entities with cross‐scales (i.e., from nm to μm). Herein, optical transportation and trapping of polystyrene particles with the different diameters are demonstrated in optofluidic nanophotonic sawtooth waveguide array (ONSWA) made of chalcogenide alloys Sb 2 Se 3 . The chalcogenide ONSWA produces sawtooth‐like light fields that can be actively modulated via the phase transition of Sb 2 Se 3 . Particularly, the chalcogenide ONSWA can stably trap the polystyrene particles with the diameters of 500 nm and 1 μm for both the amorphous and crystalline states, respectively. It is experimentally demonstrated that the phase transition of Sb 2 Se 3 from amorphous to crystalline and vice versa can be achieved in nanoseconds. Using the technique of nanosecond laser‐induced phase transition of Sb 2 Se 3 , a dynamically reconfigurable size‐sorting of objects on the identical ONSWA is proposed.
Cited by 1Open access
Danny Kriz̧anc · 2002
Schnorr and Shamir and independently Kunde, have shown that sorting N=n/sup 2/ inputs into snake-like ordering on a n*n mesh requires 3n-o(n) steps. Using a less restrictive, more realistic model the author shows that the sorting N=n/sup 2/ integers in the range (1. . .N) can be performed in 2n+o(n) steps on a n*n mesh.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 2
Jason P. Beech, Jonas O. Tegenfeldt · Lund University Publications (Lund University) · 2007
Cited by 0
Kuninobu Tanno, T. Takeda, S. Horoguchi · 2003
The authors deal with a new parallel sorting algorithm on an eight-neighbor processor array with wraparounds in the rows. The algorithm is very simple because it is composed of the iteration of only a primitive operation, comparing and exchanging four elements simultaneously. Each processor (processing element), arranged in a two-dimensional array can communicate with 8 neighbouring processors (if they exist). By fully making use of its communication capability and wraparounds properties, the algorithm sorts n*n elements in the row-major order, and yields the sorting time of 3(n+1)(2t/sub r/+t/sub c/), where t/sub r/ and t/sub c/ are defined as the times for a unit routing step and a comparison processing, respectively.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 0
James D. Fix, Richard E. Ladner · IEEE Transactions on Computers · 1998
We consider the problem of sorting on a one-dimensional subbus array of processors, an architecture that communicates using a segmentable bus. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the parallel insertion model. We give per-input lower bounds for sorting in the parallel insertion model and demonstrate sorting strategies that are optimal by matching those lower bounds. For each of our sorting strategies, we discuss the issues involved in implementing them on subbus machines. Finally, we empirically evaluate the performance of our sorting strategies by applying them to shearsort, a common two-dimensional mesh sorting algorithm. Our results suggest that for sorting the subbus broadcast capability gives at most a slight advantage over using only nearest neighbor communication.
Cited by 2
Fathiddinov Saidma'ruf Lazizxo'ja o'g'li · Zenodo (CERN European Organization for Nuclear Research) · 2026
This article provides an overview of the selection sort algorithm for sorting arrays in Python programming. Sorting algorithms are essential tools in computer science and play a significant role in data processing and organization. Selection sort is a simple comparison-based sorting method that works by repeatedly selecting the smallest element from an unsorted portion of the list and placing it at the correct position. Although it is not the most efficient algorithm for large datasets, selection sort is widely used for educational purposes because of its simple logic and easy implementation. The study highlights the importance of understanding basic sorting algorithms in order to develop algorithmic thinking and programming skills in Python.
Cited by 0Open access
Aisuke Mifune, Yuriko Ezaki, Daisuke Saito et al. · 2022 IEEE 35th International Conference on Micro Electro Mechanical Systems Conference (MEMS) · 2022
This study proposes a sperm retrieval system for microsurgical testicular sperm extraction (micro-TESE). It enables single-cell retrieval by innovatively combining a light-actuated microwell array with sperm detection by machine learning (ML). For sperm retrieval, a light-actuated microvalve array with a diameter of 50 µm was developed by integrating photothermal conversion materials into a shape-memory polymer and individual addressing by light pattern irradiation was performed in parallel on a microscope stage. For sperm detection, the micro-TESE sperm dataset was trained to create a model using YOLOv5, an ML object detection model. Its performance was confirmed with an F-value of 0.83 and an inference time of 10 ms, using GPU computing.
Cited by 0
Jigyasha Arora, Suman Pant, Sandip Vijay et al. · 2023
An algorithm to address the shortcoming of Bubble Sort.The short coming of bubble sort is that it is inefficient for large dataset and provides more execution time. The backtracking variable is used as a decision parameter. If the backtracking variable is greater than or equal to zero then shifting is used. The first element will be pointed by a backtrack variable, the second element by an array [i], and the third element by an array $[i+1]$, and two cases of shifting are applied. If the element to be shifted lies in the middle of the backtrack and array of $[i+1]$ and if the element to be shifted lies ahead of both array of $[i]$ and $[i+1]$. After completion of each pass, the two largest elements are placed at the end of an array in sorted order. ECLIPSE has been used for the code of sorting an array with Backtrack implemented in Java and MATLAB for analysis of the number of loops with respect to the number of elements for both algorithms. The result after implementing the algorithm proves that the backtracking method is much more efficient than bubble sort as the total number of iterations, execution time, space, and time complexity is much less as compared to bubble sort with random input sequences.
Cited by 2
Fathiddinov Saidma'ruf Lazizxo'ja o'g'li · Zenodo (CERN European Organization for Nuclear Research) · 2026
This article provides an overview of the selection sort algorithm for sorting arrays in Python programming. Sorting algorithms are essential tools in computer science and play a significant role in data processing and organization. Selection sort is a simple comparison-based sorting method that works by repeatedly selecting the smallest element from an unsorted portion of the list and placing it at the correct position. Although it is not the most efficient algorithm for large datasets, selection sort is widely used for educational purposes because of its simple logic and easy implementation. The study highlights the importance of understanding basic sorting algorithms in order to develop algorithmic thinking and programming skills in Python.
Cited by 0Open access
Xiao Hang Shan, Bi Qing Ye, Li Zhang · International Journal of Wireless and Mobile Computing · 2017
The automatic identification and sorting of chain-chip is one of the important technologies in automatic production line. In order to improve the efficiency and automation of the chain-chips arraying and the whole production process, this paper provides a chain-chip automatic sorting array method based on computer vision and Artificial Neural Network (ANN). Firstly, the chain-chip automatic sorting array machine is proposed. Then, on the basis of Hu invariant moment algorithm, the invariant moments of the acquisition image are analysed to gain the characteristic parameters for sorting. The neural network classifier is designed to realise automatic sorting technology of chain-chips. Experiment results show that the first three-order invariant moment can be used as characteristic parameters for chain-chip identification. This method has the advantages of high accuracy, good sampling performance and strong anti-noise ability. It can meet the demands of object identification requirements in complicated environment.
Cited by 0
Maryam Salarian, Pavel A. Levkin, Anna A. Popova · Advanced Materials Technologies · 2024
Abstract The transition from two‐dimensional (2D) to physiologically relevant three‐dimensional (3D) cell models has revolutionized biomedical research. Hydrogels are frequently used to produce 3D models for tissue engineering, disease modeling, and high‐throughput screenings (HTS). However, integrating 3D cultures into HTS workflows presents challenges, including automation compatibility and cost constraints. Addressing these challenges requires innovative approaches that enable miniaturization, automation, and cost reduction while maintaining experimental fidelity. The Droplet Microarray platform, based on hydrophilic‐superhydrophobic surface patterning, facilitates the formation of nanoliter‐hydrogel arrays containing cells or spheroids. This method allows dispensing of hundreds of nanoliter‐hydrogel droplets with precise control over volume and cell density, reducing reagent consumption and offering high‐throughput applications. Here, we demonstrate stable nanoliter‐hydrogel arrays on a chip, enabling experimental procedures such as washing and medium immersion. Our approach demonstrates that spheroid‐containing droplets can be gelled at any point of the experiment, allowing for the fixation of cell structures on the surface. The selective gelation of individual droplets enables spheroid sorting by stabilizing desired droplets while pooling the others. This method holds the potential for HTS and miniaturized workflows in 3D microenvironments, thereby advancing research in different fields such as cell, cell spheroid, or organoid screenings, drug screenings, and precision medicine.
Cited by 1Open access
Bogdan S. Chlebus · Lecture notes in computer science · 1989
Cited by 7
Mark M. Wang, Mihrimah Ozkan, E.P. Ata et al. · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2001
Current biochip technologies typically rely on electrostatic or mechanical forces for the transport and sorting of biological samples such as single cells. In this paper we have investigated how optical pressure forces can be effectively used for the manipulation of cells and switching in a microfluidic system. By projecting the optical beams externally non-contact between the control devices and the sample chip is possible thus allowing the sample chips to be disposable which reduces the chance of cross-contamination. In one implementation we have shown that vertical cavity surface emitting laser (VCSEL) array devices used as parallel optical tweezer arrays can increase the parallelism of sample manipulation on a chip. We have demonstrated the use of a high-order Laguerre-Gaussian mode VCSEL for optical tweezing of polystyrene microspheres and live cells. We have also shown that optical pressure forces from higher- power sources can be used for the switching of particles within microfluidic channels. Both the attractive gradient force and the scattering force of a focused optical beam have been used to direct small particles flowing through junctions molded in PDMS. We believe that by integrating optical array devices for simultaneous detection and manipulation, highly parallel and low-cost analysis and sorting devices may be achieved.
Cited by 9
Sanguthevar Rajasekaran, Sartaj Sahni · 2002
In this paper we present efficient algorithms for sorting and packet routing on the AROB (Array with Reconfigurable Optial Buses) model.
Cited by 0
О. М. Паулін, Наталія Комлева, Stanislav U. Marulin · PROBLEMS IN PROGRAMMING · 2016
The paper dwells computation process (CP) array sorting from the simple to the efficient. Computation process present’s as a block flowchart for clarity. Each process are extracted macro operations (MO), which are functionality finished pieces of CP. Lists of MO for each sorting algorithm put it together and summarized – minimizing number of MO. This approach will allow careful consideration most CP as it applies to dedicated MO.
Cited by 0Open access
delgado ruz, isabel, chadderton, Paul · Figshare · 2023
Neuronal activity is known to be sparse, since only small populations of neurons showing above threshold spiking activity has been recorded on different cortical areas (imaging techniques and electrophysiology). However, existing sorting and clustering algorithms tend to discard neurons that show little activity (low firing rate, temporally sparse activity) or spikes from neurons that deviate from the mean (outliers from main cluster on high dimensional space). On the other hand, High Density Electrode Arrays allows for spike sorting and clustering which recovers units of small amplitude (voltage) that can not be sorted with other recording technologies. Here we review the different approaches followed on the literature for spike detection, feature extraction, sorting and clustering. We also discuss the importance of developing a simple architecture allowing for new developments to plug-in on existing analysis workflow. Additionally analogue aspects of the Action Potential (and sub-threshold activity) have been ignored on population analysis, sensory response characterisation and neural code studies. Mostly given the technological restrictions and access to technology, since for wire electrodes, or even tetrodes the view from different neuron’s spikes turns out to be binary given the restricted area and spatial resolution. Although these simplification has been enough for most tasks so far, they are certainly not enough for advanced and realistic characterisation of how information is processed and transmitted in the brain. Several open-source projects are available for processing electrophysiological data, but their inter-operation is restricted since an standardization and modular designs are still needed. Here we propose a framework’s model in order to freely develop modules that can be connected to each other, allowing for flexibility on the analysis process. Since processing required is heavily dependant on the dataset, experimental conditions and research question. Designing independent and reusable modules is the most reasonable solution.
Cited by 0Open access