Charlemagne's challenge: the periodic latency problem.

Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a non-trivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most qi time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible, without violating their qi's. In problem PLP the goal is to minimize the number of servers needed to serve all clients. In dependence on the topol- ogy of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.Latency problem; Periodicity; Complexity;

The temporal explorer who returns to the base

We study here the problem of exploring a temporal graph when the underlying graph is a star. The aim of the exploration problem in a temporal star is finding a temporal walk which starts and finishes at the center of the star, and visits all leaves. We present a systematic study of the computational complexity of this problem, depending on the number k of time points where each edge can be present in the graph. We distinguish between the decision version StarExp(k), asking whether a complete exploration exists, and the maximization version MaxStarExp(k), asking for an exploratkion of the greatest possible number of edges. We fully characterize MaxStarExp(k) in terms of complexity. We also partially characterize StarExp(k), showing that it is in P for k 5 . Finally, we partially characterize classes of “random” temporal stars which are, asymptotically almost surely, yes-instances and no-instances for StarExp(k)

Chaining Test Cases for Reactive System Testing (extended version)

Testing of synchronous reactive systems is challenging because long input sequences are often needed to drive them into a state at which a desired feature can be tested. This is particularly problematic in on-target testing, where a system is tested in its real-life application environment and the time required for resetting is high. This paper presents an approach to discovering a test case chain---a single software execution that covers a group of test goals and minimises overall test execution time. Our technique targets the scenario in which test goals for the requirements are given as safety properties. We give conditions for the existence and minimality of a single test case chain and minimise the number of test chains if a single test chain is infeasible. We report experimental results with a prototype tool for C code generated from Simulink models and compare it to state-of-the-art test suite generators.Comment: extended version of paper published at ICTSS'1

Study of architecture and protocols for reliable multicasting in packet switching networks

Group multicast protocols have been challenged to provide scalable solutions that meet the following requirements: (i) reliable delivery from different sources to all destinations within a multicast group; (ii) congestion control among multiple asynchronous sources. Although it is mainly a transport layer task, reliable group multicasting depends on routing architectures as well. This dissertation covers issues of both network and transport layers. Two routing architectures, tree and ring, are surveyed with a comparative study of their routing costs and impact to upper layer performances. Correspondingly, two generic transport protocol models are established for performance study. The tree-based protocol is rate-based and uses negative acknowledgment mechanisms for reliability control, while the ring-based protocol uses window-based flow control and positive acknowledgment schemes. The major performance measures observed in the study are network cost, multicast delay, throughput and efficiency. The results suggest that the tree architecture costs less at network layer than the ring, and helps to minimize latency under light network load. Meanwhile, heavy load reliable group multicasting can benefit from ring architecture, which facilitates window-based flow and congestion control. Based on the comparative study, a new two-hierarchy hybrid architecture, Rings Interconnected with Tree Architecture (RITA), is presented. Here, a multicast group is partitioned into multiple clusters with the ring as the intra-cluster architecture, and the tree as backbone architecture that implements inter-cluster multicasting. To compromise between performance measures such as delay and through put, reliability and congestion controls are accomplished at the transport layer with a hybrid use of rate and window-based protocols, which are based on either negative or positive feedback mechanisms respectively. Performances are compared with simulations against tree- and ring-based approaches. Results are encouraging because RITA achieves similar throughput performance as the ring-based protocol, but with significantly lowered delay. Finally, the multicast tree packing problem is discussed. In a network accommodating multiple concurrent multicast sessions, routing for an individual session can be optimized to minimize the competition with other sessions, rather than to minimize cost or delay. Packing lower bound and a heuristic are investigated. Simulation show that congestion can be reduced effectively with limited cost increase of routings

Evolutionary computation applied to combinatorial optimisation problems

This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the validity constraints for constrained optimisation problems. The problem selected is the travelling salesman problem (TSP), a well known NP-hard problem. Following a review of conventional genetic algorithms, this thesis advocates the use of a repair technique for genetic algorithms: GeneRepair. We evaluate the effectiveness of this operator against a wide range of benchmark problems and compare these results with conventional genetic algorithm approaches. A comparison between GeneRepair and the conventional GA approaches is made in two forms: firstly a handcrafted approach compares GAs without repair against those using GeneRepair. A second automated approach is then presented. This meta-genetic algorithm examines different configurations of operators and parameters. Through the use of a cost/benefit (Quality-Time Tradeoff) function, the user can balance the computational effort against the quality of the solution and thus allow the user to specify exactly what the cost benefit point should be for the search. Results have identified the optimal configuration settings for solving selected TSP problems. These results show that GeneRepair when used consistently generates very good TSP solutions for 50, 70 and 100 city problems. GeneRepair assists in finding TSP solutions in an extremely efficient manner, in both time and number of evaluations required

A decision support system for the management of smart mobility services

Master Dissertation (Master Degree in Engineering and Management of Information Systems)Nos dias que correm, a mobilidade assume especial importância no quotidiano das áreas metropolitanas em crescimento no país. . Com o notório crescimento das cidades, torna-se necessária e urgente uma transformação dos costumes e formas de mobilidade dentro das áreas urbanas, alterando as realidades aparentes que hoje conhecemos. Inseridos numa sociedade cada vez mais consciencializada e alerta para as questões ambientais, é essencial transportar esta mentalidade renovada para a resolução das problemáticas citadinas. Assim, o conceito de “Cidade Verde” levanta uma série de questões que exigem uma resposta eficaz para o bem-estar dos seus habitantes. Por entre as várias soluções apresentadas para estas patologias, uma das mais promissoras é, sem dúvida, o sistema de mobilidade partilhada. Pela sua dimensão, é pertinente expor o caso prático da cidade de Barcelona, em Espanha, explorando o seu sistema de partilha de scooters, um meio que adquire especial importância como meio de transporte urbano. Como qualquer sistema em constante aprimoramento, procura-se uma solução para a problemática da variação de procura, que apresenta oscilações constantes, tanto a nível temporal como geográfico, resultando na falta de veículos em algumas áreas e excesso noutras. Assim sendo, o rebalanceamento do sistema torna-se crucial para uma possível maximização na utilização de veículos, satisfazendo a procura e potenciando um aumento da sua utilização. No correr desta dissertação, foram estudados e utilizados vários métodos de otimização moderna (metaheurísticas) para a procura de soluções (sub)ótimas para o(s) percurso(s) a percorrer pelo(s) veículo(s) que executam a redistribuição das scooter/bicicletas pelas diversas áreas abrangidas pelo sistema de partilha. Deste modo, foi desenvolvido um sistema de apoio à decisão para satisfazer estas necessidades, garantindo ao utilizador toda a informação relevante para um trabalho mais eficiente e preciso.Nowadays, mobility is especially important in the daily life of the country growing metropolitan areas. With the increasing influx of people and development of these large cities, the reality of mobility that we know becomes increasingly unsustainable. Along with mobility, the environmental concerns are one of the main topics of discussion worldwide and the population is starting to act and change the way they live to find a more “green” and sustainable way of doing it. Several proposals have been put forward, trying to mitigate this issue and, one of the most promising is, undoubtedly, shared mobility systems. In this case study will be addressed the Barcelona scooter sharing system, characterized by its great size and importance as a mean of urban transport. One of the problems presented by these sharing services is that demand varies widely, both temporal and geographical. Thus, there are several cases where there is a lack of vehicles in some areas and an excess in others. The rebalancing of the system is crucial to maximize vehicle utilization and meet customer demand. In this thesis, several modern optimization methods (metaheuristics) were used to search for (sub)optimal solutions for the redistribution route(s). A decision support system was developed to meet this end, giving the end user relevant information for a more efficient and precise work