Electrocatalytic evaluation of DNA damage by superoxide radical for antioxidant capacity assessment

The integrity of DNA purine bases was herein used to evaluate the antioxidant capacity. Unlike other DNA-based antioxidant sensors reported so far, the damaging agent chosen was the O 2 radical enzymatically generated by the xanthine/xanthine oxidase system. An adenine-rich oligonucleotide was adsorbed on carbon paste electrodes and subjected to radical damage in the presence/absence of several antioxidant compounds. As a result, partial damage on DNA was observed. A minor product of the radical oxidation was identified by cyclic voltammetry as a diimine adenine derivative also formed during the electrochemical oxidation of adenine/guanine bases. The protective efficiency of several antioxidant compounds was evaluated after electrochemical oxidation of the remaining unoxidized adenine bases, by measuring the electrocatalytic current of NADH mediated by the adsorbed catalyst species generated. A comparison between O 2 and OH radicals as a source of DNA lesions and the scavenging efficiency of various antioxidant compounds against both of them is discussed. Finally, the antioxidant capacity of beverages was evaluated and compared with the results obtained with an optical method.

Fractional model for malaria transmission under control strategies

We study a fractional model for malaria transmission under control strategies.Weconsider the integer order model proposed by Chiyaka et al. (2008) in [15] and modify it to become a fractional order model. We study numerically the model for variation of the values of the fractional derivative and of the parameter that models personal protection, b. From observation of the figures we conclude that as b is increased from 0 to 1 there is a corresponding decrease in the number of infectious humans and infectious mosquitoes, for all values of α. This means that this result is invariant for variation of fractional derivative, in the values tested. These results are in agreement with those obtained in Chiyaka et al.(2008) [15] for α = 1.0 and suggest that our fractional model is epidemiologically wellposed.

Local fractional variational iteration and decomposition methods for wave equation on cantor sets within local fractional operators

We perform a comparison between the fractional iteration and decomposition methods applied to the wave equation on Cantor set. The operators are taken in the local sense. The results illustrate the significant features of the two methods which are both very effective and straightforward for solving the differential equations with local fractional derivative.

Symbolic fractional dynamics

Fractional dynamics reveals long range memory properties of systems described by means of signals represented by real numbers. Alternatively, dynamical systems and signals can adopt a representation where states are quantified using a set of symbols. Such signals occur both in nature and in man made processes and have the potential of a aftermath as relevant as the classical counterpart. This paper explores the association of Fractional calculus and symbolic dynamics. The results are visualized by means of the multidimensional technique and reveal the association between the fractal dimension and one definition of fractional derivative.

A divulgação sobre instrumentos derivados : evidência empírica do setor da indústria português

Mestrado em Contabilidade

On the fractional central differences and derivatives

Fractional central differences and derivatives are studied in this article. These are generalisations to real orders of the ordinary positive (even and odd) integer order differences and derivatives, and also coincide with the well known Riesz potentials. The coherence of these definitions is studied by applying the definitions to functions with Fourier transformable functions. Some properties of these derivatives are presented and particular cases studied.

Direct search optimization application programming interface with remote access

Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.

Filters method in direct search optimization, new measures to admissibility

Constrained nonlinear optimization problems are usually solved using penalty or barrier methods combined with unconstrained optimization methods. Another alternative used to solve constrained nonlinear optimization problems is the lters method. Filters method, introduced by Fletcher and Ley er in 2002, have been widely used in several areas of constrained nonlinear optimization. These methods treat optimization problem as bi-objective attempts to minimize the objective function and a continuous function that aggregates the constraint violation functions. Audet and Dennis have presented the rst lters method for derivative-free nonlinear programming, based on pattern search methods. Motivated by this work we have de- veloped a new direct search method, based on simplex methods, for general constrained optimization, that combines the features of the simplex method and lters method. This work presents a new variant of these methods which combines the lters method with other direct search methods and are proposed some alternatives to aggregate the constraint violation functions.

A web-based tool to evaluate the iterative processes of direct search methods

Constrained and unconstrained Nonlinear Optimization Problems often appear in many engineering areas. In some of these cases it is not possible to use derivative based optimization methods because the objective function is not known or it is too complex or the objective function is non-smooth. In these cases derivative based methods cannot be used and Direct Search Methods might be the most suitable optimization methods. An Application Programming Interface (API) including some of these methods was implemented using Java Technology. This API can be accessed either by applications running in the same computer where it is installed or, it can be remotely accessed through a LAN or the Internet, using webservices. From the engineering point of view, the information needed from the API is the solution for the provided problem. On the other hand, from the optimization methods researchers’ point of view, not only the solution for the problem is needed. Also additional information about the iterative process is useful, such as: the number of iterations; the value of the solution at each iteration; the stopping criteria, etc. In this paper are presented the features added to the API to allow users to access to the iterative process data.

Web-based application programming interface to solve nonlinear optimization problems

Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.

Direct-search penalty/barrier methods

In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.

Complex-order forced van der Pol oscillator

In this paper we consider a complex-order forced van der Pol oscillator. The complex derivative Dα1jβ, with α, β ∈ ℝ+, is a generalization of the concept of an integer derivative, where α = 1, β = 0. The Fourier transforms of the periodic solutions of the complex-order forced van der Pol oscillator are computed for various values of parameters such as frequency ω and amplitude b of the external forcing, the damping μ, and parameters α and β. Moreover, we consider two cases: (i) b = 1, μ = {1.0, 5.0, 10.0}, and ω = {0.5, 2.46, 5.0, 20.0}; (ii) ω = 20.0, μ = {1.0, 5.0, 10.0}, and b = {1.0, 5.0, 10.0}. We verified that most of the signal energy is concentrated in the fundamental harmonic ω0. We also observed that the fundamental frequency of the oscillations ω0 varies with α and μ. For the range of tested values, the numerical fitting led to logarithmic approximations for system (7) in the two cases (i) and (ii). In conclusion, we verify that by varying the parameter values α and β of the complex-order derivative in expression (7), we accomplished a very effective way of perturbing the dynamical behavior of the forced van der Pol oscillator, which is no longer limited to parameters b and ω.

Complex order van der Pol oscillator

In this paper a complex-order van der Pol oscillator is considered. The complex derivative Dα±ȷβ , with α,β∈R + is a generalization of the concept of integer derivative, where α=1, β=0. By applying the concept of complex derivative, we obtain a high-dimensional parameter space. Amplitude and period values of the periodic solutions of the two versions of the complex-order van der Pol oscillator are studied for variation of these parameters. Fourier transforms of the periodic solutions of the two oscillators are also analyzed.

Complex order biped rhythms

Animal locomotion is a complex process, involving the central pattern generators (neural networks, located in the spinal cord, that produce rhythmic patterns), the brainstem command systems, the steering and posture control systems and the top layer structures that decide which motor primitive is activated at a given time. Pinto and Golubitsky studied an integer CPG model for legs rhythms in bipeds. It is a four-coupled identical oscillators' network with dihedral symmetry. This paper considers a new complex order central pattern generator (CPG) model for locomotion in bipeds. A complex derivative Dα±jβ, with α, β ∈ ℜ+, j = √-1, is a generalization of the concept of an integer derivative, where α = 1, β = 0. Parameter regions where periodic solutions, identified with legs' rhythms in bipeds, occur, are analyzed. Also observed is the variation of the amplitude and period of periodic solutions with the complex order derivative.

Adaptive tackling of the swinging problem for a 2 DOF crane – payload system

The control of a crane carrying its payload by an elastic string corresponds to a task in which precise, indirect control of a subsystem dynamically coupled to a directly controllable subsystem is needed. This task is interesting since the coupled degree of freedom has little damping and it is apt to keep swinging accordingly. The traditional approaches apply the input shaping technology to assist the human operator responsible for the manipulation task. In the present paper a novel adaptive approach applying fixed point transformations based iterations having local basin of attraction is proposed to simultaneously tackle the problems originating from the imprecise dynamic model available for the system to be controlled and the swinging problem, too. The most important phenomenological properties of this approach are also discussed. The control considers the 4th time-derivative of the trajectory of the payload. The operation of the proposed control is illustrated via simulation results.