Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards the integration of model-driven engineering, software product line engineering, and software configuration management

Model-Driven Software Engineering (MDSE), Software Product Line Engineering (SPLE) and Software Configuration Management (SCM) have been established as independent disciplines to ease different aspects of software development. The usage of models as high-level abstractions promises to increase productivity, while software product lines manage variability within a family of similar software products; software configuration management systems manage evolution and support collaborative development. In this paper, we explore the state of the art regarding the pairwise combinations MDSE/SPLE, SPLE/SCM, and MDSE/SCM and show that an integrated solution combining all three disciplines is missing. We present a conceptual framework to integrate MDSE, SPLE and SCM uniformly based on a filtered editing model. The framework implies a number of advantages, namely unconstrained variability, a reduction of cognitive complexity, improved consistency, tool independence, and a higher level of automation. Our formalism is based on a uniform versioning model for temporal, cooperative, and logical versioning of models. By an example, we show the feasibility of our approach.
Heat stress impairs performance and induces intestinal inflammation in broiler chickens infected with Salmonella Enteritidis

Stressful situations reduce the welfare, production indices and immune status of chickens. Salmonella spp. are a major zoonotic pathogens that annually cause over 1 billion infections worldwide. We therefore designed the current experiment to analyse the effects of 31±1°C heat stress (HS) (from 35 to 41 days) on performance parameters, Salmonella invasion and small intestine integrity in broiler chickens infected with Salmonella Enteritidis. We observed that HS decreased body weight gain and feed intake. However, feed conversion was only increased when HS was combined with Salmonella Enteritidis infection. In addition, we observed an increase in serum corticosterone levels in all of the birds that were subjected to HS, showing a hypothalamus–pituitary–adrenal axis activation. Furthermore, mild acute multifocal lymphoplasmacytic enteritis, characterized by foci of heterophil infiltration in the duodenum, jejunum and ileum, was observed in the HS group. In contrast, similar but more evident enteritis was noted in the heat-stressed and Salmonella-infected group. In this group, moderate enteritis was observed in all parts of the small intestine. Lastly, we observed an increase in Salmonella counts in the spleens of the stressed and Salmonella-infected chickens. The combination of HS and Salmonella Enteritidis infection may therefore disrupt the intestinal barrier, which would allow pathogenic bacteria to migrate through the intestinal mucosa to the spleen and generate an inflammatory infiltrate in the gut, decreasing performance parameters.
Pathogen- and Host-Directed Anti-Inflammatory Activities of Macrolide Antibiotics

Macrolide antibiotics possess several, beneficial, secondary properties which complement their primary antimicrobial activity. In addition to high levels of tissue penetration, which may counteract seemingly macrolide-resistant bacterial pathogens, these agents also possess anti-inflammatory properties, unrelated to their primary antimicrobial activity. Macrolides target cells of both the innate and adaptive immune systems, as well as structural cells, and are beneficial in controlling harmful inflammatory responses during acute and chronic bacterial infection. These secondary anti-inflammatory activities of macrolides appear to be particularly effective in attenuating neutrophil-mediated inflammation. This, in turn, may contribute to the usefulness of these agents in the treatment of acute and chronic inflammatory disorders of both microbial and nonmicrobial origin, predominantly of the airways. This paper is focused on the various mechanisms of macrolide-mediated anti-inflammatory activity which target both microbial pathogens and the cells of the innate and adaptive immune systems, with emphasis on their clinical relevance.
Location Management in Multi-Hop Wireless Sensor Networks

The chapter concerns solutions about the problems of managing the location information of nodes of ad hoc and wireless sensor networks (WSNs). Once nodes know about their location, solutions for location management take care of disseminating this important information to all or some of the other network nodes that need it for routing or other purposes. The chapter covers first the solutions that have been proposed for mobile ad hoc networks, where research in this area has started along geographic routing over a decade ago. We then describe solutions in the still largely uncharted territory of WSNs. In particular, we survey methods for location management that have been proposed for different application scenarios, emphasizing how location information is managed, i.e., proactively, reactively, or through dedicated nodes (location servers), which nodes move, and the different communication models adopted. Our review of the solutions currently proposed reveals that further research is needed for providing efficient location management protocols, especially for WSNs, and that the evaluation of their effectiveness for location aware applications and geographic routing is needed for truly identify new protocol design guidelines and improved network performance.
Experience with endoscopic management of high-risk gastroesophageal varices, with and without bleeding, in children with biliary atresia.

BACKGROUND & AIMS Biliary atresia, the most common cause of childhood cirrhosis, increases the risks for portal hypertension and gastrointestinal bleeding. We report the results from a single-center study of primary and secondary prophylaxis of bleeding in children with portal hypertension and high-risk varices. METHODS We collected data from 66 children with major endoscopic signs of portal hypertension, including grade 3 esophageal varices or grade 2 varices with red wale markings and/or gastric varices, treated consecutively from February 2001 through May 2011. Thirty-six children (mean age, 22 mo) underwent primary prophylaxis (sclerotherapy and/or banding, depending on age and weight). Thirty children (mean age, 24 mo) who presented with gastrointestinal bleeding received endoscopic treatment to prevent a relapse of bleeding (secondary prophylaxis). RESULTS In the primary prophylaxis group, a mean number of 4.2 sessions were needed to eradicate varices; no bleeding from gastroesophageal varices was observed after eradication. Varices reappeared in 37% of children, and 97% survived for 3 years. In the secondary prophylaxis group, a mean number of 4.6 sessions was needed to eradicate varices. Varices reappeared in 45%, and 10% had breakthrough bleeding; 84% survived for 3 years. There were no or only minor complications of either form of prophylaxis. CONCLUSIONS Endoscopic therapy as primary or secondary prophylaxis of bleeding appears to be well tolerated and greatly reduces the risk of variceal bleeding in children with biliary atresia and high-risk gastroesophageal varices. However, there is a risk that varices will recur, therefore continued endoscopic surveillance is needed.
On the spectroastrometric separation of binary point-source fluxes

Spectroastrometry is a technique which has the potential to resolve flux distributions on scales of milliarcseconds. In this study, we examine the application of spectroastrometry to binary point sources which are spatially unresolved due to the observational point spread function convolution. The technique uses measurements with sub-pixel accuracy of the position centroid of high signal-to-noise long-slit spectrum observations. With the objects in the binary contributing fractionally more or less at different wavelengths (particularly across spectral lines), the variation of the position centroid with wavelength provides some information on the spatial distribution of the flux. We examine the width of the flux distribution in the spatial direction, and present its relation to the ratio of the fluxes of the two components of the binary. Measurement of three observables (total flux, position centroid and flux distribution width) at each wavelength allows a unique separation of the total flux into its component parts even though the angular separation of the binary is smaller than the observations' point-spread function. This is because we have three relevant observables for three unknowns (the two fluxes, and the angular separation of the binary), which therefore generates a closed problem. This is a wholly different technique than conventional deconvolution methods, which produce information on angular sizes of the sampling scale. Spectroastrometry can produce information on smaller scales than conventional deconvolution, and is successful in separating fluxes in a binary object with a separation of less than one pixel. We present an analysis of the errors involved in making binary object spectroastrometric measurements and the separation method, and highlight necessary observing methodology.
Iterative Channel Estimation for Orthogonal STBC MC-CDMA Systems over Realistic High-Mobility MIMO Channels

This paper considers a downlink multiple-input multiple-output (MIMO) multi-carrier code division multiple access (MC-CDMA) system with pilot aided channel estimation (PACE) and iterative channel estimation (ICE) in the receiver. Exploiting orthogonal space-time block coding (STBC), we investigate ICE schemes as a simple extension of PACE using estimated data chips as additional pilots. Due to the superposition of different users' spread data signals, zero-valued chips can occur after spreading, which can cause noise enhancement when using data estimates as reference signals in ICE. Hence, we propose MIMO channel estimation methods to overcome the above problem. Simulations with a realistic outdoor MIMO channel model, over a wide range of data rates and speeds, show that ICE can outperform PACE at the cost of increased complexity
A Simplified Method of Measurement of Energy Consumption in Cloud and Virtualized Environment

Measuring energy consumption is an essential step in the development of policies for the management of energy in every IT system. There is a wide range of methods using both hardware and software for measuring energy consumed by the system accurately. However, most of these methods measure energy consumed by a machine or a cluster of machines. In environments such as Cloud that an application can be built from components with comparable characteristics, measuring energy consumed by a single component can be extremely beneficial. For example, if we can measure energy consumed by different HTTP servers, then we can establish which one consumes less energy performing a given task. As a result, the Cloud provider can provide incentives, so that, application developers use the HTTP server that consume less energy. Indeed, considering size of the Cloud, even a small amount of saving per Virtual Machine can add up to a substantial saving. In this paper, we propose a technique to measure energy consumed by an application via measuring energy consumed by the individual processes of the application. We shall deal with applications that run in a virtualized environment such as Cloud. We present two implementations of our idea to demonstrate the feasibility of the approach. Firstly, a method of measurement with the help of Kernel-Based Virtual Machine running on a typical laptop is presented. Secondly, in a commercial Cloud such as Elastic host, we describe a method of measuring energy consumed by processes such as HTTP servers. This will allow commercial providers to identify which product consumes less energy on their platform.
Activation of simian virus 40 transcription in vitro by T antigen

Simian virus 40 is repressed when the viral early gene product large tumor antigen (TAg) binds to specific sites within the viral origin and DNA replication ensues. Late transcription is activated by TAg, even in the absence of viral DNA replication. We show here that TAg produced in human 293 cells can selectively activate Simian virus 40 transcription in a cell-free system. In the absence of DNA binding by TAg, early and late transcription are both activated, as they are in vivo, suggesting that the effect might be mediated by a cellular component(s) utilized by both the early and late promoters. When TAg binds to the viral origin of replication, early transcription is repressed but the late promoter activation is unaffected. Various preparations of TAg differed in their activities, with some able both to bind DNA and to activate transcription and others able to do only one or the other. Since these variations might be explained by variable amounts of associated factors that copurified with TAg, we asked whether a bacterially derived protein could regulate transcription. An NH2-terminal 272-amino-acid fragment of TAg, produced in Escherichia coli as a glutathione S-transferase fusion protein, retains the ability to activate transcription in vitro, similar to that of the full-length protein. Structural features of this region that might be important are discussed.
The origins of the Turing thesis myth

In this paper, we identify and analyze the historical reasons for the widespread acceptance of what we call the Turing Thesis myth, which extends the Turing Thesis to imply that Turing Machines model all computers. This is the third in a series of related papers by the authors, beginning with [5] and continuing with [6]. 1 The Turing Thesis myth Turing's famous 1936 paper [15] developed the Turing Machine (TM) model and showed that TMs have the expressiveness of algorithms (Turing Thesis). Turing Thesis: Whenever there is an e ective method (algorithm) for obtaining the values of a mathematical function, the function can be computed by a TM. Turing's thesis has since been reinterpreted to imply that TuringMachines model all computation, rather than just functions. This claim, which we call the Strong Turing Thesis, can be found in today's popular undergraduate theory textbooks: Strong Turing Thesis: A TM can do (compute) anything that a computer can do. This bold claim is part of the mainstream theory of computation, yet Turing himself would have denied it. In the same famous paper, he also introduced interactive choice machines as another model of computation distinct from TMs and not reducible to it. Choice machines extend TMs to interaction by allowing a human operator to make choices during the computation. In fact, the Strong Turing Thesis is incorrect { the function-based behavior of algorithms does not capture all forms of computation. For example, as explained in [5], interactive protocols are not algorithmic. Yet the myth of the correctness of the Strong Turing Thesis is dogmatically accepted by most computer scientists. As Denning recently wrote in this publication [7], \we are captured by a historic tradition that sees programs as mathematical functions". The reasons for the widespread acceptance of the Turing Thesis myth can be traced to the establishment of computer science as a separate discipline in the 1960's. To understand these reasons better, we can identify four distinct claims that make up the myth, and examine them individually: Claim 1. All computable problems are function-based. Reason: Adoption of mathematical principles for the fundamental notions of computation, identifying computability with the computation of functions, as well as with TMs.
Hypothesis Testing Based Knowledge Discovery in Distributed Multiple Data Sources

In the past several years, most data mining researchers focus on data mining from single data source. Nowadays, data mining from multiple data sources is a new problem in Web environment and is also an efficient technique for solving knowledge discovery in distributed databases. A new method for mining multi-data sources is presented in this paper. By sharing knowledge patterns discovered in other similar data sources, hypothesis testing is employed for verifying whether the patterns are also suitable for local data source or not. So that can improve the efficiency of KDD greatly. Finally the effectiveness of this method is analyzed and experimental result is given. This method can be extended as an efficient data mining algorithm in case of apriori hypothesizes are provided. And it can be also used for incremental data mining.
Rights to Land, Forests and Carbon in REDD+: Insights from Mexico, Brazil and Costa Rica

Land tenure and carbon rights constitute critical issues to take into account in achieving emission reductions, ensuring transparent benefit sharing and determining non-permanence (or non-compliance) liabilities in the context of REDD+ strategies and projects. This is so because tenure systems influence who becomes involved in efforts to avoid deforestation and improve forest management, and that land tenure, carbon rights and liabilities may be linked or divorced with implications for rural development. This paper explores these issues by looking at tenure regimes and carbon rights issues in Mexico, Brazil and Costa Rica. It is effectively shown that complex bundles of rights over forest resources have distinct implications for REDD+ design and implementation, and that REDD+ strategies in selected countries have to date failed in procedurally addressing land-use conflicts and carbon rights entitlements and liabilities.
Long-term follow up of 103 ankylosed permanent incisors surgically treated with decoronation--a retrospective cohort study.

BACKGROUND/AIM Decoronation is a technique developed in 1984 to remove ankylosed teeth and increase marginal bone levels in young, growing individuals. This retrospective cohort study evaluates marginal bone development after decoronation in relation to gender and age at treatment. MATERIALS AND METHODS The study evaluated all 95 patients with 103 ankylosed permanent incisors treated with decoronation at the Eastmaninstitutet Department of Pediatric Dentistry during 1978-1999. Mean age of the patients was 10.7 years (6.8-17.8) at the time of trauma and 14.9 years (9.3-22.0) at decoronation. The mean follow-up period was 4.6 years (1.0-19.3 years). The study evaluated development of the marginal alveolar bone level with a three-point scoring system: 1 = Unchanged or reduced alveolar bone level, 2 = A moderate increase in alveolar bone level, and 3 = A considerable increase in alveolar bone level. The final group for statistical evaluation comprised 75 patients: 56 boys and 19 girls who had only one tooth decoronated. Kappa statistics showed almost complete agreement between the two observers (κ = 0.90). RESULTS Bone level changes were significantly correlated (P < 0.05) to gender and age at treatment. In decoronations performed after the age of 16, bone levels were unchanged or reduced, while decoronations performed at a mean age of 14.6 years in boys and 13 years in girls yielded a considerable increase in bone levels. CONCLUSION This study indicates that age at decoronation is an important factor for favorable development of the alveolar ridge and that decoronation should be performed earlier in girls.
The realization of key extraction based on USRP and OFDM channel response

The reciprocity of the wireless and the randomness of channel characteristic is the basis of physical layer key generation technology based on the channel. The complete key generation technologies include five steps that channel probing, channel feature extraction, quantification, reconciliation and privacy application. There are many theories and simulation prove the feasibility of key extraction and in this paper, the first four steps of key extraction are realized by using MIMO-OFDM system established by the USRP radio devices. This paper summarizes the physical layer key generation process, and introduces the method of extracting key from different literatures is used to realize the key extraction, so as to provide an important reference for further research on key generation technology.
Secure Cache: Run-Time Detection and Prevention of Buffer Overflow Attacks

This paper shows a novel cache architecture, called SCache, to detect and prevent buffer-overflow attacks at run time. A number of malicious codes exploit buffer-overflow vulnerability to alter a return-address value and hijack the program-execution control. In order to solve the security issue, SCache generates replica cache lines on each return-address store, and compares the original value loaded from the memory stack with the replica one on the corresponding return-address load. The number and the placement policy of the replica line strongly affect both performance and vulnerability. In our evaluation, it has been observed that SCache can protect more than 99.3% of return-address loads from buffer-overflow attacks, while it causes negligible performance overhead.
Mining a Software Developer's Local Interaction History

Although shared software repositories are commonly used during software development, it is typical that a software developer browses and edits a local snapshot of the software under development. Developers periodically check their changes into the software repository; however, their interaction with the local copy is not recorded. Local interaction histories are a valuable source of information and should be considered when mining software repositories. In this paper we discuss the benefits of analyzing local interaction histories and present a technique and prototype implementation for their capture and analysis. As well, we discuss the implications of local interaction histories and the infrastructure of software repositories.
A parallel LLL algorithm

The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size reduction.
Individual differences in children's event memory reports and the narrative elaboration technique.

Children between 7 and 8 years old took part in a staged event at school and 1 week later were assessed using a short form of the Wechsler Intelligence scale for children (third edition) and measures of metamemory, narrative ability, and socioeconomic status. Two weeks following the event, children either received narrative elaboration training (NET; K.J. Saywitz & L. Snyder, 1996) and were prompted with the four NET cue cards at interview; received verbal prompts corresponding to the cue card categories, but without prior training; or were presented with the cards at interview without prior training. Children given verbal labels as prompts recalled as much information as children who received NET training and cue cards. Measures of intelligence were predictive of amount recalled for cards-only children but not for the other 2 groups, indicating that differences in recall between low- and high-IQ groups were attenuated when recall was supported by NET training or verbal prompting.