Miracle-dz/UniFAR-FTUs huggingface dataset:
Introduction to Pattern Recognition: A Matlab Approach

An accompanying manual to Theodoridis/Koutroumbas, Pattern Recognition, that includes Matlab code of the most common methods and algorithms in the book, together with a descriptive summary and solved examples, and including real-life data sets in imaging and audio recognition. *Matlab code and descriptive summary of the most common methods and algorithms in Theodoridis/Koutroumbas, Pattern Recognition 4e. *Solved examples in Matlab, including real-life data sets in imaging and audio recognition*Available separately or at a special package price with the main text (ISBN for package: 978-0-12-374491-3
Skipping Streams with XHints

Information digest of text node 7. <price> 20 </price> 8. <author> Yates </author> 9. <pub> 10. <Hint desc="0" end="128" name="2−Add" address="23−34"/> 11. <name> Addison Wesely </name> 12. <address> 13. 34 Broadway, N.Y. U.S.A 14. </address> 15. </pub> 16. </book> 17. <book> 6. <title> Modern Information Retreival </title> 1. <root> 2. <META LIndex="book 1 pub 7 name 5 . " Hash="price−20 60"> 3. <Hint desc="511" end= ̈968" book="2"> 4. <book> 5. <Hint desc="345" end="373" next="379" title="2−Mod" price="134−0" pub="204" author="314−Yat"/>
Enhancing Music Recommendation Algorithms Using Cultural Metadata

In today's online commercial music marketplaces, a common requirement is to generate lists of artists that are “similar” to a given chosen artist. However, this is by no means a trivial task. A recent trend has been to tackle this challenge using sociocultural connotations rather than the traditional content-based audio or lyrics analysis. This article describes an enhancement to this approach that relies on the acquisition, filtering and condensing of unstructured, text-based information that can be found on the World Wide Web to recognize what the music community regards as “similar” artists. The beauty of this approach lies in its ability to access so-called “cultural metadata” (i.e., textual data about musical content) which is the aggregation of several independent – originally subjective – perspectives about a piece of music. The major focus of this work is the evaluation and enhancement of existing approaches in this area using filtering methods to increase their precision. A meaningful evaluation of the results is provided by a comparison with ground truth data.
Illustration Of A Beam-Hardening Correction Method In Computerized Tomography

A previously proposed method for beam hardening correction is illustrated using a mathematically described phantom based on an actual reconstructed cross-section of a human head. The method consists of a combination of polynomial correction of the polyenergetic data and an iterative estimation of the monoenergetic data based on previous reconstructions The quality of reconstructions is found to be similar to those which can be obtained from monoenergetic data.
New switched-capacitor DC-DC converter with low input current ripple and its hybridization

A switched-capacitor (SC) DC-DC converter is developed to reduce the input current ripple and to achieve miniaturization. A fixed-capacitor added to an original SC reduces the input current ripple. This converter is miniaturized by a copper thick-film hybrid technique. The features of this converter are as follows: (1) low input current ripple (one third compared with that of original SC DC-DC converters), (2) very high efficiency (90%), and (3) very high power density (23 W/in/sup 3/ in the 10 W class). <<ETX>>
The Use of Lawson's Test of Formal Reasoning in the Israeli Science Education Context.

Lawson's test of formal reasoning was used in the Israeli educational context in order to investigate the relationship between students' achievement in science and in mathematics, to compare the performance of boys and girls, and to compare the performance of Israeli and U.S. populations. It was found that, in general, boys outperform girls; there is only a small correlation between achievement in science and math and Lawson test; and that the Israeli population achieved significantly higher than the U.S. population on the Piagetian skills measured by the test: It was concluded that the future use of Lawson's test by the high school teacher is doubtful.
Multi-criterion decision making by artificial intelligence techniques

Decision making for complex systems is based on multi-criterion-optimization. A decision making support can be applied to find the Pareto solutions. Multi-criterion tabu programming is a new paradigm for that task. Similarly to rules applied in the genetic programming, tabu programming solves problems by using a tabu algorithm that modifies some computer programs. We consider the multi-criterion problem of task assignment, where both a workload of a bottleneck computer and the cost of system are minimized; in contrast, a reliability of the distributed system is maximized. Furthermore, there are constraints for the performance of the distributed systems and the probability that all tasks meet their deadlines. What is more, constraints related to memory limits and computer locations are imposed on the feasible task assignment.
Development Of A Heuristic Path Propagating Algorithm And Its Application

This paper presents a novel heuristic optimization technique called heuristic path propagating algorithm, in which the search procedure is based on the path extending mode determined by the path evaluation function and the constraint deviation vector, as against most of the well-known best-first heuristic algorithms, such as A*, AG*, where the search procedures are usually propagated on the individual node basis according to the node heuristic function h(n). The designing procedures of the proposed algorithm including discretization of the parameter space, partitioning of the control situations, computing the path evaluation function and the constraint deviation vector, construction of the heuristic rule base, etc., are discussed.
Applied Time Series Econometrics: The Software JMu⌉Ti

Introduction to JMu⌉Ti Software Concept This chapter gives a general overview of the software by which the examples in this book can be reproduced; it is freely available via the Internet. The information given here covers general issues and concepts of JMu⌉Ti . Detailed descriptions on how to use certain methods in the program are left to the help system installed with the software. JMu⌉Ti is an interactive JAVA application designed for the specific needs of time series analysis. It does not compute the results of the statistical calculations itself but delegates this part to a computational engine via a communications layer. The range of its own computing functions is limited and is only meant to support data transformations to provide input for the various statistical routines. Like other software packages, JMu⌉Ti contains graphical user interface (GUI) components that simplify tasks common to empirical analysis – especially reading in data, transforming variables, creating new variables, editing data, and saving data sets. Most of its functions are accessible by simple mouse interaction. Originally the software was designed as an easy-to-use GUI for complex and difficult-to-use econometric procedures written in GAUSS that were not available in other packages. Because this concept has proved to be quite fruitful, JMu⌉Ti has now evolved into a comprehensive modeling environment for multiple time series analysis. The underlying general functionality has been bundled in the software framework JStatCom , which is designed as a ready-made platform for the creation of various statistical applications by developers.
%HPGLIMMIX: A High-Performance SAS Macro for GLMM Estimation

Generalized linear mixed models (GLMMs) comprise a class of widely used statistical tools for data analysis with fixed and random effects when the response variable has a conditional distribution in the exponential family. GLMM analysis also has a close relationship with actuarial credibility theory. While readily available programs such as the GLIMMIX procedure in SAS and the lme4 package in R are powerful tools for using this class of models, these progarms are not able to handle models with thousands of levels of fixed and random effects. By using sparse-matrix and other high performance techniques, procedures such as HPMIXED in SAS can easily fit models with thousands of factor levels, but only for normally distributed response variables. In this paper, we present the %HPGLIMMIX SAS macro that fits GLMMs with large number of sparsely populated design matrices using the doubly-iterative linearization (pseudo-likelihood) method, in which the sparse-matrix-based HPMIXED is used for the inner iterations with the pseudo-variable constructed from the inverse-link function and the chosen model. Although the macro does not have the full functionality of the GLIMMIX procedure, time and memory savings can be large with the new macro. In applications in which design matrices contain many zeros and there are hundreds or thousands of factor levels, models can be fitted without exhausting computer memory, and 90% or better reduction in running time can be observed. Examples with a Poisson, binomial, and gamma conditional distribution are presented to demonstrate the usage and efficiency of this macro.
The Trust Factor in Online Instructor-LedCollege Courses

Imagine an invisible “social glue” that enables strangers to coalesce and cooperate in an online distance learning course. It makes learning (which involves risk-taking) possible. It encourages people to share about their backgrounds, expertise, resources, and social connections. It often is assumed to be present, unless it is broken. It is only then that people often even consider it. When broken, it’s very hard to mend. This elusive element is foundational to much of human endeavor. It has a cultural angle, based on different societies, peoples, values, and times. It is so necessary that some computer scientists are considering a total rebuild of the Internet (known as the “clean slate” movement) in order to better accommodate it. While this factor has been studied in depth in a number of fields, no widely accepted definition has been accepted cross-field or even in-field. This mysterious substance is trust. In eLearning, this is virtual trust. The uses of distance technologies and scenarios around eLearning make trust that much more elusive. Indeed, interchanges between instructors and learners have to pass a mutual two-way pseudo-”Turing Test,” a test which originally was set up to see if computing machines could sound human (emulate humanity)—but which may be used to see if humans have retained their humanity in their online exchanges. Indeed, surprising findings emerged from a recent study of instructor-led online learning that was conducted through WashingtonOnline (WAOL). WAOL is a consortium of 34 community and technical colleges in Washington State. The courses here are known as “high-tech / high touch” ones which mix the eLearning technologies with plenty of instructor engagement. The learners are freshman and sophomore students from around the world. Twenty-eight full college degrees may be earned solely online, and numerous other certificates and programs may be experienced. A recent study on the role of trust in eLearning used the Online Trust Student Survey (OTSS) instrument, which went through rigorous development and validity testing measures (Hai-Jew, Operationalizing Trust., Fall 2006, pp. 16 – 30). The purpose of the research was to find answers to the following five research questions: 1. How is trust manifested in an online instructor-led classroom? 2. What does a high-trust online learning classroom and community look like? 3. What factors contribute to “trust” or “mistrust,” and how are these elements related? 4. Is there a relationship between high-trust and the effectiveness of student online learning (as measured by the proxies of student retention/persistence, course grades, and student perceptions)? 5. How can trust as an asset be protected and leveraged in a virtual learning environment?
Entropy and the Consistent Estimation of Joint Distributions

The kth-orderjoint distribution for an ergodic finite-alphabet process can be estimated from a sample path of length n by sliding a window of length k along the sample path and counting frequencies of k-blocks. In this paper the problem of consistent estimation when k = k(n) grows as a function of n is addressed. It is shown that the variational distance between the true k(n)-block distribution and the empirical k(n)-block distribution goes to 0 almost surely for the class of weak Bernoulli processes, provided k(n) < (log n)/(H + E), where H is the entropy of the process. The weak Bernoulli class includes the i.i. d. processes, the aperiodic Markov chains and functions thereof and the aperiodic renewal processes. A similar result is also shown to hold for functions of irreducible Markov chains. This work sharpens prior results obtained for more general classes of processes by Ornstein and Weiss and by Ornstein and Shields, which used the d-distance rather than the variational distance.
A New Adaptive and Intelligent Traffic Shaper for High Speed Networks

In this paper, the advantage of reinforcement learning to develop a new traffic shaper is invoked in order to obtain a reasonable utilization of bandwidth while preventing traffic overload in other parts of the network. This leads to a reduction in the total number of packet droppings in the whole network. The method is implemented in a novel proposed intelligent simulation environment. Keeping dropping probability low while injecting as many packets as possible into the network, in order to utilize the available bandwidth, shows satisfactory behavior in simulation environment. On the other hand, the results show that the system can perform well even in situations that have not been previously introduced to the system.
Formal Verification Of A Shopping Basket Application Model Using PRISM

Formal verification is at the heart of model validation and correctness. With model checking, invaluable realizations have been accomplished in software engineering and particularly in software development. By means of this approach, complex applications can be simulated and their performance forecasted in light with requirements at hands and expected performance. In this short paper we present the results of a simulation using Prism Model Checker for a Shopping Basket Application Model. Applied on a modified model from a projected process model, the objective is to simulate the behavior of shoppers as they go through a number of defined states of the shopping process and express accessibility and reachability through a number of defined properties
Emergence of profitable search strategies based on a simple inheritance mechanism

In this paper we show how a simple inheritance mechanism is capable of learning the best local search to use at different stages of the search. In our work an individual is composed by its genetic material and its memetic material. The memetic material specifies the strategy the individual will use to do local search in the vicinity of the solution encoded in its genetic part. A simple vertical inheritance mechanism is enough to provide a robust adaptation of behavior. This result s-pans from a simple OneMax problem, to NK-landscapes and the TSP.
Enhancement of Selective Siphon Control Method for Deadlock Prevention in FMSs

One novel control policy named selective siphon control policy is proposed to solve for deadlock problems of flexible manufacturing systems (FMSs). The new policy not only solves the deadlock problem successfully but also obtains maximally permissive controllers. According to our awareness, the policy is the first one to achieve the goal of obtaining maximally permissive controllers for all S3PR (one system of simple sequential processes with resources, S3PR) models in existing literature. However, one main problem is still needed to solve in their algorithm. The problem is that the proposed policy cannot check the exact number of maximally permissive states of a deadlock net in advance. After all iterating steps, the final maximally permissive states can then be known. Additionally, all legal markings are still to be checked again and again until all critical markings vanished. In this paper, one computationally improved methodology is proposed to solve the two problems. According to the experimental results, the computational efficiency can be enhanced based on the proposed methodology in this paper.
The Compact Disc: A Handbook of Theory and Use

Introduction to the compact disc: analog vs. digital LP vs. CD origins of the compact disc. Part 2 Fundamental of digital audio: sampling aliasing quantization dither pulse code modulation the digitization system. Part 3 The compact disc system: system overview optical storage error correction cross interleave reed-soloman code data encoding data decoding. Part 4 CD player design: player overview pickup design digital-to-analog converter analog filtering digital filtering a chip set subcode serial transmission format. Part 5 Practical concerns: design considerations specifications buyuing a player player notes disc notes. Part 6 Diverse disc formats: CD-ROM CD-I DVI CD-V CD-WO erasable CDs CD + G CD3. Part 7 Disc manufacturing: pre-mastering disc mastering electroforming injection molding metallization and spin coding quality control alternative replication.
Measuring Translation Quality by Testing English Speakers with a New Defense Language Proficiency Test for Arabic

Abstract : We present results from an experiment in which educated English-native speakers answered questions from a machine translated version of a standardized Arabic language test. We compare the machine translation (MT) results with professional reference translations as a baseline for the purpose of determining the level of Arabic reading comprehension that current machine translation technology enables an English speaker to achieve. Furthermore, we explore the relationship between the current, broadly accepted automatic measures of performance for machine translation and the Defense Language Proficiency Test, a broadly accepted measure of effectiveness for evaluating foreign language proficiency. In doing so, we intend to help translate MT system performance into terms that are meaningful for satisfying Government foreign language processing requirements. The results of this experiment suggest that machine translation may enable Interagency Language Roundtable Level 2 performance, but is not yet adequate to achieve ILR Level 3. Our results are based on 69 human subjects reading 68 documents and answering 173 questions, giving a total of 4,692 timed document trials and 7,950 question trials. We propose Level 3 as a reasonable near-term target for machine translation research and development.
Python Standard Library

From the Publisher: Python Standard Library is an essential guide for serious Python programmers. Python is a modular language that imports most useful operations from the standard library (basic support modules; operating system interfaces; network protocols; file formats; data conversions; threads and processes; and data storage). You can't really program in Python without using it. In this book, author Fredrik Lundh, creator of the Python Imaging Library (PIL), delivers tested, accurate documentation of all the modules in the Python Standard Library, along with over 300 annotated example scripts using the modules. Python Standard Library renders this valuable information in a clean, easy-to-read format, yet doesn't talk down to readers. This accurate and complete reference documentation is for the Python programmer who wants the facts and little else. The book is based on the author's work with the Python newsgroup: he reviewed more than 2500 questions and answers to that newsgroup in order to make sure the book covered what Python users really wanted to know. An earlier version of this book has been available electronically for over a year, so the material has been tested by Python programmers in real-life applications. This version of Python Standard Library covers all the new modules and related information for Python 2.0, the first new major release of Python in four years.
Improving Virtual Appliances through Virtual Layered File Systems

The problem of managing computers is growing in complexity due to the increasing amount of physical and virtual computers that one has to administer as well as the varying roles that those computers fill. As each machine is effectively fully independent, the amount of work an administrator does scales linearly with the amount of machines. In order to solve this problem, we introduce Strata, a system that enables new ways of managing these many distinct installations. Strata enables many systems to be easily managed by introducing a virtual layered file system that composes individual software layers together into a single file system view. By providing the ability to share layers between installations, Strata eases the creation of independent systems and opens up new ways to use computers. We have implemented Strata on Linux without requiring any application or operating system kernel changes. Our measurements on real world applications demonstrate that Strata imposes little overhead.
Homogeneous and Heterogeneous Traffic of Data Packets on Complex Networks: The Traffic Congestion Phenomenon

We study the congestion phenomenon in a mathematical model of the data packets traffic in transmission networks as a function of the topology and of the load of the network. Two types of traffic are considered: homogeneous and heterogeneous traffic. The congestion phenomenon is studied in stationary conditions through the behaviour of two quantities: the mean travel time of a packet and the mean number of packets that have not reached their destination and are traveling in the network. We define a transformation that maps a network having the small world property (Inet 3037 in our numerical experiments) into a (modified) lattice network that has the same number of nodes. This map changes the capacity of the branches of the graphs representing the networks and can be regarded as an “interpolation” between the two classes of networks. Using this transformation we compare the behaviour of Inet 3037 to the behaviour of a modified rectangular lattice and we study the behaviour of the interpolating networks. This study suggests how to change the network topology and the branch capacities in order to alleviate the congestion phenomenon. In the website: http://www.ceri. uniroma1.it/ceri/zirilli/w6 some auxiliary material including animations and stereo? graphic scenes that helps the understanding of this paper is shown.
Dynamic Data Migration in Hybrid Main Memories for In‐Memory Big Data Storage

For memory‐based big data storage, using hybrid memories consisting of both dynamic random‐access memory (DRAM) and non‐volatile random‐access memories (NVRAMs) is a promising approach. DRAM supports low access time but consumes much energy, whereas NVRAMs have high access time but do not need energy to retain data. In this paper, we propose a new data migration method that can dynamically move data pages into the most appropriate memories to exploit their strengths and alleviate their weaknesses. We predict the access frequency values of the data pages and then measure comprehensively the gains and costs of each placement choice based on these predicted values. Next, we compute the potential benefits of all choices for each candidate page to make page migration decisions. Extensive experiments show that our method improves over the existing ones the access response time by as much as a factor of four, with similar rates of energy consumption.