Results 21 to 30 of about 251,062 (259)
Identifying incident Parkinson's disease using administrative diagnostic codes: a validation study
Clinical Parkinsonism & Related Disorders, 2020 Background: Administrative databases that capture diagnostic codes are increasingly being used worldwide for research because they can save time and reduce costs.
Brett J. Peterson +4 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2011 Abstract We study the edge identifying code problem, i.e. the identifying code problem in line graphs. If γ ID ( G ) denotes the size of a minimum identifying code of a graph G , we show that the usual bound γ ID ( G ) ⩾ ⌈ log 2 ( n + 1 ) ⌉ , where n denotes the order of G , can be improved to Θ ( n )
Florent Foucaud +4 more
openaire +1 more source
Antimicrobial Resistance and Infection Control, 2022 Background Cardiac implantable electronic device (CIED) surgical site infections (SSIs) have been outpacing the increases in implantation of these devices.
Elissa Rennert-May +8 more
doaj +1 more source
JMIR Formative Research, 2023 BackgroundElectronic health record (EHR) data provide a unique opportunity to study the epidemiology of COVID-19, clinical outcomes of the infection, comparative effectiveness of therapies, and vaccine effectiveness but require a ...
Suchitra Rao +14 more
doaj +1 more source
Codes of Conduct of pharmaceutical companies as acts of autonomous law and their place within Fuller's moral scale [PDF]
Pravni Zapisi, 2021 The article analyses codes of conduct of pharmaceutical companies, as specific autonomous acts which prescribe both moral principles of fair and honest business and particular legal duties.
Danilović Jelena
doaj +1 more source
Discrete Mathematics, 2002 Given an undirected graph \(G=(V,E)\), the set of all vertices within distance \(t\) from a vertex \(v \in V\) is denoted by \(B_t(v)\). A set \(C \subseteq V\) is called a \(t\)-identifying code if all sets \(B_t(v)\cap C\) are nonempty and different.
Iiro S. Honkala +2 more
openaire +1 more source
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Blass, Iiro S. Honkala, Simon Litsyn
openaire +1 more source
Error-correcting Identifying Codes
CoRR, 2022 Assume that a graph $G$ models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a subset of vertices in $G$ to automatically determine if there is an intruder, and if so, its precise location.
Devin C. Jean, Suk Jai Seo
openaire +2 more sources
Intersecting codes and partially identifying codes
Electronic Notes in Discrete Mathematics, 2001 Abstract Let τ be a code of length n. Then x is called a descendant of the coalition of codewords a, b, …, ei fxi ∈ {ai, bi…, ei} for i = 1,…, n. We study codes with the following property: any two non intersecting coalitions of a limited size have no common descendant. We present constructions based on linear intersecting codes.
Gérard D. Cohen +2 more
openaire +1 more source
RepliComment: Identifying clones in code comments [PDF]
Journal of Systems and Software, 2021 31 pages, 1 figure, 9 tables.
Arianna Blasi +3 more
openaire +2 more sources