Miracle-dz/UniFAR-FTUs huggingface dataset:
Modification and reference in the Chinese nominal

Modification and reference in the Chinese nominal investigates the encoding of referential properties in the Chinese nominal. This study argues that even though Chinese does not have articles, the encoding of referential properties can still be detected by looking at modified noun phrases. This study proposes a theory for the encoding of specificity and definiteness in the Chinese nominal based on Cantonese, Mandarin and Wenzhou data. By manipulating the positions of modifiers, it is shown that in Chinese, some structure to the left of the Numeral Phrase is responsible for the encoding of specificity, an observation that is obscured in unmodified noun phrases. This motivates the existence of a projection called the Specificity Phrase in Chinese. The Specificity Phrase is present in all specific noun phrases but absent in non-specific ones. The tie between specificity and definiteness is captured by an AGREE relation between the Specificity Phrase and the Classifier Phrase. The latter is where definiteness is encoded. The interplay between the two projections determines the overall referential properties of a noun phrase. Modifiers in Chinese come in two types. They appear either bare or with a modification marker element. The two types of modifiers interact differently with the referential property of the noun phrase and deserve different structural status. This study argues that bare modifiers are specifiers and marker modifiers are adjuncts, motivated by their distinct distributions and licensing requirements. The theory proposed here has been extended to non-Chinese languages like Miao and Zhuang. This thesis is of relevance to anyone interested in the study of the referential properties of noun phrases, nominal modification, or in the study of different languages in China.
Postmoderne branding - Nespresso

I takt med globaliseringen er verden blevet mindre og mulighederne storre. Det har skabt et marked med masser af tilbud og konkurrence og dermed forbrugere, der konstant star over for fristelser, der styrer forbruget. Det har gjort den postmoderne forbruger mere illoyal og individualistisk. Samtidig lever postmoderne forbrugere en fragmenteret livsstil, hvor forbruget bliver en made at positionere sig pa. Som folge er forbruget blevet langt mere komplekst, da produkter ikke laengere kobes efter rationelle valg og praktiske formal. I stedet kobes der brands, vaerdier, livsstile og dromme i forsog pa at skabe en individuel identitet. Nespresso er et af de brands, der har formaet at stimulere de illoyale forbrugerne og positionere sig som en succes i det postmoderne paradigme. I opgaven her undersoges, med udgangspunkt i Nespresso, hvordan postmoderne branding kan tage form. Dette gores ved at se pa interaktionen mellem brands og kultur, herunder hvordan brands tilfores kulturel vaerdi og appellerer til den postmoderne forbrugskultur.
Vulnerability Type Distributions in CVE

The invention concerns a new and novel device for connecting a beam or tow bar to a touring trailer or caravan. More particularly, the invention relates to a device for connecting two metallic components. The device comprises intermediate connecting components cut from a profile of light metal alloy. These components are mounted to the chassis and the towing beam and are made from a deformable, supple and insulating material so that these components provide an insulating media between different metals and, further, absorb the violent stresses transmitted to the towing beam.
Pengembangan Model Pelatihan Sensitivitas terhadap ANank Berkebutuhan Khusus bagi Siswa Reguler di Sekolah Inklusi

Tujuan penelitian ini adalah: (1) mengetahui sensitivitas siswa reguler terhadap anak berkebutuhan khusus di skeolah inklusi, (2) mengetahui model pelatihan yang efektif bagi siswa reguler di sekolah inklusi, dan (3) mengetahui efektifitas penggunaan model pelatihan sensitivitas terhadap anak berkebutuhan khusus bagi siswa reguler di sekolah inklusi. Penelitian ini menggunakan pendekatan Research and Development (R&D) dengan tahapan sebagai berikut: (1) studi pendahuluan untuk mengetahui sensitivitas siswa reguler terhadap anak berkebutuhan khusus di sekolah inklusi dan kebutuhan siswa reguler terhadap pelatihan sensitivitas, (2) pengembangan model pelatihan sensitivitas di sekolah inklusi, dan (3) menguji keefektifan model pelatihan sensitivitas di sekolah inklusi. Penelitian ini dilaksanakan di Kota Surakarta. Partisipan dalam penelitian ini adalah seluruh sekolah inklusi tingkat SMA dan SMK di Kota Surakarta. Pengumpulan data dilakukan dengan teknik angket menggunakan instrumen yang telah di uji validasi dan reliabilitas secara statistik maupun validasi ahli. Analisis data menggunakan gabungan antara analisis deskriptif kuantitatif dan kualitatif. Hasil penelitian pendahuluan menunjukkan bahwa sensitivitas siswa reguler terhadap siswa berkebutuhan khusus saat ini di sekolah inklusi di Kota Surakarta masih masuk dalam kategori sedang cenderung rendah. Hasil pengembangan model pelatihan sensitivitas di sekolah inklusi yang dianggap efektif adalah model pelatihan yang menggunakan tahapan terstruktur (mulai dari meganalisis kebutuhan, desain, pengembangan, pelaksanaan dan evaluasi), memiliki materi yang sesuai dengan tujuan diadakan pelatihan, metode yang menarik seperti video dan simulasi, serta evaluasi yang menyeluruh (hasil dan proses). Hasil uji efektifitas model pelatihan menunjukkan bahwa model dan buku panduan pelatihan sensitivitas terhadap anak berkebutuhan khusus yang dikembangkan dinilai efektif. Kata Kunci : model pelatihan, sensitivitas, anak berkebutuhan khusus, pendidikan inklusi
Evaluierung effizienter Methoden zur Berechnung des optischen Flusses

Evaluation of Efficient Methods for Optical Flow Computation. The efficient computation of optical flow is a prerequisite for a large number of applications, which led to the development of various different optical flow algorithms in the past years. Optical flow describes for each pixel in the first image its position in the second image. Hence, it provides the basis to analyze ego-motion or motion of objects between two images in a pixel-wise fashion. Despite of the fact that many efficient solutions to calculate the optical flow have been developed in the past, there is a lack of research simultaneously comparing the accuracy and the run-time efficiency of these algorithms systematically. After the mathematical definition of the optical flow, the basic principles of four selected methods of optical flow computation are explained. The main contribution of this article is the evaluation of these algorithms. The studied algorithms are on the one hand so called multigrid methods and on the other hand approaches that are based on wavelet decomposition. All algorithms have in common that they prospect high performance. The motivation of the evaluation is to help the reader to find the most suitable algorithm for his task. Zusammenfassung: Die effiziente Berechnung des optischen Flusses zwischen zwei Bildern ist Voraussetzung für eine Vielzahl von Anwendungen und daher in der Bildverarbeitung weiterhin aktuelles Forschungsthema. Der optische Fluss beschreibt für jeden Bildpunkt in einem Bild einer Bildfolge dessen Position im darauffolgenden Bild der Bildfolge. Damit lassen sich z. B. Bewegungsabläufe innerhalb einer Bildsequenz analysieren. In den letzten Jahren wurden verschiedene effiziente Lösungsmöglichkeiten entwickelt. Jedoch mangelt es an Arbeiten, die die Laufzeiteffizienzen dieser Algorithmen deren Genauigkeiten systematisch gegenüberstellen. Nach einer mathematischen Definition des optischen Flusses werden in diesem Artikel die Grundprinzipien von vier ausgewählten Algorithmen erläutert. Der Hauptbeitrag des Artikels ist die Evaluierung dieser Lösungsansätze. Bei den untersuchten Algorithmen handelt es sich um so genannte Mehrgitterverfahren sowie um Verfahren, die auf Wavelets beruhen. Allen gemeinsam ist, dass sie eine hohe Laufzeiteffizienz versprechen. Ziel der Evaluierung ist dabei auch, dem Leser eine Hilfestellung bei der Algorithmenwahl für seine spezielle Anwendung zu geben.
Broadcasting and streaming stored video

This thesis studies distribution schemes for stored video over broadcast networks and over the Internet. In the first part of the thesis we consider designing near Video on Demand (VoD) systems that minimize start-up latency while maintaining high-image quality. We propose a novel scheme for near VoD which is based on periodic broadcasting of VBR-encoded video, and develop a series of multiplexing schemes for broadcasting VBR video that are based on smoothing, buffering and client prefetching. Our multiplexing schemes achieve high link utilization with negligible packet loss, and result in significant reductions in the start-up latency relative to the CBR case. In the second part of the thesis, we consider the design of stored video streaming applications for the current Internet. We first develop a theoretical formulation and analysis for the streaming of layered-encoded video. We suppose that the video is encoded into two layers and model the bandwidth available to the application as a stochastic process whose statistical characteristics are unknown a priori. We address the problem of dynamically allocating the available bandwidth among the two layers in order to minimize the impact of client starvation on the quality of the decoded video stream. We next consider streaming stored video over actual fair-share bandwidth conditions. We perform a series of Internet experiments in which we collect TCP throughput traces. We find that fair-share bandwidth varies over a broad range of time scales. We investigate the impact of the long-term behavior of fair-share bandwidth on several data transmission schemes for streaming video. We quantify the performance gains achieved with prefetching non-layered video into client buffers during playback. For layered video, we propose threshold-based inter-layer bandwidth allocation schemes, and develop a heuristic for implementing such schemes. Finally, the thesis presents a comparison study of two rate adaptation techniques for video streaming, namely, layered streaming and switching among multiple encoded versions of the same video object.
Compiler optimizations for an asynchronous stream-oriented programming language

Stream-oriented programs allow different opportunities for optimization than procedural programs. Moreover, as compared to purely synchronous stream-oriented programs, optimizing for asynchronous stream-based programs is difficult, owing to the latters' inherent unpredictability. In this thesis, we present several compiler optimizations for WaveScript, a high-level, functional, stream-oriented programming language. We also present a framework for using profiling of stream-graph execution to drive optimizations; two of the optimizations use this profiled information to generate noticeable performance benefits for real-world applications written in WaveScript. Thus, it is shown that profiling presents an important avenue by which to optimize asynchronous stream-based programs. Thesis Supervisor: Samuel Madden Title: ITT Career Development Professor
A Review Paper on Biometrics: Fingerprint and Speech Recognition

With the advancement of automated system the complexity for integration & recognition problem is growing day by day. The impasse is found more compounds when dispensation on randomly varying analog signals such as speech signals or physical traits like fingerprints. This paper contain survey of papers which present a range of approach for the recognition of speech and fingerprint.
ScienceDirect Eleventh International Multi-Conference on Information Processing-2015 ( IMCIP-2015 ) Modified Eigen Vectors Arrangement for Better Representation of Images in Low Dimension

Dimension reduction techniques, PCA and LDA give preference to eigenvectors corresponding to higher Eigen values. This theory is not appropriate for all types of applications. In this work a new way of arranging the eigenvectors is explored. The proposed method combines the concept of correlation with a variability measure ‘range’ to rank dimensions and hence the eigenvectors. PCA and LDA are modified to incorporate the proposed dimension ranking method. Experiments are conducted with WANG and ZuBuD databases, and the performance is evaluated using precision values of a developed CBIR system for traditional as well as modified versions of PCA and LDA. © 2015 The Authors. Published by Elsevier B.V. Peer-review under responsibility of organizing committee of the Eleventh International Multi-Conference on Information Processing-2015 (IMCIP-2015).
Burcas : A Simple Concatenation-based MIDI-to-Singing Voice Synthesis System for Swedish

After a brief outlook on the field of concatenative synthesis of singing, with emphasis on the differences in comparison to synthesis of speech, the present paper gives an overview of a simple system for singing synthesis in Swedish based on concatenation of diphones. The system, called Burcas, accepts as input a text file for lyrics, from which it extracts a target phoneme sequence using basic letter-to-sound conversion, and a MIDI file? possibly holding multiple parts? , from which it extracts melodical information, i.e. note duration and frequency. After associating a syllable (or a part of a syllable) to each note, a simple model of segment durations is used to calculate the duration of each segment of the syllable. Finally, segment data are then used as control parameters (allophone, duration, frequency) for the MBROLA speech generator. The speech generator outputs sound files in standard format, given a suitable diphone database. In a concluding section, the far more sophisticated corpus-based approach to concatenative synthesis of singing is considered.
A method for evaluating the effects of performance degradations on communications network application

A novel method and model for evaluating the combined effects of performance degradations and hardware/software failures on specific network tasks are presented. This approach to quantifying the performance of complex communications networks and services allows easier identification of the components and performance characteristics that most severely affect applications. The model can be used as an analysis tool to set objectives, evaluate new services, and improve the end-to-end availability/reliability for a given network application. A Markov model of component performance that allows for dependencies between degradations and the onset of failure is developed and used to determine the reliability and availability of individual network tasks. Network performance is then described by the performance of the various tasks which it supports. Closed-form expressions for availability, reliability, and the mean time to recover from impairment conditions are derived. An example is given to illustrate the method. <<ETX>>
Load-balancing using autonomous co-operating nodes

The existing distributed environments are well suited for time-consuming applications enabling a de-centralized processing. Approaches like active networks and other programmable network designs open the way for new techniques of distributed computing. One of the problems still needed to be addressed is balancing. The paper addresses the specification of the future environment for distributed computing and the need for load-balancing. The structure of the network node is proposed.
Localized Key Finding: Algorithms and Applications

We consider the problem of determining a localized tonal context in a musical composition. Our method is based in part on a key-finding algorithm developed by Krumhansl and Schmuckler (Krumhansl, 1990) and is applied in a sliding-window fashion, producing a sequence of key assignments. These assignments constitute so-called class data in that they possess no natural numerical properties and can be considered as arising from a classification process. A new approach for smoothing such class data using graph theoretic norm estimates is applied to the sequence of key assignments. The effectiveness of the proposed method is evaluated by comparing it with judgments made by experts. Then, the problem is placed in the context of machine recognition of music patterns. We discuss a music pattern recognition system proposed by Coyle and Shmulevich (1998) that relies on robust determination of localized tonal context. This, in turn, allows the system to incorporate perceptual error criteria.
Absolute OpenBSD: Unix for the Practical Paranoid

The definitive guide to OpenBSDForeword by Henning Brauer, OpenBSD PF DeveloperOpenBSD, the elegant, highly secure Unix-like operating system, is widely used as the basis for critical DNS servers, routers, firewalls, and more. This long-awaited second edition of Absolute OpenBSD maintains author Michael Lucas's trademark straightforward and practical approach that readers have enjoyed for years. You'll learn the intricacies of the platform, the technical details behind certain design decisions, and best practices, with bits of humor sprinkled throughout. This edition has been completely updated for OpenBSD 5.3, including new coverage of OpenBSD's boot system, security features like W^X and ProPolice, and advanced networking techniques.You'll learn how to: Manage network traffic with VLANs, trunks, IPv6, and the PF packet filter Make software management quick and effective using the ports and packages system Give users only the access they need with groups, sudo, and chroots Configure OpenBSD's secure implementations of SNMP, DHCP, NTP, hardware sensors, and more Customize the installation and upgrade processes for your network and hardware, or build a custom OpenBSD releaseWhether you're a new user looking for a complete introduction to OpenBSD or an experienced sysadmin looking for a refresher, Absolute OpenBSD, 2nd Edition will give you everything you need to master the intricacies of the world's most secure operating system. "The definitive book on OpenBSD gets a long-overdue refresh. " -Theo de Raadt, OpenBSD Founder
SIMULTANEOUS AND SINGLE GENE EXPRESSION: COMPUTATIONAL ANALYSIS FOR MALARIA TREATMENT DISCOVERY

The major aim of this work is to develop an efficient and effective k-means algorithm to cluster malaria microarray data to enable the extraction of a functional relationship of genes for malaria treatment discovery. However, traditional k-means and most k-means variants are still computationally expensive for large datasets such as microarray data, which have large datasets with a large dimension size d. Huge data is generated and biologists have the challenge of extracting useful information from volumes of microarray data. Firstly, in this work, we develop a novel k-means algorithm, which is simple but more efficient than the traditional k-means and the recent enhanced k-means. Using our method, the new k-means algorithm is able to save significant computation time at each iteration and thus arrive at an O(nk2) expected run time. Our new algorithm is based on the recently established relationship between principal component analysis and the k-means clustering. We further prove that our algorithm is correct theoretically. Results obtained from testing the algorithm on three biological data and three non-biological data also indicate that our algorithm is empirically faster than other known k-means algorithms. We assessed the quality of our algorithm clusters against the clusters of known structure using the Hubert-Arabie Adjusted Rand index (ARIHA), we found that when k is close to d, the quality is good (ARIHA > 0.8) and when k is not close to d, the quality of our new k-means algorithm is excellent (ARIHA > 0.9). We compare three different k-means algorithms including our novel Metric Matrics k-means (MMk-means), results from an in-vitro microarray data with the classification from an in-vivo microarray data in order to perform a comparative functional classification of P. falciparum genes and further validate the effectiveness of our MMk-means algorithm. Results from this study indicate that the resulting distribution of the comparison of the three algorithms’ in- vitro clusters against the in-vivo clusters is similar, thereby authenticating our MMk-means method and its effectiveness. Lastly using clustering, R programming (with Wilcoxon statistical test on this platform) and the new microarray data of P. yoelli at the liver stage and the P. falciparum microarray data at the blood stages, we extracted twenty nine (29) viable P. falciparum and P. yoelli genes that can be used for designing a Polymerase Chain Reaction (PCR) primer experiment for the detection of malaria at the liver stage. Due to the intellectual property right, we are unable to list these genes here.
Decision support in the data warehouse

From the Publisher: Decision Support in the Data Warehouse demystifies data warehousing's technical jargon and provides a complete framework for building, maintaining, and using a data warehouse for decision support. This is the first book that integrates building and operating a data warehouse; developing decision support applications using the warehouse; and using the right warehouse tools. The book clearly describes the business and technical issues important to data warehousing success. They are brought to life with up-to-the-minute case studies drawn from today's leading organizations. Learn how to have a strategic business impact with your warehouse.
‘France Inter Active’: A Hypermedia Approach to Language Training

SUMMARY The development of optical storage media for powerful microcomputers capable of presenting broadcast quality video images combined with contemporary interactive hypermedia models of knowledge representation and the ‘communicative competence’ model of language acquisition make the development of effective multimedia computer‐assisted language learning a realistic possibility. This paper describes an interactive hypermedia approach to language training currently being developed by the Computer‐Assisted Language Study and Acquisition (CALSA) Unit at Teesside Polytechnic. The CALSA Unit was established with funding from the UK Training Agency (TEED) for the express purpose of exploiting current advances in microcomputing technology to develop a cost‐effective means of providing an opportunity for a wide variety of potential learners to acquire a second language. The object of this paper is to describe the aims and objectives of this project and its progress to date.
Lambda: The Ultimate Imperative

We demonstrate how to model the following common programming constructs in terms of an applicative order language similar to LISP: Simple Recursion, Iteration, Compound Statements and Expressions, GO TO and Assignment, Continuation-Passing, Escape Expressions, Fluid Variables, Call by Name, Call by Need, and Call by Reference. The models require only (possibly self-referent) lambda application, conditionals, and (rarely) assignment. No complex data structures such as stacks are used. The models are transparent, involving only local syntactic transformations. This paper is partly tutorial in intent, gathering all the models together for purposes of context.
Radar HRRP classification with support vector machines

The SVM (support vector machine) has good generalization property and is proven to be a powerful classification method to a wide variety of applications. In this paper, the SVM classification method is applies to the HRRP (high resolution range profile) classification problem. Furthermore, we propose a preprocessing method and present a new SVM model selection method, the combined leave-one-out cross-validation scheme with VC bound method. Accordingly, the SVM classifiers for five aircraft are designed. Their anti-noise performance and tolerance to aspect variation are compared with that of MCM (maximum correlation method). The experimental results indicate that the preprocessing procedure and model selection method are effective and the SVM method has potential in radar complex target classification.