Miracle-dz/UniFAR-FTUs huggingface dataset:
Seasonal Variability in Airborne Biotic Contaminants in Swine Confinement Buildings

Little is known about the seasonal dynamics of biotic contaminants in swine confinement buildings (SCBs). The biotic contaminants of seven SCBs were monitored during one visit in the winter and one during the summer. Paired-end Illumina sequencing of the 16S rRNA gene, V3 region, was used to examine seasonal shifts in bacterial community composition and diversity. The abundances of 16S rRNA genes and six tetracycline resistance genes (tetB, tetH, tetZ, tetO, tetQ, and tetW) were also quantified using real-time PCR. Bacterial abundances, community composition and diversity all showed strong seasonal patterns defined by winter peaks in abundance and diversity. Microclimatic variables of SCBs, particularly air speed, PM2.5 and total suspended particles (TSP) were found significantly correlated to abundances, community composition, and diversity of bacterial bioaerosols. Seasonal fluctuations were also observed for four tetracycline resistance genes, tetH, tetO, tetQ, and tetW. The frequency of occurrences of these resistance genes were significantly higher in samples collected during winter and was also significantly correlated with air speed, PM2.5 and TSP. Overall, our results indicate that biotic contaminants in SCBs exhibit seasonal trends, and these could be associated with the microclimatic variables of SCBs. The correlations established in the current study could be helpful in establishing better management strategies to minimize the potential health impacts on both livestock and humans working in this environment.
The Emotional Consequences of False Positive Mammography: African-American Women's Reactions in Their Own Words

ABSTRACT High false positive rates associated with screening for breast cancer in the United States have an unintended psychological consequence for women (Lerman et al., 1991) that has raised concerns in recent years (Sox, 1998). This study uses inductive qualitative analysis of open-ended interviews with 45 African American women living in New York City who were part of a larger study of women and their experiences after receiving an abnormal mammogram. Themes resulting from the analyses included: inadequate provider-patient communication, anxieties exacerbated by waiting and wondering, and fears of iatrogenic effects of follow-up tests such as biopsies and repeat mammograms. While more research is needed on message-framing strategies for women entering mammographic testing and follow-up, modest changes in service de livery such as improved medical communication can help to alleviate fears and enhance trust.
Characterization of interfacial layers and surface roughness using spectroscopic reflectance, spectroscopic ellipsometry, and atomic force microscopy

In modeling the optical properties of thin films, incorporation of roughness or interfacial layers is often required in the analysis of spectroscopic ellipsometric and spectroscopic reflectance data in order to achieve good agreement between the model and experimental data. The location of the roughness or interfacial layer is usually discernable from the spectroscopic ellipsometric data; however, their location is not always unambiguous from spectroscopic reflectance data. In the current work, we have explored how the spectroscopic determination of the interfacial and surface roughness layers correlates with direct measurements of the surface using atomic force microscopy (AFM). Spectroscopic reflectance and subsequent analysis of several thick films demonstrate the difficulty in placement of a roughness or interfacial layer in the optical model. The samples involved in this study have films deposited on metal substrates and include stainless steel and aluminum. We have used AFM to directly measure the surface roughness in order to improve the optical characterization and model development. As an example, we have examined an 8,000 nm silicon dioxide film on stainless steel. Models with the placement of an interfacial layer between the substrate and film, or placement of a roughness layer at the surface produce fits with nearly equivalent mean squared error values; however, the surface roughness layer is nearly an order of magnitude larger than that of the interfacial layer. Analysis using AFM shows a surface topography consistent with the magnitude of the interfacial roughness layer. In this example, the silicon dioxide layer was too thick for standard spectroscopic ellipsometry and spectroscopic reflectance was used exclusively in the analysis. For several samples with silicon dioxide on an aluminum substrate, an interfacial layer was necessary to produce a good model fit with the experimental data. These films of 500-1,000 nm thickness were analyzed using both spectroscopic ellipsometry and spectroscopic reflectance. The analysis for all films shows good agreement between the interfacial roughnesses calculated using an effective medium approximation (EMA) with AFM measurements, indicating the transfer or correlation of the substrate roughness to the surface.
Reversible addition circuit using one ancillary bit with application to quantum computing

Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with only the Toffoli gate. Draper [D00] has proposed an inherently "quantum" network for addition based on the quantum Fourier transform. His approach has the advantage that it requires no carry qubits (the previous approaches required O(n) carry qubits). The network in [D00] uses quantum rotation gates, which must either be implemented with exponential precision, or else be approximated. In this paper I give a network of O(n^3) Toffoli gates for reversibly performing in-place addition with only a single ancillary bit, demonstrating that inherently quantum techniques are not required to achieve this goal (provided we are willing to sacrifice quadratic circuit depth). After posting the original version of this note it was pointed out to me by C. Zalka that essentially the same technique for addition was used in [BCD+96]. The scenario in that paper was different, but it is clear how the technique they described generalizes to that in this paper.
Transient and steady-state regime of a family of list-based cache replacement algorithms

We study the performance of a family of cache replacement algorithms. The cache is decomposed into lists. Some of these lists can be virtual in the sense that only meta-data are stored in those lists. An item enters the cache via the first list and jumps to the next list whenever a hit on it occurs. The classical policies FIFO, RANDOM, CLIMB, and its hybrids are obtained as special cases. We present explicit expressions for the cache content distribution and miss probability under the IRM model. We develop an algorithm with a time complexity that is polynomial in the cache size and linear in the number of items to compute the exact miss probability. We introduce lower and upper bounds on the latter that can be computed in a time that is linear in the cache size times the number of items. We introduce a mean-field model to approximate the transient behavior of the miss probability and prove that this model becomes exact as the cache size and number of items go to infinity. We show that the set of ODEs associated to the mean-field model has a unique fixed point that can be used to approximate the miss probability in case the exact computation is too time consuming. Using this approximation, we provide guidelines on how to select a replacement algorithm within the family considered such that a good trade-off is achieved between the cache reactivity and its steady-state hit probability. We simulate these cache replacement algorithms on traces of real data and show that they can outperform LRU. Finally, we also disprove the well-known conjecture that the CLIMB algorithm is the optimal finite-memory replacement algorithm under the IRM model.
Tabu Search-based Heuristic Resource Allocation Algorithm for Database Web Services in a Enterprise Organization

A major issue in the resource allocation problem, also known as the data and service allocation problem, in a networked organization is the key problem in Web services distribution. A detailed investigation is carried out of the resource allocation model of allocating data and application services across a distributed networking system. The data and application service allocation problem is modeled as an integer programming formulation, and the properties of the objective function are investigated in detail. A tabu search based algorithmic solution is presented for the resource allocation problem. A sample problem is carried on here to illustrate the modeling approach. This study would benefit organizations by providing them with a powerful integrated modeling tool which could be used for overall user domain creation and data and service allocation, and perform network analysis and detect performance bottlenecks and help in the implementation of a Web services system.
Hop Testing Provides a Reliable and Valid Outcome Measure During Rehabilitation After Anterior Cruciate Ligament Reconstruction

Background and Purpose Although various hop tests have been proposed as performance-based outcome measures following anterior cruciate ligament (ACL) reconstruction, limited reports of their measurement properties exist. The purpose of this study was to investigate the reliability and longitudinal validity of data obtained from hop tests during rehabilitation after ACL reconstruction. Subjects Forty-two patients, 15 to 45 years of age, who had undergone ACL reconstruction participated in the study. Methods and Measures The study design was prospective and observational with repeated measures. The subjects performed a series of 4 hop tests on 3 separate occasions within the 16th week following surgery and on a fourth occasion 6 weeks later. The tests were a single hop for distance, a 6-m timed hop, a triple hop for distance, and crossover hops for distance. Performance on the ACL-reconstructed limb was expressed as a percentage of the performance on the nonoperative limb, termed the “limb symmetry index. ” Subjects also completed the Lower Extremity Functional Scale and a global rating of change questionnaire. Results Intraclass correlation coefficients for limb symmetry index values ranged from . 82 to . 93. Standard errors of measurement were 3.04% to 5.59%. Minimal detectable changes, at the 90% confidence level, were 7.05% to 12.96%. Changes in hop test scores on the operative limb were statistically greater than changes on the nonoperative limb. Pearson correlations (r) between change in hop performances and self-reported measures ranged from . 26 to . 58. Discussion and Conclusion The results show that the described series of hop tests provide a reliable and valid performance-based outcome measure for patients undergoing rehabilitation following ACL reconstruction. These findings support the use and facilitate the interpretation of hop tests for research and clinical practice.
Differential Effect of Left vs. Right White Matter Hyperintensity Burden on Functional Decline: The Northern Manhattan Study

Asymmetry of brain dysfunction may disrupt brain network efficiency. We hypothesized that greater left-right white matter hyperintensity volume (WMHV) asymmetry was associated with functional trajectories. Methods: In the Northern Manhattan Study, participants underwent brain MRI with axial T1, T2, and fluid attenuated inversion recovery sequences, with baseline interview and examination. Volumetric WMHV distribution across 14 brain regions was determined separately by combining bimodal image intensity distribution and atlas based methods. Participants had annual functional assessments with the Barthel index (BI, range 0–100) over a mean of 7.3 years. Generalized estimating equations (GEE) models estimated associations of regional WMHV and regional left-right asymmetry with baseline BI and change over time, adjusted for baseline medical risk factors, sociodemographics, and cognition, and stroke and myocardial infarction during follow-up. Results: Among 1,195 participants, greater WMHV asymmetry in the parietal lobes (−8.46 BI points per unit greater WMHV on the right compared to left, 95% CI −3.07, −13.86) and temporal lobes (−2.48 BI points, 95% CI −1.04, −3.93) was associated with lower overall function. Greater WMHV asymmetry in the parietal lobes (−1.09 additional BI points per year per unit greater WMHV on the left compared to right, 95% CI −1.89, −0.28) was independently associated with accelerated functional decline. Conclusions: In this large population-based study with long-term repeated measures of function, greater regional WMHV asymmetry was associated with lower function and functional decline. In addition to global WMHV, WHMV asymmetry may be an important predictor of long-term functional status.
Active Galactic Nuclei with Candidate Intermediate-Mass Black Holes

We present an initial sample of 19 intermediate-mass black hole candidates in active galactic nuclei culled from the first data release of the Sloan Digital Sky Survey. Using the line width-luminosity mass scaling relation established for broad-line active nuclei, we estimate black hole masses in the range of MBH ≈ 8 × M☉, a regime in which only two objects are currently known. The absolute magnitudes are faint for active galactic nuclei, ranging from Mg ≈ -15 to -18 mag, while the bolometric luminosities are all close to the Eddington limit. The entire sample formally satisfies the line width criterion for so-called narrow-line Seyfert 1 galaxies; however, they display a wider range of Fe II and [O III] λ5007 line strengths than is typically observed in this class of objects. Although the available imaging data are of insufficient quality to ascertain the detailed morphologies of the host galaxies, it is likely that the majority of the hosts are relatively late-type systems. The host galaxies have estimated g-band luminosities ~1 mag fainter than M* for the general galaxy population at z ≈ 0.1. Beyond simply extending the known mass range of central black holes in galactic nuclei, these objects provide unique observational constraints on the progenitors of supermassive black holes. They are also expected to contribute significantly to the integrated signal for future gravitational wave experiments.
Segmentation and classification for mixed text/image documents using neural network

A segmentation and classification method for separating a document image into printed character, handwritten character, photograph, and painted image regions is presented. A document image is segmented into rectangular areas. Each of which contains a cluster of image elements. A layered feed-forward neural network is then used to classify each segmented area using the histograms of gradient vector directions and luminance levels. A high classification performance was obtained, even with a small number of training samples. It is confirmed that the histograms of gradient vector directions and luminance levels are significantly effective features for the classification of the four kinds of image regions. Increasing the number of the discrimination areas improves the classification performance sufficiently even using a small number of training samples for the neural network. <<ETX>>
Temporal Data Visualization Technique Based on Treemap

Many information visualization techniques and tools have been created to analyze and understand temporal data. However, it is noticeable that time dimension is underused in most techniques and tools, used only as an aid in the search for patterns and answers. Therefore, this paper proposes an adaptation of the treemap joined with the calendar metaphor, using time as main attribute to hierarchy configuration and drill down navigation. Time granularity is flexible on granularity levels, and a grouping configuration of one level is used to display the calendar visual representation of that same granularity level. Furthermore, user interaction breadcrumbs are applied in order to provide better linear analysis of temporal characteristics of data without losing data overview. It is also possible to compare multiple different views of various time subsets.
National Population Information System Based on Web Services

To address the issue of isolated information island in national population information system, we present a kind of multi-layers hierarchical service-oriented architecture. In the architecture, the top nodes are only the requestors of Web services, and all the leaf nodes of the bottom layer are only the providers of Web services. For those nodes of intermediate layers, every node is not only the provider of web services, but also the dispatcher of Web services. All isolated information islands are connected by Web services dispatcher and web services registry database to form a uniform collaborative system. The command (Web service invocation) is recursively multicasted from top layer to bottom layer and statistical result data are gathered from bottom layer to top layer. We implement service integration, information integration and information sharing of national population information system.
Quantum Neural Network based Parts of Speech Tagger for Hindi

The parts of speech disambiguation in corpora is most challenging area in Natural Language Processing. However, some works have been done in the past to overcome the problem of bilingual corpora disambiguation forHindi using Hidden Markov Model and Neural Network. In this paper, Quantum Neural Network (QNN) forHindi parts of speech tagger has been used.To analyze the effectiveness of the proposed approach, 2600 sentences of news items having 11500 words from various newspapers have been evaluated. During simulations and evaluation, the accuracy upto 99.13% is achieved, which is significantly better in comparison with other existing approaches for Hindi parts of speech tagging.
Strain hypothesis of Toxoplasma gondii infection on the outcome of human diseases

The intracellular protozoan Toxoplasma gondii is an exceptionally successful food and waterborne parasite that infects approximately 1 billion people worldwide. Genotyping of T. gondii isolates from all continents revealed a complex population structure. Recent research supports the notion that T. gondii genotype may be associated with disease severity. Here, we (1) discuss molecular and serological approaches for designation of T. gondii strain type, (2) overview the literatures on the association of T. gondii strain type and the outcome of human disease and (3) explore possible mechanisms underlying these strain‐specific pathology and severity of human toxoplasmosis. Although no final conclusions can be drawn, it is clear that virulent strains (e.g. strains containing type I or atypical alleles) are significantly more often associated with increased frequency and severity of human toxoplasmosis. The significance of highly virulent strains can cause severe diseases in immunocompetent patients and might implicated in brain disorders such as schizophrenia should led to reconsideration of toxoplasmosis. Further studies that combine parasite strain typing and human factor analysis (e.g. immune status and genetic background) are required for better understanding of human susceptibility or resistance to toxoplasmosis.
Algorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method

We propose a method for preconditioner construction and parallel implementations of the Preconditioned Conjugate Gradient algorithm on GPU platforms. The preconditioning matrix is an approximate inverse derived from an algorithm for the iterative improvement of a solution to linear equations. Using a sparse matrix-vector product, our preconditioner is well suited for massively parallel GPU architecture. We present numerical experiments and comparisons with CPU implementations.
Exploring Lexicalized Features for Coreference Resolution

In this paper, we describe a coreference solver based on the extensive use of lexical features and features extracted from dependency graphs of the sentences. The solver uses Soon et al. (2001)'s classical resolution algorithm based on a pairwise classification of the mentions. We applied this solver to the closed track of the CoNLL 2011 shared task (Pradhan et al., 2011). We carried out a systematic optimization of the feature set using cross-validation that led us to retain 24 features. Using this set, we reached a MUC score of 58.61 on the test set of the shared task. We analyzed the impact of the features on the development set and we show the importance of lexicalization as well as of properties related to dependency links in coreference resolution.
Contextifier: automatic generation of annotated stock visualizations

Online news tools - for aggregation, summarization and automatic generation - are an area of fruitful development as reading news online becomes increasingly commonplace. While textual tools have dominated these developments, annotated information visualizations are a promising way to complement articles based on their ability to add context. But the manual effort required for professional designers to create thoughtful annotations for contextualizing news visualizations is difficult to scale. We describe the design of Contextifier, a novel system that automatically produces custom, annotated visualizations of stock behavior given a news article about a company. Contextifier's algorithms for choosing annotations is informed by a study of professionally created visualizations and takes into account visual salience, contextual relevance, and a detection of key events in the company's history. In evaluating our system we find that Contextifier better balances graphical salience and relevance than the baseline.
Towards reducing the attack surface of software backdoors

Backdoors in software systems probably exist since the very first access control mechanisms were implemented and they are a well-known security problem. Despite a wave of public discoveries of such backdoors over the last few years, this threat has only rarely been tackled so far. In this paper, we present an approach to reduce the attack surface for this kind of attacks and we strive for an automated identification and elimination of backdoors in binary applications. We limit our focus on the examination of server applications within a client-server model. At the core, we apply variations of the delta debugging technique and introduce several novel heuristics for the identification of those regions in binary application that backdoors are typically installed in (i.e., authentication and command processing functions). We demonstrate the practical feasibility of our approach on several real-world backdoors found in modified versions of the popular software tools ProFTPD and OpenSSH. Furthermore, we evaluate our implementation not only on common instruction set architectures such as x86-64, but also on commercial off-the-shelf embedded devices powered by a MIPS32 processor.