Results 51 to 60 of about 285,472 (282)
Glassy dynamics in thermally-activated list sorting
Sorting the integers 1 through $N$ into an ordered list is a simple task that can be done rapidly. However, using an algorithm based on the thermally-activated pairwise exchanges of neighboring list elements, we find sorting can display many features of ...
Nagel, Sidney R., Zou, Ling-Nan
core +1 more source
Chemoresistance in bladder cancer: Macrophage recruitment associated with CXCL1, CXCL5 and CXCL8 expression is characteristic of Gemcitabine/Cisplatin (Gem/Cis) Non‐Responder tumors (right side) while Responder tumors did not show substantial tumor‐stromal crosstalk (left side). All biological icons are attributed to Bioicons: carcinoma, cancerous‐cell‐
Sophie Leypold +11 more
wiley +1 more source
The article presents a brief description of the features of the IDE of the course "Basis of algorithmization and programming" developed by the laboratory of integrated environments of learning RI IT in Kherson State University.
A. Spivakovsky +3 more
doaj
Post-Fault Energy Usage Optimization for Multilevel Inverter with Integrated Battery
This paper presents a novel sorting algorithm for modular multilevel inverters (MMCs) with integrated batteries, designed to ensure the uninterrupted operation of electric vehicles (EVs) under post-fault conditions. The proposed system structure consists
Rok Friš +3 more
doaj +1 more source
Computing Maximal Lyndon Substrings of a String
There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Identification method of canned food for production line sorting robot based on improved PSO-SVM
Objective: To solve the problems of poor accuracy and low efficiency in target recognition methods for existing sorting robots in food production lines.
GAO Haiyan, GAO Jinyang, WANG Weicheng
doaj +1 more source
Speeding up shortest path algorithms
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
The purpose of this paper is to present a sorting algorithm that allows parallel execution of comparison operations, analysing complexity and runtime of the algorithm, discussing about a virtual process for this algorithm, and the implementation of the C++ program that simulates such a virtual process.
Iu. Koval, Iu. Krak
openaire +2 more sources
BMI‐1 modulation and trafficking during M phase in diffuse intrinsic pontine glioma
The schematic illustrates BMI‐1 phosphorylation during M phase, which triggers its translocation from the nucleus to the cytoplasm. In cycling cells, BMI‐1 functions within the PRC1 complex to mediate H2A K119 monoubiquitination. Following PTC596‐induced M phase arrest, phosphorylated BMI‐1 dissociates from PRC1 and is exported to the cytoplasm via its
Banlanjo Umaru +6 more
wiley +1 more source
Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth
The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort.
Desi Anggreani +3 more
doaj +1 more source

