Miracle-dz/UniFAR-FTUs huggingface dataset:
L'outre-lecture. Manipuler, (s') approprier, interpréter le Web

Lisez-vous sur le Web ? – C'est evident, puisqu'il y a surtout des textes, meme pour les publicites ! – Allons, cela n'a quand meme rien a voir avec la lecture d'un roman ! » Ou sont les mots, et donc les concepts, qui permettent de penser cette activite apparemment nouvelle et pourtant si proche de « l'ancienne lecture », celle du support imprime ? Faut-il parler de « lecture » ou de « navigation », d'« usages », de « consultation » ? On parle d'ailleurs d'internaute, d'utilisateur, d'usager et jamais de lecteurs ! En s'appuyant sur des observations, les auteurs de cette recherche ont pu montrer comment l'activite de l'internaute portait a la fois sur le corpus (pour s'orienter et selectionner), sur le document (qu'il devait cependant en grande partie constituer lui-meme a partir des liens qu'il activait) et sur le signe (qui l'oblige a lire pour interpreter comme pour naviguer). Les trois activites manipuler, approprier, interpreter s'exercent tout autant sur les trois niveaux, corpus, document, signe. Les internautes observes ont tous manifeste a la fois la fascination et le desir que leur inspirait le Web mais aussi la frayeur, la desorientation et l'impuissance qu'il provoquait. Vivre le Web est en tant que tel une experience hypermoderne qui oblige a un remaniement considerable de tous nos reperes. Lecteur, oseras tu entrer dans l'outre-lecture ?
Integration of model checking into software development processes

Testing has been the dominant method for validation of software systems. As software systems become complex, conventional testing methods have become inadequate. Model checking is a powerful formal verification method. It supports systematic exploration of all states or execution paths of the system being verified. There are two major challenges in practical and scalable application of model checking to software systems: (1) the applicability of model checking to software systems and (2) the intrinsic complexity of model checking. In this dissertation, we have developed a comprehensive approach to integration of model checking into two emerging software development processes: Model-Driven Development (MDD) and Component-Based Development (CBD), and a combination of MDD and CBD. This approach addresses the two major challenges under the following framework: (1) bridging applicability gaps through automatic translation of software representations to directly model-checkable formal representations, (2) seamless integration of state space reduction algorithms in the translation through static analysis, and (3) scaling model checking capability and achieving state space reduction by systematically exploring compositional structures of software systems. We have integrated model checking into MDD by applying mature model checking techniques to industrial design-level software representations through automatic translation of these representations to the input formal representations of model checkers. We have developed a translation-based approach to compositional reasoning of software systems, which simplifies the proof, implementation, and application of compositional reasoning rules at the software system level by reusing the proof and implementation of existing compositional reasoning rules for directly model-checkable formal representations. We have developed an integrated state space reduction framework which systematically conducts a top-down decomposition of a large and complex software system into directly model-checkable components by exploring domain-specific knowledge. We have designed, implemented, and applied a bottom-up approach to model checking of component-based software systems, which composes verified systems from verified components and integrates model checking into CBD. We have further scaled model checking of component-based systems by exploring the synergy between MDD and CBD, i.e., specifying components in executable design languages, and realizing the bottom-up approach based on model checking of software designs through translation.
Distributed average consensus for wireless sensor networks

Wireless sensor networks have emerged a few years ago, enabling large scale sensing at low cost. There are many interesting problems related to this new sensing tool: designing robust and small hardware, defining adapted routing protocols, minimizing the energy consumption of each component, synchronizing the sensors, etc. In this thesis, we focus on the processing of the sensed data within the network itself. We study a specific network signal processing problem, called distributed average consensus. In this problem, the sensors, which are connected in a wireless network, need to know the average of all the measurements in the network. Instead of gathering the data at a central node, which would compute the average and broadcast it to the network, average consensus algorithms offer a distributed solution to the averaging problem. By local message passing and iterative local computations only, nodes can learn the average of the measurements. More precisely, in average consensus algorithms, nodes iteratively compute local weighted averages that conserve the global average of the estimates in the network. The estimates at each node contract until they all converge to the average. Many distributed average consensus algorithms were designed and the literature is vast. This thesis starts by classifying the existing algorithms. Then it describes a small number of useful techniques, which can handle the analysis of all the algorithms. Preexisting algorithms as well as algorithms that we designed are revisited with these unifying and simple techniques. In addition, the performance of the algorithms depends on the topology of the network, and a variety of networks are explored: simple graphs as circles or trees, lattices, random geometric graphs, complete graphs etc. Finally, an extension of average consensus to voting consensus is derived. In particular, we show that with two bits of memory at each node, a network can reach consensus in finite time on majority, when the initial measurements are binary. Distributed algorithms to compute majority with finite memory for ternary and quaternary signals are also given.
On some control problems in molecular biology

Deals with the control of a sequential machine whose model is not precisely known. The objective is to design a controller that assigns to the machine a prescribed steady-state behavior. The results include necessary and sufficient conditions for the existence of a controller, as well as algorithms for its design. This work is motivated by potential applications in biology. It is an abridged version of Hammer (1994). <<ETX>>
Adaptive analog IF signal processor for a wide-band CMOS wireless receiver

An IF strip for a wireless receiver supports a variable baud rate by changing analog filter bandwidth. Sliding and step adaptive dynamic range are both used at IF to dissipate only the necessary power at prevailing channel conditions. A combination of VGA and PGA is developed for 64-QAM. The total signal processor draws an average of 16 mA from 3.3 V and a peak of 73 mA. The differential input noise is as low as 3.9 nV//spl radic/Hz, while maximum IIP3 is +22 dBm with respect to 100 ohms.
A hardware scheduler for parallel processing in control applications

One approach to catering for the higher computational demands of modern digital control systems is to use parallel processing. Despite the many examples available which use this technique, it cannot be claimed that it is the natural choice of the control engineer for implementation. The premise for the work described in this paper is that parallel processing must be as transparent and convenient to the designer as a single processor solution, if it is to become an acceptable option. Problems such as deadlock, livelock, communication delays and network topologies contribute to the difficulty of parallel programming and should, as far as possible, be hidden from the user. The well-known processor farm paradigm is a step towards this goal because of its dynamic scheduling properties. However, control system applications generally involve processing relatively small amounts of data in short periods of time with a definite deadline which is more difficult to achieve than high average throughput on a large job. This paper describes a specialised hardware scheduler for a processor farm which minimises the overhead of scheduling multiple tasks to multiple processors. It also describes the harness software which allows the algorithm to be separately partitioned into tasks and incorporated as linked modules.
Turbo codes for OFDM with antenna diversity

OFDM with diversity and coding has been proposed as an effective means for achieving high-rates in wireless environments. Turbo codes have been shown to give near-capacity performance in additive white Gaussian noise (AWGN) channels and is being considered to enhance mobile wireless channel performance. In this paper, we present simulation results of an OFDM system with turbo coding. Comparisons with systems employing convolutional and Reed-Solomon (RS) codes are made. We first study diversity, interleaving and soft decoding for convolutional codes. The same structure is employed for turbo codes of similar complexity and varying word size. Even with a low constraint length, convolutional codes have the potential to outperform RS codes, provided that the interleaver and soft decoder are properly designed. We evaluate Turbo code performance under slow fading conditions and study the effects of changing word size. Increasing word size theoretically provides better interleaving between the two component codes. However, this advantage is less clear when the fading rate is significantly lower than the symbol rate, which is typical of the high data-rate system considered here. Under such conditions, the advantage of using two component convolutional codes in turbo codes is limited. A single convolutional code with higher constraint length may be a better choice.
Understanding the Message Logging Paradigm for Masking Process Crashes

Message logging is a popular technique for building systems that can tolerate process crashes and transient channel failures. The technique, which was first developed in the mid-80s, is popular because message logging protocols are relatively simple and require process replication only when a process fails. Surprisingly, however, very little attention has been given to the formal specification of the consistency property that these protocols implement in order to be able to recover failed processes to a consistent state. This dissertation presents the first such formal specification. From this specification, the two major classes of message logging protocols, namely optimistic and pessimistic, are characterized. A third and new class of message logging protocols, called causal, is introduced. A notion of optimality, based on three important performance metrics, is proposed, and it is shown that optimal implementations of causal message logging protocols exist. In particular, it is shown that causal message logging protocols combine the positive aspects of optimistic and pessimistic message logging. A subclass of causal message logging protocols, called family-based logging, is developed. Family-based logging protocols are optimal and have the additional attractive characteristic that the smaller the maximum number of concurrent failures, the lower their overhead. Furthermore, several compression techniques can be used to reduce this overhead. Finally, it is shown that family-based logging protocols can be implemented in order to take advantage of the different patterns of communication that systems exhibit.
Personal Connections in the Digital Age

List of illustrations. Acknowledgements. CHAPTER ONE: New forms of personal connection. CHAPTER TWO: Making New Media make sense. CHAPTER THREE: Communication in digital spaces. CHAPTER FOUR: Communities and Networks. CHAPTER FIVE: New relationships, new selves? CHAPTER SIX: Digital media in relational development and maintenance. CONCLUSION: The myth of cyberspace. REFERENCES.
Attention-based interaction between human and the robot Chiye

In this paper, we discuss attention-based interaction between robot Chiye and human. The visual attention is conducted by the three asynchronous parallel processing units: (1) target detection block, (2) target management block and (3) target observation block. The robot Chiye interacts with human according to the status of gazed objects. Two kinds of attention-based robot's behaviors are examined: (a) orientation behavior toward a human, and (b) handing-over behavior.
Network architectures for content-based routing

In this paper we present various network architectures for an intelligent content-based router that examines the data in a packet, and then routes the packet to a destination where it can be most quickly, cheaply, and efficiently processed. Before forwarding packets to their respective destinations, the router uses the data in each packet and the network state to determine a suitable destination address that can optimize processing of the packet. Thus, a packet may be redirected to a different destination address than was originally specified. This approach can be used to improve network bandwidth utilization by replicating network services (e.g., Web servers) and doing in-network selection of the "optimal" replica to use for a particular packet/request.
Core Techniques on Designing Network for Data Centers: A Comparative Analysis

With the fast development of data science and Internet technology, the bursting need for data storage and analysis makes it necessary to build up data centers. In this paper, we discuss the core techniques on designing network. Advances in data intensive computing and high performance computing facilitate rapid scaling of data center networks, resulting in a growing body of research exploring new network architectures that enhance scalability, cost effectiveness and performance. Understanding the tradeoffs between these different network architectures could not only help data center operators improve deployments, but also assist system designers to optimize applications running on top of them. We analyze the state-of-the-art network architectures of famous data centers and propose our novel core techniques. With the implementation and experiment, we verify the robustness of our proposed technology.
Proceedings of the 10th International Workshop on Quantum Physics and Logic

This volume contains the proceedings of the 10th International Workshop on Quantum Physics and Logic (QPL X), which was held July 17-19, 2013 at ICFO in Castelldefels (Barcelona), Spain. The goal of this workshop series is to bring together researchers working on mathematical foundations of quantum physics, quantum computing and spatio-temporal causal structures, and in particular those that use logical tools, ordered algebraic and category-theoretic structures, formal languages, semantic methods and other computer science methods for the study of physical behavior in general. Over the past few years, there has been growing activity in these foundational approaches, together with a renewed interest in the foundations of quantum theory, which complement the more mainstream research in quantum computation.
Diethyl 9,10‐endo‐ethano‐9,10‐di­hydro­anthracene‐11,11‐di­carboxyl­ate

The title compound, C22H22O4, possesses normal geometrical parameters and the dihedral angle between the two benzene ring planes is 57.62 (5)°. The crystal packing is controlled by van der Waals forces and a possible C—H⋯O interaction, the latter resulting in a supramolecular C(6) motif.
Adaptive Data Transmission Control for Multilane‐Based Ethernet

We propose a reconciliation sublayer (RS)‐based lane and traffic control protocol for energy‐efficient 40‐G/100‐G Ethernet. The RS performs active/inactive lane control and data rate adaptation depending on active lane information received from the upper layer. This protocol does not result in a processing delay in the media access control layer, nor is an additional buffer required at the physical layer for dynamic lane control. It ensures minimal delay and no overhead for the exchange of control frames and provides a simple adaptive data rate.
Matching Performance-Based Comparative Study of Fingerprint Sample Quality Measures

지문샘플의 품질은 지문인식 시스템에서 매칭 성능에 영향을 주는 중요한 요소이다. 지문인식 시스템에서 낮은 품질의 지문영상을 제거하면 인식 에러율이 현저하게 줄어드는 것을 알 수 있다. 본 논문에서는 minutiae 기반의 지문인식 알고리즘을 이용하여 단일 샘플 품질 측정방법에 대한 유효성을 평가하였다. 우선, minutiae 기반의 지문인식 알고리즘의 매칭성능에 영향을 주는 여러 가지 요소에 대하여 검증하고, 다음, 현재 흔히 사용하는 측정방법에 대해 연구하고, 그 중 효과적인 품질측정방법들을 선택하여 NIST, QualityCheck와 Verifinger 5. 0을 이용하여 비교분석 하였다. FVC 데이터베이스로 실험한 결과 단일 측정방법도 매칭성능을 효과적으로 향상함을 알 수 있었다.
An Approach to Extract Sentimental Messages from Twitter and its Application to Categorization of Human Group- Trial Visualization of Relation between Sentimental Tweeting and Behaviour of School Days -

Recent years have found that social media analysis can bring several kinds of effective results to us in the domains of industries, education, social science, economics, and so on. Such approaches, sometimes called sentiment analysis and/or opinion mining, are potentially applicable from trend analysis of industrial products or many services to visualization of human thinking, behaviour and/or emotion. This study focuses on Twitter used by students of universities, analyzes tweeting data(messages) by students from Twitter, and calculates sentimental values from the according data. It also investigates existence of some relations between calculated sentimental values and practical thought of students. At the same time, it tries to discuss whether the above procedure and analysis can visualize conventionally hidden relationship between contents of tweeting messages and characteristic behaviour of students in categorized universities. One of the aims of this research is to help young persons to choose their suitable universities and to provide some useful example for extraction of sentimental values from categorized groups.
The 8086/8088 Family of Microprocessors: Software, Hardware and System Applications

Fundamentals of digital logic and microprocessors. 8086 family of microprocessors. 8086/8088 microprocessors: architecture and busing schemes. Memory organization, data structures, and addressing modes. Instruction set and applications. Software, assembly programming considerations, and applications. Assembly programming applications. Hardware considerations, memory, and I/O interface techniques. I/O interface schemes and practical applications. Interrupt and DMA interface, and applications.
A Comparison of Three Usability Evaluation Methods: Heuristic, Think-Aloud, and Performance Testing

A high-fidelity prototype of an extended voice mail application was created. We tested it using three distinct usability testing paradigms so that we could compare the quantity and quality of the information obtained using each. The three methods employed were (1) heuristic evaluation, in which usability experts critique the user interface, (2) think-aloud testing, in which naive subjects comment on the system as they use it, and (3) performance testing, in which task completion times and error rates are collected as naive subjects interact with the system. The three testing methodologies were roughly equivalent in their ability to detect a core set of usability problems on a per evaluator basis. However, the heuristic and think-aloud evaluations were generally more sensitive, uncovering a broader array of problems in the user interface. Implications of these findings are discussed in terms of the costs of doing the evaluations and in light of other work on this topic.
An automated method for describing muscle fatigue

This paper reports on the development of a method to extract features related to fatigue from the isometric force (or moment) records of the quadriceps muscle during cyclic contractions. The force record is modelled as a three segment piece-wise linear curve consisting of an initial region of high force (the plateau), followed by a second segment of rapidly declining force production (transition) and a final region of little or no decline in force (steady state). Repeated maximal isometric contractions lasting 2.5 seconds and separated by 0.5 seconds of rest were elicited by applying 20 Hz bursts of tetanizing stimulation at an amplitude of 20 mA and a fixed pulse duration to individuals with complete spinal cord injuries via chronically indwelling percutaneous intramuscular electrodes. Raw data from a load-cell dynamometer were sampled at 100 Hz, reduced by averaging over the constant force portions of each contraction and low pass filtered at 0.25 Hz. The intersections of the three linear segments are first estimated by computing the inflection points of the resulting smooth record. The linearization is optimized by varying the positions of the intersection points until the mean squared error between the processed data and the piece-wise linear model was minimized. The slopes of the three segments and the locations of the two intersection points were recorded and used as features to characterize the fatiguability of the stimulated muscle. The algorithm also computes widely accepted measures such as the time to 50% reduction in initial force (T50), or extrapolates the values from incomplete data records. The procedure may be applicable to continuous contractions and may be valuable for determining the effects of various exercise programs designed to enhance muscular endurance, or to infer muscle fiber composition indirectly from the force record. <<ETX>>
A unified approach to speech enhancement and voice activity detection

In this paper, a unified system for voice activity detection (VAD) and speech enhancement is proposed. In the proposed system, there is mutual exchange of information between VAD and speech enhancement blocks. A new and robust VAD algorithm is implemented for the VAD block of the unified system. The newly proposed VAD algorithm uses a periodicity measure and an energy measure obtained from spectral energy distribution and spectral energy difference of the input speech data. For the speech enhancement block, the modified Wiener filtering (MWF) approach is utilized. It has been shown that the utilization of information exchange between the VAD and MWF algorithms in the unified system increases the performance of both algorithms and the proposed unified system improves the robustness of a speech recognition system significantly. Both of the enhanced algorithms are noniterative. Therefore, the proposed unified system is computationally attractive for real-time applications.
Using the mu -interaction measuring in the design and stability analysis of decentralized control structures

The results of using the mu -interaction measure as an analysis tool in systematically designing decentralized controllers for multivariable systems are given. The mu -interaction measure serves as the upper bound for the maximum allowable gains of a diagonal controller such that stability of the closed-loop diagonal system also implies stability of the closed loop full system. Several examples found in the literature are used to demonstrate this analysis technique. The diagonal controllers are designed using the internal model control method. An investigation has also been carried out to study the incorporation of model uncertainty into the mu -interaction measure analysis. Results indicate that, although the mu -interaction measure may render a somewhat conservative design, it does provide an effective means of assessing the stability of the full system when the controller design is based on the diagonalized plant system. <<ETX>>