Miracle-dz/UniFAR-FTUs huggingface dataset:
Definite Description Processing in Unrestricted Text

Noun phrases with the definite article the, that we call DEFINITE DESCRIPTIONS, following (Russell, 1905), are one of the most common constructs in English, and have been extensively studied by linguists, philosophers, psychologists, and computational linguists. In this dissertation we present an implemented model of definite description processing that is based on extensive empirical studies of definite description use and whose performance can be quantitatively measured. In almost all approaches to discourse processing and discourse representation, definite descriptions have been regarded as anaphoric1; and the models of definite description processing proposed in the literature tend to emphasise the role of common-sense inference mechanisms. Recent work on discourse interpretation (Carletta, 1996; Carletta et al., 1997; Walker and Moore, 1997) has claimed that the judgements on which a theory is based should be shared by more than one subject. On the basis of previous linguistics and corpus linguistics work, we developed several annotation schemes and ran two experiments in which subjects were asked to annotate the uses of definite descriptions in newspaper articles. We compared their annotations and used them to develop our system and to evaluate its performance. Quantitative evaluation has become an issue in other language engineering tasks such as parsing, and has shown its usefulness also for theoretical developments. Recently, evaluation techniques have been introduced for semantic interpretation as well, as is the case for the Sixth Message Understanding Conference (MUC-6) (Sundheim, 1995). However, in this case, the emphasis was on the engineering aspects rather than on a careful study of the phenomena. Our goal has been to develop methods whose performance could be evaluated, but that were based on a careful study of linguistic evidence. The empirical studies we present are evidence that definite descriptions are not primarily anaphoric; they are often used to introduce a new entity in the discourse. Therefore, in the model of definite description processing that we propose, recognising discourse new descriptions plays a role as important as identifying the antecedent of those used anaphorically. Unlike most previous models, our system does not make use of specific hand coded knowledge or common-sense reasoning techniques; the only lexical source we use is WordNet (Miller et al., 1993). As a consequence, our system can process definite descriptions in any domain; a drawback is that our coverage is limited. Nevertheless, our studies serve to reveal the kind of knowledge that is needed for resolving definite descriptions, especially the bridging cases. The system resulting from this work can be useful in applications such as semi-automatic coreference annotation in unrestricted domains. Anaphoric expressions are those linguistic expressions used to signal, evoke or refer to previously mentioned entities.
Language and Gesture: Blended spaces and deixis in sign language discourse

Introduction It is abundantly clear that gestures constitute a highly significant, often indispensable, aspect of spoken language discourse. Can the same be said of sign language discourse, where signs themselves are produced by gestures of the hands, arms, and body? Does sign language discourse make use of spontaneous gestures, distinguishable from lexical signs, that convey meanings such as those conveyed by gesture in spoken language discourse? I will argue that it does. Although I focus on deictic gestures, it will become apparent that sign language discourse also includes gestures in which the actions of the signer illustrate the actions of one of the characters in a narrative. Mental-space theory (Fauconnier 1994, 1997) provides the conceptual structures needed for constructing meaning from the linguistic signal and has been employed to successfully solve numerous previously intractable linguistic problems. Phenomena such as metonymy, reference, co-reference, and presupposition have all been shown to depend on mental-space configurations. I will argue that mental spaces are also essential in understanding the significance of the gestural signal. I will begin by describing the production of signs in some detail. Understanding the nature of the articulation of the signed signal is essential in making the distinction between articulatory gestures of the hands equivalent to gestures of the tongue in the production of speech and other types of spontaneous, nonlexical gestures. Next I will provide a brief history of the treatment of space in the analysis of ASL. The gestures I will treat as pointing gestures have been previously analyzed as ordinary linguistic, articulatory movements.
Inter-Image Quality Measure Assessments for Face Recognition under Realistic Conditions

— Face recognition consists of finding the name of the person (class label) by using the trained model. Face recognition becomes complex due to variation in illumination, pose variation and occlusions in images. They are considered as outliers and removal of these outliers makes the image classification easier. The outliers due to illumination are removed by normalization. Saliency based image quality measures changes with the occlusion and pose variation. So it is used for image classification.
Getting to the Information you Already have

Abstract : Knowledge workers need to find information but even when it is stored on their local computer systems, finding it can be costly. There are many researchers working on solutions to reduce these costs, but there has been little research into exactly what these costs are, and what the ties are between these costs and users' choices between ways to access their local information. This paper provides a methodology for investigating such issues, and reports empirical results on ways of accessing local, task-relevant resources "e.g. document files", their associated costs, and users' sensitivities to certain kinds of costs. Our results fill in gaps in what has been known about the problem, thereby helping to inform research on solutions to the problem.
İLKÖĞRETİM OKULÖNCESİ ÖĞRETMEN ADAYLARININ FEN İLE İLGİLİ ÖZ YETERLİK İNANÇ DÜZEYLERİNİN İNCELENMESİ

Oz yeterlik bireyin olasi durumlar ile basa cikabilmek icin gerekli olan eylemleri ne kadar iyi yapabildiklerine iliskin inanclari olarak tanimlanir. Oz yeterlik inancinin bireyin dogru ya da yanlis etkinlikler yapma davranisini etkiledigini, ayni zamanda bireyin bir sorun ile karsilastiginda sorunu cozmek icin ne kadar caba harcayacagi ve ne kadar israrci olacaginin belirtisi oldugunu da vurgulamaktadir. Okuloncesi fen egitiminde, ogretmenlerin oz yeterlik inanc duzeylerinin yuksek olmasi, gerek egitim verdikleri ogrencilerini gerekse kendilerini gelistirmede oldukca onemlidir. Bu arastirmada amac okuloncesi ogretmen adaylarinin fen ogretimine yonelik oz yeterlilik inanc duzeylerinin tespit edilmesi amaclanmistir. Bu amacla, Kasim 2005 tarihinde Selcuk Universitesi Egitim Fakultesi Egitim Fakultesi Ilkogretim Bolumu Okuloncesi Ogretmenligi Anabilim Dalinda egitim goren 180 ogrenciye Enochs ve Riggs tarafindan gelistirilen fen ogretiminde oz yeterlik inanci olcegi uygulanmistir. Ayrica arastirmada sinif, yas, genel not ortalamasi ve mezun olunan lise turu bagimsiz degiskenler olarak ele alinmistir. Sonuclarin cozumlenmesinde SPSS 13.0 istatistik paket programi kullanilarak tek yonlu varyans analizi, regresyon, yuzde ve frekans analizleri uygulanmistir. Bu arastirma sonucuna gore okuloncesi ogretmen adaylarinin 1. sinif ogrencilerinin diger siniflarda egitim goren ogrencilere gore daha dusuk fene yonelik oz yeterlik inanc duzeylerinin oldugu tespit edilmistir. Ayrica genel not ortalamalari arttikca fene karsi oz yeterlilik inanc duzeylerinin de yukseldigi gorulmustur. Lise turu ve yas degiskenlerine gore okuloncesi ogretmen adaylarinin fene yonelik oz yeterlik algisinda anlamli bir farklilik gorulmemistir.
Automatic computation and data decomposition for multiprocessors

Memory subsystem efficiency is critical to achieving high performance on parallel machines. The memory subsystem organization of modern multiprocessor architectures makes their performance highly sensitive to both the distribution of the computation and the layout of the data. A key issue in programming these machines is selecting the computation decomposition and data decomposition, the mapping of the computation and data, respectively, across the processors of the machine. A popular approach to the decomposition problem is to require programmers to perform the decomposition analysis themselves, and to communicate that information to the compiler using language extensions. This thesis presents a new compiler algorithm that automatically calculates computation and data decompositions for dense-matrix scientific codes. The core of the algorithm is based on a linear algebra framework for expressing and calculating the computation and data decompositions. Using the linear algebra model, the algorithm generates a system of equations that specifies the conditions the desired decompositions must satisfy. The decompositions are then calculated systematically by solving the system of equations. Since the best decompositions may change as different phases of the program are executed, the algorithm also considers re-organizing the data dynamically. The analysis is performed both within and across procedure boundaries so that entire programs can be analyzed. We have incorporated our techniques into the SUIF parallelizing compiler system. We evaluated the effectiveness of the algorithm by applying the compiler to a suite of benchmark programs, and compared the performance of the resulting code to the performance obtained without using our techniques. We found that our decomposition analysis and optimization can lead to significant increases in program performance.
Collocations across Hard and Soft Sciences: A Lexical Priming Analysis

Abstract- According to the Lexical Priming Theory [8], the collocational primings of a word impinge on the genre or discipline in which it occurs. This study attempted to compare the collocates of one noun (group) and the positions of the collocates prior and subsequent to the node word in two specialized corpora of hard and soft sciences to find out whether they are realized similarly or differently in different disciplines. To this end, two specialized corpora of hard (chemistry and physics) and soft (psychology and sociology) sciences were developed, each including more than 5 million words. Then, one noun which was frequently used across the corpora was selected. The fifth version of the Word Smith Tools software (Scot, 2010) was used to detect the first 15 collocates of the word and the frequencies of its occurrences in 10 possible positions prior and subsequent to the node word. Results revealed that words collocate with different words, especially content words, in different disciplines. Moreover, the occurrences of collocates are positions specific. In other words, collocates of a word tend to occur in or avoid certain positions in different disciplines.
Compiling for NUMA Parallel Machines

A common feature of many scalable parallel machines is non-uniform memory access (NUMA)--data access to local memory is much faster than to non-local memories. In addition, when a number of remote accesses must be made, it is usually more efficient to use block transfers of data rather than to use many small messages. Almost every modern processor is designed with a memory hierarchy organized into several levels--each smaller and faster than the level below. In general, the effective use of parallel machines requires careful attention to the following issues: (1) exposing and exploiting parallelism; (2) accessing local memory instead of remote memory; (3) using block transfers for remote accesses; (4) reusing data in the cache; and (5) load balancing. We have built a system called Pnuma for programming NUMA machines. We make the following contributions: First, we propose a parallelization scheme for both parallelism and data locality. Second, we develop a framework based on non-singular matrices and integer lattice theory for the systematic development of loop transformations. Program transformations, such as loop restructuring, are critical to achieving high performance. The framework can be used in parallelizing compilers for both coarse-grain and fine-grain parallel architectures. We have implemented a loop restructuring tool-kit called Lambda based on this framework. Third, using this loop transformation framework, we develop algorithms for improving memory locality. The memory locality algorithm restructures loop nests to expose opportunities for parallel execution and for block transfers, while keeping data accesses local wherever possible. Fourth, for cache locality, we introduce a new simple cache model based on reuse distances, which is more precise than the existing reuse vector space model. We develop a new loop transformation technique that optimizes directly on reuse distances, so that no exhaustive search is necessary. Fifth, we use our loop transformation framework to improve parallelism as well. We develop a unified algorithm for parallelism, memory locality and cache locality. System evaluations have been conducted on a multiprocessor machine without cache (BBN GP1000), a uniprocessor workstation with cache (HP 9000/720) and a multiprocessor machine with caches (KSR1), using programs from linear algebra, NASA benchmarks and SIMPLE hydrodynamics benchmark.
Uncovering Plagiarism Networks

Plagiarism detection in educational programming assignments is still a problematic issue in terms of resource waste, ethical controversy, legal risks, and technical complexity. This paper presents AC, a modular plagiarism detection system. The design is portable across platforms and assignment formats and provides easy extraction into the internal assignment representation. Multiple similarity measures have been incorporated, both existing and newly-developed. Statistical analysis and several graphical visualizations aid in the interpretation of analysis results. The system has been evaluated with a survey that encompasses several academic semesters of use at the authors' institution.
PENGARUH MODEL PROBLEM BASED LEARNING (PBL) TERHADAP KEMAMPUAN MEMECAHKAN MASALAH DAN HASIL BELAJAR KOGNITIF BIOLOGI SISWA KELAS VII SMP NEGERI 14 SURAKARTA TAHUN PELAJARAN 2011/2012

ABSTRACT – This research aims to determine the effect of PBL learning model of problem-solving skills and cognitive learning outcomes biology class VII students of SMP Negeri 14 Surakarta. PBL model is a model of learning by forcing students to practical problems or as a foothold in learning, in other words, students learn through the problems. Given the problems the students are challenged to find / search for a solution of real world problems can be resolved as a group (in collaboration). The cooperation will enable students in learning to improve problem-solving skills and cognitive learning outcomes. This research is a Quasi Experimental research design using a pretest-postest Control Group. Population is all students in grade VII Junior High School 14 Surakarta with cluster random sampling technique using sampling. Aspects of data collection techniques and problem-solving skills using the cognitive learning outcomes tests are analyzed using statistical tests anacova. Keywords : Model of Problem Based Learning (PBL), Problem Solving Ability, Cognitive Sciences Learning Outcomes
Event-related potentials : a methods handbook

The study of event-related potentials (ERPs) -- signal-averaged EEG recordings that are time-locked to perceptual, cognitive, and motor events -- has increased dramatically in recent years, but until now there has been no comprehensive guide to ERP methodology comparable to those available for fMRI techniques. Event-Related Potentials meets the need for a practical and concise handbook of ERP methods that is suitable for both the novice user of an ERP system and a researcher more experienced in cognitive electrophysiology. The chapters in the first section discuss the design of ERP experiments, providing a practical foundation for understanding the design of ERP experiments and interpreting ERP data. Topics covered include quantification of ERP data and theoretical and practical aspects of ANOVAs as applied to ERP datasets. The second section presents a variety of approaches to ERP data analysis and includes chapters on digital filtering, artifact removal, source localization, and wavelet analysis. The chapters in the final section of the book cover the use of ERPs in relation to such specific participant populations as children and neuropsychological patients and the ways in which ERPs can be combined with related methodologies, including intracranial ERPs and hemodynamic imaging.
Content-based second language instruction

In the "Michigan Classics Edition of Content-Based Second Language Instruction," the authors provide updates on the field of CBI in second language acquisition since 1989.While the core of the book remains the same, new features discuss important CBI-related research and modifications to the pedagogy in the past many years. "Content-Based Second Language Instruction, Michigan Classics Edition," now includes: a new preface a glossary of key terms an updated bibliography an epilogue highlighting the major developments in the field since 1989.
Modeling Fake News Detection Using BERT-CNN-BiLSTM Architecture

The work presented in this paper explores a deep 6-way multi-class classifier based on the existing pre-trained Bidirectional Encoder Representations from Transformers (BERT) for classifying a statement into six fine- grained categories offake news. Our framework consists of three main components: (1) $BERT_{base}$ is used to encode and represent the text data into meaningful vectors, which are then fed into a CNN followed by a max-pooling layer for feature map reduction; (2) the metadata of the statement is encoded using another CNN to capture local patterns, and then the output is fed into a BiLSTM to extract more contextual features; and (3) these two components are concatenated and passed to a fully connected layer for classification. Our findings reveal the importance of conducting a feature selection ap-proach. We believe a stronger focus should be placed on pre-processing the data in question by selecting those relevant features (e.g., credit history) since some other features are rather confusing to the classifier, leading to performance degradation. The effectiveness of the proposed framework is evaluated on a benchmark dataset, and the obtained results demonstrate that the proposed framework is very effective, if not superior, compared with the state-ofthe-art fake news detection approaches.
Innovative coding scheme for spread-spectrum communications

It is known that spread-spectrum (SS) communications in general, and code-division multiple access (CDMA) in particular, gain certain advantages in performance, if powerful low-rate error-correcting codes are used for error-protection in such systems. We propose an innovative coding scheme for SS systems based on Gallager (low-density parity-check) codes that can be iteratively decoded with relatively low complexity. Consequently, this scheme is readily implementable in both base station and subscriber side receivers. We focus our attention on Gallager codes with parameters compatible with the IS-95 cellular radio standard. We discuss soft- and hardware implementations of iterative decoding for Gallager codes. We estimate that by using Gallager codes, a factor of five improvement in CDMA cell capacity relative to the uncoded system can be achieved, equivalent to a factor of two improvement relative to the state-of-the art orthogonal convolutional codes.
PERBANDINGAN PERSENTASE VOLUME TERAS KAYU JATI CEPAT TUMBUH DAN KONVENSIONAL UMUR 7 TAHUN ASAL PENAJAM, KALIMANTAN TIMUR

Kayu jati ( Tectona grandis L.f.) telah dikenal sebagai bahan baku mebel dan konstruksi dengan kualitas tinggi. Jati cepat tumbuh atau dikenal dengan nama dagang 'Jati super', 'Jati unggul', 'Jati prima' atau 'Jati emas' merupakan tanaman jati yang dikembangkan melalui kultur jaringan dan bertujuan menambah pasokan bahan baku kayu jati. Sedangkan kayu jati konvensional merupakan tanaman yang dikembangkan melalui perkecambahan biji. Informasi mengenai kualitas kayu jati cepat tumbuh belum diketahui. Salah satu parameter kualitas kayu jati dapat dilihat dari persentase kayu terasnya dalam batang. Penelitian ini bertujuan membandingkan persentase teras kayu jati super dan konvensional pada umur dan lokasi yang sama. Hasil pengamatan menunjukkan bahwa pada umur 7 tahun, kayu teras telah terbentuk pada seluruh lempengan kayu jati super maupun konvensional dari bagian ujung, tengah dan pangkal. Persentase kayu teras jati super rata-rata 39,6%, lebih besar dari jati konvensional 20,3%. Berdasarkan persentase kayu terasnya kayu jati konvensional lebih baik dari jati super. Namun, parameter kualitas kayu yang lain juga harus diperhatikan seperti kualitas serat, kandungan bahan kimia dan keawetan alaminya. Berdasarkan SNI 01-5007.1-2003, batang kayu jati super dan konvensional pada umur 7 tahun dapat masuk dalam kriteria kayu bulat kecil (KBK, A.I.).
The concise Oxford English dictionary

This reissue of the revised edition of the "Concise Oxford English Dictionary" brings the tenth edition completely up to date by the addition of hundreds of new words and meanings taken from Oxford's data collection programme, with a special focus on fast-changing areas of the language such as new technology, e-commerce, fashion, and youth culture. In addition there is a new 40-page section including information on countries and nationalities, alphabets and accents, weights and measures, and a games and puzzles wordfinder. There is also a new grammar guide and a section covering the language emerging through new technologies such as SMS.