Miracle-dz/UniFAR-FTUs huggingface dataset:
Intelligent Filtering; Based on Keywords Only?

Empirical studies on users of Usenet News indicate that features other than keywords also plays an important role in the user's decision to read or reject a message. The IntFilter project aims to develop a message classi cation mechanism which use such extra features while minimizing the burden for the user who has to provide and maintain long-term queries.
Demo abstract: seamless sensor network IP connectivity

Most existing sensor network systems require custom gateways and tools to interface to the Internet. We present a seamless IP-based sensor network connectivity mechanism that allows a sensor network to be instantly connected to a PC and additionally to the Internet. We use an IP stack on the sensor network and a USB stick on the PC that acts as a wireless network card. The USB stick carries its own network drivers for both Linux and Microsoft Windows. By inserting the stick in a PC, the PC is instantly connected to the sensor network. This allows the PC to use standard tools, such as ping and web browsers to access the sensor network nodes and allows the nodes to send packets both to the PC and the Internet.
Network on Chip Routing Algorithms

1 Introduction 32 Routing on NoC 52.1 Network Topologies . 52.2 Problems on Routing . 72.2. 1 Deadlock. 82.2. 2 Livelock. 82.2. 3 Starvation. 92.3 Network Flow Control . 93 Oblivious Routing Algorithms 103.1 Dimension Order Routing . 103.1. 1 XY routing . 103.2 Turn Models . 113.3 Deterministic Routing Algorithms . 123.3. 1 Shortest Path Routing . 133.3. 2 Source Routing . 133.3. 3 Destination-tag Routing . 143.3. 4 Topology Adaptive Routing . 143.4 Stochastic Routing Algorithms . 143.4. 1 Flooding Algorithms . 143.5 Summary . 164 Adaptive Routing Algorithms 174.1 Minimal Adaptive Routing . 174.2 Fully Adaptive Routing . 174.2. 1 Congestion Look Ahead . 174.3 Turnaround Routing . 174.4 Other Adaptive Routing Algorithms . 184.5 Summary . 205 Router Architectures 215.1 Oblivious Routers . 215.1. 1 Virtual Channel Router . 215.1. 2 Xpipes . 225.1. 3 AEthereal . 235.1. 4 Proteo . 245.1. 5 MANGO . 255.1. 6 SoCBUS . 255.1. 7 Arteris . 265.1. 8 STNoC . 265.2 Adaptive Routers . 261
Sensitive Systems Incorporating Affect Recognition into Computer Based Learning

Advances in video and audio feature extraction methodology combined with adaptive processing techniques using pattern analysis models have profound implications for incorporating affect recognition into future tutoring agents. This report gives an overview of current affect recognition methodologies and the type of features that can be extracted from digital signals in the form of movement and sound analysis. There is some discussion of translating features into a set of observable human sentic data, which can be in turn ‘fuzzy-mapped’ to internal affective states. Issues concerning the digital representation and the resolution granularity of affective states are discussed. The final discussion concerns issues of implementing affect recognition methodology into tutoring agents.
OBJECT-ORIENTED RENDERING OF VOLUMETRIC AND GEOMETRIC PRIMITIVES (M.S. Thesis)

Computer graphics has, since its inception, been an invaluable tool for the understanding and analysis of datasets, both computed and acquired. The primary means for visualizing abstract datasets has been to extract two or three-dimensional geometric information from the data and display it using traditional computer graphics rendering techniques. However, this technique is not appropriate for many types of datasets and may result in loss of information in the visualization process. Volumetric datasets consist of a three-dimensional grid of scalar and/or vector values which may not be inherently representable using geometric methods. Recently, researchers haved developed specialized techniques for directly rendering volumetric data, however, not many have addressed the need to incorporate these techniques into traditional rendering systems. The objective of this research is to investigate an object-oriented approach to the analysis, design, and implementation of a ray casting rendering system which handles volumetric and geometric primitives directly. Particular attention is paid to the requirement of extensibility of the rendering system. This feature is inherent in an object-oriented design and eases the addition of new types of renderable objects and experimentation with different methods. To demonstrate, the system is extended to include a new primitive for rendering the volumetric results of computational fluid dynamics simulations on three-dimensional curvilinear solution grids.
Ellipsis in science and technology textbooks in English: Implications for Thai students

This is nn analytical study which aUempted to investigate Timi students' ability to interpret cllipticnl sentences and to recover and recognise c! Iipted elements in a science nnd technology context in English. Students' awareness, understanding, perceptions, problems nnd strategies in relation io ellipsis were nlso examined. The subjects for the study were 60 firs[ year students from King Mongkut's Institute of Technology North Bangkok (KM! TNB) who had enrolled in two compulsory English courses in KMITNB, Bangkok, Thailand. The instruments for this study were three 20 hem ellipsis tesls based on 5 ellipsis types classified by Quirk, el al. ( 1985). Items of the lesl were based on short passages extracted from three English science and leclmology textbooks commonly assigned for stt1dents to rend during their study at KMITNB: physics, mathematics, and computer textbooks. The content of all tests was the same but di ffcren L tasks were req u i rod to be done. The subject:, were asked to interpret the ellipli�al sentences and rnted the level of difficulty of each item in the first test, the interpretation test. Aller each item, they were requested to tnpc-record or write their answers lo the questions wl1y lhey interpr�! cd tlmt way and what help cd them lo do so. For the second test, the recovery ! csl, sl uden ts were asked lo supply the English ellipted elements in the blanks provided and to tape­ record or write their responses to 1he questions why they supplied such word(s) and what helped them to do so. The third test, the recognition test, was the same as the second bul multiple choice answers were provided. Students also had to say why the choice they had made was suitable. The collected datn was analysed quantitatively and qualitatively. Arithmetic mean, percentage, Man-Whitney U test, median and correlation were employed to analyse the data, -using SPSS so fl ware. The study reveals that the students could sc'! :;; l,cst in the interpretation test as they were allowed to answer in LI and a var'. ety of answers that conveyed the right or close meaning were acceptable, The f'�COb'llition test was scored the second best while the recoverability lest was sco! 'f'd the lowest. However, no mean score of any tcs! reached half of the Iota! Moreover in counting the correct number, they avernged at 7.90, 3.88, and 7.45 out of20 i1cms in tests I, 2, and 3 re.spcctively, Ellipsis type 5, structural ellipsis without precise recoverability, was found to be the most difficult
Design Principles of the ESCOT Math Environments

This paper describes the Educational Software Components of Tomorrow (ESCOT) project. The focus of the project was on principles that support problem-solving and learner-centered design issues, and the purpose was to garner lessons from a large educational software development project to share with the learning sciences and other interested communities who develop learner-centered software. The Identifying Design Principles in Educational Applets (IDEA) project, background of ESCOT, the Math Forum's Problems of the Week (PoWs), data mining for design principles, and design principles are presented. (KHR) Reproductions supplied by EDRS are the best that can be made from the original document. ETDTesting Service Service Distributed at AERA, April 2003 Design Principles of the ESCOT Math Environments Jody S. Underwood, Educational Testing Service Chris Hoadley, Penn State University Chris DiGiano, SRI International, Center for Technology in Learning Hollylynne Stohl, North Carolina State University Karen Hollebrands, North Carolina State University Paper presented at the annual meeting of the American Educational Research Association (AERA) April 21 to 25, 2003, Chicago, IL. Copyright © 2003 by Educational Testing Service. All Rights Reserved. PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIAL HAS BEEN GRANTED BY riMinor changes have been made to improve reproduction quality. c) (C) TO THE EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) Points of view or opinions stated in this 1 document do not necessarily represent official OERI position or policy. U.S. DEPARTMENT OF EDUCATION Office of Educational Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) VtliaLs.document has been reproduced as received from the person or organization originating it.
Cross Cluster Migration using Dynamite Remote File Access Support

Performing computations in dynamic cluster computing environments requires the application to adapt to the changes. Dynamite provides a dynamic load balancing mechanism to enable High Performance Computing in dynamically changing cluster of workstations environment, by performing task migration. A further step was taken, to enable cross cluster migration to obtain more computational power outside the cluster. This development of cross cluster migration in Dynamite still holds the prerequisites that the application being migrated between clusters does not perform file operations in its initial cluster. In this thesis a solution to this problem is described, supporting remote data access by integrating the existing Dynamite libraries with Global Access to Secondary Storage (GASS) libraries provided by Globus Toolkit.
Edge-based motion segmentation

Motion segmentation is the process of dividing video frames into regions which have different motions, providing a cut-out of the moving objects. Such a segmentation is a necessary first stage in many video analysis applications, but providing an accurate, efficient motion segmentation still presents a challenge. This dissertation proposes a novel approach to motion segmentation, using the image edges in a frame. Using edges, a motion can be calculated for each object. Edges provide good motion information, and it is shown that a set of edges, labelled according to the object motion that they obey, is sufficient to completely determine the labelling of the whole frame, up to unresolvable ambiguities. The areas of the frame between edges are divided into regions, grouping together pixels of similar colour, and these regions can each be assigned to different motion layers by reference to the edges. The depth ordering of these layers can also be deduced. A Bayesian framework is presented, which determines the most likely region labelling and depth ordering, given edges labelled with their probability of obeying each of the object motions. An efficient implementation of this framework is presented, initially for segmenting two motions (foreground and background) using two frames. The ExpectationMaximisation algorithm is used to determine the two motions and calculate the label probability for each edge. The frame is then segmented into regions. The best motion labelling for these regions is determined using simulated annealing. Extensions of this simple implementation are then presented. It is demonstrated how, by tracking the edges into further frames, the statistics may be accumulated to provide an even more accurate and robust segmentation. This also allows a complete sequence to be segmented. It is then demonstrated that the framework can be extended to a larger number of motions. A new hierarchical method of initialising the Expectation-Maximisation algorithm is described, which also determines the best number of motions. These techniques have been extensively tested on thirty-four real sequences, covering a wide range of genres. The results demonstrate that the proposed edge-based approach is an accurate and efficient method of obtaining a motion segmentation.
Probabilistic Approaches for Answer Selection in Multilingual Question Answering

Question answering (QA) aims at finding exact answers to a user’s natural language question from a large collection of documents. Most QA systems combine information retrieval with extraction techniques to identify a set of likely candidates and then utilize some selection strategy to generate the final answers. This selection process can be very challenging, as it often entails ranking the relevant answers to the top positions. To address this challenge, many QA systems have incorporated semantic resources for answer ranking in a single language. However, there has been little research on a generalized probabilistic framework that models the correctness and correlation of answer candidates for multiple languages. In this thesis, we propose two probabilistic models for answer ranking: independent prediction and joint prediction. The independent prediction model directly estimates the probability of an individual answer candidate given the degree of answer relevance and the amount of supporting evidence provided in a set of answer candidates. The joint prediction model uses an undirected graph to estimate the joint probability of all answer candidates, from which the probability of an individual candidate is inferred. The models consider both the relevance of individual answers as well as their correlation in order to rank the answer candidates. As a general probabilistic framework, the models support answer selection (1) in monolingual QA as well as (2) cross-lingual QA (3) on answer candidates returned by multiple extraction techniques (4) provided by different question answering systems. An extensive set of experiments was done for monolingual QA (English, Chinese and Japanese) as well as cross-lingual QA (English-toChinese and English-to-Japanese) using TREC and NTCIR questions. The empirical results demonstrate the effectiveness of the independent prediction model and the joint prediction model for answer selection in multilingual QA and the joint prediction model is useful to generate a set of unique and comprehensive answers.
Exploiting Parallelism In Setl Programs

those who gave us Unix, and the eunuchs who gave us DOS. Big thanks to my Grandma for my bicycles, and to her and my Uncle Tom for the Radio Shack electronic kits. I also thank my mom for buying my rst dream computer, an Atari 800, and my dad for selling the shotgun to buy the then very powerful IBM PC. Finally, I wish to thank my advisor, Professor David Padua, whose faith in my sensibility I should have justiiably long ago lost, but whose support patiently continued until this work's completion. Then again, this may never be complete.
A collaborative infrastructure for handling syntactic annotations

We believe that collaborative annotating is needed to build and improve large syntacti- cally annotated corpora such as tree banks or dependency banks. We present such a col- laborative infrastructure, implemented as a WEB service in the context of the French project Passage whose primary objective is the automatic syntactic annotating of a large corpus over 100 millions words.
A Comparative Genre Analysis of Memorial Cards in English and Funeral/Memorial Announcements in Persian

As covert socio-cultural relations have significant effects on language, these norms are reflected in linguistic and generic structure of public death notices as a distinctive genre. This study intended to identify the different genres of death notices (e.g. memorial advertisements, obituaries, funeral announcements/posters, memorial cards, etc.) and to conduct a comparative genre analysis of memorial cards (MCs) in English and funeral/memorial announcements (FMAs) in Persian using both qualitative and quantitative methods. The data included 22 English MCs and 40 Persian FMAs (average 80 words). The results of bottom-up analyses of different moves and steps in the 2 genres in focus revealed that, there were more similarities between English MCs and Persian FMAs than differences. Both languages introduced the deceased person, included literary or religious texts, signatures, names of the clergyman invited and included the date, time, and address of the memorial ceremony in their MCs and FMAs. While English MCs included the dates of birth and death of the deceased person and a word of acknowledgement, the Persian FMAs distinguished different types of ceremonies and named and invited the relatives, friends, or acquaintances. The results can benefit L2 writers to master the predominant structural patterns and the reflected cultural differences.
The storage and retrieval of sensor data and its annotations

The focus of this thesis is on the storage part of a sensor management system. Sensor data can already be enormous, but because every measurement stored can also contain multiple annotations the total size can really explode. Besides this, annotations are not necessarily bound to a single measurement, but can also be attached to multiple sensors and on time spans. This creates challenges in storing the data efficiently while also maintaining efficient retrieval. On the retrieval side there are all kinds of queries possible on the sensor data, annotations, time or combinations of those. To provide efficient storage for all these types of queries makes things even more challenging, because every storage method has its advantages and disadvantages. This thesis looked into a number of methods which try to solve these problems. Three of these methods were chosen and tested on scalability after which the most scalable was implemented into an open-source software package. This implementation was tested again on scalability.
Metaheuristics in Data Mining

The Metaheuristics are general strategies for designing heuristic procedures with high performance. The term metaheuristic, which appeared in 1986 for the first time (Glover, 1986), is compound by the terms: “meta”, that means over or behind, and “heuristic”. Heuristic is the qualifying used for methods of solving optimization problems that are obtained from the intuition, expertise or general knowledge (Michalewicz & Fogel, 2000). Nowadays a lot of known strategies can be classified as metaheuristics and there are a clear increasing number of research papers and applications that use this kind of methods. Several optimization methods that already existed when the term appeared have been later interpreted as metaheuristics (Glover & Kochenberger, 2003). Genetic Algorithms, Neural Networks, Local Searches, and Simulated Annealing are some of those classical metaheuristics. Several modern metaheuristics have succeeded in solving relevant optimization problems in industry, business and engineering. The most relevant among them are Tabu Search, Variable Neighbourhood Search and GRASP. New population based evolutionary metaheuristics such as Scatter Search and Estimation Distribution Algorithms are also quite important. Besides Neural Networks and Genetic Algorithms, other nature-inspired metaheuristics such as Ant Colony Optimization and Particle Swarm Optimization are also now well known metaheuristics. BACKGROUND
Extraction of German Multiword Expressions based on Parallel Text

freq50 loglik verb wprep nolink comb1 comb2 comb3 te 0.784 0.726 0.803 0.800 0.655 0.718 0.893 0.938 0.936 pda 0.755 0.744 0.780 0.057 0.107 0.152 0.925 0.960 0.969
A Future for Dynamic Neural Networks

Artificial Intelligence is a vast research area, taking its basis from the natural world. Behind each of these research areas is a mathematical basis upon which a similarity between them may be found. Once this mathematical basis is found, it can be used to show why combining certain techniques yield better results than combining other and even show where new techniques can be derived. This report begins with the reasons behind the research and then continues to explain the function of Multilayer Perceptrons, Radial Basis Functions, Kohonen Networks, Hopfield Networks, Incremental Networks, Dynamic Networks (including some novel ideas), Cellular Automata, Genetic Algorithms, Classifier Systems, Learning Classifier Systems and Bayesian Belief Networks. The report then continues by explaining RAIH, the software that shall be used to test any emergent technique and a brief explanation of how the work will continue. The report finishes with a conclusion that the mathematics behind the techniques outlined will help future researchers gain insight into combining the best facets of each technique. A Future for Dynamic Neural Networks R. I. W. Lang Tech Report No. CYB/1/PG/RIWL/V1.0 Page 2
3D user interface design

3D user interface design is a critical component of any virtual environment (VE) application. In this paper, we present a broad overview of three-dimensional (3D) interaction and user interfaces. We discuss the effect of common VE hardware devices on user interaction, as well as interaction techniques for generic 3D tasks and the use of traditional two-dimensional interaction styles in 3D environments. We divide most user interaction tasks into three categories: navigation, selection/manipulation, and system control. Throughout the paper, our focus is on presenting not only the available techniques, but also practical guidelines for 3D interaction design and widely held myths. Finally, we briefly discuss two approaches to 3D interaction design, and some example applications with complex 3D interaction requirements. We also present an annotated online bibliography as a reference companion to this article.
Strongbox: A System for Self-Securing Programs

Security is a pressing problem for distributed systems. Distributed systems exchange data among a variety of users over a variety of sites, which may be geographically separated. A user who stores important data on processor A must trust not just processor A but also the processors B C D . with which A communicates. The distributed security problem is difficult, and few major distributed systems attempt to address it. In fact, conventional approaches to computer security are so complex that they actually discourage designers from trying to build a secure distributed system: A software engineer who wishes to build a secure distributed data application finds that he or she must depend on the security of a distributed database which depends on the security of a distributed file system which depends on the security of a distributed operating system kernel, etc. Under this traditional design approach, security necessarily becomes a secondary concern since just making an (unsecure) distributed system work efficiently is a daunting task. And adding security raises the difficulty by an order of magnitude. We propose a new model of security: self-securing programs. Self-securing programs are designed to run in environments where only a minimal number of
Instructional Models for English Language Learners as Contributors to Elementary Teachers' Effectiveness

Instructional Models for English Language Learners as Contributors to Elementary Teachers’ Effectiveness by Arleen Folorunsho MEd, Nova Southeastern University, 1997 BS, Florida Memorial University, 1993 Doctoral Study Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Education