Miracle-dz/UniFAR-FTUs huggingface dataset:
Clone Smells in Software Evolution

Although source code cloning (copy&paste programming) represents a significant threat to the maintainability of a software system, problems usually start to arise only when the system evolves. Most of the related research papers tackle the question of finding code clones in one particular version of the software only, leaving the dynamic behavior of the clones out of consideration. Eliminating these clones in large software systems often seems absolutely hopeless, as there might exist several thousands of them. Alternatively, tracking the evolution of individual clones can be used to identify those occurrences that could really cause problems in the future versions. In this paper we present an approach for mapping clones from one particular version of the software to another one, based on a similarity measure. This mapping is used to define conditions under which clones become suspicious (or "smelly") compared to their other occurrences. Accordingly, these conditions introduce the notion of dynamic clone smells. The usefulness of these smells is validated on the Mozilla Firefox internet browser, where the approach was able to find specific bugs that resulted from neglecting earlier copy&paste activities.
Electronic Companion— " Overflow Networks: Approximations and Implications to Call-center Outsourcing " Proofs and Extensions Ec.1. Proofs

This e-companion is divided into two sections. In §EC.1 we prove all the results that appears in the body of the paper. In section EC.2 we consider the extension of the base model to a multi-class setting as the one in Figure 1(b) of the paper. We start by introducing some additional notational conventions. For two random variables X and Y we write X ≤ st Y when stochastic ordering holds in the standard sense. Namely, when E [f (X)] ≤ E [f (Y)] for every non-negative non-decreasing function f (·) for which the expectations are defined. If X and Y are two D-valued stochastic processes we will write {X(t), t ≥ 0} ≤ st {Y (t), t ≥ 0)} to denote the fact that the processes are ordered. In other words, that there exists a construction of the sample paths of X and Y such that, almost surely, X(t) ≤ Y (t) for all t ≥ 0. The rest of the section is divided into two subsections. Subsection EC.1. 1 establishes important properties of the (sequence of) availability processes D λ I , as defined in (8). Building on these, we then proceed to §EC.1. 2 where we prove the main results sated in §4. The proofs of several auxiliary lemmas are relegated to §EC.1. 3. We first establish upper and lower bounds (in appropriate probabilistic sense) for the process D λ I , by relating it to simple M/M/1 queues; see Lemmas EC.1. 1 and EC.1. 3. These bounds are then used to establish the pointwise stationarity of D λ I – see Theorem EC.1. 4. A FCLT via an AP for an appropriately scaled version of the related cumulative process C λ I in (9) is stated and proved in Theorem EC.1. 6. We start with a useful comparison result. For the following, let Q + = (Q + (t), t ≥ 0) have the law of the number of customers in an M/M/1 queue with arrival rate ν + and service rate 1, where is taken to be small enough ensuring that the process Q + is ergodic, i.e., that ρ + := ν + < 1 for all small enough, (EC.1) e-companion to Author: Overflow Networks ec3 where ρ + is the utilization of this M/M/1 queue. We add the subscript d to denote the initial value at time 0. That is, Q + ,d (t) corresponds to the queue length at …
Using Semantic Web Technologies to Support Information Processing and Coalition Decision-Making

This paper outlines three techniques and tools which have recently arisen from Semantic Web research in the International Technology Alliance. The first of these techniques is POAF (Portable Ontology Aligned Fragments), which addresses issues relating to the portability and usage of ontology alignments. POAF uses an ontology fragmentation strategy to achieve portability, and it enables subsequent usage of ontologies through a form of automated ontology modularization. The second technique, SWEDER (Semantic Wrapping of Existing Data sources with Embedded Rules), is grounded in the creation of lightweight ontologies to semantically wrap existing data sources, which facilitates rapid semantic integration through representational homogeneity and embedded rules. The third technique is NITELIGHT, which is a tool that has been created to better support end users with respect to the creation and editing of semantic queries. NITELIGHT uses a visual query language, called vSPARQL, and it is based on the W3C SPARQL query language specification. NITELIGHT supports end users by providing a set of graphical notations that represent semantic query language constructs. These enable the user to combine ontology navigation capabilities with graphical query visualisation techniques.
Quantum Corrections in p-adic String Theory

We compute loop corrections in p-adic open string field theory. We argue that quantum effects induce a pole with m^2 ~ - ln g for the open string field at the locally stable vacuum. We also compute the one loop effective potential and show that the potential develops an imaginary piece when the field becomes tachyonic.
Microsatellite Markers to Complement Distinctness, Uniformity, Stability Testing of Brassica chinensis (Xiao Baicai) Varieties

Brassica chinensis varieties are mostly consumed as vegetables. In order to assess utility of microsatellite markers for testing distinctness, uniformity and stability of B. chinensis varieties, we used nine polymorphic microsatellite marker loci (with a total of 131 alleles) to evaluate four open pollinated and four hybrid varieties of B. chinensis. Each va- riety was represented by 48 randomly sampled individuals from a population of 150. Morphological evaluations were also conducted to the same samples. Compared with morphological evaluations, the microsatellite analysis provided a higher degree of separation and reflected greater uniformity for the three hybrid varieties by cluster analysis, Principal Coordi- nates Analysis (PCA) and assignment test. Average pair-wise Jaccard similarities and statistical tests by AMOVA (analy- sis of molecular variance) also suggested higher levels of intra-variety uniformity. It was also noted that there was no sig- nificant correlation between the genetic and morphological distance matrices (Mantel test). We conclude that microsatel- lite genotyping can be a valuable tool to complement morphological assessment of Brassica vegetable varieties for dis- tinctiveness and uniformity.
What role does the ‘parent-effect’ play in child centered research? The case of photo-interviews of children’s home reading practices

Drawing on a photo-interview study of home reading practices with 35 children (ages 5–8) we examine how the ‘parent-effect’ influences research with young children. Not surprisingly, we find that parents influence reading practices and access to literacy resources. However, it is also clear that children’s reliance on parents affects data collection. Children who have more help from parents produce better photographs and a clearer narrative about home reading practices, but parents’ use of impression management influence the images that children produce and sometimes the photo-interview that follows. Rather than compromising children’s agency or the purity of the data, we argue that the parent-effect can be used an indicator of cultural norms about parenting; it can shed light into the dynamics of the parent-child relationships; and it can illuminate the degree to which children exert ‘child capital’ over home reading practices and the social construction of family life.
Antiprothrombin antibodies: detection and clinical significance in the antiphospholipid syndrome.

A NTIPHOSPHOLIPID antibodies have been associated with a variety of clinical phenomena, including arterial and venous thrombosis, thrombocytopenia, and obstetric complications. The term “antiphospholipid syndrome”[1][1]is used to link a variety of thromboembolic events to antibodies against
The Dyck Language Edit Distance Problem in Near-Linear Time

Given a string σ over alphabet Σ and a grammar G defined over the same alphabet, how many minimum number of repairs (insertions, deletions and substitutions) are required to map σ into a valid member of G? The seminal work of Aho and Peterson in 1972 initiated the study of this language edit distance problem providing a dynamic programming algorithm for context free languages that runs in O(|G|2n3) time, where n is the string length and G is the grammar size. While later improvements reduced the running time to O(G n3), the cubic time complexity on the input length held a major bottleneck for applying these algorithms to their multitude of applications. In this paper, we study the language edit distance problem for a fundamental context free language, DYCK(s) representing the language of well-balanced parentheses of s different types, that has been pivotal in the development of formal language theory. We provide the very first near-linear time algorithm to tightly approximate the DYCK(s) language edit distance problem for any arbitrary s. DYCK(s) language edit distance significantly generalizes the well-studied string edit distance problem, and appears in most applications of language edit distance ranging from data quality in databases, generating automated error-correcting parsers in compiler optimization to structure prediction problems in biological sequences. Its nondeterministic counterpart is known as the hardest context free language. Our main result is an algorithm for edit distance computation to DYCK(s) for any positive integer s that runs in O(n1+ϵ polylog(n)) time and achieves an approximation factor of O(1/ϵβ(n) log |OPT|), for any ϵ > 0. Here OPT is the optimal edit distance to DYCK(s) and β(n) is the best approximation factor known for the simpler problem of string edit distance running in analogous time. If we allow O(n1+ϵ + |OPT|2nϵ) time, then the approximation factor can be reduced to O(1/ϵ log |OPT|). Since the best known near-linear time algorithm for the string edit distance problem has β(n) = polylog(n), under near-linear time computation model both DYCK(s) language and string edit distance problems have polylog(n) approximation factors. This comes as a surprise since the former is a significant generalization of the latter and their exact computations via dynamic programming show a stark difference in time complexity. Rather less surprisingly, we show that the framework for efficiently approximating edit distance to DYCK(s) can be utilized for many other languages. We illustrate this by considering various memory checking languages (studied extensively under distributed verification) such as STACK, QUEUE, PQ and DEQUE which comprise of valid transcripts of stacks, queues, priority queues and double-ended queues respectively. Therefore, any language that can be recognized by these data structures, can also be repaired efficiently by our algorithm.
Monitoring Patient Improvement Parameters following Pasireotide Treatment in Cushing's Disease

Cushing's disease (CD) is a disorder in which chronic excess adrenocorticotropic hormone production is associated with multiple comorbidities and diminished quality of life. Postsurgical monitoring is important, and newer therapies are available for the management of surgical failure or disease recurrence. In this clinical case, we illustrate the importance of the nursing role in long-term management of CD, particularly as nurses may be the first point of contact for patients with CD. Alertness to disease signs and symptoms is crucial for timely diagnosis and improved outcomes. Successful therapy for CD requires careful monitoring of hormonal control, metabolic parameters, and therapy complications. Ongoing management requires lifelong monitoring of metabolic parameters, of side effects of treatment, and of signs of disease recurrence. Appropriate referrals may be required to facilitate overall outcomes and patient wellbeing. This patient was enrolled in a Phase III trial that was registered in the USA with clinicaltrial.gov.
Self-efficacy to spur job performance

With a foundation in conservation of resources theory, the purpose of this paper is to unpack the relationship between employees’ self-efficacy and job performance, investigating the mediating role of job-related anxiety and the moderating role of perceived workplace incivility. ,Survey data were collected from employees and their supervisors in Pakistani organizations. ,An important reason that employees’ self-efficacy enhances their job performance is that they experience less anxiety while undertaking their daily job tasks. This mediating role of job-related anxiety is particularly salient to the extent that employees believe that they are the victims of uncivil behaviors. ,Organizations should note that the anxiety-mitigating effect of self-efficacy is particularly strong for generating adequate performance to the extent that rude and discourteous behaviors cannot be completely avoided in the workplace. ,This study establishes a more complete understanding of the benefits of employees’ self-efficacy by revealing how reduced worries about their organizational functioning represent critical mechanisms that connect this personal resource to higher job performance, as well as by showing how employees’ perceptions of workplace incivility invigorate this process.
African immigrants’ experiences in American schools: complicating the race discourse

go beyond simply looking at the predictors of getting a college degree and consider more what it means to obtain a degree. Do more four-year credentials necessarily mean a more well-educated public? There are people who obtain these certifications while learning virtually nothing. Is a four-year degree necessarily preferable, for individuals and their communities, to vocational training? Are all degrees in every subject of the same intellectual or market value? If we do not wrestle with these questions, we cannot say with any precision what we are predicting when we look at predictors of college completion.
Myotendinous nerve endings in human infant and adult extraocular muscles

Myotendinous nerve endings in extraocular muscles of some mammals consist exclusively of palisade nerve endings incorporated in myotendinous cylinders. There is evidence for a similar form in man, some doubt remains. The objectives of the present study were to examine the structure and distribution of nerve endings in extraocular muscles of infant and adult human material. Muscles from five infants and six adults aged 3 days to 90 years were prepared for light and electron microscopy. Nerve endings were sparse in a 4‐year‐old and none were present in the muscles of younger donors. They were present in all adult samples. One group of nerve endings branched from single recurrent nerve fibers and were distributed in the encapsulated tendon of single Felderstruktur muscle fibers. Terminals were varicose and shared certain characteristics of known sensory endings and were similar to those of myotendinous cylinders except that none formed neuromuscular junctions. In other myotendinous complexes capsules were fragmented and nerve endings were dispersed in tendon common to two or more muscle fibers. In the myotendon of two adult donors, a further group of endings issuing from non‐recurrent nerves were unencapsulated and distributed randomly in tendon. The frequency of nerve endings varied across myotendon and in some instances, most marked in one case, large areas lacked nerve endings. Golgi tendon organs were not present. The terminals having features characteristic of sensory endings suggest a proprioceptive function, which is apparently unavailable in infancy. In mature muscles, the irregular distribution and variety of terminal form cannot be equated with those found in extraocular muscles of animals. We suggest that these features reflect an aberrant development and conclude that their capacity to fulfil an effective proprioceptive role is open to question. Anat Rec 260:132–140, 2000. © 2000 Wiley‐Liss, Inc.
Speaker-independent upfront dialect adaptation in a large vocabulary continuous speech recognizer

Large vocabulary continuous speech recognition systems show a signi cant decrease in performance if a users pronunciation di ers largely from those observed during system training. This can be considered as the main reason why most commercially available systems recommend| if not enforce | the individual end user to read an enrollment script for the speaker dependent reestimation of acoustic model parameters. Thus, the improvement of recognition rates for dialect speakers is an important issue both with respect to a broader acceptance and a more convenient or natural use of such systems. This paper compares di erent techniques that aim on a better speaker independent recognition of dialect speech in a large vocabulary continuous speech recognizer. The methods discussed comprise Bayesian adaptation and speaker clustering techniques and deal with both the availability and absence of dialect training material. Results are given for a case study that aims on the improvement of a German speech recognizer for Austrian speakers.
Cone beam computed tomographic analyses of alveolar bone anatomy at the maxillary anterior region in Chinese adults

To provide an anatomical basis for clinical implant esthetics, we evaluated the morphology of the nasopalatine canal (NPC) and analyzed labial and interproximal bone anatomy at the maxillary anterior region. We sought to investigate the effect of maxillary protrusion and tooth labiolingual inclination on labial bone anatomy in Chinese adults. Three dimensional (3D) images were reconstructed using cone-beam computed tomography (CBCT) images from 80 Chinese subjects and by SimPlant 11.04. The dimensions of the NPC, the thickness and profile of the labial bone, the width and height of the interproximal bone, angle sella-nasion-subspinale (SNA) and angle upper central incisor-nasion,subspinale (U1-NA) were measured. The incisive foramen of the NPC was markedly wider than its nasal foramen. The dimension of its labial bone wall demonstrated an increasing width from the crestal to apical measurements. The labial bone at the maxillary anterior region was rather thin, especially at 3 mm below the cemento-enamel junction (CEJ) and the mid-root level; the profile of the labial bone was more curved at the central incisor, and the interproximal bone became wider and shorter posteriorly. There were significant relationships between maxillary protrusion and labial bone profile, tooth labiolingual inclination and labial bone thickness (P < 0.02). To achieve optimal esthetic outcome of implant, bone augmentation is necessary at the maxillary anterior region. For immediate or early placement at the maxillary anterior region, the implant should be located palatally to reduce labial bone resorption and marginal recession; its apex should be angulated palatally to avoid labial perforation at the apical region. To protect the NPC, implants at the central incisor region should be placed away from NPC.
A Receiver-Initiated Directional MAC Protocol for Handling Deafness in Ad Hoc Networks

Recently, several MAC protocols using directional antennas, typically referred to as directional MAC protocols, have been proposed for wireless ad hoc networks. Although directional transmissions are expected to provide significant improvements, directional MAC protocols introduce new kinds of problems. One such problem is deafness. Deafness is caused when a transmitter repeatedly attempts to communicate with its intended receiver, but it fails because the receiver has its beam pointed towards a direction away from the transmitter. This paper proposes RI-DMAC (Receiver-Initiated Directional MAC) to address the issue of deafness in directional MAC protocols. RI-DMAC is a combination of sender-initiated and receiver-initiated operations. The sender-initiated mode is the default mode and the receiverinitiated mode is triggered when the transmitter experiences deafness. In RI-DMAC, each node maintains a polling table and polls a potential deafness node using the RTR (Ready To Receive) frame after the completion of every dialog. The experimental results show that RI-DMAC improves throughput and fairness performance compared to existing directional MAC protocols.
An approach for testing pointcut descriptors in AspectJ

Aspect‐oriented programming (AOP) promises better software quality through enhanced modularity. Crosscutting concerns are encapsulated in separate units called aspects and are introduced at specific points in the base program at compile time or runtime. However, aspect‐oriented mechanisms also introduce new risks for reliability that must be tackled by specific testing techniques in order to fully benefit from the use of AOP. This paper focuses on the pointcut descriptor (PCD) that declares the set of points in the base program's execution where the crosscutting concern must be woven. A fault in the PCD can have a ripple effect and result in many different faults. New behavior may be added in unexpected places, or places where new behavior should be added may be missed. When implementing aspect‐oriented programs with AspectJ, JUnit is most commonly used to test the program. However, JUnit does not offer any mechanism to look for faults specifically located in the PCD. As a consequence, these faults can be detected only through complex test scenarios and side effects that are difficult to trigger and observe. This paper proposes to monitor the execution of advices in an aspect‐oriented program and use this information to build test cases that target faults in PCDs. The AdviceTracer tool has been developed to automatically monitor and store all information related to advice executions. It also offers a set of operations that can be used to check the presence or absence of advices at specific points in the execution. These operations improve the definition of an oracle for PCD test cases. An empirical study is performed to compare JUnit and AdviceTracer for testing PCDs in terms of the complexity of test cases and their ability to detect faults. The study is performed on a Healthwatcher system that has 93 classes and 19 PCDs. It reveals that test cases that use AdviceTracer to test PCDs are easier to write (shorter test cases and written in less time than with JUnit) and detect more faults. Copyright © 2011 John Wiley & Sons, Ltd.
The Relevance of Relevance for Learning and Performance

ABSTRACT In this commentary, an attempt was made to uncover common ground about relevance found among the contributions to this special issue, which reflect diverse theoretical orientations and empirical traditions. Those commonalities characterize relevance as person-centered, complex or multifaceted, significant, and modifiable. With these commonalities identified and discussed, several tacit assumptions about relevance and mechanisms for its enhancement are critiqued. Among those assumptions are: the seeming acceptance of school content and tasks as having relevance; an expectation that changes in relevance judgments should ultimately result in improved learning and performance; and, the assignment of primary responsibility for discerning relevance to learners. This commentary concludes with a recommendation to approach the study of relevance more systemically by considering the broader academic context and forces that can facilitate or frustrate students' abilities to find the value, utility, and meaningfulness in what is taught and what is tasked in school.