Miracle-dz/UniFAR-FTUs huggingface dataset:
5′HS5 of the Human β-globin Locus Control Region Is Dispensable for the Formation of the β-globin Active Chromatin Hub

Hypersensitive site 5 (5′HS5) of the β-globin Locus Control Region functions as a developmental stage-specific border in erythroid cells. Here, we have analyzed the role of 5′HS5 in the three dimensional organization of the β-gene locus using the Chromatin Conformation Capture (3C) technique. The results show that when 5′HS5 is deleted from the locus, both remote and internal regulatory elements are still able to interact with each other in a three-dimensional configuration termed the Active Chromatin Hub. Thus, the absence of 5′HS5 does not have an appreciable effect on the three dimensional organization of the β-globin locus. This rules out models in which 5′HS5 nucleates interactions with remote and/or internal regulatory elements. We also determined the binding of CTCF, the only defined insulator protein in mammalian cells, to 5′HS5 by using chromatin immunoprecipitation (ChIP) assays. We detect low levels of CTCF binding to 5′HS5 in primitive erythroid cells, in which it functions as a border element. Surprisingly, we also observe binding levels of CTCF to 5′HS5 in definitive erythroid cells. Thus, binding of CTCF to 5′HS5 per se does not render it a functional border element. This is consistent with the previous data suggesting that CTCF has dual functionality.
Lower bounds for orthogonal range searching: part II. The arithmetic model

Lower bounds on the complexity of orthogonal range searching in thestatic case are established. Specifically, we consider the followingdominance search problem: Given a collection of<? Pub Fmt italic>n<? Pub Fmt /italic> weighted points in<? Pub Fmt italic>d<? Pub Fmt /italic>-space and a query point<? Pub Fmt italic>q<? Pub Fmt /italic>, compute the cumulative weight ofthe points dominated (in all coordinates) by<? Pub Fmt italic>q<? Pub Fmt /italic>. It is assumed that the weights arechosen in a commutative semigroup and that the query time measures onlythe number of arithmetic operations needed to compute the answer. It isproved that if <? Pub Fmt italic>m<? Pub Fmt /italic> units of storage areavailable, then the query time is at least proportional to (log<? Pub Fmt italic>n<? Pub Fmt /italic>/log(2<? Pub Fmt italic>m<? Pub Fmt /italic>/<? Pub Fmt italic>n<? Pub Fmt /italic>))<supscrpt><? Pub Fmt italic>d<? Pub Fmt /italic>–<? Pub Caret1>1</supscrpt>in both the worst and average cases. This lower bound is provably tightfor <? Pub Fmt italic>m<? Pub Fmt /italic> =&OHgr;(<? Pub Fmt italic>n<? Pub Fmt /italic>(log<? Pub Fmt italic>n<? Pub Fmt /italic>)<supscrpt><? Pub Fmt italic>d<? Pub Fmt /italic>–1+ε)</supscrpt> and any fixed ε> 0. A lower bound of &OHgr;(<? Pub Fmt italic>n<? Pub Fmt /italic>/loglog<? Pub Fmt italic>n<? Pub Fmt /italic>)<supscrpt><? Pub Fmt italic>d<? Pub Fmt /italic></supscrpt>)on the time required for executing <? Pub Fmt italic>n<? Pub Fmt /italic>inserts and queries is also established. <abstrbyl><italic>—Author's Abstract</italic>
Splitting of Expanded

The article addresses a regular splitting of tridiagonal matrices. The given tridiagonal matrix A is rst expanded to an equivalent matrix e A and then split as e A = B ? R for which B is block-diagonal and every eigenvalue of B ? 1 R is zero, i.e., (M ? 1 N) = 0. The optimal splitting technique is applicable to various algorithms that incorporate one-dimensional solves or their approximations. Examples can be found in the parallelization of alternating direction iterative (ADI) methods and eecient parameter choices for domain decomposition (DD) methods for elliptic and parabolic problems. Numerical results solving the Helmholtz wave equation in two dimensions are presented to demonstrate usefulness and eeciency of the splitting technique.
π: a pattern language

Current programming languages and techniques realize many features which allow their users to extend these languages on a semantic basis: classes, functions, interfaces, aspects and other entities can be defined. However, there is a lack of modern programming languages which are both semantically and syntactically extensible from within the language itself, i.e., with no additional tool or meta-language. In this paper we present π as an approach that aims to overcome this lack. π provides an abstraction mechanism based on parameterized symbols which is capable of semantically and syntactically unifying programming concepts like variables, control-structures, procedures and functions into one concept: the pattern. We have evaluated the abstraction potential and the syntactic extensibility of π by successfully creating patterns for the aforementioned programming concepts. π could serve as a tool for designing new experimental languages and might generally influence the view we have on current programming concepts.
‘A good girl is worth their weight in gold’: Gender relations in British horseracing

The culture of horseracing is rather under researched by social scientists. It may seem a highly progressive site for gender equality in sport because, unusually, men and women compete directly against each other as owners, trainers and jockeys. But gender inequalities are deeply rooted and persistent in British racing. Our interview-based study suggests that ingrained patterns of sexism, chauvinism and paternalism reproduce patriarchal assumptions among both males and females in racing which act as key barriers, especially for ambitious female jockeys. Conventional ideas about women’s embodiment and their intuitively caring and ‘loving’ nature towards horses may open up prospects for females as junior stable staff, but they also dialectically reduce opportunities elsewhere. Obstacles to advancement on merit mean that family connections and influential networks shape female prospects in racing rather more than is the case for men. New equality strategies pursued from within British racing are welcome, but they are unlikely to challenge existing structures and ideologies or challenge core gender inequalities.
Comparing machine learning classifiers for diagnosing glaucoma from standard automated perimetry.

PURPOSE To determine which machine learning classifier learns best to interpret standard automated perimetry (SAP) and to compare the best of the machine classifiers with the global indices of STATPAC 2 and with experts in glaucoma. METHODS Multilayer perceptrons (MLP), support vector machines (SVM), mixture of Gaussian (MoG), and mixture of generalized Gaussian (MGG) classifiers were trained and tested by cross validation on the numerical plot of absolute sensitivity plus age of 189 normal eyes and 156 glaucomatous eyes, designated as such by the appearance of the optic nerve. The authors compared performance of these classifiers with the global indices of STATPAC, using the area under the ROC curve. Two human experts were judged against the machine classifiers and the global indices by plotting their sensitivity-specificity pairs. RESULTS MoG had the greatest area under the ROC curve of the machine classifiers. Pattern SD (PSD) and corrected PSD (CPSD) had the largest areas under the curve of the global indices. MoG had significantly greater ROC area than PSD and CPSD. Human experts were not better at classifying visual fields than the machine classifiers or the global indices. CONCLUSIONS MoG, using the entire visual field and age for input, interpreted SAP better than the global indices of STATPAC. Machine classifiers may augment the global indices of STATPAC.
Towards interactive bump mapping with anisotropic shift-variant BRDFs

In this paper a technique is presented that combines interactive hardware accelerated bump mapping with shift-variant anisotropic reflectance models. An evolutionary path is shown how some simpler reflectance models can be rendered at interactive rates on current low-end graphics hardware, and how features from future graphics hardware can be exploited for more complex models. We show how our method can be applied to some well known reflectance models, namely the Banks model, Ward's model, and an anisotropic version of the Blinn-Phong model, but it is not limited to these models. Furthermore, we take a close look at the necessary capabilities of the graphics hardware, identifiy problems with current hardware, and discuss possible enhancements.
Clustered Data Parallelism

Many data layout optimizations cluster data accesses and memory into high-locality groups in order to optimize for the memory hierarchy. In this paper, we demonstrate that similar clustering program transformations enable efficient vectorization. We call this approach clustered data parallelism (CDP). CDP enables fast and power-efficient parallelism by partitioning a data structure into clusters such that SIMD evaluation is efficient within a cluster. We describe the CDP latent in three common computational patterns: map, reduce, and graph traversals. Demonstrating the benefits of CDP, we present case studies of instantiating the CDP patterns in order to design fast and power-efficient binary search and webpage layout algorithms. First, we increase binary search SIMD scalability by using CDP to expose speculative parallelism. Second, we achieve the first SIMD webpage layout algorithm by using CDP to eliminate heavy branching. We report strong performance improvements. Targeting AVX, we see a 5.5X speedup and 6.9X performance/Watt increase over FAST, the previously fastest SIMD binary search algorithm. Running webpage layout with SSE4.2 instructions, we observe a 3.5X speedup and 3.6X performance/Watt increase over an already optimized baseline. [Copyright notice will appear here once ’preprint’ option is removed. ] Clustered data parallelism 1 2012/2/1
Co-training and visualizing sentiment evolvement for tweet events

Sentiment classification on tweet events attracts more interest in recent years. The large tweet stream stops people reading the whole classified list to understand the insights. We employ the co-training framework in the proposed algorithm. Features are split into text view features and non-text view features. Two Random Forest (RF) classifiers are trained with the common labeled data on the two views of features separately. Then for each specific event, they collaboratively and periodically train together to boost the classification performance. At last, we propose a "river" graph to visualize the intensity and evolvement of sentiment on an event, which demonstrates the intensity by both color gradient and opinion labels, and the ups and downs of confronting opinions by the river flow. Comparing with the well-known sentiment classifiers, our algorithm achieves consistent increases in accuracy on the tweet events from TREC 2011 Microblogging and our database. The visualization helps people recognize turning and bursting patterns, and predict sentiment trend in an intuitive way.
Analysis of Mammalian Cell Proliferation and Macromolecule Synthesis Using Deuterated Water and Gas Chromatography-Mass Spectrometry

Deuterated water (2H2O), a stable isotopic tracer, provides a convenient and reliable way to label multiple cellular biomass components (macromolecules), thus permitting the calculation of their synthesis rates. Here, we have combined 2H2O labelling, GC-MS analysis and a novel cell fractionation method to extract multiple biomass components (DNA, protein and lipids) from the one biological sample, thus permitting the simultaneous measurement of DNA (cell proliferation), protein and lipid synthesis rates. We have used this approach to characterize the turnover rates and metabolism of a panel of mammalian cells in vitro (muscle C2C12 and colon cancer cell lines). Our data show that in actively-proliferating cells, biomass synthesis rates are strongly linked to the rate of cell division. Furthermore, in both proliferating and non-proliferating cells, it is the lipid pool that undergoes the most rapid turnover when compared to DNA and protein. Finally, our data in human colon cancer cell lines reveal a marked heterogeneity in the reliance on the de novo lipogenic pathway, with the cells being dependent on both ‘self-made’ and exogenously-derived fatty acid.
LIGHT DETECTION AND RANGING (LLDAR) DATA COMPRESSION

ABSTRACT Light Detection and Ranging (LIDAR) data compression has been an active research field for last few years because of its large storage size. When LIDAR has large number of data points, the surface generation renertion represented by interpolation methods may be inefficient in both storage and computational requirements. This paper presents a newly developed compression scheme for the LIDAR data based on second genertion wavelet. A new interpolation wavelet filter has been opplied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to modify the point values (point coordinates for geometry) aftre the splittong. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the geographical surface representation after using using proposed technique is compared with the original LIDAR data. The results show that this method can be used for used for for significant reduction of data set.
Normalization and parsing algorithms for uncertain input

The automatic analysis (parsing) of natural language is an important ingredient for many natural language processing applications (search-engines, automatic translation, speech-processing, etc.), as it is the first step towards interpretation. For standard texts, like well-edited news articles, current parsers perform very well. However, for user-generated content, such as tweets, parser performance drops dramatically. In this research, we attempt to improve the automatic analysis of spontaneous language by translating it to 'normal' language. For example, the sentence "new pix comming tomorroe" is translated to "new pictures coming tomorrow". In this example sentence, a variety of phenomena occurs: 'pix' is a replacement based on the pronunciation, whereas 'comming' is probably a typo. This translation is also referred to as 'normalization'. Based on the observation that the normalization problem actually consists of multiple sub-problems, we developed a modular normalization model: MoNoise. This normalization model reaches a new state-of-art performance on a variety of languages. Normalizing social media texts leads to a performance increase for syntactic parsers. In the basic setup, we use only the single best normalization candidate for each word, which might lead to error propagation. Hence, we introduce two novel methods to let the parser to take multiple normalization candidates into account per position, leading to further improvements in parser performance.
Topics and passives in Italian-speaking children and adults

ABSTRACT Through two elicited production experiments we investigated how preschool Italian-speaking children access the left periphery of the clause with respect to topics in Clitic Left Dislocation (ClLD) structures. Since the discourse conditions of the experiments are felicitous for the production of passives as well, we also investigated children’s production of different types of passives, and how it compares to adults’. A rich and variegated array of results indicate young children’s early access to the left peripheral topic positions—also in a nonadult manner through use of a-marked topics—and preference for ClLD over passive in contrast to adults; children’s early access to passive in the causative voice also emerged as well as use of ClLD with null generic subject as an alternative to the (copular/venire) passive. Intervention locality/relativized minimality plays a crucial role in interpreting the articulated results within the system developed in Friedmann, Belletti & Rizzi (2009) and much subsequent work.
A new scater search approach for the singe machine total weighted tardiness scheduling problem with sequence-dependent setup times

In this paper, we propose a scatter search based meta-heuristic algorithm to solve the single machine total weighted tardiness problem with sequence-dependent setup times. Both construction heuristics and random strategy based heuristics are adopted to generate the diversified population. A variable neighborhood search based local search method is adopted to improve the trial solutions and the combined solutions. To measure the diversification value between two solutions, we count the number of edges by which the two solutions differ from each other. We also propose a new strategy that the length of the reference set could be adjusted adaptively to balance the computing time and solving ability. Three different combination methods are presented to generate the new trial solutions with the solutions in the subsets. Computational results of the benchmark problems indicate that the proposed method is stable and can find 19 better solutions among the total 120 test problems than the best known solutions. The yielded average relative percentage deviations from the best known solutions and a recent scatter search algorithm were 1.98% and −3.14%.
Characterization of Glucose-6-Phosphate Dehydrogenase Purified From Lamb Kidney Cortex

This paper describes some properties of glucose-6-phosphate dehydrogenase, which is purified from lamb kidney cortex. Glucose-6-phosphate dehydrogenase catalyses the first step in the pentose phosphate pathway. The enzyme oxidizes glucose-6phosphate to 6-phosphogluconate, reducing NADP + to NADPH. Glucose-6-phosphate dehydrogenase has been isolated from a large number of microorganisms, plants and animal tissues. The purification consisted of two steps, 2’, 5’-ADP-Sepharose 4B affinity chromatography and DEAE Sepharose Fast Flow ion exchange chromatography. The molecular weight of the enzyme was found to be 67 kDa by Sephadex G-200 gel filtration chromatography. The activation energy of the reaction catalysed by the enzyme was calculated from the Arrhenius plot as 2.67 kcal/ mole. Optimum pH of the enzyme was determined as pH 7.7.
Design of low power Voltage Controlled Oscillator

This paper presents the design of low power Voltage Controlled Oscillator with differential stages. Circuit uses multiple pass loop architecture having primary and secondary (auxiliary feed forward) loops. In delay cell positive feedback is used with cross coupled regenerative PMOS load, due to that power consumption reduces. For best tuning range multiple delay path is used. Measurement shows that Oscillator has linear frequency voltage characteristics. This oscillator operates at 1.8V supply. After circuit designing, 2.17GHz-4.16GHz tuning rang, 2.57 GHz centre frequency with 3mw power consumption is obtained. Further to reduce power consumption of Voltage Controlled Oscillator, drain bulk connected PMOS load is used that works in sub-threshold region. If Bulk drain is connected it shows more linearity. By using Bulk drain connected transistor; Power Consumption reduces up to 165 μw and frequency is 1.6GHz with tuning range 1.13GHz-2.6GHz.
Sleep Disorders as a Mediator Between Socioeconomic Status and Health Outcomes: A Review of Differents Theories

The variations in socioeconomic status (SES) between different social classes of a population correspond to differences in accessibility to all resources available and able to improve global health. While SES is now known as one of the main determinants for a good health and a good aging, its influence on sleep disorders (SD) is not well understood. SES is a concept, not directly observable but estimated using indicators like income, education, occupational status and area of living. This theoretical review explores some theories linking environment of people with occurrence of SD, with different patterns associated to SES. A model of interaction is proposed to summarize and conceptualizes these interactions and to promote more research on the topic.
Screening Active Compounds from Garcinia Species Native to China Reveals Novel Compounds Targeting the STAT/JAK Signaling Pathway

Natural compounds from medicinal plants are important resources for drug development. In a panel of human tumor cells, we screened a library of the natural products from Garcinia species which have anticancer potential to identify new potential therapeutic leads and discovered that caged xanthones were highly effective at suppressing multiple cancer cell lines. Their anticancer activities mainly depended on apoptosis pathways. For compounds in sensitive cancer line, their mechanisms of mode of action were evaluated. 33-Hydroxyepigambogic acid and 35-hydroxyepigambogic acid exhibited about 1 μM IC50 values against JAK2/JAK3 kinases and less than 1 μM IC50 values against NCI-H1650 cell which autocrined IL-6. Thus these two compounds provided a new antitumor molecular scaffold. Our report describes 33-hydroxyepigambogic acid and 35-hydroxyepigambogic acid that inhibited NCI-H1650 cell growth by suppressing constitutive STAT3 activation via direct inhibition of JAK kinase activity.
MORPHOLOGY AND EXPANSION CHARACTERISTICS OF THE PLANETARY NEBULA M1-79

In this paper we present deep broadand narrowband images (Johnson B, Gunn-red, Hα, Hα+[NII], [NII], [OIII]) and high resolution spectroscopy (Fabry-Pérot interferometer (Hα, Hβ, [NII], [OIII]) and Coudé measurements (Hα, [NII])) for the planetary nebula (PN) M1-79. Systemic and expansion velocities are investigated along with the morphological characteristics of this PN. M1-79 exhibits an elliptical central region surrounded by a bipolar structure (lobes) which is probably much more extended than previously known. Various symmetry axes of the projected shape of this PN are discussed with respect to a three dimensional model. Two axes cannot be explained by projection effects. They give evidences for ejections along different axes during the formation process of this PN. A possible scenario of the evolutionary process of M1-79 is discussed.
Biophysical Characterization of Nucleophosmin Interactions with Human Immunodeficiency Virus Rev and Herpes Simplex Virus US11

Nucleophosmin (NPM1, also known as B23, numatrin or NO38) is a pentameric RNA-binding protein with RNA and protein chaperon functions. NPM1 has increasingly emerged as a potential cellular factor that directly associates with viral proteins; however, the significance of these interactions in each case is still not clear. In this study, we have investigated the physical interaction of NPM1 with both human immunodeficiency virus type 1 (HIV-1) Rev and Herpes Simplex virus type 1 (HSV-1) US11, two functionally homologous proteins. Both viral proteins show, in mechanistically different modes, high affinity for a binding site on the N-terminal oligomerization domain of NPM1. Rev, additionally, exhibits low-affinity for the central histone-binding domain of NPM1. We also showed that the proapoptotic cyclic peptide CIGB-300 specifically binds to NPM1 oligomerization domain and blocks its association with Rev and US11. Moreover, HIV-1 virus production was significantly reduced in the cells treated with CIGB-300. Results of this study suggest that targeting NPM1 may represent a useful approach for antiviral intervention.