Miracle-dz/UniFAR-FTUs huggingface dataset:
Robust automatic time alignment of orthographic transcriptions with unconstrained speech

A method for automatic time alignment of orthographically transcribed speech using supervised speaker-independent automatic speech recognition based on the orthographic transcription, an online dictionary, and HMM phone models is presented. This method successfully aligns transcriptions with speech in unconstrained 5 to 10 min conversations collected over long-distance telephone lines. It requires minimal manual processing and generally produces correct alignments despite the challenging nature of the data. The robustness and efficiency of the method make it a practical tool for very large speech corpora. <<ETX>>
Radiometric and structural measurements of snow samples

A new method to determine the scattering and absorption behavior of dry snow based on radiometric measurements is presented. Brightness temperatures of homogeneous samples were measured in the frequency range from 11 to 94 GHz to calculate transmissivities and reflectivities including a type of attenuation coefficient. Full characterization of the samples has been done including determination of autocorrelation functions. The authors discuss the relationship between radiometric and physical parameters of the snow samples.
Introduction to Research Methods and Data Analysis in Psychology

SECTION 1: INTRODUCING RESEARCH METHODS. 1. Research in the Social Sciences. 2. Variables - definitions and measurement. 3. Reliability, Validity, Sampling and Groups. 4. Collecting Data 1 - Interviews, observation, and questionnaires. 5. Collecting Data 2 - Experimental and quasi-experimental designs. SECTION 2: ANALYSING QUANTITATIVE DATA USING SPSS FOR WINDOWS. 6. Fundamentals of statistics. 7. Entering and manipulating data. 8. Graphical representation and descriptive statistics. 9. Bivariate analysis 1 - Exploring differences between variables. 10. Bivariate analysis 2 - Exploring relationships between variables. 11. Analysis of variance. 12. Regression. SECTION 3: ANALYSING QUALITATIVE DATA. 13. Fundamentals of qualitative analysis. 14. Transcription, coding and organising textual data. 15. Phenomenological Research Methods. 16. Grounded Theory. 17. Ethnography and Life-story research. 18. Discourse analysis. 19. The use of computers in qualitative research. SECTION 4: REPORTING FINDINGS. 20. Ethnics and politics of psychological research. 21. Reporting and presenting findings.
A k-nearest neighbour method for managing the evolution of a learning base

A character recognition system with continuous learning seeks to constantly enhance its base representation models in order to provide the best recognition rate. The method we are presenting enables the system to enhance its base with models, which are performant in recognition. This method also enables to get rid of models regularly doubtable in efficiency when it comes to interpretation of the characters studied. This rule is similar to the one used in the "Death by suffocation" game of life of Conway. We based ourselves on the theory of k-nearest neighbours to develop a new approach we named /spl epsiv/-adaptive neighbourhood. It makes an adjustment of classes possible, according to confidence rate in each model of the learning base. These rates which are practically represented as weights are taken into account by the stage of the recognition system during the character recognition phase. The use of weight as a model selection factor, useful for recognition, enables the system to manage the evolution of the learning base.
Investigations into the role of lexical semantics in word sense disambiguation

Verbs that can have more than one meaning pose problems for Natural Language Processing (NLP) applications. While homonyms (words with unrelated meanings) are fairly tractable, polysemous verbs with similar related meanings pose the greatest hurdle for automatic Word Sense Disambiguation (WSD). A major problem with WSD for verbs is that even humans disagree about what constitutes a different sense for a polysemous word. This thesis investigates verb lexical semantics and their computational representations, and how these can be used for automatic WSD. Our main contribution is in defining criteria by which humans make sense distinctions for verbs, and in translating these criteria into linguistically-motivated features that we use to build a state-of-the-art automatic WSD system. Our explicit criteria for sense distinctions allow humans to sense-tag data more consistently. Improved human performance on the WSD task enables improved system performance. We begin by examining the definition of verb polysemy implicit in Levin verb classes. We describe our work on VerbNet, a lexical resource in which different senses of a verb are defined by membership in different verb classes; the classes have distinctive syntactic frames and explicit semantic predicates that characterize the verb senses in that class. We then translate some of these lexical semantic characteristics into richer linguistic features used to build our automatic WSD system. The system performs competitively on the English verbs of Senseval-1 and Senseval-2 by combining information from syntax, lexical collocations, and semantic class constraints on verb arguments. Adding gold-standard predicate-argument information from PropBank further improves system performance. Because humans have difficulty making fine-grained sense distinctions, creation of manually sense-tagged corpora is time-consuming and expensive. We experiment with active learning to get additional training data for our system, but find that the quality of manually sense-tagged data is limited by an inconsistent or unclear sense inventory. We develop criteria for grouping senses and show that well-defined groupings of WordNet senses can improve both human inter-annotator agreement and system performance. The groupings fit into a hierarchy of WordNet senses that allow different NLP applications to use different granularities of sense distinctions.
Dua Puluh Tahun Riset Perpajakan dalam Akuntansi: suatu Studi Bibliografi

Penelitian ini bertujuan meninjau perkembangan penelitian perpajakan dalam akun­tansi di Indonesia selama 20 tahun. Tinjauan penelitian didasarkan pada 83 artikel perpajakan di 7 jurnal terakreditasi nasional dengan periode amatan 1997-2016. Pendekat­an pertama, pemetaan area mencakup seleksi artikel; klasifikasi artikel berdasarkan topik, metode dan disiplin ilmu; karakteristik jurnal; dan karakteristik artikel. Penelitian ini juga memisahkan periode 20 tahun ke dalam dua dekade. Pendekatan kedua, analisis komunitas ilmuwan perpajakan di area akuntansi melalui jumlah sitasi di Google Scholar . Pemetaan area menunjukkan market share artikel perpajakan sebesar 17% dari penelitian akuntansi, journal share artikel perpajakan mengalami peningkatan selama dua dekade dan journal share tertinggi ada di Jurnal Akuntansi dan Keuangan dan EKUITAS Jurnal Ekonomi dan Keuangan. Topik penelitian perpajakan berkisar pada akuntansi keuangan, keperilakuan, dan evaluasi kebijakan. Metode penelitian kuantitatif merupakan yang dominan dalam penelitian perpajakan. Metode archival , survei dan kajian pustaka merupakan tiga metode penelitian yang paling dominan. Semua jurnal didominasi oleh disiplin sumber ekonomi. Analisis sitasi menunjukkan terdapat 49% artikel yang mendapatkan jumlah sitasi antara 41 sampai 1. Jurnal yang paling banyak mendapatkan sitasi adalah Jurnal Akuntansi dan Keuangan. Analisi sitasi menunjukkan hampir setengah penelitian perpajakan sudah memiliki kontribusi bagi ilmu perpajakan dalam akuntansi.
Esterel is an Imperative, Synchronous and Reactive Programming Language

Many embedded systems belong to the class of reactive systems, which actively reacts to the environmental inputs and generates correct and effective outputs. However in this paper we will keep our discussion limited to a known Synchronous & Reactive language Esterel. Esterel is both a programming language, dedicated to programming synchronous, reactive systems, and a compiler which translates Esterel programs into finite-state machines. It belongs to the category of Synchronous languages, like SyncCharts, Lustre, Argos or Signal. These languages are particularly well-known to be used for programming reactive systems. Which also includes real-time systems and control automata. This paper aim is to make an idea that when a language (Esterel) already reviewed as Imperative language that means it works like Imperative style and also reviewed as Synchronous & Reactive language individually then why not it is called as the combination of both Imperative, Synchronous & Reactive language. For that we have to just follow the mechanism of different reference papers and composite different angle of the language (Esterel) that it is imperative language, it is Synchronous & Reactive language. Then we had just made coordination that 'Esterel is an Imperative, Synchronous and Reactive Language'.
Microprocessor-Based Instrument For Analyzing Video Interferograms

An interferogram analysis system has been developed that uses a standard television camera interfaced to a microcomputer to acquire the coordinates of fringe centers. Following single-frame capture at a resolution of 480 x 512 x 1, continuous lines appear at fringe centers in less than 12 seconds. Editing software provides for the addition and removal of data points and smoothing. Selection of data for analysis and order assignment are under full operator control. The system provides elaborate graphics options based upon a polynomial fit to the data. Under ideal conditions a detailed analysis is obtained in less than 10 minutes.
Using spatial relationships as features in object recognition

Information about the spatial relationships among objects in an image is an important clue towards identifying the objects and in interpreting the contents of the scene. Four primitive spatial relations (LEFT, ABOVE, RIGHT, BELOW) were used as features in a handwritten digit recognition problem. The fuzzy membership values of these four relations between every pair of cavities in each handwritten digit were obtained from the neural network systems and the fuzzy morphology method proposed in the authors' previous work. A feedforward backpropagation network was trained as a digit classifier. Promising results were obtained from the experiments, supporting the concepts that these features are useful for other complex classification problems such as automatic target recognition.
Commande de chute pour robots humanoïdes par reconfiguration posturale et compliance adaptative

Cette these traite du probleme de la chute de robots humanoides. L’etude consiste a decoupler la strategie de chute en une phase de pre-impact et une phase de post-impact. Dans la premiere, une solution geometrique permet au robot de choisir des points d’impact dans un environnement encombre. Pour ce faire, le robot readapte sa posture tout en evident les singularites de chute et en preparant le seconde phase. La phase de post-impact utilise une commande par Programmation Quadratique (QP) qui permet d’adapter les gains Proportionnels-Derives (PD)des moteurs en ligne, ceci afin d’obtenir de la compliance dans les articulations. L’approche consiste a incorporer les gains de raideur et d’amortissement dans le vecteur d’optimisation du QP avec les variables habituelles que sont l’acceleration articulaire et les forces de contact. Les contraintes ont ete adaptees a ce nouveau QP. Enfin,comme la solution est locale, une commande de modele predictif sur un modele simplifie du robot. A chaque pas du developpement, plusieurs experiences et simulations ont ete effectuees.
Information-theoretic results on communication problems with feed-forward and feedback

As networked communication systems become increasingly sophisticated, understanding information flow in networks is a problem of central importance. Multiuser information theory attempts to understand various interactions in a network by studying small building blocks such as distributed compression, multiple access, broadcast etc. In this thesis, we investigate two problems in network communication from an information-theoretic perspective: feed-forward in sources and feedback in channels. The two problems are closely related in the sense that there is a dynamic aspect to either the decoder or the encoder in each of them. Feedback in channels has been extensively studied, but the problem of source coding with feed-forward is recent. In source coding with feed-forward, to reconstruct each source sample, the decoder has knowledge of some past source samples in addition to the codebook index. This extra information can presumably help the decoder produce a better reconstruction. We obtain the optimal rate-distortion function and characterize the error exponent for this problem. The relevant information quantity is directed information, which captures the causal flow of information from one random sequence to another. Directed information was also recently used to characterize the capacity of channels with feedback. We provide an interpretation of directed information that helps understand why it arises in the context of feedback. This interpretation is used to obtain the feedback capacity of channels with side-information available with delay at both the encoder and decoder. It turns out that feed-forward/feedback does not improve the performance limit for
A Hybrid Feedback Mechanism to Exploit Multiuser Diversity in Wireless Networks

One of the most promising approaches to boost the communication efficiency in wireless systems is the use of multiuser diversity (MUDiv), where the fading of channels is exploited. The mechanism of scheduling the user with the best channel condition is called opportunistic scheduling (OS). In this paper we propose a joint polling and contention based feedback (JPCF) algorithm that exploits MUDiv while reducing the feedback load. The guard time, which is between bursts, is divided into minislots that alternate between polling-based feedback minislot (p-minislot) and contention-based feedback minislot (c-minislot). During the minislot, users feedback their channel qualities if above a predetermined threshold. We analyze the scheduling algorithm under slow Rayleigh fading assumption and derive the closedform expressions of the feedback load as well as the system capacity. We also consider the delay resulting from the time needed to schedule a user and derive the system throughput. The scheduling algorithm is compared with other scheduling algorithms.
Intrusion Detection By Data Mining Algorithms: A Review

– With the increasing use of network-based services and sensitive information on networks, maintaining information security is essential. Intrusion Detection System is a security tool used to detect unauthorized activities of a computer system or network. Data mining is one of the technologies applied to intrusion detection. This article introduces various data mining techniques used to implement an intrusion detection system. Then reviews some of the related studies focusing on data mining algorithms
Theoretical Modeling of Room Shape for Ray Tracing Simulation

With the recent developments in computer-aided design (CAD) technology, the detailed modeling of shapes has become routine. However, it is well known that low-frequency sounds do not propagate in detail-oriented models of rooms in the way that is predicted by geometrical acoustic simulations. Therefore, rough models of room shapes are commonly used and scattering coefficients are set for each material in this kind of simulation. However, scattering coefficients are difficult to use for creative room shape design, because scattering coefficients need to be measured in advance. Thus, we propose a new method for ray tracing simulations that can be used in place of the scattering coefficient method. This paper presents a discussion of methods for constructing the appropriate room shape for the analyzed frequency from a detail-oriented model of a room.
Different behaviour of frequency stability measures in independent and synchronized clocks: theoretical analysis and measurement results

The problem of characterizing the synchronization performance plays a central role in the design of SDH based telecommunication networks. Moreover, establishing the suitable quantities for characterizing the frequency stability of timing signals, together with their measurement configurations, is still an open issue in the standardization committees. We deal with some of the most important frequency stability quantities. An analysis envisaging the possibility to theoretically assess such quantities is carried out showing that substantial differences are expected in the behaviour of the above mentioned quantities, depending on the measurement configuration adopted. Besides, a high precision measurement set-up was used to derive experimental results which confirm the main theoretical conclusions and, at the same time, provide a good insight into the behaviour of various stability measures. <<ETX>>
A Novel Technique For Face Recognition Across Variable Illuminations And Poses

In this paper a face recognition algorithm based on simultaneous sparse approximations under varying illumination and pose is given. A dictionary is learned for each class based on given training examples which minimizes the representation error with a sparseness constraint. A novel test image is projected onto the span of the atoms in each learned dictionary. The resulting residual vectors are then used for classification. To handle variations in lighting conditions and pose, an image relighting technique based on pose-robust albedo estimation is used to generate multiple frontal images of the same person with variable lighting. As a result, the proposed algorithm has the ability to recognize human faces with high accuracy even when only a single or a very few images per person are provided for training.
Galatea : personalized interaction with augmented objects

In Galatea (g l’ -t ’ ), digitally augmented physical objects actively attract a person’s attention to online information relevant to both the object and the person’s interests. Galatea combines intelligent software agents and digitally augmented physical objects to uniquely bridge the gap between the two disciplines. In a unique twist on typical Ubiquitous Computing models that require intentional request for or asynchronous, periodic delivery of information, Galatea’s smart objects proactively attract the attention of a nearby person by blinking a light when there is relevant information about the object. The object also sends the relevant information to the person’s cell phone. We use books as our test case. Any augmented book can visually attract a user’s attention when there is information it believes is relevant to the user. This information is personalized, i.e. unique to the person’s interests, the current location, and the book, and when appropriate is delivered unobtrusively using the person’s cell phone interface. A user can likewise request information from the books in the nearby vicinity by searching the books using their cell phone. A user study of and demonstration responses to Galatea show tradeoffs between the benefits of orienting information in objects and its usefulness as a collaborative tool, versus its potential as a distracting and invasive interface. Thesis Supervisor: Pattie Maes Professor of Media Arts and Sciences Galatea: Personalized Interaction with Augmented Objects
A known-energy neural network approach for visual cryptography

This paper introduces the so-called known-energy system based on the Q'tron neural network (NN) model, and applies it to visual cryptography. With a known-energy system, the NN intrinsically performs a goal-directed search, meaning that the NN will settle down only when its state fulfils the dedicated goal. The noise injection mechanism that makes the NN to work in such a manner is discussed. The NN built for visual cryptography in the paper is modeled as a known-energy system. The approach is completely different from the traditional ones, and the so-built NN can be used to cope with complex encrypting structures of visual cryptography. Experiments show that its result is good.
Research Methods for Public Administrators

Introduction Basic Concepts What's Your Question? Designing a Research Study Choosing Measures The Data Collection: Observation and Available Data The Data Collection: Surveys and Focus Groups Sampling Demystified Data Analysis for Description Analyzing Data: Exploring Relationships Analyzing Data: Inferential Statistics Conclusion Appendix A: The Mathematical Formulae for Selected Statistics Appendix B: Glossary Appendix C: Survey: Merit Principles Survey 2000 Appendix D: Survey Results: City of Portland, 1999 Citizen Survey Results Appendix E: Guidelines for Reporting Research Appendix F: Resources Index
Say what you mean, mean what you say: a pragmatic analysis of the Italian translations of Emma

My aim in this article is to show the usefulness of pragmatics for translation analysis and, tentatively, translation training. The tools and methods developed by pragmatics in the past four decades are particularly useful for the analysis of dialogue and, more generally, face-to-face interaction. Therefore, a source text is chosen which displays a rich and intricate web of personal and social relations, and whose dialogues strike a delicate balance between what is spoken and unspoken, said and implied. Jane Austen’s Emma is compared with three Italian target texts in order to verify if that web and that balance are kept, erased, or altered in translation: the results are, perhaps not surprisingly, mixed, and demonstrate that a knowledge of the pragmatics of face-to-face interaction can be of great advantage to the translator of Emma.
Toward a mathematical semantics for computer languages

Compilers for high-level languages aTe generally constructed to give the complete translation of the programs into machme language. As machines merely juggle bit patterns, the concepts of the original language may be lost or at least obscured during this passage. The purpose of a mathematical semantics is to give a correct and meaningful correspondence between programs and mathematical entities in a way that is entirely independent of an implementation. This plan is illustrated in a very elementary way in the introduction. The first section connects the general method wi th the usual idea of state transformations. The next section shows why the mathematics of functions has to be modified to accommodate recursive commands. Section 3 explains the modifi­ cation. Section 4 introduces the environments for handling variables and identifiers and shows how the semantical equations define equivalence of programs. Section 5 gives an exposition of the new type of mathematical function spaces that are required fOl the semantics of procedures when these are allowed in assignment state­ ments. The conclusion traces some of the background of the project and points the way to future work.
Edge refinement method for content-based image retrieval

Standard histograms, because of their efficiency and insensitivity to small changes, are widely used for content based image retrieval. But the main disadvantage of histograms is that many images of different appearances can have similar histograms because histograms provide coarse characterization of an image. In this paper, the technique defined is based on histogram refinement and we call it edge refinement. Edge refinement splits the pixels in a given bucket into several classes just like histogram refinement method. The classes are all related to edges and are based on edge coherence vector.