Miracle-dz/UniFAR-FTUs huggingface dataset:
Eléments de description de l'orungu Langue bantu du Gabon (B11b)

L’etude presentee dans le cadre de cette these porte sur l’orungu, langue bantu classee B11b par M. Guthrie, parlee a l’Ouest du Gabon, dans la province de l’Ogooue Maritime, par l’un des peuples Ngwe-myene (ou Myene selon la denomination administrative). Cette these constitue une premiere description presentant l’ensemble des elements grammaticaux en incluant les plans segmental et tonal dans une analyse conjointe des niveaux phonologique, morphologique et post-lexical. On y traite, dans un premier temps, des phonemes qui caracterisent l’organisation structurelle de la langue, du systeme des classes nominales et leur implication dans les modifications formelles des lexemes, ainsi que de la description des alternances consonantiques. La deuxieme partie traite conjointement de la morphologie et de la tonologie des differents elements grammaticaux de la langue. L’etablissement des schemes tonals mene a montrer les processus de derivation qui sous-tendent le passage de la forme indefinie a la forme definie des nominaux. L’essentiel de la description verbale est base sur la derivation et la flexion verbale dans differents tiroirs de la conjugaison. La tonologie post-lexicale, enfin, decrit les modifications que subissent les schemes de tonalite propres aux lexemes lorsqu’ils sont a la fois places dans certains environnements tonals et dans certaines situations syntaxiques, en tenant compte du type tonal propre aux unites lexicales.This PhD-dissertation is a study of Orungu, a Bantu language classified as B11b by M. Guthrie and spoken by a Ngwe-myene people (or Myene according to the administrative denomination) in the Ogooue Maritime province of Western Gabon. It presents a first descriptive study of the language and offers a general view of its grammar. It describes the most important segmental and supra-segmental or tonal features of its phonology, morphology and syntax. The first part is a description of the phonemes of Orungu, its noun class system, and its typical consonant mutations. The second part deals with the nominal and verbal morphology and the role tone plays at this level. The establishment of tone schemes results in a demonstration of the processes involved in the derivation of definite nouns from indefinite nouns. The description of the verb morphology is focussed on verbal derivation strategies and on the complex TAM-system involved in the verbal conjugation. The third and final part is a study of the post-lexical tone system and describes the mutations that lexical tone schemes undergo when they occur in certain tonal contexts and/or certain syntactical constructions.
Approaches to Second Language Acquisition

The observable phenomena of SLA early linguistic approaches to explaining the observable phenomena of SLA sociolinguistic approaches to explaining the observable phenomena of SLA cognitive approaches to explaining the observable phenomena of SLA the approach to SLA based on universal grammar parametric variation and transfer in SLA parametric variation and incompleteness in SLA parametric variation, staged development and cross-learner systematicity in SLA parametric variation, variability and the limits of the explanatory power of universal grammar in SLA explanations of variability hypothesis creation and revision the development of language processing approaches to learner strategies towards a model of SLA.
Analysis of Time’s Influence on Change Regarding a Products Manner of Use

This paper proposes a specific definition for the manner of use and deeply analyzes the relationships among the way products are used and their changing design concepts in a bibliometrics method. Besides, the characteristics of how a product is used, the core element of industrial design and the medium of interaction between users and products are discussed from the historical perspective. Finally, it concludes that products' manner of use is the consolidated manifestations, which accomplish the usage and the emotional reflection of products with the analysis of the characteristic of times and the development of product design. The purpose of the research is to introduce the significance of manner of use in design process and design cognition. Authors try to establish a conceptual framework for further study on manner of use design and develop the theory of arts of design research.
Changes of Statistical Properties During the Creation of Graphic Artworks

During the creation of graphic artworks, we studied the evolution of higher-order statistical image properties (complexity, self-similarity, anisotropy of oriented luminance gradients, the slope of log–log plots of radially averaged Fourier power, and the fractal dimension). First, we analyzed two series of lithographs by Pablo Picasso, which represent transformations of highly aesthetic artworks. Second, one of the authors generated a dataset of 20 grayscale drawings using the computer as a drawing tool. The dataset comprised also the unfinished state images that were saved throughout the production process. The final states of the drawings were compared to versions of the same drawings, in which the constituent pictorial elements were shuffled, thereby diminishing the overall compositional intent of the artist. Results show that self-similarity was a property closely associated with artistic merit in the different types of images analyzed. In a psychological experiment, 20 non-expert participants evaluated the original abstract drawings as more harmonious and ordered but less interesting than the shuffled versions. Our study demonstrates that statistical image properties can be studied during the creation of artworks, if artistic and analytical processes are closely coordinated in a computer-based approach, which offers the possibility to produce appropriate control stimuli.
Emulation Of ASIC Based Network Processor On A FPGA Platform

ALL RIGHTS RESERVED iii ACKNOWLEDGEMENTS I am grateful to my thesis advisor Dr. Wendell A. Davis for giving me an opportunity to work under his guidance and support throughout the course of my thesis. I really respect all the time that you spent going through my reports and giving your valuable suggestions. I am also thankful to my committee members, Dr. Wei-Jen Lee and Dr. Enjun Xiao, for their support and their precious time. I take this opportunity to thank my mentor at Intel, Mr. James Kann without whose guidance it would have been a nightmare to understand the humungous documents and complex tools used in the project. It has been a pleasure and honor to work with him. I am also very grateful to my manager at Intel, Mr. Chandra Vora for giving me the opportunity to work in his department, Infrastructure Processor Division. I highly appreciate the support of all other colleagues in my department and other co-interns and friends at Intel for their encouragement and support. Exponential increase of device sizes and complexity of Application specific ICs (ASICs) mandate the need for design verification to meet timing specifications and functionality requirements. Verification techniques are broadly implemented in three categories viz., simulation, verification using commercial emulators and Field Programmable Gate Array (FPGA) based prototyping. An Intel architecture based network processor, to be taped out in the near future, is being emulated on FPGA based platform. The basic blocks of the Network Processor, for instance, the Memory Controller Hub (MCH) and I/O controller Hub (ICH) were synthesized to be configured on FPGAs. The work involved synthesizing v the design, partitioning it on multiple FPGAs and pin multiplexing of I/Os. Each sub unit of MCH and ICH were analyzed to resolve gated clocks not supported in FPGAs but widely used by ASIC designers for reducing power consumption. Synplicity's Certify tool is used for partitioning, pin multiplexing and for the gated clock fixes. FPGA compatible block RAMs were generated with Xilinx Coregen. The design is being configured on Xilinx Virtex-4 FPGAs which provide high performance and high density boards for prototyping ASICs with millions of transistors. Xilinx ISE 8.1 is used for place and route of the design and to implement it for generate bit files burnt on PROMs to be configured on FPGA boards.
Preservation of the Laetoli hominid trackway in Tanzania

Abstract The Laetoli hominid footprints in northwestern Tanzania are of major importance in understanding the evolution of humankind. The tracks are 3.6 million years old and pre-date the development of tool-making by one million years, providing clear evidence of the precedence of bipedalism over evolution of the brain. The site was excavated in the late 1970s by Mary Leakey, documented and reburied. In subsequent years, re-vegetation occurred and damage from root growth resulted. Of particular interest in relation to reburial as a preservation strategy is the fact that serious damage occurred to a unique scientific and cultural site because subsequent monitoring and maintenance of the reburial were not carried out. This paper presents an overview of the strategy developed between 1992 and 1994 for the preservation of the trackway, which takes into consideration the many and complex requirements of preserving outdoor sites, and describes the re-excavation, conservation, documentation and reburial of the .
Page allocation to reduce access time of physical caches

A simple modification to an operating system''s page allocation algorithm can give physically addressed caches the speed of virtually addressed caches. Colored page allocation reduces the number of bits that need to be translated before cache access, allowing large low-associativity caches to be indexed before address translation, which reduces the latency to the processor. The colored allocation also has other benefits: caches miss less (in general) and more uniformly, and the inclusion principle holds for second level caches with less associativity. However, the colored allocation requires main memory partitioning, and more common bits for shared virtual addresses. Simulation results show high non-uniformity of cache miss rates for normal allocation. Analysis demonstrates the extent of second-level cache inclusion, and the reduction in effective main-memory due to partitioning.
Konzeption, Implementierung und Evaluation eines Rahmenwerks zur Auslesung der Herzfrequenz durch Fitnesstracker in Android

Im Rahmen der Forschungsarbeit des DBIS Instituts entstand in Zusammenarbeit mit der Tinnitus Research Initiative (TRI) der Universitat Regensburg ein Projekt namens TrackYourTinnitus (TYT), das auf der Mobile Crowd Sensing Forschung basiert. Fur die Android Applikation dieses Projekts entstand die Anforderung, Fitnesstracker bei der Patientenbefragung miteinzubunden, um deren Herzfrequenz zu beziehen. Ziel dieser Arbeit ist die Architektur und Implementierung eines Rahmenwerks, das dies auf flexible Weise ermoglicht.
AQ21 USER 'S GUIDE

AQ21 is a multitask machine learning and data mining system for attributional rule learning, rule testing, and application to a wide range of classification pr oblems. One of its distinctive features is that it strives to perform natural induction, that is, it seeks inductive hypotheses that are not only accurate but also easy to understand and interpret. Although the system provides the user with a large number of control parameters, they all can be omitted if one wa nts to run it in default mode. The parameters control the mode of learning (theory formation vs. pa ttern discovery), the degree of generality of learned rules, and a range of preference cr iteria for selecting candidate rules that tailor the learning process to the given problem. AQ21 includes event and epis o e classification programs (ATEST and EPIC) that give the user control over the testi ng and application of the learned rulesets to the task at hand.
Parallel Rendering with Radiance

Interactive global illumination at interactive rates is still an unachieved goal for medium to large complexity scenes and high fldelity illumination models, such as the one used by Radiance. In order to achieve this goal several difierent optimization approaches must be exploited, including parallelism, perceptual issues and low{level optimizations. This work concentrates on developing a parallel message passing prototype of Radiance’s renderer targeted towards producing animations. This prototype is used to study scalability issues and perceptual optimizations that will reduce rendering times and will, hopefully, be unnoticed by the viewer. The preliminary results obtained suggest that efiorts should concentrate on reducing idle times due to suboptimal load distribution and indirect irradiance calculation times. Also psychophysical experiments and perceptual metrics should be carried on, in order to assess the impact of selective rendering on perceived quality.
Lateral Inhibition Enhances the Detectability of a Pure Tone in the Presence of Background Noise

An ideal detector may be, and in general is, very complicated. We therefore assume that lateral inhibition is already the detector, viz., a detector for edges or lines. Lines in the visual system correspond to pure tones in the auditory system. A natural task for the auditory system is to detect pure tones in the presence of background noise. (Most natural stimuli are not pure tones, but they contain tonal parts that have to be identified.) The simplest and, at least at the moment, most plausible detector is one that only considers the firing rate of a neuron in a row of tonotopically organized auditory neurons. Such a detector can be implemented on a neuronal basis very easily. It only has to fire if e.g. in the last 100 milliseconds more than a critical number of input spikes have arrived. If there is only background noise (open circles; see below), an input neuron’s firing rate tends to be lower than if there is an additional pure tone (full circles) at or near the best frequency of the input neuron. The critical number of incoming spikes above which the detector votes for “there is a pure tone” is always optimally adjusted, i.e., the error rate of the detector is minimized. This minimal error rate, however, is even lower when additional inhibition between the neurons is switched on. We illustrate this in a simulation of a row of laterally inhibited spiking neurons using the spike response model [2]:
An Assumptions Management Framework for Systems Software

Critical systems in areas ranging from avionics to consumer car control systems are being built by integrating commercial-off-the-shelf (COTS) components. Software components used in these systems need to satisfy many formally unexpressed, yet necessary conditions, termed as assumptions, for their correct functioning. Invalid assumptions have been determined to be the root cause of failures in many such systems; for example, in the Ariane 5 rocket failure. In the current software engineering practices, many of these assumptions are not recorded in a machine-checkable format, which makes validating the assumptions a manual and an error-prone task. This thesis examines this problem in detail and evolves a framework, called the assumptions management framework (AMF), which provides a vocabulary for discussing assumptions, a language for encoding assumptions in a machine-checkable format and facilities to manage the assumptions in terms of composition and setting policies on assumption validation. A relevant subset of assumptions can be validated or flagged as invalid automatically as the system evolves. AMF allows the assumption specification process to blend with the components' source-code and architecture specification. This enables AMF to be applied to existing systems with minor or no modifications in components' implementation and design. Performance and scalability tests show that the AMF implementation is scalable to be applied to large-scale systems. Case-studies were conducted on representative systems to study the nature and number of defects caused by invalid assumptions. It was found that a significant number of defects in the systems studied had invalid assumptions as the root-cause. It was found that AMF has the ability to encode and validate majority of the assumptions that caused defects in these systems. This can prevent such defects in the future or warn in advance of potential defects when assumptions are invalid. Analyzing and correcting one of the invalid assumptions in Iperf, an end-to-end bandwidth measurement tool, resulted in significantly better bandwidth estimates by Iperf across high-bandwidth networks. In most cases, it also resulted in savings of over 90% in terms of both network traffic generated and bandwidth measurement times.
Agrupamento de dados visual interactivo

With the rising generation, storage and dissemination of information in recent years, the previous problem of lack of information has become a problem of extracting useful knowledge from the information available. The visual representations of abstract information have been used to assist in interpreting the data and reveal otherwise hidden patterns. Information visualization seeks to enhance human cognition by leveraging human visual capabilities to make sense of abstract information, providing means by which humans with constant perceptual abilities can absorb increasing amounts of information. Data clustering techniques purpose is to partition a data set into several clusters, in which similar data is placed in the same cluster and dissimilar data in different clusters. More specifically, constrained clustering methods are intended to incorporate a priori knowledge in the clustering process, in order to improve data clustering quality and, simultaneously, find appropriate solutions to specific tasks or interests . This thesis studied the interactive visual clustering approach that allows the user, through interaction with a visual representation of information, to incorporate prior knowledge about the data domain in order to influence the resulting grouping to meet its objectives. This approach combines and extends interactive information visualization, force directed graph layout and constrained clustering techniques. With the purpose of evaluating the performance of different user interaction strategies, comparative studies using sets of synthetic and real data are performed.
Algorithms for training large-scale linear programming support vector regression and classification

The main contribution of this dissertation is the development of a method to train a Support Vector Regression (SVR) model for the large-scale case where the number of training samples supersedes the computational resources. The proposed scheme consists of posing the SVR problem entirely as a Linear Programming (LP) problem and on the development of a sequential optimization method based on variables decomposition, constraints decomposition, and the use of primal-dual interior point methods. Experimental results demonstrate that the proposed approach has comparable performance with other SV-based classifiers. Particularly, experiments demonstrate that as the problem size increases, the sparser the solution becomes, and more computational efficiency can be gained in comparison with other methods. To reduce the LP-SVR training time, a method is developed that takes advantage of the fact that the support vectors (SVs) are likely to lie on the convex hull of each class. The algorithm uses the Mahalanobis distance from the class sample mean in order to rank each sample in the training set; then the samples with the largest distances are used as part of the initial working set. Experimental results show a reduction in the total training time as well as a significant decrease in the total iterations percentage. Results also suggest that using the speedup strategy, the SVs are found earlier in the learning process. Also, this research introduces a method to find the set of LP-SVR hyper-parameters; experimental results show that the algorithm provides hyper-parameters that minimize an estimate of the true test generalization error. Finally, the SVR scheme shows state-of-the-art performance in various applications such as power load prediction forecasting, texture-based image segmentation, and classification of remotely sensed imagery. This demonstrates that the proposed learning scheme and the LP-SVR model are robust and efficient when compared with other methodologies for large-scale problems.
Application of Chaotic Characteristics about Multiple Physiological Signals in Emotion Recognition

Changes of physiological signals are affected by human emotions, but also the emotional fluctuations are reflected by the body's variation of physiological signal's feature. Physiological signal is a non-linear signal, nonlinear dynamics and biomedical engineering, which based on chaos theory, providing us a new method for studying on the parameters of these complex physiological signals which can hardly described by the classical theory. This paper shows physiological emotion signal recognition system based on the chaotic characteristics, and than describes some current applications of chaotic characteristics for multiple physiological signals on emotional recognition.
Key Performance Indicators in Cloud Computing

– Cloud computing has garnered popular support in a relatively short span of time. It is a new method of delivering the distributed resources over internet. It reduces capital expenditure as well as operational expenditure. The number of cloud service providers (CSPs) who provide computing as a utility has increased exponentially in the past few years, providing more options for the customers to choose from. In this paper a model for Trust Management based on Fuzzy Logic has been developed, which can help consumers make an informed choice towards selecting the appropriate CSP as per their requirement.
Tool Support for Scenario-Based Architecture Evaluation.

Architectural considerations play a key role in the success of any software-based development project. Architecture evaluation is an early risk reduction method for identifying risks that prevent a system or product line meeting the organization’s business goals and customer needs. This paper introduces a tool that supports architecture evaluation. It gives an overview on its information management capabilities and discusses development issues as well as the underlying data model.
INCORPORATING UNBOUNDED ALGORITHMS INTO PREDICTABLE REAL-TIME SYSTEMS

The incorporation of unbounded components (i.e. software modules that cannot be analysed to produce realistic worst case execution times) into hard real-time applications has been recognised as a key issue for the next generation of systems. We present an system model that caters for the three main approaches to integrating unbounded components — imprecise computation, sieve functions and multiple versions. This model is feasible because it is supported by schedulability tests that will guarantee the bounded tasks. These test are defined in the paper. A simple computational model that uses preemptive priority-based dispatching is required. The wide-spread use of techniques such as imprecise computation will only happen if they are integrated into standard software engineering methods. We therefore show how the techniques can be realised in Ada 9X. hhhhhhhhhhhhhhh † This work is supported, in part, by the UK Information Engineering Advanced Technology Programme, Grant GR/F 35920/4/1/1214