pinecone/core-2020-05-10-deduplication huggingface dataset:
Modeling 1D distributed-memory dense kernels for an asynchronous multifrontal sparse solver

To solve sparse systems of linear equations, multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel asynchronous setting in which several frontal matrices can be factored simultaneously. In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of left and right-looking variants of partial \(LU\) decompositions, study the use of several levels of blocking, before focusing on communication issues. The general purpose sparse solver MUMPS has been modified to implement the proposed algorithms and confirm the properties demonstrated by the models
Automatic Streamization of Image Processing Applications

International audienceNew many-core architectures such as the Kalray MPPA-256 provide energy-efficiency and high performance for embedded systems. However, to take advantage of these opportunities, careful manual op-timizations are required. We investigate the automatic streamization of image processing applications, implemented in C on top of a dedicated API, onto this target accessed through the ΣC dataflow language. We discuss compiler and runtime design choices and their impact on perfor-mance. Our compilation techniques are implemented as source-to-source transformations in the PIPS open-source compilation framework. Ex-periments show lowest energy consumption on the Kalray MPPA target compared to other hardware targets for a range of 8 test applications
Functional interior point programming applied to the aircraft path planning problem

International audienceMultiple aircraft trajectory planning is a central problem in future air traf-fic management concepts where some part of the separation task, currently assumed by human controlers, will be delegated to onboard automated systems. Several ap-proaches have been taken to address it and fall within two categories: meta-heuristic algorithms or deterministic methods.The framework proposed here models the plan-ning problem as a optimization program in a space of functions with constraints ob-tained by semi-inifinite programming. A specially designed innovative interior point algorithm is used to solve it
A New Observer for Range Identification in Perspective Vision Systems

International audienceAutomatic guidance of flying vehicle usually needs external information. GPS (Global Positionning System) is a worldwide technology which provides to the guided system its deviations with respect to its guidance objective. Nevertheless, this technology is not available everywhere (indoor evironment), everytime (in case of failure) and not precise enough to ensure critical operations as landing a civil aircraft. Current civil aircraft are able to land autonomously on a runway thanks to ILS (Instrument Landing System) or differential GPS. However, these equipment are expensive and can fail. In frame of the future aircraft, manufacturers like AIRBUS company study the possibility to make aircraft landing everywhere (unequipped or unknown runway) without using informations from external systems
Behavior Trees with Stateful Tasks

The behavior tree formalism as introduced recently to the application of mission management of unmanned aerial vehicles does provide for internal memory of mission plans. This is an important drawback for even simple plans such as waypoint sequences, because the information about visited waypoints must be stored outside of the plan execution engine. In this paper, two approaches are presented in order to provide tasks with states inside behavior trees: The first allows to embed regular state machines in a specialized behavior tree task. The second provides new memory and reset tasks in order to store information directly in the tree. Both approaches are shown to solve the waypoint following plan and promise to be applicable to a much broader range of mission management problems
Compositional Verification of Parameterised Timed Systems

International audienceIn this paper we address the problem of uniform verification of parameterised timed systems (PTS): " does a given safety state property hold for a system containing n identical timed components regardless of the value of n? ". Our approach is compositional and consequently it suits quite well such systems in that it presents the advantage of reusing existing local characterisations at the global level of system characteri-sation. Additionally, we show how a direct consequence of the modelling choices adopted in our framework leads to an elegant application of the presented method to topologies such as stars and rings
Numerical and Experimental Approach in Assisted Cryogenic Machining

Understanding of local mechanisms chip forming during machining by removal of material is difficult, to this end; a cutting finite element modelling is required. This study aims initially to model orthogonal cutting of Ti17 titanium alloy in dry and cryogenic machining and in a second time to study the influence of the application of cryogen during machining on temperature fields and cutting forces in numerical simulation. An experimental study was also conducted to determine the mode of tool wear and the evolution of flank wear
Dynamic Amplification of an Orthotropic, Multi Span Bridge Deck under Moving Truck with Tandem Axles

Vehicles crossing bridges at high speeds can cause significant dynamic effects and must be studied by accurately simulating the interactive, dynamic responses of the bridge deck and the load-applying vehicles. Specifically,   multi- span, orthotropic, bridge deck during truck loading is investigated to better understand the dynamic interaction between moving vehicles with tandem axles and highway bridge decks. The vehicle is modeled by a three-dimensional dynamic system with tandem axles with 9 degrees of freedom. The bridge deck is modeled by a thin, orthotropic, multi-span plate. The road surface irregularities are modeled by a random function characterized by a spectral roughness coefficient and power spectral density. The modal method is used to solve the equation of motion of the bridge deck. Equations of motion of the vehicle are obtained using a virtual work principle. The coupled equations of motion vehicle/bridge deck are integrated numerically by Newmark’s method. A computational algorithm in FORTRAN is used to solve the integrated equations of motion in a decoupled, iterative process. A numerical example of an orthotropic, three-span bridge deck, excited in nine degrees of freedom truck is presented. The resulting distribution of the Dynamic Amplification Factor on the bridge deck does not reflect any particular trend, because high values of the DAF can be obtained at points where the vertical displacement is small. The DAF is significant only under the interaction force. Thus, the road surface roughness had a significant influence on the dynamic vehicle/bridge deck interaction forces
Model as you do : engaging an S-BPM vendor on process modelling in 3D virtual worlds

Accurate process model elicitation continues to be a time consuming task, requiring skill on the part of the interviewer to extract explicit and tacit process information from the interviewee. Many errors occur in this elicitation stage that would be avoided by better activity recall, more consistent specification methods and greater engagement in the elicitation process by interviewees. Metasonic GmbH has developed a process elicitation tool for their process suite. As part of a research engagement with Metasonic, staff from QUT, Australia have developed a 3D virtual world approach to the same problem, viz. eliciting process models from stakeholders in an intuitive manner. This book chapter tells the story of how QUT staff developed a 3D Virtual World tool for process elicitation, took the outcomes of their research project to Metasonic for evaluation, and finally, Metasonic’s response to the initial proof of concept
Hagedorn's Hadron Mass Spectrum and the Onset of Deconfinement

A brief history of the observation of the onset of deconfinement - the
beginning of the creation of quark gluon plasma in nucleus-nucleus collisions
with increasing collision energy - is presented. It starts with the measurement
of hadron mass spectrum and the Hagedorn's hypothesis of the limiting
temperature of hadronic matter (the Hagedorn temperature). Then the conjecture
that the Hagedorn temperature is the phase transition temperature was
formulated with the crucial Hagedorn participation. It was confirmed by the
observation of the onset of deconfinement in lead-lead collisions at the CERN
SPS energies.Comment: arXiv admin note: substantial text overlap with arXiv:1201.048
A New Phase of Matter: Quark-Gluon Plasma Beyond the Hagedorn Critical
  Temperature

I retrace the developments from Hagedorn's concept of a limiting temperature
for hadronic matter to the discovery and characterization of the quark-gluon
plasma as a new state of matter. My recollections begin with the transformation
more than 30 years ago of Hagedorn's original concept into its modern
interpretation as the "critical" temperature separating the hadron gas and
quark-gluon plasma phases of strongly interacting matter. This was followed by
the realization that the QCD phase transformation could be studied
experimentally in high-energy nuclear collisions. I describe here my personal
effort to help develop the strangeness experimental signatures of quark and
gluon deconfinement and recall how the experimental program proceeded soon to
investigate this idea, at first at the SPS, then at RHIC, and finally at LHC.
As it is often the case, the experiment finds more than theory predicts, and I
highlight the discovery of the "perfectly" liquid quark-gluon plasma at RHIC. I
conclude with an outline of future opportunities, especially the search for a
critical point in the QCD phase diagram.Comment: To appear in {\em Melting Hadrons, Boiling Quarks} by Rolf Hagedorn
  and Johan Rafelski (editor), Springer Publishers, 2015 (open access
The Legacy of Rolf Hagedorn: Statistical Bootstrap and Ultimate
  Temperature

In the latter half of the last century, it became evident that there exists
an ever increasing number of different states of the so-called elementary
particles. The usual reductionist approach to this problem was to search for a
simpler infrastructure, culminating in the formulation of the quark model and
quantum chromodynamics. In a complementary, completely novel approach, Hagedorn
suggested that the mass distribution of the produced particles follows a
self-similar composition pattern, predicting an unbounded number of states of
increasing mass. He then concluded that such a growth would lead to a limiting
temperature for strongly interacting matter. We discuss the conceptual basis
for this approach, its relation to critical behavior, and its subsequent
applications in different areas of high energy physics.Comment: 25 pages, 5 figures; to appear in R. Hagedorn and J. Rafelski (Ed.),
  "Melting Hadrons, Boiling Quarks", Springer Verlag 201
Distributed Block Coordinate Descent for Minimizing Partially Separable
  Functions

In this work we propose a distributed randomized block coordinate descent
method for minimizing a convex function with a huge number of
variables/coordinates. We analyze its complexity under the assumption that the
smooth part of the objective function is partially block separable, and show
that the degree of separability directly influences the complexity. This
extends the results in [Richtarik, Takac: Parallel coordinate descent methods
for big data optimization] to a distributed environment. We first show that
partially block separable functions admit an expected separable
overapproximation (ESO) with respect to a distributed sampling, compute the ESO
parameters, and then specialize complexity results from recent literature that
hold under the generic ESO assumption. We describe several approaches to
distribution and synchronization of the computation across a cluster of
multi-core computers and provide promising computational results.Comment: in Recent Developments in Numerical Analysis and Optimization, 201
Game Learning Analytics: Learning Analytics for Serious Games

Video games have become one of the largest entertainment industries, and their power to capture the attention of players worldwide soon prompted the idea of using games to improve education. However, these educational games, commonly referred to as serious games, face different challenges when brought into the classroom, ranging from pragmatic issues (e.g. a high development cost) to deeper educational issues, including a lack of understanding of how the students interact with the games and how the learning process actually occurs. This chapter explores the potential of data-driven approaches to improve the practical applicability of serious games. Existing work done by the entertainment and learning industries helps to build a conceptual model of the tasks required to analyze player interactions in serious games (gaming learning analytics or GLA). The chapter also describes the main ongoing initiatives to create reference GLA infrastructures and their connection to new emerging specifications from the educational technology field. Finally, it explores how this data-driven GLA will help in the development of a new generation of more effective educational games and new business models that will support their expansion. This results in additional ethical implications, which are discussed at the end of the chapter.This study is part of the RAGE project. The RAGE project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 644187.  This publication reflects only the author's view. The European Commission is not responsible for any use that may be made of the information it contains
Towards a Cognitive Theory of Multimedia Assessment (CTMMA)

Much is known about assessment in all its forms and the corpus of theory and knowledge is growing daily. In a similar vein, the use of multimedia for learning also has a sound basis in research and theory, such as the Cognitive Load Theory (CLT; Sweller, Van Merriënboer, & Paas, 1998), human information processing (e.g., Atkinson & Shiffrin, 1968; Miller, 1956; Paivio, 1986), and praxis in the form of evidence-informed design principles often based on the Cognitive Theory of Multimedia Learning (CTMML; Mayer, 2005b). However, the combination of the two lacks both theoretical underpinnings and practical design principles. Multimedia assessment (MMA) is, at best, either a translation of paper-based assessment and assessment principles to the computer screen or an attempt to make use of the theory and principles underlying multimedia learning (i.e., CTMML). And this is the problem. In the first place, MMA needs, just as Multimedia Learning (MML), its own theory and principles. Just as MML was not simply the translation of paper-based learning to the computer screen, MMA requires its own place. In the second place, the application of CTMML and its principles to assessment leads to problems. The CTMML is based upon the idea that learning should be facilitated by the proper use of CTMML principles and its underlying theories (CLT, Human Information Processing). In cognitive load terms: germane load is increased while extraneous load is avoided so as to facilitate effective and efficient learning. But the goal of assessment is not learner facilitation, but rather separating the wheat from the chaff. Those who do not possess the knowledge and skills need to not be able to answer the question while those who do have the knowledge and skills need to answer correctly. This may mean that certain forms of extraneous load need to be increased while germane load needs to be minimised. This chapter will kick off the road to a Cognitive Theory of Multimedia Assessment (CTMMA).N
An algorithm for constructing Hjelmslev planes

Projective Hjelmslev planes and affine Hjelmslev planes  are  generalisations of projective planes and affine planes. We present an algorithm for constructing   projective Hjelmslev planes and affine Hjelmslev planes  that uses projective planes, affine planes and  orthogonal arrays. We show that all 2-uniform projective Hjelmslev planes, and all 2-uniform affine Hjelmslev planes can be constructed in this way. As a corollary it is shown that all $2$-uniform affine Hjelmslev planes are sub-geometries of $2$-uniform projective Hjelmslev planes
Twin bent functions and Clifford algebras

This paper examines a pair of bent functions on $\mathbb{Z}_2^{2m}$ and their
relationship to a necessary condition for the existence of an automorphism of
an edge-coloured graph whose colours are defined by the properties of a
canonical basis for the real representation of the Clifford algebra
$\mathbb{R}_{m,m}.$ Some other necessary conditions are also briefly examined.Comment: 11 pages. Preprint edited so that theorem numbers, etc. match those
  in the published book chapter. Final post-submission paragraph added to
  Section 6. in "Algebraic Design Theory and Hadamard Matrices: ADTHM,
  Lethbridge, Alberta, Canada, July 2014", Charles J. Colbourn (editor), pp.
  189-199, 201
D-optimal matrices of orders 118, 138, 150, 154 and 174

We construct supplementary difference sets (SDS) with parameters
$(59;28,22;21)$, $(69;31,27;24)$, $(75;36,29;28)$, $(77;34,31;27)$ and
$(87;38,36;31)$. These SDSs give D-optimal designs (DO-designs) of
two-circulant type of orders 118,138,150,154 and 174. Until now, no DO-designs
of orders 138,154 and 174 were known. While a DO-design (not of two-circulant
type) of order 150 was constructed previously by Holzmann and Kharaghani, no
such design of two-circulant type was known. The smallest undecided order for
DO-designs is now 198. We use a novel property of the compression map to speed
up some computations.Comment: 14 pages. arXiv admin note: substantial text overlap with
  arXiv:1409.596
Periodic Golay pairs of length 72

We construct supplementary difference sets (SDS) with parameters
$(72;36,30;30)$. These SDSs give periodic Golay pairs of length 72. No periodic
Golay pair of length 72 was known previously. The smallest undecided order for
periodic Golay pairs is now 90. The periodic Golay pairs constructed here are
the first examples having length divisible by a prime congruent to 3 modulo 4.
The main tool employed is a recently introduced compression method. We observe
that Turyn's multiplication of Golay pairs can be also used to multiply a Golay
pair and a periodic Golay pair.Comment: 10 pages. arXiv admin note: substantial text overlap with
  arXiv:1408.611
Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction

We provide an approach to formally analyze the computational behavior of coroutines in Logic Programs and to compile these computations into new programs, not requiring any support for coroutines. The problem was already studied near to 30 years ago, in an analysis
and transformation technique called Compiling Control. However, this technique had a strong ad hoc flavor: the completeness of the analysis was not well understood and its symbolic evaluation was also very ad hoc. We show how Abstract Conjunctive Partial Deduction, introduced by Leuschel in 2004, provides an appropriate setting to redefine Compiling Control. Leuschel’s framework is more general than the original formulation, it is provably correct, and it can easily be applied for simple
examples. We also show that the Abstract Conjunctive Partial Deduction framework needs some further extension to be able to deal with more complex examples.status: publishe
The RISCOSS platform for risk management in open source software adoption

Managing risks related to OSS adoption is a must for organizations that need to smoothly integrate OSS-related practices in their development processes. Adequate tool support may pave the road to effective risk management and ensure the sustainability of such activity. In this paper, we present the RISCOSS platform for managing risks in OSS adoption. RISCOSS builds upon a highly configurable data model that allows customization to several types of scopes. It implements two different working modes: exploration, where the impact of decisions may be assessed before making them; and continuous assessment, where risk variables (and their possible consequences on business goals) are continuously monitored and reported to decision-makers. The blackboard-oriented architecture of the platform defines several interfaces for the identified techniques, allowing new techniques to be plugged in.Peer ReviewedPostprint (author’s final draft
Open source software ecosystems : towards a modelling framework

Open source software ecosystem modelling has emerged as an important research area in software engineering. Several models have been proposed to identify and analyse the complex relationships in OSS-ecosystems. However, there is a lack of formal models, methodologies, tool support, and standard notations for OSS-ecosystems. In this paper we propose a general framework for support the OSS-ecosystems modelling process. This framework will allow the representation, synthesis, analysis, evaluation, and evolution of OSS-ecosystems. Design science methodology is proposed to create several artefacts and investigating the suitability of these artefacts in the OSS-ecosystem context.Peer ReviewedPostprint (author's final draft
PHEN : parkinson helper emergency notification system using Bayesian Belief Network

Context-aware systems are used to aid users in their daily lives. In the recent years, researchers are exploring how context aware systems can benefit humanity through assist patients, specifically those who suffer incurable diseases, to cope with their illness. In this paper, we direct our work to help people who suffer from Parkinson disease. We propose PHEN, Parkinson Helper Engine Network System, a context-aware system that aims to support Parkinson disease patients on m any levels. We use ontology is for context representation and modeling. Then the ontology based context model is used to learn with Bayesian Belief network (BBN) which is beneficial in handling the uncertainty aspect of context-aware systems
OntoEnrich: A Platform for the Lexical Analysis of Ontologies

The content of the labels in ontologies is usually considered hidden semantics, because the domain knowledge of such labels is not available as logical axioms in the ontology. The use of systematic naming conventions as best practice for the design of the content of the labels generates labels with structural regularities, namely, lexical regularities. The structure and content of such regularities can help ontology engineers to increase the amount of machine-friendly content in ontologies, that is, to increase the number of logical axioms. In this paper we present a web platform based on the OntoEnrich framework, which detects and analyzes lexical regularities, providing a series of useful insights about the structure and content of the labels, which can be helpful for the study of the engineering of the ontologies and their axiomatic enrichment. Here, we describe its software architecture, and how it can be used for analyzing the labels of ontologies, which will be illustrated with some examples from our research studies