Miracle-dz/UniFAR-FTUs huggingface dataset:
Des « minorités visibles » aux néostéréotypes. Les enjeux des régimes de monstration télévisuelle des différences ethnoraciales

Des la fin des annees 1990, l’introduction de la notion de « minorites visibles » dans les debats concernant la representativite ethnoraciale des programmes de la television francaise, a contribue a tendre encore plus le paradoxe francais d’une indifference aux differences conduisant a une indifference aux discriminations. Or on observe depuis 2004 un basculement spectaculaire de l’ensemble des professionnels de la television vers un volontarisme efficace de visibilite des minorites. Cependant, l’apparition croissante de non‑Blancs contre‑stereotypes ne conduit pas necessairement a une reduction des stereotypes positifs ou negatifs de type essentialiste, ni au developpement d’antistereotypes reflexifs quant aux « nouvelles ethnicites » propre a la postcolonialite. Ils tendent a l’inverse a legitimer le passage d’un modele d’integration colour blind a un autre : tandis que les non‑Blancs etaient marginalises en raison de l’indifference aux discriminations, leur nouvelle visibilite a pour corollaire le deni de toute ethnicite non‑blanche et des discriminations elles-memes.
Design and implementation of a distributed systems language (crystal, charlotte, lynx, soda)

In a distributed environment, processes interact solely through the exchange of messages. Safe, convenient, and efficient communication is of vital importance, not only for the tightly-coupled components of parallel algorithms, but also for more loosely-coupled users of distributed resources. Server processes in particular must be able to communicate effectively with clients written at widely varying times and displaying largely unpredictable behavior. Such communication requires high-level language support. Interprocess communication can be supported by augmenting a conventional sequential language with direct calls to operating system primitives, but the result is both cumbersome and dangerous. Convenience and safety are offered by the many distributed languages proposed to date, but in a form too inflexible to support loosely-coupled applications. A new language known as LYNX overcomes the disadvantages of both these previous approaches. The name of the language is a play on its use of duplex communication links. Links are a mechanism for the naming, protection, and abstraction of distributed resources. They allow the connections between processes to be inspected and altered dynamically. Additional language features support the division of processes into multiple threads of control. The interaction of threads and links facilitates the construction of servers. Experience with LYNX indicates that the language is a significant improvement over existing notations for interprocess communication. An implementation on top of the Charlotte distributed operating system presented several interesting problems and yielded unexpected insights into the nature of the language/operating system interface. A paper design of an implementation for the SODA distributed operating system was in some ways considerably simpler. The Charlotte implementation is complete and performs well.
Implementation Aspects and Applications of a Spelling Correction Algorithm

A method for detecting and correcting spelling errors in Swedish text was presented by Domeij, Hollman and Kann (1994). The objectives were to perform very fast detection and correction of errors and to use a full size word list. Our implementation of the method as a C program is called Stava. We have further re(cid:28)ned this method and implemented ranking of corrections using word frequencies and editing distance. We also describe how the method can be used in several applications, for example when extending a part-of-speech lexicon, tagging unknown words, stemming and correcting search questions in information retrieval.
Aufbau eines Motion-Analyzers zur Charakterisierung von MEMS-Strukturen

Zusammenfassung: Ziel dieser Arbeit ist der Aufbau eines Motion-Analyzers. Dabei handelt es sich um ein Messgerat zur Charakterisierung von mikromechanischen Strukturen im Waferverbund, analog zum Test integrierter Schaltkreise mit Wafer-Probern in der Mikroelektronik. Das hier entwickelte System ermoglicht die Analyse des statischen und dynamischen Verhaltens tiefenlithographisch hergestellter, elektrothermischer Mikroaktoren mit Hilfe einer hochauflosenden CCD-Kamera (2048 x 2048 Pixel). Fur die Auslosung der Bildaufnahme wird auf den Einsatz einer Echtzeitumgebung verzichtet. Stattdessen wird die Triggerung der Kamera in einen externen Mikrocontroller implementiert. Die aktuelle Auslenkung des Aktors wird uber seine relative Position im aufgenommenen Bild mittels Mustererkennung durch Kreuzkorrelation ermittelt. Die mittlere Streuung der Messpunkte liegt dabei bei etwa 200 nm. Fur die statischen Messungen wird Dunkelfeldbeleuchtung mit einem eigens konstruierten LED-Ringlicht eingesetzt. Aus der auf diese Weise bestimmten Aktorkennlinie werden die auftretenden statischen Fehler extrahiert. Um auf eine teure Hochgeschwindigkeitskamera verzichten zu konnen, werden fur die dynamischen Messungen zur Frequenzgang- oder Signalanalyse verschiedene Verfahren zur gezielten Unterabtastung mit 2 bis 255 Bildern pro Signalperiode untersucht. Letztlich realisiert ist ein Verfahren, das immer genau dann ein Bild macht, wenn die Kamera alle Daten an den PC ubertragen hat, fur die nachste Aufnahme bereit ist und das Signal an diesem Punkt noch nicht erfasst wurde. Dieses Vorgehen fuhrt zwangslaufig dazu, dass die Bilder nicht mehr in der, dem eigentlichen Signal entsprechenden Reihenfolge, vorliegen. Daher mussen sie nach Abschluss der Messung auf dem Steuerrechner neu sortiert und entsprechend der Anregungsfrequenz zeitlich skaliert werden. Die moglichen Messfelder bewegen sich im Bereich von 2,4 x 2,4 bis 11,7 x 11,7 mm². Dabei konnen Aktoren mit Anregungsfrequenzen von 3,51 mHz bis 11,52 kHz vermessen werden.
Data Warehousing, Data Mining, and OLAP

From the Publisher: Optimize your organization's data delivery system! Improving data delivery is a top priority in business computing today. This comprehensive,cutting-edge guide can helpby showing you how to effectively integrate data mining and other powerful data warehousing technologies. You'll learn how to: Use data warehousing to establish a competitive advantage; Solve business problems faster by exploiting online analytical processing (OLAP); Evaluate various data warehousing solutions (including SMP and MPP,parallel database management systems,metadata,OLAP,etc. ); Leverage your data warehousing utility via the Internet,client/server computing,and various data mining tools. In addition to providing a detailed overview and strategic analysis of the available data warehousing technologies,the book serves as a practical guide to data warehouse database design,star and snowflake schema approaches,multidimensional and mutirelational models,advanced indexing techniques,and data mining. You'll also learn how to compare different data mine technologies and products,and understand how they fit into your overall business and data processes. Intended for IS professionals as well as strategic planners,this fascinating book can be well relied upon as the essential reference to the standards,tools,technologiesand possibilitiesof data warehousing today
Computation and the brain

Skeide and Friederici trace the development of language comprehension and production in the brain. They propose a two phase model in which language learning is thought of as having a first, “bottom-up”, phase primarily located in the temporal cortices and the ventral language network and a second, “top-down” phase involving the frontal cortex and dorsal network. Bottom-up processes are automatic and involve first processing and segmenting speech sounds into word forms, then accessing the meanings of those words. Some basic syntax is also present in the first few years but more complex syntactic processing requires the top-down phase.
Addressing in internetwork protocols

The most important part of an internet protocol is its addressing information|that is, the information that a ects routing of an internet packet. While there has been much research of routing in internetworks, there has not been a comprehensive study of addressing information in internet protocols per se. In this thesis, we examine the use of addresses in internet protocols. We start with a taxonomy of addressing functions. Using this taxonomy, we then give a comprehensive description of addressing modes in internetwork protocols. Finally, we present two designs for addressing in internetwork protocols, one based on current internet protocol syntax (SIPP), and one based on a new syntax (SPip). Both of these designs exploit the notion that virtually all routing and addressing semantics can be achieved through the loose source route mechanism, though SPip does this more generally than SIPP. We analyze the capabilities and costs of SIPP and SPip, and compare them with those of OSI's internetwork protocol, CLNP. We show that the general use of the loose source route mechanism is the best way to achieve exible, e cient, and evolvable routing and addressing.
CHEMEQ2: A Solver for the Stiff Ordinary Differential Equations of Chemical Kinetics

Abstract : This report describes and documents the subroutine CHEMEQ2, used to integrate stiff ordinary differential equations arising from reaction kinetics. This is a second generation improvement of CHEMEQ using a new quasi-steady-state predictor-corrector method that is A-stable for linear equations and second-order accurate. A single integration method can now be used for all species, regardless of the timescales of the individual equations. Start-up costs and memory requirements are low, so CHEMEQ2 is ideal for multi-dimensional reacting-flow simulations which require the solution of a process-split, initial-value problem in every computational cell for every global timestep. The algorithm, its implementation, the FORTRAN code, the internal variables and the argument lists are presented, along with several test problem results.
A phylogenomic contribution to the eukaryotic tree of life

Depuis quelques annees, la phylogenie moleculaire, c'est-a-dire l'etude des relations evolutives entre les etres vivants en comparant des sequences d'ADN ou d'acides amines, a profondement modifie notre vision de l'arbre des eucaryotes. Le schema qui est actuellement accepte par le plus grand nombre voit cinq assemblages majeurs d'organismes regroupant toutes les especes d'eucaryotes : ce sont les ‘super-groupes' (unikonts, excavates, Plantae, chromalveolates et Rhizaria). Si l'existence de ces super-groupes fait figure de consensus, les relations phylogenetiques qui les lient sont encore tres incertaines. La phylogenomique est un nouvel outil de la biologie evolutive permettant d'adresser d'importantes questions qui etaient jusque-la restees sans reponse, faute d'information suffisante. Grâce a l'accumulation de donnees genomiques, il devient en effet possible d'utiliser un nombre toujours plus important de marqueurs moleculaires (genes ou proteines) pour une diversite croissante d'organismes en vue de reconstruire les relations phylogenetiques a l'echelle des eucaryotes. Les recentes publications d'etudes relatant les analyses d'immenses alignements multigeniques (plus de 120 genes concatenes) englobant tous les super-groupes ont montre qu'il etait desormais possible de remonter toujours plus loin dans le temps et de resoudre des relations evolutives pour lesquelles seul un tres grand nombre de donnees contient un signal suffisant.
Ocean buoy spectral data sonification: Research update

Since first presenting this work at the 2002 International Conference on Auditory Display the author has professionally produced a multimedia CD that explores the sonification of ocean wave data. “Music from the Ocean” is a multimedia CD that explores the sonification of ocean wave data for oceanography, science pedagogy, and music and sound synthesis. Turning this data into sound provides new ways of experiencing and comprehending the phenomena involved; the processes come alive and are more comprehensible, memorable and exciting than graphs of the data. This CD contains over 55 minutes of sound examples as well as an interactive Flash presentation and research paper explaining the methods in more detail. The accompanying 16-page booklet features graphics and information about the data, phenomena, and music. The CD appeals to a wide variety of consumers, from oceanographers, science teachers, experimental computer music enthusiasts, and music therapists.
A touch-screen controlled 'Linear Predictive Synthesizer' for accessibility applications

Numerous voice compression methods are available today for communications over low bandwidth channels. Worthy of note in particular are Linear Predictive Coding (LPC), Mixed Excitation LPC (MELP), and Code Excited LPC (CELP). The channel in these coding schemes is typically a digital transmission line or radio link, such as in cellular telephone communications, but may be other media such as files on a computer hard disk. Linear Predictive Coding is explored in some detail as a basis for creating a new speech synthesizer that does not convert text to speech (TTS), but rather uses a touch-screen Thin Film Transistor (TFT) panel as user input to create and control voice-like audio sound synthesis. Research has been carried out to conceptually try different methods for mapping TFT touch panel input (or any 2-dimensional input) to LPC synthesis coefficient vectors for artificial speech reproduction. To achieve this, various LPC coefficient quantization algorithms have been explored and evaluated using Octave v.3 scripts, resulting in selection and comparison in the final hardware and software implementation. The hardware and software development platform used for the final implementation is the Altium Nanoboard 3000 Xilinx Edition, along with the Altium Designer EDA package. The Nanoboard 3000 was chosen as it provided a convenient FPGA platform and all the necessary IP, IP Synthesis, and C compilers needed to prototype the design and perform further research
An approach on distributed and shared dynamic cache partition

In multithreaded processor, many threads compete for the cache resource. Distributed partition method is not adaptive for the situation when cache requirement is greatly fluctuant. Shared dynamic partition need more cost than distributed method. In this paper a hybrid method is proposed which combines the distributed and shared cache partition method. Experiment shows the method leads to high hit rate.
Integración de modelos BPMN en ambientes MDA

Resumen. En este trabajo se presenta la utilización de modelos CIM para representar los procesos de negocio en un contexto de desarrollo MDA, y la obtención de modelos PIM, mediante transformación entre modelos. Se mostrará la adopción de dos lenguajes de modelado, BPMN y UML, para plasmar el comportamiento sistémico de la organización. El primero de ellos es utilizado con el fin de representar el funcionamiento de la organización, en forma clara y precisa a través de la creación de un CIM. El segundo de ellos permite representar modelos PIM, obtenidos a partir de los diagramas BPMN mediante el uso del lenguaje de transformaciones estándar QVT. El modelado con BPMN en etapas iniciales de un proyecto permite obtener, luego de la transformación a artefactos UML, modelos PIM con requerimientos de negocios más precisos y una mejor visión para el grupo de desarrollo.
Training a Back-Propagation Network with Temporal Difference Learning and a database for the board game Pente

This paper will give a view on how to make a back-propagation network which can play Pente by learning from database games with temporal difference learning. The aspects of temporal difference learning and neural networks are described. The method of how a neural network can learn to play the game Pente is also explained. An experiment is described and analyzed and shows how the neural network has learned the game of Pente and in what kind of behavior the learning strategy resulted. The best performance after training on one single game was reached with a learning rate of 0.001. After learning 300000 games from the database the network did not perform very well. A third experiment with 4000 self-play games was also conducted and showed that the network placed the game more to the middle of the board than to the sides which is some form of intelligence. First this paper will give a view of the aspects of temporal difference learning in neural networks and which choices in this project were made during testing. Then the game of Pente will be explained and the way of how this game can be learned by a neural network will be justified. At the end of this paper the experiments of this project will be explained and the results will be evaluated. Then the conclusions will be discussed and analyzed.
Real-time realistic rendering and high dynamic range image display and compression

This dissertation focuses on the many issues that arise from the visual rendering problem. Of primary consideration is light transport simulation, which is known to be computationally expensive. Monte Carlo methods represent a simple and general class of algorithms often used for light transport computation. Unfortunately, the images resulting from Monte Carlo approaches generally suffer from visually unacceptable noise artifacts. The result of any light transport simulation is, by its very nature, an image of high dynamic range (HDR). This leads to the issues of the display of such images on conventional low dynamic range devices and the development of data compression algorithms to store and recover the corresponding large amounts of detail found in HDR images. This dissertation presents our contributions relevant to these issues. Our contributions to high dynamic range image processing include tone mapping and data compression algorithms. This research proposes and shows the efficacy of a novel level set based tone mapping method that preserves visual details in the display of high dynamic range images on low dynamic range display devices. The level set method is used to extract the high frequency information from HDR images. The details are then added to the range compressed low frequency information to reconstruct a visually accurate low dynamic range version of the image. Additional challenges associated with high dynamic range images include the requirements to reduce excessively large amounts of storage and transmission time. To alleviate these problems, this research presents two methods for efficient high dynamic range image data compression. One is based on the classical JPEG compression. It first converts the raw image into RGBE representation, and then sends the color base and common exponent to classical discrete cosine transform based compression and lossless compression, respectively. The other is based on the wavelet transformation. It first transforms the raw image data into the logarithmic domain, then quantizes the logarithmic data into the integer domain, and finally applies the wavelet based JPEG 2000 encoder for entropy compression and bit stream truncation to meet the desired bit rate requirement. We believe that these and similar such contributions will make a wide application of high dynamic range images possible. (Abstract shortened by UMI.)
Color use guidelines for data representation

This paper proposes a structured way to use color to enhance a visualization. Focus is on the visualization of graphs/maps, containing one and two-dimensional data. There is also discussion of how to attempt to optimize a color scheme so that it can still be used effectively by colorblind individuals. Summary: Color has three dimensions: Hue the actual "color" (i.e. red, green, blue, etc.) Lightness – a relative measure of how “bright” a color appears to be in a given context Saturation vividness of a color, like different shades Proposed Guidance framework: Three basic schemes of one-variable data are identified, sequential, such as a series of scalar values in a single dimension, binary/qualitative, which pertains to differing categories of data, and diverging, which is concerned with looking at trends along a single dimension (i.e. was there an increase over a given time period, or was there a decrease). For sequential data, use varying lightness to represent monotonic sequences (possibly varying hue as necessary if the data contains multiple such sequences and you wish to make comparisons with them). Examples: high income = light colors, low income = dark well educated, high income = light red, poorly educated, low income = dark blue For binary/qualitative data, use varying hues to distinguish between distinct categories. Choose hues carefully to balance contrast and visibility with the chosen background color. Try to keep things even between categories if all are of the same importance. Example: Using different colors to denote different countries on a map For diverging data, vary hue and lightness (i.e. a spectral scheme) when looking at trends in a single dimension.
Schoenberg and Liszt: Hexatonic Collections across the Great Tonal Divide

This article explores passages from Liszt's and Schoenberg's compositions that share the versatile hexatonic collection which can function within, without or somewhere in between a tonal harmonic framework. The underlying harmonic structure of the hexatonic-based passages from Liszt's oratorio St. Stanislaus (1875), Schoenberg's ‘Nacht’ from Pierrot lunaire (1912), and Modern Psalm, Op. 50c (1950), are almost identical, even though the works were written in distinctly different genres and at very different times. The extramusical associations in these works, in which the sublime or supernatural is represented by hexatonic-based symmetry, recurs in the compositions examined here.
Modeling the Earth system. Critical computational technologies that enable us to predict our planet's future

The wealth of data to be collected from future Earth Observing systems is only the beginning of the process of being able to predict what will happen to our environment in response to natural and human induced changes. The models employed today will evolve to couple detailed processes in the solid earth, land surface, biosphere, atmosphere and oceans at orders of magnitude higher resolution into prediction systems that can be validated against these observations. These systems will stress the technology requirements for data movement, access, ingestion, computing throughput, and model construction. The Japanese Earth Simulator is the most recent advance in the technology that will support a whole Earth modelling capability, but is only the first step. Future demands will require 5 orders of magnitude improvement in computing technology over that of the Earth Simulator. Model complexity will demand software technologies that do not exist today for computing technology requirements - both hardware and software - that result from such prediction systems.