An identifying code of a graph is a subset of vertices C such that the sets B(v) ∩ C are all nonempty and di,erent. In this paper, we investigate the problem of -nding identifying codes of minimum cardinality in strips and -nite grids. We -rst give exact values for the strips of height 1 and 2, then we give general bounds for strips and -nite grids. Finally, we give a sublinear algorithm which ...

A large set of object-oriented programming (OOP) languages exists to realize software for different purposes. Companies often create variants of their existing software by copying and modifying them to changed requirements. While these so-called clone-and-own approaches allow to save money in short-term, they expose the company to severe risks regarding long-term evolution and product quality. ...

An identifying code of a (di)graph G is a dominating subset C of the vertices of G such that all distinct vertices of G have distinct (in)neighbourhoods within C. In this paper, we classify all finite digraphs which only admit their whole vertex set as an identifying code. We also classify all such infinite oriented graphs. Furthermore, by relating this concept to a well-known theorem of A. Bon...

An r-identifying code in a graph G = (V,E) is a subset C ⊆ V such that for each u ∈ V the intersection of C and the ball of radius r centered at u is nonempty and unique. Previously, r-identifying codes have been studied in various grids. In particular, it has been shown that there exists a 2-identifying code in the square grid with density 5/29 ≈ 0.172 and that there are no 2-identifying codes...

Eder Vázquez Vázquez, Omar González Brito, Jovani A. García, Miguel García Calderón, Gabriela Villada Ramírez, Alan J. Serrano León, René A. García-Hernández, Yulia Ledeneva Universidad Autónoma del Estado de México, UAPT Tianguistenco. Instituto Literario, 100, Toluca, Edo. Méx. 50000, México. [email protected], [email protected], [email protected], [email protected], in...

when manufacturers release patches, they are usually released as binary executable programs. Vendors generally do not disclose the exact location of the vulnerabilities, even they may conceal some of the vulnerabilities, which is not conducive to study the in-depth situation of security for the need of consumers. In this paper we introduce a vulnerability discover method using machine learning ...

Let’s say that you have been tasked to ensure that your company has an H.264 solution that supports high-definition video decoding at 30 frames per second. You are not a video expert. What do you do? You could get on the Internet and perform a Web search for H.264; before you know it, you’ll have the source code and be on your way. You managed to compile the code and get it running on the targe...

To a large extent, repositories of end-user code are “write-only”: much of the code that people publish never sees substantial reuse. Yet buried within these repositories are valuable pieces of code, though finding them is not always easy. In prior work, we developed a model that can predict, when a web macro is created, whether that script will be reused by anybody. In the current paper, we an...

Assume that G = (V,E) is an undirected graph, and C ⊆ V . For every v ∈ V , we denote by I(v) the set of all elements of C that are within distance one from v. If the sets I(v) \ {v} for v ∈ V are all nonempty, and, moreover, the sets {I(v), I(v) \ {v}} for v ∈ V are disjoint, then C is called a strongly identifying code. The smallest possible density of a strongly identifying code in the infin...

Abstract In software, an algorithm is a well-organized sequence of actions that provides the optimal way to complete task. Algorithmic thinking also essential break-down problem and conceptualize solutions in some steps. The proper selection pivotal improve computational performance software productivity as well programming learning. That is, determining suitable from given code widely relevant...