INTRODUCTION International Classification of Disease, Ninth Revision (ICD-9) diagnosis codes have not been validated for identifying cases of missed abortion where a pregnancy is no longer viable but the cervical os remains closed. Our goal was to assess whether ICD-9 code "632" for missed abortion has high sensitivity and positive predictive value (PPV) in identifying patients in the emergency...

We study geometric variations of the discriminating code problem. In discrete version problem, a finite set points P and objects S are given in $$\mathbb {R}^d$$ . The objective is to choose subset $$S^* \subseteq S$$ minimum cardinality such that for each point $$p_i \in P$$ , $$S_i^* S^*$$ covering $$p_i$$ satisfies $$S_i^*\ne \emptyset $$ pair $$p_i,p_j $$i \ne j$$ we have S_j^*$$ continuous...

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code, or ID code, in a graph G is called the ID code number of G and is denoted γ(G). In this paper, we give upper and lower bounds for the ID code number of the prism of a graph...

Valgrind is a widely used framework for dynamic binary instrumentation and its mostly known by its memcheck tool. Valgrinds code generation module is far from producing optimal code. In addition it has many backends for different CPU architectures, which difficults code optimization in an architecture independent way. Our work focused on identifying sub-optimal code produced by Valgrind and opt...

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code in a graph G is denoted γID(G). It was recently shown by Gravier, Moncel and Semri that γ(Kn Kn) = ⌊ 3n 2 ⌋. Letting n,m ≥ 2 be any integers, we consider identifying codes o...

Given a graph G, an identifying code D ⊆ V (G) is a vertex set such that for any two distinct vertices v1, v2 ∈ V (G), the sets N [v1] ∩ D and N [v2] ∩ D are distinct and nonempty (here N [v] denotes a vertex v and its neighbors). We study the case when G is the infinite hexagonal grid H. Cohen et.al. constructed two identifying codes for H with density 3/7 and proved that any identifying code ...