A web service-based Grid Portal for Edgebreaker compression
Methods of Information in Medicine
In health applications, and elsewhere, 3D data sets are increasingly accessed through the Interne... more In health applications, and elsewhere, 3D data sets are increasingly accessed through the Internet. To reduce the transfer time while maintaining an unaltered 3D model, adequate compression and decompression techniques are needed. Recently, Grid technologies have been integrated with Web Services technologies to provide a framework for interoperable application-to-application interaction. The paper describes an implementation of the Edgebreaker compression technique exploiting web services technology and presents a novel approach for using such services in a Grid Portal. The Grid portal, developed at the CACT/ISUFI of the University of Lecce, allows the processing and delivery of biomedical images (CT--computerized tomography--and MRI--magnetic resonance images) in a distributed environment, using the power and security of computational Grids. The Edgebreaker Compression Web Service has been deployed on a Grid portal and allows compressing and decompressing 3D data sets using the Globus toolkit GSI (Globus Security Infrastructure) protocol. Moreover, the classical algorithm has been modified extending the compression to files containing more than one object. An implementation of the Edgebreaker compression technique and related experimental results are presented. A novel approach for using the compression web service in a Grid portal allowing storing and preprocessing of huge 3D data sets, and subsequent efficient transmission of results for remote visualization is also described.
A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
Information Sciences, 2016
ABSTRACT We present a message-passing based parallel version of the Space Saving algorithm to sol... more ABSTRACT We present a message-passing based parallel version of the Space Saving algorithm to solve the k--majority problem. The algorithm determines in parallel frequent items, i.e., those whose multiplicity is greater than a given threshold, and is therefore useful for iceberg queries and many other different contexts. We apply our algorithm to the detection of frequent items in streams of data whose probability distribution function are respectively a Riemann--Hurwitz and a Zipf distribution, and compare it with regard to parallel performances and accuracy against a parallel version of a recently proposed algorithm for merging datasets processed sequentially by the Space Saving or Frequent algorithms.
This paper describes the evolution of the main services of the ProGenGrid (Proteomics & Genomics ... more This paper describes the evolution of the main services of the ProGenGrid (Proteomics & Genomics Grid) system, a distributed and ubiquitous grid environment ("virtual laboratory"), based on Workflow and supporting the design, execution and monitoring of "in silico" experiments in bioinformatics.ProGenGrid is a Grid-based Problem Solving Environment that allows the composition of data sources and bioinformatics programs wrapped as Web Services (WS). The use of WS provides ease of use and fosters re-use. The resulting workflow of WS is then scheduled on the Grid, leveraging Grid-middleware services. In particular, ProGenGrid offers a modular bag of services and currently is focused on the biological simulation of two important bioinformatics problems: prediction of the secondary structure of proteins, and sequence alignment of proteins. Both services are based on an enhanced data access service.
IEEE Transactions on Dependable and Secure Computing, 2015
The access control problem in a hierarchy can be solved by using a hierarchical key assignment sc... more The access control problem in a hierarchy can be solved by using a hierarchical key assignment scheme, where each class is assigned an encryption key and some private information. A formal security analysis for hierarchical key assignment schemes has been traditionally considered in two different settings, i.e., the unconditionally secure and the computationally secure setting, and with respect to two different notions: security against key recovery (KR-security) and security with respect to key indistinguishability (KI-security), with the latter notion being cryptographically stronger. Recently, Freire, Paterson and Poettering proposed strong key indistinguishability (SKI-security) as a new security notion in the computationally secure setting, arguing that SKI-security is strictly stronger than KI-security in such a setting. In this paper we consider the unconditionally secure setting for hierarchical key assignment schemes. In such a setting the security of the schemes is not based on specific unproven computational assumptions, i.e., it relies on the theoretical impossibility of breaking them, despite the computational power of an adversary coalition. We prove that, in this setting, SKI-security is not stronger than KI-security, i.e., the two notions are fully equivalent from an information-theoretic point of view.
International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, 2005
... 73100 Lecce Italy ) Institute of Atmospheric Sciences and Climate of the Italian National... more ... 73100 Lecce Italy ) Institute of Atmospheric Sciences and Climate of the Italian National Research Council via per Monteroni, 73100 Lecce Italy {giovanni.aloisio, massimo.cafaro, dario.conte, sandro.fiore, italo.epicoco, gianpaolo.marra ... [25] Liping Di, Aijun Chen ...
Chapman & Hall/CRC Computer & Information Science Series, 2007
Page 1. CHAPMAN & HALL/CRC COMPUTER and INFORMATION SCIENCE SERIES ^^^^^ w^^ P^? Computing in... more Page 1. CHAPMAN & HALL/CRC COMPUTER and INFORMATION SCIENCE SERIES ^^^^^ w^^ P^? Computing in Remote Sensing Edited by Antonio J. Plaza Chein-I Chang ^ 1| Chapman & Hall/CRC MM Taylor & Francis Group Page 2. ...
Studies in health technology and informatics, 2007
This paper describes the evolution of the main services of the ProGenGrid (Proteomics & Genomics ... more This paper describes the evolution of the main services of the ProGenGrid (Proteomics & Genomics Grid) system, a distributed and ubiquitous grid environment ("virtual laboratory"), based on Workflow and supporting the design, execution and monitoring of "in silico" experiments in bioinformatics.ProGenGrid is a Grid-based Problem Solving Environment that allows the composition of data sources and bioinformatics programs wrapped as Web Services (WS). The use of WS provides ease of use and fosters re-use. The resulting workflow of WS is then scheduled on the Grid, leveraging Grid-middleware services. In particular, ProGenGrid offers a modular bag of services and currently is focused on the biological simulation of two important bioinformatics problems: prediction of the secondary structure of proteins, and sequence alignment of proteins. Both services are based on an enhanced data access service.
ProGenGrid: a grid-enabled platform for bioinformatics
Studies in health technology and informatics, 2005
In this paper we describe the ProGenGrid (Proteomics and Genomics Grid) system, developed at the ... more In this paper we describe the ProGenGrid (Proteomics and Genomics Grid) system, developed at the CACT/ISUFI of the University of Lecce which aims at providing a virtual laboratory where e-scientists can simulate biological experiments, composing existing analysis and visualization tools, monitoring their execution, storing the intermediate and final output and finally, if needed, saving the model of the experiment for updating or reproducing it. The tools that we are considering are software components wrapped as Web Services and composed through a workflow. Since bioinformatics applications need to use high performance machines or a high number of workstations to reduce the computational time, we are exploiting a Grid infrastructure for interconnecting wide-spread tools and hardware resources. As an example, we are considering some algorithms and tools needed for drug design, providing them as services, through easy to use interfaces such as the Web and Web service interfaces built...
We present a message-passing based parallel version of the Space Saving algorithm designed to sol... more We present a message-passing based parallel version of the Space Saving algorithm designed to solve the k-majority problem. The algorithm determines in parallel frequent items, i.e., those whose frequency is greater than a given threshold, and is therefore useful for iceberg queries and many other different contexts. We apply our algorithm to the detection of frequent items in both real and synthetic datasets whose probability distribution functions are a Hurwitz and a Zipf distribution respectively. Also, we compare its parallel performances and accuracy against a parallel algorithm recently proposed for merging summaries derived by the Space Saving or Frequent algorithms.
Preserving data confidentiality in clouds is a key issue. Secret Sharing, a cryptographic primiti... more Preserving data confidentiality in clouds is a key issue. Secret Sharing, a cryptographic primitive for the distribution of a secret among a group of n participants designed so that only subsets of shareholders of cardinality 0 < t ≤ n are allowed to reconstruct the secret by pooling their shares, can help mitigating and minimizing the problem. A desirable feature of Secret Sharing schemes is cheater detection, i.e. the ability to detect one or more malicious shareholders trying to reconstruct the secret by obtaining legal shares from the other shareholders while providing them with fake shares. Verifiable Secret Sharing schemes solve this problem by allowing shareholders verifying the others' shares. We present new verification algorithms providing arbitrary secret sharing schemes with cheater detection capabilities, and prove their space efficiency with regard to other schemes appeared in the literature. We also introduce, in one of our schemes, the Exponentiating Polynomial Root Problem (EPRP), which is believed to be NP-Intermediate and therefore difficult.
Uploads
Papers by Massimo Cafaro