Results 31 to 40 of about 453,327 (300)
LCCSS: A Similarity Metric for Identifying Similar Test Code [PDF]
, 2020 Apresentação do artigo "LCCSS: A Similarity Metric for Identifying Similar Test Code" para o SBCARS ...
Vilain, Patrícia, da Silva, Lucas
core +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
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 +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
On Codes with the Identifiable Parent Property
Journal of Combinatorial Theory, Series A, 1998 Suppose \(C\) is a code of length \(n\) over an alphabet \(Q\) containing \(q\) elements and let \(a\) and \(b\) be any two codewords. Then \(c\) is a decendent of \(a\) and \(b\) if \(c_i\) is in \((a_i,b_i)\), for \(i= 1,2,\dots, n\). The authors are interested in codes \(C\) such that given any decendent \(c\), one of the ``parent'' codewords in \(C\
Henk D. L. Hollmann +3 more
openaire +3 more sources
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
Identifying codes in line digraphs [PDF]
Applied Mathematics and Computation, 2020 Given an integer $\ell\ge 1$, a $(1,\le \ell)$-identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at most $\ell$ have distinct closed in-neighbourhood within $C$. In this paper, we prove that every $k$-iterated line digraph of minimum in-degree at least 2 and $k\geq2$, or ...
Balbuena Martínez, Maria Camino Teófila +2 more
openaire +5 more sources
FPGA based remote code integrity verification of programs in distributed embedded systems [PDF]
, 2012 The explosive growth of networked embedded systems has made ubiquitous and pervasive computing a reality. However, there are still a number of new challenges to its widespread adoption that include scalability, availability, and, especially, security of ...
Stefano Di Carlo +5 more
core +1 more source
Identifying informative predictor variables with random forests (simulation study code) [PDF]
, 2023 This repository contains the simulation code and data of the study "Identifying informative predictor variables with random ...
Yannick Rothacher
core +2 more sources