Miracle-dz/UniFAR-FTUs huggingface dataset:
Une Approche Possibiliste pour la Recherche d’Information

Ce papier décrit une nouvelle approche pour un modèle de Recherche d'Information. Cette approche traduit à travers des réseaux Bayésiens naïfs des relations de dépendance entre les documents et les termes d'indexation quantifiables par deux mesures : la possibilité et la nécessité. Le processus de recherche restitue les documents plausiblement ou nécessairement pertinents à un besoin utilisateur. Ce besoin utilisateur est vu comme une nouvelle information à propager dans les réseaux.
A Pilot Study: Deriving a Users' Goal Framework from a Corpus of Interviews and Diaries

This paper describes pilot work in which we explore the feasibility of deriving a goal framework for the potential users of applications employing a grounded theory method based on a corpus of empirical data. The issue of developing and applying human goal frameworks has been studied in a number of areas, such as artificial intelligence and information seeking. But most existing goal frameworks are either constrained to a few information search related goals or mainly reflect highly abstract psychological motivations, and hence are not readily applicable to the applications which need to deal with complex practical users’ goals. In this study, we employ corpus-based approach for goal framework development, and identify goal concepts and analyse semantic relations among them based on a collection of interview and diary transcripts. We suggest that our approach provides a feasible way of deriving goal frameworks for practical purposes as the corpus data tend to closely reflect the users’ concrete requirements. Furthermore, our study reveals the need for more corpus resources for human goal analysis and automatic detection.
Towards an explicit-state model checkingframework

In the field of formal verification we use model checkers to verify models of systems against a specification. Often these model checkers are specialised for a a limited number of model specification languages, property specifications and verification algorithms. The purpose-built nature of these tools results in poor reusability, and in order to achieve optimisations the source code is generally not modular. As a result new tools are often developed from scratch and interoperability of tools is minimal. This thesis presents a conceptual architecture for a framework to support these tools. This architecture is based on a layered design. A generic layer is to provide generic functionality for the simulation, testing and verification of models. An abstract layer provides a model implementation, such that it can use the functionality in the generic layer. Finally, a tool layer maps a particular model specification language to the abstract layer. The conceptual architecture has the objective to support reuse of code and to encourage a modular design in tools. Besides the conceptual architecture, we also introduce a framework in the sense of a library. The design of this libary introduces an implementation of the conceptual architecture for explicitstate model checking. Firstly, a generic layer for explicit-state model checking with generic simulation and verification functionality is discussed. This generic layer uses type abstraction to abstract from the types of states, labels and transitions in the state spaces of the models. Similarly, an abstract layer is introduced which uses a state representation based on graphs. We use the generic and abstract layer to model check PROM + models. PROM + is based on a minimalistic version of PROMELA, but adds the notion of shared pointer variables and dynamic object allocation. Although the framework offers the flexibility and modularity for which is was made, the required verification time of the tool is significantly slower than SPIN. This can be ascribed to some design decisions that were made to make the framework more flexible. In particular this is the use of reference counting pointers and the design of the search module in the generic layer, and expensive operations in the abstract layer, such as linearisation and copying of the state graphs. However, the statevector size achieved in our tool is generally smaller than those in SPIN using default settings and without any optimisations. This implies that potentially our tool is competitive with SPIN in terms of memory usage. Finally, the graph-based state representation enables the exploitation of symmetry reductions in the model. Thread-symmetry is exploited by means of a small change in the state linearisation procedure. This significantly reduces the number of visited states and only poses little overhead.
An Introduction to SQL Injection Attacks for Oracle Developers

The Information contained in this document includes information derived from various third parties. While the Information contained in this document has been presented with all due care, Integrigy Corporation does not warrant or represent that the Information is free from errors or omission. The Information is made available on the understanding that Integrigy Corporati on and its employees and agents shall have no liability (including liability by reason of negligence) to the users for any loss, damage, cost or expense incurred or arising by reason of any person using or relying on the information and whether caused by reason of any error, negligent act, omission or misrepresentation in the Information or otherwise. Furthermore, while the Information is considered to be true and correct at the date of publication, changes in circumstances after the time of publication may impact on the accuracy of the Information. The Information may change without notice. Integrigy, AppSentry, and AppDefend are trademarks of Integrigy Corporation. Oracle is a registered trademark of Oracle Corporation and/or its affiliates. Other names may be trademarks of their respective owners. Most application developers underestimate the risk of SQL injections attacks against applications that use Oracle as the back-end database. Our audits of custom web applications show many application developers do not fully understand the risk of SQL injection attacks and simple techniques used to prevent such attacks. This paper is intended for application developers, database administrators, and application auditors to highlight the risk of SQL injection attacks and demonstrate why web applications may be vulnerable. It is not intended to be a tutorial on executing SQL attacks and does not provide instructions on executing these attacks. SQL injection is a basic attack used either to gain unauthorized access to a database or to retrieve information directly from the database. The basic principles underlying SQL injection are simple and these types of attacks are easy to execute and master. Any program or application may be vulnerable to SQL injection including stored procedures executed with a direct database connection, Oracle Forms applications, web applications, etc. Numerous SQL injection vulnerabilities have been found in the standard Oracle Database packages such as DBMS_DATAPUMP, DBMS_REGISTRY, and DBMS_METADATA (see Oracle Critical Patch Update January 2006). Web applications are at highest risk to attack since often an attacker can exploit SQL injection vulnerabilities remotely without any database or application authentication. Web applications using Oracle as a back-end database …
Data attribute reduction using binary conversion

While learning with data having large number of attribute, a system is easy to freeze or shut down or run for a long time. Therefore, the proposed Binary Conversion (BC) is a novel method to solve this kind of large attribute problem in machine learning. The purpose of BC is to reduce data dimensions by a binary conversion process. All the attributes are reserved but combined into few numbers of new attributes instead of that some attributes are removed. To prevent the information loss problem during the conversion, each binary type data value occupies its own digital position in BC. In addition, 4 data sets: nbuses, ACLP, MONK3, and Buseskod data are used in this study to test and compare the learning accuracies and learning time. The results indicate that the proposed BC can keep about the same level of accuracy but increase the learning efficiency.
XML Schema Part 0: Primer Second Edition

XML Schema Part 0: Primer is a non-normative document intended to provide an easily readable description of the XML Schema facilities, and is oriented towards quickly understanding how to create schemas using the XML Schema language. XML Schema Part 1: Structures and XML Schema Part 2: Datatypes provide the complete normative description of the XML Schema language. This primer describes the language features through numerous examples which are complemented by extensive references to the normative texts. Status of this document This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/. This is a W3C Recommendation, the first part of the Second Edition of XML Schema. This document has been reviewed by W3C Members and other interested parties and has been endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material. W3C's role in making the Recommendation is to draw attention to the specification and to promote its widespread deployment. This enhances the functionality and interoperability of the Web. This document has been produced by the W3C XML Schema Working Group as part of the W3C XML Activity. The goals of the XML Schema language are discussed in the XML Schema Requirements document. The authors of this document are the members of the XML Schema Working Group. Different parts of this specification have different editors. This document was produced under the 24 January 2002 Current Patent Practice (CPP) as amended by the W3C Patent Policy Transition Procedure. The Working Group maintains a public list of patent disclosures relevant to this document; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) with respect to this specification should disclose the information in accordance with section 6 of the W3C Patent Policy. The English version of this specification is the only normative version. Information about translations of this document is available at http://www.w3.org/2001/05/xmlschema-translations. This second edition is not a new version, it merely incorporates the changes dictated by the corrections to errors found in the first edition as agreed by the XML Schema Working Group, as a convenience to readers. A separate list of all such corrections is available at http://www.w3.org/2001/05/xmlschema-errata. The errata list for this second edition is available at http://www.w3.org/2004/03/xmlschema-errata. Please report errors in this document to www-xml-schema-comments@w3.org (archive). XML Schema Part 0: Primer ii
Productique et IAA: une approche socio-économique

[eng] At its use was spreading, from the very beginning of the 80s, the term « Productics » saw its content broaden. Strongly marked by industrial automation and data processing technologies, which it is born of, productics analysis was progressively enriched with economics, science of management and sociology contributions ; this shows what transformations extent « Productics » introduce into the way of thinking productive systems. Some food industries specifities, into which these technologies and management procedures are slowly making their way, allow to put forward some hypothesis as to the way of analysing them. [fre] A mesure que son usage se repandait, a partir du debut des annees 1980, le terme « Productique » a vu son contenu s'elargir. Fortement marquee par les technologies de l'automatique et de l'informatique industrielles dont elle est issue, l'analyse de la productique s'est enrichie progressivement des apports de l'economie, de la gestion et de la sociologie ; c'est le signe de l'ampleur des mutations qu'elle introduit dans la maniere de penser les systemes productifs. Certaines specificites des industries agro-alimentaires, ou ces technologies et procedures de gestion penetrent lentement, permettent d'avancer quelques hypotheses quant a la maniere de les analyser.
Les processus métiers: Concepts, modèles et systèmes

Les processus metiers constituent de plus en plus la colonne vertebrale des systemes d'information modernes. Ils sont au cœur de la reorganisation des entreprises pour une meilleure integration de leurs departements et de leurs personnels. Ils simplifient leur deploiement sur le web et supportent les cooperations interentreprises. Cet ouvrage a destination d'un large public (etudiants, ingenieurs chercheurs) fait le point sur l'idee de processus metier. Il en etablit les concepts fondamentaux, presente les principales notations utilisees (BPMN, XPDL, etc.), des elements de conception et d'analyse (Petri Nets, UML, decouverte de processus, Business Process Intelligence, etc.), illustre les architectures des systemes de gestion de processus (integrees : Nova Bonita, bibliotheques : Process Virtual Machine, etc.), la problematique des processus transactionnels et leur deploiement sur le web (modes de cooperations, services web, WSBPEL, etc.). La plupart des chapitres sont illustres par exemples et proposent des exercices.
Symbolic Circuit Modeling and Simulation Using a Sparse Matrix: An Introduction

The first part of this article introduces some basic concepts and briefly contrasts electronic circuit modeling with circuit analysis. Then a sparse matrix generalized circuit model is built from first principles by means of an example. Finally, examples of symbolic modeling and simulation for the purposes of theorem development and circuit design validity checking are presented. Note that in this article we will be considering linear circuit elements only.
Systolic multiplier for finite fields gf(2/sup m/)

A systolic architecture is developed for performing the product-sum computation, ab+c, in the finite field gf(2/sup m/) of 2/sup m/ elements, where a, b and c are arbitrary elements of gf(2/sup m/). The multiplier is a serial-in, serial-out, one-dimensional systolic array. This multiplier for gf(2/sup m/) requires m basic cells. The average time per computation of the multiplier is m time units if a number of computations are computed consecutively. To perform an isolated computation the multiplier requires 3m time units. The architecture is simple and regular and possesses the desirable properties of concurrency and modularity and is well suited for use. 10 references.
Johann Nikolaus Forkel on the Listening Practices of ‘Kenner’ and ‘Liebhaber’

The once influential idea that special authority resides in the perceptions of the 'expert' listener who attends to music's immanent formal relationships has recently been much contested. A little-known early stage in its history is found in the writings of the music historian Johann Nikolaus Forkel (1749-1818). His account of expert and inexpert listening practices was shaped by his experiences as director of the concert series at the University of Gottingen, his conviction that musical culture had suffered a sharp decline since the days of J. S. Bach, and his knowledge of eighteenth-century aesthetics. A trenchant critic of complacency on the part of the musical amateur, Forkel set about educating the public through free, open lectures in music theory. Although his efforts met with only limited success, his attitudes, which would gain ground in subsequent generations, are worthy of attention.
Arousal Decrease in Sleeping Beauty: Audiences' Neurophysiological Correlates to Watching a Narrative Dance Performance of two-and-a-half hours

Watching dance is a multisensory experience. In dance, movements are intertwined with music and/or sound, costumes, the narrative, light and stage design. Recent studies have found neuroscientific evidence that a dance audience processes visual and auditory information, while mentally simulating and/or mirroring the movements. In other words, when spectators passively observe movements, their brain shows enhanced activity in areas that are also activated if they were executing the movements themselves. This paper presents an unusual exemplar of a scientific study in which motor simulation was measured in an emotionally and kinaesthetically loaded real life setting. The study illustrates two main points: 1) real-life conditions matter because they change the results and call into question the validity of laboratory based experimental conditions for research which is making claims about lived experience outside the laboratory and 2) new hypotheses emerged about the effects that the length of time spent watc.
Generalized System Model of an Overlay Environment

An apparatus for wastewater treatment, includes a calorie reducer first vessel having an inlet and an outlet, the outlet adapted to control the retention time of wastewater within the first vessel. A first recycle pump is connected to the first vessel to recycle wastewater from a bottom of the first vessel to a top of the first vessel through a recycle conduit, at a high velocity. The recycle conduit provides an air gap for drawing air into the first vessel. Bacteria within the calorie reducer vessel consume biodegradable food with a minimum number of bacteria while in the log growth phase. A second bio-reducer vessel is connected to the calorie reducer vessel. The bio-reducer holds a media supported above a bottom reservoir. A bio-reducer recycle pump recycles wastewater within the reservoir to be sprayed onto a top of the bio-reducer, to wash over the media. Further bio-reducers can be arranged downstream of the first bio-reducer. In the bio-reducers, protozoa attached to the media consume the bacteria which wash over the media.
Offline Data and Synchronization for a Mobile Backend as a Service system

Because of the increase in the number of connected devices used, developers are increasingly building mobile applications. These applications primarily connect users to information that comes from the internet. Mobile Backend as a Service ((M)BaaS) providers started providing developers with hosted backends that are easy to set up and can be used to store data for the application. Mobile connections are not always reliable or available. Therefore the developer needs to do significant work to make the application work under these conditions. Hosted backends allows for the opportunity to offer a solution for the unreliable connection problem as part of their software development kits (SDK). In this thesis we design a model for an (M)BaaS system to offer offline data and synchronization support, while preserving as much of the functionality that is offered by such a system. In addition, the model offers flexible conflict resolution and optimal use of data stored offline. The model is implemented on top of Windows Azure Mobile Service (WAMS), which is the (M)BaaS system offered by Microsoft. This implementation shows that the model works and that it can be successfully applied to an (M)BaaS system. Our main contributions are a synchronization model for an (M)BaaS system, including an implementation that can be used with the existing WAMS . NET SDK on the Windows platform, the flexible conflict resolution options and the ability to answer queries locally using the cached data from other requests.
Software Quality Assurance for Fortran 90 - A Survey of Available Tools

This report provides a survey of some of the software tools currently available to assist in the development of Fortran programs using the new 1990 and 1995 standards. A few tools also address the development of High Performance Fortran (HPF). This report is particularly concerned with tools which will enhance the quality of software developed. We have not looked at tools which focus on the high level design and requirements analysis, since these are often common to many languages. Instead we have concentrated on tools that help in the detection of programming errors and highlight poor practice, such as “spaghetti” style coding. At present, there appear to be few such tools available for the new Fortran standard. However, many Fortran 90 compilers can provide quite extensive compile and run time checks and some examples of these are also discussed.
Language Processing with Weighted Transducers

Les automates et transducteurs pondérés sont utilisés dans un éventail d’applications allant de la reconnaissance et synthèse automatiques de la langue à la biologie informatique. Ils fournissent un cadre commun pour la représentation des composants d’un système complexe, ce qui rend possible l’application d’algorithmes d’optimisation généraux tels que la déterminisation, l’élimination des mots vides, et la minimisation des transducteurs pondérés.
Multiple knowledge acquisition strategies in MOLTKE

In this paper we will present a design model (in the sense of KADS) for the domain of technical diagnosis. Based on this we will describe the fully implemented expert system shell MOLTKE 3.0, which integrates common knowledge acquisition methods with techniques developed in the fields of Model-Based Diagnosis and Machine Learning, especially Case-Based Reasoning.
Dynamic walking pattern generation for a humanoid robot based on optimal gradient method

Describes a method in which walking patterns based on the ZMP (zero moment point) are generated by a simple search algorithm; OGM (optimal gradient method). This approach has advantages in algorithmic simplicity and height generality. First, the designer gives prescribed time trajectories of both feet, hands and a reference of ZMP. Second, initial trajectories of a trunk are determined on the basis of a static walk. Finally OGM optimizes the horizontal motion of a trunk to reduce the deviation of the calculated ZMP from its reference. The same algorithms can be applied to the problems of yaw moment compensation around ZMP and shock compensation between soles and the ground by changing the objective function of OGM. The proposed method could generate various dynamic walking patterns such as steps forward, backward and aside or turning, and stable walks on the life-size humanoid 'H5' were realized by applying them to it.
An Intel Cilk plus based task tree executor architecture

The goal of this paper is to optimize system performance of a SOA-based critical infrastructure by modifying the architecture of the service component that is responsible for complex calculations on large-scale graph models, under soft real-time restrictions. On a request, this service component transforms a system model into a task tree, which then gets executed by the runtime library that is referred to as the Task Tree Executor (TTE). The strategy that was used to optimize the system performance was to introduce finer grained parallelism, thus better multicore CPU utilization. The result is a novel TTE architecture that executes TTE tasks as Intel Cilk Plus tasks rather than OS threads, which was the case for the previous TTE architecture. The experimental measurements of time needed for TTE reliability estimation, based on statistical usage tests, show that the novel TTE architecture provides the speedup of around 11x, on average, over the previous one. Although this paper deals with a particular SOA service component, it may serve as a case study demonstrating applicability of our strategy on a broader class of SOA-based systems.