Miracle-dz/UniFAR-FTUs huggingface dataset:
FPGA Implementation of RSA algorithm and to develop a crypto based security system

This project is aimed to implement RSA algorithm on FPGA and to use the cryptography algorithm (RSA) to develop a crypto based security system. The control and data path of RSA algorithm (decryption only) is implemented on FPGA to behave as an independent password checker for the security system. The encryption part of the algorithm is done by the system itself. The system has the different public key for encryption for different users and the corresponding private key of the user is saved in the FPGA. The system generates a random 16-bit number and encrypts it using the encryption algorithm of RSA and sends the encrypted message to the FPGA using a USB to serial cable and the FPGA decrypts it using the decryption algorithm of FPGA and sends back the decrypted message to the system. The system checks the random message it generated before with the decrypted message send by FPGA for the particular user. If both the data matches then the system welcomes the user and if it doesn’t matches then it will give two more chances for entering the correct user name and connecting the correct FPGA.
Dynamic peer-to-peer game networks using WebRTC

This document is the final report on the Bachelor Project conducted by Jasper Abbink, Karens Grigorjancs and Joost Verdoorn on Dynamic peer-to-peer game networks using WebRTC. In this report we detail our findings on the recently developed WebRTC technology. WebRTC enables the creation of web applications built around peer-to-peer technologies by providing the means to directly connect one browser to another. With this project we aimed to facilitate web developers by developing a software library that is a drop-in solution for large-scale peer-to-peer networks. We investigated the scalability of WebRTC networks and attempted to seek the edges of the technology. We evaluated a number of ways by which a browser-based peer-to-peer networks can be deployed, and implemented the ones that best suited our needs. To demonstrate our library we created a small massively-multiplayer arcade game as an entertaining way to display WebRTC's capabilities.
Problem Based Learning PBL as a strategy for Knowledge Building (KB) based on informatics technology

Knowledge Building places the students in the trajectory of the creativity disciplined and mature of the producer of the knowledge, the creativity of the researcher because the students must work with others in team and investigate from questions. The obtained learning not only depends on the individual efforts but the collaboration of the group. With KB it is possible to approach projects that incorporate characteristics of the work of the adults with contents of the real world and which they use supported sources of information varied specially with use of information technology. The PBL has as objective to engage the students in concepts and central principles of a discipline and it does not have to be peripheral to the curriculum. This objective is better obtained using the tool Knowledge Forum (KF) following the KB principles using (KF). PBL makes use evaluations based on the performance considering an wide rank of abilities and knowledge. The investigation was made in the matter Select Subjects of Physics I for fifth semester of high school. It was decided to make a project throughout the fourth month period that allowed to incorporate the greater amount of subjects and AcroPDF A Quality PDF Writer and PDF Converter to create PDF files. To remove the line, buy a license. concepts for its accomplishment with the methodology of the PBL being handled the principles of KB using KF.
Intelligent Wireless Networking, Smart Antennas and Adaptive Modulation

From the Publisher: Within the ITU (International Telecommunications Union), third generation mobile systems are called International Mobile Telephony 2000 (IMT 2000). All intelligent networking (IN) for telecommunications involves the concept of a distributed intelligence wherein a database is queried for information necessary for call processing. The reasons for deploying mobile IN technologies are to provide value-added capabilities for purposes such as cost reduction, improved service delivery, increased variety and quality of services, and rapid service creation and deployment.
ContextWall: Amulti-user workbench for independent work, peer-to-peer interaction, and whiteboard collaboration

ContextWall is a Single Display Groupware system based on the focus plus context screen architecture. The display consists of multiple high-resolution computer screens that are seamlessly embedded into a larger projected display. ContextWall supports three different collaboration styles. First, the embedded hi-res displays allow users to use the system for independent work. Second, users can interact peer-to-peer by acquiring material from or dropping material into the other user’s portion of the workspace. Third, ContextWall provides the large display required for electronic whiteboard interactions. ContextWall offers many of the properties offered by wall-size hi-res screens, but at lower hardware effort. This paper discusses implementation issues and first experiences with ContextWall.
Capitalizing on Failure through Case-Based Inference

Abstract : Previous failures to solve problems can be a powerful aid in helping a problem solver to improve. When prior cases in which an error was made are recalled (e.g. common sense mediation of everyday disputes and menu planning), the reasoner may consider whether the same potential for error exists in the new case. As a result, reasoning is directed to that part of the current problem that was responsible for the previous error, sometimes changing the problem solver's focus. Focus may also be directed toward gathering knowledge to evaluate the potential for error in the current case. A case with an error may also suggest a correct solution for the new problem. The combination of these helps the problem solver to avoid repeating mistakes and suggests shortcuts in reasoning that avoid the trial and error of previous cases. Keywords: Artificial intelligence; Cognitive science; Knowledge theory; Man machine systems.
A model of cognitive load for IR: implications for user relevance feedback interaction

Preliminary experimentation demonstrates that although a system that allows for context specific spontaneity is likely to improve the acquisition of user relevance feedback, this is by no means a solution. We believe that the problems associated with a lack of willingness to modify queries or to provide relevance feedback within the Web environment, are indicative of a high state of cognitive load. A number of task and cognitive variables exist and need to be identified before a model of cognitive load for IR can be developed.
Issues in Internet's scalability : structure and application (נושאים בהתפתחות האינטרנט.)

The Internet is becoming a vital tool in today’s communication, information and data retrieval, as well as commerce. Its fast spreading, non affected even by the recent bubble burst, exceeds the rate of software and hardware development, and makes it harder for monitoring, measuring and understanding. In this work we investigate different aspects of the structural properties of the Internet, and suggest how to elevate some of our findings to comprise better application and routing layer services. First, we investigate the exact structure of general shortest path multicast trees in the Internet. We present a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law. Our most surprising empirical finding suggests that there is a linear ratio between the number of high-degree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client. We leverage this finding in an application layer scheme for the dissemination of very popular content to a very large audience. The scheme uses an integrated architecture of HTTP unicast and a cyclic multicast delivery of the popular content, and relies on an accurate evaluation of the multicast group size. We also develop an additional end to end counting algorithm for this evaluation. We further investigate the tomography of multicast trees, and find that not only it conforms to the findings of the scale free properties of the tree, but also has the exact same characteristics as the Internet’s tomography. This finding deepens our understanding on the exact structure of multicast trees in the Internet, on a layer by layer basis. We conclude the work by investigating the nature of the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The agreements impose policies that govern routing in the AS level, and thus the resulting topology graph is directed, and does not maintain transitivity. We show, using partial views obtained from the Internet, that the Internet’s resiliency to a deliberate attack is much smaller than previously found. Its reachability is also somewhat lower under random failures, with the surprising result that it becomes closer to the optimum when the average degree of the Internet increases. We further investigate the effect of added backup connectivity on the resiliency.
External memory graph algorithms and applications to geographic information systems

Many modern applications need to process data that is too large to fit in the internal memory of the computer and must be stored on disk. Since disks are much slower than CPU, the bottleneck in many such applications is the I/O-communication between internal memory and disk. One approach to improve performance is to design algorithms that optimize the I/O communication between internal memory and disk, known as external memory algorithms or I /O-efficient algorithms. This thesis focuses on external memory algorithms for basic graph problems and the application of the principles of external memory computation to Geographic Information Systems (GIS). The first part of the thesis presents external memory algorithms for a number of graph problems including breadth-first search (BFS), depth-first search (DFS) and computation of shortest paths. Most of the graph theoretical results in this thesis are for planar graphs. We have initiated a sequence of I/O-efficient reductions between planar BFS, DFS, single-source shortest path (SSSP) and graph separation which led to optimal algorithms for these problems on planar graphs. We have extended the techniques to planar directed graphs obtaining algorithms for BFS, SSSP, all-pair-shortest-paths (APSP) and topological sort and developed a data structure for shortest path queries. The second part of the thesis presents I/O-efficient algorithms for flow modeling on grid-based terrains and the system that we designed and implemented, TERRAFLOW. We present experimental result that demonstrate the scalability our system. On large terrains, TERRAFLOW greatly outperforms existing systems. TERRAFLOW has been recognized in the GIS community and is being incorporated into both major GIS systems, GRASS and ArcInfo.
On Prediction and Filtering of Stock Index Returns

The predictability of asset returns is a much debated and investigated subject in academia as well as in the financial services industry. In this thesis we study the predictability of the returns of European stock indices, using time series and regression based forecasting methods, as well as filtering techniques, specifically the Hodrick-Prescott filter. In disagreement with the Efficient Market Hypothesis, which claims that asset prices incorporate all information embedded in historical prices, indications of predictability based on historical returns are found. Predictability was further improved by filtering the data before applying the forecasting methods. Acknowledgements. Many thanks to my supervisor Boualem Djehiche for the idea to this thesis and valuable input, comments and support along the way. I am also very grateful to the employees at Archipel Asset Management and Brummer & Partners for making the process of writing this thesis an invaluable learning experience and among the most fun and interesting times of my studies at KTH.
Improved TFRC Algorithm Aiming at Controlling Jitters of End-to-end Transport Delay

TFRC is a well-known rate-based TCP-friendly congestion control mechanism.In this work,an improved algorithm of TFRC,denoted by TFRC-CJUTD,is introduced,in order to meet the requirement of end-to-end real-time stream for network transport.Within this improved algorithm,jitters of unidirectional transport delay are proposed to be used as a feedback signal in the control mechanism in order to effectively reduce the jitters of unidirectional transport delay in course of stream transport,so that the control mechanism can better adapt to real-time stream.Remarkable improvement of this new algorithm is verified through simulations on NS.
Maximum-likelihood linear regression coefficients as features for speaker recognition

The goal of this thesis is to find new and efficient features for speaker recognition. We are mostly concerned with the use of the Maximum-Likelihood Linear Regression (MLLR) family of adaptation techniques as features in speaker recognition systems. MLLR transformcoefficients are able to capture speaker cues after adaptation of a speaker-independent model using speech data. The resulting supervectors are high-dimensional and no underlying model guiding its generation is assumed a priori, becoming suitable for SVM for classification. This thesis brings some contributions to the speaker recognition field by proposing new approaches to feature extraction and studying existing ones via experimentation on large corpora: 1. We propose a compact yet efficient system, MLLR-SVM, which tackles the issues of transcript- and language-dependency of the standard MLLR-SVM approach by using single-class Constrained MLLR (CMLLR) adaptation transforms together with Speaker Adaptive Training (SAT) of a Universal Background Model (UBM). 1- When less data samples than dimensions are available. 2- We propose several alternative representations of CMLLR transformcoefficients based on the singular value and symmetric/skew-symmetric decompositions of transform matrices. 3- We develop a novel framework for feature-level inter-session variability compensation based on compensation of CMLLR transform supervectors via Nuisance Attribute Projection (NAP). 4- We perform a comprehensive experimental study of multi-class (C)MLLR-SVM systems alongmultiple axes including front-end, type of transform, type fmodel,model training and number of transforms. 5- We compare CMLLR and MLLR transform matrices based on an analysis of properties of their singular values. 6- We propose the use of lattice-basedMLLR as away to copewith erroneous transcripts in MLLR-SVMsystems using phonemic acoustic models.
Implementing an array shape inference system for matlab using mathematica

In implicitly typed array-based languages such as MATLAB, APL and IDL, advance determination of an array’s shape empowers the execution of efficient code. Static knowledge of an array’s shape could sanction a variety of code optimizations besides permitting compile-time verification of shape correctness and serving as a debugging aid. This report presents a symbolic array shape inference system for MATLAB, a prototypical array-based language. Unlike prior efforts at array shape determination that have used lattice-theoretic techniques, our methods are based on algebraic systems that exploit properties associated with MATLAB’s shape semantics. This confers a unique advantage to our approach in that useful shape information can be deduced even when the actual array extents are compile-time unknowns. The shape inference system has been implemented in Mathematica as part of , a type inference engine for MATLAB. We report array shape inference measurements on a benchmark suite comprising programs that span the published test suites of some recent research MATLAB compilers, and we show how even when shapes are symbolic, our system detects the equivalence of over 60% of these shapes in 5 out of 6 benchmarks, and over 30% in the sixth. In all remaining situations, all array shapes were inferred to be compile-time constants.
Analyzing Children's Hand Actions using Tangible User Interfaces

We present the theory and mixed methods approach for analyzing how children’s hands can help them think during interaction. The methodology was developed for a study comparing indirect with direct input methods for object manipulation activities in digitally supported problem solving. We propose a classification scheme based on the notions of complementary and epistemic actions in spatial problem solving. In order to overcome inequities when comparing mouse input with the multiaccess, bimanual input, we develop a series of relative measures based on our classification scheme. This methodology is applicable to a range of computationally augmented activities involving object manipulation.
Mobiles und ubiquitäres Lernen - Technologien und didaktische Aspekte

Pate des Kapitels: In diesem Kapitel wird ein Uberblick zu den Grundlagen und aktuellen Entwicklungen mobiler und ubiquitarer Lernunterstutzung gegeben. Das Kapitel beschreibt verschiedene Definitionen mobilen Lernens und fuhrt in die zugrundeliegenden Probleme und Losungsansatze ein. Die sich rasant entwickelnde Technologie wird hierbei in verschiedene Komponenten von Sensoren und Displays unterschieden und es werden zentrale theoretische Paradigmen vorgestellt. Im letzten Abschnitt werden unterschiedliche Funktionen mobiler und ubiquitarer Lernunterstutzung vorgestellt und auf entsprechende Klassifikationssysteme in der Literatur verwiesen. Zitation des Kapitels Links auf Mister Wong This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License .
Measurement of Space: From Ants to Robots

We are interested in the ways that animals use to measure spaces that are much larger than their sensing range, and how these ways can be tested and adapted by the mobile robots. Particularly, the animals that we are concerned are the scout worker ants that assess potential nest cavities needed by their entire colony. The individual scout ants work literally in the dark and the spaces that they explore are beyond their immediate sensing range and have irregular and unpredictable shapes. Furthermore, these scouts must not only measure the floor area of a potential nest site but they must also assess the integrity of the inner periphery of the nest to check that it does not have too many holes that would make it difficult to defend against enemies. The hypothesis that the scouts use a ‘Buffon’s needle algorithm’ to estimate the nest size is supported by experiments. In this paper, we present a behavioral model for the nest size assessment of the scouts. This behavior is implemented on an ant-bot, a simulated scout model, to study the assessment process. We present the simulation results obtained from this model by systematically varying the behavior and analyzing how well the size of the nest is evaluated and how well the integrity of the periphery is checked. We also discuss future lines of research on how the robots can be used for illuminating further the behaviour of the ants, and how these studies can be useful in developing robust behaviors for autonomous mobile robots.
analisis dan desain aplikasi berbasis multimedia sebagai media penyampaian informasi pada smk n 1 wonosobo

Teknologi komputer bukan hanya sebagai dasilitas kemudahan kita dalam mengelola dan mengolah data dan informasi, akan tetapi sekarang sudahmenjadi tool untuk media penyampaian informasi dan promosi. Sebagai contoh CD interaktif, disitu tersedia sebuah paket informasi yang dibuat oleh suatu lembaga, instansi atau organisasi untuk memperkelankan baik dari sisi perusahaannya, produk, atau pelayanannya. Audience atau penerima informasi dapat dapat berinteraksi langsung, karena paket informasi dibuat interaktif dengan sipengguna. CD Interaktif itu akan diterapkan pada SMK N 1 WONOSOBO, sebagai media penyampaian informasi dan promosi.
A Face Is Exposed for AOL Searcher No

Mr. Rotenberg pointed to Google’s own joust earlier this year with the Justice Department over a subpoena for some of its search data. The company successfully fended off the agency’s demand in court, but several other search companies, including AOL, complied. The Justice Department sought the information to help it defend a challenge to a law that is meant to shield children from sexually explicit material.
The ACSE Multimedia Science Learning Environment

Advanced Computing for Science Education (ACSE) is a multimedia science learning environment. Lessons, called ACSE Volumes, serve as electronic laboratory units in a developmental biology course. Each ACSE Volume is focused on a single scientific research area. The centerpiece of each Volume is a simulation of a scientific process. In exposing the scientific essence of the simulation to students, ACSE promotes the use of a programming language to convey scientific information. Snippets of executable simulation code are interspersed with other media to form a literate lesson. The simulation is open to student modification, and experimentation is encouraged. The learner is invited to extend the central theory or pose alternative hypotheses, and then test them in the simulation. ACSE investigates whether students with one semester of computer programming experience can participate in science and communicate their results through ACSE Volumes. Early empirical results and future directions are discussed.
Adquisición y procesamiento de imágenes aéreas para sensado remoto

Resumen Los sistemas de adquisicion de imagenes aereas digitales de alta resolucion basados en camaras de formato pequeno representan una alternativa de gran versatilidad en la solucion de diversos problemas de monitoreo ambiental y sensado remoto, particularmente aquellas obtenidas en base a dispositivos aereos autonomos UAV. Esto es aśi dado que un correcto procesamiento de imagenes de camaras de formato pequeno (opticas y/o mulitespectrales) permite la obtencion de ortomosaicos que cumplan con estandares de calidad, a una fraccion del costo operativo del uso de equipos aerotransportados de costo mucho mayor, y con mayor flexibilidad y resolucion que con el uso de imagenes satelitales. El objetivo de este trabajo de investigacion es la implementacion de un sistema de computo que permita sistematizar la adquisicion, procesamiento, rectificacion, formacion de mosaicos, y georreferenciacion de las imagenes adquiridas por medio de camaras opticas y multiespectrales transportadas por un UAV. Los resultados obtenidos permiten automatizar el procesamiento casi por completo, requiriendo un minimo de atencion no especializada, y permiten organizar la informacion e imagenes obtenidas en los vuelos para su posterior uso en procesos de reconocimiento, interpretacion e identificacion.