Identifying the code needed to perform software maintenance and evolution tasks can be very difficult and time consuming for large, complex software systems. A number of techniques have been proposed that employ either static or dynamic analysis to isolate code related to a feature of interest. Static approaches suffer from poor precision by including irrelevant code, while dynamic approaches c...

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 linked to v by a path of at most r edges. If for all vertices v ∈ V , the sets Br(v) ∩C are all nonempty and different, then we call C an r-identifying code. A graph admits at least one r-ide...

Code-switching is the practice of moving back and forth between two languages in spoken or written form of communication. In this paper, we address the problem of word-level language identification of code-switched sentences. Here, we primarily consider Hindi-English (Hinglish) code-switching, which is a popular phenomenon among urban Indian youth, though the approach is generic enough to be ex...

We sought to determine the accuracy of two electronic methods of identifying pancreatic cancer in a cohort of pancreatic cyst patients, and to examine the reasons for identification failure. We used the International Classification of Diseases, 9(th) Edition (ICD-9) codes and natural language processing (NLP) technology to identify pancreatic cancer in these patients. We compared both methods t...

For a graph, G, and a vertex v ∈ V (G), let N [v] be the set of vertices adjacent to and including v. A set D ⊆ V (G) is a vertex identifying code if for any two distinct vertices v1, v2 ∈ V (G), the vertex sets N [v1]∩D and N [v2]∩D are distinct and non-empty. We consider the minimum density of a vertex identifying code for the infinite hexagonal grid. In 2000, Cohen et al. constructed two cod...

Software maintenance is difficult and costly because the maintainer must understand the existing relationships in the maintained code. The maintainer’s job can be made considerably easier if the objects in the code (related groups of types, data, and procedures) are identified. In this paper, we discuss methods for identifying objects in programs, and present a new approach that relies on these...

Aspect-oriented programming (AOP) is a programming paradigm for improving the modularity of software systems by localizing crosscutting concerns in the system into aspects. Aspect-oriented refactorings extend AOP to legacy systems, by identifying and encapsulating existing crosscutting concerns through aspect-mining (discovery of crosscutting concerns) and aspect refactoring (semantic-preservin...

The automatic extraction of high-level structural information from code is important for both software maintenance and reuse. Instead of using specialpurpose tools, we explore the use of a general-purpose data visualization system called Hy+ for querying and visualizing information about object-oriented software systems. Hy+ supports visualization and visual querying of arbitrary graph-like dat...

Digital fingerprinting is a technique for identifying users who might try to use multimedia content for unintended purposes, such as redistribution. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cost-effective attack against such digital fingerprints is collusion, where several differently marke...