Miracle-dz/UniFAR-FTUs huggingface dataset:
C++ Standard Template Library

From the Publisher: Standard Template Libraries (STL) were created to provide C++ programmers with a suite of reusable programs, or lines of code, that could be used by everyone to increase programming productivity and quality. This book is the definitive reference on C++ programming using STL, as it was written by the team that created the library. Every C++ programmer will need at least one off-the-shelf STL reference guide. Each chapter covers one STL component, and includes background, a review of the standard, using the component, implementing the component, and exercises. For C++ Software Development Managers and C++ programmers at all levels.
Extreme Programming and Embedded Software Development

Every time I do a project, it seems we don’t get the hardware until late in the project. This limits the progress the team can make. About all we can do is create speculative design documents, not exactly demonstrable hard evidence of progress. Writing software is hard. Not writing it until late in the development cycle is suicide. A team using Extreme Programming will make concrete progress in embedded software development early in the development cycle. Even prior to hardware availability. We can provide regular deliveries of executable software early in the project. We can invest a lot less in written documentation and more in the executable software. Even without the target platform, we will have a rich suite of tests demonstrating our progress.
Phase resetting as a mechanism of ERP generation: evidence from the power spectrum

A Neural Mass model is coupled with a novel method to generate realistic Phase reset ERPs. The power spectra of these synthetic ERPs are compared with the spectra of real ERPs and synthetic ERPs generated via the Additive model. Real ERP spectra show similarities with synthetic Phase reset ERPs and synthetic Additive ERPs.
Increasing Dialogue Efficiency in Case-Based Reasoning Without Loss of Solution Quality

Increasing dialogue efficiency in case-based reasoning (CBR) must be balanced against the risk of commitment to a sub-optimal solution. Focusing on incremental query elicitation in recommender systems, we examine the limitations of naive strategies such as terminating the dialogue when the similarity of any case reaches a predefined threshold. We also identify necessary and sufficient conditions for recommendation dialogues to be terminated without loss of solution quality. Finally, we evaluate a number of attribute-selection strategies in terms of dialogue efficiency given the requirement that there must be no loss of solution quality.
Comparing Listener Gaze with Predictions of an Incremental Reference Resolution Model

In situated dialogue, listeners resolve referring expressions incrementally and their gaze often attends to the described objects in the context. We have looked at how listener gaze compares to a statistical reference resolution model that works incrementally. We found that listeners gaze at referred objects even before a referring expression begins, suggesting that salience and prior information is important in reference resolution models.
Using Letters-to-the-Editor To Uncover Logical Fallacies.

When covering persuasion in the basic speech communication course, many textbooks include information on how students can detect logical fallacies in the persuasive attempts of others. It is important to provide students with a hands-on experience that will help them apply their knowledge of logical fallacies so that they can retain and better use this information. Attempts to persuade others occur consistently in the mass media. For example, in the editorial sections of newspapers, readers are not only writing to voice their opinions but also so that others may be persuaded to agree as well. Often the positions are argued illogically in the letters-to-the-editor but appear convincing to unaware readers because the writers display sincerity and passion in their writing. Letters-to-the-editor and editorials have been used successfully in analytic writing activities. This paper outlines two letters-to-the-editor activities an instructor can use to increase students' awareness of the use of logical fallacies. The paper first describes an in-class analysis activity which would follow the students' introduction to persuasive strategies, in which the instructor provides them with letters that contain logical fallacies. It then suggests a more difficult take-home exam or out-of-class assignment in which students can be asked to hunt down their own letters for analysis. (NKA) Reproductions supplied by EDRS are the best that can be made from the original document. PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIAL HAS BEEN GRANTED BY TO THE EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) 1 U.S. DEPARTMENT OF EDUCATION Office of Educational Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) This document has been reproduced as received from the person or organization originating it. Minor changes have been made to improve reproduction quality. Points of view or opinions stated in this document do not necessarily represent official OERI position. or policy.
Decision Support Database Management System Acceleration Using Vector Processor

English: This work takes a top-down approach to accelerating decision support systems (DSS) on x86-64 microprocessors using true vector ISA extensions. First, a state of art DSS database management system (DBMS) is pro led and bottlenecks are identi ed. From this, the bottlenecked functions are analysed for data-level parallelism and a discussion is given as to why the existing multimedia SIMD extensions (SSE) are not suitable for capturing this parallelism. A vector ISA is derived from what is found to be necessary in these functions; additionally, a complementary microarchitecture is proposed that draws on prior research done in vector microprocessors but is also optimised for the properties found in the pro led application. Finally, the ISA and microarchitecture are implemented and evaluated using a cycle-accurate x86-64 microarchitecture simulator.
C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond (C++ In-Depth Series)

C++ Template Metaprogramming sheds light on the most powerful idioms of today's C++, at long last delivering practical metaprogramming tools and techniques into the hands of the everyday programmer.A metaprogram is a program that generates or manipulates program code. Ever since generic programming was introduced to C++, programmers have discovered myriad "template tricks" for manipulating programs as they are compiled, effectively eliminating the barrier between program and metaprogram. While excitement among C++ experts about these capabilities has reached the community at large, their practical application remains out of reach for most programmers. This book explains what metaprogramming is and how it is best used. It provides the foundation you'll need to use the template metaprogramming effectively in your own work.This book is aimed at any programmer who is comfortable with idioms of the Standard Template Library (STL). C++ power-users will gain a new insight into their existing work and a new fluency in the domain of metaprogramming. Intermediate-level programmers who have learned a few advanced template techniques will see where these tricks fit in the big picture and will gain the conceptual foundation to use them with discipline. Programmers who have caught the scent of metaprogramming, but for whom it is still mysterious, will finally gain a clear understanding of how, when, and why it works. All readers will leave with a new tool of unprecedented power at their disposal-the Boost Metaprogramming Library.The companion CD-ROM contains all Boost C++ libraries, including the Boost Metaprogramming Library and its reference documentation, along with all of the book's sample code and extensive supplementary material.
Using Alice in a Computer Science Survey Course

Students in an introductory computer science survey course for non-majors used the 3-D interactive programming environment Alice for their programming module. With Alice, students create animated worlds using a variety of objects and easily accessed programming constructs. Alice has previously been used successfully to provide a gentle introduction to computer programming in a fun and enjoyable way, and has been shown to increase retention in computer programming courses. However, use of Alice appears to be limited as there is little to be found in the literature regarding its use in information technology courses. This lack of data prompted a study to determine if Alice is a suitable tool to introduce computer programming to non-majors in a friendly and inclusive way. This paper reports on the use of Alice with approximately 100 students enrolled in a non-majors computer science course. Students were surveyed about their attitudes toward computer programming before and after using Alice. Descriptive data indicate that Alice does increase student enjoyment and promote positive attitudes toward programming.
Book Review: A Quantitative Approach t o Software Management: The ami Handbook

The tremendous success of cellular technology has fundamentally changed the way people communicate and prompted the evolution of a new multibillion dollar wireless communications industry. Linking service areas, wireless communications has altered the way business is conducted. For instance, with a laptop computer, a PCMCIA modem and a cellular phone, a real estate agent can contact his or her office and clients, check sales listings and arrange appointments while traveling. Field service and sales people can, from customer locations, access corporate databases to check inventory status, prepare up-to-the-minute price and delivery quotes, and cut orders directly to the factory. Two-way paging services allow a firm's workforce to stay in close contact, even when traditional wired communication services are not available. Hand-held hybrids of phone-computer-fax machines feed information to wireless communication networks, allowing an executive to make decisions while watching a little league baseball game.
Direct-drive robots

• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
On testing effectiveness of metamorphic relations

Software testing is a very crucial approach for assuring the quality of the software applications. In this century, software is in use in every sphere of life. Hence, it is very essential to guarantee the correctness of the software functionality to a certain degree. Absence of proper methods to assure the correctness of the software can lead to disasters. Many testing methods have been proposed to select test inputs such that faults in the program can be detected effectively. However, several programs are non-testable due to the so-called “oracle problem”. The oracle problem means that either there does not exist a mechanism (called “oracle”) to verify the test output given any possible program input, or it is very expensive, if not impossible, to apply the oracle. Detecting faults in a program without the oracle is one of the major challenges of software testing. Metamorphic testing is an innovative approach to alleviating the oracle problem. In metamorphic testing, metamorphic relations are derived from the necessary characteristics of the system under test. These relations can help to generate test inputs and verify the correctness of the test outputs without the need of an oracle. Their effectiveness has a significant role in metamorphic testing. Hence, it is important to select effective metamorphic relations in metamorphic testing. Different metamorphic relations can generate test inputs with different code coverage. Thus, code coverage of generated test inputs can be considered as a characteristic of the corresponding metamorphic relation. This study aims to find out whether the fault-detection effectiveness of a metamorphic relation can be determined by its code coverage. Some case studies have been conducted to analyze the relationship between the code coverage and the fault-detection effectiveness of metamorphic relations. The systems for these studies were selected from different domains that require diverse ranges of metamorphic relations being derived. Moreover, efforts have been given to conduct the research in a platform independent way by choosing the systems from different platforms. Automated mutant generator tools have been used to generate mutants (faulty versions of the system under test) for ensuring non-biased mutants in the experiments. Fault-detection effectiveness of metamorphic relations is calculated by applying metamorphic testing on these mutants. Two basic coverage criteria namely line and branch coverage is taken into considerations. Automated code coverage tools are used to collect coverage data achieved by different metamorphic relations. A certain degree of correlation between the code coverage and fault-detection effectiveness of a metamorphic relation was observed. Code coverage attained by metamorphic relations was found to be a good indicator of the fault-detection effectiveness of these relations. Thus, the selection of metamorphic relations with higher code coverage can help metamorphic testing to become more efficient.
A Compact Syntax for XML Schema

The XML Schema language offers a variety of useful features to the XML schema designer. But due to its XML syntax and its inherent complexity, XML Schemas are difficult to read and understand. To reduce XML Schema’s syntactical verboseness and complexity, a new syntax has been defined, the XML Schema Compact Syntax (XSCS). The compact syntax is designed for the human user, by reusing wellknown programming and schema language concepts. It reduces schema size about 60%. A parser for the compact syntax has been implemented to allow conversion from compact syntax to XML Schema and back. Zürich, 18. March 2003
Hardware acceleration of network intrusion detection and prevention

Network Intrusion Detection and Prevention Systems (NIDPS) are important elements of network security. Their role is to monitor internet traffic for malicious content and, on detection, generate an alert message and/or block the offending traffic. Potential attacks are described in a database of rules known as the rule set, where each rule consists of an IP header part and a payload signature part. The payload signature can be in the form of a fixed string and/or regular expression. This thesis studies the three main stages of these systems, namely TCP/IP reassembly, multi-match header matching and Deep Packet Inspection (DPI). TCP/IP reassembly is a necessary prerequisite to DPI as attack patterns may span more than one IP fragment or TCP segment. Either target-based reassembly or traffic normalisation is required in order to overcome insertion/evasion attacks. This thesis builds upon existing research by outlining an FPGA-based architecture that handles the common case of reassembling in-sequence data streams in hardware and the much rarer out-of-sequence data streams in software. Multi-match header matching involves the matching of each packet header against the header section of all rules. This differs from the single-match classification used in routers where there is a single highest priority match per packet. The strategy adopted in this thesis was to adapt a number of single match algorithms to perform multi-matching and to compare their performance with existing solutions. Existing solutions typically involve the use of Ternary Content Addressable Memory (TCAM) and therefore suffer from disadvantages such as high cost, high energy consumption, and low storage efficiency. Algorithmic solutions, which use SRAM instead of TCAM, can therefore have an advantage. The adapted algorithms were implemented in C code and evaluated in terms of speed and energy efficiency on an ARM processor. DPI is particularly challenging due to the number and complexity of regular expressions. This thesis builds on existing research into Bit-Parallel hardware architectures. The main contribution is an extension for the efficient handling of the constrained {min,max} repetition syntax, including a solution to the issue of counter overlap. This allows for the handling of many additional regular expressions that would otherwise be unsuitable. The design was implemented in VHDL and evaluated using the Xilinx tool set. A comprehensive review of the most significant research works in the DPI field is also provided.
Distributed Data Mining in Desktop Grids

Several kinds of scientific and commercial applications req uire the execution of a large number of independent tasks. One highly successful and low cost mechanism for acquiring the necessary compute power for these applications is the “public-resource computing”, or “desktop Grid” paradigm, which exploits the computational power of private computers. So far, this paradigm has not been applied to data mining applications for two main reasons. First, it is not trivial to decompose a data mining algorithm into tr uly independent sub-tasks. Second, the large volume of data involved makes it difficult to handle the communication costs of a parallel paradigm. In this paper, we focus on one of the main data mining problem: the extraction of closed frequent itemsets from transactional databases. We show that is possible to decompose this problem into independent tasks, which however need to share a large volume of data. We thus introduce a data-intensive computing network , which adopts a P2P topology based on super peers with caching capabilities, aiming to support the dissemination of large amounts of information. Finally, we evaluate the execution of our data mining job on such network.
A Preconditioned L-BFGS Algorithm with Application to Molecular Energy Minimization

Abstract : The limited-memory BFGS method has been widely used in large scale unconstrained optimization problems, such as the protein structure prediction problem. A major weakness of the L-BFGS method is that it may converge very slowly for ill-conditioned problems. We propose a preconditioned L-BFGS method, where we form the preconditioner from parts of the partially separable objective function. We report results of experiments in the context of the protein structure prediction problem for four different proteins, using a protein energy model as the objective function and multiple initial configurations for each protein. The results show speed-ups with factors between 3 and 10 in terms of function evaluations and with factors between 2 and 7 in terms of CPU time. The difference between CPU time and function evaluation speed-up is due to the extra overhead of calculating and applying the preconditioner. We also compare the performance of this method to the preconditioned truncated Newton method.
Analysis, Structure and Organization of Complex Networks

Network science has emerged as a fundamental eld of study to model many physical and real world systems around us. The discovery of small world and scale free properties of these real world networks has revolutionized the way we study, analyze, model and process these networks. In this thesis, we are interested in the study of networks having these properties often termed as complex networks. In our opinion, research conducted in this eld can be grouped into four categories, Analysis, Structure, Processes-Organization and Visualization. We address problems pertaining to each of these categories throughout this thesis. The initial chapters present an introduction and the necessary background knowledge required for readers. Chapters (3, 4, 5, 6, 7) all introduce a specic problem leading up to its solution. In Chapter 3, we present a visual analytics method to analyze complex networks. Based on this method, we also introduce a new metric to calculate the presence of densely connected vertices in networks. Chapter 4 deals with models to generate arti- cial networks having small world and scale free properties. We propose a new model to generate networks with these properties along with the presence of community structures. Extending from the results of our analysis in Chapter 3, we introduce a fast agglomerative clustering algorithm in Chapter 5. In Chapter 6, we address the issue of visualizing these complex networks through a system which combines simplication, clustering and dedicated layout algorithms. Finally we address the issue of evaluating the quality of clusters for complex networks that do not have densely connected vertices in Chapter 7. Each chapter is followed by a mini-conclusion and further research prospects. In the end, we summarize our results and conclude the thesis by presenting some research directions based on our ndings.
Using Mathematics Curriculum Based Measurement as an Indicator of Student Performance on State Standards.

Using Mathematics Curriculum Based Measurement as an Indicator of Student Performance on State Standards. (December 2009) Linda De Zell Hall, B.B.A., Texas Tech University; M.Ed., Texas A&M University Chair of Advisory Committee: Dr. Richard Parker Math skills are essential to daily life, impacting a person’s ability to function at home, work, and in the community. Although reading has been the focus in recent years, many students struggle in math. The inability to master math calculation and problem solving has contributed to the rising incidence of student failure, referrals for special education evaluations, and dropout rates. Studies have shown that curriculum based measurement (CBM) is a well-established tool for formative assessment, and could potentially be used for other purposes such as a prediction of state standards test scores, however to date there are limited validity studies between mathematics CBM and standard-based assessment. This research examined a brief assessment that reported to be aligned to national curriculum standards in order to predict student performance on state standards-based mathematics curriculum, identify students at-risk of failure, and plan instruction. Evidence was gathered on the System to Enhance Educational Performance Grade 3 Focal Mathematics Assessment Instrument (STEEP3M) as a formative, universal screener. Using a sample of 337 students and 22 instructional staff, four qualities of the STEEP3M were examined: a) internal consistency and criterion related validity (concurrent); b) screening students for a multi-tiered decision-making process; c) utility for instructional planning and intervention recommendations; and d) efficiency of administration, scoring, and reporting results which were the basis of the four research questions for this study. Several optimized solutions were generated from Receiver Operator Curve (ROC) statistical analysis; however none demonstrated that the STEEP3M maximized either sensitivity or specificity. In semi-structured interviews