Miracle-dz/UniFAR-FTUs huggingface dataset:
Wine competition: from between-juries consistency to sensory perception of consumers

Wine is a complex product offering to consumer a multitude of choices. Considering this diversity, wine competitions provide a way of helping consumers in their choices. However, the dramatic increase of wine contests in the last fifteen years has led to an increase in the number of award-winning wines. Is a medal really a guarantee of quality or having a medal is just a matter of chance? Two studies were therefore conducted during 3 years in a French wine competition. The first study assessed the impact of the order in which the wine was assessed, and the variability between juries’ judgements and therefore the chances of winning an award. For this purpose, the same wine was placed on all jury tables at the first and penultimate positions of the tasting series. Wines were rated, using the OIV-UIOE score sheet. Score differences were analyzed between tasting juries. The second study sought confirmation by a consumer panel of the medals awarded during the competition. A hedonic test of both award-winning and non-awarded wines was organised, in order to verify whether the awarded wines were indeed preferred by consumers.
Architectures multiprocesseurs pour applications de télécommunication basées sur les technologies d'intégration 3D

Les travaux de cette these s'interessent aux problemes de performance et de cout des architectures MPSoC a base de NoC, en tirant parti des possibilites offertes par les technologies d'integration 3D. Plusieurs contributions originales sont proposees. Tout d'abord, une etude approfondie a propos des differentes granularites de partitionnement au sein des circuits 3D est realisee. En se basant sur cette analyse, ce travail de these est oriente aux architectures 3D partitionnees au niveau des blocs macroscopiques. Ainsi, la contribution de l'integration 3D est limitee aux interconnexions verticales inter-blocs. Afin d'ameliorer les performances de ces interconnexions, une topologie hierarchique de NoC est proposee pour diminuer la latence et augmenter le debit des communications au sein des architectures 3D partitionnees au niveau des macro-blocs. D'autre part, un modele au niveau du systeme est presente pour evaluer et comparer les couts des differentes options technologiques de l'integration 3D. Partant de cette evaluation, nous proposons une architecture multiprocesseur reconfigurable empilable pour les applications de telecommunication 4G, en tenant compte des problemes de cout.
Du locus au territorium. Quelques remarques sur l'évolution des catégories en usage dans le classement des cartulaires méridionaux au XIIe siècle.

Vom locus zum territorium. Bemerkungen zur Entwicklung des Klassizifizierungsvokabulars in den mittelalterlichen Kopialbuchern des 12. Jh. ; In diesem Artikel untersucht der Autor am Beispiel zweier fast zeitgleicher Kopialbucher aus dem Niederlanguedoc wie sich die topographische Klassifizierung im 12. Jh. entwickelte. Am Ende des 12. Jh. wird die Rolle der Kirchen als locus wieder aufgewertet, anderseits werden die damals neuen territoria benutzt, die durch das Phanomen des incastellamento entstanden waren. Diese dopppelte Entwicklung verlauft parallel in den Kanonikerstiften der Kathedralen mit der Verbreitung der Summae Codicis oder Institutionum, die von Juristen aus Sudfrankreich verfasst wurden. In diesen Texten fusionieren juristische romische Tradition und theologischer Diskurs uber heilige Statten aus dem 9. Jh. Sie offnen den Weg fur die Verbreitung gelehrter Kategorien auch bei den Schreibern und ihre Anpassung an einen pragmatischen Schriftgebrauch.
MODEL ADAPTATION TECHNIQUES IN MACHINE TRANSLATION

Nowadays several indicators suggest that the statistical approach to machinetranslation is the most promising. It allows fast development of systems for anylanguage pair provided that sufficient training data is available.Statistical Machine Translation (SMT) systems use parallel texts ‐ also called bitexts ‐ astraining material for creation of the translation model and monolingual corpora fortarget language modeling.The performance of an SMT system heavily depends upon the quality and quantity ofavailable data. In order to train the translation model, the parallel texts is collected fromvarious sources and domains. These corpora are usually concatenated, word alignmentsare calculated and phrases are extracted.However, parallel data is quite inhomogeneous in many practical applications withrespect to several factors like data source, alignment quality, appropriateness to thetask, etc. This means that the corpora are not weighted according to their importance tothe domain of the translation task. Therefore, it is the domain of the training resourcesthat influences the translations that are selected among several choices. This is incontrast to the training of the language model for which well‐known techniques areused to weight the various sources of texts.We have proposed novel methods to automatically weight the heterogeneous data toadapt the translation model.In a first approach, this is achieved with a resampling technique. A weight to eachbitexts is assigned to select the proportion of data from that corpus. The alignmentscoming from each bitexts are resampled based on these weights. The weights of thecorpora are directly optimized on the development data using a numerical method.Moreover, an alignment score of each aligned sentence pair is used as confidencemeasurement.In an extended work, we obtain such a weighting by resampling alignments usingweights that decrease with the temporal distance of bitexts to the test set. By thesemeans, we can use all the available bitexts and still put an emphasis on the most recentone. The main idea of our approach is to use a parametric form or meta‐weights for theweighting of the different parts of the bitexts. This ensures that our approach has onlyfew parameters to optimize.In another work, we have proposed a generic framework which takes into account thecorpus and sentence level "goodness scores" during the calculation of the phrase‐tablewhich results into better distribution of probability mass of the individual phrase pairs.
DISEÑO DE UN SISTEMA PARA LA PLANEACIÓN DE LA PRODUCCIÓN Y ADMINISTRACIÓN DE INVENTARIO DE PRODUCTO TERMINADO EN UN AMBIENTE DE FABRICACIÓN PARA INVENTARIO

Trabajo en el que se disena un sistema para la planeacion de la produccion y administracion de inventario aplicado a la industria de manufactura del vidrio. Se trata de un sistema halado (pull) por la demanda en donde se utiliza punto fijo de reorden y calculo de lote economico de produccion teniendo en cuenta la capacidad de la planta. Despues de analizar y definir el problema del actual sistema con el que trabaja la industria (sistema empujado) se procede a disenar un sistema de halado (pull) en donde se integra a la demanda real en la funcion de produccion. El nuevo sistema esta disenado tomando como base los datos reales de 8 meses de actividad de la fabrica.
Introduction to SQL: Mastering the Relational Database Language (4th Edition)

The Classic SQL Tutorial: Fully Updated for Today's Standards and Today's Top DatabasesFor twenty years, van der Lans' Introduction to SQL has been the definitive SQL tutorial for database professionals everywhere, regardless of experience or platform. Now van der Lans has systematically updated this classic guide to reflect the latest SQL standards and the newest versions of today's leading RDBMSs: Oracle, Microsoft SQL Server, DB2, and MySQL.Using case study examples and hands-on exercises, van der Lans illuminates every key SQL concept, technique, and statement. Drawing on decades of experience as an SQL standards team member and enterprise consultant, he reveals exactly why SQL works as it doesi¾and how to get the most out of it. You'll gain powerful insight into everything from basic queries to stored procedures, transactions to data security. Whether you're a programmer or DBA, a student or veteran, this book will take you from “apprentice” to true SQL master. i¾ Writing queries and updating data: all you need to know about SELECT i¾ Working with joins, functions, and subqueries i¾ Creating database objects: tables, indexes, views, and more i¾ Specifying keys and other integrity constraints i¾ Using indexes to improve efficiency i¾ Enforcing security via passwords and privileges i¾ Building stored procedures and triggers i¾ Developing with embedded SQL and ODBC i¾ Working with transactions, including rollbacks, savepoints, isolation levels, and more i¾ Optimizing performance by reformulating SQL statements i¾ Using object-relational features: subtables, references, sets, and user-defined data types i¾ Reference section: SQL statement definitions and SQL function lists
The Software Optimization Cookbook

From the Publisher: Revealing the secrets of the software tuning process, The Software Optimization Cookbook provides recipes for high-performance applications on the Intel® Pentium® III and Pentium® 4 processors. Simple explanations and C language examples show you how to address performance issues with algorithms, memory access, branching, SIMD instructions, multiple threads, and floating-point calculations. With this book, you need not be a processor architect or assembly language expert to get the full power out of your software on the 32-bit Intel® Architecture. Learn how to: Use performance tools and tested concepts to analyze and improve applications. Determine which portions of an application should be given highest priority for optimizations. Identify the reasons that certain portions of your application are slower than they should be. Improve an application by working directly on the root cause of a software bottleneck. Design an application from the ground up for maximum performance.
Stationary generalized Kerr-Schild spacetimes

In this paper we have applied the generalized Kerr–Schild transformation finding a new family of stationary perfect-fluid solutions of the Einstein field equations. The procedure used combines some well-known techniques of null and timelike vector fields, from which some properties of the solutions are studied in a coordinate-free way. These spacetimes are algebraically special being their Petrov types II and D. This family includes all the classical vacuum Kerr–Schild spacetimes, excepting the plane-fronted gravitational waves, and some other interesting solutions as, for instance, the Kerr metric in the background of the Einstein Universe. However, the family is much more general and depends on an arbitrary function of one variable.
Bridging GROOVE to the world using a conceptual language model

Currently, GROOVE is capable of importing and exporting Ecore models, which can be used by tools such as Eclipse using its underlying modeling framework. This is done using a standalone tool which can transform GROOVE graphs to Ecore models and vice versa. An Ecore type model may be imported as a type graph, and Ecore instance models as instance graphs. GROOVE can then be used to transform these instance graphs, which may then be exported back again to Ecore instance models. However, the generated type and instance graphs can sometimes become too complex and unmanageable, where a simpler graph would be sufficient. It is therefore desirable to improve the current import and export facilities, and give the user the option to generate more simple graphs. Ideally, this process would be configurable so different choices can be made on the resulting outcome. Addi- tionally, it is interesting to add the capability for translating other graph languages to the import and export facilities as well, so as to make GROOVE more interoperable with other tools. These problems are addressed by defining a conceptual model, which acts as an intermediate layer between GROOVE and possible external languages, such as Ecore. A formal description is given for this conceptual model, providing a well defined foundation for the mappings between itself, the external languages and GROOVE. The mapping between the conceptual model and the external languages is kept simple by combining the concepts found in these external languages into the conceptual model. Then, only the mapping between GROOVE and the conceptual model needs to perform the more heavyweight translation from the conceptual model to the graphs supported by GROOVE.
Approximate Computing

Summary form only given. We face an urgent need for new sources of efficiency in computing due to the diminishing benefits from semiconductor technology scaling on the one hand, and the need to keep up with the explosive growth in data on the other. The very workloads that drive the demand for computing across the spectrum hold out promise for new opportunities. In data centers and the cloud, the demand for computing is driven by the need to organize, search through, analyze, and draw inferences from, exploding amounts of digital data. In mobile and embedded devices, the need to more naturally and intelligently interact with the physical world, and process richer media drive much of the computing demand.A common pattern that emerges from both ends of the spectrum is that these workloads - recognition, mining, search, and analytics, among others - are largely not about calculating one numerically precise result; instead, "correctness" is defined as producing results that are good enough, or of sufficient quality, to produce an acceptable user experience. As a result, these workloads are endowed with a high degree of intrinsic resilience to their underlying computations being executed in an approximate manner. Traditionally, this forgiving nature of applications is exploited only during the design of algorithms (e.g. the use of heuristics, probabilistic algorithms etc.) and applications, while their hardware/software implementations are designed to adhere to a strict notion of numerical/Boolean correctness. This view of computing platforms - as precise calculators that must produce a unique, golden result - is excessively restrictive and leaves significant opportunity for compute efficiency untapped.Approximate computing is an emerging design paradigm, and broadly refers to a class of design techniques that leverage intrinsic application resilience to design more efficient (faster, lower power) computing platforms. In this tutorial, we will present a comprehensive overview of the key design principles and methodologies to realize approximate computing at different layers of the computing stack viz. circuits, architecture and software. To this end, we will first motivate the need and opportunity for approximate computing by demonstrating how the nature of workloads has fundamentally changed in recent years. We then describe and quantify the sources of intrinsic application resilience in a broad class of emerging applications. Next, we will present the design philosophy behind approximate computing and outline a holistic cross-layered framework to design approximate computing platforms. We will present detailed description of the state-of-the-art in approximate computing at various levels of the stack: (i) manual designs and automatic design methodologies for approximate circuits, (ii) architecture level approaches to build application-specific as well as programmable approximate processors, and (iii) software techniques for approximate computing on general-purpose platforms. Finally, we will conclude by outlining the key challenges that need to be addressed for approximate computing to enter the mainstream.
Effets d’une formation minimale à la supervision destagiaires en éducation physique

Cette etude vise a ameliorer la supervision pedagogique offerte aux futursenseignants lors de stages. Dix enseignants d’experience ont beneficie de troisjournees de formation a la supervision et ont accueilli dix stagiaires en milieuscolaire. Dix-neuf stagiaires encadres par des maitres de stage n’ayant pas recu deformation particuliere ont egalement participe a l’etude. La technique des incidentscritiques a permis de recueillir des perceptions quant a des facteurs qui facilitentou rendent difficile l’encadrement de stagiaires. Un questionnaire, elabore a partirdes informations contenues dans les incidents, leur a ete administre. Les resultatssemblent indiquer qu’un programme de formation a la supervision peut aider lesmaitres de stage a mieux encadrer les stagiaires sur divers aspects de l’actepedagogique.
A test-driven development strategy for the construction of grammar-based software.

Grammar-based software is increasingly becoming a prominent and well defined subset of software engineering through the popularity of analysis tools, metrics evaluators and the increasing prevalence of software tools that rely upon extensible data such as XML. Software-testing plays a crucial role in the lifecycle of any modern software system, hence the correct and adequate testing of grammar-based software is essential. This thesis provides a review of the current research and practice in the field of grammar-based software. The motivation behind software-testing is examined and a summary of existing testing techniques is presented. This leads to a detailed empirical comparison of test-suites for grammar-based software. The effectiveness of test-suite generation via methods such as Purdom’s algorithm is contrasted with test-suite reduction via a novel elaboration of the notion of coverage for a grammar. The effectiveness of this strategy is discussed with regard to two testing analysis criteria: code coverage and fault detection. The second contribution of this thesis is the definition of a framework for developing grammar-based software within a strict test-driven environment. We describe the techniques used to develop a static analysis tool for the ISO C++ grammar and the verification of its correct operation via standardised test-suites. This work was completed in two distinct phases. The first phase involves porting an existing system from C++ to Java by combining eXtreme Porting with an order for porting derived from a novel use of Object Relation Diagrams. The second phase involves a large automated testing process including black-box testing, coverage comparisons and comparisons of reverse-engineered UML sequence diagrams from program traces. The third contribution of this thesis involves the utilisation of the generalised parsing algorithm, GLR, in the implementation of a parser generator. We describe the design and test-driven development of this parser generator, and its practical application as part of an analysis tool for ISO C++. Finally, we provide a study of the performance of a generated GLR parser when parsing ISO C++ programs, and a comparison with an existing system based on a generated backtracking parser.
Proceedings of the nineteenth ACM symposium on Operating systems principles

Welcome to the 19th SOSP, and to the beautiful Adirondack mountains of New York State! Larry Peterson and his committee have put together a strong and varied technical program, showcasing the most significant and influential work in operating systems today. Other program highlights include the poster and work-in-progress sessions, the Anita Borg luncheon and the evening banquet on Monday, and the SIGOPS business meeting Tuesday evening. The banquet will include presentation of the third annual Mark Weiser award, and eulogies for Roger Needham and Anita Borg, both of whom were lost to us this year. The business meeting will include presentation of awards in the first-ever SIGOPS division of the ACM Student Research Competition (SRC). Entrants in the SRC include all the regular papers and posters on which a student is principal author. To help to put the competition on an equal footing, four poster finalists will be making formal presentations during the session on Monday afternoon. Many thanks to Kevin Jeffay and his subcommittee for organizing the poster session and judging the submissions, and to Ann Sobel for her help in bringing SIGOPS into the SRC.Continuing the tradition of past SOSPs, we have encouraged student attendance through reduced registration fees and a strong program of financial scholarships. Generous support for this program has come from Microsoft via the SRC, from the National Science Foundation (CISE CCR), from Hewlett-Packard Labs, and from SIGOPS itself. Thanks to Cary Gray and his scholarship committee (John Carter, Norm Hutchinson, Marc Shapiro, and Bob Wisniewski) for their outstanding work under very tight time constraints.
Research protocol for the Atlantic Bottlenose Dolphin (Tursiops truncatus): Mirage Click Collection Study

Past research on dolphin echolocation has shown that dolphins can adaptively control the frequency and amplitude of echolocation clicks. The degree to which click production is controlled and the relationship between click variation and echolocation task remains uncertain. This thesis describes a research protocol for studying the adaptive control of dolphin echolocation. The protocol builds on past studies to investigate the manner in which the spectral characteristics of clicks and the overall number of clicks produce for a given task vary in relation to the type of task being performed.
The phonology of postvocalic /r/ in Brabant Dutch and Limburg Dutch

The A. analyses data from two Dutch dialects to give an answer to the question what the phonological implications of the phonetic variability of /r/ are. He wants to show that /r/ is not a fixed point on the sonority scale - as Wiese argues - but that its chameleonic behaviour is related to consonantality. He points to a number of facts which support the following generalisation: the more consonant-like the position in which /r/ occurs, the less likely it is to pattern with the sonorants. The relevant facts are from Brabant Dutch (Tilburg) and Limburg Dutch (Maasbracht) - dialects spoken in the southern part of the Netherlands. In these dialects, /r/ behaves as a fricative or as a sonorant consonant, the fricative realisation occuring word-finally. The A. argues that the reason for this phonological chameleonic behaviour of /r/ is a universal constraint FINALC, requiring words to end in a consonant ; and that /r/ is particularly sensitive to this constraint because /r/ is not predetermined for place
Investigations on Optimum Reference Signal Structure for Single-Carrier FDMA Radio Access in Evolved UTRA Uplink

This paper presents the optimum reference signal (RS) structure for single-carrier (SC)-FDMA radio access using discrete Fourier transform (DFT)-spread OFDM to satisfy the requirements in the Evolved UTRA uplink. The simulation results shows that the optimum fast Fourier transform (FFT) block length, i.e., data block length, is approximately 66.7 -133.3 musec, corresponding to the FFT length of 1024 -2048 points assuming the sampling frequency of 15.36 Mega samples per second. Moreover, it is shown that an RS structure that comprises two RS blocks contained within the duration of a 1-msec sub-frame is the most promising candidate based on superior user throughput under low mobility conditions such as less than approximately 120 km/h and on a high degree of commonality of radio parameters such as that in the downlink, considering the fairly low applicability of 16QAM modulation under extremely high mobility conditions such as 350 km/h.