Results 21 to 30 of about 2,467,903 (217)

Formal Modeling and Verification of Lycklama and Hadzilacos’s Mutual Exclusion Algorithm

open access: yesMathematics
This study describes our thorough experience of formal modeling and exhaustive verification of concurrent systems, particularly mutual exclusion algorithms. The experience focuses on Lycklama and Hadzilacos’s (LH) mutual exclusion algorithm.
Libero Nigro
doaj   +1 more source

Performance evaluation of distributed mutual exclusion algorithms

open access: yes, 1993
In any system in which concurrent processes share resources, mutual exclusion refers to the problem of guaranteeing the integrity of those resources by restricting their use to one process at a time.
Been, Kenneth B
core   +1 more source

Refinement of amino‐acid conformation vs. difference density maps in time‐resolved serial femtosecond crystallography data analysis

open access: yesFEBS Open Bio, EarlyView.
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong   +3 more
wiley   +1 more source

Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms

open access: yes, 2014
Mutual exclusion is a well known in distributed computing. Mutual exclusion comes into existence when n processes try to access the Critical Section at the same time.
Kahlon, Amandeep
core   +1 more source

Structural studies and functional engineering of NanX: an anhydro‐sialic acid transporter from Escherichia coli

open access: yesFEBS Open Bio, EarlyView.
Biophysical characterisation shows that NanX, a membrane transport protein from the major facilitator superfamily (MFS), forms both monomers and dimers after purification. AlphaFold modelling and substrate docking provide information on residues likely involved in substrate recognition for NanX and another MFS member, NanT.
Michael C. Newton‐Vesty   +13 more
wiley   +1 more source

Proving Properties of Dekker’s Algorithm for Mutual Exclusion of N Processes

open access: yesAlgorithms
Dekker’s algorithm for mutual exclusion of two processes is the well-known first developed correct solution based only on software mechanisms. The algorithm served as the starting point for researchers to create subsequent safe solutions both for two and
Libero Nigro, Franco Cicirelli
doaj   +1 more source

How to decide? Different methods of calculating gene expression from short oligonucleotide array data will give different results

open access: yesBMC Bioinformatics, 2006
Background Short oligonucleotide arrays for transcript profiling have been available for several years. Generally, raw data from these arrays are analysed with the aid of the Microarray Analysis Suite or GeneChip Operating Software (MAS or GCOS) from ...
Voesenek Laurentius ACJ   +5 more
doaj   +1 more source

Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Low‐grade gliomas (LGG) exhibit significant heterogeneity and recurrence risk. G protein‐coupled receptors (GPCR) contribute to glioma malignant progression, but their prognostic value remains unclear. This work attempts to formulate a GPCR‐based outcome‐predicting model for LGG. Methods Based on TCGA LGG data, the enrichment scores
Jun Yang   +4 more
wiley   +1 more source

The Multiple Sclerosis Severity Allele rs10191329A and Cognitive Function: A UK Biobank Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT The genome‐wide association study of Multiple Sclerosis severity linked the genetic variant rs10191329A to long‐term disability and implicated brain resilience as a determinant of outcome. We hypothesised that rs10191329A might influence cognition in other neurological diseases and healthy controls.
Ioanna Zimianiti   +5 more
wiley   +1 more source

An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion [PDF]

open access: yes, 2006
We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm is measured in the \emph{state ...
Fan, Rui, Lynch, Nancy
core  

Home - About - Disclaimer - Privacy