9 resultados para conduct problems
em Instituto Politécnico do Porto, Portugal
Resumo:
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.
Resumo:
In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.
Resumo:
Dissertação de Mestrado apresentada ao Instituto de Contabilidade e Administração do Porto para obtenção do grau de Mestre em Tradução e Interpretação Especializadas, sob orientação de Doutora Maria Helena da Costa Alves Guimarães Ustimenko e Doutora Maria Manuela Ribeiro Veloso.
Resumo:
A monitorização de redes é um aspeto de elevada importância, principalmente em redes de média ou grande dimensão. A necessidade de utilização de uma ferramenta para realização dessa gestão facilita o trabalho e proporciona de uma forma mais rápida e eficaz a identificação de problemas na rede e nos seus sistemas. Neste sentido, o presente trabalho tem como objetivo o desenvolvimento de uma solução para a monitorização de GateBoxes, um dos produtos desenvolvidos e comercializados pela empresa NextToYou. A necessidade de monitorização das GateBoxes, por parte da NextToYou, é essencial para que possa detetar falhas no seu funcionamento ou realizar notificações aquando da deteção de problemas para uma rápida resolução. Neste contexto a empresa decidiu implementar uma ferramenta para a referida monitorização e propôs, no âmbito da tese, o desenvolvimento de uma aplicação que satisfizesse esses propósitos. Disponibilizou então, para o desenvolvimento uma plataforma, a WebForge, e definiu alguns requisitos funcionais dessa ferramenta, tais como, a monitorização remota de informação, gestão de alarmes, geração de avisos e notificações. Para a elaboração deste trabalho foram realizados estudos teóricos sobre o tema da gestão e monitorização remotas, realizando-se posteriormente o desenvolvimento de uma aplicação para a monitorização de GateBoxes. Após a implementação efetuou-se a validação do trabalho realizado através da execução de testes e demonstrações, de forma a poder validar e verificar o desempenho do sistema.
Resumo:
One of the most difficult issues of e-Learning is the students’ assessment. Being this an outstanding task regarding theoretical topics, it becomes even more challenging when the topics under evaluation are practical. ISCAP’s Information Systems Department is composed of about twenty teachers who have been for several years using an e-learning environment (at the moment Moodle 2.3) combined with traditional assessment. They are now planning and implementing a new e-learning assessment strategy. This effort was undertaken in order to evaluate a practical topic (the use of spreadsheets to solve management problems) common to shared courses of several undergraduate degree programs. The same team group is already experienced in the assessment of theoretical information systems topics using the b-learning platform. Therefore, this project works as an extension to previous experiences being the team aware of the additional difficulties due to the practical nature of the topics. This paper describes this project and presents two cycles of the action research methodology, used to conduct the research. The first cycle goal was to produce a database of questions. When it was implemented in order to be used with a pilot group of students, several problems were identified. Subsequently, the second cycle consisted in solving the identified problems preparing the database and all the players to a broader scope implementation. For each cycle, all the phases, its drawbacks and achievements are described. This paper suits all those who are or are planning to be in the process of shifting their assessment strategy from a traditional to one supported by an e-learning platform.
Resumo:
Probability and Statistics—Selected Problems is a unique book for senior undergraduate and graduate students to fast review basic materials in Probability and Statistics. Descriptive statistics are presented first, and probability is reviewed secondly. Discrete and continuous distributions are presented. Sample and estimation with hypothesis testing are presented in the last two chapters. The solutions for proposed excises are listed for readers to references.
Resumo:
Linear Algebra—Selected Problems is a unique book for senior undergraduate and graduate students to fast review basic materials in Linear Algebra. Vector spaces are presented first, and linear transformations are reviewed secondly. Matrices and Linear systems are presented. Determinants and Basic geometry are presented in the last two chapters. The solutions for proposed excises are listed for readers to references.
Resumo:
The shifted Legendre orthogonal polynomials are used for the numerical solution of a new formulation for the multi-dimensional fractional optimal control problem (M-DFOCP) with a quadratic performance index. The fractional derivatives are described in the Caputo sense. The Lagrange multiplier method for the constrained extremum and the operational matrix of fractional integrals are used together with the help of the properties of the shifted Legendre orthonormal polynomials. The method reduces the M-DFOCP to a simpler problem that consists of solving a system of algebraic equations. For confirming the efficiency and accuracy of the proposed scheme, some test problems are implemented with their approximate solutions.