A walk c1, c2, . . . , cM in an undirected graph G = (V, E) is called a dynamic identifying code, if all the sets I(v) = {u ∈ C : d(u, v) ≤ 1} for v ∈ V are nonempty and no two of them are the same set. Here d(u, v) denotes the number of edges on any shortest path from u to v, and C = {c1, c2, . . . , cM}. We consider dynamic identifying codes in square grids, triangular grids, hexagonal meshes...

Let G = (V,E) be a connected undirected graph and S a subset of vertices. If for all vertices v ∈ V , the sets Br(v) ∩ S are all nonempty and different, where Br(v) denotes the set of all points within distance r from v, then we call S an r-identifying code. We give constructive upper bounds on the best possible density of r-identifying codes in four infinite regular graphs, for small values of r.

Many software systems contain usused code. While unused code is an unnecessary burden for maintenance, it is often unclear which parts of a modern software system can actually be removed. We present a semi-automatic, iterative, language-independent approach to identify unused classes in large objectoriented systems. It combines static and runtime information about an application and aids develo...

Mutation Testing is white box testing technique that analyze the code under different values, bounds and constraints. It also analyzes the data values associated to different operators and evaluates their significance over the code. Further this operator based analysis helps in identifying the scope and limitations along with the relevancy, robustness and effectiveness of code. Mutation testing...

Lightweight specifications support software maintainability by providing a way to verify that any changes to a code base preserve certain program properties. We give two examples of lightweight specifications for numerical code: units-of-measure types which specify the physical units of numerical quantities in a program; and stencil specifications which describe the pattern of data access used ...

Summary Whole-exome sequencing (WES) data have been used for identifying copy number aberrations in cancer cells. Nonetheless, the use of WES is still challenging for identification of focal aberrant regions in multiple samples that may contain cancer driver genes. In this study, we developed a wavelet-based method for identifying focal genomic aberrant regions in the WES data from cancer cells...

This work presents a dataset and annotation scheme for the new task of identifying “good” conversations that occur online, which we call ERICs: Engaging, Respectful, and/or Informative Conversations. We develop a taxonomy to reflect features of entire threads and individual comments which we believe contribute to identifying ERICs; code a novel dataset of Yahoo News comment threads (2.4k thread...

The key issue that was clarified at the meeting is that the purpose of Tasks 3 and 4 is to perform research into a formal verification/validation process that would fit with ESA’s software development methodologies, by developing a reference specification, identifying a formalism and process, and running a pilot feasibility study on sample code. The actual code to be subjected to verification i...

The paper proposes a method for extracting, identifying and visualisation of topics, code tiers, users and authors in software projects. In addition to standard information retrieval techniques, we use AST for source code and WordNet ontology to enrich document vectors extracted from parsed code, LSI to reduce its dimensionality and the swarm intelligence in the bee behaviour inspired algorithm...

Developers write and maintain unit tests continually in order to reflect changes in the production code and maintain an effective regression test suite. In addition, during refactoring developers must ensure that all unit tests continue to pass, so unit tests often need to be refactored together with the source code. Traceability links between application code and respective unit tests are extr...