Miracle-dz/UniFAR-FTUs huggingface dataset:
Introductory Problem Solving in Computer Science

This paper describes our experiences in devising a lightweight, informal methodology for problem solving in introductory, university level, computer science. We first describe the original context of the experiment and the background to the methodology. We then give the details of the steps of the Problem Solving Cycle - Understanding, Designing, Writing and Reviewing - and the lessons we learned about our teaching from devising the material. We also present practical examples of how it has been applied in a variety of units in our programme.
Proceedings of the 2nd Temporal Web Analytics Workshop

In this paper we give an overview on the 2nd Temporal Web Analytics Workshop (TempWeb). The goal of TempWeb is to provide a venue for researchers of all domains (IE/IR, Web mining etc.) where the temporal dimension opens up an entirely new range of challenges and possibilities. The workshop's ambition is to help shaping a community of interest on the research challenges and possibilities resulting from the introduction of the time dimension in Web analysis. Having a dedicated workshop will help, we believe, to take a rich and cross-domain approach to this new research challenge with a strong focus on the temporal dimension. For the second time, TempWeb has been organized in conjunction with the International World Wide Web (WWW) conference. Hence, this year, TempWeb was held on April 17, 2012 in Lyon, France.
NoMadCar: The Interactive Design using Human Computer Interaction Techniques

Human Computer Interaction (HCI) is playing a vital role in the design of several interfaces such as computer softwares, games, virtual reality and car steerings. In today’s world people want to use mobile devices while deriving that may result an accident due to the loss of attention. Therefore, this paper presents the design that is used to ﬁnd the ways how a user interface in the car can improve the driver’s safety when using mobile devices such as phones and mp3 players while driving. The paper concentrates on two elements that contribute to that goal. The ﬁrst one is the development of a user interface that enables the driver to control all the needed functions of mobile devices from the car’s controls without actually having to touch the device itself. The second is the utilization of automatic driving assistance systems that aﬀect the driving behavior of the car.
Specific Demands Of The Effort On The Pommel Horse In Artistic Gymnastics

An important element in the preparation plan of high performance gymnasts is the training of the specific effort endurance. The planning of such activities is done considering the effort stress involved in the difficulty and complexity of each full exercise and the individual adaptive particularities, corresponding to each preparation stage. Developing an optimal preparation scheme means measuring all physiological parameters which can offer an objective description of the intensity and energetic costs involved by the specific competition exercise. In this context, we performed a study with the participation of six high performance gymnasts aged between 24 and 27. The aim of this study was to measure the level of individual metabolic and cardiorespiratory stress induced by the specific effort during a full exercise on pommel horse. The measured parameters were heart rate and the lactic acid concentration in the capillary blood network, afterwards correlated to the volume and difficulty level of the full exercise of each gymnast. In this study, subjects have a different level of value in exercises that they present on the pommel horse apparatus. This procedure was the first stage in developing the methodology of the individual training programme, with the purpose of increasing specific endurance for the pommel horse event. © 2019 Published by Future Academy www.FutureAcademy. org.UK
Sistema de Navegacion de Robots Moviles en Entornos Industriales

En este artı́culo se presenta una aplicación para la navegación de robots móviles en entornos industriales. Por un lado, se ha desarrollado la localización y construcción del mapa del entorno basándose en técnicas multifrecuenciales de fusión sensorial (SLAM utilizando EKF). Por otro lado, se ha implentado la planificación de movimientos mediante la técnica de campos potenciales artificiales. La resolución del problema de mı́nimos locales se ha llevado a cabo mediante el método de las cargas ficticias. Esta aplicación se engloba en un proyecto más general para la automatización de la gestión y el transporte en almacenes.
Robust Selective Sampling from Single and Multiple Teachers.

We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of our algorithm and on the number of labels it queries when faced with an adaptive adversarial strategy of generating the instances. Our bounds both generalize and strictly improve over previous bounds in similar settings. Using a simple online-to-batch conversion technique, our selective sampling algorithm can be converted into a statistical (pool-based) active learning algorithm. We extend our algorithm and analysis to the multiple-teacher setting, where the algorithm can choose which subset of teachers to query for each label.
GNU Emacs Lisp Reference Manual

This is a high-quality, hardbound edition of the official GNU Emacs Lisp Reference Manual, from the current Emacs Version 24.5 distribution. It is printed on acid free and lignin free paper, that meets all ANSI standards for archival quality paper. *** The GNU Emacs Lisp Reference Manual is also available for free within GNU Emacs itself, via the help system, or online. Professional users may find this hardbound edition convenient for frequent consultation, and an excellent copy for desktop reference. *** For each copy of this manual sold, 10% of its gross sale revenue is donated to the Free Software Foundation (FSF).
Towards a Functional Interface for Temporal Navigation of News Archives

News producers in the digital era have adopted web standards like XML for representing news stories in datastores. News stories are very time-sensitive information. When this information is archived over time, it could be analyzed to elicit trends and gauge the level of interest in particular topics. A novel way of visualizing this data would make such large datasets more approachable for the general public, and thus make it possible for publishers to extract additional value out of the available news stories. A user interface that helps the user navigate through the large document cor- pus would improve users’ perception of the value of the news content, and ensure continued consumption of this content. There were two aspects to building the right user interface - the usability of the interface itself, and the appropriateness of the vi- sual metaphor used to visualize the data. This thesis adopts an iterative approach to building the most usable interface to achieve this goal. Starting with an initial design based on study of the system and literature in the ? eld, design iterations were carried out, with a usability testing phase at the end of each iteration. The resulting interface provides a simple way to navigate news article archives in terms of concepts like peo- ple, places and organizations. It also allows users to visualize trends in news coverage for a particular concept over time.
Multipath Routing, Congestion Control and Load Balancing

Combining transport-layer congestion control with multi-path routing is a cross-layer approach that provides performance benefits over treating the layers separately. We phrase this as an optimisation problem, examine the case of data transfers, and show how a coordinated controller gives strictly better performance than an uncoordinated controller, which sets up parallel paths. For fixed demands, and the case of random-path selection, we show how coordinated control also achieves better load balancing than greedy least-loaded path selection. We then comment on adaptive path selection.
Using the Keystroke-Level Model to Estimate Execution Times

The Keystroke-Level Model (KLM), proposed by Card, Moran, & Newell (1983), predicts task execution time from a specified design and specific task scenario. Basically, you list the sequence of keystroke-level actions the user must perform to accomplish a task, and then add up the times required by the actions. It is not necessary to have an implemented or mocked-up design; the KLM requires only that the user interface be specified in enough detail to dictate the sequence of actions required to perform the tasks of interest.
The evolution of malicious IRC bots

5 Background. 5 PrettyPark crawls from the sea. 6 Global Threat bots. 6 Open sesame. Backdoor.IRC. Aladinz. 7 Sdbot develops opposable thumbs.9 Agobot stands upright.13 Crackdown.18 Sdbots big brother.19 Port scanning. 20 733+ bot Selection.21 P2P user deception.23 Keylogging.23 Clipboard monitoring.25 Grabbing Cached Passwords.25 Screenshot Capture.25 Instant Messenger spam. 26 Packet Sniffing.26 Process killing. 27 3 The Evolution of Malicious IRC Bots White Paper: Symantec Security Response
The design structure analysis system: a tool to analyze software architecture

This thesis develops and validates a tool called the Design Structure Analysis System (DSAS) to analyze software architecture. DSAS extracts function call dependencies and uses Design Structure Matrix (DSM) techniques to display relationships among design elements and calculate measures of design structure for pre-existing designs. The specialized algorithms in DSAS allow the tool to process very large code bases, as compared to prior work which has adopted DSM techniques. The tool comprises four main modules. The architectural view module maps the design structure as the designer defined it. The bus detection module finds and marks system wide shared portions of functionality. The change cost module displays and measures the potential for a change to propagate through the system. Finally, the dependency clustering module heuristically arranges the software dependencies into an idealized form that has limited interactions among different modules. We validate the tool via three methods: (1) comparing the tool's output to existing literature that analyzes theoretical and practical examples of modularity, (2) analyzing code of familiar systems, and (3) analyzing longitudinal code re-designs where we are aware of the architect's intent. Subsequently, we use the tool to examine the hypothesis that distributed teams may produce more modular code than co-located teams. We find data to support this hypothesis by comparing open source systems (assumed to represent distributed teams) to proxies for closed source systems (assumed to represent co-located teams). We conclude by highlighting the contributions of this work, and pointing to future applications that may prove fruitful.
Unfold/fold program transformations

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Unfold/fold program transformations Laurent Kott
Evolution Of Artificial Neural Networks Grounded In Virtual Ecosystems

An argument is presented for the utility of investigations of arti cial neural systems, embedded in a virtual environment, undergoing simulations of evolution. Models of the nervous system, evolution via natural selection, the organism, and the ecosystem are combined and simulated via computer. The design and implementation of such a simulation is treated at length. Further research is proposed. vii Chapter
Practical Program Understanding with Type Inference.

Abstract : Many questions that arise in the reverse engineering or restructuring of a program can be answered by determining, statically, where the structure of the program requires sets of variables to share a common representation. With this information we can find abstract data types, detect abstraction violations, identify unused variables, functions, and fields of data structures, detect simple errors of operations on abstract datatypes (such as failure to close after open), and locate sites of possible references to a value. We have a method for computing representation sharing by using types to encode representations. We use polymorphic type inference to compute new types for all variables, eliminating cases of incidental type sharing where the variables might have different representations. The method is fully automatic and smoothly integrates pointer aliasing and higher-order functions. Because it is fully modular and computationally inexpensive, it should scale to very large systems. We show how we used of a prototype tool to analyze Morphin, a 17,000 line robot control program written in C, answering a user's questions about program structure, detecting abstraction violations, and finding unused data structures and memory leaks.
POLÍTICAS PÚBLICAS E TECNOLOGIAS DIGITAIS: UM CELULAR POR ALUNO PUBLIC POLICIES AND DIGITAL TECHNOLOGIES: A SMARTPHONE PER STUDENT

Este artigo tem por objetivo fomentar discussoes sobre a utilizacao dos celulares inteligentes ( smartphones ) nas salas de aula. A partir de uma sintese das politicas publicas voltadas para a insercao das Tecnologias Digitais nas escolas brasileiras, questionamos a viabilidade dos laboratorios de informatica a partir de projetos como Educom, Proinfo, Proninfe e Acessa Escola. O projeto Um Computador por Aluno (UCA) tambem e discutido, assim como os indices de utilizacao de telefones celulares e internet pelos brasileiros, principalmente no que diz respeito aos estudantes das escolas publicas e privadas. A partir dessas questoes, propomos o Projeto Um Celular por Aluno, como forma de incorporar os celulares inteligentes com internet as nossas salas de aula. Palavras-chave: Educacao Matematica; Sala de aula; Internet. Abstract This article aims to foster discussions on the use of smartphones in classrooms. It develops a discussion of public policies about the inclusion of Digital Technologies in Brazilian schools, in which we pose questions about the viability of computer labs from projects as Educom, Proinfo, Proninfe and Acessa Escola. The project One Computer per Student is also discussed, as well as the rates of use of mobile phones and the Internet by Brazilians, especially regarding students from public and private schools. From these issues, we sketch a project One Cellphone per Student, as a way to incorporate smartphones with internet to our classrooms. Keywords: Mathematics Education; Classroom; Internet.
Creating a Collaborative Learning Environment in K-6 Classrooms

Educators across North America are become increasingly aware of the Internet's potential to connect students to information resources, multimedia and each other. Yet, many of us struggle with finding appropriate tools to safely unlock the power of the information superhighway. Further, supporting teachers in learning to use technology often makes the challenge much more difficult. Our teachers found that dedicating the time to learning complex new hardware and software tools was a challenge. As with many we had made an initial investment in purchasing hardware and software for our lab, but had spent considerably less time educating our staff on how best to incorporate these tools into the curriculum. As a result, our lab of 24 Windows 95 computers with an ADSL Internet connection was seeing less use than we had hoped. In addition, many of our staff found that spending the time teaching students how to use a particular piece of software or build a Web site using HTML caused them to focus more on the computer itself, rather than on the content. We were also faced with the challenge of educating our parents about the potential and opportunities offered by the Internet and Web-based programs. With the Internet still being a new medium, particularly in schools, many teachers had discovered that managing students' work on the Internet could be difficult. Specifically, teachers were being challenged to locate suitable materials and ensure that students were using the tools appropriately. It was also important that educators use the Web effectively as a tool for students to build their own work together, rather than just view information posted by others. Integrating Zebu When I began at Hillcrest in the 1996-97 school year, one of my main objectives was to support my staff in overcoming these challenges to become leaders in technology integration. Based on the curriculum standards provided by our provincial government, known as Integrated Resource Packages (IRPs), we began developing a scope and sequence plan for the integration of technology into the curriculum. This integrated plan was designed to support our students as they moved through our elementary grades and on into the middle schools and high schools, and each year allow them to build on the knowledge and technical expertise that they gained in the previous grade. To meet these goals, we chose Zebu as a software program that offered our teachers a wide range of easy-to-use tools within a simple interface while enabling them to easily integrate the Internet into the existing curriculum. …
Don't cares in multi-level network optimization

An important factor in the optimization of a multi-level circuit, modeled as a Boolean network, is to compute the flexibility for implementing each node of the network and to exploit this flexibility to get a better functional implementation at that node. A general form for describing input-output behavior of a Boolean network is a Boolean relation. This relation or a subset of it, is then used to compute the flexibility for implementing each node in the network. The nodes in the network can be either single or multiple output. In the case of a network composed of single-output nodes, this flexibility is captured by don't cares. Techniques for computing both maximum and compatible don't care sets for each node are presented. In the case of multi-output nodes, don't cares are not sufficient to express input-output behavior of the node. Thus, we present techniques to compute maximal and compatible flexibility at multi-output nodes using Boolean relations. The current model for representing a Boolean circuit uses single output nodes. We present efficient techniques for single-output node simplification that use don't cares in terms of the fanins of node being simplified. The don't care set in terms of fanins of a node is called the local don't care set for that node; it usually has a small size and can be used to remove all the redundancies within that node. Practical issues for computing local don't cares and simplifying nodes are discussed in detail and experimental results are presented that show the effectiveness of the approach. New scripts are designed for technology independent optimization of Boolean circuits which use these new techniques. Finally, a new Boolean matching algorithm is presented that can match two functions with given don't care sets. To prove the effectiveness of the approach, this algorithm is used within a technology mapper where matches are sought between subfunctions in the network and sets of gates in the library. The symmetries of the gates in the library are used to speed up the matching process.
Modeling of PM Synchronous Machines Under Inter-turn Fault

This paper presents a theoretical approach as far as faulty Permanent Magnet Synchronous Machines (PMSM) are concerned. The knowledge of PMSM's behavior under inter-turn fault is very useful in order to check drive performances under fault conditions. Control, stability and fault detection often require faulty models. The aim of this paper is to develop a dynamical model of a PMSM under fault conditions without using circuit models coupled with finite element analysis (FEA). The method exposed in this paper only needs some preliminary FE computations that can be used in order to take into account of different winding distributions.
Beyond relational: a database architecture and federated query optimization in a multi-modal healthcare environment

Over the past thirty years, clinical research has benefited substantially from the adoption of electronic medical record systems. As deployment has increased, so too has the number of researchers seeking to improve the overall analytical environment by way of tools and models. Although much work has been done, there are still many uninvestigated areas; two of which are explored in this dissertation. The first pertains to the physical storage of the data itself. There are two generally accepted storage models: relational and entity-attribute-value (EAV). For clinical data, EAV systems are preferred due to their natural way of managing manyto-many relationships, sparse attributes, and dynamic processes along with minimal conversion effort and reduction in federation complexities. However, the relational database management systems on which they are implemented are not intended to organize and retrieve data in this format; eroding their performance gains. To combat this effect, we present the foundation for an EAV Database Management System (EDBMS). We discuss data conversion methodologies, formulate the requisite metadata and partitioned type-sensing index structures, and provide detailed runtime and experimental analysis with five extant methods. Our results show that the prototype, EAVDB, reduces space and conversion requirements while enhancing overall query performance. The second topic concerns query performance in a federated environment. One method used to decrease query execution time is to pre-compute and store “ben-
Ontology hierarchies matching by lattices alignment

Ontology matching determines the correspondences between concepts and relations of related ontologies. In this paper, we put forward an ontology hierarchies matching approach based on lattices alignment. The proposed lattice-based matching algorithm can be utilized not only in matching processes between two ontologies, but also in annotation processes between an ontology and its corresponding resources. Experiments on spatiotemporal ontology annotation have been carried out which shown the applicability of the approach.
An adaptive multi-thresholding technique for binarization of color images

Applying binarization technique on a colored image can yield an image that is quite different from the original one if multi-thresholding is used. The solution proposed is an adaptive multithresholding technique (AMTT) that describes an adaptive multi-thresholding technique (AMTT) for binarization of color images depending upon the nature of the image. The technique improves the perception of the binarized images based on color hue and hence the dissimilarity between original and binarized image is reduced. This technique compensates for differences in illumination and shade by including information content in the thresholding calculation. AMTT calculates information loss in the image with respect to human perception on the basis of color hue. Experimental results show that the proposed AMTT reduces the color content by keeping the information loss minimum.
A Region Profiler for a Standard ML compiler based on Region Inference

In this report we present the region prooler used in the ML Kit (a Standard ML compiler that uses region inference, 7]). The prooler is based on work done by Colin Runciman and David Wakeling ((17]) on a heap prooler for lazy functional programs. The prooler can be used to reduce memory usage of programs compiled with the ML Kit. Hints and examples on writing programs in a more region friendly way are given.