Miracle-dz/UniFAR-FTUs huggingface dataset:
SELL v1.0: Searchable Encrypted Logging Library

We present a practical solution to design a secure logging system that provides confidentiality, integrity, completeness, and nonrepudiation. To the best of our knowledge, our solution is the first practical implementation of a logging system that brings all the above security aspects together. Our proposed library makes use of a Dynamic Searchable Symmetric Encryption (DSSE) scheme to provide keyword search operations through encrypted logs without decryption. This helps us to keep each log confidential, preventing unauthorized users from decrypting the encrypted logs. Moreover, we deploy a set of new features such as log sequence generation and digital signatures on top of the DSSE scheme, which makes our library a complete proof of concept solution for a secure logging system, providing all the necessary security assurances. We also analyze the library’s performance on a real setting, bootstrapping with 10,000 lines of logs. Based on our observation, the entire search operation for a keyword takes about 10 milliseconds. Although SELL v1.0 is developed purely in Python without any low level optimization, the benchmarks show promising timing results for all the operations.
Fuzzy Types Clustering for Microarray Data

The main goal of microarray experiments is to quantify the expression of every object on a slide as precisely as possible, with a further goal of clustering the objects. Recently, many studies have discussed clustering issues involving similar patterns of gene expression. This paper presents an application of fuzzy-type methods for clustering DNA microarray data that can be applied to typical comparisons. Clustering and analyses were performed on microarray and simulated data. The results show that fuzzy-possibility c-means clustering substantially improves the findings obtained by others. Keywords—Clustering, microarray data, Fuzzy-type clustering, Validation
Quantum soft filtering for the improved security analysis of the coherent one-way QKD protocol

A precise security analysis of practical quantum key distribution (QKD) systems is an important step for improving their performance. Here we consider a class of quantum soft filtering operations, which generalizes the unambiguous state discrimination (USD) technique. These operations can be applied as a basis for a security analysis of the original coherent one-way (COW) QKD protocol since their application interpolates between beam-splitting (BS) and USD attacks. We demonstrate that a zero-error attack based on quantum soft filtering operations gives a larger amount of the information for Eve at a given level of losses. We calculate the Eve information as a function of the channel length. The efficiency of the proposed attack highly depends on the level of the monitoring under the maintenance of the statistics of control (decoy) states, and best-case results are achieved in the case of the absence of maintenance of control state statistics. Our results form additional requirements for the analysis of practical QKD systems based on the COW QKD protocol and its variants by providing an upper bound on the security.
O ct 2 01 3 IPM / P-2013 / 021 Dual 2 d CFT Identification of Extremal Black Rings from Holes

Five dimensional Einstein gravity vacuum solutions in general fall into two classes of black rings with horizon topology S2 × S1, and black holes with horizon topology S3. These solutions are specified by their mass and two spins. There are “overlapping” regions of this parameter space where one has extremal rings and holes of the same spins. We show that for such regions the hole has generically a larger entropy than the ring, and likewise, the central charge of the proposed chiral 2d CFT dual to the hole is larger than that of the ring. For special places of this overlapping region where one of the spins tends to zero, the entropies of the extremal ring and hole also tend to zero and essentially become equal. In this case we are dealing with Extremal Vanishing Horizon (EVH) black holes or rings. The near horizon geometry of the near-EVH hole and rings both contain locally AdS3 throats, providing a basis for the EVH/CFT proposal, a 2d CFT description of the low energy excitations of EVH hole or ring. We argue how the near-EVH hole and near-EVH ring can be distinguished from this dual 2d CFT viewpoint: The hole is a thermal state with zero temperature in the left sector and finite temperature in the right, while the ring is a generic state in the ground state (of the CFT on the plane) in the left sector and a thermal state in the right. The latter is part of the Hilbert space of the 2d CFT obtained in the Discrete Light Cone Quantization (DLCQ). a-ghodsi@ferdowsi.um. ac.ir hanif.golchin@stu-mail.um. ac.ir jabbari@theory.ipm. ac.ir
14th ICCRTS

This paper takes the NATO SAS-050 Approach Space, a widely accepted model of command and control, and gives each of its primary axes a quantitative measure using social network analysis. This means that the actual point in the approach space adopted by real-life command and control organizations can be plotted along with the way in which that point varies over time and function. Part 1 of the paper presents the rationale behind this innovation and how it was subject to verification using theoretical data. Part 2 shows how the enhanced approach space was put to use in the context of a large scale military command post exercise. Agility is represented by the number of distinct areas in the approach space that the organization was able to occupy and there was a marked disparity between where the organization thought it should be and where it actually was, furthermore, agility varied across function. The humans in this particular scenario bestowed upon the organization the levels of agility that were observed, thus the findings are properly considered from a socio-technical perspective.
A Replicated File System for Resource Constrained Mobile Devices

The emergence of more powerful and resourceful mobile devices, as well as new wireless communication technologies, is turning the concept of ad-hoc networking into a viable and promising possibility for ubiquitous information sharing. However, the inherent characteristics of ad-hoc networks bring up new challenges for which most conventional systems don't provide an appropriate response. Namely, the lack of a pre-existing infrastructure, the high topological dynamism of these networks, the relatively low bandwidth of wireless links, as well as the limited storage and energy resources of mobile devices are issues that strongly affect the efficiency of any distributed system intended to provide ubiquitous information sharing. In this paper we describe Haddock-FS, a transparent replicated file system designed to support collaboration in the novel usage scenarios enabled by mobile ad-hoc environments. Haddock-FS is based on a highly available optimistic consistency protocol. In order to support co-present collaborative activities in mobile ad-hoc environments, it provides stronger consistency guarantees during operation within highly connected ad-hoc groups of mobile devices. In order to effectively cope with the network bandwidth and device memory constraints of these environments, Haddock-FS employs a limited size log truncation scheme and a cross-file, cross-version content similarity exploitation mechanism.
Tracking educational progress

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva. nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.
Automated Video Surveillance System for Human Motion Detection

automated video surveillance systems are most useful and important in the security field of today’s world. Video is a base for higher level intelligence applications. Video surveillance is an important security asset to control theft, trespassing or traffic monitoring, banks, department stores, highways, crowded public places and borders. In this thesis, our objective is to design a complete framework able to automatically detect and recognize moving objects in video sequences acquired with a static camera. The aimed practical application for this framework is its use as an automatic intelligent video surveillance system. In video surveillance, detection of moving objects from a video is necessary for object classification, target tracking, activity recognition, as well as behavior understanding. Here so many methods are discussed for background subtraction & motion detection. Al New Proposed method also described here.
A Type Theory for Memory Allocation and Data Layout ( Extended Version ) Leaf

Ordered type theory is an extension of linear type theory in which variables in the context may be neither dropped nor re-ordered. This restriction gives rise to a natural notion of adjacency. We show that a language based on ordered types can use this property to give an exact account of the layout of data in memory. The fuse constructor from ordered logic describes adjacency of values in memory, and the mobility modal describes pointers into the heap. We choose a particular allocation model based on a common implementation scheme for copying garbage collection and show how this permits us to separate out the allocation and initialization of memory locations in such a way as to account for optimizations such as the coalescing of multiple calls to the allocator. This material is based on work supported in part by NSF grants CCR-9984812 and CCR-0121633. Any opinions, findings, and conclusions or recommendations in this publication are those of the authors and do not reflect the views of this agency.
SPARQL basic graph pattern optimization using selectivity estimation

In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the characteristics of heuristics for selectivity-based static BGP optimization. The heuristics range from simple triple pattern variable counting to more sophisticated selectivity estimation techniques. Customized summary statistics for RDF data enable the selectivity estimation of joined triple patterns and the development of efficient heuristics. Using the Lehigh University Benchmark (LUBM), we evaluate the performance of the heuristics for the queries provided by the LUBM and discuss some of them in more details.
Generating Annotations for How-to Videos Using Crowdsourcing

How-to videos can be valuable for learning, but searching for and following along with them can be difficult. Having labeled events such as the tools used in how-to videos could improve video indexing, searching, and browsing. We introduce a crowdsourcing annotation tool for Photoshop how-to videos with a three-stage method that consists of: (1) gathering timestamps of important events, (2) labeling each event, and (3) capturing how each event affects the task of the tutorial. Our ultimate goal is to generalize our method to be applied to other domains of how-to videos. We evaluate our annotation tool with Amazon Mechanical Turk workers to investigate the accuracy, costs, and feasibility of our three-stage method for annotating large numbers of video tutorials. Improvements can be made for stages 1 and 3, but stage 2 produces accurate labels over 90% of the time using majority voting. We have observed that changes in the instructions and interfaces of each task can improve the accuracy of the results significantly. Author
Combinator Parsers in C + + : From Grammar-Flow Analysis to Design Patterns

In this paper we describe the design and implementation of a system for representing context-free grammars in C++. The system allows for grammar representation at the object level, providing enhanced modularity and flexibility when compared to traditional generator-based approaches. We also describe the transformation of grammar flow analysis problems into an object-oriented framework using the Visitor pattern, as well as the implementation of a top-down LL 1 parser. As such, this work represents the synthesis of three presently disparate fields in parser design and implementation: combinator parsing, fixpoint-based grammar flow analysis, and object-oriented design.
Markov Paths on the Poisson – Delaunay Graph with applications to routing in mobile networks

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a planar Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line deenes a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and nd its stationary distribution. As a corollary we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to deene a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routing in mobile communications networks.
Industrial-Driven Big Data as a Self-Service Solution

Abstract: This deliverable reports on the design and approach of the I-BiDaaS batchprocessing module. This report describes the state of the work done in work package 3 from month 12th until month 18th. During these 6 months, we have advanced in the development of both the batch-processing module and the definition and development of the use cases. As part of the batch-processing module we report advances in the Advance Machine Learning submodule, describing our implementation of the Alternating Direction Method of Multipliers optimization, and advances in the technological components of the platform (Hecuba and the Test Data Fabrication tool), that we are leveraging to support the use cases of the project. We also started with the exploration of how our technological component Qbeast can improve the performance of the machine learning algorithms.
Experimental Platform for Studying Distributed Embedded Control Applications

Networked embedded systems are highly distributed systems with limited resources and communication capabilities tightly coupled to physical processes with sensors and actuators. These constraints do not allow the deployment of existing heavyweight middleware layers to support the distributed control algorithms in the different application domains of these systems. The paper describes a simulation framework that enables the timing accurate simulation of these systems including the physical system, the computing nodes and the communication network. The tool serves two distinct purposes by 1) allowing experimentation with different application domains and distributed control algorithms in the presence of communication delays, clock drift and faults and 2) providing a platform for distributed middleware research.
seL4: Formal Veriﬁcation of an OS Kernel

Complete formal veriﬁcation is the only known way to guarantee that a system is free of programming errors. We present our experience in performing the formal, machine-checked veriﬁcation of the seL4 microkernel from an abstract speciﬁcation down to its C implementation. We assume correctness of compiler, assembly code, and hardware, and we used a unique design approach that fuses formal and operating systems techniques. To our knowledge, this is the ﬁrst formal proof of functional correctness of a complete, general-purpose operating-system kernel. Functional correctness means here that the implementation always strictly follows our high-level abstract speciﬁcation of kernel behaviour. This encompasses traditional design and implementation safety properties such as the kernel will never crash, and it will never perform an unsafe operation. It also proves much more: we can predict precisely how the kernel will behave in every possible situation. seL4, a third-generation microkernel of L4 provenance, comprises 8,700 lines of C code and 600 lines of assembler. Its performance is comparable to other high-performance L4 kernels.
Ground Penetrating Radar Evaluation of Concrete Tunnel Linings

Ground penetrating radar was used to map tunnel lining condition and locate concrete deterioration and voids in a continuous and non destructive manner. GPR surveying of Kapoor Water Supply Tunnel, Victoria, Canada was carried out with a 1000 MHz Sensors and Software Ltd., Conquest system mounted on a custom built cart. This 8.8 km long 2.3 m diameter concrete lined circular tunnel was surveyed in both directions in two days. During this time, major anomalies were drilled to verify interpretations of voids behind the liner. The 30 ns time window and 5 cm sampling interval used provided good data quality and allowed speedy data collection. The processed data provided a wealth of information on the condition of the tunnel lining. Five major types of anomalies were identified. These consisted of variations in water content, void spaces, embedded wood, faults and metallic objects. A guide to interpretation of these anomaly types is presented. The 17.58 km of GPR data taken in the tunnel showed that GPR continuously mapped concrete liner thickness, presence of reinforcement and delineated zones where mesh roof supports and construction support timbers are embedded in the liner, as well as the locations and orientations of faults that intersect the tunnel. Minor voids, honeycomb sections and areas of rock-liner separation were also detected. Radar responses to voids, zones of slight liner-rock separation, sharp rock pinnacles and hollows under the liner, and embedded wood all had slightly different characters, but were not always uniquely distinguishable from each other.
Artiﬁcial Intelligence

This paper presents two new search algorithms: Potential Search (PTS) and Anytime Potential Search/Anytime Non-Parametric A ∗ (APTS/ANA ∗ ). Both algorithms are based on a new evaluation function that is easy to implement and does not require user-tuned parameters. PTS is designed to solve bounded-cost search problems, which are problems where the task is to ﬁnd as fast as possible a solution under a given cost bound. APTS/ANA ∗ is a non-parametric anytime search algorithm discovered independently by two research groups via two very different derivations. In this paper, co-authored by researchers from both groups, we present these derivations: as a sequence of calls to PTS and as a non-parametric greedy variant of Anytime Repairing A ∗ . We describe experiments that evaluate the new algorithms in the 15-puzzle, KPP-COM, robot motion planning, gridworld navigation, and multiple sequence alignment search domains. Our results suggest that when compared with previous anytime algorithms, APTS/ANA ∗ : (1) does not require user-set parameters, (2) ﬁnds an initial solution faster, (3) spends less time between solution improvements, (4) decreases the suboptimality bound of the current-best solution more gradually, and (5) converges faster to an optimal solution when reachable.
Can models of agents be transferred between di erent areas ? *

RUTH AYLETT 1 , K ER S T I N DAUTENHAHN 2 , J IM DORAN 3 , M I CHAEL LUCK 4 , S CO T T MO S S 5 and MO SHE T ENNENHOLTZ 6 National Industrial Centre for Virtual Environments, Business House, University of Salford, UK Department of Cybernetics, University of Reading, UK Department of Computer Science, University of Essex, UK Department of Computer Science, University of Warwick, UK Centre for Policy Modelling, Manchester Metropolitan University, UK William Davidson Faculty of Industrial Engineering and Management, Technion±Israel Institute of Technology, Israel
The application of web data mining in personalized learning system

The paper analyzed the present situation of online learning and then described the necessity that carried out personalized online learning services firstly. It constructed a personalized online learning model based on web data mining and described the basic design idea and functions in detail. For the online learning service organization, this model will provide a certain theoretical basic and reference value to build a personalized online learning system.
A Mobile Computing Architecture for Numerical Simulation

The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evolving feature: the resources availability. A feature is often missing: the adaptability. It is not predictable and the adaptable aspect is essential. Without calling into question these implementations of these codes, we create an adaptive use of these implementations. Because the execution has to be driven by the availability of main resources, the components of a numeric computation have to react when their context changes. This paper offers a new architecture, a mobile computing architecture, based on mobile agents and JavaSpace. At the end of this paper, we apply our architecture to several case studies and obtain our first results.
Spin-sensitive interference due to Majorana state on the interface between normal and superconducting leads

We investigate the subgap spectrum and transport properties of the quantum dot on the interface between the metallic and superconducting leads and additionally side-coupled to the edge of the topological superconducting (TS) chain, hosting the Majorana quasiparticle. Due to the chiral nature of the Majorana states only one spin component of the quantum dot electrons (say ↑) is directly affected, however the proximity induced on-dot pairing transmits its influence on the opposite spin as well. We investigate the unique interferometric patterns driven by the Majorana quasiparticle that are different for each spin component. We also address the spin-sensitive interplay with the Kondo effect manifested at the same zero-energy and we come to the conclusion that quantum interferometry can unambiguously identify the Majorana quasiparticle.
Financial Development and Economic Growth : Evidence from Ten New EU Members Guglielmo

Financial Development and Economic Growth: Evidence from Ten New EU Members This paper reviews the main features of the banking and financial sector in ten new EU members, and then examines the relationship between financial development and economic growth in these countries by estimating a dynamic panel model over the period 1994-2007. The evidence suggests that the stock and credit markets are still underdeveloped in these economies, and that their contribution to economic growth is limited owing to a lack of financial depth. By contrast, a more efficient banking sector is found to have accelerated growth. JEL Classification: E44, E58, F36, P26
Mathematical Structures in Computer Science

Intersection type assignment systems can be used as a general framework for building logical models of λ -calculus that allow to reason about the denotation of terms in a ﬁnitary way. We deﬁne essential models (a new class of logical models) through a parametric type assignment system using non-idempotent intersection types. Under an interpretation of terms based on typings instead than the usual one based on types, every suitable instance of the parameters induces a λ -model, whose theory is sensible. We prove that this type assignment system provides a logical description of a family of λ -models arising from a category of sets and relations.