Miracle-dz/UniFAR-FTUs huggingface dataset:
Language and Gesture: Lexical gestures and lexical access: a process model

Introduction Observers of human behavior have long been fascinated by the gestures that accompany speech, and by the contributions to communication they purportedly make. Yet, despite this long-standing fascination, remarkably little about such gestures is well understood. The list of things we don't understand is long, but some of the most important open questions concern their form and function: Why do different gestures take the particular form they do , and What is it that these ubiquitous behaviors accomplish? Traditionally, answers to the function question have focused on the communicative value of gesture, and that view is at least implicit in most contemporary thinking on the topic. Although we do not question the idea that gestures can play a role in communication, we believe that their contribution to communication has been overstated, and that the assumption that communication is gesture's only (or even primary) function has impeded progress in understanding the process by which they are generated. Ourgoal in this chapter is to provide a partial answer to the question of the origin and function of gesture. It is a partial answer because we suspect that different kinds of gestures have different origins and serve different functions, and the model we propose attempts to account neither for all gestural behavior nor for all of the functions gestures serve. Our account also must be regarded as tentative, because formulating a model requires us to make a number of assumptions for which we lack substantial empirical warrant.
Resource Structures as a Model of Concurrency

In this report, we introduce a model of concurrency based on event structures which we call resource structures. We show how these structures can model concepts relating to resource management such as resource contention, generation and consumption. Various constructors are also presented which are useful for spec·ifying complex resource structures as the composition of several smaller substructures. Like event structures, resource structures have an underlying transition system which can be used to define a notion of equivalence. Using this equivalence, we then present several properties satisfied by the constructors such as commutative, distributive and unit laws.
A case study on metacognitive strategies in an engaging multimedia experience

Knowing strategies on how children think when playing computer games could help educationalist design educational game courseware that engages children to learn. This paper will look at how the children use strategies or lack of it in their thinking to overcome problems when interacting with an engaging multimedia application, The Sims.The Sims, an Edutainment Multimedia CD, was used to discover more about engagement under varying interactive conditions and experiments after the features of what children want in a multimedia design for them were found in this application. A theoretical model “An Engaging Multimedia Design Model” [1] renamed, after an extended research,The NEMD Model (Norma™ Engagement Multimedia Design Model) [3] was developed from this study using this application as the vehicle. This paper is a result of revisiting the recorded engaging experience the children encountered whilst doing the experiments to design, test, redesign and retest till the model gets its present form. A number of metacognitive strategies were sighted in this game play. Relating their thinking to metacognitive strategies will help us design better educational multimedia game courseware for children.
Generating and Simplifying Sentences

Depending on the input representation, Natural Language Generation can be categorized into two classes: MR-to-text (meaning representation to text) generation and text-to-text generation. This dissertation investigates issues from both classes. Accordingly, this dissertation is divided into two parts: the first part (MR-to-text generation, “Generating Sentences”) focuses on the task of generating natural language text from shallow dependency trees while the second part (text-to-text generation, “Simplifying Sentences”) tries to generate simple sentence(s) given a complex sentence.
Theseus: Categorization by Context

The traditional approach to document categorization is categorization by content, since information for categorizing a document is extracted from the document itself. In a hypertext environment like the Web, the structure of documents and the link topology can be exploited to perform what we call categorization by context [Attardi 98]: the context surrounding a link in an HTML document is used for categorizing the document referred by the link. Categorization by context is capable of dealing also with multimedia material, since it does not rely on the ability to analyze the content of documents. Categorization by context leverages on the categorization activity implicitly performed when someone places or refers to a document on the Web. By focusing the analysis to the documents used by a group of people, one can build a catalogue tuned to the need of that group. Categorization by context is based on the following assumptions:
Pengenalan Wajah Untuk Pencarian Data Buronan Melalui Gambar Skesta

Dalam dunia kriminalitas seringkali Kepolisian kesulitan mencari pelaku yang minimnya informasi karena tidak adanya bukti seperti rekaman dari CCTV, video amatir, atau foto ketika kejadian berlangsung, sehingga digunakanlah gambar sketsa yang dibuat berdasarkan dari keterangan saksi. Terdapat hambatan dalam pencarian tersangka atau pelaku tindak kriminal dengan menggunakan gambar sketsa yaitu pihak Kepolisian sulit untuk mencocokan data dari Daftar Pencarian Orang (DPO) dengan gambar sketsa yang dibuat, ini dikarenakan kemampuan sumber daya manusia yang terbatas. Sehingga untuk melakukan pencocokan tersangka atau pelaku diperlukan sebuah aplikasi dengan memanfaatkan pengolahan citra. Untuk membangun sistem pengenalan wajah dapat menggunakan pendekatan metode Eigenface. Pendekatan tersebut untuk klasifikasi mengenali wajah dengan mencari jarak terdekat dari citra wajah yang di-training dengan objek yang telah tersimpan di database. Dalam penerapannya dilakukan studi kasus di Kepolisian Resor Cirebon Kota. Pencocokan gambar sketsa wajah dan data buronan dilakukan sebanyak 9 kali dengan hasil yang dikenali didapatkan akurasi data (dalam satuan persen) masing-masing sebesar 74.75, 73.20, 74.41, 72.83, 72.88, dan 71.55 dengan ratarata akurasi sebesar 73,27%. Sedangkan pada hasil yang tidak dikenali didapatkan akurasi data (dalam satuan persen) masing-masing sebesar 34.83, 39.61, 39.79 dengan rata-rata akurasi sebesar 38,07%.
Contributions to pairing-based digital signatures

Nowadays, electronic communication plays a key role in the way people communicate in business or financial transactions. As e-commerce becomes more and more popular, the demand for digital signature is increasing rapidly. In 1976 Whitfield Diffie and Martin Hellman introduced the concept of digital signature [31] which is used to demonstrate the authenticity of a message or document. In 1977, Ronald Rivest, Adi Shamir and Len Adleman [66] proposed the notion of the RSA algorithm based on the factoring problem. In addition to the RSA signature, other signatures such as ElGamal signature [34], Rabin signature [65], Pairing-based signature [14], Undeniable signature [21] and others have been proposed by a number of different researchers. Due to the fact that users can enjoy properties such as authentication of the message, integrity of the message and non-repudiation of the message, digital signature has partially replaced the original ink on paper signatures. However, there exist a number of problems and potential attacks on digital signatures. It is observed that the majority of IBS schemes have the weakness of private key escrow. Additionally, existing solutions for security model could be made simpler and much more
Multiple Agent Systems for Configuration Design

Abstract 1 Introduction Stuart Watt Zdenek ZdrahalMike Brayshaw Multiple Agent Systems for Conﬁguration Design Knowledge Media InstituteOpen University, Milton Keynes, UK.School of Computer ScienceUniversity of Birmingham, Birmingham, UK. This paper compares and contrasts traditional methods and multiple agent archi-tectures as techniques for performing the task of conﬁguration design. Conﬁgura-tion design is a common engineering problem, involving component selection andarrangement, and thus presents an interesting area to apply AI technology. Oneparticular example, the VT elevator design system (Marcus et al., 1988), has beenproposed as the Sisyphus-2 benchmark for testing and comparing various AI tech-niques and methodologies. Taking this as a starting point we will demonstrate howamultipleagentarchitecturegivesextraﬂexibilityinuseandtransparencyofdesignchoice over a conventional system. Our argument will be structured as follows.First we shall describe the engineering task and domain under discussion. Thenwe shall discuss how traditional approaches would go about solving the problem.1
Designing a Simple FPGA-Optimized RISC CPU and System-on-a-Chip

This paper presents the complete design of a simple FPGA RISC processor core and system-on-a-chip in synthesizable Verilog. It defines a RISC instruction set architecture and then describes how to implement every part of the processor. Next, an interrupt facility is added. The second half of the paper describes the design and implementation of the system-on-a-chip - on-chip RAM, peripheral bus, and peripherals. Throughout, FPGA-specific issues and optimizations are cited. The paper concludes with a comparison with other FPGA processor cores and a brief discussion of software tools issues.
Corpus Linguistics: Method, Theory and Practice

Corpus linguistics is the study of language data on a large scale – the computer-aided analysis of very extensive collections of transcribed utterances or written texts. This textbook outlines the basic methods of corpus linguistics, explains how the discipline of corpus linguistics developed and surveys the major approaches to the use of corpus data. It uses a broad range of examples to show how corpus data has led to methodological and theoretical innovation in linguistics in general. Clear and detailed explanations lay out the key issues of method and theory in contemporary corpus linguistics. A structured and coherent narrative links the historical development of the field to current topics in 'mainstream' linguistics. Practical tasks and questions for discussion at the end of each chapter encourage students to test their understanding of what they have read and an extensive glossary provides easy access to definitions of technical terms used in the text.
Field-Programmable Gate Array (FPGA) Emulation for Computer Architecture

Abstract : The scope of this program is to explore the use of FPGA-based systems for different applications including architecture-level FPGA emulation in support of future multiprocessor architecture research. We evaluate FPGA emulation approaches against conventional simulation techniques, and determine the missing capabilities that will require further development. In particular, we compare the various possible modeling approaches and evaluated their capabilities in terms of model fidelity, emulator performance, and design effort. We also investigate techniques to incorporate energy, power, and thermal models into architecture-level FPGA emulation frameworks.
Compressive Sensing for Near-field Source Localization

Near-field source localization is an important aspect in many diverse areas such as acoustics, seismology, to list a few. The planar wave assumption frequently used in far-field source localization is no longer valid when the sources are in the near field. Near-field sources can be localized by solving a joint direction-of-arrival and range estimation problem. The original near-field source localization problem is a multi-dimensional non-linear optimization problem which is computationally intractable. In this thesis we study address two important questions related to near-field source localization: (i) Sparse reconstruction techniques for joint DOA and range estimation using a grid-based model. (ii) Matching the sampling grid for off-grid sources. In the first part of this thesis, we use a grid-based model and by further leveraging the sparsity, we can solve the aforementioned problem efficiently using any of the off-the-shelf l1_-norm optimization solvers. When multiple snapshots are available, we can also exploit the cross-correlations among the symmetric sensors of the array and further reduce the complexity by solving two sparse reconstruction problems of lower dimensions instead of a single sparse reconstruction problem of a higher dimension. In the second part of this thesis, we account scenarios where the true source locations are not on the grid resulting in a grid mismatch. Using the first-order Taylor approximation, we model the grid mismatch as a perturbation around the sampling grid. Based on the grid mismatch model, we propose a bounded sparse and bounded joint sparse recovery algorithms to localize near-field sources.
DATA MINING OF PROTEIN DATABASES

Data mining of protein databases poses special challenges because many protein databases are non-relational whereas most data mining and machine learning algorithms assume the input data to be a relational database. Protein databases are non-relational mainly because they often contain set data types. We developed new data mining algorithms that can restructure non-relational protein databases so that they become relational and amenable for various data mining and machine learning tools. We applied the new restructuring algorithms to a pancreatic protein database. After the restructuring, we also applied two classification methods, such as decision tree and SVM classifiers and compared their accuracy in predicting whether particular pancreatic proteins are involved in pancreatic cancer. From our prediction the SVM gave us not only the highest accuracy, about 73%, but it also gave the most consistency among the GO terms and PFAM family proteins. iii ACKNOWLEDGMENTS I would like to thank my advisor, Dr. Peter Revesz for his optimism, guidance and feedback during the course of my research and the writing of the thesis. He always stood by my side during challenging times. I'm grateful for having Dr. Jitender Deogun and Dr. Anita Sarma as part of my examination committee. I have benefited from taking several excellent classes from them during my years at the University of Nebraska-Lincoln. providing me the pancreatic cancer-related database. They also helped to motivate the work by explaining to me many aspects of protein and pancreatic cancer. Last but not least, I would like to give a special thanks to my undergrad advisor Dr. Lalchand Shimpi from Saint Augustine's University for his support of my thesis and also thanks my family and friends for standing behind me during the tough times and always giving me kind words of encouragements.
Remédiation cognitive dans la schizophrénie : indications et conditions d'utilisation

La remediation cognitive apparait ces dernieres annees comme un outil de soin particulierement pertinent, notamment dans la prise en charge de la schizophrenie. Elle permet, sur la base d’un bilan cognitif prealable, de cibler les deficits cognitifs (deficits neurocognitifs, de cognition sociale, de metacognition) frequemment retrouves dans cette pathologie et de diminuer le handicap fonctionnel qu’ils determinent. Nous decrivons dans ce travail les principes de cette approche, ainsi que les principaux programmes disponibles en France. Nous concluons cet article par un questionnement sur l’interet de cette approche (illustration d’une possibilite d’application concrete de travaux de recherche fondamentale, approche therapeutique accessible a de nombreux professionnels du soin, pragmatisme.) mais, egalement, sur ses limites (ne remplace pas la psychotherapie ni la medication ; necessite de situer la remediation cognitive et le soin a tonalite fonctionnelle dans la perspective du sujet).
Visual Data Mining with Parallel Coordinates

The display of multivariate datasets in parallel coordinates, transforms the search for relations among the variables into a 2-D pattern recognition problem. This is the basis for the application to Visual Data Mining. Guidelines for Visual Data Mining are illustrated with a the scenario - of the interactions between the user and the display - are illustrated on a dataset from the production of a VLSI chip. The real strength of parallel coordinates is in modeling relations between the variables. This is shown with a simplified Economic Model constructed using data from various economic sectors of a real country. The visual model shows the interelationship and dependencies between the sectors, circumstances where there is competition for the same resource, and feasible economic policies. Interactively, the model can be used to do trade-off analyses, discover sensitivies, do approximate optimization, for monitoring (as in a Process) and Decision Support.
Optimal Network Topologies and Resource Mappings for Heterogeneous Networks-on-Chip

Communication has become a bottleneck for modern microprocessors and multicore chips because metal wires don’t scale. The problem becomes worse as the number of components increases and chips become bigger. Traditional Systemson-Chips (SoCs) interconnect architectures are based on shared-bus communication, which can carry only one communication transaction at a time. This limits the communication bandwidth and scalability. Networks-on-Chip (NoC) were proposed as a promising solution for designing large and complex SoCs. The NoC paradigm provides better scalability and reusability for future SoCs, however, longdistance multi-hop communication through traditional metal wires suffers from both high latency and power consumption. A radical solution to address this challenge is to add long-range, low power, and high-bandwidth single-hop links between distant cores. The use of optical or on-chip RF wireless links has been explored in this context. However, all previous work has focused on regular mesh-based metal wire fabrics that were expanded with one or two additional link types only for long-distance communication. In this thesis we address the following main research questions to address the above-mentioned challenges: (1) What library of different link types would represent an optimum in the design space? (2) How would these links be used to design an application-specific NoC architecture? (3) How would applications use the resulting NoC architecture efficiently? We hypothesize that networks with a higher degree of heterogeneity, i.e., three or more link types, will improve the network throughput and consume less energy compared to traditional NoC architectures. In order to verify our hypothesis and to address the research challenges, we design
Morphological complexity and unsupervised learning: validating Russian inflectional classes using high frequency data

This paper addresses the question of whether it is possible to use machine learning techniques on linguistic data to validate linguistic theory. We determine how readily inflectional classes recognized by linguists can be inferred by an unsupervised learning method when it is presented with the paradigms of a small number (80) of high frequency Russian noun lexemes. We interpret this as a measure of the validity of the linguistic theory. Inflectional classes are of particular interest, because they constitute a kind of autonomous morphological complexity which has no direct relationship to other levels of linguistic description, and hence there is no other objective way of assessing a theoretical characterisation of them. Using the same method, we also examine the status of principal parts and defaults in inflectional classes, and the relationship between inflectional classes and stress in Russian nominal morphology. Our experiments suggest that this is an effective and interesting technique for shedding additional light on theoretical claims.
An Evolutionary Density and Grid-Based Clustering Algorithm

Abstract. This paper presents EDACluster, an Estimation of Distribution Algorithm (EDA) applied to the clustering task. EDA is an Evolutionary Algorithm used here to optimize the search for adequate clusters when very little is known about the target dataset. The proposed algorithm uses a mixed approach – density and grid-based – to identify sets of dense cells in the dataset. The output is a list of items and their associated clusters. Items in low-density areas are considered noise and are not assigned to any cluster. This work uses four public domain datasets to perform the tests that compare EDACluster with DBSCAN, a conventional density-based clustering algorithm. 1. Introduction The practice of classifying objects based on observed similarities is noticed in several daily tasks and is a common practice in different fields. Cluster analysis is the formal study of algorithms and methods to group, or to classify objects. The goal of a clustering algorithm is to find a convenient and valid organization for unexplored data (Jain et al., 1999). In other words, cluster analysis is a way to organize objects in clusters based on similarity. Intuitively, objects that belong to a group are more similar to each other than they are to objects from different groups. Besides the applications in computer science, as the exploratory data analysis, data mining, image processing and pattern recognition, cluster analysis has a vast list of applications in Biology, Psychology, Archeology, Geology, Geography and Marketing (Jain and Dubes, 1988).
Network Coding-Aware Routing Protocol in Wireless Mesh Networks

Network coding mechanisms, such as COPE, can improve network throughput effectively in Wireless Mesh Networks (WMN). While the Hybrid Wireless Mesh Protocol (HWMP) is suitable for WMN, its extension with COPE does not provide any added benefits; specifically, HWMP cannot establish paths with more coding opportunities. As a result, the advantages of network coding cannot be exploited sufficiently. This paper proposes improvements upon HWMP with a new, network Coding-Aware routing protocol (CAHWMP) for WMN. In the CAHWMP protocol, we propose a coding criterion based on data streams to devise an algorithm for actively detecting coding opportunities during path discovery. CAHWMP subsequently establishes paths using the coding-aware routing metric, which can balance channel resource consumption and the gain due to sharing resources introduced by network coding. Simulation results show that CAHWMP can establish paths with more coding opportunities; as a result, it improves network performance such as network throughput.
Handbook of Research on Educational Communications and Technology

The 4th edition of the Handbook of Research on Educational Communications and Technology expands upon the previous 3 versions, providinga comprehensive updateon research pertaining tonew and emerging educational technologies. Chapters that are no longer pertinent have been eliminated in this edition, with most chapters being completely rewritten, expanded, and updated Additionally, new chapters pertaining to research methodologies in educational technologyhave been added due to expressed reader interest. Each chapter now contains an extensive literature review, documenting and explaining themost recent, outstanding research, including major findings and methodologies employed. TheHandbookauthorscontinue to beinternational leaders in their respective fields; thelist is cross disciplinary by designand great effortwas taken to invite authors outside of the traditionalinstructional design and technology community.