Miracle-dz/UniFAR-FTUs huggingface dataset:
Where to start filtering redundancy?: a cluster-based approach

Novelty detection is a difficult task, particularly at sentence level. Most of the approaches proposed in the past consist of re-ordering all sentences following their novelty scores. However, this re-ordering has usually little value. In fact, a naive baseline with no novelty detection capabilities yields often better performance than any state-of-the-art novelty detection mechanism. We argue here that this is because current methods initiate too early the novelty detection process. When few sentences have been seen, it is unlikely that the user is negatively affected by redundancy. Therefore, re-ordering the first sentences may be harmful in terms of performance. We propose here a query-dependent method based on cluster analysis to determine where we must start filtering redundancy.
Towards Model Checking Cryptographic Protocols with Dynamic Epistemic Logic

htmlabstractWe present a variant of Kripke models to model knowledge of large numbers, applicable to cryptographic protocols. Our Epistemic Crypto Logic is a variant of Dynamic Epistemic Logic to describe com- munication and computation in a multi-agent setting. It is interpreted on register models which eciently encode larger Kripke models. As an example we formalize the well-known Die-Hellman key exchange. The presented register models also motivate a Monte Carlo method for model checking which we compare against a standard algorithm, using the key exchange as a benchmark.
Particle state compression scheme for centralized memory-efficient particle filters

In this paper, particle state compression scheme is proposed together with its architecture for centralized implementation of particle filters. In the scheme, state values are processed in original bit-width, stored in a compressed way and recovered before sampling of next iteration. The advantage of the scheme is that particle states memory requirement can be greatly reduced while the trade-off is the deviations between original and recovered states introduced by the process. A case study in Nearly Constant Turn (NCT) scenario shows that while achieving the same level of filtering accuracy, proposed scheme can save up to 49.69% memory overhead for storing particle state values compared to traditional realizations.
Compiling Real-Time Programs With Timing Constraint Refinement and Structural Code Motion

We present a programming language called TCEL (Time-Constrained Event Language), whose semantics are based on time-constrained relationships between observable events. Such a semantics infers only those timing constraints necessary to achieve real-time correctness, without overconstraining the system. Moreover, an optimizing compiler can exploit this looser semantics to help tune the code, so that its worst-case execution time is consistent with its real-time requirements. In this paper we describe such a transformation system, which works in two phases. First, the TCEL source code is translated into an intermediate representation. Then an instruction-scheduling algorithm rearranges selected unobservable operations and synthesizes tasks guaranteed to respect the original event-based constraints. >
Anytime algorithms for top-N recommenders

Many small and mid-sized e-businesses use the services of recommender system (RS) provider companies to outsource the construction and maintenance of their RS. The fees that RS providers charge their clients must cover the computation costs for constructing and updating the recommendation model. By using anytime algorithms, a RS provider can control the computation costs and still offer a system capable of delivering reasonable recommendations. Thus, a RS provider should be able to stop the construction of a recommendation model once the cost for compu-ting it reaches the amount the customer has agreed to pay. In this research we suggest anytime algorithms as a possible solu-tion to a problem that RS providers face. We demonstrate how certain existing recommendation algorithms can be adjusted to the anytime framework. We focus on the case of item-item algorithms, showing how the anytime behavior can be improved using different ordering methods of computations. We conduct a comparative study demonstrating the benefits of the proposed methods for top-N item-item recommenders.
Multilevel Algorithms for Multi-Constraint Hypergraph Partitioning Technical Report

Traditionalhypergraphpartitioningalgorithmscomputea bisectiona graphsuchthat thenumberof hyperedges thatarecutby thepartitioningisminimizedandeachpartitionhasanequalnumberof vertices.Thetaskof minimizing the cutcanbe consideredas the objective and the requirementthat the partitionswill be of the samesizecanbe consideredastheconstraint. In this paperwe extendthepartitioningproblemby incorporatinganarbitrarynumber of balancingconstraints.In our formulation,avectorof weightsis assignedto eachvertex, andthegoalis to produce abisectionsuchthatthepartitioningsatisfiesa balancingconstraintassociatedwith eachweight,while attemptingto minimizethecut. Wepresentnew multi-constrainthypergraphpartitioningalgorithmsthatarebasedonthemultilevel partitioningparadigm.We experimentallyevaluatetheeffectivenessof our multi-constraintpartitionerson a variety of syntheticallygeneratedproblems. ∗Thiswork wassupportedby NSFCCR-9972519, by Army ResearchOfficecontractDA/DAAG55-98-1-0441, by theDOEASCI program,and by Army High PerformanceComputingResearchCentercontractnumberDAAH04-95-C-0008.Accessto computingfacilities was provided by AHPCRC,MinnesotaSupercomputer Institute.Relatedpapersareavailablevia WWW at URL: http://www . cs.umn. edu/ ̃kar ypis
Evidence for the continuum-severity model of psychosis through scrutiny of the architecture of symptoms associated with schizophrenia

ABSTRACT The psychosis continuum provides a framework to develop a compelling insight into the architecture of psychotic experiences in non-clinical samples. Using schizophrenia-specific measures within non-clinical samples offers further opportunity to investigate psychotic experiences and compare to those reported in clinical samples. A cross sectional survey method was used to collect data from a non-clinical sample (n = 510) using the Schizophrenia Quality of Life Scale-Revision 4 (SQLS-R4) and the Hospital Anxiety and Depression Scale (HADS). Conducting confirmatory factor analysis and bi-factor modelling found that a bi-factor model offered a better model fit to the data than the established two factor model. A general factor explained most item variance whilst seven domain specific factors explained a further small amount of item variance. Participants with higher anxiety reported comparatively poorer Quality of Life to those with lower anxiety. Comparison with data taken from a clinical sample found similarities in both the internal consistency and correlation coefficients between SQLS-R4 totals and sub-scales and HADS total scores and sub-scales. These results show the presence of a robust general psychosis Quality of Life factor within a non-clinical sample. The use of schizophrenia-specific measures and bi-factor modelling can provide suitable methods for investigating the nature of the psychosis continuum.
Portable Presence : Can Mobile Games Be Immersive Games ?

Mobile games – in particular, games played on smartphones and tablet computers – are becoming increasingly popular. Yet, there has been little research into whether players can experience immersion while playing mobile games. As the potential for immersive mobile games would be of interest to game developers, researchers and players, it is proposed to measure mobile immersion by comparing Osmos, a multi-platform ambient video game, on three differentsized devices – a smart phone, a tablet and a desktop computer.
Virally Infected Hepatocytes Are Resistant to Perforin-Dependent CTL Effector Mechanisms1

Cell-mediated cytotoxicity plays an important role in the clearance of noncytopathic viruses from infected tissues. Perforin-dependent cytotoxic mechanisms have been noted to play an important role in the clearance of infections from multiple extrahepatic organs. In contrast, mice with defects in the Fas/Fas ligand (FasL)-mediated cytotoxicity pathway exhibit delayed clearance of adenovirus from the liver without apparent delay in the clearance of viral infections from extrahepatic organs. The present studies examined the role of cytotoxic effector mechanisms in intrahepatic immune responses to a replication-defective, recombinant β-galactosidase-encoding adenovirus (AdCMV-lacZ). Delayed clearance of AdCMV-lacZ from the livers of FasL-defective B6.gld mice, but not perforin-deficient B6.pfp−/− mice, was noted despite no significant differences in initial hepatic CD8+ T cell IFN-γ or TNF responses or in activation of intrahepatic cytotoxic lymphocytes cells capable of killing AdCMV-lacZ-infected fibroblast targets. In contrast, AdCMV-lacZ-infected hepatocyte targets were far more sensitive to killing by intrahepatic cytotoxic lymphocytes from B6.pfp−/− than from B6.gld mice, and residual levels of virus-specific killing of hepatocyte targets by FasL-defective B6.gld CTL were blocked by TNF inhibition. These results suggest that inherent resistance of hepatocytes to cytotoxicity mediated by perforin-dependent mechanisms leaves Fas/FasL-dependent, cell-mediated cytotoxicity as the major pathway for CTL-mediated killing of virally infected hepatocytes and accounts for the more prominent role of perforin-independent anti-viral mechanisms in immune responses in the liver.
Matching XML Schemas : A Qualitative Analysis

Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing popularity of the XML model and the proliferation of XML documents on-line, automated matching of XML documents has become a critical research problem. We have developed qualitative and quantitative analysis techniques to classify both the structural capacity and the linguistic similarities of any two given XML schemas. These analysis techniques form the basis of comparing (1) the quality of match across different match algorithms (horizontal comparison); or (2) multiple matches that may be discovered for a given source entity (vertical comparison) via the same match algorithm. In this paper, we now formally define a Quality of Match (QoM) metric to measure the “goodness” of a match and a match taxonomy that allows for qualitative categorization of the match based on the structural and linguistic overlap between the source and the target schemas. Furthermore, we also provide a weight model that in concert with the taxonomy, provides a mathematical model to define a precise metric for the matches. Based on the match taxonomy, in this paper, we present a hybrid match algorithm that now combines linguistic and structural matching algorithms to provide better quality of matching between any two given schemas. The hybrid schema match algorithm presented in this paper is a top-down algorithm, unlike other bottom-up, structure-based algorithms presented in literature [12], with better performance potential.
Carbon Stars in the Hamburg/ESO Survey: Abundances

We have carried out a detailed abundance analysis using high-dispersion spectra from HIRES at Keck for a sample of 16 carbon stars found among candidate extremely metal-poor (EMP) stars from the Hamburg/ESO Survey (HES). We find that the Fe metallicities for the cooler C stars (Teff ∼ 5100 K) have been underestimated by a factor of ∼10 by the standard HES tools. The results presented here provided crucial supporting data used recently by Cohen et al. to derive the frequency of C stars among EMP stars. C enhancement in these EMP C stars appears to be independent of Fe metallicity and approximately constant at ∼ the solar ϵ(C). The C enhancement shows some evidence of decreasing with decreasing Teff (increasing luminosity), presumably due to mixing and dredge-up of C-depleted material. The mostly low 12C/13C ratios (∼4) and the high N abundances in many of these stars suggest that material that has been through proton burning via the CN cycle comprises most of the stellar envelope. C enhancement in this sample is associated with strong enrichment of heavy nuclei beyond the Fe peak for 12 of the 16 stars. The remaining C stars from the HES, which tend to be the most Fe-poor, show no evidence for enhancement of the heavy elements. Very high enhancements of lead are detected in some of the C stars with highly enhanced Ba. The strong lead lines, the high Ba/Eu ratios, and the high ratios of abundances of the diagnostic elements in the first and second s-process peaks demonstrate that the s-process is responsible for the enhancement of the heavy elements for the majority of the C stars in our sample. The low 12C/13C ratios and large C and N enhancements of the EMP C stars are more extreme than those of intrinsic asymptotic giant branch C stars of near-solar Fe metallicity, but closer to the composition of CH stars. Our subsample of EMP C stars without s-process enhancement is reminiscent of the R-type C stars in the solar neighborhood; thus, we expect that they are formed by similar mechanisms. We suggest that both the s-process-enhanced and Ba-normal C stars result from phenomena associated with mass transfer in binary systems. This leads directly to the progression from C stars to CH stars and then to Ba stars as the Fe metallicity increases.
Hybrid latency tolerance for robust energy-efficiency on 1000-core data parallel processors

Currently, GPUs and data parallel processors leverage latency tolerance techniques such as multithreading and prefetching to maximize performance per Watt. However, choosing a technique that provides energy-efficiency on a wide variety of workloads is difficult, as the type of latency to tolerate, required hardware complexity, and energy consumption is directly related to application behavior. After qualitatively evaluating five commonly used latency tolerance techniques, we develop a hybrid technique utilizing multithreading and decoupled execution to maximize performance while minimizing hardware complexity and energy consumption across a wide variety of workloads. We compare our hybrid technique with the five commonly used techniques on a 1024-core data parallel processor by performing a comprehensive design space exploration, leveraging detailed performance and physical design models. By intelligently leveraging both decoupled execution and multithreading, our hybrid latency tolerance technique is able to improve energy-efficiency by 28% to 89% over any single technique on data parallel benchmarks. Compared to other combinations of latency tolerance techniques, we find that our hybrid latency tolerance technique provides the highest energy-efficiency by over 26%.
PORTFOLIO SELECTION PROBLEMS CONSISTENT WITH GIVEN PREFERENCE ORDERINGS

This paper theoretically and empirically investigates the connection between portfolio theory and ordering theory. In particular, we examine three different portfolio problems and the respective orderings used to rank investors' choices: (1) risk orderings, (2) variability orderings, and (3) tracking-error orderings. For each problem, we discuss the properties of the risk measures, variability measures, and tracking-error measures, as well as their consistency with investor choices. Finally, for each problem, we propose an empirical application of several admissible portfolio optimization problems using the US stock market. The proposed empirical analysis permits us to evaluate the ex-post impact of the optimal choices, thereby deriving completely different investors' preference orderings during the recent financial crisis.
GTS Allocation Scheme of IEEE 802.15.4 for Energy-Efficiency

The reliability of data transmission and the energy consumption of wireless nodes in wireless sensor networks (WSNs) are important issues as interest in this type of network increases. IEEE 802.15. 4 is a suitable protocol for WSNs because it was designed for low-power operation via wireless communications. The guaranteed time slot (GTS) of IEEE 802.15. 4 can usually be used for cyclic data transmission. However, an unused GTS allocation wastes energy. This paper suggests an energy-efficient IEEE 802.15. 4 data-transmission scheduling scheme for use on WSNs. The unused GTS allocation can be eliminated, and unnecessary energy consumption can be reduced through the appropriate allocation of GTS to the data generation period of each node. An illustrative scenario showed that this technique reduced the consumption of energy while maintaining the reliability of data transmission.
Stimulation on the Positive Phase of Hippocampal Theta Rhythm Induces Long-Term Potentiation That Can Be Depotentiated by Stimulation on the Negative Phase in Area CA1 In Vivo

Long-term potentiation (LTP) of synaptic transmission induced by high-frequency stimulation (HFS) is considered to be a model for learning processes; however, standard HFS protocols consisting of long trains of HFS are very different from the patterns of spike firing in freely behaving animals. We have investigated the ability of brief bursts of HFS triggered at different phases of background theta rhythm to mimic more natural activity patterns. We show that a single burst of five pulses at 200 Hz given on the positive phase of tail pinch-triggered theta rhythm reliably induced LTP in the stratum radiatum of the hippocampus of urethane-anesthetized rats. Three of these bursts saturated LTP, and 10 bursts occluded the induction of LTP by long trains of HFS. Burst stimulation on the negative phase or at zero phase of theta did not induce LTP or long-term depression. In addition, stimulation with 10 bursts on the negative phase of theta reversed previously established LTP. The results show that the phase of sensory-evoked theta rhythm powerfully regulates the ability of brief HFS bursts to elicit either LTP or depotentiation of synaptic transmission. Furthermore, because complex spike activity of approximately five pulses on the positive phase of theta rhythm can be observed in freely moving rats, LTP induced by the present theta-triggered stimulation protocol might model putative synaptic plastic changes during learning more closely than standard HFS-induced LTP.
Homogeneous Routing for Homogeneous Traffic Patterns on Meshes

The performance analysis of dynamic routing algorithms in interconnection networks of parallel computers has thus far predominantly been done by simulation studies. A limitation of simulation studies is that they usually only hold for specific combinations of network, routing algorithm, and traffic pattern. In this paper, we derive saturation point results for the class of homogeneous traffic patterns and a large class of routing functions on meshes. We show that the best possible saturation point on a mesh is half the best possible saturation point on a torus. We also show that, if we restrict ourselves to homogeneous routing functions, the worst possible saturation point on a mesh is again half the best possible saturation point. Finally, we present a class of homogeneous routing functions, containing the well-known e-cube routing function, which are all optimal for all homogeneous traffic patterns.
The BLOC-1 Subunit Pallidin Facilitates Activity-Dependent Synaptic Vesicle Recycling

Abstract Membrane trafficking pathways must be exquisitely coordinated at synaptic terminals to maintain functionality, particularly during conditions of high activity. We have generated null mutations in the Drosophila homolog of pallidin, a central subunit of the biogenesis of lysosome-related organelles complex-1 (BLOC-1), to determine its role in synaptic development and physiology. We find that Pallidin localizes to presynaptic microtubules and cytoskeletal structures, and that the stability of Pallidin protein is highly dependent on the BLOC-1 components Dysbindin and Blos1. We demonstrate that the rapidly recycling vesicle pool is not sustained during high synaptic activity in pallidin mutants, leading to accelerated rundown and slowed recovery. Following intense activity, we observe a loss of early endosomes and a concomitant increase in tubular endosomal structures in synapses without Pallidin. Together, our data reveal that Pallidin subserves a key role in promoting efficient synaptic vesicle recycling and re-formation through early endosomes during sustained activity.
Exploiting user mobility for wireless content delivery

We consider the problem of storing segments of encoded versions of content files in a set of base stations located in a communication cell. These base stations work in conjunction with the main base station of the cell. Users move randomly across the space based on a discrete-time Markov chain model. At each time slot each user accesses a single base station based on it's current position and it can download only a part of the content stored in it, depending on the time slot duration. We assume that file requests must be satisfied within a given time deadline in order to be successful. If the amount of the downloaded (encoded) data by the accessed base stations when the time deadline expires does not suffice to recover the requested file, the main base station of the cell serves the request. Our aim is to find the storage allocation that minimizes the probability of using the main base station for file delivery. This problem is intractable in general. However, we show that the optimal solution of the problem can be efficiently attained in case that the time deadline is small. To tackle the general case, we propose a distributed approximation algorithm based on large deviation inequalities. Systematic experiments on a real world data set demonstrate the effectiveness of our proposed algorithms.
Effects of maturity stage and lactic acid bacteria on the fermentation quality and aerobic stability of Siberian wildrye silage

Abstract It is difficult to make good quality of silage from alpine gramineous from the Qinghai Tibetan plateau. The effects of lactic acid bacteria (LAB) on the fermentation quality and aerobic stability of Siberian wildrye silage were studied in southeast of the Qinghai Tibetan plateau. Siberian wildrye materials were freshly cut at the sprouting stage, flowering stage, and milky stage. Silage was prepared by using a small‐scale silage fermentation system (bag silos). Lactobacillus plantarum (LP, 5 × 108 cfu/kg FM), Lactobacillus buchneri (LB, 5 × 108 cfu/kg FM) and their mixture (LP+LB, 5 × 108 cfu/kg FM) as silage additives were separately added to ensiled forages, and no additive served as control (CK). These bag silos were kept at room temperature (<15°C), and the silage qualities were analyzed after 60 days of ensiling. The number of indigenous LAB on fresh materials was less than that of yeasts and molds, and LAB species showed specification adapted to low temperature. LAB inoculated silages had lower (P < 0.05) pH value, NH 3‐N/TN and butyric acid content compared with control silage. Silage treated with LB had higher contents of acetic acid, propionic acid, WSC and CP. However, the aerobic stability of silages inoculated with LAB did not differ significantly between stages (P > 0.05). When fermentation characteristics, chemical composition, and aerobic stability were considered, treatment with L. plantarum resulted in high quality of Siberian wildrye silage harvested at the flowering stage in the alpine region.