Let G = (V,E) be a graph and N [X] denote the closed neighbourhood of X ⊆ V , that is to say, the union of X with the set of vertices which are adjacent to X. Given an integer t ≥ 1, a subset of vertices C ⊆ V is said to be a code identifying sets of at most t vertices of G—or, for short, a t-set-ID code of G—if the sets N [X] ∩ C are all distinct, when X runs through subsets of at most t verti...

Being able to identify the author of a program has many applications in both academic and commercial environments. In most use cases, the source code is readily available, and this is reflected in the literature, as previous work has mostly focused on source code analyses. In contrast, scant research has been carried out on identifying the authors of executable program binaries. This would be m...

Identifying code duplication in large multi-platform software system is a challenging problem. This is due to a variety of reasons including the presence of high-level programming languages and structures interleaved with hardware-dependent low-level resources and assembler code, the use of GUI-based configuration scripts generating commands to compile the system, and the extremely high number ...

This paper evaluates the reliability of information system for identifying mobile devices by IMEI code (International Mobile Equipment Identifier). A is presented, which includes a database that accessible both locally and remotely. The allows collecting, storing, processing about all imported into country used in country. Indicators calculating are selected. Only server hardware with software ...

To better support software maintenance and evolution, it is important to evaluate the quality of a system, identifying defects, code smells and anti patterns as hints to locate subsystems needing more effort and improvement. In this paper we focus our attention on the analysis of the possible correlations existing among code smells and between code smells and micro patterns, a kind of micro str...

In this paper we present RUST, an environment that assists the programmer in locating potential code improvements by searching for a set of predetermined patterns, identifying these areas as code smells, and providing a means to automatically implement refactorings. Results and changes are presented using an interface that allows the user to examine the affected code, try out and see the result...

The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper, we consider as sensors the set Z 2 where one sensor can check its neighbours within Euclidean distance r. We construct tolerant identifying codes in this network that are robust against some changes in the neighbourh...

Given a connected graph G = (V,E), Let r ≥ 1 be an integer and Br(v) denote the ball of radius r centered at v ∈ V , i.e., the set of all vertices within distance r from v. A subset of vertices C ⊆ V is an r-identifying code of G (for a given nonzero constant r ∈ N) if and only if all the sets Br(v) ∩ C are nonempty and pairwise distinct. These codes were introduced in [7] to model a fault-dete...

a new mathematical model for identifying pollution sources in aquifers is presented. the model utilizes lagrange constrained optimization method (lcom) and is capable to inversely solve unsteady fluid flow in saturated, heterogeneous, anisotropic confined and/or unconfined aquifers. throughout the presented model, complete advection-dispersion equation, including the adsorption as well as retar...