6,321 research outputs found
Recommended from our members
Use of colour for hand-filled form analysis and recognition
Colour information in form analysis is currently under utilised. As technology has advanced and computing costs have reduced, the processing of forms in colour has now become practicable. This paper describes a novel colour-based approach to the extraction of filled data from colour form images. Images are first quantised to reduce the colour complexity and data is extracted by examining the colour characteristics of the images. The improved performance of the proposed method has been verified by comparing the processing time, recognition rate, extraction precision and recall rate to that of an equivalent black and white system
The VIMOS Public Extragalactic Redshift Survey (VIPERS): PCA-based automatic cleaning and reconstruction of survey spectra
Identifying spurious reduction artefacts in galaxy spectra is a challenge for
large surveys. We present an algorithm for identifying and repairing residual
spurious features in sky-subtracted galaxy spectra with application to the
VIPERS survey. The algorithm uses principal component analysis (PCA) applied to
the galaxy spectra in the observed frame to identify sky line residuals
imprinted at characteristic wavelengths. We further model the galaxy spectra in
the rest-frame using PCA to estimate the most probable continuum in the
corrupted spectral regions, which are then repaired. We apply the method to
90,000 spectra from the VIPERS survey and compare the results with a subset
where careful editing was performed by hand. We find that the automatic
technique does an extremely good job in reproducing the time-consuming manual
cleaning and does it in a uniform and objective manner across a large data
sample. The mask data products produced in this work are released together with
the VIPERS second public data release (PDR-2).Comment: Find the VIPERS data release at http://vipers.inaf.i
Algebraic Curves and Cryptographic Protocols for the e-society
Amb l'augment permanent de l'adopció de sistemes intel·ligents de tot tipus en la societat actual apareixen nous reptes. Avui en dia quasi tothom en la societat moderna porta a sobre almenys un telèfon intel·ligent, si no és que porta encara més dispositius capaços d'obtenir dades personals, com podria ser un smartwatch per exemple. De manera similar, prà cticament totes les cases tindran un comptador intel·ligent en el futur pròxim per a fer un seguiment del consum d'energia. També s'espera que molts més dispositius del Internet de les Coses siguin instal·lats de manera ubiqua, recol·lectant informació dels seus voltants i/o realitzant accions, com per exemple en sistemes d'automatització de la llar, estacions meteorològiques o dispositius per la ciutat intel·ligent en general. Tots aquests dispositius i sistemes necessiten enviar dades de manera segura i confidencial, les quals poden contindre informació sensible o de caire privat. A més a més, donat el seu rà pid creixement, amb més de nou mil milions de dispositius en tot el món actualment, s'ha de tenir en compte la quantitat de dades que cal transmetre.
En aquesta tesi mostrem la utilitat de les corbes algebraiques sobre cossos finits en criptosistemes de clau pĂşblica, en particular la de les corbes de gènere 2, ja que ofereixen la mida de clau mĂ©s petita per a un nivell de seguretat donat i això redueix de manera significativa el cost total de comunicacions d'un sistema, a la vegada que mantĂ© un rendiment raonable. Analitzem com la valoraciĂł 2-Ă dica del cardinal de la Jacobiana augmenta en successives extensions quadrĂ tiques, considerant corbes de gènere 2 en cossos de caracterĂstica senar, incloent les supersingulars. A mĂ©s, millorem els algoritmes actuals per a computar la meitat d'un divisor d'una corba de gènere 2 sobre un cos binari, cosa que pot ser Ăştil en la multiplicaciĂł escalar, que Ă©s l'operaciĂł principal en criptografia de clau pĂşblica amb corbes.
Pel que fa a la privacitat, presentem un sistema de pagament d'aparcament per mòbil que permet als conductors pagar per aparcar mantenint la seva privacitat, i per tant impedint que el proveĂŻdor del servei o un atacant obtinguin un perfil de conducta d'aparcament. Finalment, oferim protocols de smart metering millorats, especialment pel que fa a la privacitat i evitant l'Ăşs de terceres parts de confiança.Con el aumento permanente de la adopciĂłn de sistemas inteligentes de todo tipo en la sociedad actual aparecen nuevos retos. Hoy en dĂa prácticamente todos en la sociedad moderna llevamos encima al menos un telĂ©fono inteligente, si no es que llevamos más dispositivos capaces de obtener datos personales, como podrĂa ser un smartwatch por ejemplo. De manera similar, en el futuro cercano la mayorĂa de las casas tendrán un contador inteligente para hacer un seguimiento del consumo de energĂa. TambiĂ©n se espera que muchos más dispositivos del Internet de las Cosas sean instalados de manera ubicua, recolectando informaciĂłn de sus alrededores y/o realizando acciones, como por ejemplo en sistemas de automatizaciĂłn del hogar, estaciones meteorolĂłgicas o dispositivos para la ciudad inteligente en general. Todos estos dispositivos y sistemas necesitan enviar datos de manera segura y confidencial, los cuales pueden contener informaciĂłn sensible o de ámbito personal. Además, dado su rápido crecimiento, con más de nueve mil millones de dispositivos en todo el mundo actualmente, hay que tener en cuenta la cantidad de datos a transmitir.
En esta tesis mostreamos la utilidad de las curvas algebraicas sobre cuerpos finitos en criptosistemas de clave pĂşblica, en particular la de las curvas de gĂ©nero 2, ya que ofrecen el tamaño de clave más pequeño para un nivel de seguridad dado y esto disminuye de manera significativa el coste total de comunicaciones del sistema, a la vez que mantiene un rendimiento razonable. Analizamos como la valoraciĂłn 2-ádica del cardinal de la Jacobiana aumenta en sucesivas extensiones cuadráticas, considerando curvas de gĂ©nero 2 en cuerpos de caracterĂstica importa, incluyendo las supersingulares. Además, mejoramos los algoritmos actuales para computar la mitad de un divisor de una curva de gĂ©nero 2 sobre un cuerpo binario, lo cual puede ser Ăştil en la multiplicaciĂłn escalar, que es la operaciĂłn principal en criptografĂa de clave pĂşblica con curvas.
Respecto a la privacidad, presentamos un sistema de pago de aparcamiento por mĂłvil que permite a los conductores pagar para aparcar manteniendo su privacidad, y por lo tanto impidiendo que el proveedor del servicio o un atacante obtengan un perfil de conducta de aparcamiento. Finalmente, ofrecemos protocolos de smart metering mejorados, especialmente en lo relativo a la privacidad y evitando el uso de terceras partes de confianza.With the ever increasing adoption of smart systems of every kind throughout society, new challenges arise. Nowadays, almost everyone in modern societies carries a smartphone at least, if not even more devices than can also gather personal data, like a smartwatch or a fitness wristband for example. Similarly, practically all homes will have a smart meter in the near future for billing and energy consumption monitoring, and many other Internet of Things devices are expected to be installed ubiquitously, obtaining information of their surroundings and/or performing some action, like for example, home automation systems, weather detection stations or devices for the smart city in general. All these devices and systems need to securely and privately transmit some data, which can be sensitive and personal information. Moreover, with a rapid increase of their number, with already more than nine billion devices worldwide, the amount of data to be transmitted has to be considered.
In this thesis we show the utility of algebraic curves over finite fields in public key cryptosystems, specially genus 2 curves, since they offer the minimum key size for a given security level and that significantly reduces the total communication costs of a system, while maintaining a reasonable performance. We analyze how the 2-adic valuation of the cardinality of the Jacobian increases in successive quadratic extensions, considering genus 2 curves with odd characteristic fields, including supersingular curves. In addition, we improve the current algorithms for computing the halving of a divisor of a genus 2 curve over binary fields, which can be useful in scalar multiplication, the main operation in public key cryptography using curves.
As regards to privacy, we present a pay-by-phone parking system which enables drivers to pay for public parking while preserving their privacy, and thus impeding the service provider or an attacker to obtain a profile of parking behaviors. Finally, we offer better protocols for smart metering, especially regarding privacy and the avoidance of trusted third parties
An attribute-based framework for secure communications in vehicular ad hoc networks
In this paper, we introduce an attribute-based framework to achieve secure communications in vehicular ad hoc networks (VANETs), which enjoys several advantageous features. The proposed framework employs attribute-based signature (ABS) to achieve message authentication and integrity and protect vehicle privacy, which greatly mitigates the overhead caused by pseudonym/private key change or update in the existing solutions for VANETs based on symmetric key, asymmetric key, and identity-based cryptography and group signature. In addition, we extend a standard ABS scheme with traceability and revocation mechanisms and seamlessly integrate them into the proposed framework to support vehicle traceability and revocation by a trusted authority, and thus, the resulting scheme for vehicular communications does not suffer from the anonymity misuse issue, which has been a challenge for anonymous credential-based vehicular protocols. Finally, we implement the proposed ABS scheme using a rapid prototyping tool called Charm to evaluate its performance
Leak localization in water distribution networks using a mixed model-based/data-driven approach
“The final publication is available at Springer via http://dx.doi.org/10.1016/j.conengprac.2016.07.006”This paper proposes a new method for leak localization in water distribution networks (WDNs). In a first stage, residuals are obtained by comparing pressure measurements with the estimations provided by a WDN model. In a second stage, a classifier is applied to the residuals with the aim of determining the leak location. The classifier is trained with data generated by simulation of the WDN under different leak scenarios and uncertainty conditions. The proposed method is tested both by using synthetic and experimental data with real WDNs of different sizes. The comparison with the current existing approaches shows a performance improvement.Peer ReviewedPostprint (author's final draft
mRUBiS: An Exemplar for Model-Based Architectural Self-Healing and Self-Optimization
Self-adaptive software systems are often structured into an adaptation engine
that manages an adaptable software by operating on a runtime model that
represents the architecture of the software (model-based architectural
self-adaptation). Despite the popularity of such approaches, existing exemplars
provide application programming interfaces but no runtime model to develop
adaptation engines. Consequently, there does not exist any exemplar that
supports developing, evaluating, and comparing model-based self-adaptation off
the shelf. Therefore, we present mRUBiS, an extensible exemplar for model-based
architectural self-healing and self-optimization. mRUBiS simulates the
adaptable software and therefore provides and maintains an architectural
runtime model of the software, which can be directly used by adaptation engines
to realize and perform self-adaptation. Particularly, mRUBiS supports injecting
issues into the model, which should be handled by self-adaptation, and
validating the model to assess the self-adaptation. Finally, mRUBiS allows
developers to explore variants of adaptation engines (e.g., event-driven
self-adaptation) and to evaluate the effectiveness, efficiency, and scalability
of the engines
Extracting and Cleaning RDF Data
The RDF data model has become a prevalent format to represent heterogeneous data because of its versatility. The capability of dismantling information from its native formats and representing it in triple format offers a simple yet powerful way of modelling data that is obtained from multiple sources. In addition, the triple format and schema constraints of the RDF model make the RDF data easy to process as labeled, directed graphs.
This graph representation of RDF data supports higher-level analytics by enabling querying using different techniques and querying languages, e.g., SPARQL. Anlaytics that require structured data are supported by transforming the graph data on-the-fly to populate the target schema that is needed for downstream analysis. These target schemas are defined by downstream applications according to their information need.
The flexibility of RDF data brings two main challenges. First, the extraction of RDF data is a complex task that may involve domain expertise about the information required to be extracted for different applications. Another significant aspect of analyzing RDF data is its quality, which depends on multiple factors including the reliability of data sources and the accuracy of the extraction systems. The quality of the analysis depends mainly on the quality of the underlying data. Therefore, evaluating and improving the quality of RDF data has a direct effect on the correctness of downstream analytics.
This work presents multiple approaches related to the extraction and quality evaluation of RDF data. To cope with the large amounts of data that needs to be extracted, we present DSTLR, a scalable framework to extract RDF triples from semi-structured and unstructured data sources. For rare entities that fall on the long tail of information, there may not be enough signals to support high-confidence extraction. Towards this problem, we present an approach to estimate property values for long tail entities. We also present multiple algorithms and approaches that focus on the quality of RDF data. These include discovering quality constraints from RDF data, and utilizing machine learning techniques to repair errors in RDF data
A trust supportive framework for pervasive computing systems
Recent years have witnessed the emergence and rapid growth of pervasive comput- ing technologies such as mobile ad hoc networks, radio frequency identification (RFID), Wi-Fi etc. Many researches are proposed to provide services while hiding the comput- ing systems into the background environment. Trust is of critical importance to protect service integrity & availability as well as user privacies. In our research, we design a trust- supportive framework for heterogeneous pervasive devices to collaborate with high security confidence while vanishing the details to the background. We design the overall system ar- chitecture and investigate its components and their relations, then we jump into details of the critical components such as authentication and/or identification and trust management. With our trust-supportive framework, the pervasive computing system can have low-cost, privacy-friendly and secure environment for its vast amount of services
- …