Miracle-dz/UniFAR-FTUs huggingface dataset:
Highly scalable parallel collaborative filtering algorithm

Collaborative filtering (CF) based recommender systems have gained wide popularity in Internet companies like Amazon, Netflix, Google News, and others. These systems make automatic predictions about the interests of a user by inferring from information about like-minded users. Realtime CF on highly sparse massive datasets, while achieving a high prediction accuracy, is a computationally challenging problem. In this paper, we present the design of a soft real-time (around 1 min.) parallel CF algorithm based on the Concept Decomposition technique [1]. Our parallel algorithm has been optimized for multicore/many-core architectures while maintaining the prediction accuracy of 0.84 RMSE. Using the Netflix dataset, we demonstrate the performance and scalability of our algorithm (in both batch mode and online mode) on a 32-core Power6 based SMP system. Our parallel algorithm delivered training time of 64s on the full Netflix dataset and prediction time of 4.5s on ÍAM ratings (3.2/μs per rating prediction). This is 12.6× better than the best known sequential training time and around 33 × better than the best known sequential prediction time [2], along with high accuracy (Ό.84 RMSE). To the best of our knowledge, this is also the best known parallel performance at such high accuracy.
A Distributed and Adaptive Trust Evaluation Algorithm for MANET

We propose a distributed and adaptive trust evaluation algorithm (DATEA) to calculate the trust between nodes. First, calculate the communication trust by using the number of data packets between nodes, and predict the trust based on the trend of this value, calculate the comprehensive trust by combining the history trust with the predict value; calculate the energy trust based on the residual energy of nodes; calculate the direct trust by using the communication trust and energy trust. Second, calculate the recommendation trust based on the recommendation reliability and the recommendation familiarity; put forward the adaptively weighting method, and calculate the integrate direct trust by combining the direct trust with recommendation trust. Third, according to the integrate direct trust, considering the factor of trust propagation distance, the indirect trust between nodes is calculated. Simulation experiments show that the proposed algorithm can effectively avoid the attacks of malicious nodes, besides, the calculated direct trust and indirect trust about normal nodes are more conformable to the actual situation.
Reasoning about Customer Needs in Multi-supplier ICT Service Bundles using Decision Models

We propose a method, e 3 service , to reason about satisfying customer needs in the context of a wide choice of multi-supplier ICT service bundles. Our method represents customer needs, their ensuing consequences, and the services that realize those consequences in a service ca talogue. This catalogue is then used by a reasoner, which elicits customer needs, computes their consequences, and automatically matches these consequences with services offered by suppliers. The e 3 service method has been implemented and tested in software to demonstrate its feasibility.
GES Attitude Observers – Part I: Multiple General Vector Observations

Abstract This paper proposes a set of observers for attitude estimation based on multiple general time-varying reference vectors, in inertial coordinates, and corresponding vectors, in body-fixed coordinates, in addition to angular velocity readings. The observer error dynamics are globally exponentially stable (GES) and problems such as singularities, unwinding phenomena, or topological limitations for achieving global asymptotic stability are absent. Although the observer estimates do not evolve on the Special Orthogonal Group SO (3), a final solution is provided, on SO (3), whose error is shown to converge to zero for all initial conditions. The proposed solutions are computationally efficient and simulation results are shown that illustrate the achievable performance.
A fast and robust vision-based horizon tracking method

In order to achieve accurate attitude measurement and smooth navigation controlling of unmanned surface vehicle (USV), a visual horizon tracking method based on Kalman filter has been proposed. Firstly, the approximate parameters of the visual horizon are estimated according to the predictive camera attitude, and the candidate image pixels are obtained in a small region of interest around the predicted horizon location. Then, within the candidate image pixels, the candidate line segments are determined by repeated interior points selecting and least squares fitting, and the final visual horizon is picked out according to geometric properties of the candidate line segments. Lastly, the optimal prediction of the camera attitude is updated by Kalman filter. As the horizon detection is only performed in a local region, compared with traditional horizon detection method, the proposed method takes a short time and performs robust to the false alarms. To validate the performance of our method, an experiment is performed based on the frames captured by the camera which is fixed on an USV. The experimental results indicate that our method has higher tracking accuracy and speed.
Model Induction with Support Vector Machines: Introduction and Applications

The rapid advance in information processing systems in recent decades had directed engineering research towards the development of intelligent systems that can evolve models of natural phenomena automatically—“by themselves,” so to speak. In this respect, a wide range of machine learning techniques like decision trees, artificial neural networks (ANNs), Bayesian methods, fuzzy-rule based systems, and evolutionary algorithms have been successfully applied to model different civil engineering systems. In this study, the possibility of using yet another machine learning paradigm that is firmly based on the theory of statistical learning, namely that of the support vector machine (SVM), is investigated. An interesting property of this approach is that it is an approximate implementation of a structural risk minimization (SRM) induction principle that aims at minimizing a bound on the generalization error of a model, rather than minimizing only the mean square error over the data set. In this paper, the basic .
Traceroute Anomalies

Traceroute is – after ping – one of the most widely used network diagnostic tools, due to its simplicity and yet very wide range of applications. Possible applications for traceroute range from simple error diagnosis to large scans, which reveal the underlying network topology. However, since traceroute was not built with modern network technologies in mind, it faces many di culties. These di culties usually manifest themselves in strange or false results, so-called anomalies. This drastically a↵ects traceroute’s abilities for network diagnosis and analyzation, especially in large-scale networks. The correct use of traceroute and interpretation of its output has therefore become more and more important. Projects trying to map the topology of the Internet are also greatly a↵ected by traceroute anomalies, as they usually have to solely rely on traceroute and similar scans. This paper gives a systematic overview of the most frequent traceroute anomalies. The main symptoms of each anomaly are examined based on example scenarios and corresponding output. Additionally, the consequences each anomaly has on the diagnosis of network failures, congestion and mapping e↵orts is analyzed. This also includes typical wrong conclusions drawn from anomalous traceroute results. Finally, several existing and promising future countermeasures against the respective anomalies are presented and analyzed.
Experimental study on a directional cylindrical dielectric resonator antenna (CDRA) at 5.8 GHz

In this paper an experimental study on a directional cylindrical dielectric resonator antenna (CDRA) at 5.8 GHz is discussed and presented. Dielectric resonator (DR) ceramic-base material is investigated in the design and it is found that it improves the antenna performance. The dielectric constant of dielectric resonator palette is 55 and it is fed with a 50 Ω microstrip transmission line. The aperture coupling technique is highlighted in order to improve the performance of the CDRA in terms of their tuning frequencies, impedance bandwidth, radiation pattern and gain. The CDRA measured results are compared with the simulation, by using the 3D microwave simulator, Computer Simulation Technology (CST).
How to Measure the Power of Actors and Film Directors?

Star power is considered to be one of the key drivers of motion picture success. The power of movie directors is another possible, yet controversial, determinant of movie success. However, measuring the power of actors and directors objectively is not an easy task. In this article, we give a detailed description of a fast method which is based on previous box office performance of movies with particular actors and directors. Our approach allows calculating movie star ratings of thousands of movies using a spreadsheet within several minutes. It is also shown empirically that the resulting measures are significant determinants of box office sales. The percentage contribution of each determinant is estimated using the Shapley value decomposition.
The Effects of Lead Acetate on Sexual Behavior and the Level of Testosterone in Adult Male Rats

Background In the present study, the oral effect of lead acetate on the parameters related to sexual behavior as well as changes in the level of testosterone hormone in adult male rats have been investigated. Materials and Methods Forty adult male Wistar rats were allocated into five equal groups. The control group received nothing, the sham group received distilled water and the experimental groups received 25, 50 and 100mg/kg lead acetate orally, respectively for 28 days. The changes in testosterone hormone level and following sexual behavior parameters were investigated: mount latency (ML), intromission latency (IL), post ejaculatory interval (PEI), mount frequency (MF), ejaculatory latency (EL), intromission frequency (IF), copulatory efficacy (CE) and intercopulatory interval (ICI). Results The levels of testosterone hormone in the groups that received 50 and 100 mg/kg lead acetate showed significant decreases in compared to the control group. Additionally, the same doses of lead acetate caused significant increases in ML, IL, PEI and EL compared to the control group. No significant change was observed in MF, but a significant decrease was detected in IF and CE in the experimental group that received 100 mg/kg lead acetate when compared with the control group. ICI showed significant decreases in the experimental groups that received 50 and 100 mg/kg lead acetate compared to the control group. Conclusion It can be concluded that ingestion of lead acetate affects some behavioral activities and the testosterone level of male rats. These effects might be conducted via the alteration of leydig cells following lead acetate poisoning.
The Spliceosome-Activating Complex: Molecular Mechanisms Underlying the Function of a Pleiotropic Regulator

Correct interpretation of the coding capacity of RNA polymerase II transcribed eukaryotic genes is determined by the recognition and removal of intronic sequences of pre-mRNAs by the spliceosome. Our current knowledge on dynamic assembly and subunit interactions of the spliceosome mostly derived from the characterization of yeast, Drosophila, and human spliceosomal complexes formed on model pre-mRNA templates in cell extracts. In addition to sequential structural rearrangements catalyzed by ATP-dependent DExH/D-box RNA helicases, catalytic activation of the spliceosome is critically dependent on its association with the NineTeen Complex (NTC) named after its core E3 ubiquitin ligase subunit PRP19. NTC, isolated recently from Arabidopsis, occurs in a complex with the essential RNA helicase and GTPase subunits of the U5 small nuclear RNA particle that are required for both transesterification reactions of splicing. A compilation of mass spectrometry data available on the composition of NTC and spliceosome complexes purified from different organisms indicates that about half of their conserved homologs are encoded by duplicated genes in Arabidopsis. Thus, while mutations of single genes encoding essential spliceosome and NTC components lead to cell death in other organisms, differential regulation of some of their functionally redundant Arabidopsis homologs permits the isolation of partial loss of function mutations. Non-lethal pleiotropic defects of these mutations provide a unique means for studying the roles of NTC in co-transcriptional assembly of the spliceosome and its crosstalk with DNA repair and cell death signaling pathways.
A study on the preparedness of information security framework area based on the assessment of information security index in Ministry of XYZ

Ministry of XYZ plays a substantially strategic role in providing technical and administrative supports as well as carrying out an analysis for the highest office. Such office possesses not only highly critical but also vital assets of national information. This study is conducted to scrutinize the implementation of information and communication technology (henceforth ICT) advocated by one of the frameworks of information security deemed appropriate to the apparent condition, i.e. the assessment of information security (Keamanan Informasi, KAMI) index. The assessment is performed to measure the preparedness of the application of information security framework in the Ministry of XYZ. The assessment results offer further recommendation to improve the framework of information security in the implementation of ICT in Ministry of XYZ.
Planar field theories with space-dependent noncommutativity

We study planar noncommutative theories such that the spatial coordinates verify a commutation relation of the form: . Starting from the operatorial representation for dynamical variables in the algebra generated by and , we introduce a noncommutative product of functions corresponding to a specific operator-ordering prescription. We define derivatives and traces, and use them to construct scalar-field actions. The resulting expressions allow one to consider situations where an expansion in powers of θ and its derivatives is not necessarily valid. In particular, we study in detail the case when θ vanishes along a linear region. We show that, in that case, a scalar field action generates a boundary term, localized around the line where θ vanishes.
Bounds on the Maximum Number of Edge-disjoint Steiner Trees of a Graph

Tutte and Nash-Williams, independently, gave necessary and sufficient conditions for a connected graph to have at least t edgedisjoint spanning trees. Gusfield introduced the concept of edgetoughness η(G) of a connected graph G, defined as the minimum |S|/(ω(G − S) − 1) taken over all edge-disconnecting sets S of G, where ω(G−S) is the number of connected components of G−S. If a graph has edge-toughness η(G), Tutte and Nash-Williams’s theorem says that the maximum number of edge-disjoint spanning trees of a graphs is given by bη(G)c. Kundu used this result to show that a graph with edge-connectivity λ(G) has at least bλ(G)/2c edgedisjoint spanning trees. In this paper we investigate to which extent the above results can be generalized to a graph G = (V,E) with a distinguished subset of vertices K. We obtain lower bounds for the maximum number of edge-disjoint Steiner trees of G (minimal trees of G containing K) in terms of λK(G), the K-edge-connectivity of G (defined as the minimum number of edges whose removal disconnects K). In [3] we introduced the K-edge-toughness of a graph, ηK(G) (which coincides with η(G) when K = V ). We extent some of the properties of the edge-toughness of a graph to the K-edge-toughness and we show by mean of a counterexample that the maximum number of disjoint Steiner trees can be less than bηK(G)c when K 6= V . We conclude with some conjectures regarding these bounds.
Linguistic human rights, past and present

1 335. Skutnabb-Kangas, Tove & Phillipson, Robert (2017). Linguistic human rights, past and present. Language Rights, Volume I, 28-67. London & New York: Routledge. Reprinted from 129. Skutnabb-Kangas, Tove & Phillipson, Robert (1994). Linguistic human rights, past and present. In Skutnabb-Kangas, Tove & Phillipson, Robert (Eds.), in collaboration with Mart Rannut. Linguistic Human Rights. Overcoming Linguistic Discrimination. Contributions to the Sociology of Language 67. Berlin & New York: Mouton de Gruyter, 71-110. Also reprinted as 308, in Sociolinguistics: Critical Concepts, eds Nikolas Coupland and Adam Jaworski. 2008. London: Routledge. http://www.tove-skutnabb-kangas.org/dl/335-Skutnabb-Kangas-T-Phillipson-R2017-Linguistic-human-rights-past-and-present-Language-Rights-Vol-1Routledge.pdf
Kernels on Bags of Fuzzy Regions for Fast Object retrieval

We propose in this paper a general kernel framework to deal with database object retrieval embedded in images with heterogeneous background. We use local features computed on fuzzy regions for image representation summarized in bags, and we propose original kernel functions to deal with sets of features and spatial constraints. Combined with SVMs classification and online learning scheme, the resulting algorithm satisfies the robustness requirements for representation and classification of objects. Experiments on a specific database having objects with heterogeneous backgrounds show the performance of our object retrieval technique.
Modeling bursts and heavy tails in human dynamics

The dynamics of many social, technological and economic phenomena are driven by individual human actions, turning the quantitative understanding of human behavior into a central question of modern science. Current models of human dynamics, used from risk assessment to communications, assume that human actions are randomly distributed in time and thus well approximated by Poisson processes. Here we provide direct evidence that for five human activity patterns, such as email and letter based communications, web browsing, library visits and stock trading, the timing of individual human actions follow non-Poisson statistics, characterized by bursts of rapidly occurring events separated by long periods of inactivity. We show that the bursty nature of human behavior is a consequence of a decision based queuing process: when individuals execute tasks based on some perceived priority, the timing of the tasks will be heavy tailed, most tasks being rapidly executed, while a few experiencing very long waiting times. In contrast, priority blind execution is well approximated by uniform interevent statistics. We discuss two queuing models that capture human activity. The first model assumes that there are no limitations on the number of tasks an individual can handle at any time, predicting that the waiting time of the individual tasks follow a heavy tailed distribution P(tau(w)) approximately tau(w)(-alpha) with alpha=3/2. The second model imposes limitations on the queue length, resulting in a heavy tailed waiting time distribution characterized by alpha=1. We provide empirical evidence supporting the relevance of these two models to human activity patterns, showing that while emails, web browsing and library visitation display alpha=1, the surface mail based communication belongs to the alpha=3/2 universality class. Finally, we discuss possible extension of the proposed queuing models and outline some future challenges in exploring the statistical mechanics of human dynamics.
Enumerating All Maximal Frequent Subtrees

Given a collection of leaf-labeled trees on a common leafset and a fraction f ∈ ( 1 2 , 1 ] , a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identi es FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has practical applications as a metric for tree similarity, for computing tree congruence, in detection horizontal gene transfer events and as a consensus approach. Enumerating FSTs extend the MAST problem by de nition and reveal additional subtrees not displayed by MAST. This can happen in two ways such a subtree is included in majority but not all of the input trees or such a subtree though included in all the input trees, does not have the maximum number of leaves. Further, FSTs can be enumerated on collections of trees having partially overlapping leafsets. MAST may not be useful here especially if the common overlap among leafsets is very low. Though very useful, the number of FSTs su er from combinatorial explosion just a single MAST can exhibit exponentially many FSTs. This limits both the size of the trees that can be enumerated and the ability to comprehend enumerated FSTs. To overcome this, we propose enumeration of maximal frequent subtrees (MFSTs). A MFST is a FST that is not a subtree to any other FST. The set of MFSTs is a compact non-redundant summary of all FSTs and is much smaller in size. Here we tackle the novel problem of enumerating all MFSTs in collections of phylogenetic trees. We demonstrate its utility in returning larger consensus trees in comparison to MAST. The current implementation is available on the web.
Writing bidirectional model transformations as intentional updates

Model synchronization plays an important role in model- driven software development. Bidirectional model transformation approaches provide techniques for developers to specify the bidirectional relationship between source and target models, while keeping related models synchronized for free. Since models of interest are usually not in a one-to-one correspondence, this synchronization process is inherently ambiguous. Nevertheless, existing bidirectional model trans- formation tools focus mainly on enforcing consistency and provide developers only limited control over how models are synchronized, solving the latent ambiguity via default strategies whose behavior is unclear to developers. In this paper, we propose a novel approach in which developers write update programs that succinctly describe how a target model can be used to update a source model, such that the bidirectional behavior is fully determined. The new approach mitigates the unpredictability of existing solutions, by enabling a finer and more transparent control of what a bidirectional transformation does, and suggests a research direction for building more robust bidirectional model transformation tools.