Miracle-dz/UniFAR-FTUs huggingface dataset:
Protection of animals at the time of killing

What is the problem under consideration? Why is government intervention necessary? The welfare of animals at slaughter or killing is currently protected by Directive 93/119. This has been implemented in England by the Welfare of Animals (Slaughter or Killing) Regulations 1995 and parallel legislation in Northern Ireland, Scotland and Wales. The proposed Regulation will replace the current EU and domestic legislative framework which the Commission considers is now out of date, folowing the introduction of new technologies, and not uniformly implemented in all Member States. The proposed Regulation will be directly applicable in all Member States.
Dynamic reliability block diagrams: Overview of a methodology

Dependability evaluation is an important, often indispensable, step in design and analyze (crit- ical) systems, acquiring importance with the systems complexity growth. When the complexity of a system is high and/or increases, for example automizing or expanding some parts, dynamic effects, not present or mani- fested before, could arise or become significant in terms of reliability/availability.The system could be affected by common cause failures, the system components could interfere each other or could become inter/sequence- dependent, effects due to load sharing arise and therefore should be considered, and so on. Moreover could be interesting to evaluate redundancy and maintenance policies. In those cases it is not possible to recur to notations as reliability block diagrams (RBD), fault trees (FT) or reliability graphs (RG) to represent the system, since the statistical independence assumption is not satisfied. Also more enhanced formalisms as dynamic FT (DFT) could not result adequate to the objective. To overcome those problems we developed a new formalism derived from RBD: the dynamic RBD (DRBD). In this paper we explain how to use the DRBD notation in system mod- eling and analysis, coming inside a methodology that, starting from the system structure, drives to the overall system availability evaluation following modeling and analysis phases.To do this we use an example drawn from literature, consisting of a multiprocessor distributed computing system. By this we also compare our approach with the DFT one.
A technique for SPARQL OPTIONAL (left-outer-join) queries

SPARQL basic graph pattern (BGP) (aka SQL inner-join) query optimization is a well researched area. But optimization of OPTIONAL pattern queries (SQL left-outer-joins) poses additional challenges, because of the restriction on the reorderability of left-joins. Query logs of SPARQL endpoints like that of DBPedia show that the occurrence of OPTIONAL pattern queries is as high as 17-50%. Previously published work on SQL left-outer-joins proposes free-reorderability of left-outer-joins, using additional operators like nullification and best-match to remove spurious (incorrect) results. In this paper, we present a novel technique - OptBitMat - for nested SPARQL OPTIONAL and BGP queries. first constructs and manipulates a query graph of hypernodes. Further OptBitMat's 2-phase query processing algorithm uses this query graph to (i) aggressively prune the candidate RDF triples, and (ii) generate final results without pairwise joins, unlike the traditional join query processors. OptBitMat keeps the memory footprint of the query processor low by using compressed bit-matrices (BitMats) to represent an RDF graph, works on them without uncompressing, and does not generate spurious intermediate results. We have demonstrated OptBitMat's superior performance in comparison to MonetDB and IBM DB2 using nested SPARQL BGP and OPTIONAL pattern queries of varying complexity and selectivity, over RDF graphs of up to 1.33 billion triples (much larger than the previously published work on left-outer-joins), using a commodity Linux machine.
Analyzing Network-Wide Interactions Using Graphs: Techniques and Applications

The fundamental problem that motivates this dissertation is the need for better methods and tools to manage and protect large IP networks. In such networks, it is essential for administrators to profile the traffic generated by different applications (e.g., Web, BitTorrent, FTP) and be able to identify the packets of an application in the wild. This enables administrators to effectively accomplish the following key tasks: (a) Manage the network: It allows different policies to be applied to different applications, e.g., rate limit peer-to-peer (P2P) traffic during busy hours. (b) Protect the network: Profiling malicious traffic requires a strong separation from benign traffic, therefore, knowing the behavior of good application provides better separation from malicious activity. Despite some significant efforts to solve the traffic profiling problem, none of the existing methods address all relevant problems. The difficulty of the problem comes from the following three factors: (a) The intentions of application writers and users to hide their traffic using obfuscation (e.g., payload encryption); (b) The limited information about flows and IP-hosts when traffic is monitored at the Internet backbone; and (c) The continuous appearance of new applications as well as undocumented changes to existing network protocols. In this dissertation, we propose a different way of looking at network traffic that focuses on the network-wide interactions of IP-hosts (as seen at a router). To facilitate the analysis of network-wide interactions, we represent traffic as a graph, where each node is an IP address, and each edge represents a type of interaction between two nodes. We use the term Traffic Dispersion Graph or TDG to refer to such a graph. Intuitively, TDGs capture the social behavior of network hosts, which, as we show here, it is hard to obfuscate. For example, a P2P protocol cannot function while trying to hide its overlay network, as maintaining a network overlay is a fundamental behavior of a P2P protocol. This dissertation focuses on three key aspects of network-wide interactions: (a) The graph shapes and structures formed by different applications; (b) The distinctive dynamic network-wide behavior of network application (i.e., how the graphs change over time); and (c) The identification of communities formed by IP-hosts over the Internet. Using the traffic analysis techniques we propose here, we develop novel traffic profiling solutions that are robust to obfuscation and can operate at the backbone, which are both very challenging to address with the current state-of-the-art. To evaluate the effectiveness of our methods, we use real-world traffic traces collected from six different networks. This dissertation presents the first work to explore the full capabilities of TDGs for profiling and analyzing traffic. Based on our results, we believe that TDGs can provide the basis for the next generation of traffic monitoring tools.
UML’s Sequence Diagram

It's February, and by now you've probably read about, or heard people talk about, making the change to UML 2.0--the new specification for UML that contains a number of improvements. Given the importance of the new spec, we are changing the basis of this article series, too, shifting our attention from OMG's UML 1.4 Specification to OMG's Adopted 2.0 Draft Specification of UML (a.k.a. UML 2). I hate to change emphasis from 1.4 to 2.0 in the middle of a series of articles, but the UML 2.0 Draft Specification is an important step forward, and I feel the need to spread the word. There were a couple of reasons that the OMG improved UML. The main reason was that they wanted UML models to be capable of delivering Model Driven Architecture (MDA), which meant that the UML had to function as a more model driven notation. Also, the UML 1.x notation set was at times difficult to apply to larger applications. Furthermore, the notation elements needed to be improved in order to make diagrams more readable. (For example, modeling logical flow in UML 1.x was complicated and at times impossible. Changes to the sequence diagram's notation set in UML 2 have made vast improvements in modeling logic in sequences.) Notice the wording in my statement above: "Adopted 2.0 Draft Specification of UML. " It is true that the specification is still in draft status, but the key is that the Draft Specification has been adopted by OMG, a consortium that does not adopt new standards until they become pretty solid. There will be some changes to the specification before UML 2 is completely adopted, but these changes should be minimal. The main changes will be in the internals of UML--involving features typically used by software companies who implement UML tools. The main purpose of this article is to continue our focus on the essential UML diagrams; this month, we take a close look at the sequence diagram. Please note, again, that the examples provided below are based on the new UML 2 specification.
A Water Immersion Algorithm for Cytological Image Segmentation

A non-parametric multi-resolution method is presented for cell segmentation and some of the advantages it has over other techniques, when applied to this application, are outlined. The proposed algorithm is an extension on the method of Wilson and Spann [6] and uses a technique based on the concept of water immersion which ensures closed boundaries. Experiments with cervical cells have shown that the algorithm is robust, fast and accurate.
An object-oriented approach to manage the multiple representations of real entities

These Ecole polytechnique federale de Lausanne EPFL, n° 1490 (1996)Institut d'informatique fondamentaleLaboratoire de bases de donnees Reference doi:10.5075/epfl-thesis-1490Print copy in library catalog Record created on 2005-03-16, modified on 2016-08-08
New developments in designs for computer experiments and physical experiments

We develop in this thesis new methodologies for designing both computer experiments and physical experiments. There has been much attention devoted to deterministic computer experiments in the past two decades. Such experiments are performed on computer simulators to study complex physical phenomena that might otherwise be too time-consuming, expensive, or impossible to observe. In this thesis, we develop a new method for constructing “good” designs for computer experiments. The construction uses small designs to construct larger designs with desirable properties. Our method allows orthogonal Latin hypercubes to be constructed for any run size n 6= 4k +2, and when n = 4k + 2, we prove that an orthogonal Latin hypercube does not exist. Therefore, in terms of run size, we have completely solved the existence problem for orthogonal Latin hypercubes. Another appealing feature of our method is that it can be adapted easily to construct other designs such as nearly orthogonal Latin hypercubes and cascading Latin hypercubes. In addition to the above, we propose and study two generalizations that allow designs with better projection properties to be constructed. The second part of the thesis is devoted to two-level fractional factorial designs, the most widely used designs in practice. Two research problems are investigated. The first is the algorithmic construction of minimum G and G2-aberration designs. Our method is applicable for any run size that is a multiple of eight. Results from the application of this algorithm to designs of 24, 32 and 40 runs are obtained and
Introduction to Computing

Reviews for Introduction to Computing using Python from. Introduction to Computing – CS101 Midterm Solved Papers MCQs. Introduction to Computer Security. Introduction to Computing Write my Essay I need help. Introduction to Computing Disk Storage Operating System. DSST EXAM CONTENT FACT SHEET DSST® INTRODUCTION TO COMPUTING. Introduction to Computer Science and Programming. What is a computer Wikiversity. CS10
Theoretical Issues in Natural Language Processing

An apparatus for continuous unwinding of wire from reels includes two adjacent hollow, partially cylindrical and partially frusto-conical housings, each of which contains a reel of wire. In operation, the tail end of the wire of the first reel is joined to the beginning of the wire on the second reel, permitting continuous unwinding. When one reel is empty, the wire must pass from one hollow housing to the second hollow housing. The apparatus is constructed from two cooperating halves, which may be hinged or capable of other relative motion, to permit passage of the wire when desired but which close fully during the unwinding process to prevent discontinuities in the interior surface which would tend to damage the moving wire.
Indirect Use of Formal Methods in Software Engineering

This position statement points out the advantages of using formal methods indirectly for the development of software. It is admitted that formal methods are not adequate for the daily use in large software development projects, except of a few specialised application areas. However, it is argued that formal methods are well-suited for the analysis of the notions and tools which are used in practice. So formal methods can be used indirectly in practice, keeping the formal notation invisible during the actual development work. Examples for indirect use of formal methods are given, including a recent case study on formal foundations for SSADM which was carried out by the author. Formal methods are also considered helpful in customising software development methods for specific software development cultures.
On-Chip Power and Clock Distribution

Shoe stiffeners are now comprising a textile fabric impregnated with a stiffening composition. In the past certain of these have been made by impregnating textile fabric with a solution of stiffening composition. Others have been made by impregnating textiles with an aqueous emulsion of stiffening composition but these have not been as stiff or creep-resistant in wear as corresponding weights of solution impregnated materials. In the invention a plasticizer (solid at wear temperatures and melting at temperatures commonly used in activating shoe stiffeners e.g. above about 50 DEG C.) and an aminoplast resin 3 to 30% based on dry weight of composition are included in the stiffening composition. The stiffeners are sufficiently stiff and creep-resistant to be satisfactory as replacements for many solution-impregnated stiffeners and may be stuck to the upper with hot melt adhesives or latex (if primed).
A framework for VHDL combining theorem proving and symbolic simulation

We present the status of an on-going work aiming at introducing symbolic simulation and theorem proving in a design flow that uses conventional description and simulation languages. This paper focuses on the formalization of the cycle simulation semantics of a synchronous subset of VHDL, in the ACL2 logic. The model is executable, and the results of its symbolic simulation can be proven equal to a specified expression.The ACL2 input is produced automatically from the VHDL source, which relieves the designer from an error prone manual translation.
Duplicate Transfer Problem inside a Proxy’s Cache

This paper presents an overview of the current web client web proxy web server mechanism and takes a deep look into one of its main disadvantages: the replication, in the proxy’s cache, of web objects having different URL but the same content. This problem is known as the “Duplicate Transfer” problem and is mainly caused by the current mode of indexing web objects based on their URL, which is used as a primary key in the cache repository. We present in this paper a statistical analysis based on real traffic measurements, which shows that more than 10% of a proxy’s cache consists of replicated objects, grabbed from the Internet in a useless manner and stored redundantly at least twice. These results urge the development of a scalable reallife solution to the duplicate transfer problem: some solutions have been previously proposed, but never deployed on a large scale in Internet.
Decision making based on proactively collected event data for operating room management

Surgical processes place a heavy burden upon the finance of hospitals and should therefor be utilized effectively. Effectively, means (economically) efficient, safe for patients and personnel, and reliable for any actors (normal practice can be assumed). Rapid organizational learning is required to identify system vulnerabilities quickly and to develop defence strategies against performance failures concerning these organizational goals. To enable organizational learning, feedback about organizational processes is essential. This means that processes should be observed, data should be collected and analyzed, and results should be presented. Semi-structured event reports are a means to collect process information with enough details and are considered important to organizational learning. It has been shown that visualizing event reports and linking quantitative and qualitative information can be done. We believe that it provides an organization with ways to easily and quickly access relevant data, compare individual reports and find similarities and contradictions with other cases. As such, applying visual feedback of event reports allows an organization to reduce embedded risks more adequately. However, it turned out to be difficult to decide what information to present. Further study revealed the advantages and limitations of different information types present in semi-structured event reports. Quantitative information about difference between start and scheduled times can be a robust state indicator for surgical performance. Discretization of this quantitative measure allows for intuitively clustering of surgeries, but also affects encountered performance changes. Constrained data is valuable to focus on specific subsets of data, but should only be used if the constrained options are mutually exclusive and collectively exhaustive. Qualitative data is valuable to assess underlying causes of events and to refiect on any issues impacting normal practice or reliability. Automatic analysis of free-text inputs has yielded little results. It is recommended to implement automatic validation aids that combine human and machine interpretation rather than to strive for automatic clustering. These systems can advise and identify patterns from which humans can validate events.
Agregando semántica a técnicas de predicción de completitud en modelos de requisitos

En casi todas las ramas de la ingeniería se genera un bosquejo/maqueta/plano/diagrama que representa el artefacto a construir. A través de él, se planifica la construcción de ese artefacto y se asegura que responda a las expectativas de los clientes. Sin embargo, en la Ingeniería de Software la dificultad se centra justamente en la representación del producto a construir, pues dicho producto (el software) es en sí mismo una representación parcial del mundo real. Esto requiere prestar especial atención a la generación de dichos modelos para que sean precisos, correctos y completos. El proceso de desarrollo de software debe arrancar elaborando modelos de requisitos con la calidad apropiada, siendo la completitud de los mismos una característica primordial. Aplicar técnicas de verificación y validación de los modelos debe formar parte de las actividades continuas del proceso de desarrollo, aunque ellas no permiten asegurar el grado de completitud alcanzado. Es necesario recurrir a técnicas predictivas que realicen estimaciones del tamaño esperado del modelo de requisitos. Se propone entonces agregar análisis semántico a la aplicación de estas técnicas predictivas, en particular el Método de Captura y Recaptura. Esto conllevará a establecer mejoras al proceso de construcción de los modelos de requisitos.
catena -Poly[[[diaquamanganese(II)]--oxalato] monohydrate]

In the title compound, {[Mn(C2O4)(H2O)2]·H2O}n, the octa­hedrally coordinated Mn atom, lying on a twofold rotation axis, is bonded to four carbox­yl O atoms from oxalate groups and two O atoms from two water mol­ecules. By means of the bridging oxalate ligand, the title compound exhibits a one-dimensional chain structure. The crystal packing is stabilized by hydrogen bonds of the type O—H⋯O(oxalate).
The ZINC experiment : an economical implementation of the ML language

Ce rapport pr esente en d etail la conception et la r ealisation du syst eme ZINC. C'est une mise en uvre du langage ML, se xant pour objectif de permettre l'exp erimentation de diverses extensions du langage, ainsi que de nouvelles techniques d'impl ementation. Ce syst eme est conn cu pour permettre la compilation ind ependante et la production de petits programmes autonomes; le respect du typage est assur e par par un syst eme de modules a la Modula-2. ZINC utilise des techniques simples et facilement adaptables, telles que l'interpr etation de code abstrait; un mod ele d'ex ecution raan e compense en partie le ralentissement d^ u a l'interpr etation. A noter egalement une repr esentation eecace des records avec inclusion (sous-typage). Abstract This report details the design and implementation of the ZINC system. This is an implementation of the ML language, intended to serve as a test eld for various extensions of the language, and for new implementation techniques as well. This system is strongly oriented toward separate compilation and the production of small, standalone programs; type safety is ensured by a Modula-2-like module system. ZINC uses simple, portable techniques, such as bytecode interpretation; a sophisticated execution model helps counterbalance the interpretation overhead. Other highlights include an eecient implementation of records with inclusion (subtyping). Ecole Normale Sup erieure et INRIA Rocquencourt, projet Formel.
On the use of sensors in self-reconfigurable robots

In this paper we investigate the use of sensors in self-reconfigurable robots. We review several physically realized self-reconfigurable robots and conclude that little attention has been paid to the use of sensors. This is unfortunate since sensors can provide essential feedback that can be used to guide self-reconfiguration and control. In the systems that do use sensor feedback, the feedback is used locally on each module. However we identify a need in some situations to use sensor feedback globally. We therefore propose an approach where raw sensor values are abstracted and propagated to all modules. The sensor values are abstracted differently depending on the position of the producing sensor on the robot. We combine this approach with role based control, a control method for self-reconfigurable robots that we have developed earlier. We demonstrate that by combing these two approaches it is possible to make a self-reconfigurable robot consisting of six modules walk and avoid obstacles. However the reaction time of the robot is slow and therefore we discus possible ways of reducing the reaction time.
Speech to Print: Language Essentials for Teachers.

In an automatic identification system for reading a remote label containing information in the form of a plurality of vertically arrayed horizontal stripes which may include wide stripes and narrow stripes, a stripe width determining circuit which detects a stripe of known absolute width, measures the relative width of the stripe of known absolute width, stores a representation of the relative size of the stripe of known absolute width, measures the relative width of each of the other stripes, and compares the relative width of the stripe of known absolute width with the relative width of each of the other stripes to determine the absolute width of each of the other stripes.
Investigating the Energy Consumption of an IEEE 802.11 Network Interface

This report describes a series of simple experiments which measure theper-packet energy consumption of an IEEE 802.11 wireless network interface. The goal of this work is to develop a solid experimental basis for assumptions that can (or cannot) be made in the design and analysis of network protocols operating in the ad hoc wireless environment.