Potencialidade do tratamento eletroquímico oxidativo associado à adsorção para remediação de corantes têxteis

This study aimed to evaluate the potential of oxidative electrochemical treatment coupled with adsorption process using expanded perlite as adsorbent in the removal of textile dyes, Red Remazol and Novacron Blue on synthetic effluent. Dyes and perlite were characterized by thermogravimetry techniques (TG), Differential Scanning Calorimetry (DSC), Spectroscopy infrared (IR), Scanning Electron Microscopy (SEM), X-ray diffraction (XRD) and X-ray fluorescence (XRF) techniques. Electrochemical treatments used as anodes, Ti/Pt and Pb/PbO2 under different conditions: 60 minutes, current density 20, 40 e 60 mAcm-2, pH 1, 4.5 e 8 and temperature variation 20, 40 e 60 ºC. In the case of adsorption tests, contact time of 30 minutes for the Remazol Red dye and 20 minutes for Novacron Blue were established, while pH 1, 4.5 e 8, 500 mg adsorbent and temperature variation 20, 40 e 60 ºC were used for both treatments. The results indicated that both treatments, electroxidation/adsorption and the adsorption/electroxidation, were effective for removing color from synthetic solutions. The consumption of electricity allowed to evaluate the applicability of the electrochemical process, providing very acceptable values, which allowed us to estimate the cost. Total organic carbon (TOC) and Gas Chromatography linked mass spectrometer (GC-MS) analyzes were performed, showing that the better combination for removing organic matter is by Pb/PbO2 and perlite. Meanwhile, GC-MS indicated that the by-products formed are benzoic acid, phthalic acid, thiocarbamic acid, benzene, chlorobenzene, phenol-2-ethyl and naphthalene when Remazol Red was degraded. Conversely, aniline, phthalic acid, 1, 6 - dimethylnaphthalene, naphthalene and ion hidroxobenzenosulfonat was detected when Novacron Blue was studied. Analyses obtained through atomic absorption spectrometry showed that there was release of lead in the electrochemical oxidation of analyzes that were performed with the anode Pb/PbO2, but these values are reduced by subjecting the effluent to adsorption analysis. According to these results, sequential techniques electroxidation/adsorption and adsorption/electroxidation are to treat solutions containing dyes.

Potencialidade do tratamento eletroquímico oxidativo associado à adsorção para remediação de corantes têxteis

This study aimed to evaluate the potential of oxidative electrochemical treatment coupled with adsorption process using expanded perlite as adsorbent in the removal of textile dyes, Red Remazol and Novacron Blue on synthetic effluent. Dyes and perlite were characterized by thermogravimetry techniques (TG), Differential Scanning Calorimetry (DSC), Spectroscopy infrared (IR), Scanning Electron Microscopy (SEM), X-ray diffraction (XRD) and X-ray fluorescence (XRF) techniques. Electrochemical treatments used as anodes, Ti/Pt and Pb/PbO2 under different conditions: 60 minutes, current density 20, 40 e 60 mAcm-2, pH 1, 4.5 e 8 and temperature variation 20, 40 e 60 ºC. In the case of adsorption tests, contact time of 30 minutes for the Remazol Red dye and 20 minutes for Novacron Blue were established, while pH 1, 4.5 e 8, 500 mg adsorbent and temperature variation 20, 40 e 60 ºC were used for both treatments. The results indicated that both treatments, electroxidation/adsorption and the adsorption/electroxidation, were effective for removing color from synthetic solutions. The consumption of electricity allowed to evaluate the applicability of the electrochemical process, providing very acceptable values, which allowed us to estimate the cost. Total organic carbon (TOC) and Gas Chromatography linked mass spectrometer (GC-MS) analyzes were performed, showing that the better combination for removing organic matter is by Pb/PbO2 and perlite. Meanwhile, GC-MS indicated that the by-products formed are benzoic acid, phthalic acid, thiocarbamic acid, benzene, chlorobenzene, phenol-2-ethyl and naphthalene when Remazol Red was degraded. Conversely, aniline, phthalic acid, 1, 6 - dimethylnaphthalene, naphthalene and ion hidroxobenzenosulfonat was detected when Novacron Blue was studied. Analyses obtained through atomic absorption spectrometry showed that there was release of lead in the electrochemical oxidation of analyzes that were performed with the anode Pb/PbO2, but these values are reduced by subjecting the effluent to adsorption analysis. According to these results, sequential techniques electroxidation/adsorption and adsorption/electroxidation are to treat solutions containing dyes.

Frases magnéticas, polaritons magnéticos e modos magnetostáticos em filmes e cristais magnônicos de terras-raras

Conselho Nacional de Desenvolvimento Científico e Tecnológico - CNPq

Frases magnéticas, polaritons magnéticos e modos magnetostáticos em filmes e cristais magnônicos de terras-raras

Conselho Nacional de Desenvolvimento Científico e Tecnológico - CNPq

Ordenamento de cargas e propriedades magnéticas de ortoferritas de lantânio dopadas com estrôncio

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Ordenamento de cargas e propriedades magnéticas de ortoferritas de lantânio dopadas com estrôncio

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

SLA-Based Guidelines for Database Transitioning

Component-based Software Engineering (CBSE) and Service-Oriented Architecture (SOA) became popular ways to develop software over the last years. During the life-cycle of a software system, several components and services can be developed, evolved and replaced. In production environments, the replacement of core components, such as databases, is often a risky and delicate operation, where several factors and stakeholders should be considered. Service Level Agreement (SLA), according to ITILv3’s official glossary, is “an agreement between an IT service provider and a customer. The agreement consists on a set of measurable constraints that a service provider must guarantee to its customers.”. In practical terms, SLA is a document that a service provider delivers to its consumers with minimum quality of service (QoS) metrics.This work is intended to assesses and improve the use of SLAs to guide the transitioning process of databases on production environments. In particular, in this work we propose SLA-Based Guidelines/Process to support migrations from a relational database management system (RDBMS) to a NoSQL one. Our study is validated by case studies.

Controle de mobilidade infraestruturado e orientado à qualidade para maximização de admissões em sistemas WiNeMO: uma abordagem definida por software

The spread of wireless networks and growing proliferation of mobile devices require the development of mobility control mechanisms to support the different demands of traffic in different network conditions. A major obstacle to developing this kind of technology is the complexity involved in handling all the information about the large number of Moving Objects (MO), as well as the entire signaling overhead required to manage these procedures in the network. Despite several initiatives have been proposed by the scientific community to address this issue they have not proved to be effective since they depend on the particular request of the MO that is responsible for triggering the mobility process. Moreover, they are often only guided by wireless medium statistics, such as Received Signal Strength Indicator (RSSI) of the candidate Point of Attachment (PoA). Thus, this work seeks to develop, evaluate and validate a sophisticated communication infrastructure for Wireless Networking for Moving Objects (WiNeMO) systems by making use of the flexibility provided by the Software-Defined Networking (SDN) paradigm, where network functions are easily and efficiently deployed by integrating OpenFlow and IEEE 802.21 standards. For purposes of benchmarking, the analysis was conducted in the control and data planes aspects, which demonstrate that the proposal significantly outperforms typical IPbased SDN and QoS-enabled capabilities, by allowing the network to handle the multimedia traffic with optimal Quality of Service (QoS) transport and acceptable Quality of Experience (QoE) over time.

Investigações sobre técnicas de arquivamento para otimizadores multiobjetivo

Multi-objective problems may have many optimal solutions, which together form the Pareto optimal set. A class of heuristic algorithms for those problems, in this work called optimizers, produces approximations of this optimal set. The approximation set kept by the optmizer may be limited or unlimited. The benefit of using an unlimited archive is to guarantee that all the nondominated solutions generated in the process will be saved. However, due to the large number of solutions that can be generated, to keep an archive and compare frequently new solutions to the stored ones may demand a high computational cost. The alternative is to use a limited archive. The problem that emerges from this situation is the need of discarding nondominated solutions when the archive is full. Some techniques were proposed to handle this problem, but investigations show that none of them can surely prevent the deterioration of the archives. This work investigates a technique to be used together with the previously proposed ideas in the literature to deal with limited archives. The technique consists on keeping discarded solutions in a secondary archive, and periodically recycle these solutions, bringing them back to the optimization. Three methods of recycling are presented. In order to verify if these ideas are capable to improve the archive content during the optimization, they were implemented together with other techniques from the literature. An computational experiment with NSGA-II, SPEA2, PAES, MOEA/D and NSGA-III algorithms, applied to many classes of problems is presented. The potential and the difficulties of the proposed techniques are evaluated based on statistical tests.

Investigações sobre técnicas de arquivamento para otimizadores multiobjetivo

Multi-objective problems may have many optimal solutions, which together form the Pareto optimal set. A class of heuristic algorithms for those problems, in this work called optimizers, produces approximations of this optimal set. The approximation set kept by the optmizer may be limited or unlimited. The benefit of using an unlimited archive is to guarantee that all the nondominated solutions generated in the process will be saved. However, due to the large number of solutions that can be generated, to keep an archive and compare frequently new solutions to the stored ones may demand a high computational cost. The alternative is to use a limited archive. The problem that emerges from this situation is the need of discarding nondominated solutions when the archive is full. Some techniques were proposed to handle this problem, but investigations show that none of them can surely prevent the deterioration of the archives. This work investigates a technique to be used together with the previously proposed ideas in the literature to deal with limited archives. The technique consists on keeping discarded solutions in a secondary archive, and periodically recycle these solutions, bringing them back to the optimization. Three methods of recycling are presented. In order to verify if these ideas are capable to improve the archive content during the optimization, they were implemented together with other techniques from the literature. An computational experiment with NSGA-II, SPEA2, PAES, MOEA/D and NSGA-III algorithms, applied to many classes of problems is presented. The potential and the difficulties of the proposed techniques are evaluated based on statistical tests.

Uma proposta de solução para funcionamento offline em aplicações android

Given the growing demand for the development of mobile applications, driven by use increasingly common in smartphones and tablets grew in society the need for remote data access in full in the use of mobile application without connectivity environments where there is no provision network access at all times. Given this reality, this work proposes a framework that present main functions are the provision of a persistence mechanism, replication and data synchronization, contemplating the creation, deletion, update and display persisted or requested data, even though the mobile device without connectivity with the network. From the point of view of the architecture and programming practices, it reflected in defining strategies for the main functions of the framework are met. Through a controlled study was to validate the solution proposal, being found as the gains in reducing the number of lines code and the amount of time required to perform the development of an application without there being significant increase for the operations.

Uma proposta de solução para funcionamento offline em aplicações android

Given the growing demand for the development of mobile applications, driven by use increasingly common in smartphones and tablets grew in society the need for remote data access in full in the use of mobile application without connectivity environments where there is no provision network access at all times. Given this reality, this work proposes a framework that present main functions are the provision of a persistence mechanism, replication and data synchronization, contemplating the creation, deletion, update and display persisted or requested data, even though the mobile device without connectivity with the network. From the point of view of the architecture and programming practices, it reflected in defining strategies for the main functions of the framework are met. Through a controlled study was to validate the solution proposal, being found as the gains in reducing the number of lines code and the amount of time required to perform the development of an application without there being significant increase for the operations.

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum Spanning Tree problem in which, beyond linear costs associated to each edge, quadratic costs associated to each pair of edges must be considered. The quadratic costs are due to interaction costs between the edges. When interactions occur between adjacent edges only, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). Both QMST and AQMST are NP-hard and model a number of real world applications involving infrastructure networks design. Linear and quadratic costs are summed in the mono-objective versions of the problems. However, real world applications often deal with conflicting objectives. In those cases, considering linear and quadratic costs separately is more appropriate and multi-objective optimization provides a more realistic modelling. Exact and heuristic algorithms are investigated in this work for the Bi-objective Adjacent Only Quadratic Spanning Tree Problem. The following techniques are proposed: backtracking, branch-and-bound, Pareto Local Search, Greedy Randomized Adaptive Search Procedure, Simulated Annealing, NSGA-II, Transgenetic Algorithm, Particle Swarm Optimization and a hybridization of the Transgenetic Algorithm with the MOEA-D technique. Pareto compliant quality indicators are used to compare the algorithms on a set of benchmark instances proposed in literature.

A probabilistic analysis of the biometrics menagerie existence: case study in fingerprint data

Until recently the use of biometrics was restricted to high-security environments and criminal identification applications, for economic and technological reasons. However, in recent years, biometric authentication has become part of daily lives of people. The large scale use of biometrics has shown that users within the system may have different degrees of accuracy. Some people may have trouble authenticating, while others may be particularly vulnerable to imitation. Recent studies have investigated and identified these types of users, giving them the names of animals: Sheep, Goats, Lambs, Wolves, Doves, Chameleons, Worms and Phantoms. The aim of this study is to evaluate the existence of these users types in a database of fingerprints and propose a new way of investigating them, based on the performance of verification between subjects samples. Once introduced some basic concepts in biometrics and fingerprint, we present the biometric menagerie and how to evaluate them.