Results 21 to 30 of about 453,327 (300)
TECHNOLOGY OF IDENTIFYING ANTIPATTERNS IN ANDROID PROJECTS WRITTEN IN KOTLIN LANGUAGE
The problem of the lack of instruments for identifying the characteristics of low-quality code in Android projects that are written in the Kotlin language is determined.
Ivan Yuriyovich Malik +3 more
doaj +1 more source
Identification of protein coding genes in genomes with statistical functions based on the circular code [PDF]
A new statistical approach using functions based on the circular code classifies correctly more than 93 % of bases in protein (coding) genes and non-coding genes of human sequences. Based on this statistical study, a research software called "Analysis of
Lacan, Jérôme +5 more
core +1 more source
Commutative rings introduce a class of identifiable graphs [PDF]
Let $R$ be a commutative ring with identity, and $ \mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ \mathrm{A}(R)^{*}=\mathrm{A}(R)\setminus\lbrace
Reza Nikandish +2 more
doaj +1 more source
ANALYSIS OF CODE-SWITCHING AND CODE-MIXING USED IN RINTIK SEDU YOUTUBE CHANNEL’S VIDEO
Rintik Sedu is an Indonesian writer's YouTube channel named Nadhifa Allya Tsana. As the content creator, Tsana masters Indonesian English and studies Korean self-taught.
Made Rahayu Sai Maheswara
doaj +1 more source
Validated methods of identifying childhood maltreatment (CM) in primary and secondary care data are needed. We aimed to create the first externally validated algorithm for identifying maltreatment using routinely collected healthcare data.
Ann John +7 more
doaj +1 more source
Identifying and prioritizing the factors affecting the Iranian Sports Refereeing Ethics Code
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
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 +1 more source
Identifying Incorrect Patches in Program Repair Based on Meaning of Source Code
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
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
Clone Detection and Elimination for Haskell [PDF]
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code makes maintenance and code understanding more complex and time consuming.
Brown, Christopher Mark +4 more
core +1 more source

