Forest fire detection with a small fixed wing autonomous aerial vehicle

In this work a forest fire detection solution using small autonomous aerial vehicles is proposed. The FALCOS unmanned aerial vehicle developed for remote-monitoring purposes is described. This is a small size UAV with onboard vision processing and autonomous flight capabilities. A set of custom developed navigation sensors was developed for the vehicle. Fire detection is performed through the use of low cost digital cameras and near-infrared sensors. Test results for navigation and ignition detection in real scenario are presented.

New Concepts Towards the Synthesis of Digital Circuits Through Genetic Algorithms

This paper analyses the performance of a Genetic Algorithm using two new concepts, namely a static fitness function including a discontinuity measure and a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. In both cases, experiments reveal superior results in terms of speed and convergence to achieve a solution.

System Modeling and Control Through Fractional-Order Algorithms

The theory of fractional calculus goes back to the beginning of thr throry of differential calculus but its inherent complexity postponed the applications of the associated concepts. In the last decade the progress in the areas of chaos and fractals revealed subtle relationships with the fractional calculus leading to an increasing interest in the development of the new paradigm. In the area of automaticcontrol preliminary work has already been carried out but the proposed algorithms are restricted to the frequency domain. The paper discusses the design of fractional-order discrete-time controllers. The algorithms studied adopt the time domein, which makes them suited for z-transform analusis and discrete-time implementation. The performance of discrete-time fractional-order controllers with linear and non-linear systems is also investigated.

Field experiments for marine casualty detection with autonomous surface vehicles

In this paper we present a set of field tests for detection of human in the water with an unmanned surface vehicle using infrared and color cameras. These experiments aimed to contribute in the development of victim target tracking and obstacle avoidance for unmanned surface vehicles operating in marine search and rescue missions. This research is integrated in the work conducted in the European FP7 research project Icarus aiming to develop robotic tools for large scale rescue operations. The tests consisted in the use of the ROAZ unmanned surface vehicle equipped with a precision GPS system for localization and both visible spectrum and IR cameras to detect the target. In the experimental setup, the test human target was deployed in the water wearing a life vest and a diver suit (thus having lower temperature signature in the body except hands and head) and was equipped with a GPS logger. Multiple target approaches were performed in order to test the system with different sun incidence relative angles. The experimental setup, detection method and preliminary results from the field trials performed in the summer of 2013 in Sesimbra, Portugal and in La Spezia, Italy are also presented in this work.

Thermographic and visible spectrum camera calibration for marine robotic target detection

Oceans - San Diego, 2013

Detection of Arah1 (a major peanut allergen) in food using an electrochemical gold nanoparticle-coated screen-printed immunosensor

A gold nanoparticle-coated screen-printed carbon electrode was used as the transducer in the development of an electrochemical immunosensor for Ara h 1 (a major peanut allergen) detection in food samples. Gold nanoparticles (average diameter=32 nm) were electrochemically generated on the surface of screen-printed carbon electrodes. Two monoclonal antibodies were used in a sandwich-type immunoassay and the antibody–antigen interaction was electrochemically detected through stripping analysis of enzymatically (using alkaline phosphatase) deposited silver. The total time of the optimized immunoassay was 3 h 50 min. The developed immunosensor allowed the quantification of Ara h 1 between 12.6 and 2000 ng/ml, with a limit of detection of 3.8 ng/ml, and provided precise (RSD <8.7%) and accurate (recovery >96.6%) results. The immunosensor was successfully applied to the analysis of complex food matrices (cookies and chocolate), being able to detect Ara h 1 in samples containing 0.1% of peanut.

3D-nanostructured Au electrodes for the event-specific detection of MON810 transgenic maize

In the present work, the development of a genosensor for the event-specific detection of MON810 transgenic maize is proposed. Taking advantage of nanostructuration, a cost-effective three dimensional electrode was fabricated and a ternary monolayer containing a dithiol, a monothiol and the thiolated capture probe was optimized to minimize the unspecific signals. A sandwich format assay was selected as a way of precluding inefficient hybridization associated with stable secondary target structures. A comparison between the analytical performance of the Au nanostructured electrodes and commercially available screen-printed electrodes highlighted the superior performance of the nanostructured ones. Finally, the genosensor was effectively applied to detect the transgenic sequence in real samples, showing its potential for future quantitative analysis.

A potentiometric magnetic immunoassay for rapid detection of Salmonella typhimurium

Potentiometric detection with homemade polymeric membrane microelectrodes was coupled to a magnetic sandwich immunoassay for Salmonella typhimurium determination. Cadmium and sodium ion selective electrodes were used respectively as indicator and pseudo-reference electrodes and were prepared in pipette tips to allow potentiometric measurements in microliter sample volumes. In the proposed method, the concentration of S. typhimurium was proportional to the amount of cadmium released upon dissolution of a CdS nanoparticle labeled to the secondary detection antibody. The limit of detection was 2 cells per 100 μL. The immunomagnetic assay with potentiometric detection is suitable for sensitive and rapid (average total time per assay of 75 minutes) detection of S. typhimurium in milk samples. The proposed method is easy to perform, safe, sensitive, and low cost and has potential for in situ analysis.

Molecularly imprinted electrochemical sensor for ochratoxin A detection in food samples

A novel electrochemical sensor for ochratoxin A (OTA) detection was fabricated through the modification of a glassy carbon electrode (GCE) with multiwalled carbon nanotubes (MWCNTs) and a molecularly imprinted polymer (MIP). The MWCNTs dramatically promoted the sensitivity of the developed sensor, while polypyrrole (PPy) imprinted with OTA served as the selective recognition element. The imprinted PPy film was prepared by electropolymerization of pyrrole in the presence of OTA as a template molecule via cyclic voltammetry (CV). The electrochemical oxidation of OTA at the developed sensor was investigated by CV and differential pulse voltammetry (DPV). The developed MIP/MWCNT/GCE sensor showed a linear relationship, when using DPV, between peak current intensity and OTA concentration in the range between 0.050 and 1.0 μM, with limits of detection (LOD) and quantification of 0.0041 μM (1.7 μg/L) and 0.014 μM (5.7 μg/L) respectively. With the developed sensor precise results were obtained; relative standard deviations of 4.2% and 7.5% in the evaluation of the repeatability and reproducibility, respectively. The MIP/MWCNT/GCE sensor is simple to fabricate and easy to use and was successfully applied to the determination of OTA in spiked beer and wine samples, with recoveries between 84 and 104%, without the need of a sample pre-treatment step.

Detection of the peanut allergen Ara h 6 in foodstuffs using a voltammetric biosensing approach

A voltammetric biosensor for Ara h 6 (a peanut allergen) detection in food samples was developed. Gold nanoparticle-modified screen-printed carbon electrodes were used to develop a sandwich-type immunoassay using two-monoclonal antibodies. The antibody-antigen interaction was detected through the electrochemical detection of enzymatically deposited silver. The immunosensor presented a linear range between 1 and 100 ng/ml, as well as high precision (inter-day RSD ≤9.8 %) and accuracy (recoveries ≥96.7 %). The detection and quantification limits were 0.27 and 0.88 ng/ml, respectively. It was possible to detect small levels of Ara h 6 in complex food matrices.

Molecularly imprinted sensor for voltammetric detection of norfloxacin

In this work, a norfloxacin selective modified glassy carbon electrode (GCE) based on a molecularly imprinted polymer (MIP) as electrochemical sensor was developed. A suspension of multi-walled carbon nanotubes (MWCNTs) was deposited on the electrode surface. Subsequently, a molecularly imprinted film was prepared by electropolymerization, via cyclic voltammetry of pyrrole (PPy) in the presence of norfloxacin (NFX) as the template molecule. A control electrode (NIP) was also prepared. Scanning electron microscopy (SEM) and cyclic voltammetry in a ferrocyanide solution were performed for morphological and electrochemical characterisation, respectively. Several experimental parameters were studied and optimised. For quantification purposes the MIP/MWCNT/GCE was immersed in NFX solutions for 10 min, and the detection was performed in voltammetric cell by square wave voltammetry. The proposed sensor presented a linear behaviour, between peak current intensity and logarithmic concentration of NFX between 1 × 10−7 and 8 × 10−6 M. The obtained results presented good precision, with a repeatability of 4.3% and reproducibility of 9% and the detection limit was 4.6 × 10−8 M (S/N = 3). The developed sensor displayed good selectivity and operational lifetime, is simple to fabricate and easy to operate and was successfully applied to the analysis of NFX in urine samples.

Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.

SHõWA: A Self-healing Framework for Web-based Applications

The complexity of systems is considered an obstacle to the progress of the IT industry. Autonomic computing is presented as the alternative to cope with the growing complexity. It is a holistic approach, in which the systems are able to configure, heal, optimize, and protect by themselves. Web-based applications are an example of systems where the complexity is high. The number of components, their interoperability, and workload variations are factors that may lead to performance failures or unavailability scenarios. The occurrence of these scenarios affects the revenue and reputation of businesses that rely on these types of applications. In this article, we present a self-healing framework for Web-based applications (SHõWA). SHõWA is composed by several modules, which monitor the application, analyze the data to detect and pinpoint anomalies, and execute recovery actions autonomously. The monitoring is done by a small aspect-oriented programming agent. This agent does not require changes to the application source code and includes adaptive and selective algorithms to regulate the level of monitoring. The anomalies are detected and pinpointed by means of statistical correlation. The data analysis detects changes in the server response time and analyzes if those changes are correlated with the workload or are due to a performance anomaly. In the presence of per- formance anomalies, the data analysis pinpoints the anomaly. Upon the pinpointing of anomalies, SHõWA executes a recovery procedure. We also present a study about the detection and localization of anomalies, the accuracy of the data analysis, and the performance impact induced by SHõWA. Two benchmarking applications, exercised through dynamic workloads, and different types of anomaly were considered in the study. The results reveal that (1) the capacity of SHõWA to detect and pinpoint anomalies while the number of end users affected is low; (2) SHõWA was able to detect anomalies without raising any false alarm; and (3) SHõWA does not induce a significant performance overhead (throughput was affected in less than 1%, and the response time delay was no more than 2 milliseconds).

Real-time Task-Splitting scheduling algorithms framework

Nos dias de hoje, os sistemas de tempo real crescem em importância e complexidade. Mediante a passagem do ambiente uniprocessador para multiprocessador, o trabalho realizado no primeiro não é completamente aplicável no segundo, dado que o nível de complexidade difere, principalmente devido à existência de múltiplos processadores no sistema. Cedo percebeu-se, que a complexidade do problema não cresce linearmente com a adição destes. Na verdade, esta complexidade apresenta-se como uma barreira ao avanço científico nesta área que, para já, se mantém desconhecida, e isto testemunha-se, essencialmente no caso de escalonamento de tarefas. A passagem para este novo ambiente, quer se trate de sistemas de tempo real ou não, promete gerar a oportunidade de realizar trabalho que no primeiro caso nunca seria possível, criando assim, novas garantias de desempenho, menos gastos monetários e menores consumos de energia. Este último fator, apresentou-se desde cedo, como, talvez, a maior barreira de desenvolvimento de novos processadores na área uniprocessador, dado que, à medida que novos eram lançados para o mercado, ao mesmo tempo que ofereciam maior performance, foram levando ao conhecimento de um limite de geração de calor que obrigou ao surgimento da área multiprocessador. No futuro, espera-se que o número de processadores num determinado chip venha a aumentar, e como é óbvio, novas técnicas de exploração das suas inerentes vantagens têm de ser desenvolvidas, e a área relacionada com os algoritmos de escalonamento não é exceção. Ao longo dos anos, diferentes categorias de algoritmos multiprocessador para dar resposta a este problema têm vindo a ser desenvolvidos, destacando-se principalmente estes: globais, particionados e semi-particionados. A perspectiva global, supõe a existência de uma fila global que é acessível por todos os processadores disponíveis. Este fato torna disponível a migração de tarefas, isto é, é possível parar a execução de uma tarefa e resumir a sua execução num processador distinto. Num dado instante, num grupo de tarefas, m, as tarefas de maior prioridade são selecionadas para execução. Este tipo promete limites de utilização altos, a custo elevado de preempções/migrações de tarefas. Em contraste, os algoritmos particionados, colocam as tarefas em partições, e estas, são atribuídas a um dos processadores disponíveis, isto é, para cada processador, é atribuída uma partição. Por essa razão, a migração de tarefas não é possível, acabando por fazer com que o limite de utilização não seja tão alto quando comparado com o caso anterior, mas o número de preempções de tarefas decresce significativamente. O esquema semi-particionado, é uma resposta de caráter hibrido entre os casos anteriores, pois existem tarefas que são particionadas, para serem executadas exclusivamente por um grupo de processadores, e outras que são atribuídas a apenas um processador. Com isto, resulta uma solução que é capaz de distribuir o trabalho a ser realizado de uma forma mais eficiente e balanceada. Infelizmente, para todos estes casos, existe uma discrepância entre a teoria e a prática, pois acaba-se por se assumir conceitos que não são aplicáveis na vida real. Para dar resposta a este problema, é necessário implementar estes algoritmos de escalonamento em sistemas operativos reais e averiguar a sua aplicabilidade, para caso isso não aconteça, as alterações necessárias sejam feitas, quer a nível teórico quer a nível prá

Multicore Scheduling of Real-Time Irregular Parallel Algorithms in Linux

Face à estagnação da tecnologia uniprocessador registada na passada década, aos principais fabricantes de microprocessadores encontraram na tecnologia multi-core a resposta `as crescentes necessidades de processamento do mercado. Durante anos, os desenvolvedores de software viram as suas aplicações acompanhar os ganhos de performance conferidos por cada nova geração de processadores sequenciais, mas `a medida que a capacidade de processamento escala em função do número de processadores, a computação sequencial tem de ser decomposta em várias partes concorrentes que possam executar em paralelo, para que possam utilizar as unidades de processamento adicionais e completar mais rapidamente. A programação paralela implica um paradigma completamente distinto da programação sequencial. Ao contrário dos computadores sequenciais tipificados no modelo de Von Neumann, a heterogeneidade de arquiteturas paralelas requer modelos de programação paralela que abstraiam os programadores dos detalhes da arquitectura e simplifiquem o desenvolvimento de aplicações concorrentes. Os modelos de programação paralela mais populares incitam os programadores a identificar instruções concorrentes na sua lógica de programação, e a especificá-las sob a forma de tarefas que possam ser atribuídas a processadores distintos para executarem em simultâneo. Estas tarefas são tipicamente lançadas durante a execução, e atribuídas aos processadores pelo motor de execução subjacente. Como os requisitos de processamento costumam ser variáveis, e não são conhecidos a priori, o mapeamento de tarefas para processadores tem de ser determinado dinamicamente, em resposta a alterações imprevisíveis dos requisitos de execução. `A medida que o volume da computação cresce, torna-se cada vez menos viável garantir as suas restrições temporais em plataformas uniprocessador. Enquanto os sistemas de tempo real se começam a adaptar ao paradigma de computação paralela, há uma crescente aposta em integrar execuções de tempo real com aplicações interativas no mesmo hardware, num mundo em que a tecnologia se torna cada vez mais pequena, leve, ubíqua, e portável. Esta integração requer soluções de escalonamento que simultaneamente garantam os requisitos temporais das tarefas de tempo real e mantenham um nível aceitável de QoS para as restantes execuções. Para tal, torna-se imperativo que as aplicações de tempo real paralelizem, de forma a minimizar os seus tempos de resposta e maximizar a utilização dos recursos de processamento. Isto introduz uma nova dimensão ao problema do escalonamento, que tem de responder de forma correcta a novos requisitos de execução imprevisíveis e rapidamente conjeturar o mapeamento de tarefas que melhor beneficie os critérios de performance do sistema. A técnica de escalonamento baseado em servidores permite reservar uma fração da capacidade de processamento para a execução de tarefas de tempo real, e assegurar que os efeitos de latência na sua execução não afectam as reservas estipuladas para outras execuções. No caso de tarefas escalonadas pelo tempo de execução máximo, ou tarefas com tempos de execução variáveis, torna-se provável que a largura de banda estipulada não seja consumida por completo. Para melhorar a utilização do sistema, os algoritmos de partilha de largura de banda (capacity-sharing) doam a capacidade não utilizada para a execução de outras tarefas, mantendo as garantias de isolamento entre servidores. Com eficiência comprovada em termos de espaço, tempo, e comunicação, o mecanismo de work-stealing tem vindo a ganhar popularidade como metodologia para o escalonamento de tarefas com paralelismo dinâmico e irregular. O algoritmo p-CSWS combina escalonamento baseado em servidores com capacity-sharing e work-stealing para cobrir as necessidades de escalonamento dos sistemas abertos de tempo real. Enquanto o escalonamento em servidores permite partilhar os recursos de processamento sem interferências a nível dos atrasos, uma nova política de work-stealing que opera sobre o mecanismo de capacity-sharing aplica uma exploração de paralelismo que melhora os tempos de resposta das aplicações e melhora a utilização do sistema. Esta tese propõe uma implementação do algoritmo p-CSWS para o Linux. Em concordância com a estrutura modular do escalonador do Linux, ´e definida uma nova classe de escalonamento que visa avaliar a aplicabilidade da heurística p-CSWS em circunstâncias reais. Ultrapassados os obstáculos intrínsecos `a programação da kernel do Linux, os extensos testes experimentais provam que o p-CSWS ´e mais do que um conceito teórico atrativo, e que a exploração heurística de paralelismo proposta pelo algoritmo beneficia os tempos de resposta das aplicações de tempo real, bem como a performance e eficiência da plataforma multiprocessador.