Miracle-dz/UniFAR-FTUs huggingface dataset:
Implementation of the multiple-measure maximum likelihood strategy classification in R

One major challenge to behavioral decision research is to identify the cognitive processes underlying judgment and decision making. Glockner (2009) has argued that, compared to previous methods, process models can be more efficiently tested by simultaneously analyzing choices, decision times, and confidence judgments. The Multiple-Measure Maximum Likelihood (MM-ML) strategy classification method was developed for this purpose and implemented as a ready-to-use routine in STATA, a commercial package for statistical data analysis. In the present article, we describe the implementation of MM-ML in R, a free package for data analysis under the GNU general public license, and we provide a practical guide to application. We also provide MM-ML as an easy-to-use R function. Thus, prior knowledge of R programming is not necessary for those interested in using MM-ML.
Efficient Image Retrieval System Using Sketches

−In the rising research areas of the digital image processing, content based image retrieval (CBIR) is one of the most popular used techniques. The goal of CBIR is to extract visual content of an image automatically like color, texture, or shape. Most of the image search tools, such as Google images, yahoo image search are based on textual annotation of images. Performances of these tools using text based search methods are not satisfactory. The most important task is to bridge the important gap between the sketch and colored image. Our work is to evaluate the problems and challenges concerned with the design and the creation of CBIR system which is based on sketch based image retrieval (SBIR). Design and task specific descriptors like Edge Histogram Descriptors (EHD), Histogram Oriented Gradient (HOG) and Scale Invariant Feature Transform (SIFT) are used in this project.
Information structure, grammar and strategy in discourse

This dissertation examines two information-structural phenomena, Givenness and Focus, from the perspective of both syntax and pragmatics. Evidence from English, German and other languages suggests a "split" analysis of information structure--the notions of Focus and Givenness, often thought to be closely related, exist independently at two different levels of linguistic representation. Givenness is encoded as a syntactic feature which presupposes salience in prior discourse and either (1) prevents prosodic prominence (in languages like English and German), or (2) drives syntactic movement (in languages like Italian). On the other hand, Focus, which introduces strong prosodic prominence and a contrastive interpretation, exhibits none of the expected properties of a syntactic feature, and is therefore analyzed quite differently. I argue that Focus is the result of purely pragmatic principles which determine utterance choice in the face of grammatical optionality. The syntactic and phonological systems often generate multiple possible formulations of an utterance, and communicative principles can be invoked to explain the correspondences between certain kinds of discourse contexts and certain patterns of linguistic form. The application of communicative principles to problems of utterance choice is modeled mathematically using the tools of game-theoretic pragmatics. From this perspective, utterances are taken to be strategically chosen in order to maximize communicative effectiveness. Ultimately, the strong differences between Focus and Givenness emphasize a methodological point: both syntactic and pragmatic perspectives are necessary to fully determine the space of possibilities in natural language. Neither perspective should be ignored. Degree Type Dissertation Degree Name Doctor of Philosophy (PhD) Graduate Group Linguistics First Advisor Robin Clark Subject Categories Linguistics This dissertation is available at ScholarlyCommons: http://repository.upenn. edu/edissertations/805 ! INFORMATION STRUCTURE, GRAMMAR & STRATEGY IN DISCOURSE Jon Stevens A DISSERTATION in Linguistics Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 2013 Supervisor of Dissertation _______________________ Robin Clark Associate Professor, Linguistics Graduate Group Chairperson _______________________ Robin Clark, Associate Professor of Linguistics Dissertation Committee Robin Clark, Associate Professor of Linguistics Anthony Kroch, Professor of Linguistics Florian Schwarz, Assistant Professor of Linguistics INFORMATION STRUCTURE, GRAMMAR & STRATEGY IN DISCOURSE COPYRIGHT 2013 Jon Scott Stevens The truth of the thoughts here communicated seems to me unassailable and definitive. —Wittgenstein, 1918 I have been forced to recognize grave mistakes in what I wrote in that first book. —Wittgenstein, 1945
Graphics acceleration of composite transformations using reconfigurable computing

This paper introduces reconfigurable computing (RC) and specifically chooses one of the prototypes in this field, MorphoSys (M1) from UCI. Mapping of different linear algebraic functions, namely vector-scalar operations, onto this hardware is proposed. A performance analysis study of the M1 RC is also presented to evaluate the efficiency of the algorithm execution on the M1 system. For instance, two algorithms on an 8/spl times/8 RC array M1 were run, and numerical examples were simulated to validate our results, using the MorphoSys mULATE program, which simulates MorphoSys operations.
Segmentation and Measurement of Exudates in Fundus Images of the Retina for Detection of Retinal Disease

Retinal diseases are asymptomatic in nature with the significant effect of vision loss. With the growing number of retinopathy cases each year there is a requirement of the evaluation of large amount of database. This has led to the development of numerous automated and semi automated evaluation methods to track the retinal diseases. In this study, a simpler automated method is developed to diagnose retinal disease as far as exudates are concerned. Previously used segmentation methods do not generate very satisfactory results mainly because the composition of exudates which are degenerated regions in retinal fundus image is non homogeneous. Therefore an alternative method for segmentation is developed to use the homogeneity of healthy regions than degenerated regions. The developed technique initially separates the healthy regions like blood vessels and optic disc from the retinal fundus images and classifies as healthy. Further the dynamic region growing method is employed for the segmentation of exudates in the images containing diabetic retinal disease. The technique developed is examined on various retinal images and the outcomes reveal that the presented technique performs better than the previous proposed methods for the segmentation of exudates.
Transcription of the Bleek and Lloyd Collection using the Bossa Volunteer Thinking Framework

The digital Bleek and Lloyd Collection is a rare collection that contains artwork, notebooks and dictionaries of the earliest habitants of Southern Africa. Previous attempts have been made to recognize the complex text in the notebooks using machine learning techniques, but due to the complexity of the manuscripts the recognition accuracy was low. In this research, a crowdsourcing based method is proposed to transcribe the historical handwritten manuscripts, where volunteers transcribe the notebooks online. An online crowdsourcing transcription tool was developed and deployed. Experiments were conducted to determine the quality of transcriptions and accuracy of the volunteers compared with a gold standard. The results show that volunteers are able to produce reliable transcriptions of high quality. The inter-transcriber agreement is 80% for |Xam text and 95% for English text. When the |Xam text transcriptions produced by the volunteers are compared with the gold standard, the volunteers achieve an average accuracy of 69.69%. Findings show that there exists a positive linear correlation between the inter-transcriber agreement and the accuracy of transcriptions. The user survey revealed that volunteers found the transcription process enjoyable, though it was difficult. Results indicate that volunteer thinking can be used to crowdsource intellectually-intensive tasks in digital libraries like transcription of handwritten manuscripts. Volunteer thinking outperforms machine learning techniques at the task of transcribing notebooks from the Bleek and Lloyd Collection.
Mobile robot control in dynamic environments based on hybrid intelligent system

A hybrid intelligent control system is proposed for robot navigation. Fuzzy modelization and planning is combined with reinforcement learning to perform robust and optimal control. Fuzzy modelization and planning is efficient, but it lacks self-adaptability. Learning control can obtain the optimal control policy by on-line learning, but it takes long time for the strategy to converge. The hybrid method obtains the advantages of both and has better control performance than either of them. In the computer simulation experiment, the hybrid intelligent method can perform efficient and optimal control for robot navigation in dynamic environments.
Performance comparison of implementation mechanisms for e-commerce applications: Towards a hybrid approach

The acceptance of Internet-scale systems and applications depends significantly upon their performance in terms of user-perceived quality of service. While there has been work in the domain of mobile agent based applications, there is little work to compare the performance of these implementations with client-server approaches. Also, there is a need to identify the application parameters that influence overall performance. We have identified several parameters that influence performance and have carried out a quantitative evaluation of client-server versus mobile agent implementations. From our experiments, we conclude that both solutions need to co-exist. We then propose a hybrid approach using both these implementation strategies, and present the design of “MAX”, an implementation of an e-commerce application. MAX is based on a hybrid MA/CS approach and chooses an appropriate implementation strategy at runtime, based on the application parameters.
Phonetic constraints and markedness in the phonotactics of Australian Aboriginal languages

This thesis is a descriptive and theoretical analysis of distributional co-occurrence constraints on consonants, focusing on the Aboriginal languages of Australia. The two phonotactic positions in consonant clusters are found to be positions of neutralisation of feature contrasts which are present in other positions in the word, particularly between vowels. I present a series of generalisations which may be made on the permitted sequences of consonantal place features and manner features in clusters morpheme-internally. These patterns take the form of implicational relationships between segments and clusters, showing that an unmarked core of cluster types is present in all Australian Aboriginal languages, while languages vary in how they elaborate additional, more marked structures. I argue that each phonotactic pattern is phonetically grounded. Unmarked clusters correspond to structures which are gesturally and/or perceptually simple and marked structures are gesturally and/or perceptually complex. I formalise each pattern of neutralisation within a constraints theory of markedness, and propose that constraints are phonetically grounded. The goal of this thesis, then, is twofold. The first is to report the recurring generalisations in the Australian cluster phonotactics. The second is to argue for a relationship between phonotactic markedness and phonetics. I show that a phonetic theory of constraints accurately predicts the attested patterns.
A metric of modifiability for software maintenance

A model for measuring software modifiability is presented. In this model, the key to the modifiability of a program module is attributed to its localization property, which can be interpreted as indicating whether changes made to the module would have only a localized effect or not. The localization property of a module can be further broken down into intramodular localization and intermodular localization. Corresponding to the localization property are the dependences among program code entities. A data-interdependency metric for measuring the dependencies among primitive statements in a module is developed. The metric is then extended to incorporate intermodular localization property to measure the modifiability of program modules. A number of software maintenance experiments were designed and conducted for validating the software modifiability metric. The details of the experimentation as well as the results are presented. <<ETX>>
The grammar movie project

In this case study, I will show how directing a movie on grammar can help students improve their oral skills as well as their language competency, team working and planning skills, and also teach them about learning itself. I will present an innovative teaching project that uses the medium of film to get students engaged with grammar and that aims at providing them with a form of assessment that makes revision by the students possible and gives control of the final version to the student.
Incorporating Grammatical Features in the Modeling of the Slovak Language for Continuous Speech Recognition

This paper will focus on the process of creation of the language model as a fundamental part of a successful system for the automatic speech recognition, that effectively restricts possible results for only those word sequences, that are probable for the given language. The problem is that in the highly inflectional languages such as Slovak, is very difficult to model the most common expressions, because of very rich morphology, non-mandatory sentence order and very large vocabulary. The main theoretical focus is providing a list of possibly beneficial grammatical features, such as part-of-speech, word lemmas or features based on the word morphology, process of obtaining these grammatical features from the training corpus and incorporating it to the final language model. This theoretical introduction will be supplemented by a set of experimental evaluations of the designed language model in a real-world continuous speech recognition system for transcriptions of the legal documents in the area of judicature in the Slovak language. The result is a methodology applicable also for similar Slavic languages, such as Czech or Polish that can bring better precision of the speech recognition.
Reducing the Computational Complexity of the GMM-UBM Speaker Recognition Approach

Speaker recognition approaches rely heavily on the use of Gaussian Mixture Models (GMMs) for speaker modelling. The models can represent arbitrary distributions of feature vectors extracted from speech waveforms, and are easy to train. Traditional GMM-based implementations are computationally complex, utilizing large numbers of parameters. These approaches have typically been used in “offline” settings, where results are not generated in real-time. This work seeks to reduce the computational complexity of the GMM-UBM approach, allowing it to produce results in shorter amounts of time. The preliminary results of this study demonstrate the feasibility of reducing the number of parameters while maintaining speaker recognition performance. This work provides a foundation for further work in reducing computational complexity, which we intend to use for future real-time hardware implementations. Keywords—Speaker Recognition; GMM-UBM
The next generation motor control method, DTC direct torque control

Direct torque control (DTC) is the latest AC motor control method developed by ABB. ACS600 is the first application utilising DTC. DTC is a control method that embeds a motor and inverter together and controls them together in an optimal manner. In DTC, all switch changes are based directly on the electromagnetic state of the motor. Optimum switching is determined for every control cycle on a time level of 25 microseconds. The switch positions of the power module are determined by the calculated stator flux and motor torque.
Applying Design of Experiments to Software Testing

Recently, a class of experimental designs has been devised that guarantee input domain coverage up to all combinations of k test factors taken t at a time. With such designs, all pair-wise combinations (or triplets or quadruplets, etc.) are selected at least once. To evaluate their applicability to software testing, we analyzed the extent to which software coverage (i.e., code execution) achieved by these designs for r = 1 ,. ,k is representative of that achieved by exhaustively testing all factor combinations. The block coverage obtained for tS2 was comparable with that achieved by exhaustively testing all factor combinations but higher-order values of t were required for path coverage. Implications of these results for software testing are discussed. field, and that there is a total of 151 characters that can be entered across all 20 screen fields, then there are 95’5’~4.3x102g8 different inputs or test cases corresponding to the different ways a user can populate the screen. Clearly, exhaustive input testing is not feasible and hence, a software tester needs to efficiently generate an effective set of test cases as a means of verifying the correct operation of the software.
ORGANISASI CACHE MEMORY

Cache memory dirancang secara umum untuk meningkatkan kinerja suatu sistem komputer. Secara logika cache memory berada diantara prosessor dan memory utama yang bertujuan untuk menyediakan data atau instruksi yang akan diolah oleh prosessor. Hal ini menyebabkan waktu yang dibutuhkan menjadi lebih singkat karena prosessor tidak perlu mengambilnya dari memori utama. Terdapat beberapa metode pemetaan memory utama kepada cache memory yakni pemetaan langsung, cache assosiative, set assosiative dan sector caches. Dalam makalah ini akan dibahas tentang metode pemetaan tersebut. Juga akan dibahas tentang parameter-parameter disain suatu cache memory serta tentang performance suatu cache memory. Kata kunci : cache memory, block, direct mapping, assosiative cache, hit ratio, cycle counts
A distributed framework for integrated software process and deployment support

Software development and deployment are traditionally separate non-interoperating tasks, yet they concern much of the same information. We propose a modeling language for software development processes that incorporates the software artifacts being developed in the process as well as their product structure information including evolution, such as dependency, origin, version, and configuration information which is required for deployment. Based on this, we present a distributed framework, implemented in a prototype system, consisting of a process support system as a common process-interoperable base for both developers and users, and separate enhancements for development and deployment. For developers, it is extended by a process definition and enactment engine as well as process-specific tools to make up a software engineering environment, allowing distributed development, configuration and release of software in globally linked processes. For users, it is extended by a deployment and runtime system that allows retrieval, installation and invocation of software, and manages user-site process bases. Developers publish parts of their development processes, and users copy linked parts of different developers’ processes containing software artifacts to their local process bases. Deployed software retains its process-awareness, allowing configurations to be checked for compatibility.
Attitude and Steering Control of the Long Articulated Body Mobile Robot KORYU

Many types of mobile robots have been considered so far in the robotics community, including wheeled, crawler track, and legged robots. Another class of robots composed of many articulations/segments connected in series, such as “Snake-like robots”, “Train-like Robots” and “Multi-trailed vehicles/robots” has also been extensively studied. This configuration introduces advantageous characteristics such as high rough terrain adaptability and load capacity, among others. For instance, small articulated robots can tread through rubbles and be useful for inspection, search-and-rescue tasks, while larger and longer ones can be used for maintenance tasks and transportation of material, where normal vehicles cannot approach. Some ideas and proposal appeared in the literature, to build such big robots; many related studies concerning this configuration have been reported (Waldron, Kumar & Burkat, 1987; Commissariat A I’Energie Atomique, 1987; Burdick, Radford & Chirikjian, 1993; Tilbury, Sordalen & Bushnell, 1995; Shan and Koren, 1993; Nilsson, 1997; Migads and Kyriakopoulos, 1997). However, very few real mechanical implementations have been reported. An actual mechanical model of an “Articulated Body Mobile Robot” was introduced by Hirose & Morishima in 1988, and two mechanical models of articulated body mobile robot called KORYU (KR for short) have been developed and constructed, so far. KORYU was mainly developed for use in fire-fighting reconnaissance and inspection tasks inside nuclear reactors. However, highly terrain adaptive motions can also be achieved such as; 1) stair climbing, 2) passing over obstacles without touching them, 3) passing through meandering and narrow paths, 4) running over uneven terrain, and 5) using the body’s degrees of freedom not only for “locomotion”, but also for “manipulation”. Hirose and Morishima (1990) performed some basic experimental evaluations using the first model KR-I (a 1/3 scale model compared to the second model KR-II, shown in Fig. 1(a)-(c). Improved control strategies have been continuously studied in order to generate more energy efficient motions. This chapter addresses two fundamental control strategies that are necessary for long articulated body mobile robots such as KORYU to perform the many inherent motion capabilities cited above. The control issue can be divided in two independent tasks, namely 1) Attitude Control and 2) Steering Control. The underlying concept for the presented O pe n A cc es s D at ab as e w w w . ite ch on lin e. co m
Machine vision system for the control of tunnel boring machines

This paper presents a machine vision system for the control of dual-shield Tunnel Boring Machines. The system consists of a camera with ultra bright LED illumination and a target system consisting of multiple retro-reflectors. The camera mounted on the gripper shield measures the relative position and orientation of the target which is mounted on the cutting shield. In this manner the position of the cutting shield relative to the gripper shield is determined. Morphological operators are used to detect the retro-reflectors in the image and a covariance optimized circle fit is used to determine the center point of each reflector. A graph matching algorithm is used to ensure a robust matching of the constellation of the observed target with the ideal target geometry.
Edge detection with BP neural networks

A new edge detection technique is proposed which makes use of a backpropagation (BP) neural network. We classify the edge patterns in binary images into 18 categories. After training on the pre-defined edge patterns, the neural network is applied to classify any type of edge into one of the 18 categories. For different edge patterns, corresponding algorithms are employed to process the image to extract edges. Compared with the existing edge detection techniques, our method is more flexible to the variation of edges. The results indicate that the new technique provides better results than traditional edge detection techniques.