Miracle-dz/UniFAR-FTUs huggingface dataset:
Max-hashing fragments for large data sets detection

The standard way to detect known digital objects inside a stream of bytes consists in using a string matching algorithm initialized with a dictionary containing the objects to detect. Depending on the application, the algorithm may be implemented in software or with dedicated hardware, to speedup the processing. Nevertheless, such approach requires an automaton with a complexity that is linear in the size of the dictionary. Large dictionaries result in large automatons that must be stored in high-latency memories, therefore limiting the processing speed. We propose a fast algorithm tailored to FPGA implementation to detect the transfer of known digital objects from their fragments. For illustrative purpose, the algorithm is applied to the detection of more than 100 000 known JPEG files by just inspecting the IP packets captured during an FTP transfer. Results demonstrate excellent true/false positive rates with nearly no limit on the number of objects to detect and the transfer rates.
Augmented Sketch: Faster and More Accurate Stream Processing

Approximated algorithms are often used to estimate the frequency of items on high volume, fast data streams. The most common ones are variations of Count-Min sketch, which use sub-linear space for the count, but can produce errors in the counts of the most frequent items and can misclassify low-frequency items. In this paper, we improve the accuracy of sketch-based algorithms by increasing the frequency estimation accuracy of the most frequent items and reducing the possible misclassification of low-frequency items, while also improving the overall throughput. Our solution, called Augmented Sketch (ASketch), is based on a pre-filtering stage that dynamically identifies and aggregates the most frequent items. Items overflowing the pre-filtering stage are processed using a conventional sketch algorithm, thereby making the solution general and applicable in a wide range of contexts. The pre-filtering stage can be efficiently implemented with SIMD instructions on multi-core machines and can be further parallelized through pipeline parallelism where the filtering stage runs in one core and the sketch algorithm runs in another core.
EHSTC: an enhanced method for semantic trajectory compression

The increasing of location aware mobile devices such as vehicle navigation equipment and smart phones has enabled the collection of massive trajectories data. Movement trajectory compression has become an urgent necessity to store these data. Traditional algorithms for trajectory compression are based on the location distribution of sampling points, and often lead to intolerable error with a high compression rate. In urban road network, the movements of vehicles are usually bounded by road network. An initial thought of how to make use of semantics in trajectory compression is to represent the compressed trajectory in road segments with the entry time and the leaving time information attached. However, the movement of moving object during the road is completely abandoned. This paper has proposed an algorithm named enhanced semantic trajectory compression (EHSTC) that compress trajectories based on road semantics as well as motion feature. During chunking sampling points in a road segment, those points with great motion feature changes will be detected and stored in the feature point list of underlying road segment. The experimental result on real trajectories demonstrates the effectiveness and efficiency of the proposed solution.
Phytotherapeutic effects of Echinacea purpurea in gamma-irradiated mice

Echinacea (E.) purpurea herb is commonly known as the purple coneflower, red sunflower and rudbeckia. In this paper, we report the curative efficacy of an Echinacea extract in γ-irradiated mice. E. purpurea was given to male mice that were divided into five groups (control, treated, irradiated, treated before irradiation & treated after irradiation) at a dose of 30 mg/kg body weight for 2 weeks before and after irradiation with 3 Gy of γ-rays. The results reflected the detrimental reduction effects of γ-rays on peripheral blood hemoglobin and the levels of red blood cells, differential white blood cells, and bone marrow cells. The thiobarbituric acid-reactive substances (TBARs) level, Superoxide dismutase (SOD) and glutathione peroxidase (GSPx) activities and DNA fragmentation were also investigated. FT-Raman spectroscopy was used to explore the structural changes in liver tissues. Significant changes were observed in the microenvironment of the major constituents, including tyrosine and protein secondary structures. E. purpurea administration significantly ameliorated all estimated parameters. The radio-protection effectiveness was similar to the radio-recovery curativeness in comparison to the control group in most of the tested parameters. The radio-protection efficiency was greater than the radio-recovery in hemoglobin level during the first two weeks, in lymphoid cell count and TBARs level at the fourth week and in SOD activity during the first two weeks, as compared to the levels of these parameters in the control group.
Study of Induction Programs for Beginning Teachers. Volume I. The Problems of Beginning Teachers: A Crisis in Training.

ABSTRACT In this first of four volumes reporting the findings of the study of induction programs for beginning teachers, the problems and issues covered by the study are discussed. A description is given of the methodology used in the study, and a series of recommendations for teacher educators and policymakers are offered. In the first chapter, the human experience of the transition period into teaching is considered. Chapter two provides the history, methods, and major recommendations of the study. Chapter three presents different perspectives on the problems facing the beginning teacher. In the fourth chapter, specific kinds of problems beginning teachers have are described. Approaches to solving the problems of beginning teachers is the topic of chapter five. In chapters six and seven, descriptions are given of selected internship and induction programs. Chapter eight describes and analyses policy problems in dealing with beginning teachers. Chapter nine describes the kinds of research needed to define the nature of the problems of beginning teachers. Recommendations and conclusions are offered in the final chapter. (JD)
User relationship analysis in campus based on WiFi Hotspots

With the rapid development of mobile Internet, the way users access the network becomes diverse, which provide much convenience for us to collect huge amount of users' information. In this paper, we present a model of measuring relationship between two users in campus and build a wireless data analysis system called WiCloud to verify our model. This work has several potential applications such as recommendation, advertisement targeting, and privacy protection. A novel method using decision tree model, which is usually used for decision analysis, is proposed to measure the relationship between two users in wireless network. Experiments results on real datasets validate our ideas and verify the feasibility and efficiency. Experimental results show that the accuracy of the training set is 100%, while the accuracy of the test set is 88.9%.
A 3D Audio Augmented Reality System for a Cultural Heritage Management and Fruition

One of the main features of the physical environment in which humans live is spatial dimensionality. When we think about 3D, we usually refer to 3D video, even if it is not the only existing channel of natural interaction. On the contrary, related work in the field of 3D audio mainly refers to the investigation of acoustic effects by adding reverberation in the context of virtual 3D environments. In this paper, we present an interaction system based on spatialized sounds. We developed an innovative cloud application in the cultural heritage context; a personal guide, in 3D sound, attracting the tourists' attention toward monuments or buildings, offering sound scapes of augmented reality. The designed system interacts with smart headphones that remotely takes the orientation of the listener's head and properly generates an audio output, which also takes into account the listener's position and orientation in the environment. Thus, such innovative headphones using an inertial measurement unit for determining the orientation of user's head have been designed and developed in open-ear mode, in order to locate the user in the real context.
Intersection graphs of segments and $\exists\mathbb{R}$

A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In this expository paper, we consider the algorithmic problem of testing whether a given abstract graph is an intersection graph of segments. It turned out that this problem is complete for an interesting recently introduced class of computational problems, denoted by $\exists\mathbb{R}$. This class consists of problems that can be reduced, in polynomial time, to solvability of a system of polynomial inequalities in several variables over the reals. We discuss some subtleties in the definition of $\exists\mathbb{R}$, and we provide a complete and streamlined account of a proof of the $\exists\mathbb{R}$-completeness of the recognition problem for segment intersection graphs. Along the way, we establish $\exists\mathbb{R}$-completeness of several other problems. We also present a decision algorithm, due to Muchnik, for the first-order theory of the reals.
Use of visual working memory in a manipulative task

We investigated the relationship between skill development and the use of prefrontal lobe using near-infrared spectroscopy (NIRS), a non-invasive method to measure brain activation. Activation of the dorsolateral prefrontal cortex (DLPFC) of the frontal lobe was observed especially in the right hemisphere when a human controlled a joystick and conducted a computerized mirror drawing task. This activation was more evident when the task involved the use of spatial working memory. The concentration of oxy- and total- hemoglobin generally decreased when a participant repeated and acquired the manipulative skill. It can be said that skill acquisition that involves spatial working memory can be certainly measured by activation of the prefrontal lobe using NIRS. These findings suggested that activation of the PFC could be used to assess the skill levels of visuo-memory tasks and provide information about assistance of working memory.
Should We Design for Control, Trust or Involvement?: A Discourses Survey about Children's Online Safety

Children are growing up in an increasingly digitalized world and concerns for their online safety picture in research and in public debate. We contribute to the discussion about children's online safety through a discourses survey on public discussions carried out in Finland 2014-2015. We reveal that discourses on control, trust and involvement permeate debates on children's online safety, and we argue that this has important implications on the means that we develop for ensuring children's online safety. While some control is needed, instead of risking to lose their children's trust through restricting or monitoring, parents may want to build a trusting relationship with their children so that they can trust children to make good decisions and that the children trust them. There is a need to build technical mediation that is transparent and facilitates building of trust.
A Welfare Consensus?Social Policy from Thatcher to Blair

Research Abstract A Welfare Consensus? Social Policy from Thatcher to Blair This thesis examines two central aspects of asset management by central government with special reference to health and education. First, it analyses the nature, structure and procedural legacy inherited by New Labour after eighteen years of Conservative control, and carries this analysis forward to determine the influence that this has on New Labour’s policy orientation. Second, with a view to the significance of institutionalist theories, which underline the potential importance of ‘path dependency’, the thesis seeks to determine what, if any, major policy differences developed with the transition from the Conservative governments of 1979-97 to the New Labour governments of 1997-2007. From a wealth of documentary evidence this thesis concludes that New Labour, throughout its ten years period in office, while it softened the well entrenched Thatcherite policies inherited it did not reform the core objectives of ‘rolling back the state’ which had led to the introduction of market-style competition designed to drive up standards, choice and availability accompanied by the driving down of unit costs. Over a time span of almost thirty years all governments have placed health and education as twin focal points of their policy initiatives. This thesis has therefore chosen these two political drivers as major examples of continuity and changes in social policy over that period, stretching from the late 20th century and into the 21st century. New Labour’s pragmatic acceptance in 1997 of its Thatcherite legacy with its compounded bipartisan approach led to a new welfare consensus coupled to enhanced strategic public expenditure priorities. In doing so, New Labour, under Blair, set aside its traditional, historical policies and embedded its own legacy so deeply into the economic fabric and culture of the UK that any future government, of whatever political persuasion will find the forward momentum of these policies powerful inhibitors of change. Thirty years of rolling back the state has achieved its outcome. John D Holland St Cuthbert’s Society School of Applied Social Sciences, Department of Sociology Durham University November 2009
An Adaptive and Flexible Fault Tolerance Mechanism Designed on Multi-behavior Agents for Wireless Sensor/Actuator Network

In the last few years, WSN has been object of an intense research activity that has determined an important improvement by technologic and computation point of view both. The notable level got and the increasing request of applications designed over Sensor Networks make WSN commercial diffusion next to be a fact. One of key issues for commercial diffusion of WSN is related to the robustness of architectures. An adaptive and flexible fault tolerant mechanism for WSN is proposed in the paper. Considering the tradeoffs between robustness and energy efficiency as central issue, a programming model based on multi-behavior agents that can guarantee an efficient, dynamic and extendible implementation is proposed too.
Scaling laws and fluctuations in the statistics of word frequencies

In this paper, we combine statistical analysis of written texts and simple stochastic models to explain the appearance of scaling laws in the statistics of word frequencies. The average vocabulary of an ensemble of fixed-length texts is known to scale sublinearly with the total number of words (Heaps’ law). Analyzing the fluctuations around this average in three large databases (Google-ngram, English Wikipedia, and a collection of scientific articles), we find that the standard deviation scales linearly with the average (Taylorʼs law), in contrast to the prediction of decaying fluctuations obtained using simple sampling arguments. We explain both scaling laws (Heaps’ and Taylor) by modeling the usage of words using a Poisson process with a fat-tailed distribution of word frequencies (Zipfʼs law) and topic-dependent frequencies of individual words (as in topic models). Considering topical variations lead to quenched averages, turn the vocabulary size a non-self-averaging quantity, and explain the empirical observations. For the numerous practical applications relying on estimations of vocabulary size, our results show that uncertainties remain large even for long texts. We show how to account for these uncertainties in measurements of lexical richness of texts with different lengths.
ALGORITHMS FOR GRAPHS ON SURFACES Foreword and introduction Foreword and introduction Foreword

Foreword These notes are certainly not in nal shape, and comments by e-mail are welcome. The course may depart from these notes both in content and presentation. It is strongly recommended to work on the exercises. Each exercise is labeled with one to three stars, supposed to be an indication of its importance (in particular, depending on whether it is used later), not of its diculty. Introduction This is an introduction to the computational aspects of surfaces and graphs drawn on them. This topic has been a subject of active research, especially over the last decade, and is related to rather diverse elds and communities: in computational geometry, surfaces arise naturally in various applications. Operations in geometric spaces such as decomposition, extraction of important features, and shortest path computation are basic computational geometry tasks that are relevant in particular for surfaces, usually embedded in R 3 , or even planar surfaces; in topology, the classication of surfaces, as discovered in the beginning of the 20th century, is inherently algorithmic. Surfaces play a prominent role in the deep theories of knots and three-manifolds; there are also many algorithmic questions in these areas; in graph algorithms, many general graph problems become easier when restricted to planar graphs (shortest path, ow and cut, minimum spanning trees, vertex cover, graph isomorphism, etc.). Graphs on surfaces stand in-between: to which extent do planar techniques apply? in graph theory, the theory of graph minors founded by Robertson and Seymour makes heavy use of graphs embeddable on a xed surface , as well as graphs excluding a xed minor. Edge-width and face-width are closely related to the notion of shortest non-contractible cycle. In addition, various computational tools are needed in applications handling surfaces, though we will not describe them in this course: in computer graphics, for texture mapping, morphing, and visualiza-tion; in mesh processing and numerical analysis, to remesh, simplify topo-logically, approximate, and compress a surface; in topological analysis, to build a hierarchical description of a shape, distinguish (un)signicant features, and compare topological features of two shapes (although this applies usually to higher-dimensional geometric data); in computer-aided geometric design (CAGD) and geometric modelling. This course is very far from surveying all these aspects. We aim at presenting recent results in computational geometry on this subject; for this purpose, many tools and concepts need to be introduced, which are of general interest. The rst chapter introduces planar graphs …
Association between Noninvasive Fibrosis Markers and Cardio-Vascular Organ Damage among Adults with Hepatic Steatosis

Evidence suggests that advanced fibrosis, as determined by the noninvasive NAFLD fibrosis score (NFS), is a predictor of cardiovascular mortality in individuals with ultrasonography-diagnosed NAFLD. Whether the severity of histology (i.e., fibrosis stage) is associated with more pronounced cardiovascular organ damage is unsettled. In this study, we analyzed the clinical utility of NFS in assessing increased carotid intima-media thickness (cIMT), and left ventricular mass index (LVMI). In this cross-sectional study NFS, cIMT and LVMI were assessed in 400 individuals with ultrasonography-diagnosed steatosis. As compared with individuals at low probability of liver fibrosis, individuals both at high and at intermediate probability of fibrosis showed an unfavorable cardio-metabolic risk profile having significantly higher values of waist circumference, insulin resistance, high sensitivity C-reactive protein (hsCRP), fibrinogen, cIMT, and LVMI, and lower insulin-like growth factor-1 (IGF-1) levels. The differences in cIMT and LVMI remained significant after adjustment for smoking and metabolic syndrome. In a logistic regression model adjusted for age, gender, smoking, and diagnosis of metabolic syndrome, individuals at high probability of fibrosis had a 3.9-fold increased risk of vascular atherosclerosis, defined as cIMT>0.9 mm, (OR 3.95, 95% CI 1.12–13.87) as compared with individuals at low probability of fibrosis. Individuals at high probability of fibrosis had a 3.5-fold increased risk of left ventricular hypertrophy (LVH) (OR 3.55, 95% CI 1.22–10.34) as compared with individuals at low probability of fibrosis. In conclusion, advanced fibrosis, determined by noninvasive fibrosis markers, is associated with cardiovascular organ damage independent of other known factors.
Toward Efficient Variant Calling Inside Main-Memory Database Systems

Mutations in genomes indicate predisposition for diseases or effects on efficacy of drugs. A variant calling algorithm determines possible mutations in sample genomes. Afterwards, scientists have to decide about the impact of these mutations. Certainly, many different variant calling algorithms exist that generate different outputs due to different sequence alignments as input and parameterizations of variant calling algorithms. Thus, a combination of variant calling results is necessary to provide a more complete set of mutations than single algorithm runs can provide. Therefore, a system is required that facilitates the integration and parameterization of different variant calling algorithms and processing of different sequence alignments. Moreover, against the backdrop of ever increasing amounts of available genome sequencing data, such a system must provide matured database management capabilities to enable flexible and efficient analyses while keeping data consistent. In this paper, we present a first approach to integrate variant calling into a main-memory database management system that allows for calling variants via SQL.
A Polynomial Time Jacobi Method for Lattice Basis Reduction

Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In this paper, we present a polynomial time Jacobi method for lattice basis reduction (short as Poly-Jacobi method) that can produce a reduced basis. Our experimental results indicate that the bases produced by Poly-Jacobi method have almost equally good orthogonality defect as the bases produced by the Jacobi method.
Confronting Threats to Meaning

We all have models of the world, and when these models fit with what goes on around us we have a sense of meaning. Unfortunately, we are often faced with situations that violate, or threaten, our models, and when this happens we attempt to resolve these inconsistencies to restore a sense of meaning. It is well documented that we often try to reduce threats in indirect ways—ways that, at first glance, seem to reduce the negative feelings without actually solving the problem. This article explores the possibility that threats can be interpreted in different ways depending on the person and context, and suggests that because of this, different threat reduction approaches can be adaptive in different situations. Specifically, it presents the hypothesis that concrete construal of threats should result in compensation efforts that are relatively direct, whereas abstract construals should expand the possibilities for compensation to include indirect strategies. It describes the existing evidence, where evidence is lacking, and potentially fruitful avenues of future exploration.