Results 31 to 40 of about 354,201 (259)
Supplement to “Consolidity: Moving opposite to built-as-usual systems practices”
Ain Shams Engineering Journal, 2013 A new updated conceptual systems change pathway graph for natural and man-made built-as-usual physical systems is developed following a joint two-level event-driven (or activity-driven) and time-driven framework.
Hassen Taher Dorrah
doaj +1 more source
Preimages Under the Stack-Sorting Algorithm [PDF]
Graphs and Combinatorics, 2016 We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and $t$-stack sortable permutations of length $n$ with exactly $k$ descents.
openaire +2 more sources
Permutations sortable by n-4 passes through a stack [PDF]
, 2010 The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack ...
Steingrimsson, Einar +2 more
core +2 more sources
A new lower bound for deterministic pop-stack-sorting [PDF]
The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5}n$ for the number of sorts to fully sort a uniformly randomly chosen permutation via
Copenhaver, Keith, Bauer, Morgan
core +1 more source
Stack-sorting, set partitions, and Lassalle's sequence
Journal of Combinatorial Theory, Series A, 2020 We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new combinatorial interpretations of Lassalle's sequence.
Colin Defant +2 more
openaire +4 more sources
Sorting with two stacks in parallel [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 At the end of the 1960s, Knuth characterised in terms of forbidden patterns the permutations that can be sorted using a stack. He also showed that they are in bijection with Dyck paths and thus counted by the Catalan numbers. Subsequently, Pratt and Tarjan asked about permutations that can be sorted using two stacks in parallel.
Albert, Michael +1 more
openaire +4 more sources
tum-gis/tum-gis-iot-stack-k8s: tum-gis-iot-stack-k8s-0.9.5
, 2023 Helm Chart for the TUM-GI IoT ...
Benedikt Schwab +2 more
core +2 more sources
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Технічна інженеріяThis article deals with a comprehensive study and comparative analysis of the most common sorting algorithms, such as bubble sort, insertion sort, selection sort, merge sort, quick sort, heap sort, and bucket sort.
A.O. Ivanov, O.M. Kryvonos
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source