19 resultados para MINIMIZING EARLINESS
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática
Resumo:
Signal Processing, Vol. 86, nº 10
Resumo:
Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica
Resumo:
Dissertação apresentada à Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Doutor em Engenharia Civil
Resumo:
Dissertação para obtenção do Grau de Doutor em Bioengenharia
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia Química, especialidade de Engenharia Bioquímica
Resumo:
Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e de Computadores
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia Mecânica
Resumo:
Dissertation to obtain PhD in Industrial Engineering
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia do Ambiente
Resumo:
Dissertação para obtenção do Grau de Doutor em Ambiente
Resumo:
Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.
Resumo:
Pavements require maintenance in order to provide good service levels during their life period. Because of the significant costs of this operation and the importance of a proper planning, a pavement evaluation methodology, named Pavement Condition Index (PCI), was created by the U.S. Army Corps of Engineers. This methodology allows for the evaluation of the pavement condition along the life period, generally yearly, with minimum costs and, in this way, it is possible to plan the maintenance action and to adopt adequate measures, minimising the rehabilitation costs. The PCI methodology provides an evaluation based on visual inspection, namely on the distresses observed on the pavement. This condition index of the pavement is classified from 0 to 100, where 0 it is the worst possible condition and 100 the best possible condition. This methodology of pavement assessment represents a significant tool for management methods such as airport pavement management system (APMS) and life-cycle costs analysis (LCCA). Nevertheless, it has some limitations which can jeopardize the correct evaluation of the pavement behavior. Therefore the objective of this dissertation is to help reducing its limitations and make it easier and faster to use. Thus, an automated process of PCI calculation was developed, avoiding the abaci consultation, and consequently, minimizing the human error. To facilitate also the visual inspection a Tablet application was developed to replace the common inspection data sheet and thus making the survey easier to be undertaken. Following, an airport pavement condition was study accordingly with the methodology described at Standard Test Method for Airport Pavement Condition Index Surveys D5340, 2011 where its original condition level is compared with the condition level after iterate possible erroneous considered distresses as well as possible rehabilitations. Afterwards, the results obtained were analyzed and the main conclusions presented together with some future developments.