Approaches to the storage of low use and last copy research materials

Accepted ManuscriptPublishe

Detection of fast radio transients with multiple stations: a case study using the Very Long Baseline Array

Recent investigations reveal an important new class of transient radio phenomena that occur on sub-millisecond timescales. Often transient surveys' data volumes are too large to archive exhaustively. Instead, an on-line automatic system must excise impulsive interference and detect candidate events in real-time. This work presents a case study using data from multiple geographically distributed stations to perform simultaneous interference excision and transient detection. We present several algorithms that incorporate dedispersed data from multiple sites, and report experiments with a commensal real-time transient detection system on the Very Long Baseline Array (VLBA). We test the system using observations of pulsar B0329+54. The multiple-station algorithms enhanced sensitivity for detection of individual pulses. These strategies could improve detection performance for a future generation of geographically distributed arrays such as the Australian Square Kilometre Array Pathfinder and the Square Kilometre Array.Comment: 12 pages, 14 figures. Accepted for Ap

Statistics in the Big Data era

It is estimated that about 90% of the currently available data have been produced over the last two years. Of these, only 0.5% is effectively analysed and used. However, this data can be a great wealth, the oil of 21st century, when analysed with the right approach. In this article, we illustrate some specificities of these data and the great interest that they can represent in many fields. Then we consider some challenges to statistical analysis that emerge from their analysis, suggesting some strategies

On the integration of model-based feature information in Product Lifecycle Management systems

[EN] As CAD models continue to become more critical information sources in the product's lifecycle, it is necessary to develop efficient mechanisms to store, retrieve, and manage larger volumes of increasingly complex data. Because of their unique characteristics, 3D annotations can be used to embed design and manufacturing information directly into a CAD model, which makes models effective vehicles to describe aspects of the geometry or provide additional information that can be connected to a particular geometric element. However, access to this information is often limited, difficult, and even unavailable to external applications. As model complexity and volume of information continue to increase, new and more powerful methods to interrogate these annotations are needed. In this paper, we demonstrate how 3D annotations can be effectively structured and integrated into a Product Lifecycle Management (PLM) system to provide a cohesive view of product-related information in a design environment. We present a strategy to organize and manage annotation information which is stored internally in a CAD model, and make it fully available through the PLM. Our method involves a dual representation of 3D annotations with enhanced data structures that provides shared and easy access to the information. We describe the architecture of a system which includes a software component for the CAD environment and a module that integrates with the PLM server. We validate our approach through a software prototype that uses a parametric modeling application and two commercial PLM packages with distinct data models.This work was supported by the Spanish Ministry of Economy and Competitiveness and the FEDER Funds, through the ANNOTA project (Ref. TIN2013-46036-C3-1-R).Camba, J.; Contero, M.; Company, P.; Pérez Lopez, DC. (2017). On the integration of model-based feature information in Product Lifecycle Management systems. International Journal of Information Management. 37(6):611-621. https://doi.org/10.1016/j.ijinfomgt.2017.06.002S61162137

Information Systems: Secure Access and Storage in the Age of Cloud Computing

Given that cloud computing is a remotely accessed service, the connection between provider and customer needs to be adequately protected against all known security risks. In order to ensure this, an open and clear specification of all standards, algorithms and security protocols adopted by the cloud provider is required. In this paper, we review current issues concerned with security threats to cloud computing and present a solution based on our unique patented compression-encryption method. The method provides highly efficient data compression where a unique symmetric key is generated as part of the compression process and is dependent on the characteristics of the data. Without the key, the data cannot be decompressed. We focus on threat prevention by cryptography that, if properly implemented, is virtually impossible to break directly. Our security by design is based on two principles: first, defence in depth, where our proposed design is such that more than one subsystem needs to be violated to get both the data and their key. Second, the principle of least privilege, where the attacker may gain access to only part of a system. The paper highlights the benefits of the solution that include high compression ratios, less bandwidth requirements, faster data transmission and response times, less storage space, and less energy consumption among others

Electronic resource discovery systems: from user behaviour to design.

Information seeking is a central part of academic development for both students and researchers. However, this is often hindered by complex and highly complicated electronic resource discovery systems. One approach to improving these resources is to understand the difficulties and likely causes of problems when using current systems and how people develop their searching, retrieval and storage strategies. These might provide useful information about the requirements for future design. In this paper we present our findings from UBiRD, a project investigating user search behaviour in electronic resource discovery systems based on a qualitative study of 34 users from three UK universities. We then describe how the information gathered during the study helped inform the design of INVISQUE, a novel non-conventional interface for searching and querying on-line scholarly information. In addition, the theories and design principles used during the INVISQUE design are discussed

GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams

We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join (GDJ) an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations (at both long and short time scales), which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques