Miracle-dz/UniFAR-FTUs huggingface dataset:
Hardware-Assisted Cooperative Integration of Wear-Leveling and Salvaging for Phase Change Memory

Phase Change Memory (PCM) has recently emerged as a promising memory technology. However, PCM’s limited write endurance restricts its immediate use as a replacement for DRAM. To extend the lifetime of PCM chips, wear-leveling and salvaging techniques have been proposed. Wear-leveling balances write operations across different PCM regions while salvaging extends the duty cycle and provides graceful degradation for a nonnegligible number of failures. Current wear-leveling and salvaging schemes have not been designed and integrated to work cooperatively to achieve the best PCM device lifetime. In particular, a noncontiguous PCM space generated from salvaging complicates wear-leveling and incurs large overhead. In this article, we propose LLS, a Line-Level mapping and Salvaging design. By allocating a dynamic portion of total space in a PCM device as backup space, and mapping failed lines to backup PCM, LLS constructs a contiguous PCM space and masks lower-level failures from the OS and applications. LLS integrates wear-leveling and salvaging and copes well with modern OSes. Our experimental results show that LLS achieves 31% longer lifetime than the state-of-the-art. It has negligible hardware cost and performance overhead.
A Theory of Actionable Data Mining with Application to Semiconductor Manufacturing Control

Accurate and timely prediction of a manufacturing process yield and flow times is often desired as a means of reducing the overall production costs. To this end, we develop in this paper a new decision-theoretic classification framework and apply it to a real-world semiconductor wafer manufacturing line, which suffers from constant variations in the characteristics of the chip manufacturing process. The decision-theoretic framework is based on a model for evaluating classifiers in terms of their value in decision-making. Recognizing that in many practical applications the values of the class probabilities as well as payoffs are neither static nor known exactly, we present a precise condition under which one classifier ‘dominates’ another classifier (i.e., achieves higher payoff), regardless of payoff or class distribution information. Building on the decision-theoretic model, we propose two robust ensemble classification methods that construct composite classifiers which are at least as good as any of the existing component classifiers for all possible payoff functions and class distributions. We show how these two robust ensemble classifiers are put into practice by developing decision rules for effectively monitoring and controlling the real-world semiconductor wafer fabrication line under study.
APPLETS TO SUPPORT REASONING ABOUT EXPLAINED AND UNEXPLAINED VARIABILITY

Reasoning about overall variability in a data set, and the partitioning of variability into explained and unexplained, is a key aspect of statistical reasoning. It also provides a powerful conceptual framework for unifying several sometimes disparate topics of introductory statistics such as linear regression, ANOVA, and significance testing of a fitted model. This type of reasoning creates a platform for comparing statistical models and hence lays a foundation for inferential thinking. We will describe a pair of applets that have been developed with the explicit aim of helping students to reason visually about the partitioning of variability into explained and unexplained variability. The first applet deals with the case of a numeric explanatory variable (regression for bivariate data), the second with the case of a categorical explanatory variable (single-factor ANOVA). We highlight some aspects of the applets’ design which are of pedagogical relevance, and discuss how the applets may support possible learning trajectories for reasoning about variability in the topics of regression, ANOVA and statistical modelling.
Generation of three different fragments of bound C3 with purified factor I or serum. II. Location of binding sites in the C3 Fragments for Factors B and H, complement receptors , and bovine conglutinin

The many different recognized functions of C3 are dependent upon the ability of the activated C3 molecule both to bind covalently to protein and carbohydrate surfaces and to provide binding sites for as many as eleven different proteins. The location of the binding sites for six of these different proteins (factors B and H, complement receptors CR(1), CR(2) and CR(3) and conglutinin) was examined in the naturally occurring C3-fragments generated by C3 activation (C3b) and degradation by Factor I (iC3b, C3c, C3d,g) and trypsin (C3d). Evidence was obtained for at least four distinct binding sites in C3 for these six different C3 ligands. One binding site for B was detectable only in C3b, whereas a second binding site for H and CR(1) was detectable in both C3b and iC3b. The affinity of the binding site for H and CR(1) was charge dependent and considerably reduced in iC3b as compared to C3b. H binding to iC3b-coated sheep erythrocytes (EC3bi) was measurable only in low ionic strength buffer (4 mS). The finding that C3c-coated microspheres bound to CR(1), indicated that this second binding site was still intact in the C3c fragment. However, H binding to C3c was not examined. A third binding site in C3 for CR(2) was exposed in the d region by factor I cleavage of C3b into iC3b, and the activity of this site was unaffected by the further I cleavage of iC3b into C3d,g. Removal of the 8,000-dalton C3g fragment from C3d,g with trypsin forming C3d, resulted in reduced CR2 activity. However, because saturating amounts of monoclonal anti-C3g did not block the CR(2)-binding activity of EC3d,g, it appears unlikely that the g region of C3d,g or iC3b forms a part of the CR(2)-binding site. In addition, detergent-solubilized EC3d (C3d-OR) inhibited the CR(2)-binding activity of EC3d,g. Monocytes and neutrophils, that had been previously thought to lack CR(2) because of their inability to form EC3d rosettes, did bind EC3d,g containing greater than 5 × 10(4) C3d,g molecules per E. The finding that monocyte and neutrophil rosettes with EC3d,g were inhibited by C3d-OR, suggested that these phagocytic cells might indeed express very low numbers of CR(2), and that these CR(2) were detectable with EC3d,g and not with EC3d because C3d,g had a higher affinity for CR2 than did C3d. A fourth C3 binding site for CR(3) and conglutinin (K) was restricted to the iC3b fragment. Because of simultaneous attachment of iC3b to phagocyte CR3 and CR(3), the characteristics of iC3b binding to CR3 could only be examined with phagocytes on which the CR(1) had been blocked with anti-CR(1). Inhibition studies with EDTA and N-acetyl-D-glucosamine demonstrated a requirement for both calcium cations and carbohydrate in the binding of EC3bi to CR3 and to K. However, CR(3) differed from K in that magnesium cations were required in addition to calcium for maximum CR(3) binding activity, and NADG produced less inhibition of CR(3) activity than of K activity.
A trust based clustering with Ant Colony Routing in VANET

Inter-vehicle communication is a promising way to share and disseminate real-time and nearby safety information on the road. Scalability of vehicular ad hoc network is one of the decisive matters for a network designer, which can be solved by clustering. In this paper, as our first algorithm an attempt has been made to create clusters by considering direction, position and relative speed of the vehicle for managing the scalability issue. Moreover, we have proposed a new algorithm for selecting the most appropriate cluster head (CH) by considering the real time updated position and trust value of vehicles. As, evolutionary based routing is a predominant research theme thus we have used the most efficient ant colony routing technique based on trust for the simple highway scenario based VANET. Finally simulation result shows our proposed Trust dependent Ant Colony Routing (TACR) has outperformed the Mobility-aware Ant Colony Optimization Routing (MAR-DYMO) algorithm in terms of routing overhead.
Analyses of the Large Subunit Histidine-Rich Motif Expose an Alternative Proton Transfer Pathway in [NiFe] Hydrogenases

A highly conserved histidine-rich region with unknown function was recognized in the large subunit of [NiFe] hydrogenases. The HxHxxHxxHxH sequence occurs in most membrane-bound hydrogenases, but only two of these histidines are present in the cytoplasmic ones. Site-directed mutagenesis of the His-rich region of the T. roseopersicina membrane-attached Hyn hydrogenase disclosed that the enzyme activity was significantly affected only by the replacement of the His104 residue. Computational analysis of the hydrogen bond network in the large subunits indicated that the second histidine of this motif might be a component of a proton transfer pathway including Arg487, Asp103, His104 and Glu436. Substitutions of the conserved amino acids of the presumed transfer route impaired the activity of the Hyn hydrogenase. Western hybridization was applied to demonstrate that the cellular level of the mutant hydrogenases was similar to that of the wild type. Mostly based on theoretical modeling, few proton transfer pathways have already been suggested for [NiFe] hydrogenases. Our results propose an alternative route for proton transfer between the [NiFe] active center and the surface of the protein. A novel feature of this model is that this proton pathway is located on the opposite side of the large subunit relative to the position of the small subunit. This is the first study presenting a systematic analysis of an in silico predicted proton translocation pathway in [NiFe] hydrogenases by site-directed mutagenesis.
Modelling and Visualisation of the Optical Properties of Cloth

Cloth and garment visualisations are widely used in fashion and interior design, enter-taining, automotive and nautical industry and are indispensable elements of visual com-munication. Modern appearance models attempt to offer a complete solution for the visualisation of complex cloth properties. In the review part of the chapter, advanced methods that enable visualisation at micron resolution, methods used in three-dimen- sional (3D) visualisation workflow and methods used for research purposes are presented. Within the review, those methods offering a comprehensive approach and experiments on explicit clothes attributes that present specific optical phenomenon are analysed. The review of appearance models includes surface and image-based models, volumetric and explicit models. Each group is presented with the representative authors’ research group and the application and limitations of the methods. In the final part of the chapter, the visualisation of cloth specularity and porosity with an uneven surface is studied. The study and visualisation was performed using image data obtained with photography. The acquisition of structure information on a large scale namely enables the recording of structure irregularities that are very common on historical textiles, laces and also on artistic and experimental pieces of cloth. The contribution ends with the presentation of cloth visualised with the use of specular and alpha maps, which is the result of the image processing workflow. the definition and implementation of the optimal threshold algorithm was crucial and the results served as maps for image-based modelling. The maps were evaluated with the image analysis so that the pores and specular areas could also be numerically analysed before they were applied in a final 3D reconstruction. The contribution reviewed the importance of cloth appearance modelling in 3D computer graphic and presented the opportunities for further developments and implementations.
Visualizing and Navigating Source Code History

We present the Source Code History Navigator, a tool for visualizing the evolution of source code and comparing many revisions of a source code file. Our tool provides an overview of the entire history of a source file through a “history flow”-style visualization in which revisions are plotted as vertical pixel stripes, with each pixel line in a stripe corresponding to a line in the revision and coloured according to some property of interest (e.g., authorship of the line, differences from previous and next revisions, line type, or code age.) Stripes can be expanded to obtain a detail view showing the entire text of the revision. Many such text viewers can be opened side-by-side simultaneously, and their scrollbars can be locked together, facilitating easy comparison of differences across multiple revisions. We present a detailed usage scenario to demonstrate the applicability of our tool.
International Journal of Nanomedicine Dovepress Green Synthesis and Characterization of Gelatin-based and Sugar-reduced Silver Nanoparticles

Silver nanoparticles (Ag-NPs) have been successfully prepared with simple and " green " synthesis method by reducing Ag + ions in aqueous gelatin media with and in the absence of glucose as a reducing agent. In this study, gelatin was used for the first time as a reducing and stabilizing agent. The effect of temperature on particle size of Ag-NPs was also studied. It was found that with increasing temperature the size of nanoparticles is decreased. It was found that the particle size of Ag-NPs obtained in gelatin solutions is smaller than in gelatin–glucose solutions, which can be related to the rate of reduction reaction. X-ray diffraction, ultraviolet-visible spectra, transmission electron microscopy, and atomic force microscopy revealed the formation of monodispersed Ag-NPs with a narrow particle size distribution.
Semantic social overlay networks

Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of network traffic. Structured peer-to-peer systems (like Chord) enforce a particular, global way of distributing data among the peers in order to solve this problem, but then encounter problems of network volatility and conflicts with the autonomy of the peer data management. In this paper, we propose a new mechanism, INGA, which is based on the observation that query routing in social networks is made possible by locally available knowledge about the expertise of neighbors and a semantics-based peer selection function. We validate INGA by simulation experiments with different data sets. We compare INGA with competing peer selection mechanisms on resulting parameters like recall, message gain or number of messages produced.
Male‐killer dynamics in the tropical butterfly, Acraea encedana (Lepidoptera: Nymphalidae)

Sex ratio distortion in the tropical butterfly Acraea encedana is caused by infection with a male‐killing bacterium of the genus Wolbachia. Previous research on this species has reported extreme female bias, high bacterial prevalences, and full sex role reversal. In this paper, we provide an assessment for the dynamics of the male‐killer, based on a survey for sex ratios and Wolbachia prevalences among wild populations of A. encedana in Uganda. The study reveals that Wolbachia infection showed considerable variation over both spatial and temporal scales.
Caries preventive effect of sugar-substituted chewing gum.

OBJECTIVES The aim of this 3-year community intervention trial was to determine the caries preventive effect of sugar-substituted chewing gum among Lithuanian school children, and to assess compliance with the instructions for gum use. METHODS A total of 602 children, aged 9-14 years, from 28 school classes in five secondary schools in Kaunas, Lithuania, were given a baseline clinical and radiographic caries examination. The schools were randomly allocated to receive one of the following interventions: sorbitol/carbamide gum; sorbitol gum; xylitol gum; control gum; and no gum. Children in the four active intervention groups were asked to chew at least five pieces of gum per day, preferably after meals. The children were reexamined clinically after 1, 2 and 3 years, and radiographically after 3 years. Self-reported compliance was monitored anonymously four times during the study. RESULTS A total of 432 children were available at the 3-year clinical follow-up examination. The crude mean 3-year caries increments (DMFS--all stages of lesion formation) were 11.8 for the sorbitol/carbamide gum group; 9.0 for the sorbitol gum group; 8.1 for the xylitol gum group; 8.3 for the control gum group; and 12.4 for the no gum group. The adjusted 3-year caries increments were statistically significantly lower in the sorbitol gum group, the xylitol gum group and the control gum group than in the no gum group, whereas no statistically significant difference was seen between the no gum group and the sorbitol/carbamide gum group. Adjusted 3-year caries increments in the xylitol gum group and the sorbitol gum group did not differ statistically significantly from the caries increments in the control gum group. Compliance with the study protocol was better in School C (xylitol gum) than in the other schools. In all schools, compliance decreased over time. CONCLUSION The results indicate that the caries preventive effect of chewing sugar-free gum is related to the chewing process itself rather than being an effect of gum sweeteners or additives, such as polyols and carbamide.
PHF13 is a molecular reader and transcriptional co-regulator of H3K4me2/3

PHF13 is a chromatin affiliated protein with a functional role in differentiation, cell division, DNA damage response and higher chromatin order. To gain insight into PHF13's ability to modulate these processes, we elucidate the mechanisms targeting PHF13 to chromatin, its genome wide localization and its molecular chromatin context. Size exclusion chromatography, mass spectrometry, X-ray crystallography and ChIP sequencing demonstrate that PHF13 binds chromatin in a multivalent fashion via direct interactions with H3K4me2/3 and DNA, and indirectly via interactions with PRC2 and RNA PolII. Furthermore, PHF13 depletion disrupted the interactions between PRC2, RNA PolII S5P, H3K4me3 and H3K27me3 and resulted in the up and down regulation of genes functionally enriched in transcriptional regulation, DNA binding, cell cycle, differentiation and chromatin organization. Together our findings argue that PHF13 is an H3K4me2/3 molecular reader and transcriptional co-regulator, affording it the ability to impact different chromatin processes. DOI: http://dx.doi. org/10.7554/eLife.10607. 001
Improved Y2O3-ZrO2 waveguide fiber optic sensor for measuring gas-flow temperature above 2000 degrees Celsius

Although Y2O3-ZrO2 fiber-optic sensor has been developed for contact measurement of temperature higher than 2000 degree(s)C, its performance is not as good as that of sapphire fiber-optic sensor below 1900 degree(s)C due to the large optical loss of the Y2O3-ZrO2 fiber. In order to improve the Y2O3-ZrO2 fiber-optic sensor for ultra-high-temperature applications, in this work, based on a newly developed rectangular Y2O3-ZrO2 single-crystal waveguide with much lower optical loss, an improved Y2O3-ZrO2 waveguide-fiber-optic sensor has been developed. The sensor has been tested up to near 2300 degree(s)C, we estimate that, the improved sensor has similar performance as the sapphire fiber-optic sensor in accuracy and resolution, except the disadvantage of relatively short waveguide. In addition, in this work, instead of the previous volatile and toxic BeO-coated probe, we use a multi-ions-doped sensor head, which is much stable and safe.
ON A PROBLEM OF GRAPH THEORY

Let G " be a non-directed graph having n vertices, without parallel edges and slings. Let the vertices of Gn be denoted by F 1 ,. , Pn. Let v(P j) denote the valency of the point P i and put (0. 1) V(G,) = max v(Pj). 1ninn Let E(G.) denote the number of edges of Gn. Let H d (n, k) denote the set of all graphs Gn for which V (G n) = k and the diameter D (Gn) of which is-d, In the present paper we shall investigate the quantity (0 .2) Thus we want to determine the minimal number N such that there exists a graph having n vertices, N edges and diameter-d and the maximum of the valencies of the vertices of the graph is equal to k. To help the understanding of the problem let us consider the following interpretation. Let be given in a country n airports ; suppose we want to plan a network of direct flights between these airports so that the maximal number of airports to which a given airport can be connected by a direct flight should be equal to k (i .e. the maximum of the capacities of the airports is prescribed), further it should be possible to fly from every airport to any other by changing the plane at most d-1 times ; what is the minimal number of flights by which such a plan can be realized? For instance, if n = 7, k = 3, d= 2 we have F2 (7, 3) = 9 and the extremal graph is shown by Fig. 1. The problem of determining Fd (n, k) has been proposed and discussed recently by two of the authors (see [1]). In § 1 we give a short summary of the results of the paper [1], while in § 2 and 3 we give some new results which go beyond those of [1]. Incidentally we solve a long-standing problem about the maximal number of edges of a graph not containing a cycle of length 4. In § 4 we mention some unsolved problems. Let us mention that our problem can be formulated also in terms of 0-1 matrices as follows : Let M=(a il) be a symmetrical n by n zero-one matrix such 2
Challenges on Adopting Scrum for Distributed Teams in Home Office Environments

— This paper describes the two actual tendencies in the software development process usage: ‘Scrum’ and ‘work in home office’. It’s exposed the four main challenges to adopt Scrum framework for distributed teams in this cited kind of work. The challenges are mainly based on the communication problems due distances since the Scrum encourages the team to work together in the same room, and this is not possible when people work distributed in their homes.