Miracle-dz/UniFAR-FTUs huggingface dataset:
The use of animation as a tool for concept learning

Since animation has been widely incorporated into educational media, there is a need to better understand the effect of animation in educational practice. Adopting Vygotsky's notion in the Media ZPD Model, this study is to investigate the use of animation as a tool for concept learning. The design includes two independent variables: Presentation Method (Animation, Stillvisuals, and No-visuals) and Audio Mode (Audio and Silent). Combining the two independent variables yields six different treatments. Through randomization, 144 5th-graders were assigned to one of the six treatment groups. In the experiment, the Group Embedded Figures Test (GEFT) was first given. Next, variations of the visuals, "Cube," were presented. Then, a posttest was administered. Research questions include the determination of difference and interaction among each independent variable and the relationship between the posttest scores and the GEFT scores. The results indicated that two Audio Modes (Audio and Silent) have no significant difference in presenting visuals. There is an interaction between the GEFT and the presentation methods. The analyses showed that for Field-dependent (FD) learners (1) Animation and Still-visuals have no significant difference; (2) Animation is significantly higher than No­ visuals; and (3) Still-visuals is also significantly higher than No-visuals. Whereas, for Field-independent (FI) learners, different ways of presenting visuals have no significant differences. The analyses also showed that inappropriate use of media can hinder FI students firom learning. In addition, there is a positive
ATTACK PROFILING FOR DDOS BENCHMARKS

ACKNOWLEDGMENTS This project would not have been possible without the support of many people. Many thanks to my advisor, Jelena Mirkovic, who read my numerous revisions and helped make some sense of the confusion. Also thanks to my committee members, Adarshpal S. Sethi, Ching-Chung Shen who offered guidance. And finally, thanks to my family and friends who endured this long process with me, always offering support and love.
Determination of the correct value of Cdl from the impedance results fitted by the commercially available software

With the introduction of a constant phase element (CPE) as a replacement for the capacity in EIS measurements, most of the experimentally obtained results could be fitted by commercially available software (Gamry, Scribner, Solartron, etc.). Much better fit results were obtained with CPE in comparison with the fit results obtained by using pure capacity, represented by parallel plate condenser. Taking into account that the CPE defines inhomogeneity of the surface in the electrochemical EIS experiments and inhomogeneity of the charge distribution in solid state EIS measurements, it is reasonable to expect that better fit for real systems is obtained by using CPE. The main problem in the use of commercially available software with CPE is the fact that the capacity, obtained by fitting procedure, does not have the dimension of capacity, i.e., F cm, or Ω cm s, but its dimension is given in Ω cm s, where α is the exponent in the equation for the CPE [1] ( ZCPE = Zdl(jω) ).
Implementing and Optimizing Multiple Group by Query in a MapReduce Approach

MapReduce model is a new parallel programming model initially developed for large-scale web content processing. Data analysis meets the issue of how to do calculation over extremely large dataset. The arrival of MapReduce provides a chance to utilize commodity hardware for massively parallel data analysis applications. The translation and optimization from relational algebra operators to MapReduce programs is still an open and dynamic research field. In this paper, we focus on a special type of data analysis query, namely, multiple group by query. We first study the communication cost of MapReduce model, then we give an initial implementation of multiple group by query. We then propose an optimized version which addresses and improves the communication cost issues. Our optimized version shows a better accelerating ability and a better scalability than the other version.
Millimeter Wave GaAs MMICs For Automotive Applications

This paper will present the design methodology and test results of several GaAs monolithic circuits (MMICs) specifically designed for 77 GHz collision avoidance radars. In addition, test data for an integrated transmitter is presented, along with projected 1995 cost tradeoffs between fundamental (77 GHz VCO using 0.15 micron pseudomorphic HEMTs) and multiplied (38.5 GHz VCO used with 0.25 micron power MESFET amplifiers and a multiplier) transmitter approaches.
A three-dimensional wave propagation model for macrocellular mobile communication networks in comparison with measurements

A three-dimensional macrocell propagation model is presented in this paper. It takes into account multipath propagation and can be used for an improved estimation of received power and of relevant parameters describing the frequency selectivity and the time variance of the radio channel. Comprehensive measurements were performed to validate the model. Wideband measurements performed in an Alpine region around Garmisch-Partenkirchen are compared with values predicted by the propagation model. Results for received power, power-delay profiles, scattering function and the Q/sub 16/-parameter are given. The comparison indicates that only three-dimensional models are adequate for the planning of mobile communication networks in mountainous areas.
Decoding Low-Density Parity-Check Codes With

In this letter, we present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probabilistic schedule," takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also suggests that scheduling plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.
Combination framework of rendezvous algorithm for multi‐agent systems with limited sensing ranges

In this paper, we present a novel rendezvous algorithm framework ‐ the combination framework, which is named after the term convex combination in computational geometry. The convergence of the proposed algorithms is proved based on the novel tools from the recent results in graph theory and consensus study. It has been observed that the circumcenter algorithm can be considered as a special case of the combination framework. Moreover, the relevant analysis provides us a novel viewpoint on designing and the rendezvous rate of rendezvous algorithms for networked multi‐agent systems with limited sensing ranges.
The Impact of Automated Essay Scoring on Writing Outcomes

This study was an expanded replication of an earlier endeavor (Shermis, Burstein, & Bliss, 2004) to document the writing outcomes associated with automated essay scoring. The focus of the current study was on determining whether exposure to multiple writing prompts facilitated writing production variables (Essay Score, Essay Length, and Number of Unique Words) and decreased writing errors (Grammar, Usage, Mechanics, Style, Organization & Development) over time. The impacts of these variables were examined in analyses of 11,685 essays written by 2,017 students at four grade levels (grades 6-8, 10). The essays, written in response to seven different prompts, were scored by automated essay scoring. The results showed significant differences across the four grades and over time for each of the eight outcome variables. Peak essay performance occurred with 8 graders who also displayed the highest reduction of both domain errors. Specific types of error reduction were differentially associated with grade level. The implications of the results for future research incorporating writing genre are discussed.
High Performance Computing for Large Graphs of Internet Applications using GPU

This article was published in the International Journal of Multimedia and Ubiquitous Engineering [© 2014 SERSC] and the definite version is available at :http://dx.doi. org/10.14257/ijmue.2014. 9.3. 25 The Journal's website is at:http://hgpu.org/? p=11807
Iterative source channel decoding : design and optimization for heterogeneous networks

The source-channel separation theorem postulated by Shannon has influenced the design of communication systems for multimedia content over the last decades: Source encoding and channel encoding are performed as two separate steps. However, the conditions of the separation theorem are almost never fulfilled in practical systems; a joint consideration of source and channel coding can thus be of special interest. Such a joint consideration with iterative decoding based on the Turbo principle has been found to be especially advantageous with regard to the realization of efficient multimedia communication systems. In the first part of this thesis, the concept of Iterative Source-Channel Decoding (ISCD) is fundamentally extended and optimized, especially in view of a possible practical implementation. New design guidelines and optimization criteria lead to a flexible and versatile system design. Special care is taken to optimize the components such that a residual error rate, which shall be as low as possible, results. Besides an extended, iterative receiver architecture leading to an improved exploitation of the correlation between consecutive frames, a simple yet effective stopping criterion is presented. This stopping criterion leads to an ISCD system with incremental redundancy transmission. It is additionally shown how a complexity-reduced ISCD receiver can be designed by employing a novel way of signal quantization. While the first part of this thesis treats the source encoding as given, it is consequently incorporated into the system design in the second part. As a novelty, an efficient method for the compression of parameter sources is introduced. This method shows the advantage of an easy adaptivity to varying transmission conditions. It is additionally shown how the ISCD concept can be applied for decoding multiple descriptions in order to improve the signal reconstruction quality in the presence of bit errors and packet losses. Besides optimized system designs, an innovative concept for the robust packet-based transmission of correlated source signals is presented. All variants and proposals are thoroughly analyzed using theoretical methods, by convergence analysis, or with computer simulations. The contribution of this thesis is the improvement of the error robustness and the spectral efficiency of future digital multimedia communication systems.
Implementation of Low Power Error Control Using Wireless Sensor Networks

Wireless sensor networks (WSN) offer an increasingly attractive mode of data gathering in distributed system architectures and dynamic access via wireless connectivity. ECC provides coding gain, resulting in transmitter energy savings, at the cost of added decoder power consumption. The main challenge in deploying WSN is to improve energy-efficiency and lifetime of the nodes while keeping communication reliability. The energy efficiency of error control schemes should be considered because of the strict energy constraints of wireless sensor networks. Wireless sensor networks require simple and facile error control schemes because of the low complexity request of sensor nodes. With the ever increasing data throughputs required by communication application, there is an actual need for new effective architectures (small area and high speed) for circuit parts dedicated to error detecting/correcting coding (EDC/ECC). The Convolutional Encoder and Decoder for Wireless Sensor Networks are studied and the right configurations for the encoder will be selected and a Parallel/Pipelined Architecture for the Convolutional Encoder will be explored and implemented in an FPGA platform in order to provide a low power and fast encoding scheme and the best architecture will presented.
A 3-V continuous-time filter with on-chip tuning for IS-95

This paper describes a low-voltage channel selection analog front end with continuous-time low-pass filters and on-chip tuning for a receiver in an IS-95 cellular phone. The filters were realized as balanced seventh-order elliptical g/sub m/C filters to achieve low current consumption. The transconductors were realized by using second-generation current conveyors (CCII) and resistors to achieve good intermodulation distortion performance. A novel CCII circuit topology was developed to fulfil the low supply-voltage requirement. The cutoff frequency tuning was implemented with capacitance matrices and a time-domain master-slave tuning circuit.
A robust parallel implementation of 2D model-based recognition

An approach to 2D model-based object recognition is developed, suitable for implementation on a highly parallel SIMD (single-instruction, multiple data stream) computer. Object models and image data are represented as contour features. Transformation sampling is used to determine the optimal model-feature-to-image-feature transformation by sampling the space of possible transformations. Only a small part of this space need actually be sampled due to the constraints placed on transformations by individual matches of image features to model features. The procedure requires O(Kmn) processors and O(log/sup 2/ (Kmn)) time, where m is the number of model features, n is the number of image features, and K depends on the size of the image. The procedure works well and is extremely robust in the presence of occlusion. An implementation of the procedure on the Connection Machine is described, and some experimental results given. <<ETX>>
A Study in Functional Verification of ASIP

ASIP can fulfill data processing effectively and flexibly in specific application. Due to the instruction’s diversity and the flexibility of logical structure, it has increased test vectors and enhanced difficulty in the functional verification of ASIP [1]. With the continuous spread of ASIP application, the scale of designing is enlarging and the functional verification has become the bottleneck of designing of ASIP. This paper presents a methodology able to accomplish the functional verification of ASIP. The “Bottom-up” methodology is composed of the component-level verification, the instruction-level verification and the FPGA-based prototype system verification. The paper proves the feasibility and efficiency through the experiments in functional verification of ASIP.
Sequential Monte Carlo filtering techniques applied to integrated navigation systems

This paper addresses the problem of integrated aircraft navigation, more specifically how to integrate inertial navigation with terrain aided positioning. This is a highly nonlinear and non-Gaussian recursive state estimation problem which requires state of the art methods. We propose an algorithm based on the particle filter with particular attention to the complexity of the problem. The proposed algorithm takes advantage of linear and Gaussian structure within the system and solves these parts using the Kalman filter. The remaining parts suffering from severe nonlinear and/or non-Gaussian structure are solved using the particle filter. The proposed filter is applied to a simplified integrated navigation system. The result shows that very good performance is achieved for a tractable computational load.
The Right Answer is Not Always Correct: Evaluting Student Knowledge

Students are often evaluated on their ability to find a known solution to a well-defined problem, which does not accurately reflect the types of problems encountered in post-academic engineering. With the resources available today, students may learn how to produce a final answer without adequately understanding course material or how to apply it to realworld problems. Presented is a methodology for using the design process itself as a criteria to assess higher levels of student knowledge in engineering design courses. These criteria also help develop a student’s professional practise skills and consideration of human factors in engineering design. The application of this methodology can help generate a student’s mark that more accurately reflects their abilities based on the learning objectives of a course.
Implementation of Dynamic Resource Allocation using Virtual Machines in Cloud Computing

Cloud computing allows business customers to scale up and down their resource usage based on needs. Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In this paper, we present a system that uses virtualization technology to allocate data center resources dynamically based on application demands and support green computing by optimizing the number of servers in use. We introduce the concept of "skewness" to measure the unevenness in the multi-dimensional resource utilization of a server. By minimizing skewness, we can combine different types of workloads nicely and improve the overall utilization of server resources. We develop a set of heuristics that prevent overload in the system effectively while saving energy used. Trace driven simulation and experiment results demonstrate that our algorithm achieves good performance.
Performance Analysis of Business Processes through Process Mining

Process Mining (or workflow mining) is an important research area of the section Information Systems (IS/TM) of the department of Technology Management at Eindhoven University of Technology. The starting point of process mining is registered information about tasks that are performed in a process (handling of an insurance claim, treatments of a patient in a hospital etc.). This registered information is typically called an event log. The goal of process mining is deducing knowledge (e.g. a process model, average throughput time) from such event logs. The knowledge obtained this way can increase understanding of the processes within an organization and can help with redesigning them if needed. Within the section IS/TM a process mining framework has been developed, called the ProM framework. So far, emphasis within this framework has been on the discovery and validation of process models (workflows). Herein, the ProM framework is practically unique. The analysis functionality that is currently present in the framework mainly consists of qualitative analysis. Main concern of qualitative analysis is the logical correctness of processes (absence of anomalies, like deadlocks and livelocks). For the practical usability of the framework however, functionality which supports analysis of the performance of processes (quantitative analysis) is also required. The goal of this master's project is to extend the ProM framework with plug-ins that support process performance analysis. In this thesis, the research that was done during the project will be discussed and the plug-ins that have been implemented will be described. i Preface This master's thesis concludes my study Computer Science at Eindhoven University of Technology. It describes my graduation project, which was issued by, and carried out at the During my graduation project there have been many people who have supported and assisted me. I would like to take this opportunity to thank them. First of all, I would like to thank my daily supervisor Ton Weijters for giving me the opportunity to work on a very interesting project. Also all other researchers of the BPM group that helped me or presented me with their views and thoughts deserve my gratitude. Furthermore, I would like to thank my other supervisors, Marc Voorhoeve and Paul de Bra, for taking place in my assessment commission. Finally, I would like to thank my parents, brother, sister, and friends for supporting me throughout this project and, of course, also for their support beyond this project.
Tools to support conversational multimedia

The authors discuss using multimedia technology to support conversation in a classroom. They characterize conversational communication by its rapid and relatively informal exchange of ideas. The research reported has four parts: teacher interviews, classroom observation, iterative construction of software for planning and delivering classroom lessons, and observation of teachers' use of the software. The design and use of a prototype tool for supporting school teachers in multimedia classroom conservations is described. <<ETX>>
Impedance Matching For L-Band & S- Band Navigational Antennas

This paper presents an efficient design procedure for Impedance matching of L band & S Band patch antennas for Navigational applications . Computation used in designing is the transmission line method as it offers good physical insight. The designs are simulated using "ADS Advanced Design System". The paper presents simulated results for return loss, bandwidth & gain.
Model design for a reduced variant of a Trivium Type Stream Cipher

We analyze the family of stream ciphers N-viums: Trivium and Bivium. We present the Trivium algorithm and its variants. In particular, we study the NLFSRs used in these generators, their feedback functions and their combination. Two reduced variants of these models are presented, labeled Toys. Finally, we delve into the open problems ingrained in these cryptosystems.
Quick parser development using modified compilers and generated syntax rules

This paper describes some ideas about quick parser development from source code of popular free and libre open source (called FLOSS) compilers using modified parser generator. Parser development is time-consuming and laborious according to traditional approaches. In this paper's approach, a specialized scanner is built using FLOSS compilers. The scanner reads source code, analyzes it, and writes a sequence of tokens in XML. The parser generator is modified so that it generates a specialized parser and syntax rules with code to read the tokens in XML for quick parser development. In the author's experiences, it takes within one hour to implement a simple recognizer which reads C# source code, writes a sequence of tokens in XML and analyzes it.
Evaluation of Image Segmentation Based on Histograms

The presented paper evaluates an experiment on image class seg- mentation based on Hue-Saturation histograms. Training is based on histogram calculation for every object class separately. Sliding window is performed to segment (label) individual pixels of the evaluation image. Sliding window around the given pixel encloses the local appearance from which the histogram is calculated. Local appearance histogram is subsequently used to be compared with the precomputed class histograms. Given pixel is labeled according the best match using the intersection method. We show how this method depends on data character and window size. Unfortunately, this algorithm suffers from both quality and speed performance.
An Extension to the Eclipse IDE for Cryptographic Software Development

Modern software is becoming more and more, and the need for security and trust is determinant issue. Despite the need for sophisticated cryptographic techniques, the current development tools do not provide support for this specific domain. The CACE project aims to develop a toolbox that will provide support on the specific domain of cryptography. Several partners will focus their expertise in specific domains of cryptography providing tools or new languages for each domain. Thus, the use of a tool integration platform has become an obvious path to follow, the Eclipse Platform is defined as such. Eclipse has proven to be successfully used as an Integrated Development Environment. The adoption of this platform is becoming widely used due to the popular IDE for Java Development (Java Development Tools). In this thesis we analyze the Eclipse platform as an integration platform for cryptographic software and provide a proof of concept editor for the CAO language using Eclipse. Application Areas: Cryptography