Reabilitação do Aeroporto de Ondjiva em Angola

Com o progresso da tecnologia aeronáutica, a deslocação de pessoas e bens tornou-se bastante acessível para variados pontos de mundo, com espaço de tempo muito reduzido. Um dos motores essenciais deste avanço, concernente à mobilidade, é o transporte aéreo e a sua evolução. Este tipo de transporte requer a máxima segurança, sendo que um único acidente pode gerar centenas de vítimas. Atendendo a estas condições, a qualidade dos pavimentos aeroportuários é de grande importância para a segurança da movimentação das aeronaves em solo. Mas, por razões económicas e por vezes de espaço, perspetivas de novas construções perdem viabilidade comparativamente a soluções de reabilitação. A posição geográfica do aeroporto de Ondjiva faz com que seja um importante ponto de passagem entre a África do Sul e a Namíbia e, prevê-se que o número de voos que se efetuam no aeroporto cresça, sendo que o país está numa fase de grande evolução. O presente trabalho visa o conhecimento do processo de dimensionamento para pavimentos aeroportuários e soluções de correção para anomalias que possam apresentar, aplicando-os ao aeroporto de Ondjiva, em Angola. Atualmente, o aeroporto revela um grande desgaste das pistas de táxi, inadaptabilidade das cabeceiras face às cargas estáticas a que são submetidas e, largura insuficiente da pista para a aeronave de projeto, ou aeronave crítica, atendendo ao regulamento da ICAO (International Civil Aviation Organization). Para melhorar o conforto, a segurança e eficiência dos serviços aéreos, o dimensionamento do aeroporto deve obedecer aos princípios e regras da ICAO. Pretende-se também a modelação de uma solução de reforço para o pavimento existente, para que não seja necessário construir um aeroporto de raiz, minimizando custos. Após a realização do dimensionamento, foi estudada a sinalização horizontal e luminosa da pista, para que esteja em conformidade com as suas novas medidas.

Intelligent management of end consumers loads including electric vehicles through a SCADA system

The large penetration of intermittent resources, such as solar and wind generation, involves the use of storage systems in order to improve power system operation. Electric Vehicles (EVs) with gridable capability (V2G) can operate as a means for storing energy. This paper proposes an algorithm to be included in a SCADA (Supervisory Control and Data Acquisition) system, which performs an intelligent management of three types of consumers: domestic, commercial and industrial, that includes the joint management of loads and the charge/discharge of EVs batteries. The proposed methodology has been implemented in a SCADA system developed by the authors of this paper – the SCADA House Intelligent Management (SHIM). Any event in the system, such as a Demand Response (DR) event, triggers the use of an optimization algorithm that performs the optimal energy resources scheduling (including loads and EVs), taking into account the priorities of each load defined by the installation users. A case study considering a specific consumer with several loads and EVs is presented in this paper.

Static-priority scheduling over wireless networks with multiple broadcast domains

We propose a wireless medium access control (MAC) protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner. Our protocol supports multiple broadcast domains, resolves the wireless hidden terminal problem and allows for parallel transmissions across a mesh network. Arbitration of messages is achieved without the notion of a master coordinating node, global clock synchronization or out-of-band signaling. The protocol relies on bit-dominance similar to what is used in the CAN bus except that in order to operate on a wireless physical layer, nodes are not required to receive incoming bits while transmitting. The use of bit-dominance efficiently allows for a much larger number of priorities than would be possible using existing wireless solutions. A MAC protocol with these properties enables schedulability analysis of sporadic message streams in wireless multihop networks.

Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.

The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.