Results 11 to 20 of about 251,062 (259)

Channel Pruning-Based YOLOv7 Deep Learning Algorithm for Identifying Trolley Codes

Applied Sciences, 2023
The identification of trolley codes poses a challenge in engineering, as there are often situations where the accuracy requirements for their detection cannot be met.
Jun Zhang, Rongxi Zhang, Xinming Shu, Lulu Yu, Xuanning Xu   +4 more
doaj   +1 more source

An external validation of coding for childhood maltreatment in routinely collected primary and secondary care data

Scientific Reports, 2023
Validated methods of identifying childhood maltreatment (CM) in primary and secondary care data are needed. We aimed to create the first externally validated algorithm for identifying maltreatment using routinely collected healthcare data.
Ann John, Joanna McGregor, Amanda Marchant, Marcos DelPozo-Baños, Ian Farr, Ulugbek Nurmatov, Alison Kemp, Aideen Naughton   +7 more
doaj   +1 more source

Exact values for three domination-like problems in circular and infinite grid graphs of small height [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of ...
Marwane Bouznif, Julien Darlay, Julien Moncel, Myriam Preissmann   +3 more
doaj   +1 more source

Development of indicators for avoidable emergency medical service calls by mapping paramedic clinical impression codes to ambulatory care sensitive conditions and mental health conditions in the UK and Canada

BMJ Open, 2023
Objective Paramedic assessment data have not been used for research on avoidable calls. Paramedic impression codes are designated by paramedics on responding to a 911/999 medical emergency after an assessment of the presenting condition.
, Kamlesh Khunti, Robert Spaight, Niro Siriwardena, Gina Agarwal, Graham Law, Melissa Pirrie, Ricardo Angeles, Mark Gussy, Brent McLeod, Aloysius Niroshan Siriwardena, Gregory Whitley, Bartholomew Hill, Richard Ferron, Harriet Moore, Gregory Adam Whitley, Iwona Bielska, Jasdeep Brar, Rhiannon Cooper   +18 more
doaj   +1 more source

Identifying Codes in Line Graphs [PDF]

Journal of Graph Theory, 2012
AbstractAn identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbors within the code. We study the edge‐identifying code problem, i.e. the identifying code problem in line graphs.
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov   +4 more
openaire   +3 more sources

On the Properties of Algebraic Geometric Codes as Copy Protection Codes

Моделирование и анализ информационных систем, 2020
Traceability schemes which are applied to the broadcast encryption can prevent unauthorized parties from accessing the distributed data. In a traceability scheme a distributor broadcasts the encrypted data and gives each authorized user unique key and ...
Vladimir M. Deundyak, Denis V. Zagumennov   +1 more
doaj   +1 more source

Parent-Identifying Codes

Journal of Combinatorial Theory, Series A, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Eldar Fischer, Mario Szegedy
openaire   +2 more sources

Validation of algorithms to identify colorectal cancer patients from administrative claims data of a Japanese hospital

BMC Health Services Research, 2023
Background Administrative claims data are a valuable source for clinical studies; however, the use of validated algorithms to identify patients is essential to minimize bias.
Takahiro Hirano, Makiko Negishi, Yoshiki Kuwatsuru, Masafumi Arai, Ryozo Wakabayashi, Naoko Saito, Ryohei Kuwatsuru   +6 more
doaj   +1 more source

Identifying codes of cycles

European Journal of Combinatorics, 2006
We deal with identifying codes in cycles and show that for all \(r\geq 1\), any \(r\)-identifying code of the cycle \({\mathcal C}_n\) has cardinality at least \(\text{gcd}(2r+1,n)\left\lceil\frac{n}{2\text{gcd}(2r+1,n)}\right\rceil\).. This lower bound is enough to solve the case \(n\) even (which was already solved in [\textit{N. Bertrand, I. Charon,
Gravier, Sylvain, Moncel, Julien, Semri, A.   +2 more
openaire   +2 more sources

Towards local testability for quantum coding [PDF]

Quantum, 2022
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n \gt p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying antipodal
Anthony Leverrier, Vivien Londe, Gilles Zémor   +2 more
doaj   +1 more source