A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

Competitive analysis of 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. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.

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.

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Competitive dynamics for behavior coordination in a joint transportation task

We address the problem of coordinating two non-holonomic mobile robots that move in formation while transporting a long payload. A competitive dynamics is introduced that gradually controls the activation and deactivation of individual behaviors. This process introduces (asymmetrical) hysteresis during behavioral switching. As a result behavioral oscillations, due to noisy information, are eliminated. Results in indoor environments show that if parameter values are chosen within reasonable ranges then, in spite of noise in the robots communi- cation and sensors, the overall robotic system works quite well even in cluttered environments. The robots overt behavior is stable and smooth.

Digital serious games and simulation games - comparison of two approaches to lean training

In an increasingly competitive and globalized world, companies need effective training methodologies and tools for their employees. However, selecting the most suitable ones is not an easy task. It depends on the requirements of the target group (namely time restrictions), on the specificities of the contents, etc. This is typically the case for training in Lean, the waste elimination manufacturing philosophy. This paper presents and compares two different approaches to lean training methodologies and tools: a simulation game based on a single realistic manufacturing platform, involving production and assembly operations that allows learning by playing; and a digital game that helps understand lean tools. This paper shows that both tools have advantages in terms of trainee motivation and knowledge acquisition. Furthermore, they can be used in a complementary way, reinforcing the acquired knowledge.

Market power analysis in the Iberian electricity market using a conjectural variations model

In the last years the electricity industry has faced a restructuring process. Among the aims of this process was the increase in competition, especially in the generation activity where firms would have an incentive to become more efficient. However, the competitive behavior of generating firms might jeopardize the expected benefits of the electricity industry liberalization. The present paper proposes a conjectural variations model to study the competitive behavior of generating firms acting in liberalized electricity markets. The model computes a parameter that represents the degree of competition of each generating firm in each trading period. In this regard, the proposed model provides a powerful methodology for regulatory and competition authorities to monitor the competitive behavior of generating firms. As an application of the model, a study of the day-ahead Iberian electricity market (MIBEL) was conducted to analyze the impact of the integration of the Portuguese and Spanish electricity markets on the behavior of generating firms taking into account the hourly results of the months of June and July of 2007. The advantages of the proposed methodology over other methodologies used to address market power, namely Residual Supply index and Lerner index are highlighted. (C) 2014 Elsevier Ltd. All rights reserved.

Multi-agent simulation of bilateral contracting in competitive electricity markets

Traditional vertically integrated power utilities around the world have evolved from monopoly structures to open markets that promote competition among suppliers and provide consumers with a choice of services. Market forces drive the price of electricity and reduce the net cost through increased competition. Electricity can be traded in both organized markets or using forward bilateral contracts. This article focuses on bilateral contracts and describes some important features of an agent-based system for bilateral trading in competitive markets. Special attention is devoted to the negotiation process, demand response in bilateral contracting, and risk management. The article also presents a case study on forward bilateral contracting: a retailer agent and a customer agent negotiate a 24h-rate tariff. © 2014 IEEE.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

Fundamentos teóricos da competitive intelligence como vantagem competitiva

Comunicação apresentada na 5ª Conferência Ibérica de Sistemas e Tecnologias de Informação – CISTI 2010, 16-19 Jun., Santiago de Compostela, Espanha. Vol. 2 pp. 329-334.

Implementação de um programa de fiabilidade de aeronaves

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica

Knowledge management in multinational companies: the repatriates’ role in the competitive advantage in subsidiaries

This paper addresses the topic of knowledge management in multinational companies (MNCs). Its purpose is to examine the role of expatriates in knowledge acquisition and transfer within MNCs. Specifically it focuses on knowledge acquisition and transfer from one MNC head office located in Germany to two Portuguese subsidiaries as a basis for competitive advantage in their Portuguese subsidiaries. A qualitative research methodology is used, specifically through an exploratory case study approach, which examines how international assignments are important for the role of expatriates In knowledge acquisition and transfer between foreign head offices and their Portuguese subsidiaries. The data were collected through semi structured interviews to 10 Portuguese repatriates from two Portuguese subsidiaries of one foreign MNC. The findings suggest that the reasons that lead to expatriating employees from Portuguese subsidiaries to foreign head offices are connected to (1) knowledge management strategies to development the subsidiary’s performance; (2) new skills and knowledge acquisition by future team leaders and business/product managers in Portuguese subsidiaries; (3) procuring knowledge, from agents in head office, to be disseminated amongst co-workers in Portuguese subsidiaries; (4) acquiring global management skills, impossible to acquire locally and; (5) developing global projects within MNC. Also our results show that knowledge acquisition and transfer from foreign head office, through subsidiaries’ expatriates, contributes directly to the Portuguese subsidiaries’ innovation, improved performance, competitive advantage and growth in the economic sectors in which they operate. Moreover, evidence reveals that expatriation is seen as a strategy to fulfil some of the main organisational objectives through their expatriates (e.g., create new products and business markets, develop and incorporate new organisational techniques and processes, integrate global teams within multinational corporation with a responsibility on the definition of global objectives). The results obtained suggest that expatriates have a central role in acquiring and transferring strategic knowledge from MNC head office to their subsidiaries located in Portugal. Based on the findings, the paper discusses in detail the main theoretical and managerial implications. Suggestions for further research are also presented. The study’s main limitation is the small size of the sample, but its findings and methodology are quite original and significant.

Competitive Intelligence através da Internet

Comunicação apresentada na 6ª CAPSI - Conferência da Associação Portuguesa de Sistemas de Informação - Escola Superior de Tecnologia de Bragança, 26-28 de Outubro.

Adaptive learning in agents behaviour: A framework for electricity markets simulation

Electricity markets are complex environments, involving a large number of different entities, playing in a dynamic scene to obtain the best advantages and profits. MASCEM (Multi-Agent System for Competitive Electricity Markets) is a multi-agent electricity market simulator that models market players and simulates their operation in the market. Market players are entities with specific characteristics and objectives, making their decisions and interacting with other players. This paper presents a methodology to provide decision support to electricity market negotiating players. This model allows integrating different strategic approaches for electricity market negotiations, and choosing the most appropriate one at each time, for each different negotiation context. This methodology is integrated in ALBidS (Adaptive Learning strategic Bidding System) – a multiagent system that provides decision support to MASCEM's negotiating agents so that they can properly achieve their goals. ALBidS uses artificial intelligence methodologies and data analysis algorithms to provide effective adaptive learning capabilities to such negotiating entities. The main contribution is provided by a methodology that combines several distinct strategies to build actions proposals, so that the best can be chosen at each time, depending on the context and simulation circumstances. The choosing process includes reinforcement learning algorithms, a mechanism for negotiating contexts analysis, a mechanism for the management of the efficiency/effectiveness balance of the system, and a mechanism for competitor players' profiles definition.