Miracle-dz/UniFAR-FTUs huggingface dataset:
Heavy Hitters via Cluster-Preserving Clustering

In the turnstile ℓ<sub>p</sub> heavy hitters problem with parameter ε, one must maintain a high-dimensional vector x ∈ ℝ<sup>n</sup> subject to updates of the form update (i,Δ) causing the change x<sub>i</sub> ← x<sub>i</sub> + Δ, where i ε[n], Δ ∈ ℝ. Upon receiving a query, the goal is to report every "heavy hitter" i ∈ [n] with |x<sub>i</sub>| ≥ ε ∥x∥<sub>p</sub> as part of a list L ⊆ [n] of size O(1/ε<sup>p</sup>), i.e. proportional to the maximum possible number of heavy hitters. For any pε(0,2] the COUNTSKETCH of [CCFC04] solves ℓ<sub>p</sub> heavy hitters using O(ε<sup>-p</sup> lg n) words of space with O(lg n) update time, O(n lg n) query time to output L, and whose output after any query is correct with high probability (whp) 1 - 1/poly(n) [JST11, Section 4.4]. This space bound is optimal even in the strict turnstile model [JST11] in which it is promised that x<sub>i</sub> ≥ 0 for all i ∈ [n] at all points in the stream, but unfortunately the query time is very slow. To remedy this, the work [CM05] proposed the "dyadic trick" for the COUNTMIN sketch for p = 1 in the strict turnstile model, which to maintain whp correctness achieves suboptimal space O(ε<sup>-1</sup>lg<sup>2</sup> n), worse update time O(lg<sup>2</sup> n), but much better query time O(ε<sup>-1</sup>poly(lg n)). An extension to all p ∈ (0,2] appears in [KNPW11, Theorem 1], and can be obtained from [Pag13]. We show that this tradeoff between space and update time versus query time is unnecessary. We provide a new algorithm, EXPANDERSKETCH, which in the most general turnstile model achieves optimal O(ε-plog n) space, O(log n) update time, and fast O(ε-ppoly(log n)) query time, providing correctness whp. In fact, a simpler version of our algorithm for p = 1 in the strict turnstile model answers queries even faster than the "dyadic trick" by roughly a log n factor, dominating it in all regards. Our main innovation is an efficient reduction from the heavy hitters to a clustering problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a much bigger graph, and the goal is to identify every cluster. Since every heavy hitter must be found, correctness requires that every cluster be found. We thus need a "cluster-preserving clustering" algorithm, that partitions the graph into clusters with the promise of not destroying any original cluster. To do this we first apply standard spectral graph partitioning, and then we use some novel combinatorial techniques to modify the cuts obtained so as to make sure that the original clusters are sufficiently preserved. Our cluster-preserving clustering may be of broader interest much beyond heavy hitters.
Thread Specific Features are Helpful for Identifying Subjectivity Orientation of Online Forum Threads

Subjectivity analysis has been actively used in various applications such as opinion mining of customer reviews in online review sites, question-answering in CQA sites, multi-document summarization, etc. However, there has been very little focus on subjectivity analysis in the domain of online forums. Online forums contain huge amounts of user-generated data in the form of discussions between forum members on speciﬁc topics and are a valuable source of information. In this work, we perform subjectivity analysis of online forum threads. We model the task as a binary classiﬁcation of threads in one of the two classes: subjective and non-subjective. Unlike previous works on subjectivity analysis, we use several non-lexical thread-speciﬁc features for identifying subjectivity orientation of threads. We evaluate our methods by comparing them with several state-of-the-art subjectivity analysis techniques. Experimental re-sults on two popular online forums demonstrate that our methods outperform strong baselines in most of the cases.
Improvement of performance of web crawlers for efficient web searching and crawling

The effectiveness of a crawler directly affects the efficiency of the searching quality of the web search engines. As the crawler interacts with billions of hosts or servers over a period of weeks or months, the issues of validity, flexibility and manageability are of major importance. Also crawler could retrieve some other information, which may be of unimportant to the search from the HTML files as it is parsing them to get the new URLs. In this paper, an attempt has been made to improve the performance of the web crawler by analyzing certain features of several algorithms such as best-first, breadth-first, pagerank, shark search and HITS. For this, various performance parameters such as precision, recall, accuracy and F-Score are taken into consideration. Based on the output parameters, an analysis is made for the improvement of web crawler towards web searching.
Robonaut 2 - The first humanoid robot in space

NASA and General Motors have developed the second generation Robonaut, Robonaut 2 or R2, and it is scheduled to arrive on the International Space Station in early 2011 and undergo initial testing by mid-year. This state of the art, dexterous, anthropomorphic robotic torso has significant technical improvements over its predecessor making it a far more valuable tool for astronauts. Upgrades include: increased force sensing, greater range of motion, higher bandwidth, and improved dexterity. R2's integrated mechatronic design results in a more compact and robust distributed control system with a fraction of the wiring of the original Robonaut. Modularity is prevalent throughout the hardware and software along with innovative and layered approaches for sensing and control. The most important aspects of the Robonaut philosophy are clearly present in this latest model's ability to allow comfortable human interaction and in its design to perform significant work using the same hardware and interfaces used by people. The following describes the mechanisms, integrated electronics, control strategies, and user interface that make R2 a promising addition to the Space Station and other environments where humanoid robots can assist people.
Association of Single Nucleotide Polymorphisms in Glycosylation Genes with Risk of Epithelial Ovarian Cancer

Studies suggest that underglycosylation of the cell membrane mucin MUC1 may be associated with epithelial ovarian cancer. We identified 26 genes involved in glycosylation and examined 93 single nucleotide polymorphisms (SNP) with a minor allele frequency of ≥0.05 in relation to incident ovarian cancer. Cases were ascertained at the Mayo Clinic, Rochester, MN (n = 396) or a 48-county region in North Carolina (Duke University; n = 534). Ovarian cancer–free controls (n = 1,037) were frequency matched to the cases on age, race, and residence. Subjects were interviewed to obtain data on risk factors and a sample of blood for DNA and genotyped using the Illumina GoldenGate assay. We excluded subjects and individual SNPs with genotype call rates of <90%. Data were analyzed using logistic regression, with adjustment for age and residence. We fitted dominant, log additive, and recessive genetic models. Among Caucasians, nine SNPs in eight genes were associated with risk at P < 0.05 under at least one genetic model before adjusting for multiple testing. A SNP in GALNT1 (rs17647532) was the only one that remained statistically significant after Bonferroni adjustment for multiple testing but was not statistically significant in Hardy-Weinberg equilibrium among controls. Haplotype analyses revealed a global association of GALNT1 with risk (P = 0.038, under a recessive genetic model), which largely reflected a decreased risk of one haplotype (0.10 frequency; odds ratio, 0.07; P = 0.01) compared with the most common haplotype (0.39 frequency). These results suggest that genetic polymorphisms in the glycoslyation process may be novel risk factors for ovarian cancer. (Cancer Epidemiol Biomarkers Prev 2008;17(2):397–404)
Ni-activated photo-electrochemical formation of por-Si in HF/H2O2/H2O Solution

The kinetic of Ni-assisted chemical etching in the solution HF/H2O2/H2O, morphology and composition of porous Si are investigated. Mechanism of etching corresponds to well known metal-assisted chemical etching process. It is shown that porous silicon formation on p-Si covered with Ni thin film consists of two simultaneous steps: metal-assisted and photo-electrochemical etching. It was shown that the result of Ni-assisted chemical etching of p-Si is black silicon that exhibits high absorptance property. Enhanced light absorption occurs on black silicon results in photo-electrochemical formation of porous silicon. Illumination — assisted holes play main role in photo-electrochemical etching. Etching mechanism has been considered in terms of contact corrosion and band theory.
Establishment of Fruit Bat Cells (Rousettus aegyptiacus) as a Model System for the Investigation of Filoviral Infection

Background The fruit bat species Rousettus aegyptiacus was identified as a potential reservoir for the highly pathogenic filovirus Marburg virus. To establish a basis for a molecular understanding of the biology of filoviruses in the reservoir host, we have adapted a set of molecular tools for investigation of filovirus replication in a recently developed cell line, R06E, derived from the species Rousettus aegyptiacus. Methodology/Principal Findings Upon infection with Ebola or Marburg viruses, R06E cells produced viral titers comparable to VeroE6 cells, as shown by TCID50 analysis. Electron microscopic analysis of infected cells revealed morphological signs of filovirus infection as described for human- and monkey-derived cell lines. Using R06E cells, we detected an unusually high amount of intracellular viral proteins, which correlated with the accumulation of high numbers of filoviral nucleocapsids in the cytoplasm. We established protocols to produce Marburg infectious virus-like particles from R06E cells, which were then used to infect naïve target cells to investigate primary transcription. This was not possible with other cell lines previously tested. Moreover, we established protocols to reliably rescue recombinant Marburg viruses from R06E cells. Conclusion/Significance These data indicated that R06E cells are highly suitable to investigate the biology of filoviruses in cells derived from their presumed reservoir.
Solving the Straggler Problem with Bounded Staleness

Many important applications fall into the broad class of iterative convergent algorithms. Parallel implementations of these algorithms are naturally expressed using the Bulk Synchronous Parallel (BSP) model of computation. However, implementations using BSP are plagued by the straggler problem, where every transient slowdown of any given thread can delay all other threads. This paper presents the Stale Synchronous Parallel (SSP) model as a generalization of BSP that preserves many of its advantages, while avoiding the straggler problem. Algorithms using SSP can execute efficiently, even with significant delays in some threads, addressing the oft-faced straggler problem.
Temporal Factorization

The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together points moving with consistent motions. We are exploring a dual approach to factorization, i.e., obtaining temporal clustering/segmentation by grouping together frames capturing consistent shapes. Temporal cuts are thus detected at non-rigid changes in the shape of the scene/object. In addition it provides a clustering of frames with consistent shape (but not necessarily same motion). For example, in a sequence showing a face which appears serious at some frames, and is smiling in other frames, all the “serious expression” frames will be grouped together and separated from all the “smile” frames which will be classified as a second group, even though the head may meanwhile undergo various random motions.
Dynamic Energy Trading for Energy Harvesting Communication Networks: A Stochastic Energy Trading Game

This paper studies energy-harvesting communication systems in which different energy-harvesting devices (EHDs) can harvest different amounts of energy and transmit different numbers of data packets in different time slots. We introduce a dynamic energy trading framework that allows the EHDs to transfer and trade their harvested energy with each other. The EHDs are divided into two groups: seller EHDs that can harvest more energy than they can use, and buyer EHDs that cannot harvest sufficient energy to support their required communication services. In the proposed framework, the role of each EHD as a seller EHD or a buyer EHD as well as the amount of energy that each EHD can buy or sell to others change over time. Each EHD cannot observe complete information regarding the harvested energy or the number of data packets transmitted by other EHDs. We introduce a simple energy trading scheduling protocol for the EHDs to discover their nearby EHDs and establish energy trading links with each other. We formulate a new game theoretic model called stochastic energy trading game to analyze the dynamic energy trading among EHDs in a stochastic environment. We derive an optimal energy-trading policy for each EHD to sequentially optimize its decisions. We prove that the proposed policy can achieve a stable and optimal sequence of matchings between buyer and seller EHDs. We present numerical results to compare our proposed energy trading policy with an existing transmit packet scheduling approach, under various network settings and conditions.
Novel Oncolytic Adenovirus Selectively Targets Tumor-Associated Polo-Like Kinase 1 and Tumor Cell Viability

Purpose: Polo-like kinase 1 (plk1) is a serine/threonine protein kinase essential for multiple mitotic processes. Previous observations have validated plk1 as a promising therapeutic target. Despite being conceptually attractive, the potency and specificity of current plk1-based therapies remain limited. We sought to develop a novel plk1-targeting strategy by constructing an oncolytic adenovirus to selectively silence plk1 in tumor cells. Experimental Design: Two artificial features were engineered into one wild-type adenovirus type 5 (wt-Adv5) genome to generate a new oncolytic adenovirus (M1). First, M1 contains a 27-bp deletion in E1A region, which confers potent, oncolytic efficacy. Second, M1 is armed with a fragment of antisense plk1 cDNA that substitutes the E3 region encoding 6.7K and gp19K. In this design, tumor-selective replication of M1 would activate the native adenovirus E3 promoters to express the antisense plk1 cDNA preferentially in tumor cells and silence tumor-associated plk1 protein. Results: By virtue of combining oncolysis with plk1 targeting, M1 exhibited potent antitumoral efficacy in vitro and in vivo. Systemic administration of M1 plus cisplatin induced complete tumor regression in 80% of orthotopic hepatic carcinoma model mice that were otherwise resistant to cisplatin and disseminated metastases. Conclusions: Coupling plk1 targeting with oncolysis had shown superior antitumor efficacy. Present findings would benefit the development of novel oncolytic adenoviruses generally applicable to a wide range of molecule-based therapeutics.
Performance of Detecting IgM Antibodies against Enterovirus 71 for Early Diagnosis

Enterovirus 71 (EV71) infection is more likely to induce severe complications and mortality than other enteroviruses. Methods for detection of IgM antibody against EV71 had been established for years, however, the performance of the methods in the very early diagnosis of EV71 infection had not been fully evaluated, which is especially meaningful because of the short incubation period of EV71 infection. In this report, the performance of an IgM anti-EV71 assay was evaluated using acute sera collected from 165 EV71 infected patients, 165 patients infected with other enteroviruses, and more than 2,000 sera from healthy children or children with other infected diseases. The results showed a 90% sensitivity in 20 patients who were in their first illness day, and similar sensitivity remained till 4 days after onset. After then the sensitivity increased to 95% to 100% for more than one month. The specificity of the assay in non-HFMD children is 99.1% (95% CI: 98.6–99.4), similar as the 99.9% specificity in healthy adults. The cross-reaction rate in patients infected with other non-EV71 enteroviruses was 11.4%. In conclusion, the data here presented show that the detection of IgM anti-EV71 by ELISA affords a reliable, convenient, and prompt diagnosis of EV71 infection.
A truncated soluble epidermal growth factor receptor-Fc fusion ligand trap displays anti-tumour activity in vivo

A number of therapeutic strategies including small molecule tyrosine kinase inhibitors and monoclonal antibodies have been developed to target the epidermal growth factor receptor (EGFR) signalling axis for the treatment of cancer. To date, the focus of therapeutic intervention has been the EGFR itself. In the current study, we have assembled and expressed in mammalian cells a soluble, EGFR ligand trap comprising the first 501 amino acids of the mature EGFR sequence fused in-frame with a human IgG Fc domain. The fusion protein, designated sEGFR501.Fc, was secreted as a 220 kDa disulphide-linked homodimer that exhibited high affinity (0.4–8 nM) in competition assays for a number of EGFR ligands including EGF and transforming growth factor-α (TGF-α). sEGFR501.Fc inhibited EGF-stimulated tyrosine phosphorylation of the EGFR of the lung cancer cell lines A549 and H1437, and inhibited and blocked the proliferation of H1437 cells. Administration of sEGFR501.Fc to mice bearing human tumour xenografts derived from A431 (epidermoid carcinoma) and DU145 (androgen-independent prostate cancer) tumour cell lines resulted in modest retardation of tumour growth. These results provide proof-in-principle that using high affinity soluble receptors is a viable method for inhibiting multi-ligand systems, and the impetus to optimize this approach and develop reagents with greater affinity and broader specificity.
Scalable Distributed Stream Processing

Stream processing fits a large class of new applications for which conventional DBMSs fall short. Because many stream-oriented systems are inherently geographically distributed and because distribution offers scalable load management and higher availability, future stream processing systems will operate in a distributed fashion. They will run across the Internet on computers typically owned by multiple cooperating administrative domains. This paper describes the architectural challenges facing the design of large-scale distributed stream processing systems, and discusses novel approaches for addressing load management, high availability, and federated operation issues. We describe two stream processing systems, Aurora* and Medusa, which are being designed to explore complementary solutions to these challenges. This paper discusses the architectural issues facing the design of large-scale distributed stream processing systems. We begin in Section 2 with a brief description of our centralized stream processing system, Aurora [4]. We then discuss two complementary efforts to extend Aurora to a distributed environment: Aurora* and Medusa. Aurora* assumes an environment in which all nodes fall under a single administrative domain. Medusa provides the infrastructure to support federated operation of nodes across administrative boundaries. After describing the architectures of these two systems in Section 3, we consider three design challenges common to both: infrastructures and protocols supporting communication amongst nodes (Section 4), load sharing in response to variable network conditions (Section 5), and high availability in the presence of failures (Section 6). We also discuss high-level policy specifications employed by the two systems in Section 7. For all of these issues, we believe that the push-based nature of stream-based applications not only raises new challenges but also offers the possibility of new domain-specific solutions.
Two-variable logic with counting is decidable

We prove that the satisfiability and the finite satisfiability problems for C/sup 2/ are decidable. C/sup 2/ is first-order logic with only two variables in the presence of arbitrary counting quantifiers 3/sup /spl ges/m/,m/spl ges/1. It considerably extends L/sup 2/ plain first-order with only two variables, which is known to be decidable by a result of Mortimer's. Unlike L/sup 2/, C/sup 2/ does not have the finite model property.
This Work Is Licensed under a Creative Commons Attribution 4.0 International License Detection of the Arcuate Fasciculus in Congenital Amusia Depends on the Tractography Algorithm

of the arcuate fasciculus in congenital amusia depends on the tractography algorithm. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms. The advent of diffusion magnetic resonance imaging (MRI) allows researchers to virtually dissect white matter fiber pathways in the brain in vivo. This, for example, allows us to characterize and quantify how fiber tracts differ across populations in health and disease, and change as a function of training. Based on diffusion MRI, prior literature reports the absence of the arcuate fasciculus (AF) in some control individuals and as well in those with congenital amusia. The complete absence of such a major anatomical tract is surprising given the subtle impairments that characterize amusia. Thus, we hypothesize that failure to detect the AF in this population may relate to the tracking algorithm used, and is not necessarily reflective of their phenotype. Diffusion data in control and amusic individuals were analyzed using three different tracking algorithms: deterministic and probabilistic, the latter either modeling two or one fiber populations. Across the three algorithms, we replicate prior findings of a left greater than right AF volume, but do not find group differences or an interaction. We detect the AF in all individuals using the probabilistic 2-fiber model, however, tracking failed in some control and amusic individuals when deterministic tractography was applied. These findings show that the ability to detect the AF in our sample is dependent on the type of tractography algorithm. This raises the question of whether failure to detect the AF in prior studies may be unrelated to the underlying anatomy or phenotype.