Revealing Developers’ Arguments on Validating the Incidence of Code Smells: A Focus Group Experience

Identifying code smells is considered a subjective task. Unfortunately, current automated detection tools cannot deal with such subjectivity, requiring human validation. Developers tend to follow different, albeit complementary, strategies when validating the identified smells. Intending to find out developers' arguments when validating the incidence of code smells, we conducted a focus group session with developers familiar with identifying code smells. We distributed them among two groups, in which they had to argue about the incidence of a code smell: either accepting or rejecting its presence. Based on their arguments, we compiled a set of general heuristics that developers follow when validating smells. We then used these heuristics for composing validation items. We understand that the set of validation items proposed may support developers in reflecting on the incidence of code smells. However, further studies are needed for reaching a more comprehensive and optimized set. The experience of this study reveals that conducting focus group sessions is helpful to emerge the tacit knowledge of developers when validating code smells.

Optimal Identifying Codes in Oriented Paths and Circuits

Identifying codes in graphs are related to the classical notion of dominating sets [1]. Since there first introduction in 1998 [2], they have been widely studied and extended to several application, such as: detection of faulty processor in multiprocessor systems, locating danger or threats in sensor networks. Let G=(V,E) an unoriented connected graph. The minimum identifying code in graphs is the smallest subset of vertices C, such that every vertex in V have a unique set of neighbors in C. In our work, we focus on finding minimum cardinality of an identifying code in oriented paths and circuits

Minimum identifying codes in some graphs differing by matchings

For a vertex [Formula: see text] of a graph [Formula: see text], let [Formula: see text] be the set of [Formula: see text] with all of its neighbors in [Formula: see text]. A set [Formula: see text] of vertices is an identifying code of [Formula: see text] if the sets [Formula: see text] are nonempty and distinct for all vertices [Formula: see text] of [Formula: see text]. If [Formula: see text] admits an identifying code, then [Formula: see text] is called identifiable and the minimum cardinality of an identifying code of [Formula: see text] is denoted by [Formula: see text]. Let [Formula: see text] be two positive integers. In this paper, [Formula: see text] and [Formula: see text] are computed, where [Formula: see text] and [Formula: see text] represent the complement of a path and the complement of a cycle of order [Formula: see text], respectively. Among other results, [Formula: see text] is given, where [Formula: see text] is obtained from [Formula: see text] after deleting a maximum matching.

Code-switching as a translanguaging to transfer cross-cultural understanding in English classroom: teachers’ perception

This study was identifying code-switching as a translanguaging to transfer cross-cultural understanding in the classroom. This study used observation to one classroom and unstructured questionnaire to seven English lecturers/ teachers qualitatively. Most of the participants used Inter-sentential Code Switching, which describes a switch of language at sentence boundary or between the sentences. They used the code-switching consciously for some factors, such as the desire to convey meaning effectively, the desire to make the communication more inclusive, the desire to improve students’ comprehension, the desire to convey the meaning contextually, the desire to emphasize the meaning or comprehension, and the desire to help EFL learners by bilingual. Moreover, the most important thing is they believe that code-switching affects English classroom positively in transferring cross-culture understanding, such as code-switching eases students to understand more to the cultural topics, code-switching can improve students’ comprehension on conceptual knowledge such as cultural activities, attitude and belief, and code-switching is useful for EFL learners where they can match their English with local wisdom.

r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube

We study about monotonicity of [Formula: see text]-identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube. Also, we give the lower bounds for [Formula: see text] where [Formula: see text] is the smallest cardinality among all [Formula: see text]-identifying codes in [Formula: see text] with respect to the Lee metric. We prove the existence of [Formula: see text]-identifying code in an incomplete hypercube. Also, we give the construction techniques for [Formula: see text]-identifying codes in the incomplete hypercubes in Secs. 4.1 and 4.2. Using these techniques, we give the tables (see Tables 1–6) of upper bounds for [Formula: see text] where [Formula: see text] is the smallest cardinality among all [Formula: see text]-identifying codes in an incomplete hypercube with [Formula: see text] processors. Also, we give the exact values of [Formula: see text] for small values of [Formula: see text] and [Formula: see text] (see Sec. 4.3).