Delay upper bounds for a finite user random-access system with bursty arrivals

1992 ◽  
Vol 40 (3) ◽  
pp. 591-596 ◽  
Author(s):  
A.B. Behroozi-Toosi ◽  
R.R. Rao
Keyword(s):  
Random Access ◽  
Upper Bounds ◽  
Access System

scholarly journals On the Comparison Complexity of the String Prefix-Matching Problem

1995 ◽  
Vol 2 (46) ◽  
Author(s):  
Dany Breslauer ◽  
Livio Colussi ◽  
Laura Toniolo
Keyword(s):  
Linear Time ◽  
String Matching ◽  
Random Access ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Matching Problem ◽  
Machine Model ◽  
Worst Case ◽  
On Line ◽  
Sequential Comparison

In this paper we study the exact comparison complexity of the string<br />prefix-matching problem in the deterministic sequential comparison model<br />with equality tests. We derive almost tight lower and upper bounds on<br />the number of symbol comparisons required in the worst case by on-line<br />prefix-matching algorithms for any fixed pattern and variable text. Unlike<br />previous results on the comparison complexity of string-matching and<br />prefix-matching algorithms, our bounds are almost tight for any particular pattern.<br />We also consider the special case where the pattern and the text are the<br />same string. This problem, which we call the string self-prefix problem, is<br />similar to the pattern preprocessing step of the Knuth-Morris-Pratt string-matching<br />algorithm that is used in several comparison efficient string-matching<br />and prefix-matching algorithms, including in our new algorithm.<br />We obtain roughly tight lower and upper bounds on the number of symbol<br />comparisons required in the worst case by on-line self-prefix algorithms.<br />Our algorithms can be implemented in linear time and space in the<br />standard uniform-cost random-access-machine model.

scholarly journals Performances of NeuMoDx™, a random-access system for HBV-DNA and HCV-RNA quantification

2021 ◽  
Author(s):  
Juliette Besombes ◽  
Charlotte Pronier ◽  
Charles Lefevre ◽  
Gisèle Lagathu ◽  
Anne Maillard ◽  
...  
Keyword(s):  
Random Access ◽  
Hbv Dna ◽  
Hcv Rna ◽  
Access System ◽  
Rna Quantification

scholarly journals Characterising and bounding the set of quantum behaviours in contextuality scenarios

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 484
Author(s):  
Anubhav Chaturvedi ◽  
Máté Farkas ◽  
Victoria J Wright
Keyword(s):  
Quantum Theory ◽  
Quantum Key Distribution ◽  
Unitary Operator ◽  
Random Access ◽  
Upper Bounds ◽  
Mixed States ◽  
Distribution Scheme ◽  
The Individual ◽  
Projective Measurements ◽  
Quantum Strategies

The predictions of quantum theory resist generalised noncontextual explanations. In addition to the foundational relevance of this fact, the particular extent to which quantum theory violates noncontextuality limits available quantum advantage in communication and information processing. In the first part of this work, we formally define contextuality scenarios via prepare-and-measure experiments, along with the polytope of general contextual behaviours containing the set of quantum contextual behaviours. This framework allows us to recover several properties of set of quantum behaviours in these scenarios, including contextuality scenarios and associated noncontextuality inequalities that require for their violation the individual quantum preparation and measurement procedures to be mixed states and unsharp measurements. With the framework in place, we formulate novel semidefinite programming relaxations for bounding these sets of quantum contextual behaviours. Most significantly, to circumvent the inadequacy of pure states and projective measurements in contextuality scenarios, we present a novel unitary operator based semidefinite relaxation technique. We demonstrate the efficacy of these relaxations by obtaining tight upper bounds on the quantum violation of several noncontextuality inequalities and identifying novel maximally contextual quantum strategies. To further illustrate the versatility of these relaxations, we demonstrate monogamy of preparation contextuality in a tripartite setting, and present a secure semi-device independent quantum key distribution scheme powered by quantum advantage in parity oblivious random access codes.

scholarly journals Performance Evaluation of the KRYPTOR Compact PLUS Analyzer-Based B.R.A.H.M.S. CgA Ⅱ KRYPTOR Assay for Chromogranin A Measurement

Diagnostics ◽  
2021 ◽  
Vol 11 (12) ◽  
pp. 2400
Author(s):  
Yu Jeong Choi ◽  
Juhye Roh ◽  
Sinyoung Kim ◽  
Kyung-A Lee ◽  
Younhee Park
Keyword(s):  
Chromogranin A ◽  
Random Access ◽  
Correlation Coefficients ◽  
Pancreatic Tumors ◽  
Good Precision ◽  
Strong Correlations ◽  
High Concentration ◽  
Access System ◽  
Coefficients Of Variation ◽  
Disease Entities

Numerous immunoassays have been developed to measure the levels of chromogranin A (CgA), a useful biomarker for diagnosing and monitoring generally heterogeneous neuroendocrine tumors (NETs). Here, we evaluated the imprecision and linearity of three such assays: KRYPTOR (ThermoFisher Scientific), NEOLISA (EuroDiagnostica), and CgA-RIA (CisBio), using 123 samples for each assay. The correlation coefficients between the assays were 0.932 (CgA-RIA versus NEOLISA), 0.956 (KRYPTOR versus CgA-RIA), and 0.873 (NEOLISA versus KRYPTOR). KRYPTOR showed good precision, with percent coefficients of variation less than 5% for low and high concentration quality controls. Linearity was maintained over a wide concentration range. Comparison of CgA levels from three disease entities (NETs, non-NET pancreatic tumors, and prostate cancer) and healthy controls showed that patients with NETs had significantly higher CgA levels (n = 57, mean: 1.82 ± 0.43 log ng/mL) than healthy individuals (n = 20, mean: 1.51 ± 0.23 log ng/mL; p = 0.018). No other significant differences between groups were observed. All three immunoassays showed strong correlations in measured CgA levels. Because KRYPTOR operation uses a fully automated random-access system and requires shorter incubation times and smaller sample volumes, the KRYPTOR assay may improve laboratory workflow while maintaining satisfactory analytical performance.

Sign in / Sign up

Export Citation Format

Share Document