Miracle-dz/UniFAR-FTUs huggingface dataset:
A Ranking Algorithm via Changing Markov Probability Matrix Based on Distribution Factor

With the rapid growth of the web, it will become more and more difficult to provide relevant information to the users to cater to their needs. The web structure mining plays an important role in this approach. There are two classic ranking algorithms HITS and PageRank commonly used in web structure mining. These two algorithms treat all links equally while assigning rank scores. This paper provides a new ranking algorithm via changing the Markov probability matrix based on distributed factor. This algorithm assigns rank scores based on the similarity of web pages instead of equal assignment. Our experiment results show that our algorithm performs better than the standard PageRank.
Cooperative breeding and monogamy in mammalian societies

Comparative studies of social insects and birds show that the evolution of cooperative and eusocial breeding systems has been confined to species where females mate completely or almost exclusively with a single male, indicating that high levels of average kinship between group members are necessary for the evolution of reproductive altruism. In this paper, we show that in mammals, the evolution of cooperative breeding has been restricted to socially monogamous species which currently represent 5 per cent of all mammalian species. Since extra-pair paternity is relatively uncommon in socially monogamous and cooperatively breeding mammals, our analyses support the suggestion that high levels of average kinship between group members have played an important role in the evolution of cooperative breeding in non-human mammals, as well as in birds and insects.
Fast Connected Components Computation in Large Graphs by Vertex Pruning

Finding connected components is a fundamental task in applications dealing with graph analytics, such as social network analysis, web graph mining and image processing. The exponentially growing size of today's graphs has required the definition of new computational models and algorithms for their efficient processing on highly distributed architectures. In this paper we present cracker, an efficient iterative MapReduce-like algorithm to detect connected components in large graphs. The strategy of cracker is to transform the input graph in a set of trees, one for each connected component in the graph. Nodes are iteratively removed from the graph and added to the trees, reducing the amount of computation at each iteration. We prove the correctness of the algorithm, evaluate its computational cost and provide an extensive experimental evaluation considering a wide variety of synthetic and real-world graphs. The experimental results show that cracker consistently outperforms state-of-the-art approaches both in terms of total computation time and volume of messages exchanged.
Usage of Invariants for Symbolic Verification of Requirements

The main goal of the paper is finding of preand post-invariants for transitions between symbolic states in the system that must be verified and use them for verification purposes. Systems are specified by basic protocols [1]. This specification defines a transition system with transitions s → s′ where s and s′ are symbolic states, b is a basic protocol. The main problem of verification is a reachability problem for given properties expressed in specification logic language. We present double approximation method of verification based on computing invariants. The method is implemented as an iterative algorithm which solves in parallel reachability problem and computes lower and upper approximations of invariants for basic protocols. Currently there are a lot of significant works devoted to computing invariants, which are considered for loops in programs. Loops are marked explicitly syntactic constructions like while and others. When we deal with requirement specifications, we do not deal with explicit marked loops, moreover basic protocols provide non-deterministic order. Existing methods usually ignore the conditions of the loops. Invariants formulae, which is obtained as a result, include unreachable states and therefore could be used in verification only in the following way: if a property does not intersect with the invariant formula, then it is unreachable, if intersects, then conclusion cannot be done. Therefore, the problem of modification of existing methods, or to develop a new algorithm that could be applied in practice of requirements verification is actual. Research of problems of automatic program invariants generation for a variety of data algebras was performed starting from 70-th years in Institute of Cybernetics of NAS of Ukraine. Their main results are presented in [2]. Double approximation method, is the dynamic iterative method of invariants generation and it is based on these results and adapted for requirements verification. The method also can be applied to program verification if a program is considered as a special case of basic protocol specification. The method has been implemented in VRS (Verification of Requirement Specifications) system [3] and IMS (Insertion Modeling System) system [4].
Kalman Filter Channel Estimation Based InterCarrier Interference Cancellation techniques InOFDM System

Orthogonal frequency division multiplexing (OFDM) is one of the modulation scheme, used for high speed mobile communication. However, fast time varying multipath channels lead to loss of orthogonality of subcarriers causing inter carrier interference (ICI) in OFDM signal. In this paper, MMSE and DFIC (Decision Feedback ICI Cancellation) equalizers are implementedtoremove ICI. The information of Channel Impulse Response (CIR) required for equalizing the OFDM signal is estimated on every subcarrier using time domain Kalman Filter. The performance of MMSE and DFIC equalizers are compared on the basis of bit error rate (BER) of equalizers.
Evaluation of the MB/BacT Mycobacterium Detection System for Susceptibility Testing of Mycobacterium tuberculosis

ABSTRACT The MB/BacT mycobacterium detection system was evaluated for its performance in the susceptibility testing of Mycobacterium tuberculosis. Eighty-three M. tuberculosis isolates were processed. Results for all isoniazid-, rifampin- and streptomycin-susceptible, isoniazid-resistant, and rifampin-resistantM. tuberculosis isolates with the MB/BacT system agreed 100% with those obtained by the agar proportion method. The agreements between the two methods for streptomycin- and ethambutol-resistant isolates were 96.4 and 90.4%, respectively. The susceptibility test results were obtained in 7 days, on average. These data demonstrate that the MB/BacT system is an accurate, nonradiometric method for rapid susceptibility testing of M. tuberculosis.
Principles of hash-based text retrieval

Hash-based similarity search reduces a continuous similarity relation to the binary concept "similar or not similar": two feature vectors are considered as similar if they are mapped on the same hash key. From its runtime performance this principle is unequaled--while being unaffected by dimensionality concerns at the same time. Similarity hashing is applied with great success for near similarity search in large document collections, and it is considered as a key technology for near-duplicate detection and plagiarism analysis. This papers reveals the design principles behind hash-based search methods and presents them in a unified way. We introduce new stress statistics that are suited to analyze the performance of hash-based search methods, and we explain the rationale of their effectiveness. Based on these insights, we show how optimum hash functions for similarity search can be derived. We also present new results of a comparative study between different hash-based search methods.
Do be do be do

We explore the design and implementation of Frank, a strict functional programming language with a bidirectional effect type system designed from the ground up around a novel variant of Plotkin and Pretnar's effect handler abstraction. Effect handlers provide an abstraction for modular effectful programming: a handler acts as an interpreter for a collection of commands whose interfaces are statically tracked by the type system. However, Frank eliminates the need for an additional effect handling construct by generalising the basic mechanism of functional abstraction itself. A function is simply the special case of a Frank operator that interprets no commands. Moreover, Frank's operators can be multihandlers which simultaneously interpret commands from several sources at once, without disturbing the direct style of functional programming with values. Effect typing in Frank employs a novel form of effect polymorphism which avoid mentioning effect variables in source code. This is achieved by propagating an ambient ability inwards, rather than accumulating unions of potential effects outwards. We introduce Frank by example, and then give a formal account of the Frank type system and its semantics. We introduce Core Frank by elaborating Frank operators into functions, case expressions, and unary handlers, and then give a sound small-step operational semantics for Core Frank. Programming with effects and handlers is in its infancy. We contribute an exploration of future possibilities, particularly in combination with other forms of rich type system.
Subvector-quantized high-density discrete hidden Markov model and its re-estimation

We investigated two methods to improve the performance of high-density discrete hidden Markov model (HDDHMM). HDDHMM employs discrete densities with a very large codebook consisting of thousands to tens of thousands of vector quantization (VQ) codewords which are constructed as the product of per-dimension scalar quantization (SQ) codewords. Although the subsequent HDDHMM is fast in decoding, it is not accurate enough. In this paper, making use of the fact that, for a fixed number of bits, VQ is more efficient than SQ, subvector quantization (SVQ) was investigated to improve the quantization efficiency while keeping the (time and space) complexity of the quantizer sufficiently low. Model parameters of the resulting SVQ-HDDHMM were further re-estimated. For the Wall Street Journal 5K-vocabulary task, it is found that the proposed SVQ-HDDHMM could be a better model (both in terms of recognition time and error rate) than conventional continuous-density HMM for practical deployment.
Detecting Spying and Fraud Browser Extensions: Short Paper

Due to the flaws in policy followed by web browsers for granting permissions to browser extensions and due to a lack of effective static and dynamic detection systems for identifying malicious extensions uploaded on the web stores, malicious browser extensions have become the easiest way to carry out phishing, spying, fraud and other kinds of advanced attacks. This paper identifies and analyzes a subset of these attacks which can be performed with the use of malicious browser extensions (using Google Chrome) and discusses the research gaps of the existing prevention and detection schemes to adequately defend against these attacks. An initial set of malicious signatures responsible for cyber fraud and spying is identified during the study. We use this set of signatures to develop a lightweight malicious extension detection system which can alert users of suspected spying or fraud extensions installed on the Chrome browser on a PC. Results show that the proposed detection system performs better than known malicious extension detectors such as Chrome Cleanup tool and Chrome safeguard tool.
Per Instance Algorithm Configuration for Continuous Black Box Optimization. (Configuration Automatisé d'algorithme par instance pour l'optimisation numérique boîte-noire)

This PhD thesis focuses on the automated algorithm configuration that aims at finding the best parameter setting for a given problem or a' class of problem. The Algorithm Configuration problem thus amounts to a metal Foptimization problem in the space of parameters, whosemetaFobjective is the performance measure of the given algorithm at hand with a given parameter configuration. However, in the continuous domain, such method can only be empirically assessed at the cost of running the algorithm on some problem instances. More recent approaches rely on a description of problems in some features space, and try to learn a mapping from this feature space onto the space of parameter configurations of the algorithm at hand. Along these lines, this PhD thesis focuses on the Per Instance Algorithm Configuration (PIAC) for solving continuous black boxoptimization problems, where only a limited budget confessionnalisations available. We first survey Evolutionary Algorithms for continuous optimization, with a focus on two algorithms that we have used as target algorithm for PIAC, DE and CMAFES. Next, we review the state of the art of Algorithm Configuration approaches, and the different features that have been proposed in the literature to describe continuous black box optimization problems. We then introduce a general methodology to empirically study PIAC for the continuous domain, so that all the components of PIAC can be explored in real Fworld conditions. To this end, we also introduce a new continuous black box test bench, distinct from the famous BBOB'benchmark, that is composed of a several multiFdimensional test functions with different problem properties, gathered from the literature. The methodology is finally applied to two EAS. First we use Differential Evolution as'target algorithm, and explore all the components of PIAC, such that we empirically assess the best. Second, based on the results on DE, we empirically investigate PIAC with Covariance Matrix Adaptation Evolution Strategy (CMAFES) as target algorithm. Both use cases empirically validate the proposed methodology on the new black box testbench for dimensions up to100.
Factors increasing snake detection and perceived threat in captive rhesus macaques (Macaca mulatta)

The primary predators of primates are all ambush hunters, and yet felids, raptors, and snakes differ in aspects of their ecology that affect the evasive strategies of their primate prey. Felids and raptors can traverse long distances quickly, thus the urgency of threat they present increases as they come closer in proximity to primates. In contrast, snakes do not move rapidly over long distances, and so primates may be reasonably safe even at close distances provided snakes can be detected and monitored. We investigated the ability of captive rhesus macaques (Macaca mulatta) to detect snakes at distances ranging from 15 to 1.5 m. We also examined variation in intensity of perceived threat by applying a Hidden Markov Model to infer changes in underlying state from observable behaviors, that is, increased attention and mobbing. We found that the macaques often failed to detect snake models but that closer proximity improved snake detection, which is necessary before threat can be perceived. We also found that having only one individual in fairly close proximity (≤7.5 m) was sufficient to alert the rest of the group and so the chances of detection did not increase with increasing group size. Finally, we found that when the snakes were perceived, they did not elicit greater intensity of response with closer proximity. These results provide evidence that the threat from snakes is greatest when they are in proximity to primates but are unseen. When snakes are seen, however, distance appears not to affect primates' perceived risk, in contrast to their perceived risk from raptors and felids. Am. J. Primatol. 76:135–145, 2014. © 2013 Wiley Periodicals, Inc.
Multicenter Study of Creatinine- and/or Cystatin C-Based Equations for Estimation of Glomerular Filtration Rates in Chinese Patients with Chronic Kidney Disease

Objective To establish equations for the estimation of glomerular filtration rates (eGFRs) based on serum creatinine (SCr) and/or serum cystatin C (SCysC) in Chinese patients with chronic kidney disease (CKD), and to compare the new equations with both the reference GFR (rGFR) and the literature equations to evaluate their applicability. Methods The 788 Chinese CKD patients were randomly divided into two groups, the training group and the testing group, to establish new eGFR-formulas based on serum CysC and to validate the established formulas, respectively. 99mTc-DTPA clearance (as the rGFR), serum Cr, and serum CysC were determined for all patients, and GFR was calculated using the Cockcroft-Gault equation (eGFR1), the MDRD formula (eGFR2), the CKD-EPI formulas (eGFR3, eGFR4), and the Chinese eGFR Investigation Collaboration formulas (eGFR5, eGFR6). The accuracy of each eGFR was compared with the rGFR. Results The training and testing groups' mean GFRs were 50.84±31.36 mL/min/1.73 m2 and 54.16±29.45 mL/min/1.73 m2, respectively. The two newly developed eGFR formulas were fitted using iterative computation: and . Significant correlation was observed between each eGFR and the rGFR. However, proportional errors and constant errors were observed between rGFR and eGFR1, eGFR2, eGFR4, eGFR5 or eGFR6, and constant errors were observed between eGFR3 and rGFR, as revealed by the Passing & Bablok plot analysis. The Bland-Altman analysis illustrated that the 95% limits of agreement of all equations exceeded the previously accepted limits of <60 mL/min •1.73 m2, except the equations of eGFR7 and eGFR8. Conclusion The newly developed formulas, eGFR7 and eGFR8, provide precise and accurate GFR estimation using serum CysC detection alone or in combination with serum Cr detection. Differences in detection methods should be carefully considered when choosing literature eGFR equations to avoid misdiagnosis and mistreatment.
Concept Content Based Wikipedia WEB Image Retrieval using CLEF VCDT 2008

One challenge for this Wikipedia task is the training of visual models. We propose in this paper to link each topics one or few visual concepts of the Visual Concept Detection (VCDT) CLEFimage08 task, even if three topics do not t VCDT concepts. We use the same models and features than in our VCDT systems. We show that our visual IMG NOFB run is the second best model in this campaign for this run type. So it can be concluded that our VCDT visual concept partly t this task. Moreover we show that even a simple boolean text analysis overcomes the best IMG NO FEEDBACK run, which has 0.0037 MAP, against 0.399 for our TXT NOFB text run. This emphases the fact that visual retrieval for Wiki task is very dicult.
Efficient Spanner Construction for Directed Transmission Graphs ∗

Let P ⊂ R be a set of n points, each with an associated radius rp > 0. The transmission graph G for P has vertex set P and a directed edge from p to q if and only if q lies in the ball with radius rp around p. Let t > 1. A t-spanner H for G is a sparse subgraph such that for any two vertices p and q connected by a path of length l in G, there is a path of length at most t · l from p to q in H. Given G implicitly as points with radii, we show how to compute a t-spanner for G in time O(n(log n+ log Ψ)), where Ψ is the ratio of the largest and smallest radius in P .
What We Can Learn From the Early History of Sovereign Debt 1

Many people believe that the early development of sovereign debt depended on institutions, but there are two very different ways of presenting this narrative and two very different conclusions one might draw for sovereign debt today. According to the first, this was an impartial story involving executive constraints, shared governance, increased monitoring, and increased transparency in other words things that sound unambiguously good. According to the second narrative this was a story of distributive politics. States had the best access to credit when institutions gave government creditors privileged access to decision making while restricting the influence of those who paid the taxes to reimburse debts. This was a situation where institutions fostered commitment, but at a cost, and sometimes they may not even have been welfare enhancing. In this paper I present evidence from seven centuries of European history, and I suggest that available data support the distributive politics interpretation. I then attempt to draw implications for how we think about the politics of sovereign debt today.
The ExpertFinder Corpus 2007 for the Benchmarking and Development of ExpertFinding Systems

We provide a benchmark dataset for expert nding within the computer science domain. We show how large isolated data graphs from disparate structured data sources can be combined to form one, large, well-linked RDF graph and implement these methods to achieve our dataset. Such a graph lends itself to links analysis and thus opens up possibilities for analysis by expert nding techniques.
Weil and Grothendieck approaches to adelic points

In [We, Ch. 1], Weil defines a process of “adelization” of algebraic varieties over global fields. There is an alternative procedure, due to Grothendieck, using adelic points. One aim of this (largely) expository note is to prove that for schemes of finite type over global fields (i.e., without affineness hypotheses), and also for separated algebraic spaces of finite type over such fields, Weil’s adelization process naturally coincides (as a set) with the set of adelic points in the sense of Grothendieck (and that in the affine case the topologies defined by these two viewpoints coincide; Grothendieck’s approach doesn’t provide a topology beyond the affine case). The other aim is to prove in general that topologies obtained by Weil’s method satisfy good functorial properties, including expected behavior with respect to finite flat Weil restriction of scalars. The affine case suffices for most applications, but the non-affine case is useful (e.g., adelic points of G/P for connected reductive groups G and parabolic subgroups P ). We also discuss topologizing X(k) for possibly non-separated algebraic spaces X over locally compact fields k; motivation for this is given in Example 5.5. Although everything we prove (except perhaps for the case of algebraic spaces) is “well known” folklore, and [Oes, I, §3] provides an excellent summary in the affine case, some aspects are not so easy to extract from the available literature. Moreover, (i) some references that discuss the matter in the non-affine case have errors in the description of the topology on adelic points, and (ii) much of what we prove is needed in my paper [Con], or in arithmetic arguments in [CGP]. In effect, these notes can be viewed as an expanded version of [Oes, I, §3], and I hope they will provide a useful general reference on the topic of adelic points of algebro-geometric objects (varieties, schemes, algebraic spaces) over global fields. In §2 we carry out Grothendieck’s method in the affine case over any topological ring R, characterizing the topology on sets of R-points by means of several axioms. The generalization to arbitrary schemes of finite type via a method of Weil is developed in §3. We explore properties of these topologies in §4, especially for adelic points and behavior with respect to Weil restriction of scalars. Finally, in §5 everything is generalized to the case of algebraic spaces. Notation. We write AF to denote the adele ring of a global field F , and likewise A n F denotes Euclidean n-space over AF . There is no risk of confusion with the common use of such notation to denote affine n-space over SpecF since we avoid ever using this latter meaning for the notation.