Miracle-dz/UniFAR-FTUs huggingface dataset:
Dense Matrix Computation on a Heterogenous Architecture: A Block Synchronous Approach

We present a strategy for efficient use of all components of a heterogenous compute node of a typical current generation cluster. Such nodes often comprise multiple sockets with a multicore processor per socket and one or more accelerators, possibly from different generations and/or types. Our strategy differs from schedulers such as Quark or SuperMatrix in that it does not rely on a Directed Acyclic Graph, but rather uses a bulk-synchronous model. Also, it uses dynamic task division rather than aggregation to deal with the heterogeneous components of a node. Practical experiments show the merits of our approach.
meIRL-BC: Predicting player positions in video games

In this paper we demonstrate how behaviour-classification models can improve player position prediction for video game AI. To this end, we propose a novel method named meIRL-BC, which (1) uses maximum-entropy Inverse Reinforcement Learning for the creation of position prediction models [15], and (2) predicts player positions based on estimates of their most likely behavioural roles in the game (e.g., attacking, defending, ambushing, etc.). Experiments that test meIRL-BC in an actual Capture the Flag video game yielded the following three results. First, depending on the behavioural role to be classified, the prediction accuracy of meIRL-BC approximates, slightly improves, or substantially improves upon that of meIRL. Second, the accuracy of the trained behavioural classifier is presently insufficient for classifying actual game-player behaviour. Third, surprisingly, despite use of an ineffective classifier, both meIRL-BC and meIRL yielded comparable overall performance in actual gameplay. What is more, when in actual gameplay the percentage of correctly classified instances was above approximately 40%, meIRL-BC substantially outperformed meIRL is terms of win/loss/draw ratio, the number of bots that were successfully killed, and the absolute number of flags that were captured. Also, of all AIs in competition with the standard AISandbox AI, meIRL-BC was able to capture opponent flags more rapidly, thereby generally achieving a higher game score than meIRL. From these results, we can draw the conclusion that when the meIRL-BC method is correctly applied in video-game AI, it indeed outperforms meIRL in actual gameplay.
A Node-based Trust Management Scheme for Mobile Ad-Hoc Networks

The inherent freedom in self-organized mobile ad-hoc networks (MANETs) introduces challenges for trust management; particularly when nodes do not have any prior knowledge of each other. Furthermore in MANETs, the nodes themselves should be responsible for their own security. We propose a novel approach for trust management in MANETs that is based on the nodes’ own responsibility of building their trust level and node-level trust monitoring. The main contribution of this work is in the introduction of a Node based Trust Management (NTM) scheme in MANET based on the assumption that individual nodes are themselves responsible for their own trust level. We explore and develop the mathematical framework of trust in NTM. Finally, in this context, we demonstrate our scheme with notations, algorithms, analytical model and prove of its correctness.
Advanced Computer Architecture Project Play With Instructions

Instruction repetition is a common characteristic of programs. Many methods have been proposed in order to exploit this phenomenon. But, before exploitation, the properties and reasons of instruction repetition should be studied. This is done in [8]. A program consists of some static instructions. Upon execution, a processor executes one or more instances of some of these static instructions. These instances are called dynamic instructions. An instruction is repeated when one of its instances (meaning, the instruction with both its inputs and output being the same) appears more than once during the execution of the program. Statistical analysis on data collected from simulations shows that not all of the static instructions have repeated instances. In fact, processing of the results revealed these facts: (i) Only a few of the static instructions (about 25% on average) of a program are actually executed. (ii) Most of the instructions executed (about 80% on average) are also repeated. (iii) Only a small fraction of these instructions that are repeated (about 20% on average) contributes about 95% of all the repeated instructions. The above make us conclude that the vast majority of the dynamic instructions executed is generated by a small percentage of static instructions. Next, the dependences of the instructions generating repetitions are examined. In order to trace the various dependences, each instruction is tagged with a value, based on its data dependences. In order to take into account different instruction categories through different contexts, a global, a function level and a local analysis of the instructions are performed. In global analysis, instructions are divided into three categories according to whether they depend on program input data, on global variables, or on data " hardwired " into the program (like an immediate). The results of the simulations indicate that most of the static instructions as well as most of the repeated instructions depend on such " hardwired " data. With function level analysis, the repeatability of function parameters is computed. Simulations show that all of the parameters of the majority (more than 50%) of function calls, are repeated. This usually (but not always) means that their outputs are also repeated. Finally, function-wide statistics of instructions are collected with local analysis. The results show that in a function, most of the repeated instructions operate on data passed to functions as parameters. Data that come from global variables are also popular among repeated instructions. Once again, …
The epidemiology of lymphatic filariasis in Ghana, explained by the possible existence of two strains of Wuchereria bancrofti

Introduction Lymphatic filariasis is a debilitating disease caused by the filarial worm Wuchereria bancrofti. It is earmarked for elimination by the year 2020 through the Global Program for the Elimination of LF (GPELF). In Ghana, mass treatment has been on-going since the year 2000. Earlier studies have revealed differing epidemiology of LF in the North and South of Ghana. This study was therefore aimed at understanding the possible impacts of W. bancrofti diversity on the epidemiology and control of LF in Ghana. Methods The Mitochondrial, Cytochrome C Oxidase I gene of W. bancrofti samples was sequenced and analyzed. The test sequences were grouped into infrapopulations, and pairwise differences (π) and mutation rates (θ) were computed. The amount of variance within and among populations was also computed using the AMOVA. The evolutionary history was inferred using the Maximum Parsimony method. Results Seven samples from the South and 15 samples from the North were sequenced, and submitted to GenBank with accession numbers GQ479497- GQ479518. The results revealed higher mutation frequencies in the southern population, compared to the northern population. Haplotype analyses revealed a total of 11 haplotypes (Hap) in all the 22 DNA sequences, with high genetic variation and polymorphisms within the southern samples. Conclusion This study showed that there is considerable genetic variability within W. bancrofti populations in Ghana, differences that might explain the observed epidemiology of LF. Further studies are however required for an in-depth understanding of LF epidemiology and control.
Focusing on Emotion and Work–Family Conflict Research

This agenda-setting article examines emotion and work–family conflict (WFC) through different paradigmatic lenses. To date, WFC and emotion research has been dominated by the functionalist perspective. This perspective has been quite informative; however, examining WFC and emotion through three alternative paradigms, namely, interpretivism, critical management theory, and postmodernism will serve to broaden and deepen our understanding of this important area of organizational and management scholarship. A paradigmatic analysis can offer a more comprehensive understanding of WFC and emotion because it utilizes an array of theoretical and methodological approaches. In addition, we advance the co-mingling of certain paradigms to offer a more comprehensive future research agenda for emotion and WFC scholarship.
Survey on Applications of Particle Swarm Optimization in Electric Power Systems

The paper presents a survey of particle swarm optimization (PSO) applications in electric power systems. PSO, a novel population based stochastic optimizer with faster convergence speed and simpler implementation than genetic algorithm and ant colony optimization, has been successfully applied to solve electric power optimization problems such as optimal power flow, economic dispatch, reactive power dispatch, unit commitment, generation and transmission planning, maintenance scheduling, state estimation, model identification, load forecasting, control, and others. The primary objective of the paper is to provide a summary of PSO-based optimization method used in electric power system. Both recent developments and further research trends of the area are presented in detail.
Nonlinear filtering for speaker tracking in noisy and reverberant environments

This paper addresses the problem of speaker tracking in a noisy and reverberant environment using time delay of arrival (TDOA) measurements at spatially distributed microphone pairs. The tracking problem is posed within a state-space estimation framework, and models are developed for the speaker motion and the likelihood of the speaker location in the light of the TDOA measurements. The resulting state-space model is nonlinear and nonGaussian, and consequently no closed-form solutions exist for the filtering distributions required to perform tracking. Here sequential Monte Carlo (SMC) methods are applied to approximate the true filtering distribution with a set of samples. The resulting tracking algorithm requires no triangulation, is computationally efficient, and can straightforwardly be extended to track multiple speakers.
Progress in Nano-Engineered Anodic Aluminum Oxide Membrane Development

The anodization of aluminum is an electro-chemical process that changes the surface chemistry of the metal, via oxidation, to produce an anodic oxide layer. During this process a self organized, highly ordered array of cylindrical shaped pores can be produced with controllable pore diameters, periodicity and density distribution. This enables anodic aluminum oxide (AAO) membranes to be used as templates in a variety of nanotechnology applications without the need for expensive lithographical techniques. This review article is an overview of the current state of research on AAO membranes and the various applications of nanotechnology that use them in the manufacture of nano-materials and devices or incorporate them into specific applications such as biological/chemical sensors, nano-electronic devices, filter membranes and medical scaffolds for tissue engineering.
Staff Experience of Harassment and Stalking Behavior by Patients

ABSTRACT Staff from one National Health Service (NHS) Trust in England completed an online survey (N = 590) about their experience of intrusive behaviors from patients. These experiences were categorized into either stalking or harassment and compared in terms of staff and patient characteristics, types of intrusions, and aftermath. Overall, 150 were classified as being stalked (25.4%) and 172 harassed (29.2%). There were no differences in staff characteristics between the two groups. Staff from forensic services and nursing staff were particularly susceptible to these intrusions which took many forms. Respondents perceived a range of causes for the stalking and harassment, the most common being to gain power and control/to scare. It was rare for legal sanctions to be brought against the patient. Our findings reinforce the need for service providers to have policies supported with preventative measures, education and a robust process for addressing stalking so that these measures are embedded in practice in a way that supports staff working with patients. Furthermore, service providers should be challenged on what steps they have taken to prevent, and monitor, such behavior.
Large Unavoidable Subtournaments

Let Dk denote the tournament on 3k vertices consisting of three disjoint vertex classes V 1, V 2 and V 3 of size k, each oriented as a transitive subtournament, and with edges directed from V 1 to V 2, from V 2 to V 3 and from V 3 to V 1. Fox and Sudakov proved that given a natural number k and ε > 0, there is n 0(k, ε) such that every tournament of order n ⩾ n 0(k,ε) which is ε-far from being transitive contains Dk as a subtournament. Their proof showed that $n_0(k,\epsilon ) \leq \epsilon ^{-O(k/\epsilon ^2)}$ and they conjectured that this could be reduced to n 0(k, ε) ⩽ ε−O(k). Here we prove this conjecture.
Distribution and Diversity of Rhodopsin-Producing Microbes in the Chesapeake Bay

ABSTRACT Although sunlight is an abundant source of energy in surface environments, less than 0.5% of the available photons are captured by (bacterio)chlorophyll-dependent photosynthesis in plants and bacteria. Metagenomic data indicate that 30 to 60% of the bacterial genomes in some environments encode rhodopsins, retinal-based photosystems found in heterotrophs, suggesting that sunlight may provide energy for more life than previously suspected. However, quantitative data on the number of cells that produce rhodopsins in environmental systems are limited. Here, we use total internal reflection fluorescence microscopy to show that the number of free-living microbes that produce rhodopsins increases along the salinity gradient in the Chesapeake Bay. We correlate this functional data with environmental data to show that rhodopsin abundance is positively correlated with salinity and with indicators of active heterotrophy during the day. Metagenomic and metatranscriptomic data suggest that the microbial rhodopsins in the low-salinity samples are primarily found in Actinobacteria and Bacteroidetes, while those in the high-salinity samples are associated with SAR-11 type Alphaproteobacteria. IMPORTANCE Microbial rhodopsins are common light-activated ion pumps in heterotrophs, and previous work has proposed that heterotrophic microbes use them to conserve energy when organic carbon is limiting. If this hypothesis is correct, rhodopsin-producing cells should be most abundant where nutrients are most limited. Our results indicate that in the Chesapeake Bay, rhodopsin gene abundance is correlated with salinity, and functional rhodopsin production is correlated with nitrate, bacterial production, and chlorophyll a. We propose that in this environment, where carbon and nitrogen are likely not limiting, heterotrophs do not need to use rhodopsins to supplement ATP synthesis. Rather, the light-generated proton motive force in nutrient-rich environments could be used to power energy-dependent membrane-associated processes, such as active transport of organic carbon and cofactors, enabling these organisms to more efficiently utilize exudates from primary producers.
P-model Alternative to the T-model

Standard linguistic analysis of syntax uses the T-model. This model requires the ordering: D-structure $>$ S-structure $>$ LF, where D-structure is the deep structure, S-structure is the surface structure, and LF is logical form. Between each of these representations there is movement which alters the order of the constituent words; movement is achieved using the principles and parameters of syntactic theory. Psychological analysis of sentence production is usually either serial or connectionist. Psychological serial models do not accommodate the T-model immediately so that here a new model called the P-model is introduced. The P-model is different from previous linguistic and psychological models. Here it is argued that the LF representation should be replaced by a variant of Frege's three qualities (sense, reference, and force), called the Frege representation or F-representation. In the F-representation the order of elements is not necessarily the same as that in LF and it is suggested that the correct ordering is: F-representation $>$ D-structure $>$ S-structure. This ordering appears to lead to a more natural view of sentence production and processing. Within this framework movement originates as the outcome of emphasis applied to the sentence. The requirement that the F-representation precedes the D-structure needs a picture of the particular principles and parameters which pertain to movement of words between representations. In general this would imply that there is a preferred or optimal ordering of the symbolic string in the F-representation. The standard ordering is retained because the general way of producing such an optimal ordering is unclear. In this case it is possible to produce an analysis of movement between LF and D-structure similar to the usual analysis of movement between S-structure and LF. It is suggested that a maximal amount of information about a language's grammar and lexicon is stored, because of the necessity of analyzing corrupted data.
Modifying a Sparse Cholesky Factorization

Given a sparse symmetric positive definite matrix ${\bf AA}^{\sf T}$ and an associated sparse Cholesky factorization ${\bf LDL}^{\sf T}$ or ${\bf LL}^{\sf T}$, we develop sparse techniques for obtaining the new factorization associated with either adding a column to ${\bf A}$ or deleting a column from ${\bf A}$. Our techniques are based on an analysis and manipulation of the underlying graph structure and on ideas of Gill et al.\ [ Math. Comp., 28 (1974), pp. 505--535] for modifying a dense Cholesky factorization. We show that our methods extend to the general case where an arbitrary sparse symmetric positive definite matrix is modified. Our methods are optimal in the sense that they take time proportional to the number of nonzero entries in ${\bf L}$ and ${\bf D}$ that change.
Wilms’ Tumor 1–Associating Protein Regulates the Proliferation of Vascular Smooth Muscle Cells

Smooth muscle cells (SMCs) are called on to proliferate during vascular restructuring but must return to a nonproliferative state if remodeling is to appropriately terminate. To identify mediators of the reacquisition of replicative quiescence, we undertook gene expression screening in a uniquely plastic human SMC line. As proliferating SMCs shifted to a contractile and nonproliferative state, expression of TIMP-3, Axl, and KIAA0098 decreased whereas expression of complement C1s, cathepsin B, cellular repressor of E1A-activated genes increased. Wilms’ tumor 1-associating protein (WTAP), a nuclear constituent of unknown function, was also upregulated as SMCs became nonproliferative. Furthermore, WTAP in the intima of injured arteries was substantially upregulated in the late stages of repair. Introduction of WTAP complementary DNA into human SMCs inhibited their proliferation, with a corresponding decrease in DNA synthesis and an increase in apoptosis. Knocking down endogenous WTAP increased SMC proliferation, because of increased DNA synthesis and G1/S phase transition, together with reduced apoptosis. WTAP was found to associate with the Wilms’ tumor-1 protein in human SMCs and WTAP overexpression inhibited the binding of WT1 to an oligonucleotide containing a consensus WT1 binding site, whereas WTAP knockdown accentuated this interaction. Expression of the WT1 target genes, amphiregulin and Bcl-2, was suppressed in WTAP-overexpressing SMCs and increased in WTAP-deficient SMCs. Moreover, exogenous amphiregulin rescued the antiproliferative effect of WTAP. These findings identify WTAP as a novel regulator of the cell cycle and cell survival and implicate a WTAP-WT1 axis as a novel pathway for controlling vascular SMC phenotype.
A Monte-Carlo algorithm for path planning with many degrees of freedom

A stochastic technique is described for planning collision-free paths of robots with many degrees of freedom (DOFs). The algorithm incrementally builds a graph connecting the local minima of a potential function defined in the robot's configuration space and concurrently searches the graph until a goal configuration is attained. A local minimum is connected to another one by executing a random motion that escapes the well of the first minimum, succeeded by a gradient motion that follows the negated gradient of the potential function. All the motions are executed in a grid shown through the robot's configuration space. The random motions are implemented as random walks which are known to converge toward Brownian motions when the steps of the walks tend toward zero. The local minima graph is searched using a depth-first strategy with random backtracking. In the technique, the planner does not explicitly represent the local-minima graph. The path-planning algorithm has been fully implemented and has run successfully on a variety of problems involving robots with many degrees of freedom. <<ETX>>
Joint Power Allocation at the Base Station and the Relay for Untrusted Relay Cooperation OFDMA Network

The secure communication that multiple OFDMA-based cell-edge mobile stations (MS) can only transmit confidential messages to base station (BS) through an untrusted intermediate relay (UR) is discussed. Specifically, with the destination-based jamming (DBJ) scheme and fixed MS transmission power assumption, our focus is on the joint BS and US power allocation to maximize system sum secrecy rate. We first analyze the challenges in solving this problem. The result indicates that our nonconvex joint power allocation is equivalent to a joint MS access control and power allocation. Then, by problem relaxation and the alternating optimization approach, two suboptimal joint MS access control and power allocation algorithms are proposed. These algorithms alternatively solve the subproblem of joint BS and UR power allocation and the subproblem of MS selection until system sum secrecy rate is nonincreasing. In addition, the convergence and computational complexity of the proposed algorithms are analyzed. Finally, simulations results are presented to demonstrate the performance of our proposed algorithms.
FCScan: A New Lightweight and Effective Approach for Detecting Malicious Content in Electronic Documents

Electronic documents, such as PDF and Microsoft Office documents, have become an ubiquitous attack vector in recent years, especially in complex attacks performed by Advanced Persistent Threats. Current security measures are not effective in protecting users and endpoints, either because they are based on static checks and analysis that attackers can bypass and circumvent, or because they require CPUintensive analysis that is usually off-loaded on external systems, which cannot replicate all of the actual parameters of the intended victim. We present a lightweight analysis system that can perform effective detection of malware in electronic documents in real-time and at the endpoint. To show the effectiveness of our approach, we have implemented and tested a prototype based on the ubiquitous Adobe Acrobat Reader.
The logarithmic hypervolume indicator

It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new "logarithmic hypervolume indicator" and prove that it achieves a close-to-optimal multiplicative approximation ratio. This is experimentally verified on several benchmark functions by comparing the approximation quality of the multi-objective covariance matrix evolution strategy (MO-CMA-ES) with the classic hypervolume indicator and the MO-CMA-ES with the logarithmic hypervolume indicator.