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.

Multipath policy routing in packet switched networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Leveraging facebook’s open graph to develop an environmental persuasive application

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

An internal analysis of Amorim Turismo’s operations regarding food and beverage with a focus on operational efficiency and quality of service

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Graph usage in financial reports: Evidence from Portuguese listed companies

When assessing investment options, investors focus on the graphs of annual reports, despite lack of auditing. If poorly constructed, graphs distort perceptions and lead to inaccurate decisions. This study examines graph usage in all the companies listed on Euronext Lisbon in 2013. The findings suggest that graphs are common in the annual reports of Portuguese companies and that, while there is no evidence of Selectivity Distortion, both Measurement and Orientation Distortions are pervasive. The study recommends the auditing of financial graphs, and urges preparers and users of annual reports to be wary of the possibility of graph distortion.

Energy expenditure after 2- to 3-hour elective surgical operations

Energy expenditure was measured by indirect calorimetry in 17 adult patients (8 women and 9 men) before surgery, 4 hours immediately after surgery , and 24 hours late after surgery in patients undergoing elective surgery of small-to-medium scope. MATERIAL AND METHODS: The total duration of surgery ranged from 2 to 3 hours. Repeated measures were performed on the same patient, so that each patient was considered to be his/her own control. All patients received a 5% dextrose solution (2000 mL/day) throughout the postoperative period. RESULTS: Men showed a reduction in CO2 production during the immediately after surgery period (257±42 mL/min) compared to before surgery (306±48 mL/min) and late after surgery (301±45 mL/min); this reduction was not observed in women. Energy expenditure was also lower in men during immediately after surgery (6.6 kJ/min). None of the other measurements, including substrate oxidation, showed significant differences. CONCLUSION: Therefore, elective surgery itself cannot be considered an important trauma that would result in increased energy expenditure. According to this study, it is not necessary to prescribe an energy supply exceeding basal expenditure during the immediate after-surgery period. The present results suggest that the energy supply prescribed during the postoperative period after elective surgery of small-to-medium scope should not exceed 5-7 kJ/min, so the patient does not receive a carbohydrate overload from energy supplementation.

Graph usage in annual reports, evidence from Norwegian listed companies

As investors and other users of annual reports often focus their attention on graphs, it is important that they portray accurate and reliable information. However, previous studies show that graphs often distort information and mislead users. This study analyses graph usage in annual reports from the 52 most traded Norwegian companies. The findings suggest that Norwegian companies commonly use graphs, and that the graph distortions, presentational enhancement and measurement distortion, are present. No evidence of selectivity was found. This study recommends development of guidelines for graphical disclosure, and advises preparers and users of annual reports to be aware of misleading graphs.

Efficient similarity-based operations for data integration

Similarity-based operations, similarity join, similarity grouping, data integration

World fishing fleets : an analysis of distant-water fleet operations, past, present, future. prepared by William B. Folsom, David J. Rovinsky, Dennis M. Weidner.

6

World fishing fleets : an analysis of distant-water fleet operations, past, present, future. prepared by U.S. Embassies overseas ; assembled by Frederick H. Beaudry, William B. Folsom, David J. Rovinsky.

2

World fishing fleets : an analysis of distant-water fleet operations, past, present, future. prepared by Mark R. Wildman.

3

World fishing fleets : an analysis of distant-water fleet operations, past, present, future. prepared by Frederick H. Beaudry, William B. Folsom.

1

World fishing fleets : an analysis of distant-water fleet operations, past, present, future. prepared by Milan Kravanja, Ellen Shapiro.

5

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.