RonPub -- Research Online Publishing
Not a member yet
199 research outputs found
Sort by
Provenance Management over Linked Data Streams
Provenance describes how results are produced starting from data sources, curation, recovery, intermediate processing, to the final results. Provenance has been applied to solve many problems and in particular to understand how errors are propagated in large-scale environments such as Internet of Things, Smart Cities. In fact, in such environments operations on data are often performed by multiple uncoordinated parties, each potentially introducing or propagating errors. These errors cause uncertainty of the overall data analytics process that is further amplified when many data sources are combined and errors get propagated across multiple parties. The ability to properly identify how such errors influence the results is crucial to assess the quality of the results. This problem becomes even more challenging in the case of Linked Data Streams, where data is dynamic and often incomplete. In this paper, we introduce methods to compute provenance over Linked Data Streams. More specifically, we propose provenance management techniques to compute provenance of continuous queries executed over complete Linked Data streams. Unlike traditional provenance management techniques, which are applied on static data, we focus strictly on the dynamicity and heterogeneity of Linked Data streams. Specifically, in this paper we describe: i) means to deliver a dynamic provenance trace of the results to the user, ii) a system capable to execute queries over dynamic Linked Data and compute provenance of these queries, and iii) an empirical evaluation of our approach using real-world datasets
Semantic Caching Framework: An FPGA-Based Application for IoT Security Monitoring
Security monitoring is one subdomain of cybersecurity which aims to guarantee the safety of systems, continuously monitoring unusual events. The development of Internet Of Things leads to huge amounts of information, being heterogeneous and requiring to be efficiently managed. Cloud Computing provides software and hardware resources for large scale data management. However, performances for sequences of on-line queries on long term historical data may be not compatible with the emergency security monitoring. This work aims to address this problem by proposing a semantic caching framework and its application to acceleration hardware with FPGA for fast- and accurate-enough logs processing for various data stores and execution engines
Dynamic Allocation of Smart City Applications
Cities around the world are evaluating the potential of Internet of Things (IoT) to automate and optimize public services. Cities that implement this approach are commonly referred to as smart cities. A smart city IoT architecture needs to be layered and scalable in order to fulfill not only today's but also future needs of smart cities. Network Function Virtualization (NFV) provides the scale and flexibility necessary for smart city services by enabling the automated control, management and orchestration of network resources. In this paper we consider a scalable, layered, NFV based smart city architecture and discuss the optimal location of applications regarding cloud computing and mobile edge computing (MEC). Introducing a novel concept of dynamic application allocation we show how to fully benefit from MEC and present relevant decision criteria
Techniques for the Generation of Arbitrary Three-Dimensional Shapes in Tile-Based Self-Assembly Systems
A big challenge in nanorobotics is the construction of nanoscale objects. DNA is a bio-compatible tool to reliably and constructively create objects at the nanoscale. A possible tool to build nano-sized structures are tile-based self-assembly systems on the basis of DNA. It is challenging and time-consuming to efficiently design blueprints for the desired objects. This paper presents basic algorithms for the creation of tilesets for nxnxn-cubes in the aTAM model. Only few publications focus on three-dimensional DNA crystals. Three-dimensional shapes are likely to be of more use in nanorobotics. We present three variations: hollow cubes, cube-grids and filled cubes. The paper also presents a basic algorithm to create arbitrary, finite, connected, three-dimensional and predefined shapes at temperature 1, as well as ideas for more efficient algorithms. Among those are algorithms for spheres, ellipsoids, red blood cells and other promising designs. The algorithms and tilesets are tested/verified using a software that has been developed for the purpose of verifying three-dimensional sets of tiletypes and was influenced by the tool ISU TAS. Others can use the simulator and the algorithms to quickly create sets of tiletypes for their desired nanostructures. A long learning process may thus be omitted
Effectiveness of NoSQL and NewSQL Databases in Mobile Network Event Data: Cassandra and ParStream/Kinetic
Continuously growing amount of data has inspired seeking more and more efficient database solutions for storing and manipulating data. In big data sets, NoSQL databases have been established as alternatives for traditional SQL databases. The effectiveness of these databases has been widely tested, but the tests focused only on key-value data that is structurally very simple. Many application domains, such as telecommunication, involve more complex data structures. Huge amount of Mobile Network Event (MNE) data is produced by an increasing number of mobile and ubiquitous applications. MNE data is structurally predetermined and typically contains a large number of columns. Applications that handle MNE data are usually insert intensive, as a huge amount of data are generated during rush hours. NoSQL provides high scalability and its column family stores suits MNE data well, but NoSQL does not support ACID features of the traditional relational databases. NewSQL is a new kind of databases, which provide the high scalability of NoSQL while still maintaining ACID guarantees of the traditional DBMS. In the paper, we evaluation NEM data storing and aggregating efficiency of Cassandra and ParStream/Kinetic databases and aim to find out whether the new kind of database technology can clearly bring performance advantages over legacy database technology and offers an alternative to existing solutions. Among the column family stores of NoSQL, Cassandra is especially a good choice for insert intensive applications due to its way to handle data insertions. ParStream is a novel and advanced NewSQL like database and is recently integrated into Cisco Kinetic. The results of the evaluation show that ParStream is much faster than Cassandra when storing and aggregating MNE data and the NewSQL is a very strong alternative to existing database solutions for insert intensive applications
Software-Defined Wireless Sensor Networks Approach: Southbound Protocol and Its Performance Evaluation
Software Defined Networking (SDN) has been identified as a promising network paradigm for Wireless Sensor Networks (WSN) and the Internet of Things. It is a key tool for enabling Sensing as a Service, which provides infrastructure sharing thus reducing operational costs. While a few proposals on SDN southbound protocols designed for WSN are found in the literature, they lack adequate performance analysis. In this paper, we review ITSDN main features and present a performance evaluation with all the sensing nodes transmitting data periodically. We conducted a number of experiments varying the number of nodes and assessing the impact of flow table maximum capacity. We assessed the metrics of data delivery, data delay, control overhead and energy consumption in order to show the tradeoffs of using IT-SDN in comparison to the IETF RPL routing protocol. We discuss the main challenges still faced by IT-SDN in larger WSN, and how they could be addressed to make IT-SDN use worthwhile
Cloud-Scale Entity Resolution: Current State and Open Challenges
Entity resolution (ER) is a process to identify records in information systems, which refer to the same real-world entity. Because in the two recent decades the data volume has grown so large, parallel techniques are called upon to satisfy the ER requirements of high performance and scalability. The development of parallel ER has reached a relatively prosperous stage, and has found its way into several applications. In this work, we first comprehensively survey the state of the art of parallel ER approaches. From the comprehensive overview, we then extract the classification criteria of parallel ER, classify and compare these approaches based on these criteria. Finally, we identify open research questions and challenges and discuss potential solutions and further research potentials in this field
Sparse and Dense Linear Algebra for Machine Learning on Parallel-RDBMS Using SQL
While computational modelling gets more complex and more accurate, its calculation costs have been increasing alike. However, working on big data environments usually involves several steps of massive unfiltered data transmission. In this paper, we continue our work on the PArADISE framework, which enables privacy aware distributed computation of big data scenarios, and present a study on how linear algebra operations can be calculated over parallel relational database systems using SQL. We investigate the ways to improve the computation performance of algebra operations over relational databases and show how using database techniques impacts the computation performance like the use of indexes, choice of schema, query formulation and others. We study the dense and sparse problems of linear algebra over relational databases and show that especially sparse problems can be efficiently computed using SQL. Furthermore, we present a simple but universal technique to improve intra-operator parallelism for linear algebra operations in order to support the parallel computation of big data
Service-Relationship Programming Framework for the Social IoT
We argue that for a true realization of innovative programming opportunities for smart spaces, the developers should be equipped with informative tools that assist them in building domain-related applications. Such tools should utilize the services offered by the space's smart things and consider the different relationships that may tie these services opportunistically to build applications. In this paper, we utilize our Inter-thing relationships programming framework to present a distributed programming ecosystem. The framework broadens the restricted set of thing-level relationships of the evolving social IoT paradigm with a set of service-level relationships. Such relationships provide guidance into how services belonging to different things can be combined to build meaningful applications. We also present a uniform way of describing the thing services and the service-level relationships along with new capabilities for the things to dynamically generate their own services, formulate the corresponding programmable interfaces (APIs) and create an ad-hoc network of socially related smart things at runtime. We then present the semantic rules that guide the establishment of IoT applications and finally demonstrate the features of the framework through a proof-of-concept application
A Survey of the Ability of the Linux Operating System to Support Online Game Execution
Linux has suffered sluggish home user uptake due mainly to the dominance of rivals, and has seen numerous incarnations as a gaming platform fall flat. Gaming is a particularly sensitive application given its intensive bandwidth and system response requirements; these applications therefore place specific demands on the Operating System platform on which game play is supported. In this work, the ability of the Linux operating system to support execution of online games is explored through a survey of the state-of-the-art in this area. Given the recent increase in cloud-based online gaming, it can be concluded that the time is ripe for more widespread Linux uptake, especially in the gaming domain. This is particularly true today given the amount of exposure to Information Technology across society in general, and ongoing deployment of Internet of Things environments: Linux's open source, modular and freely customisable design may therefore not be as daunting as before, and the unique benefits of this platform may be exploited for the experiences it can bring to applications in general and, specific to the context of this work, players in their game play. This paper makes a unique contribution to the field: Although a number of articles are available within the general area of Linux and gameplay, a thorough survey on this issue has not been seen so far. This is therefore the gap to which this paper contributes