Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficient and Private Processing of Analytical Queries in Scientific Datasets

Large amount of data is generated by applications used in basic-science research and development applications. The size of data introduces great challenges in storage, analysis and preserving privacy. This dissertation proposes novel techniques to efficiently analyze the data and reduce storage space requirements through a data compression technique while preserving privacy and providing data security. We present an efficient technique to compute an analytical query called spatial distance histogram (SDH) using spatiotemporal properties of the data. Special spatiotemporal properties present in the data are exploited to process SDH efficiently on the fly. General purpose graphics processing units (GPGPU or just GPU) are employed to further boost the performance of the algorithm. Size of the data generated in scientific applications poses problems of disk space requirements, input/output (I/O) delays and data transfer bandwidth requirements. These problems are addressed by applying proposed compression technique. We also address the issue of preserving privacy and security in scientific data by proposing a security model. The security model monitors user queries input to the database that stores and manages scientific data. Outputs of user queries are also inspected to detect privacy breach. Privacy policies are enforced by the monitor to allow only those queries and results that satisfy data owner specified policies.
Investigation and validation of the openflow protocol for next generation converged optical networks

English: Considering the extension to the circuit switching environment, the work describes abilities of converged packet and circuit networks such as: dynamic packet link establishing, application-aware traffic aggregation and service specific routing. In addition to this, the overlay architecture for interoperability of GMPLS and OpenFlow has been suggested and FlowVisor capabilities in virtualization of optical networks have been investigated. At the end, the architecture of a real OpenFlow network comprising OpenFlow packet switches, FlowVisor and NOX controllers has been described, emphasizing detours from the theoretical architecture due to financial considerations.
Scaling up psycholinguistics

This dissertation contains several projects, each addressing different questions with different techniques. In chapter 1, I argue that they are unified thematically by their goal of 'scaling up psycholinguistics'; they are all aimed at analyzing large datasets using tools that reveal patterns to propose and test mechanism-neutral hypotheses about the brain's language processing architecture. In chapter 2, I investigate the well-known phenomenon that words which are more predictable in context are read faster than words which are not. I suggest that this is best understood as a special case of a phenomenon whereby more predictable events, whether linguistic or not, are in general processed more quickly than unpredictable ones, and propose a general model of why this happens. When combined with the constraints imposed by language's incrementally processed serial structure, this model predicts a logarithmic relationship between word probability and reading time, and I show that this in fact holds in two large data sets. In chapter 3, I turn to the question of how the brain produces fine- grained quantitative predictions; computationally, this seems impossible given the sparsity of the data it has available. This suggests it uses some kind of learning biases to guide generalization (a classic poverty of the stimulus argument), and I propose to study these biases by comparing subjective (cloze) probability with objective corpus probabilities. In Experiment 1, I find a number of candidate biases; in a series of follow-up experiments, I argue that some are probably artifactual, but others may in fact give clues to the brain's mechanisms for generating linguistic expectations from experience. Chapters 4 and 5 develop a methodology for extending ERP analysis to handle continuously varying stimulus attributes, partial confounding, and overlapping brain responses to events occurring in quick succession. These techniques are motivated by the desire to analyze EEG recorded in more naturalistic language paradigms (which contain all of the above challenges), but they are not specific to language studies, and have many potential applications for EEG/MEG research more generally
The computational analysis of morphosyntactic categories in Urdu

Urdu is a language of the Indo-Aryan family, widely spoken in India and Pakistan, and an important minority language in Europe, North America, and elsewhere. This thesis describes the development of a computer-based system for part-of-speech tagging of Urdu texts, consisting of a tagset, a set of tagging guidelines for manual tagging or post-editing, and the tagger itself. The tagset is defined in accordance with a set of design principles, derived from a survey of good practice in the field of tagset design, including compliance with the EAGLES guidelines on morphosyntactic annotation. These are shown to be extensible to languages, such as Urdu, that are closely related to those languages for which the guidelines were originally devised. The description of Urdu grammar given by Schmidt (1999) is used as a model of the language for the purpose of tagset design. Manual tagging is undertaken using this tagset, by which process a set of tagging guidelines are created, and a set of manually tagged texts to serve as training data is obtained. A rule-based methodology is used here to perform tagging in Urdu. The justification for this choice is discussed. A suite of programs which function together within the Unitag architecture are described. This system (as well as a tokeniser) includes an analyser (Urdutag) based on lexical look-up and word-form analysis, and a disambiguator (Unirule) which removes contextually inappropriate tags using a set of 274 rules. While the system's final performance is not particularly impressive, this is largely due to a paucity of training data leading to a small lexicon, rather than any substantial flaw in the system.
DEsign and performance analysis of DWT/FFT based OFDM systems

In this paper, a software reference model for Orthogonal Frequency Division Multiplexing (OFDM) is developed and verified for its functionality that can be adopted for wireless communication applications. BER and functionality of the developed OFDM model is analyzed for Fourier based OFDM (FFL-OFDM) and Wavelet based OFDM (DWL-OFDM) systems for AWGN Channel and results are compared. DWL-OFDM is implemented using zero paddmg and vector transposing for transmitting the OFDM signal and likewise the zeroes are discarded at the receiver. Modulation results for 16-QAM, 32-QAM, 64-QAM, 128-QAM and 256 QAM are noted for both DWL and FFL based OFDM models. It is found that DWL based OFDM achieves better BER results compared with FFL-OFDM model. DWL-IDWL based OFDM model developed is analyzed for its performance by considering various wavelets such as Haar, Db-3, Db-4, bior.3. 3, bior5.5, rbior.3. 3 and rbior5.5. The OFDM model is developed using Simulink in MATLAB, various test cases have been considered to verify its performance. It is seen that Haar wavelet m DWL-OFDM outperforms FFL-OFDM by approximately 10 dB at a BER of 0.95.
Data reduction: feature selection

Feature selection is introduced as a search problem that consists of feature subset generation, evaluation, and selection. The purpose of feature selection is three-fold: reducing the number of features, improving classification accuracy, and simplifying the learned representation. We review major evaluation measures and various feature selection approaches, list some existing methods, and show by example the role of feature selection in data mining.
Perbandingan teori model binari (comparisons of theoritical binary models)

Tujuan kertas ini ialah untuk membincangkan teori bagi model logit, model probit dan model kebarangkalian linear. Perbandingan model dari segi penganggaran parameter $\beta_k$ dilakukan dengan menggunakan kaedah kebolehjadian maksimum dan kaedah kuasadua terkecil berpemberat. Beberapa perbandingan ujian lain ditunjukkan seperti multikolineariti, ujian reja, pengujian hipotesis, kebagusan penyuaian dan diagnosis data berpengaruh serta data terpencil.
Optimizing SAS tasks for Grid Architectures

Aitor Ibarra, Daniel Tapiador, Fernando F´elix, Carlos Gabriel,Christophe Arviset, John HoarEuropean Space Agency, ESAC, Madrid, SpainSalim AnsariEuropean Space Agency, ESTEC, Noordwijk, The NetherlandsAbstract.We present the ﬁrst prototype of a XMM-Newton pipeline processingtask parallelized at a CCD level, which can be run in a GRID system.By using the GridWay application, the processing of the XMM-Newtondata is distributed across the Virtual Organization constituted by threediﬀerent research centres (ESAC, ESTEC, Complutense Madrid Univer-sity). 1. IntroductionThe advent of Virtual Observatories (Williams 2004) will allow the astronomersaround the world the access to an unprecedented amount of scientiﬁc data. Theprocessing of those data will be carried out, in most cases, by using the compu-tational resources supplied by the Data Provider to the scientiﬁc community.Due to the large amount of data available, it is crucial that the Data Providercould manage their hardware resources in an optimal way, if they do not wantthe data processing to slow down. In this context, GRID technology oﬀers thecapabilityofmanagingnotonlytheuserqueriesretrievingdatafromthearchive,but also the online processing of that data. By using GRID architectures, thisonline processing can be a bottleneck, depending on the data software reductionused.TheScienceArchiveshostedattheEuropeanSpaceAstronomyCentre(ESAC)and particularly the XMM-Newton Science Archive (XSA), give the scientiﬁccommunity the possibility to process the data on-the-ﬂy
Generative Design of Hardware-in-the-Loop Models

Embedded software is used nowadays in many applications. To ensure the function and reliability of the software, hardware-in-the-loop methods are commonly used to test it in a simulated environment. Due to the rising complexity of the implemented function, performance limitations and practicability reasons, the simulations are often specialized to test few aspects of the software and reach therewith a high diversity. This diversity is difficult to manage for a user and results in wrong selected components and compatibility problems. This paper presents a generative programming approach that handles the diversity and includes an interface concept to evaluate the compatibility. To use this approach profitably in real-world applications, a migration approach is presented using a model analyzer. The evaluation of the presented approach is exemplified in the automotive domain using MATLAB/Simulink.
Increasing parallelizing compiler efficiency using commutative functions

The need for suitable software abstractions is proportional to the complexity of the underlying computer architecture. Even though language technology has made significant contributions over the years, many hard decisions have been delegated to the compiler. Naturally, compilers are only as efficient as the algorithms they contain. In this thesis we consider an approach to detecting commuting operations that give the same result independent of execution order. Our approached is based on analyzing commutativity of any pair of statements rather than just consecutive function calls. This will allow us to detect opportunities for parallelization that previous conservative approaches would ignore or miss be- cause of context-insensitivity.
Time-versus-Capacity Compromises in Project Scheduling1

In most common formulations of project scheduling problems, the objective of scheduling is defined as the minimization of a temporal criterion such as the overall project duration. In actuality, the problem consists not only in minimizing the makespan of the project, but also in avoiding peaks in the utilization of resources over time. Constraint-based algorithms for dealing with this problem are proposed and discussed, as well as their implementation in I LOG SOLVER, a generic C++ object-oriented constraint programming tool [Puget 92] [Puget 94], augmented with I LOG SCHEDULE, a library designed to simplify the representation and the resolution of scheduling and resource allocation problems [Le Pape 93] [Le Pape 94]. An algorithm for determining all the Pareto-optimal trade-offs between makespan and peak capacity is described. Experimental results are provided in the particular case of a ship loading problem presented by Aggoun and Beldiceanu as a benchmark for the C HIP cumulative constraint [Aggoun 92]. In particular, it is shown that the "optimal finishing dates" provided in [Aggoun 92] are not the optimal makespans.
Language Identifier: A Computer Program for Automatic Natural-Language Identification of On-line Tex

The rst step in translating any text is to identify the language in which it is written. Several useful methods have already appeared for language identiication where the mystery texts are properly spelled and accented paper documents. Unfortunately, in machine-translation environments, where texts are on-line and may exhibit a variety of conventions for character-mapping and accentuation, the problem is far more diicult. This paper outlines a generalized approach to language identiication of on-line text based on techniques of cryptanalysis. A working prototype has been built, and the results are promising.
The High-Level Protocol Specification Language HLPSL developed in the EU project AVISPA

The just recently finished EU project AVISPA, Automated Validation of Internet Security Protocols and Applications, has aimed at developing a push-button, industrial-strength technology for the analysis of large-scale Internet security-sensitive protocols and applications. In this short industrial contribution paper, after giving a very brief overview of the AVISPA project, we introduce HLPSL, the High-Level Protocol Specification Language developed and used within the project to model security protocols and to specify their desired properties. This language enjoys a formal semantics based on Lamport's Temporal Logic of Actions. HLPSL is modular and allows for the specification of control flow patterns, data-structures, alternative intruder models, and complex security properties. It is suciently high-level to be accessible to protocol engineers (themselves not necessarily formal methods experts), yet easily translatable into a lower-level term-rewriting based language suited to model-checking tools.
Pointing and Representing - Three Options

The aim of this paper is to explore the minimal representational requirements for pointing. One year old children are capable of pointing – what does this tell us about their representational capacities? We analyse three options: (a) Pointing presupposes non-perceptual representations (b) Pointing does not presuppose any representation at all (c) Pointing presupposes perceptual representations Rather than fully endorsing any of these three options, the aim of the paper is to explore the advantages and disadvantages of each.
Semantically driven part-based object detection

Up to now deformable part based object models have initialized their parts by dividing the shape of their components into equally sized regions. The regions then become the parts that are anchored to a slightly moveable position on top of the components. What a part represents fully depends on what is represented in the region of the component that it was created from. However, the size and the location of the part has always been determined without any regard for the conceptual structure of the component. We use the framework proposed by Felzenszwalb, et al [1] to learn the shape of objects in ImageNet that are the meronyms of a more complex object from a category of interest provided by the Pascal VOC data set [2]. The meronyms are acquired by analyzing the semantic structure of the given category in WordNet. We then use the shape of the meronyms to estimate their size and location in the learning data of the complex object. After calculating the principal components of the found part configurations we use a Fisher Linear Classifier to cluster the learning data. Instead of only separating the data based on the shape of its bounding boxes, we create additional model components based on semantic structures. After learning the shape of the components of the model, we place the parts from ImageNet at their estimated positions on top of the semantically enhanced components. “We can’t define anything precisely. If we attempt to, we get into that paralysis of thought that comes to philosophers. ” Richard Feynman, 1918 1988
Microcomputer simulation for subsurface water potential on hillslope

This research paper focuses upon subsurface flow because of its dominant influence on the other types of hilislope water flow processes. The basic theory of water movement is quickly discussed in order to build the reader's general background knowledge. With this background, the journey starts into the poorly understood realm of subsurface flow mechanisms where some qualitative relationships and hypotheses are discussed. These concepts are used in an elementary computer simulation model within appropriate soil physics theory. This model can demonstrate the effect of major controlling factors; soil, bedrock and topography; on steady-state water potential in a hilislope segment to the field
To a new hardware design methodology: A case study of the cochlea model

In this thesis a design methodology based on mathematical transformations and Haskell was investigated with a case study. The topic of the case study was the cochlea model, for which the goal was to design a working implementation of the cochlea model on an FPGA. The case study showed that the mathematical design methodology has advantages like faster development and less error-prone transformations, because the transformations are in mathematical form and can be verified. The CLaSH compiler which takes a subset of Haskell and compiles it into VHDL is very useful in this design methodology as it automates the last step from Haskell to VHDL. The cochlea model in its original form proved to be too large to fit on the selected FPGA. However, a less complex and less precise version of the model, with a reduced number of slices, led to an implementation which could fit on the FPGA.
Editorial: Standards for reviewing papers: Editorials

Graphical user interfaces (GUIs) are by far the most popular means used to interact with today's software. The functional correctness of a GUI is required to ensure the safety, robustness and usability of an entire software system. GUI testing techniques used in practice are resource intensive; model-based automated techniques are rarely employed. A key reason for the reluctance in the adoption of model-based solutions proposed by researchers is their limited applicability; moreover, the models are expensive to create. Over the past few years, the present author has been developing different models for various aspects of GUI testing. This paper consolidates all of the models into one scalable event-flow model and outlines algorithms to semi-automatically reverse-engineer the model from an implementation. Earlier work on model-based test-case generation, test-oracle creation, coverage evaluation, and regression testing is recast in terms of this model by defining event-space exploration strategies (ESESs) and creating an end-to-end GUI testing process. Three such ESESs are described: for checking the event-flow model, test-case generation, and test-oracle creation. Two demonstrational scenarios show the application of the model and the three ESESs for experimentation and application in GUI testing. Copyright © 2007 John Wiley & Sons, Ltd.
The Concept of Trace Summarization

Recently, trace analysis techniques have gained a lot of attention due to the important role they play in understanding the system behavioral aspects. However, manipulating execution traces is still a tedious task despite the numerous techniques implemented in existing trace analysis tools. The problem is that traces are extraordinary large and abstracting out their main content calls for more advanced solutions. In this paper, I introduce the concept of trace summarization as the process of taking a trace as input and returning a summary of the main invoked events as output. A discussion on how text summarization techniques can be applied to summarizing the content of traces is presented.
Generation Of Software Tests From Specifications

Thorough testing is widely acknowledged to be a very expensive part of the software development process. The conventional method of constructing and executing tests for software systems is contrasted with automatic techniques which generate and execute tests derived from the software under test and/or from its formal specification. We present a review of techniques which are currently being used or developed for generating tests, and discuss the approach which we are using.
Phonological learning based on interactive and mediated speech

Introduction Current models of language change assume that face-to-face interaction is essential for the kind of phonological learning which leads to change, and reject the possibility that such learning occurs from noninteractive speech sources such as radio and television. This assumption is challenged by recent findings showing that the broadcast media are involved in certain phonological changes. But almost no research directly investigates whether these different experiences of language cause differences in phonological learning. We report the first steps of a research programme to compare how listeners learn about an accent other than their own through face-to-face interaction versus watching a video of the same.
The animat path to AI

A research methodology is proposed for understanding intelligence through simulation of artificial animals (“animats”) in progressively more challenging environments while retaining characteristics of holism, pragmatism, perception, categorization, and adaptation that are often underrepresented in standard AI approaches to intelligence. It is suggested that basic elements of the methodology should include a theory/taxonomy of environments by which they can be ordered in difficulty—one is offered—and a theory of animat efficiency It is also suggested that the methodology offers a new approach to the problem of perception.
The Machine-SUIF SUIFvm Library

The SUIFvm architecture is a virtual machine used as an intermediate target in translation from SUIF 2 form to instructions for a real target machine. In the Machine-SUIF system, all code generators for specific physical targets take their input in the form of SUIFvm code. SUIFvm instruction lists also serve as an intermediate form for certain kinds of code optimization. This library defines the SUIFvm instruction set and the class CodeGen that is the basis for MachineSUIF code generation.
Adolescent Girls’ Responses to Feminist Artworks in the Elizabeth A. Sackler Center for Feminist Art at the Brooklyn Museum

This qualitative case study investigated girls’ interests in feminist art and their perceptions of gender (in)equality by engaging with feminist artworks. Adolescent girls participated in the 3-week program Women Artists and Their Artwork. Findings reveal that, given the opportunity to engage with a variety of feminist artworks, girls articulate their perceptions about women’s experiences and learn more about women’s history to contemplate their place within the world. Findings also show that beliefs and opinions of gender (in)equality vary among adolescent girls.