An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

Using interval graphs in an order processing optimization problem

In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.

Manobras de condução assistida para veículos submarinos subactuados

A intervenção humana no manuseamento de veículos submarinos operados remotamente (ROVs) é um requisito necessário para garantir o sucesso da missão e a integridade do equipamento. Contudo, a sua teleoperação não é fácil, pelo que a condução assistida destes veículos torna-se relevante. Esta dissertação propõe uma solução para este problema para ROVs de 3DOF (surge, heave e yaw). São propostas duas abordagens distintas – numa primeira propõe-se um sistema de controlo Image Based Visual Servoing (IBVS) tendo em vista a utilização exclusiva de uma câmara (sensor existente neste tipo de sistemas) por forma a melhorar significativamente a teleoperação de um pequeno ROV; na segunda, propõe-se um sistema de controlo cinemático para o plano horizontal do veículo e um algoritmo de uma manobra capaz de dotar o ROV de movimento lateral através de uma trajectória dente-de-serra. Demonstrou-se em cenários de operação real que o sistema proposto na primeira abordagem permite ao operador de um ROV com 3DOF executar tarefas de alguma complexidade (estabilização) apenas através de comandos de alto nível, melhorando assim drasticamente a teleoperação e qualidade de inspecção do veículo em questão. Foi também desenvolvido um simulador do ROV em MATLAB para validação e avaliação das manobras, onde o sistema proposto na segunda abordagem foi validado com sucesso.

Resolução do problema de atribuição de salas a exames

Este trabalho pretende resolver o problema das alocações de salas a exames no Departamento de Engenharia Mecânica do Instituto Superior de Engenharia do Porto. A solução desenvolvida atribui salas a exames respeitando as restrições de capacidade de salas e a restrição de realização dum único exame por sala num determinado período, por forma a minimizar a atribuição de salas e, consequentemente, docentes a exames. Foi criado um modelo matemático, que representa as variáveis relevantes do problema, e realiza a sua implementação numa plataforma informática amigável para o utilizador. O modelo matemático foi validado comparando as suas soluções com as obtidas através do processo manual. Os resultados do novo método demonstram a sua supremacia relativamente ao modelo atual. No futuro, poderá ser estudada a possibilidade de usar esta ferramenta na resolução do mesmo problema em realidades diferentes da do Departamento de Engenharia Mecânica do ISEP.

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2015). 4 to 6, Mar, 2015. Turku, Finland.

Task partitioning and priority assignment for distributed hard real-time systems

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

Dynamic stability metrics for the container loading problem

The Container Loading Problem (CLP) literature has traditionally evaluated the dynamic stability of cargo by applying two metrics to box arrangements: the mean number of boxes supporting the items excluding those placed directly on the floor (M1) and the percentage of boxes with insufficient lateral support (M2). However, these metrics, that aim to be proxies for cargo stability during transportation, fail to translate real-world cargo conditions of dynamic stability. In this paper two new performance indicators are proposed to evaluate the dynamic stability of cargo arrangements: the number of fallen boxes (NFB) and the number of boxes within the Damage Boundary Curve fragility test (NB_DBC). Using 1500 solutions for well-known problem instances found in the literature, these new performance indicators are evaluated using a physics simulation tool (StableCargo), replacing the real-world transportation by a truck with a simulation of the dynamic behaviour of container loading arrangements. Two new dynamic stability metrics that can be integrated within any container loading algorithm are also proposed. The metrics are analytical models of the proposed stability performance indicators, computed by multiple linear regression. Pearson’s r correlation coefficient was used as an evaluation parameter for the performance of the models. The extensive computational results show that the proposed metrics are better proxies for dynamic stability in the CLP than the previous widely used metrics.

Cutting path as a rural postman problem

The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates “social knowledge”, using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications.

A ten-year follow-up of human leptospirosis in Uruguay: an unresolved health problem

Leptospira spp. are delicate bacteria that cannot be studied by usual microbiological methods. They cause leptospirosis, a zoonotic disease transmitted to humans through infected urine of wild or domestic animals. We studied the incidence of this disease in the Uruguayan population, its epidemiologic and clinical features, and compared diagnostic techniques. After examining 6,778 suspect cases, we estimated that about 15 infections/100,000 inhabitants occurred yearly, affecting mainly young male rural workers. Awareness about leptospirosis has grown among health professionals, and its lethality has consequently decreased. Bovine infections were probably the principal source of human disease. Rainfall volumes and floods were major factors of varying incidence. Most patients had fever, asthenia, myalgias or cephalalgia, with at least one additional abnormal clinical feature. 30-40% of confirmed cases presented abdominal signs and symptoms, conjunctival suffusion and altered renal or urinary function. Jaundice was more frequent in patients aged > 40 years. Clinical infections followed an acute pattern and their usual outcome was complete recovery. Laboratory diagnosis was based on indirect micro-agglutination standard technique (MAT). Second serum samples were difficult to obtain, often impairing completion of diagnosis. Immunofluorescence was useful as a screening test and for early detection of probable infections.

Modeling assembly program with constraints. A contribution to WCET problem

Dissertação para obtenção do Grau de Mestre em Lógica Computacional

GIS capacity building for risk management to help developing countries:Case of climate change problem in Amhara rural region (Ethiopia)

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

NMR assignment of the apo-form of a Desulfovibrio gigas protein containing a novel Mo–Cu cluster

Biomol NMR Assign (2007) 1:81–83 DOI 10.1007/s12104-007-9022-3

Incorporation of either molybdenum or tungsten into formate dehydrogenase from Desulfovibrio alaskensis NCIMB 13491; EPR assignment of the proximal iron-sulfur cluster to the pterin cofactor in formate dehydrogenases from sulfate-reducing bacteria

J Biol Inorg Chem (2004) 9: 145–151 DOI 10.1007/s00775-003-0506-z