Flow injection electrochemical determination of apomorphine

Few analytical methods are currently available for determination of apomorphine, the active substance of a new oral formulation used in the treatment of erectile dysfunction. In this way a flow injection electrochemical method (FIA-EC) was developed for its quantification and applied to pharmaceutical dosage forms. Based in previous findings regarding the stability of apomorphine in borate buffer and after optimization of several analytical parameters a single channel flow injection manifold was set up that enables the determination of this drug over the concentration range of 3 to 16 µmol L-1 with a detection limit of 0.5 µmol L-1 at a sampling rateof 90 h-1. The simplicity and rapidity of the FIA-EC method used, its reproducibility and sensitivity make it suitable for quality control of pharmaceutical preparations of apomorphine intended for clinical use and research.

Flow injection potentiometric determination of chlorpromazine

New chlorpromazine selective electrodes with a tubular arrangement and no internal reference solution are proposed. Selective membranes are of poly(vinyl chloride) (PVC) with the tetraphenylborate•chlorpromazine (TPB•CPZ) ion-exchanger dissolved in o-nitrophenyl octyl ether (oNPOE). Analytical features of the electrodes were evaluated on a single-channel flow assembly having 500 µl injection volumes and flow-rates of 4.5 ml min−1. For a carrier solution of 3.3×10−3Min sodium sulphate, Nernstian responsewas observed over the concentration range 1.0×10−5 to 1.0×10−2 M. Average slopes were about 59mVdecade−1 and squared correlation coefficients were >0.9984. Slight hiper-Nernstian behaviour was observed in buffer solutions of 4.4 pH; average slopes were of 62.06mVdecade−1. The electrode displayed a good selectivity for CPZ, with respect to, several foreign inorganic and organic species. The selective electrodes were successfully applied to the analysis of pure solutions and pharmaceutical preparations. Proposed method allows the analysis of 84 samples h−1, producing wastewaters of low toxicity. The proposed method offers the advantage of simplicity, accuracy, applicability to coloured and turbid samples, and automation feasibility.

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Ant colony system based approach to single machine scheduling problems: weighted tardiness scheduling problem

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

A Random Access Protocol incorporating Multi-Packet Reception, Retransmission Diversity and Successive Interference Cancellation

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)

Genetic algorithm methodology applied to intelligent house control

In recent years the use of several new resources in power systems, such as distributed generation, demand response and more recently electric vehicles, has significantly increased. Power systems aim at lowering operational costs, requiring an adequate energy resources management. In this context, load consumption management plays an important role, being necessary to use optimization strategies to adjust the consumption to the supply profile. These optimization strategies can be integrated in demand response programs. The control of the energy consumption of an intelligent house has the objective of optimizing the load consumption. This paper presents a genetic algorithm approach to manage the consumption of a residential house making use of a SCADA system developed by the authors. Consumption management is done reducing or curtailing loads to keep the power consumption in, or below, a specified energy consumption limit. This limit is determined according to the consumer strategy and taking into account the renewable based micro generation, energy price, supplier solicitations, and consumers’ preferences. The proposed approach is compared with a mixed integer non-linear approach.

Ant colony search algorithm for the optimal power flow problem

To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature.

Optimal dispatch with reactive power compensation by Genetic Algorithm

This paper presents a Unit Commitment model with reactive power compensation that has been solved by Genetic Algorithm (GA) optimization techniques. The GA has been developed a computational tools programmed/coded in MATLAB. The main objective is to find the best generations scheduling whose active power losses are minimal and the reactive power to be compensated, subjected to the power system technical constraints. Those are: full AC power flow equations, active and reactive power generation constraints. All constraints that have been represented in the objective function are weighted with a penalty factors. The IEEE 14-bus system has been used as test case to demonstrate the effectiveness of the proposed algorithm. Results and conclusions are dully drawn.

Ancillary services dispatch using linear programming and genetic algorithm approaches

Electricity market players operating in a liberalized environment requires access to an adequate decision support tool, allowing them to consider all the business opportunities and take strategic decisions. Ancillary services represent a good negotiation opportunity that must be considered by market players. For this, decision support tools must include ancillary market simulation. This paper proposes two different methods (Linear Programming and Genetic Algorithm approaches) for ancillary services dispatch. The methodologies are implemented in MASCEM, a multi-agent based electricity market simulator. A test case concerning the dispatch of Regulation Down, Regulation Up, Spinning Reserve and Non-Spinning Reserve services is included in this paper.

A study on the encryption algorithm for RFID tag (SEED : 8 Rounds × 64 bits block)

Although it is always weak between RFID Tag and Terminal in focus of the security, there are no security skills in RFID Tag. Recently there are a lot of studying in order to protect it, but because it has some physical limitation of RFID, that is it should be low electric power and high speed, it is impossible to protect with the skills. At present, the methods of RFID security are using a security server, a security policy and security. One of them the most famous skill is the security module, then they has an authentication skill and an encryption skill. In this paper, we designed and implemented after modification original SEED into 8 Round and 64 bits for Tag.

Layer-by-layer immobilization of carbon dots fluorescent nanomaterials on single optical fiber

We report within this paper the development of a fiber-optic based sensor for Hg(II) ions. Fluorescent carbon nanoparticles were synthesized by laser ablation and functionalized with PEG200 and N-acetyl-l-cysteine so they can be anionic in nature. This characteristic facilitated their deposition by the layer-by-layer assembly method into thin alternating films along with a cationic polyelectrolyte, poly(ethyleneimine). Such films could be immobilized onto the tip of a glass optical fiber, allowing the construction of an optical fluorescence sensor. When immobilized on the fiber-optic tip, the resultant sensor was capable of selectively detecting sub-micromolar concentrations of Hg(II) with an increased sensitivity compared to carbon dot solutions. The fluorescence of the carbon dots was quenched by up to 44% by Hg(II) ions and interference from other metal ions was minimal.

The development and optimization of a modified single-drop microextraction method for organochlorine pesticides determination by gas chromatography-tandem mass spectrometry

We have developed a new method for single-drop microextraction (SDME) for the preconcentration of organochlorine pesticides (OCP) from complex matrices. It is based on the use of a silicone ring at the tip of the syringe. A 5 μL drop of n-hexane is applied to an aqueous extract containing the OCP and found to be adequate to preconcentrate the OCPs prior to analysis by GC in combination with tandem mass spectrometry. Fourteen OCP were determined using this technique in combination with programmable temperature vaporization. It is shown to have many advantages over traditional split/splitless injection. The effects of kind of organic solvent, exposure time, agitation and organic drop volume were optimized. Relative recoveries range from 59 to 117 %, with repeatabilities of <15 % (coefficient of variation) were achieved. The limits of detection range from 0.002 to 0.150 μg kg−1. The method was applied to the preconcentration of OCPs in fresh strawberry, strawberry jam, and soil.

Sistema de visão para percepção e navegação de um UAV Quadrotor

Mestrado em Engenharia Electrotécnica e de Computadores