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.

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.

Exploiting sensor redundancy for the calculation of fractional derivatives in the presence of noise

In this paper a new method for the calculation of the fractional expressions in the presence of sensor redundancy and noise, is presented. An algorithm, taking advantage of the signal characteristics and the sensor redundancy, is tuned and optimized through genetic algorithms. The results demonstrate the good performance for different types of expressions and distinct levels of noise.

Root locus of fractional linear systems

In this paper an algorithm for the calculation of the root locus of fractional linear systems is presented. The proposed algorithm takes advantage of present day computational resources and processes directly the characteristic equation, avoiding the limitations revealed by standard methods. The results demonstrate the good performance for different types of expressions.

The extended unsymmetric frontal solution for multiple-point constraints

The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach - Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings - When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/implications - Large, non-linear problems with constraints typically make use of the Newton method with Lagrange multipliers. In the context of the solution of problems with large number of constraints, the matrix transformation methods (MTM) are often more cost-effective. The paper presents a complete solution, with topological ordering, for this problem. Practical implications - A complete software package in Fortran 2003 is described. Examples of clique-based problems are shown with large systems solved in core. Social implications - More realistic non-linear problems can be solved with this Frontal code at the core of the Newton method. Originality/value - Use of topological ordering of constraints. A-priori pivot and front sequences. No need for symbolic assembling. Constraints treated at the core of the Frontal solver. Use of OpenMP in the main Frontal loop, now quantified. Availability of Software.

Formative assessment and motivation in higher education: a successful approach in mechanical engineer thermodynamics

Between 2000/01 and 2006/07, the approval rate of a Thermodynamics course in a Mechanical Engineer graduation was 25%. However, a careful analysis of the results showed that 41% of the students chosen not to attend or dropped out, missing the final examination. Thus, a continuous assessment methodology was developed, whose purpose was to reduce drop out, motivating students to attend this course, believing that what was observed was due, not to the incapacity to pass, but to the anticipation of the inevitability of failure by the students. If, on one hand, motivation is defined as a broad construct pertaining to the conditions and processes that account for the arousal, direction, magnitude, and maintenance of effort, on the other hand, assessment is one of the most powerful tools to change the will that students have to learn, motivating them to learn in a quicker and permanent way. Some of the practices that were implemented, included: promoting learning goal orientation rather than performance goal orientation; cultivating intrinsic interest in the subject and put less emphasis on grades but make grading criteria explicit; emphasizing teaching approaches that encourage collaboration among students and cater for a range of teaching styles; explaining the reasons for, and the implications of, tests; providing feedback to students about their performance in a form that is non-egoinvolving and non-judgemental and helping students to interpret it; broadening the range of information used in assessing the attainment of individual students. The continuous assessment methodology developed was applied in 2007/08 and 2008/09, having found an increase in the approval from 25% to 55% (30%), accompanied by a decrease of the drop out from 41% to 23,5% (17,5%). Flunking with a numerical grade lowered from 34,4% to 22,0% (12,4%). The perception by the students of the continuous assessment relevance was evaluated with a questionnaire. 70% of the students that failed the course respond that, nevertheless, didn’t repent having done the continuous assessment.

Modelação da furação de laminados por elementos finitos

Furação de estruturas em compósitos de matriz polimérica

Genus for knots and links in renormalizable templates with several branch nodes

We apply kneading theory to describe the knots and links generated by the iteration of renormalizable nonautonomous dynamical systems with reducible kneading invariants, in terms of the links corresponding to each factor. As a consequence we obtain explicit formulas for the genus for this kind of knots and links.

Approximating fractional derivatives through the generalized mean

This paper addresses the calculation of fractional order expressions through rational fractions. The article starts by analyzing the techniques adopted in the continuous to discrete time conversion. The problem is re-evaluated in an optimization perspective by tacking advantage of the degree of freedom provided by the generalized mean formula. The results demonstrate the superior performance of the new algorithm.

Enhancing information retrieval in folksonomies using ontology of place constructed from Gazetteer information

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

A numerical analysis of generalized Boussinesq-type equation using continuos/discontinuous FEM

An improved class of Boussinesq systems of an arbitrary order using a wave surface elevation and velocity potential formulation is derived. Dissipative effects and wave generation due to a time-dependent varying seabed are included. Thus, high-order source functions are considered. For the reduction of the system order and maintenance of some dispersive characteristics of the higher-order models, an extra O(mu 2n+2) term (n ??? N) is included in the velocity potential expansion. We introduce a nonlocal continuous/discontinuous Galerkin FEM with inner penalty terms to calculate the numerical solutions of the improved fourth-order models. The discretization of the spatial variables is made using continuous P2 Lagrange elements. A predictor-corrector scheme with an initialization given by an explicit RungeKutta method is also used for the time-variable integration. Moreover, a CFL-type condition is deduced for the linear problem with a constant bathymetry. To demonstrate the applicability of the model, we considered several test cases. Improved stability is achieved.

Periodic paths on nonautonomous graphs

We define nonautonomous graphs as a class of dynamic graphs in discrete time whose time-dependence consists in connecting or disconnecting edges. We study periodic paths in these graphs, and the associated zeta functions. Based on the analytic properties of these zeta functions we obtain explicit formulae for the number of n-periodic paths, as the sum of the nth powers of some specific algebraic numbers.

Study of the interactions in a three-way crossed classification model

Crossed classification models are applied in many investigations taking in consideration the existence of interaction between all factors or, in alternative, excluding all interactions, and in this case only the effects and the error term are considered. In this work we use commutative Jordan algebras in the study of the algebraic structure of these designs and we use them to obtain similar designs where only some of the interactions are considered. We finish presenting the expressions of the variance componentes estimators.

Theory and phenomenology of two-higgs-doublet models

We discuss theoretical and phenomenological aspects of two-Higgs-doublet extensions of the Standard Model. In general, these extensions have scalar mediated flavour changing neutral currents which are strongly constrained by experiment. Various strategies are discussed to control these flavour changing scalar currents and their phenomenological consequences are analysed. In particular, scenarios with natural flavour conservation are investigated, including the so-called type I and type II models as well as lepton-specific and inert models. Type III models are then discussed, where scalar flavour changing neutral currents are present at tree level, but are suppressed by either a specific ansatz for the Yukawa couplings or by the introduction of family symmetries leading to a natural suppression mechanism. We also consider the phenomenology of charged scalars in these models. Next we turn to the role of symmetries in the scalar sector. We discuss the six symmetry-constrained scalar potentials and their extension into the fermion sector. The vacuum structure of the scalar potential is analysed, including a study of the vacuum stability conditions on the potential and the renormalization-group improvement of these conditions is also presented. The stability of the tree level minimum of the scalar potential in connection with electric charge conservation and its behaviour under CP is analysed. The question of CP violation is addressed in detail, including the cases of explicit CP violation and spontaneous CP violation. We present a detailed study of weak basis invariants which are odd under CP. These invariants allow for the possibility of studying the CP properties of any two-Higgs-doublet model in an arbitrary Higgs basis. A careful study of spontaneous CP violation is presented, including an analysis of the conditions which have to be satisfied in order for a vacuum to violate CP. We present minimal models of CP violation where the vacuum phase is sufficient to generate a complex CKM matrix, which is at present a requirement for any realistic model of spontaneous CP violation.

Apropriação de conteúdos do conhecimento explícito da língua por alunos do 2.º ano do 1.º ciclo do ensino básico

Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1.º e 2.º Ciclo do Ensino Básico