Miracle-dz/UniFAR-FTUs huggingface dataset:
SSVEP stimuli design for object-centric BCI

In order to design brain-computer interface applications based on steady-state visually evoked potentials (SSVEP), one has to decide on the shape, the attributes and the way the SSVEP stimuli are to be displayed to the user. This choice is generally driven by the tasks to achieve and, eventually, the complexity of the systems to be controlled. An ‘object-affordance centric’ approach consists in ﬂickering objects of interest that appear in the ﬁeld of view of the user during video feedback, e.g. provided by a robotic surrogate embedded with cameras. Processing of the video images automatically recognizes objects of interest that are in the user’s ﬁeld of view. These are overlapped with graphical icons that ﬂicker at different frequencies to be recognized by the SSVEP-BCI classiﬁer. This study investigates selected graphical and rendering practices that affect the strength of the SSVEP to produce the highest performance during BCI operations.
Decryption-decompression of AES protected ZIP files on GPUs

AES is a strong encryption system, so decryption-decompression of AES encrypted ZIP files requires very large computing power and techniques of reducing the password space. This makes implementations of techniques on common computing system not practical. In [1], we reduced the original very large password search space to a much smaller one which surely containing the correct password. Based on reduced set of passwords, in this paper, we parallel decryption, decompression and plain text recognition for encrypted ZIP files by using CUDA computing technology on graphics cards GeForce GTX295 of NVIDIA, to find out the correct password. The experimental results have shown that the speed of decrypting, decompressing, recognizing plain text and finding out the original password increases about from 45 to 180 times (depends on the number of GPUs) compared to sequential execution on the Intel Core 2 Quad Q8400 2.66 GHz. These results have demonstrated the potential applicability of GPUs in this cryptanalysis field.
Theories and Strategies Related to Measurement in Individualized Instruction.

One of the basic problems in relating learning theories to instructional strategies is that traditionally learning theory has researched the micro unit whereas the instructional envircnment studies the macro unit. Traditionally, instructional strategy research and development takes the learner as he comes, an integrated organism. In lea-ning theory research, there is control and limitation on the structure of the learning materials, whereas instructional subject-matter is rich in potential organization and hierarchical orderings. Moreover, learning theory research deals in a subset of factors relevr-truction. This paper addresses problems in bridging gc i learning research and instructional development by considering the relevance of the premises of learninj theory and identifying some promising directions that draw on the concepts of cybernetics and information processing. (Author) Imr -a=sm. 11F 411.IIIIIII AIII=1110t X1r-1111 41C=M1 IR ig=wm.e=mis up=10. --.
Automatic face feature tracking

A reliable face tracking can be obtained by integrating of the region detection, feature locating and tracking. To detect the face feature region, we used the mean shift method that is a clustering technique for multivariate data, and to track face landmark features, we also used the STK tracking method. STK tracking is very efficient for feature tracking, but the Newton-Raphson iteration scheme has the initial coordinate problem for tracking features. To solve the problem, we proposed a new BMA-NR method of the STK algorithm for face landmark features. Preliminary results indicate that this method solves the local minimum problem which occurs by NR iteration.
A very fast digital realization of a time-domain block LMS filter

A novel digital implementation of time-domain block LMS (least mean square) filtering is presented. The primitive operators are serial-parallel multipliers which produce the results digit by digit, most significant first. The use of a redundant notation is essential here. These operators are placed in a parallel and pipeline structure, resulting in a fast realization with O(log(L*N) mod /sub L/) time, where N and L are filter length and block length, respectively. This new realization is particularly suitable for VLSI implementation because of this modularity and the high integration capacity of the serial-parallel multipliers. <<ETX>>
Kernel covering algorithm and a design principle for feed-forward neural networks

Kernel technique supplies a systematic and principled approach to training learning machines and the good generalization performance achieved can be readily justified using statistical learning theory. In this paper, we convert classification problem into a set cover one, present a kernel covering algorithm which combines kernel technique with covering approach. This algorithm is constructive, and bypasses the problems of convergence and convergence speed. Analyzing the statistical properties of the covering classifier, we offer a bound of the actual risk. In virtue of the variety of kernels, a general design principle for feed-forward neural networks is drawn.
World Without Words

Leading his readers on a voyage through the visual shorthand of modern life, the author argues that we are relying less on words for navigating the world than on images and graphic devices. This sourcebook shows the attempts of designers to condense words and data down to their simplest equivalents. It illustrates the familiar, the peculiar and the confusing visual language that we are asked to interpret (symbols, graphs and charts, maps) mixed up with the more graphic examples of data storage and identification that are read not by humans but by machines (barcodes, magnetic strips, holograms). Featuring airport signs, road markings, pictograms, maps, diagrams, packaging, logos and symbols, this compendium of visuals shows not only the norms of wordless graphic communication but also how these vary around the world when interpreted by local individuals for different cultures
A Channel Splitting Technique for Reducing Handoff Delay in Wireless Networks

Handoff management plays an important role in next generation wireless network for providing the Quality of Service to the mobile users. Wireless Mesh Network (WMN) is the most promising and cost-efficient next generation wireless network for providing large-scale internet based wireless access. The Intergateway handoff is a major concern to guarantee continuous communications in Internet-based Wireless Mesh Networks (WMN). The previous system focus on intragateway handoff designed for single-hop wireless access network that supports only low handoff delay but there is no consideration for reducing the long handoff delay in WMNs due to the existence of multi-hop wireless links. In this paper, we are reducing the long handoff delay factor by proposing a channel splitting technique in multihop wireless link. By using channel splitting technique, the handoff delay in WMNs is guaranteed and channel utilization is improved. The data traffic is reduced and hence high throughput is achieved. The NS2 simulated results shows that handoff performance can be improved by our proposed handoff technique.
Formative assessment in grade 8 mathematics : teachers' perceptions and implementation.

The constitution of Republic of South Africa (Act 108 of 1996) provides the basis for curriculum transformation and assessment for development in South Africa. The curriculum aims to develop the full potential of each learner as a citizen of a democratic South Africa. Formative assessment is seen as an assessment that can develop the standard of education in South Africa. Muller (2004) asserts that the C2005 policy document and assessment policy for General Education and Training make much of the need to shift from this "authoritarian" approach, to assessment which is formative, standard-based and continuous. Therefore, formative assessment is important in the process of teaching and learning. This study explores teachers' knowledge of formative assessment and how they translate it into practice within a context of Mathematics. It ~xamines the nature of assessment techniques used by educators at the school and explore its relationship with practice. Furthermore, it aims to determine whether the educators are willing to adapt formative assessment practice to meet the changing demands of South African school education as prescribed by the New Curriculum Statement (NCS) in grade 8. Data collection and observations for the study were conducted at a high school in Hammarsdale, KwaZulu-Natal, South Africa. Four teachers were interviewed to determine their perception of formative assessment. Two of the four teachers were selected on basis of the interviews for further data collection. These two were observed when conducting lessons. At least two lessons for each teacher were observed. The nature of the task that the two teachers designed for formative purpose and the feedback they gave to learners were analyzed. The findings from this study suggest that teachers ~o not reject or resist change in practicing formative assessment, but they have not been properly assisted to replace the old practices with new ones. The teachers therefore, interpret formative assessment according to their own accumulated understanding, which differ from teacher to teacher. Thus, the study. recommends that if the change in assessment practice is to be "efficient", it must be accommodated by "appropriate" professional development of teachers.
Stabilization for Networked Control Systems with Random Sampling Periods

This paper investigates the stabilization of networked control systems (NCSs) with random delays and random sampling periods. Sampling periods can randomly switch between three cases according to the high, low, and medium types of network load. The sensor-to-controller (S-C) random delays and random sampling periods are modeled as Markov chains. The transition probabilities of Markov chains do not need to be completely known. A state feedback controller is designed via the iterative linear matrix inequality (LMI) approach. It is shown that the designed controller is two-mode dependent and depends on not only the current S-C delay but also the most recent available sampling period at the controller node. The resulting closed-loop systems are special discrete-time jump linear systems with two modes. The sufficient conditions for the stochastic stability are established. An example of the cart and inverted pendulum is given to illustrate the effectiveness of the theoretical result.
Understanding the Linux Kernel, Second Edition

From the Publisher: To thoroughly understand what makes Linux tick and why it's so efficient, you need to delve deep into the heart of the operating system -- into the Linux kernel itself. The kernel is Linux -- in the case of the Linux operating system, it's the only bit of software to which the term "Linux" applies. The kernel handles all the requests or completed I/O operations and determines which programs will share its processing time, and in what order. Responsible for the sophisticated memory management of the whole system, the Linux kernel is the force behind the legendary Linux efficiency. The new edition of Understanding the Linux Kernel takes you on a guided tour through the most significant data structures, many algorithms, and programming tricks used in the kernel. Probing beyond the superficial features, the authors offer valuable insights to people who want to know how things really work inside their machine. Relevant segments of code are dissected and discussed line by line. The book covers more than just the functioning of the code, it explains the theoretical underpinnings for why Linux does things the way it does. The new edition of the book has been updated to cover version 2.4 of the kernel, which is quite different from version 2.2: the virtual memory system is entirely new, support for multiprocessor systems is improved, and whole new classes of hardware devices have been added. The authors explore each new feature in detail. Other topics in the book include: Memory management including file buffering, process swapping, and Direct memory Access (DMA) The Virtual Filesystem and the Second Extended Filesystem Process creation and scheduling Signals, interrupts, and the essential interfaces to device drivers Timing Synchronization in the kernel Interprocess Communication (IPC) Program execution Understanding the Linux Kernel, Second Edition will acquaint you with all the inner workings of Linux, but is more than just an academic exercise. You'll learn what conditions bring out Linux's best performance, and you'll see how it meets the challenge of providing good system response during process scheduling, file access, and memory management in a wide variety of environments. If knowledge is power, then this book will help you make the most of your Linux system.
Adobe Photoshop 5.5 for Photographers: A professional image editor's guide to the creative use of Photoshop for the Macintosh and PC

Master the power of Photoshop CS3 with an internationally renowned photographer by your side.Adobe's Photoshop CS3 comes with powerful new features with huge payoffs. But it can be overwhelming to learn, even for professional photographers, graphic designers, keen amateurs, and others who already have an initial grasp of Photoshop. Acclaimed photographer Martin Evening, who wrote the best-selling previous books, 'Adobe Photoshop for Photographers', makes it easy with this new, thoroughly updated edition. * Illustrated throughout with before-and-after pictures - more than 750 professional, color illustrations! * Practical techniques and real-life assignments* Step-by-step tutorials* Keyboard shortcut reference guideIncludes FREE DVD with:* QuickTime movie tutorials for MAC and PC * Searchable tips on tools, palettes layer styles, and shortcuts * Includes images selected for you to experiment with to get you up to speed with everything in the book, including the new Photoshop CS3 features, fast! * Updated Camera Guide to help you decide which will best suit your needs, plus bonus Digital Capture chapter in printable PDF formatUncover quickly exactly what Adobe's CS3 now offers photographers. New tutorials focus on the key features introduced in CS3. You lose no time in finding out how to put your ideas to work with:* Adobe's Camera Raw 4 plug-in that can now also process TIFFs and JPEGs* New Align controls for combining HDR images; Photomerge; new Clone Stamp; Curves dialog that now incorporates Levels functionality; and improved controls for Brightness/Contrast to match raw image processing controls* The latest on Black and White adjustment, which provides all the black and white conversion tools you need for optimum monochrome conversions* A pro's scoop on choosing from among dozens of Photoshop's image adjustment methods to get the results you want* Tips on Bridge 2.0 and Lightroom - when you should use each* Top tactics for successful composite images, insider guidance on editing shadows and highlight adjustments, and lessons on how to preview and re-edit filter effects as many times as you want - without complex workaroundsGet the preeminent advice from one photographer to another as Martin completely updates you on the core aspects of working with Photoshop, digital workflow, and improving accessibility. Real-life examples, diagrams, illustrations, and step-by-step explanations ensure that you're up to speed with the next generation of digital photography in no time! Foreword by Adobe Systems' key Director of Engineering, Digital Imaging, Marc Pawliger * Over 750 professional, color images make this book stand above the rest * New DVD! Searchable info explains tools, palettes & layer styles, also includes invaluable QuickTime movie tutorials * Master the power of Photoshop CS3 under the instruction of an internationally recognised Photoshop expert & Adobe alpha tester
Understanding Linux Network Internals

If you've ever wondered how Linux carries out the complicated tasks assigned to it by the IP protocols -- or if you just want to learn about modern networking through real-life examples -- Understanding Linux Network Internals is for you. Like the popular O'Reilly book, Understanding the Linux Kernel, this book clearly explains the underlying concepts and teaches you how to follow the actual C code that implements it. Although some background in the TCP/IP protocols is helpful, you can learn a great deal from this text about the protocols themselves and their uses. And if you already have a base knowledge of C, you can use the book's code walkthroughs to figure out exactly what this sophisticated part of the Linux kernel is doing.Part of the difficulty in understanding networks -- and implementing them -- is that the tasks are broken up and performed at many different times by different pieces of code. One of the strengths of this book is to integrate the pieces and reveal the relationships between far-flung functions and data structures. Understanding Linux Network Internals is both a big-picture discussion and a no-nonsense guide to the details of Linux networking. Topics include:Key problems with networkingNetwork interface card (NIC) device driversSystem initializationLayer 2 (link-layer) tasks and implementationLayer 3 (IPv4) tasks and implementationNeighbor infrastructure and protocols (ARP)BridgingRoutingICMPAuthor Christian Benvenuti, an operating system designer specializing in networking, explains much more than how Linux code works. He shows the purposes of major networking features and the trade-offs involved in choosing one solution over another. A large number of flowcharts and other diagrams enhance the book's understandability.
So what can we talk about now

Impure water is made suitable for drinking in an apparatus comprising a pressurizable holding tank attached to a purification cartridge containing an impurities adsorbent and a fine filter. A gas-containing cartridge is pierced to provide a bactericidal gas for killing pathogenic microorganisms and for pressurizing the holding tank to force the water through the purification cartridge.
Intrusion Detection and Prevention in High Speed Network

With the rapid development and comprehensive application of network technology, network security problems gradually appear serious. Traditional firewall technologies can’t provide sufficient security protection against various attacks and intrusions (Anderson, 1980), while intrusion detection systems (IDS) are faced with compromise between false alarms and false positives (Denning, 1987). In this chapter, we investigate intrusion detection and intrusion prevention in high speed network, introduce related technology and our research results.
The role of heuristics in automated theorem proving J.A Robinson's resolution principle

The aim of this paper is to show how J.A. Robinson's resolution principle was perceived and discussed in the AI community between the mid sixties and the first seventies. During this time the so called ``heuristic search paradigm" was still influential in the AI community, and both resolution principle and certain resolution based, apparently human-like, search strategies were matched with those problem solving heuristic procedures which were representative of the AI heuristic search paradigm.
Automata, Representations, And Proofs

In this dissertation, we study automata, languages, and functions between automata which preserve the language accepted. We examine them from the perspectives of representation theory, category theory, and proof theory. A central theme is that these perspectives interact in many useful, interesting ways. Let M be a monoid in a monoidal category. We view automata as objects of a category of representations of M , equipped with a start state and an observation function. If M is a monoid in Set, this view yields a generalization of the standard notion of a deterministic automaton. In this generalization, the inputs to an automaton are elements of an arbitrary monoid. Omitting the requirement that automata have start states yields categories with final objects. These final objects can be used to minimize deterministic automata. Let K be a commutative semiring. To express nondeterminism in our framework , we must first take an algebraic detour and show that the category of K-semimodules and K-linear maps is a monoidal category. We then define K-algebras as monoids in this category. We call the corresponding automata K-linear automata. These automata are related to, but distinct from, weighted automata. A K-linear automaton with input K-algebra A defines an element of Lin(A, K). In certain cases, elements of Lin(A, K) correspond to K-linear extensions of formal power series. In the K-linear case, there is an addition defined on both the states and the inputs. Addition of states can be used to represent nondeterminism. Addition of inputs is needed to define comultiplication. Comultiplication defines a K-algebra structure on Lin(A, K). That is, comultiplication of inputs corresponds to multiplication of " languages ". If multiplication and comultiplication satisfy certain " compatibility conditions " , the input elements form a structure known as a K-bialgebra. Part of this dissertation is the development of the numerous parallels between the theory of bialgebras and the theory of automata and formal languages. These parallels demonstrate that comultiplication is a " hidden parameter " in many standard constructions involving automata and formal languages. In certain cases, a category of K-linear automata is related to a category of (generalized) deterministic automata by an adjunction. We show that the standard subset construction used to determinize automata can be generalized as a forgetful functor; determinization is essentially forgetting the K-semimodule structure on the states of a K-linear automaton. Using this adjunction, we can construct a sequence of K-linear automata …
A Reliable Web Services Selection Method for Concurrent Requests

Current methods of service selection based on quality of service (QoS) usually focus on a single service request at a time, or let the users in a waiting queue wait for Web services when the same functional Web service has more than one requests, and then choose the Web service with the best QoS for the current request according to its own needs. However, there are multiple service requests for the same functional web service at a time in practice and we cannot choose the best service for users every time because of the service’s load. This paper aims at solving the Web Services selection for concurrent requests and developing a global optimal selection method for multiple similar service requesters to optimize the system resources. It proposes the improved social cognitive (ISCO) algorithm which uses genetic algorithm for observational learning and uses deviating degree to evaluate the solution. Furthermore, to enhance the efficiency of ISCO, the elite strategy is used in ISCO algorithm. We evaluate performance of the ISCO algorithm and the selection method through simulations. The simulation results demonstrate that the ISCO is valid for optimization problems with discrete data and more effective than ACO and GA.
Pairwise error probability of space-time codes over frequency selective rician channels

We analyze the performance of space-time codes (STC) in frequency selective correlated Rician channels. An exact expression has been derived for the pairwise error probability (PEP) of space-time trellis codes over frequency selective Rician fading channel in the form of a single finite range integral. We also obtained in addition a closed form expression for the PEP when the signal matrices are drawn from special design and the performance upper and lower bounds. Keywords-Frequency selective channels; pairwise error probability(PEP); Rician channel; space-time trellis coding