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...

Object discovery algorithms group together image regions that originate from the same object. This process is effective when the input collection of images contains a large number of densely sampled views of each object, thereby creating strong connections between nearby views. However, existing approaches are less effective when the input data only provide sparse coverage of object views. We p...

Wireless sensor networks (WSNs) can be used to monitor the interested region using multihop communication. Coverage is a primary metric to evaluate the capacity of monitoring. Connectivity also needs to be guaranteed so that the sink node receives all sensed data for future processing. In this paper, we study the m-coverage and n-connectivity problem under border effects. We consider the scenar...

This paper explores the contribution of a broad range of syntactic features to WSD: grammatical relations coded as the presence of adjuncts/arguments in isolation or as subcategorization frames, and instantiated grammatical relations between words. We have tested the performance of syntactic features using two different ML algorithms (Decision Lists and AdaBoost) on the Senseval-2 data. Adding ...

A conductivity measurement of electrons and ions produced in laser multi-photon ionization is a simple and sensitive analytical technique. Aromatic molecules in solution excited by pulsed (266, 337 and 355 nm) or continuous (Ar) lasers showed detection limits as low as 1.7 ppt. Surface molecules can be detected below the monolayer coverage.

Testing behavioral models before they are released to the synthesis and logic design phase is a tedious process, to say the least. A common practice is the test-it-to-death approach in which millions or even billions of vectors are applied and the results are checked for possible bugs. The vectors applied to behavioral models include functional vectors, but the significant amount of the vectors...

This paper considers the problem of a generalized model for conflict analysis and resolution. Such a model would be helpful in analyzing and resolving conflict in disputes in both government and industry, where disputes and negotiations about various issues are the norm. The issue here is how to model a combination of situations among agents i) where there are disagreements leading to a conflic...

Nowadays fuzzing is a pretty common technique used both by attackers and software developers. Currently known techniques usually involve knowing the protocol/format that needs to be fuzzed and having a basic understanding of how the user input is processed inside the binary. In the past since fuzzing was little-used obtaining good results with a small amount of effort was possible. Today findin...

All testing techniques address a fundamental problem of testing: vastly more tests are conceivable than you could possibly run. Each technique therefore consists of a method for modeling the software in a way that allows a coverage measure to be specified and achieved and a dispersal strategy that allows this to done efficiently. Testing theory has traditionally focused on the issue of coverage...

The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collections that are likely to contain relevant documents, so it is necessary to first obtain information about the content of the target collections. In an uncooperative environment, query probing — where randomly-chosen quer...