Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por LIAAD

2016

Effect of Dialysis Day on Intradialytic Hypotension Risk

Autores
Rocha, A; Sousa, C; Teles, P; Coelho, A; Xavier, E;

Publicação
KIDNEY & BLOOD PRESSURE RESEARCH

Abstract
Background/Aims: Intradialytic hypotension (IDH) is a serious and frequent complication of hemodialysis (HD). Thus far, data are scarcely available to assess the impact of first versus subsequent HD sessions of the week in IDH. Therefore, the purpose of this work was to evaluate IDH risk in patients on thrice-weekly HD. Methods: We conducted an analysis of all blood pressure (BP) measurements obtained during 492 HD treatments given to 41 prevalent adult patients over a one month period. A logistic regression model for repeated binary observations was used to determine the association between hypotension and patient and dialysis factors. Results: The incidence of IDH was 32.5%. First dialysis session of the week was associated with a 9% higher risk of hypotension relatively to the second one. The risk was even higher from the first to the third session of the week (60%) and from the second to the third (50%). A higher hypotension odds ratio was also associated with age (1.03, 90% CI: 1.01-1.06), higher predialysis BP (1.04, 90% CI: 1.03-1.05) and higher phosphorus level (1.38, 90% CI: 1.07-1.76). The risk decreased 24.4% for each additional antihypertensive drug taken by the patient. Conclusions: The odds of hypotension occurrence decrease throughout dialysis sessions of the week. Minimizing modifiable risk factors may decrease IDH episodes. (C) 2016 The Author(s) Published by S. Karger AG, Basel

2016

Social Network Analysis of Mobile Streaming Networks

Autores
Tabassum, S;

Publicação
IEEE 17th International Conference on Mobile Data Management, MDM 2016, Porto, Portugal, June 13-16, 2016 - Workshops

Abstract

2016

Optimal Cable Design of Wind Farms: The Infrastructure and Losses Cost Minimization Case

Autores
Cerveira, A; de Sousa, A; Solteiro Pires, EJS; Baptista, J;

Publicação
IEEE TRANSACTIONS ON POWER SYSTEMS

Abstract
Wind power is the source of electrical energy that has grown more over the last years, with annual rate in installed capacity around 20%. Therefore, it is important to optimize the production efficiency of wind farms. In a wind farm, the electrical energy is collected at a central substation from different wind turbines placed nearby. This paper addresses the optimal design of the cable network interconnecting the turbines to the substation aiming to minimize not only the infrastructure cost but also the cost of the energy losses in the cables. Although this problem is non-linear, different integer linear programming models are proposed considering the wind farm technical constraints. The models are applied to three real cases Portuguese wind farms. The computational results show that the proposed models are able to compute the optimal solutions for all cases.

2016

Spatial considerations of an area restriction model for identifying harvest blocks at commercial forest plantations

Autores
Kašpar, J; Perez, GFE; Cerveira, A; Marušák, R;

Publicação
Forestry Journal

Abstract
In the past few decades, ecological and environmental issues have dominated the forest industry worldwide, but economic aspects have been much less studied in this dynamic period. However, a sustainable and efficient forest biomass supply is critical for socio-economic development in many regions, particularly in rural areas. Nature protection efforts have contributed to reduced harvesting quotas, which have resulted in an imbalance of the environmental functions of the forests and forest management, particularly wood supply. Considering the size and distribution of forest production management units and the forest stands that compose those units, there is a clear need for improved decision-making tools that help forest managers in planning harvest sequences. The optimization of harvest scheduling should consider economic and spatial factors, which may reduce production costs by increasing the logistic efficiency. Moreover, incorporating maximum harvesting opening size constraints into planning can help preserve biodiversity. This article presents a new spatial harvest scheduling model based on the integer programming method; it was developed using real data from a forest production unit located in the northern part of the southeast region of Brazil. The goal of the proposed scheduling approach is to maximize the net present value and concentrate the harvesting locations in each period. In spite of the fact that the object of the study is plantation forest under management different to common conditions in Europe or North America, the model is flexible and can be used in management of forest in Central Europe. © 2016 Jan Kašpar et al.

2016

A branch-and-cut algorithm for a multi-item inventory distribution problem

Autores
Agra, A; Cerveira, A; Requejo, C;

Publicação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
This paper considers a multi-item inventory distribution problem motivated by a practical case occurring in the logistic operations of an hospital. There, a single warehouse supplies several nursing wards. The goal is to define a weekly distribution plan of medical products that minimizes the visits to wards, while respecting inventory capacities and safety stock levels. A mathematical formulation is introduced and several improvements such as tightening constraints, valid inequalities and an extended reformulation are discussed. In order to deal with real size instances, an hybrid heuristic based on mathematical models is introduced and the improvements are discussed. A branch-and-cut algorithm using all the discussed improvements is proposed. Finally, a computational experimentation is reported to show the relevance of the model improvements and the quality of the heuristic scheme. © Springer International Publishing AG 2016.

2016

Lagrangian relaxation bounds for a production-inventory-routing problem

Autores
Agra, A; Cerveira, A; Requejo, C;

Publicação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
We consider a single item Production-Inventory-Routing problem with a single producer/supplier and multiple retailers. Inventory management constraints are considered both at the producer and at the retailers, following a vendor managed inventory approach, where the supplier monitors the inventory at retailers and decides on the replenishment policy for each retailer. We assume a constant production capacity. Based on the mathematical formulation we discuss a classical Lagrangian relaxation which allows to decompose the problem into four subproblems, and a new Lagrangian decomposition which decomposes the problem into just a production-inventory subproblem and a routing subproblem. The new decomposition is enhanced with valid inequalities. A computational study is reported to compare the bounds from the two approaches. © Springer International Publishing AG 2016.

  • 294
  • 503