19 resultados para SUPPORTING ELECTROLYTE
em Instituto Politécnico do Porto, Portugal
Resumo:
The immobilization and electro-oxidation of guanine and adenine asDNA bases on glassy carbon electrode are evaluated by square wave voltammetric analysis. The influence of electrochemical pretreatments, nature of supporting electrolyte, pH, accumulation time and composition of DNA nucleotides on the immobilization effect and the electrochemical mechanism are discussed. Trace levels of either guanine or adenine can be readily detected following short accumulation time with detection limits of 35 and 40 ngmL−1 for guanine and adenine, respectively. The biosensors of guanine and adenine were employed for the voltammetric detection of antioxidant capacity in flavored water samples. The method relies on monitoring the changes of the intrinsic anodic response of the surface-confined guanine and adenine species, resulting from its interaction with free radicals from Fenton-type reaction in absence and presence of antioxidant. Ascorbic acid was used as standard to evaluate antioxidant capacities of samples. Analytical data was compared with that of FRAP method.
Resumo:
The electroactivity of butylate (BTL) is studied by cyclic voltammetry (CV) and square wave voltammetry (SWV) at a glassy carbon electrode (GCE) and a hanging mercury drop electrode (HMDE). Britton–Robinson buffer solutions of pH 1.9–11.5 are used as supporting electrolyte. CV voltammograms using GCE show a single anodic peak regarding the oxidation of BTL at +1.7V versus AgCl/ Ag, an irreversible process controlled by diffusion. Using a HMDE, a single cathodic peak is observed, at 1.0V versus AgCl/Ag. The reduction of BTL is irreversible and controlled by adsorption. Mechanism proposals are presented for these redox transformations. Optimisation is carried out univaryingly. Linearity ranges were 0.10–0.50 mmol L-1 and 2.0–9.0 µmolL-1 for anodic and cathodic peaks, respectively. The proposed method is applied to the determination of BTL in waters. Analytical results compare well with those obtained by an HPLC method.
Resumo:
An adsorptive stripping voltammetric procedure for the determination of the antidepressant venlafaxine in urine using a mercury film microelectrode wasdeveloped. The method is based on controlled adsorptive accumulation of the drug at the potential of 1.00V (vs. Ag/AgCl) in the presence of 1.25 x10 -2 molL- 1 borate buffer (pH 8.7). Urine samples were analyzed directly after performing a ten-fold dilution with the supporting electrolyte but without other pretreatment. The limit of detection obtained for a 30 s collection time was 0.693x 10- 6 mol L -1. Recovery experimentsgave good results at the 10 -6 mol L- 1 level (bias less 5% were obtained).
Resumo:
An extraction-adsorptive stripping voltammetric procedure for the determination of the pesticide dialifos in soil samples using microwave-assisted solvent extraction and a mercury film ultramicroelectrode was developed. The method is based on the use of hexane-acetone solvent (1:1, v/v) and on controlled adsorptive accumulation of the insecticide at the potential of -0.10V (versus Ag/AgCl) in the presence of Britton-Robinson buffer (pH 2.0). Soil sample extracts were analyzed directly after drying and redissolution with the supporting electrolyte, but without other pretreatment. The limit of detection obtained for a 10sec collection time was 2.0x10-8 mol L-1. Recovery experiments for the global procedure, at the 0.100µgg-1 level, gave satisfactory average and standard deviation results for the two different soils tested.
Resumo:
An extraction-anodic adsorptive stripping voltammetric procedure using microwave-assisted solvent extraction and a gold ultramicroelectrode was developed for determining the pesticide ametryn in soil samples. The method is based on the use of acetonitrile as extraction solvent and on controlled adsorptive accumulation of the herbicide at the potential of 0.50 V (vs. Ag/AgCl) in the presence of Britton-Robinson buffer (pH 3.3). Soil sample extracts were analysed directly after drying and redissolution with the supporting electrolyte but without other pre-treatment. The limit of detection obtained for a 10 s collection time was 0.021 µg g-1. Recovery experiments for the global procedure, at the 0.500 µg g-1 level, gave satisfactory mean and standard deviation results which were comparable to those obtained by HPLC with UV detection.
Resumo:
The oxidative behaviour of fluoxetine was studied at a glassy carbon electrode in various buffer systems and at different pH using cyclic, differential pulse and square wave voltammetry. A new square wave voltammetric method suitable for the quality control of fluoxetine in commercial formulations has been developed using a borate pH 9 buffer solution as supporting electrolyte. Under optimized conditions, a linear response was obtained in the range 10 to 16 μM with a detection limit of 1.0 μM. Validation parameters such as sensitivity, precision and accuracy were evaluated. The proposed method was successfully applied to the determination of fluoxetine in pharmaceutical formulations. The results were statistically compared with those obtained by the reference high-performance liquid chromatographic method. No significant differences were found between the methods.
Resumo:
The idiomatic expression “In Rome be a Roman” can be applied to leadership training and development as well. Leaders who can act as role models inspire other future leaders in their behaviour, attitudes and ways of thinking. Based on two examples of current leaders in the fields of Politics and Public Administration, I support the idea that exposure to role models during their training was decisive for their career paths and current activities as prominent characters in their profession. Issues such as how students should be prepared for community or national leadership as well as cross-cultural engagement are raised here. The hypothesis of transculturalism and cross-cultural commitment as a factor of leadership is presented. Based on current literature on Leadership as well as the presented case studies, I expect to raise a debate focusing on strategies for improving leaders’ training in their cross-cultural awareness.
Resumo:
Os sistemas de tempo real modernos geram, cada vez mais, cargas computacionais pesadas e dinâmicas, começando-se a tornar pouco expectável que sejam implementados em sistemas uniprocessador. Na verdade, a mudança de sistemas com um único processador para sistemas multi- processador pode ser vista, tanto no domínio geral, como no de sistemas embebidos, como uma forma eficiente, em termos energéticos, de melhorar a performance das aplicações. Simultaneamente, a proliferação das plataformas multi-processador transformaram a programação paralela num tópico de elevado interesse, levando o paralelismo dinâmico a ganhar rapidamente popularidade como um modelo de programação. A ideia, por detrás deste modelo, é encorajar os programadores a exporem todas as oportunidades de paralelismo através da simples indicação de potenciais regiões paralelas dentro das aplicações. Todas estas anotações são encaradas pelo sistema unicamente como sugestões, podendo estas serem ignoradas e substituídas, por construtores sequenciais equivalentes, pela própria linguagem. Assim, o modo como a computação é na realidade subdividida, e mapeada nos vários processadores, é da responsabilidade do compilador e do sistema computacional subjacente. Ao retirar este fardo do programador, a complexidade da programação é consideravelmente reduzida, o que normalmente se traduz num aumento de produtividade. Todavia, se o mecanismo de escalonamento subjacente não for simples e rápido, de modo a manter o overhead geral em níveis reduzidos, os benefícios da geração de um paralelismo com uma granularidade tão fina serão meramente hipotéticos. Nesta perspetiva de escalonamento, os algoritmos que empregam uma política de workstealing são cada vez mais populares, com uma eficiência comprovada em termos de tempo, espaço e necessidades de comunicação. Contudo, estes algoritmos não contemplam restrições temporais, nem outra qualquer forma de atribuição de prioridades às tarefas, o que impossibilita que sejam diretamente aplicados a sistemas de tempo real. Além disso, são tradicionalmente implementados no runtime da linguagem, criando assim um sistema de escalonamento com dois níveis, onde a previsibilidade, essencial a um sistema de tempo real, não pode ser assegurada. Nesta tese, é descrita a forma como a abordagem de work-stealing pode ser resenhada para cumprir os requisitos de tempo real, mantendo, ao mesmo tempo, os seus princípios fundamentais que tão bons resultados têm demonstrado. Muito resumidamente, a única fila de gestão de processos convencional (deque) é substituída por uma fila de deques, ordenada de forma crescente por prioridade das tarefas. De seguida, aplicamos por cima o conhecido algoritmo de escalonamento dinâmico G-EDF, misturamos as regras de ambos, e assim nasce a nossa proposta: o algoritmo de escalonamento RTWS. Tirando partido da modularidade oferecida pelo escalonador do Linux, o RTWS é adicionado como uma nova classe de escalonamento, de forma a avaliar na prática se o algoritmo proposto é viável, ou seja, se garante a eficiência e escalonabilidade desejadas. Modificar o núcleo do Linux é uma tarefa complicada, devido à complexidade das suas funções internas e às fortes interdependências entre os vários subsistemas. Não obstante, um dos objetivos desta tese era ter a certeza que o RTWS é mais do que um conceito interessante. Assim, uma parte significativa deste documento é dedicada à discussão sobre a implementação do RTWS e à exposição de situações problemáticas, muitas delas não consideradas em teoria, como é o caso do desfasamento entre vários mecanismo de sincronização. Os resultados experimentais mostram que o RTWS, em comparação com outro trabalho prático de escalonamento dinâmico de tarefas com restrições temporais, reduz significativamente o overhead de escalonamento através de um controlo de migrações, e mudanças de contexto, eficiente e escalável (pelo menos até 8 CPUs), ao mesmo tempo que alcança um bom balanceamento dinâmico da carga do sistema, até mesmo de uma forma não custosa. Contudo, durante a avaliação realizada foi detetada uma falha na implementação do RTWS, pela forma como facilmente desiste de roubar trabalho, o que origina períodos de inatividade, no CPU em questão, quando a utilização geral do sistema é baixa. Embora o trabalho realizado se tenha focado em manter o custo de escalonamento baixo e em alcançar boa localidade dos dados, a escalonabilidade do sistema nunca foi negligenciada. Na verdade, o algoritmo de escalonamento proposto provou ser bastante robusto, não falhando qualquer meta temporal nas experiências realizadas. Portanto, podemos afirmar que alguma inversão de prioridades, causada pela sub-política de roubo BAS, não compromete os objetivos de escalonabilidade, e até ajuda a reduzir a contenção nas estruturas de dados. Mesmo assim, o RTWS também suporta uma sub-política de roubo determinística: PAS. A avaliação experimental, porém, não ajudou a ter uma noção clara do impacto de uma e de outra. No entanto, de uma maneira geral, podemos concluir que o RTWS é uma solução promissora para um escalonamento eficiente de tarefas paralelas com restrições temporais.
Resumo:
With the advent of Web 2.0, new kinds of tools became available, which are not seen as novel anymore but are widely used. For instance, according to Eurostat data, in 2010 32% of individuals aged 16 to 74 used the Internet to post messages to social media sites or instant messaging tools, ranging from 17% in Romania to 46% in Sweden (Eurostat, 2012). Web 2.0 applications have been used in technology-enhanced learning environments. Learning 2.0 is a concept that has been used to describe the use of social media for learning. Many Learning 2.0 initiatives have been launched by educational and training institutions in Europe. Web 2.0 applications have also been used for informal learning. Web 2.0 tools can be used in classrooms, virtual or not, not only to engage students but also to support collaborative activities. Many of these tools allow users to use tags to organize resources and facilitate their retrieval at a later date or time. The aim of this chapter is to describe how tagging has been used in systems that support formal or informal learning and to summarize the functionalities that are common to these systems. In addition, common and unusual tagging applications that have been used in some Learning Objects Repositories are analysed.
Resumo:
The development of new products or processes involves the creation, re-creation and integration of conceptual models from the related scientific and technical domains. Particularly, in the context of collaborative networks of organisations (CNO) (e.g. a multi-partner, international project) such developments can be seriously hindered by conceptual misunderstandings and misalignments, resulting from participants with different backgrounds or organisational cultures, for example. The research described in this article addresses this problem by proposing a method and the tools to support the collaborative development of shared conceptualisations in the context of a collaborative network of organisations. The theoretical model is based on a socio-semantic perspective, while the method is inspired by the conceptual integration theory from the cognitive semantics field. The modelling environment is built upon a semantic wiki platform. The majority of the article is devoted to developing an informal ontology in the context of a European R&D project, studied using action research. The case study results validated the logical structure of the method and showed the utility of the method.
Resumo:
In this paper we describe how to integrate Internet Protocols (IP) into a typical hierarchical master-slave fieldbus network, supporting a logical ring token passing mechanism between master stations. The integration of the TCP/IP protocols in the fieldbus protocol rises a number of issues that must be addressed properly. In this paper we particularly address the issues related to the conveyance of IP fragments in fieldbus frames (fragmentation/de-fragmentation) and on how to support the symmetry inherent to the TCP/IP protocols in fieldbus slaves, which lack communication initiative.
Resumo:
Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.
Resumo:
Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.
Resumo:
This poster abstract presents smart-HOP, a reliable handoff mechanism for mobility support in Wireless Sensor Networks (WSNs). This technique relies on a fuzzy logic approach applied at two levels: the link quality estimation level and the access point selection level. We present the conceptual design of smart-HOP and then we discuss implementation requirements and challenges.
Resumo:
Wireless sensor network (WSN) applications such as patients’ health monitoring in hospitals, location-aware ambient intelligence, industrial monitoring /maintenance or homeland security require the support of mobile nodes or node groups. In many of these applications, the lack of network connectivity is not admissible or should at least be time bounded, i.e. mobile nodes cannot be disconnected from the rest of the WSN for an undefined period of time. In this context, we aim at reliable and real-time mobility support in WSNs, for which appropriate handoff and rerouting decisions are mandatory. This paper1 drafts a mechanism and correspondent heuristics for taking reliable handoff decisions in WSNs. Fuzzy logic is used to incorporate the inherent imprecision and uncertainty of the physical quantities at stake.