Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V , and an integer r ≥ 1; for any vertex v ∈ V , let Br (v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V \C), the sets Br (v) ∩ C are all nonempty and different, then we call C an r -identifying code (respectively, an r -...

Solving Tree Pattern Query problem is the central part of XML database query. This thesis presents several new algorithms to solve Tree Pattern Query problem and its variations. All of them have better time complexity than any existing algorithms. This thesis also describes the design, implementation, and application of two new algorithms to detect cloned code. The algorithms operate on the abs...

Let C be a code of length n over a q-ary alphabet. An n-word y is called a descendant of a set of t codewords x;y; x if yiAfxi ;y; xig for all i 1⁄4 1;y; n: A code is said to have the t-identifying parent property (t-i.p.p.) if for any n-word y that is a descendant of at most t parents it is possible to identify at least one of them. An explicit construction is presented of t-i.p.p. codes of ra...

Proofs of linearizability of concurrent data structures generally rely on identifying linearization points to establish a simulation argument between the implementation and the specification. However, for many linearizable data structure operations, the linearization points may not correspond to their internal static code locations; for example, they might reside in the code of another concurre...

This paper addresses the problem of measurement of non-monetary economic activity, specifically in the area of free/open source software communities. It describes the problems associated with research on these communities in the absence of measurable monetary transactions, and suggests possible alternatives.. A class of techniques using software source code as factual documentation of economic ...

Images may be matched as whole images or using shape matching. Shape matching requires: identifying edges in the image, finding shapes using the edges and representing the shapes using a suitable metric. A Laplacian edge detector is simple and efficient for identifying the edges of shapes. Chain codes describe shapes using sequences of numbers and may be matched simply, accurately and flexibly....

OBJECTIVE To construct and validate billing code algorithms for identifying patients with peripheral arterial disease (PAD). METHODS We extracted all encounters and line item details including PAD-related billing codes at Mayo Clinic Rochester, Minnesota, between July 1, 1997 and June 30, 2008; 22 712 patients evaluated in the vascular laboratory were divided into training and validation sets...

While the Android operating system is popular among users, it has also attracted a broad variety of miscreants and malware. New samples are discovered every day. Purely automatic analysis is often not enough for understanding current state-of-the-art Android malware, though. Miscreants obfuscate and encrypt their code, or hide secrets in native code. Precisely identifying the malware’s behavior...

Evaluation of statement coverage is the problem of identifying the statements of a program that execute in one or more runs of a program. The traditional approach for statement coverage tools is to use static code instrumentation. In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of statement coverage measurement. We als...

A virus is a program that replicates itself by copying its code into other files. A common virus protection mechanism involves scanning files to detect code patterns of known viruses. We prove that the problem of reliably identifying a bounded-length mutating virus is NP-complete by showing that a virus detector for a certain virus strain can be used to solve the satisfiability problem. The imp...