Miracle-dz/UniFAR-FTUs huggingface dataset:
Integration of non-classical faults in standard March tests

New fault models like the unrestored write and the false write through faults and suitable test algorithms have recently been developed by several authors. These tests are applied in addition to March tests. Since a March test algorithm can be implemented in many different ways and still be effective in detecting its target faults, we have what we call degrees of freedom in the test space. In this paper it is shown, that for commonly used memory organizations tests for the unrestored write and false write through faults can be integrated in March test sequences. It is shown how to design address sequence generators and address dependent data for March tests, that generate all the patterns required for the detection of those faults. The detection properties of the original March tests are retained. The additional overhead in terms of silicon area and timing for an on-chip realization of a built-in March self-test with the added fault detection features is negligible and the test application time remains unchanged.
Hardware/Software Components and Applications of BCIs

Human-Computer interfaces can use different signals from the body in order to control external devices. Beside muscle activity (EMG-Electromyogram), eye movements (EOGElectrooculogram) and respiration also brain activity (EEG-Electroencephalogram) can be used as input signal. EEG-based brain-computer interface (BCI) systems are realized either with (i) slow cortical potentials, (ii) the P300 response, (iii) steady-state visual evoked potentials (SSVEP) or (iv) motor imagery. Potential shift of the scalp EEG over 0.5 – 10 s are called slow cortical potentials (SCPs). Reduced cortical activation goes ahead with positive SCPs, while negative SCPs are associated with movement and other functions involving cortical activation (Birbaumer, 2000). People are able to learn how to control these potentials, hence it is possible to use them for BCIs as Birbaumer and his colleagues did (Birbaumer, 2000, Elbert, 1980). The main disadvantage of this method is the extensive training time to learn how to control the SCPs. Users need to train in several 1-2 h sessions/week over weeks or months. The P300 wave was first discovered by Sutton (Sutton, 1965). It elicits when an unlikely event occurs randomly between events with high probability. In the EEG signal the P300 appears as a positive wave about 300 ms after stimulus onset. Its main usage in BCIs is for spelling devices, but one can also use it for control tasks (for example games (Finkea, 2009) or navigation (e.g. to move a computer-mouse (Citi, 2008)). When using P300 as a spelling device, a matrix of characters is shown to the subject. Now the rows and columns (or in some paradigms the single characters) of the matrix are flashing in random order, while the person concentrates only on the character he/she wants to spell. For better concentration, it is recommended to count how many times the character flashes. Every time the desired character flashes, a P300 wave occurs. As the detection of one single event would be imprecise, more than one trial (flashing of each character) has to be carried out to achieve a proper accuracy. Krusienski et al. (Krusienski, 2006) evaluated different classification techniques for the P300 speller, wherein the stepwise linear discriminant analysis (SWLDA) and the Fisher’s linear discriminant analysis provided the best overall performance and implementation characteristics. A recent study (Guger 2009), performed on 100 subjects, revealed an average accuracy level of 91.1%, with a spelling time of 28.8 s for one single character. Each character was selected out of a matrix of 36 characters.
Brain Musics: History , Precedents , and Commentary on Whalley , Mavros and Furniss

Whalley, Mavros and Furniss (this issue) explore questions of agency, control and interaction, as well as the embodied nature of musical performance in relation to the use of human-computer interaction through the work Clasp Together (beta) for small ensemble and live electronics. The underlying concept of the piece focuses on direct mapping of a human neural network (embodied by a performer within the ensemble) to an artificial neural network running on a computer. With our commentary, we contextualize the work by offering a brief history of music that uses brainwaves. We review the use of EEG signals for musical performance and point at precedents in EEG-based musical practice. We hope to more clearly situate Clasp Together (beta) in the broad area of Brain Computer Musical Interfaces and discuss the challenges and opportunities that these technologies offer for composers.
Wot did he say or could u not c him 4 dust? Written and spoken creativity in text messaging

About the book: Technology-mediated communication cannot help but inform our literacies. This book is a reconceptualization of the role of language and pedagogy in what Kress (2003) has termed the new media age. At the heart of the volume is the notion of 'transformation' - a change in discourse practices, meaning making, technology and, as a result, literacy acquisition itself. The chapters look at language as positioned in a hugely multimodal world. Communication extends beyond the traditional realms of discourse, from the collaborative efforts of wikis to the hybrid speech and text of online messaging. These new areas of meaning-making are excellent and extremely important avenues to explore for academics interested in applied linguistics, language and literature, language acquisition and multimodality.
Effect of GPU Communication-Hiding for SPMV Using OpenACC

In this study, we discuss overlapping possibilities of Sparse Matrix-Vector multiplication (SpMV) in cases where we have multiple RHS-vectors and where the whole sparse matrix data may or may not fit into the memory of the discrete GPU, at once, by using OpenACC. With GPUs, one can take advantage of their relatively high memory bandwidths. However, data needs to be transferred over the relatively slow PCIe bus. We implement communication-hiding to increase performance. In the case of three degrees of freedom and modeling 2,097,152 nodes, we observe a just above 40% performance increase by applying communication-hiding in our routine. This underlines the importance of applying such techniques in simulations, when it is suitable with the algorithmic structure of the problem in relation to the underlying computer architecture.
PIRCS: a link context based search on the Web

In this paper, we propose a personal information retrieval system using cooperative servers (PIRCS), which performs link context based searches with personalized retrieval settings. PIRCS works efficiently on cooperative Web architecture Kobayashi Aki et al. (2002), and searches take less time. The system is developed for use with search services that treat the Web as if it were simply a distributed network storage system without a central manager. We call these systems "super-distributed" database systems. A client of a super-distributed database retrieves information from many distant nodes, and the node information is updated autonomously. To improve the processing efficiency, the client can pass on a part of the retrieval process to other agents in the network. We aim at constructing such a super-distributed database by using the cooperative Web architecture, we developed where each Web content on an advanced Web server (AWS) knows certain linked contents, and where the AWS can pass on the link information to a client. The client, a Web browser with a search function (WBS), constructs a logical Web space for an information search with the link information. Target information is retrieved from that space by the WBS. We developed a prototype of the PIRCS super-distributed retrieval application on our cooperative Web. The WBS has an intuitional user interface, which shows the link space of the retrieved contents as a graph. In the PIRCS, the final retrieval process is done with a search engine built into the user agent (WBS). This architecture provides an optimum design for balancing the retrieval process between the server and the client. Moreover, as the retrieval is based on up-to-date information, it is more efficient than that of conventional retrieval tools, which gather content information beforehand.
Distributed Area Search with a Team of Robots

The main goal of this thesis is to demonstrate the applicability of the distributed systems paradigm to robotic systems. This goal is accomplished by presenting two solutions to the Distributed Area Search problem: organizing a team of robots to collaborate in the task of searching through an area. The first solution is designed for unreliable robots equipped with a reliable GPS-style localization system. This solution demonstrates the efficiency and fault-tolerance of this type of distributed robotic systems, as well as their applicability to the real world. We present a theoretically near-optimal algorithm for solving Distributed Area Search under this setting, and we also present an implementation of our algorithm on an actual system, consisting of twelve robots. The second solution is designed for a completely autonomous system, without the aid of any centralized subsystem. It demonstrates how a distributed robotic system can solve a problem that is practically unsolvable for a single-robot system. Thesis Supervisor: Jonathan R. Bachrach Title: Research Scientist
Address servers in hierarchical networks

An analysis is presented of an address server designed for a survivable, mobile packet-switching radio network. The load the algorithm places on the network is determined as a function of the node mobility, address request rate, and algorithm parameters. Issues associated with the design of the address server are presented, and a design is introduced and then analyzed. Also considered are two design issues which have to do with the amount of traffic generated by the address server. <<ETX>>
Displacement detection method of QR code reference object based on feature points

With the continuous development of construction technology and computer technology, in order to meet the needs of concrete quality management, a real-time monitoring information system based on computer vision is established. The identification label is added to the concrete specimen to prevent the exchange of concrete specimens. According to the needs of the application scene, this paper proposes a new feature point extraction algorithm based on Harris. By improving the positioning accuracy of feature points, it can avoid the interference of background noise points or feature points in unclear focus area on feature matching and the calculation of projection matrix; and a few feature points are used to calibrate the camera, which overcomes the problem that the traditional camera calibration method needs to make a calibration board. Experiments show that the algorithm proposed in this paper has good stability to illumination, camera angle and distractors, and is flexible in application.
ES1: A Tool for Collecting Object-Oriented Design Metrics

There is considerable evidence that object-oriented design metrics can be used to make quality management decisions leading to substantial cost savings. However, one of the major impediments to the wider adoption of object-oriented metrics in practice has been the unavailability of robust and lowcost metrics analyzers. Commercial tools tend to collect basic size metrics and many variants of size metrics. Other potentially powerful coupling metrics are typically not collected. This report is the user manual for a publicly available open-source metrics analyzer for the C++ language. This analyzer collects a set of design metrics that have been empirically demonstrated to be beneficial for making quality management decisions in practice.
THE MODEL HUMAN PROCESSOR AND THE OLDER ADULT: VALIDATION AND ERROR EXTENSION TO GOMS IN A MOBILE PHONE TASK

The Office of Graduate Studies has verified and approved the above named committee members. iii Dedicated to my loving family, Paul, Lynne, and Amber, in honor of their unrelenting faith in me. And to my Sweetest, Chris, for his endless encouragement and inspiration. iv ACKNOWLEDGEMENTS I would like to extend heartfelt gratitude to my mentor and adviser, Neil Charness, a truly remarkable academic and individual. His wisdom, enthusiasm, insight, and kindness have been instrumental to my development over the course of my graduate years, and his profound guidance has helped shape the current research, as well as the path I wish to pursue. I also offer special thanks to my undergraduate foundation from Carnegie Mellon University, where my curiosity and love for cognitive psychology was originally fostered and nurtured. And to my undergraduate professors, in particular David Klahr and Peter Stearns, who helped me experience firsthand what it means to put one's heart in one's work and to rise above any challenge. As well, many thanks to my committee members, move the project along. Finally, I would like to express sincere appreciation to my family, my beloved, Chris, my faithful friends, Tom and Lamine, and my loyal companions, Pete and Dottie… whose support have been invaluable and wondrous in their own unique ways.
The trouble with computers

As you have no d oub t noticed , we are trying som ething a little d if­ ferent a t this year’s m eeting; we have invited several groups to share w ith us the ir experiences in developing and using com puter supprt sys­ tems. My purpose here this m orn ing is to give you some background in ­ form ation on why we’re doing this and w hat we hope to achieve. I t’s a surprise to no one th a t com puter technology has been a d ­ vancing at a fan tastic ra te over the past few years. W hat does surprise m e, at least, is th a t it shows no signs of slowing down. I t ’s h a rd enough to keep track of the advances being m ade each week, let alone trying to figure ou t w hat to actually buy! I t ’s only too bad th a t o ther areas w ithin our technological society have not m ade sim ilar advances. I recently read a paper by a no ted h istorian th a t suggested th a t if technology and productiv ity in o ther industries had progresses at the sam e ra te as com ­ pu te r technology, a flight around the world would take only 24 m inutes and Cadillacs w ould get 600 miles per gallon! W hile such analogies m ay be true on the surface, they d o n ’t tell the whole story. For exam ple, if we were to focus on o ther characteristics of this rapid ly grow ing technology, we would find th a t ou r $600 C adillac could only be driven by certain individuals, could only use one type of gas; would have users m anual th a t only a few people could read or understand , and it would be extrem ely difficult to get anyone to ride w ith you! At the sam e tim e our analytical capabilities are increasing expon ­ entially, costs are decreasing at a sim ilar ra te . Tw enty five years ago it cost about $1.25 to perform 100,000 m ultip lications using a digital com puter. T oday, such a task costs m uch less th a n a penny. I t ’s possible for an individual to ren t tim e on an in te rna tiona l com m unications n e t­ work and send in form ation v irtually anyw here in the world at the ra te of 40 m illion bits per second. This is roughly equal to 480,000 university professors ta lk ing at the sam e tim e. These trem endous technological advances are not w ithout p o ten ­ tially serios side effects, however. T h e n a tu re and severity of these p ro ­ blems depend on w here you stand . From my position, for exam ple, a m ajo r p rob lem w ith com puters is tha t they are getting so affordable, and so easy to use, tha t it is ge tting very d ifficult to im press people with
Technology and Pedagogy: Building Techno-Pedagogical Skills in Preservice Teachers.

Although preservice teachers do have a degree of knowledge with regard to information and communication technologies (ICT), "they have little know-how or techno-pedagogical ability with which to integrate those technologies into their teaching practice" (Karsenti 2001, 35). This paper gives an overview of preservice teacher technology integration experiences—including selecting and assessing software, hardware, and peripherals as well as approaches to integrative instructional technology—for students completing a Bachelor of Education at the University of Lethbridge (Alberta, Canada). It outlines an approach that encourages preservice teachers to develop both techno-pedagogical skills and reflective practitioner skills.
A Risk-Free Refinement of Symmetric Nash Equilibrium in Generalized Second-Price Keyword Auctions

Symmetric Nash equilibrium is a well-known refinement of Nash equilibrium in the study of bidding behavior of online advertisers on the sponsored search advertising marketplace. This solution concept, however, has major limitations. It allows for over-bidding and has uncompelling upper bounds. In this paper, we propose a risk-free refinement of symmetric Nash equilibrium (RfSNE), to tackle these limitations. RfSNE can be determined by a bottom-up recursive algorithm. At an RfSNE, no advertiser is exposed to the risk of payoff loss caused by over-bidding. Managerially, RfSNE can be employed by search engines to help advertisers plan bidding strategy and the revenues realized on the set of RfSNEs can be used as a benchmark to evaluate alternative auction mechanisms.
Comparison of kinematic measurement: stereometry and 3-D MRI reconstruction

Iotroduction The purpose of this study was to measure the accuracy of two kinematic measuring techniques and determine the feasability of using them in conjunction. Stereometry is often used for kinematic analysis by tracking markers placed on bony landmarks. Such external motion analysis is widespread in the study of locomotion and sports medicine, but its accuracy is rarely verified because the biological system under sudy is often unknown. The use of a second technique, 3-D MRI reconsauction, is also expanding into the field of joint kinematics with quasi-static joint "motion". This is a relatively new kinematic technique, and testing its accuracy is important for its future research and clinical use. If both measuring techniques are accurate when evaluating a known system, then they are valid systems. If, in addition, the results of the two methods are not statistically significant, then they are comparable, and could be used in concert for biomechanical evaluations.
MODEL PENGEMBANGAN ASESMEN KINERJA (PERFORMANCE ASSESSMENT) MATA PELAJARAN IPA BERBASIS NILAI KARAKTER DI SMP KOTA TERNATE MALUKU UTARA

Pada sosialisasi dan pelaksanaan KTSP sejak tahun 2006, telah diterapkan konsep penilaian autentik yang didalamnya termasuk juga penilaian kinerja (Performance assesment) sebagai pilihan untuk dikembangkan oleh guru dalam menilai proses dan hasil belajar. Kurikulum Tingkat Satuan Pendidikan menyarankan bahwa pembelajaran harus berorientasi pada potensi, perkembangan, kebutuhan dan kepentingan peserta didik dan lingkungannya. Penelitian ini merupakan penelitian Pengembangan bertujuan untuk mengembangkan dan menghasilkan produk berupa instrumen penilaian kinerja (Performance assessment) yang berbasis nilai karakter khususnya matapelajaran Sains di SMP kota Ternate. Hasil penelitian ini menunjukan bahwa pengembangan model assesmen kinerja berbasis karakter diketahui valid dengan nilai total 85,7% maka secara umum produk pengembangan model assesmen kinerja berbasis karakter ini layak digunakan. Hasil revisi rubrik penilaian ini dapat digunakan sebagai alternative bagi guru untuk dikembangkan sebagai model penilaian autentik misalnya pada penilaian prosedur pengamatan dalam pelaksanaan praktikum.
Adaptive transform coding via quadtree-based variable blocksize DCT

An adaptive transform coding algorithm using a quadtree-based variable blocksize DCT (discrete cosine transform) is introduced to achieve a better tradeoff between bit rate and image quality. The choice of appropriate blocksize is determined by a mean-based decision rule that can discriminate various image contents for better visual quality. Some simulation results are given. It is found that the same or better image quality can be obtained with lower average bit rate. <<ETX>>
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods

From the publisher: This is the first comprehensive introduction to Support Vector Machines (SVMs), a new generation learning system based on recent advances in statistical learning theory. SVMs deliver state-of-the-art performance in real-world applications such as text categorisation, hand-written character recognition, image classification, biosequences analysis, etc., and are now established as one of the standard tools for machine learning and data mining. Students will find the book both stimulating and accessible, while practitioners will be guided smoothly through the material required for a good grasp of the theory and its applications. The concepts are introduced gradually in accessible and self-contained stages, while the presentation is rigorous and thorough. Pointers to relevant literature and web sites containing software ensure that it forms an ideal starting point for further study. Equally, the book and its associated web site will guide practitioners to updated literature, new applications, and on-line software.
Notes on perfect simulation

Markov Chain Monte Carlo (MCMC) originated in statistical physics, but has spilled over into various application areas, leading to a corresponding variety of techniques and methods. That variety stimulates new ideas and developments from many different places, and there is much to be gained from cross-fertilization. This book presents five expository essays by leaders in the field, drawing from perspectives in physics, statistics and genetics, and showing how different aspects of MCMC come to the fore in different contexts. The essays derive from tutorial lectures at an interdisciplinary program at the Institute for Mathematical Sciences, Singapore, which exploited the exciting ways in which MCMC spreads across different disciplines
An adaptive MLSE receiver for TDMA systems: a hybrid of per-survivor processing and tentative decision MLSE

An adaptive maximum likelihood sequence estimation (MLSE) receiver employing both the per-survivor processing (PSP)-MLSE and the tentative decision (TD)-MLSE, and selecting either one of them depending on the received signal power is proposed. The received signal power is estimated by using a channel estimate, assuming that M-ary PSK symbols are transmitted. Simulation results demonstrate that the proposed MLSE can significantly reduce the computational complexity with little degradation in performance, as compared with the conventional PSP-MLSE.