Miracle-dz/UniFAR-FTUs huggingface dataset:
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining

It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with various indexing techniques. However, there are many applications which are characterized by two special conditions, firstly the two datasets to be joined are of radically different sizes, a situation we call an asymmetric join. Secondly, the two datasets are not, and possibly can not be indexed for some reason. In such circumstances the time complexity is proportional to the product of the number of objects in each of the two datasets, an untenable proposition in most cases. In this work we make two contributions to mitigate this situation. We argue that for many applications, an exact solution to the problem is not required, and we show that by framing the problem as an anytime algorithm we can extract most of the benefit of a join in a small fraction of the time taken by the full algorithm. In situations where the exact answer is required, we show that we can quickly index just the smaller dataset on the fly, and greatly speed up the exact computation. We motivate and empirically confirm the utility of our ideas with case studies on problems as diverse as batch classification, anomaly detection and annotation of historical manuscripts.
Stochastic stability for model-based networked control systems

In this paper we study the stochastic stability properties of certain networked control system. Specifically we study the stability of the model-based network control system introduced in [L.A. Montestruque et. al., 41st IEEE Conference on Decision and Control, December 2002. ] under time-varying communication. The model-based network control system uses knowledge of the plant to reduce the number of packet exchanges and thus the network traffic. Stability conditions for constant data packet exchange rates are analysed in [L.A. Montestruque et. al., 41st IEEE Conference on Decision and Control, December 2002, L.A. Montestruque et.al., ISIS Technical Report ISIS-2002-001, January 2001]. Here we concentrate on the stochastic stability of the networked system when the packet exchange times are time varying and have some known statistical properties. Conditions are derived for almost sure and mean square stability for independent, identically distributed update times. Mean square stability is also studied for Markov chain driven update times.
Spatial Reorganization of the Endoplasmic Reticulum during Mitosis Relies on Mitotic Kinase Cyclin A in the Early Drosophila Embryo

Mitotic cyclin-dependent kinase with their cyclin partners (cyclin:Cdks) are the master regulators of cell cycle progression responsible for regulating a host of activities during mitosis. Nuclear mitotic events, including chromosome condensation and segregation have been directly linked to Cdk activity. However, the regulation and timing of cytoplasmic mitotic events by cyclin:Cdks is poorly understood. In order to examine these mitotic cytoplasmic events, we looked at the dramatic changes in the endoplasmic reticulum (ER) during mitosis in the early Drosophila embryo. The dynamic changes of the ER can be arrested in an interphase state by inhibition of either DNA or protein synthesis. Here we show that this block can be alleviated by micro-injection of Cyclin A (CycA) in which defined mitotic ER clusters gathered at the spindle poles. Conversely, micro-injection of Cyclin B (CycB) did not affect spatial reorganization of the ER, suggesting CycA possesses the ability to initiate mitotic ER events in the cytoplasm. Additionally, RNAi-mediated simultaneous inhibition of all 3 mitotic cyclins (A, B and B3) blocked spatial reorganization of the ER. Our results suggest that mitotic ER reorganization events rely on CycA and that control and timing of nuclear and cytoplasmic events during mitosis may be defined by release of CycA from the nucleus as a consequence of breakdown of the nuclear envelope.
Lifted Belief Propagation : Pairwise Marginals and Beyond

Lifted belief propagation (LBP) can be extremely fast at computing approximate marginal probability distributions over single variables and neighboring ones in the underlying graphical model. It does, however, not prescribe a way to compute joint distributions over pairs, triples or k-tuples of distant random variables. In this paper, we present an algorithm, called conditioned LBP, for approximating these distributions. Essentially, we select variables one at a time for conditioning, running lifted belief propagation after each selection. This naive solution, however, recomputes the lifted network in each step from scratch, therefore often canceling the benefits of lifted inference. We show how to avoid this by efficiently computing the lifted network for each conditioning directly from the one already known for the single node marginals. Our experimental results validate that significant efficiency gains are possible and illustrate the potential for second-order parameter estimation of Markov logic networks.
On tracking freeriders in gossip protocols

Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. However, these rely on an asymmetric component, namely opportunistic pushes, that let peers receive content without sending anything in return. Opportunistic push constitutes the Achilles' heel of TfT-based protocols as illustrated by the fact that all known attacks against them exploit it. This problem becomes even more serious when used by colluding freeriders. In this paper, we discuss the possibility of using accountability to secure gossip-based dissemination protocols based on asymmetric exchanges. The fact that gossip protocols are dynamic and randomized makes our approach robust against collusion and alleviates the need for cryptography. We present the challenges raised by an auditing approach and give insights into how to build a freerider-tracking protocol for gossip-based content dissemination.
Study on Fretting Wear Behavior of 40CrNiMoA Steel

This study deals with fretting wear behavior of 40CrNiMoA steel on a SRVⅣoscillating friction and wear tester. The results indicate that with the frequency and load increasing, both the friction coefficient and fretting wear volume increase. With the amplitude increasing, the fretting wear volume increased too, but the effect of amplitude on friction coefficient was not simple positive correlation according to the experimental results. Meanwhile, the fretting wear mechanism is directly related to test frequency, load and amplitude. When they are small, the main fretting wear mechanism is abrasive wear, with these test parameters increasing, the main fretting wear mechanism turns to a combination of abrasive wear and adhesion wear. Based on the experimental results, the anti-fretting wear measures of steel worm gear pairs used in mechanical tracked regulator of tracked vehicle are discussed.
Residual Bearing Capacity of Reinforced Concrete Member after Exposure to High Temperature

After boundary conditions of member and thermal parameters of materials are determined, ANSYS software is utilized to analyze the maximum temperature distribution in the member under different fire duration. The equivalent cross-section economization method is given to calculate residual bearing capacity of RC member after exposure to high temperature, here, strength of reinforcement is considered as invariant, and the original section area is regarded as reduced. The numerical results are in good agreement with the experiment results of other reference, so appliance of the method is proved, Based on these, some parameters have significant influences on reduced coefficient of residual bearing capacity, such as sectional dimension, fire duration time, strength of reinforcement and concrete，ratio of reinforcement，thickness of fire-protection layer, which are analyzed and theory basis is supplied on safe monitor, repair and reinforcement of RC member after exposure to high temperature.
Comparison of node-centered and cell-centered unstructured ﬁnite-volume discretizations: inviscid ﬂuxes

Cell-centered and node-centered approaches have been compared for unstructuredﬁnite-volume discretization of inviscid ﬂuxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes – two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of ﬁve of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to ﬁrst order. The NC schemes converge with second order on regular and/or triangular grids and with ﬁrst order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and second-order discretization errors. body errors CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.
Maps: a compiler-managed memory system for Raw machines

This paper describes Maps, a compiler managed memory system for Raw architectures. Traditional processors for sequential programs maintain the abstraction of a unified memory by using a single centralized memory system. This implementation leads to the infamous "Von Neumann bottleneck," with machine performance limited by the large memory latency and limited memory bandwidth. A Raw architecture addresses this problem by taking advantage of the rapidly increasing transistor budget to move much of its memory on chip. To remove the bottleneck and complexity associated with centralized memory, Raw distributes the memory with its processing elements. Unified memory semantics are implemented jointly by the hardware and the compiler. The hardware provides a clean compiler interface to its two inter-tile interconnects: a fast, statically schedulable network and a traditional dynamic network. Maps then uses these communication mechanisms to orchestrate the memory accesses for low latency and parallelism while enforcing proper dependence. It optimizes for speed in two ways: by finding accesses that can be scheduled on the static interconnect through static promotion, and by minimizing dependence sequentialization for the remaining accesses. Static promotion is performed using equivalence class unification and module unrolling: memory dependences are enforced through explicit synchronization and software serial ordering. We have implemented Maps based on the SUIF infrastructure. This paper demonstrates that the exclusive use of static promotion yields roughly 20-fold speedup on 32 tiles for our regular applications and about 5-fold speedup on 16 or more tiles for our irregular applications. The paper also shows that selective use of dynamic accesses can be a useful complement to the mostly static memory system.
Dynamic Memory Adjustment for External Mergesort

Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory space varies, static memory allocation either wastes memory space or fails to make full use of memory to speed up sorting. This paper presents a method for run-time adjustment of in-memory work space for external mergesort and a policy for allocating memory among concurrent, competing sorts. Experimental results confirm that the new method enables sorts to adapt their memory usage gracefully to the actual input size and available memory space, When multiple sorts compete for memory resources, we found that sort throughput and response time are improved significantly by our policy for memory allocation combined with limiting the number of sorts processed concurrently. Many systems rely on static allocation, that is, work space is allocated when an operation starts and remains unchanged until it finishes. This approach is likely to result in some operations wasting memory while others are starved for memory. There are two reasons why this may happen. First, the input size may be unknown or poorly estimated. Second, in a multiuser environment the workload varies, resulting in varying demands on the available memory. Overall performance can be improved by algorithms that enable operations to adjust their memory usage at run time in response to the actual size of their inputs and fluctuations in total memory demand. Sorting is a frequent operation in database systems. It is used not only to produce sorted output, but also in many sort-based algorithms, such as grouping with aggregation, duplicate removal, sort-merge join and set operations [Gra93]. Sorting can also improve the efficiency of algorithms like nested-loop joins and row retrieval via an index. This paper concentrates on dynamic memory adjustment for sorting but the same approach can be applied to other memory intensive operations.
Sol–Gel Synthesis of Nanophase Yttria‐Stabilized Tetragonal Zirconia and Densification Behavior below 1600 K

The hot-pressing behavior of nanophase, 3-mol%-yttria-stabilized, tetragonal zirconia (Y-TZP) was studied in the temperature range 1290 to 1570 K. Powder was sol-gel synthesized using zirconium tetrachloride and hydrated yttrium chloride precursors. After drying and calcination, the particle size was 40 nm, coarsening to 70 nm upon subsequent annealing at 1273 K. On compact heating at 23-MPa applied stress, densification initiated near the calcination/annealing temperature. Theoretical density was obtained at densification temperature above 1490 K with particle coarsening consistent with classical coarsening kinetics. Microstructural change accompanying densification involved formation of dense regions 2 to 4 μm in size separated by irregularly shaped porous regions. The observed densification behavior complements calculated densification maps for fine-particle Y-TZP.
Perturbations of Respiratory Rhythm and Pattern by Disrupting Synaptic Inhibition within Pre-Bötzinger and Bötzinger Complexes123

Visual Abstract The pre-Bötzinger (pre-BötC) and Bötzinger (BötC) complexes are the brainstem compartments containing interneurons considered to be critically involved in generating respiratory rhythm and motor pattern in mammals. The pre-Bötzinger (pre-BötC) and Bötzinger (BötC) complexes are the brainstem compartments containing interneurons considered to be critically involved in generating respiratory rhythm and motor pattern in mammals. Current models postulate that both generation of the rhythm and coordination of the inspiratory-expiratory pattern involve inhibitory synaptic interactions within and between these regions. Both regions contain glycinergic and GABAergic neurons, and rhythmically active neurons in these regions receive appropriately coordinated phasic inhibition necessary for generation of the normal three-phase respiratory pattern. However, recent experiments attempting to disrupt glycinergic and GABAergic postsynaptic inhibition in the pre-BötC and BötC in adult rats in vivo have questioned the critical role of synaptic inhibition in these regions, as well as the importance of the BötC, which contradicts previous physiological and pharmacological studies. To further evaluate the roles of synaptic inhibition and the BötC, we bilaterally microinjected the GABAA receptor antagonist gabazine and glycinergic receptor antagonist strychnine into the pre-BötC or BötC in anesthetized adult rats in vivo and in perfused in situ brainstem–spinal cord preparations from juvenile rats. Muscimol was microinjected to suppress neuronal activity in the pre-BötC or BötC. In both preparations, disrupting inhibition within pre-BötC or BötC caused major site-specific perturbations of the rhythm and disrupted the three-phase motor pattern, in some experiments terminating rhythmic motor output. Suppressing BötC activity also potently disturbed the rhythm and motor pattern. We conclude that inhibitory circuit interactions within and between the pre-BötC and BötC critically regulate rhythmogenesis and are required for normal respiratory motor pattern generation.
Structure learning with independent non-identically distributed data

There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i. d. sample. In contexts such as fMRI analysis, data may consist of an ensemble of independent samples from a common data generating mechanism which may not have identical distributions. Pooling such data can result in a number of well known statistical problems so each sample must be analyzed individually, which offers no increase in power due to the presence of multiple samples. We show how existing constraint based methods can be modified to learn structure from the aggregate of such data in a statistically sound manner. The prescribed method is simple to implement and based on existing statistical methods employed in metaanalysis and other areas, but works surprisingly well in this context where there are increased concerns due to issues such as retesting. We report results for directed models, but the method given is just as applicable to undirected models.
Normative Data of Penile Length for Term Chinese Newborns

Careful examination and assessment of penile length in the newborn is important because micropenis is associated with hypothalamic disorders. This prospective cross-sectional study was designed to establish the norm of penile length for term Hong Kong Chinese newborns. 4,628 full-term healthy male newborns were enrolled in the study. Penile length was measured from pubic ramus to the tip of the glans penis by placing the end of a straight edge ruler against the pubic ramus. A gestation-associated graph of 3rd, 10th, 25th, 50th, 75th, 90th and 97th centiles for the penile length was created. The penile length was significantly correlated with gestational age, birth weight and body length. When compared with published data for other populations, Hong Kong newborns have significantly shorter penile length. The norm of the penile length is useful in diagnostic and therapeutics for the ethnic Chinese male newborns.
Acrylonitrile-butadiene-styrene nanocomposites filled with nanosized alumina

A polymer nanocomposite was produced by acrylonitrile-butadiene-styrene (ABS) and α-alumina (Al 2 O 3 ) nanoparticles through melt compounding. The nanosized α-alumina was prepared through sol-gel process using aluminum nitrate and citric acid. The particle size was analyzed by X-ray diffraction and scanning electron microscopy (SEM) studies. The nanocomposites were characterized through tensile strength, Young's modulus, strain% at break, flexural strength, flexural modulus, and impact strength. The ABS/Al 2 O 3 nanocomposites are found to have slightly higher Young's modulus, but lower tensile strength, strain% at break, flexural and impact strength than the virgin ABS. But its flexural modulus increases with increasing Al 2 O 3 content in ABS matrix. The d-spacing was calculated in nanocomposites to evaluate the interaction between Al 2 O 3 and ABS. The particle distributions in nanocomposites were studied by SEM. The fractured surfaces of tensile test samples were also examined through SEM and show that the ductile fracture of ABS is converted to brittle fracture with addition of Al 2 O 3 .
CLIP@UMD at SemEval-2016 Task 8: Parser for Abstract Meaning Representation using Learning to Search

We develop a novel technique to parse English sentences into Abstract Meaning Representation (AMR) using SEARN, a Learning to Search approach, by modeling the concept and the relation learning in a unified framework. We evaluate our parser on multiple datasets from varied domains and show an absolute improvement of 2% to 6% over the state-of-the-art. Additionally we show that using the most frequent concept gives us a baseline that is stronger than the state-of-the-art for concept prediction. We plan to release our parser for public use.
Self-organization in a perceptual network

The emergence of a feature-analyzing function from the development rules of simple, multilayered networks is explored. It is shown that even a single developing cell of a layered network exhibits a remarkable set of optimization properties that are closely related to issues in statistics, theoretical physics, adaptive signal processing, the formation of knowledge representation in artificial intelligence, and information theory. The network studied is based on the visual system. These results are used to infer an information-theoretic principle that can be applied to the network as a whole, rather than a single cell. The organizing principle proposed is that the network connections develop in such a way as to maximize the amount of information that is preserved when signals are transformed at each processing stage, subject to certain constraints. The operation of this principle is illustrated for some simple cases. <<ETX>>
Joint testing of genotype and ancestry association in admixed families

Current genome‐wide association studies (GWAS) often involve populations that have experienced recent genetic admixture. Genotype data generated from these studies can be used to test for association directly, as in a non‐admixed population. As an alternative, these data can be used to infer chromosomal ancestry, and thus allow for admixture mapping. We quantify the contribution of allele‐based and ancestry‐based association testing under a family‐design, and demonstrate that the two tests can provide non‐redundant information. We propose a joint testing procedure, which efficiently integrates the two sources information. The efficiencies of the allele, ancestry and combined tests are compared in the context of a GWAS. We discuss the impact of population history and provide guidelines for future design and analysis of GWAS in admixed populations. Genet. Epidemiol. 34:783‐791, 2010. © 2010 Wiley‐Liss, Inc.