Empirical Evaluation of Unoptimized Sorting Algorithms on 8-Bit AVR Arduino Microcontrollers [PDF]
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.
Julia Golonka, Filip Krużel
doaj +2 more sources
Cargoes move from cis to trans-Golgi compartments and concentrate in the TGN before exiting [PDF]
The classical models of intra-Golgi transport envision a movement of cargoes from cis- to trans-Golgi, followed by their sorting at the trans-Golgi network (TGN).
Marinella Pirozzi +10 more
doaj +2 more sources
Stack-sorting simplices: geometry and lattice-point enumeration
26 pages, 7 figures, 1 table, accepted to the Combinatorics, Graph Theory, and Combinatorics: Proceedings of the 55th Southeastern International Conference on Combinatorics, Graph Theory & ...
Lee, Eon +2 more
core +4 more sources
Stack sort: a new approach with sorting network and a buffer [PDF]
Knuth introduced the problem of stack sorting. Stack sorting was implemented by t stacks in series. In this paper, we propose a new dimension to stack sorting problem by introducing a stack with sorting network and a petty buffer. Instead of using t stacks in series, it helps to improve the performance by avoiding shuffles the stack.
S. Muthusundari +7 more
core +3 more sources
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations [PDF]
Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by
Hanna Mularczyk
doaj +1 more source
Stack sorting with restricted stacks [PDF]
The (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on the procedure and on the stacks.
Giulio Cerbai +2 more
openaire +4 more sources
2-Stack Sorting is polynomial [PDF]
23 pagesIn this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth.
Rossin, Dominique, Pierrot, Adeline
core +5 more sources
Stack Sorting with Increasing and Decreasing Stacks [PDF]
We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes the $\mathfrak{DI}$ machine introduced by Rebecca Smith, which studies the case $k=1$.
Cerbai, G, Cioni, L, Ferrari, L
openaire +6 more sources
A comparative Analysis and Optimization of two Supersonic Hybrid Solid Oxide Fuel Cell and Turbine-less Jet Engine Propulsion Systems for Unmanned Aerial Vehicles [PDF]
The propulsion system of an Unmanned Aerial Vehicle (UAV) plays an essential role in its performance, stability and flight endurance. In this study, two types of propulsion systems for UAV (differentiated based on fuel type) are studied to determine ...
M. Rostami +4 more
doaj +1 more source
Sorting and preimages of pattern classes [PDF]
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are ...
Anders Claesson, Henning Úlfarsson
doaj +1 more source

