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.

Learning objects recommendation in an adaptive educational hypermedia system

The aim of this paper is presenting the modules of the Adaptive Educational Hypermedia System PCMAT, responsible for the recommendation of learning objects. PCMAT is an online collaborative learning platform with a constructivist approach, which assesses the user’s knowledge and presents contents and activities adapted to the characteristics and learning style of students of mathematics in basic schools. The recommendation module and search and retrieval module choose the most adequate learning object, based on the user's characteristics and performance, and in this way contribute to the system’s adaptability.

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.

Comparação do cálculo de dose com os algoritmos Analytical Anisotropic Algorithm e Pencil Beam Convolution na patologia de pulmão

Mestrado em Radioterapia.

Educational policies, territories and actors strategies

The purpose of this paper is to analyse how educational policies about school violence are reinterpreted and implemented at school level and if this process contributes to a more pluralistic and democratic school. A research carried out in 3 clusters of schools showed that the diversity of understandings and strategies to face school violence, higher within the territories than between them, was associated to the school board's agendas and the legitimacy of the different actors to interpret and act within the national policies framework. There was a high consistency between violence management strategies and the ways schools faced social and cultural diversity. Those who favour more inclusive strategies to deal with violence tend to provide higher educational opportunities in schools, inversely, those who favour repressive strategies are more likely to support educational and social selective strategies, with less educational offer; less participation of teachers, students and parents in violence regulation.

Comparação entre o pencil beam convolution algorithm e o analytical anisotropic algorithm em tumores de mama

Mestrado em Radioterapia

An adaptive educational system for higher education

The main objective of an Adaptive System is to adequate its relation with the user (content presentation, navigation, interface, etc.) according to a predefined but updatable model of the user that reflects his objectives, preferences, knowledge and competences [Brusilovsky, 2001], [De Bra, 2004]. For Educational Adaptive Systems, the emphasis is placed on the student knowledge in the domain application and learning style, to allow him to reach the learning objectives proposed for his training [Chepegin, 2004]. In Educational AHS, the User Model (UM), or Student Model, has increased relevance: when the student reaches the objectives of the course, the system must be able to readapt, for example, to his knowledge [Brusilovsky, 2001]. Learning Styles are understood as something that intent to define models of how given person learns. Generally it is understood that each person has a Learning Style different and preferred with the objective of achieving better results. Some case studies have proposed that teachers should assess the learning styles of their students and adapt their classroom and methods to best fit each student's learning style [Kolb, 2005], [Martins, 2008]. The learning process must take into consideration the individual cognitive and emotional parts of the student. In summary each Student is unique so the Student personal progress must be monitored and teaching shoul not be not generalized and repetitive [Jonassen, 1991], [Martins, 2008]. The aim of this paper is to present an Educational Adaptive Hypermedia Tool based on Progressive Assessment.

User modeling In adaptive hypermedia educational systems

This document is a survey in the research area of User Modeling (UM) for the specific field of Adaptive Learning. The aims of this document are: To define what it is a User Model; To present existing and well known User Models; To analyze the existent standards related with UM; To compare existing systems. In the scientific area of User Modeling (UM), numerous research and developed systems already seem to promise good results, but some experimentation and implementation are still necessary to conclude about the utility of the UM. That is, the experimentation and implementation of these systems are still very scarce to determine the utility of some of the referred applications. At present, the Student Modeling research goes in the direction to make possible reuse a student model in different systems. The standards are more and more relevant for this effect, allowing systems communicate and to share data, components and structures, at syntax and semantic level, even if most of them still only allow syntax integration.

Funding sources and fostering of educational projects

This paper is part of the results from the project "Implementation Strategies and Development of an Open and Distance Education System for the University of the Azores" funded by the European Social Fund. http://hdl.handle.net/10400.3/2327

Dependent component analysis: a hyperspectral unmixing algorithm

Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest. This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical properties of hyperspectral data. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. The performance of the method is illustrated using simulated and real data.

Vertex component analysis: a fast algorithm to extract endmembers spectra from hyperspectral data

Chapter in Book Proceedings with Peer Review First Iberian Conference, IbPRIA 2003, Puerto de Andratx, Mallorca, Spain, JUne 4-6, 2003. Proceedings

Vertex component analysis: a fast algorithm to unmix hyperspectral data

Given a set of mixed spectral (multispectral or hyperspectral) vectors, linear spectral mixture analysis, or linear unmixing, aims at estimating the number of reference substances, also called endmembers, their spectral signatures, and their abundance fractions. This paper presents a new method for unsupervised endmember extraction from hyperspectral data, termed vertex component analysis (VCA). The algorithm exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. In a series of experiments using simulated and real data, the VCA algorithm competes with state-of-the-art methods, with a computational complexity between one and two orders of magnitude lower than the best available method.

Comparison of the pencil beam convolution algorithm and the analytical anisotropic algorithm in breast tumors

The calculation of the dose is one of the key steps in radiotherapy planning1-5. This calculation should be as accurate as possible, and over the years it became feasible through the implementation of new algorithms to calculate the dose on the treatment planning systems applied in radiotherapy. When a breast tumour is irradiated, it is fundamental a precise dose distribution to ensure the planning target volume (PTV) coverage and prevent skin complications. Some investigations, using breast cases, showed that the pencil beam convolution algorithm (PBC) overestimates the dose in the PTV and in the proximal region of the ipsilateral lung. However, underestimates the dose in the distal region of the ipsilateral lung, when compared with analytical anisotropic algorithm (AAA). With this study we aim to compare the performance in breast tumors of the PBC and AAA algorithms.