Results 21 to 30 of about 3,507,644 (308)
Identifying and prioritizing the factors affecting the Iranian Sports Refereeing Ethics Code
Sport TK, 2021 The purpose of this research was to compile a sports refereeing ethics code in Iran. The method of the present research was mixed (qualitative and quantitative).
Ahdieh Sadeghi Kalani +3 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2011 Abstract We study the edge identifying code problem, i.e. the identifying code problem in line graphs. If γ ID ( G ) denotes the size of a minimum identifying code of a graph G , we show that the usual bound γ ID ( G ) ⩾ ⌈ log 2 ( n + 1 ) ⌉ , where n denotes the order of G , can be improved to Θ ( n )
Florent Foucaud +4 more
openaire +2 more sources
Similar Code Detection and Elimination for Erlang Programs [PDF]
, 2010 A well-known bad code smell in refactoring and software maintenance is duplicated code, that is the existence of code clones, which are code fragments that are identical or similar to one another.
Huiqing Li +3 more
core +1 more source
Identifying Incorrect Patches in Program Repair Based on Meaning of Source Code
IEEE Access, 2022 Automatic Program Repair (APR) techniques have shown the potential of reducing debugging costs while improving software quality by generating patches for fixing bugs automatically.
Quang-Ngoc Phung, Misoo Kim, Eunseok Lee
doaj +1 more source
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri Blass, Iiro S. Honkala, Simon Litsyn
openaire +1 more source
Error-correcting Identifying Codes
CoRR, 2022 Assume that a graph $G$ models a detection system for a facility with a possible "intruder," or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing (the minimum number of) detectors at a subset of vertices in $G$ to automatically determine if there is an intruder, and if so, its precise location.
Devin C. Jean, Suk Jai Seo
openaire +2 more sources
Discrete Mathematics, 2002 Given an undirected graph \(G=(V,E)\), the set of all vertices within distance \(t\) from a vertex \(v \in V\) is denoted by \(B_t(v)\). A set \(C \subseteq V\) is called a \(t\)-identifying code if all sets \(B_t(v)\cap C\) are nonempty and different.
Iiro S. Honkala +2 more
openaire +1 more source
Watching systems of triangular graphs [PDF]
Transactions on Combinatorics, 2014 A watching system in a graph $G=(V, E)$ is a set $W={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, Z_{i}), v_{i}in V$ and $Z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $L_{W}(v)={omega_{i}: vin ...
Maryam Roozbayani +2 more
doaj
Code Mixing Found in Bukan Empat Mata Program on Trans 7 Television Channel
JEELS (Journal of English Education and Linguistics Studies), 2022 This study is aimed to find the kinds of code mixing and to know which kinds of code mixing are dominantly used in Bukan Empat Mata Program on TRANS 7 Television channel. Descriptive qualitative method is used in this study.
Fitria Nur Hamidah
doaj +1 more source
Intersecting codes and partially identifying codes
Electronic Notes in Discrete Mathematics, 2001 Abstract Let τ be a code of length n. Then x is called a descendant of the coalition of codewords a, b, …, ei fxi ∈ {ai, bi…, ei} for i = 1,…, n. We study codes with the following property: any two non intersecting coalitions of a limited size have no common descendant. We present constructions based on linear intersecting codes.
Gérard D. Cohen +2 more
openaire +2 more sources