Results 51 to 60 of about 216,568 (279)
Main Memory Adaptive Indexing for Multi-core Systems
, 2014 Adaptive indexing is a concept that considers index creation in databases as a by-product of query processing; as opposed to traditional full index creation where the indexing effort is performed up front before answering any queries.
Alvarez, Victor +3 more
core +1 more source
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
Sorting and Permuting without Bank Conflicts on GPUs
, 2015 In this paper, we look at the complexity of designing algorithms without any bank conflicts in the shared memory of Graphical Processing Units (GPUs).
Afshani, Peyman, Sitchinava, Nodari
core +1 more source
FEBS Open Bio, EarlyView.RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
FEBS Open Bio, EarlyView.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
Visualization of sorting algorithms in the virtual reality environment
Frontiers in Education, 2023 This study examines the use of virtual reality (VR) in programming, specifically in visualization of sorting methods. Addressing students’ needs to better understand and implement sorting methods, “VR sorting” application was developed to visualize the ...
Manargul Mukasheva +2 more
doaj +1 more source
QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average
, 2013 In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X satisfies certain natural conditions.
A. Elmasry +11 more
core +1 more source
Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics, 2018 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
FEBS Open Bio, EarlyView.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
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
IEEE AccessThis research work introduces a clustering-based in-place sorting algorithm, cluster sort. It is designed in such a way that it improves sorting efficiency by using data locality.
Mohit Subramaniam +2 more
doaj +1 more source