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.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

A two-level genetic algorithm for the multi-mode resource-constrained project scheduling problem

This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.

Assessment and optimization of wind energy integration into the power systems: application to the portuguese system

The increasing integration of wind energy in power systems can be responsible for the occurrence of over-generation, especially during the off-peak periods. This paper presents a dedicated methodology to identify and quantify the occurrence of this over-generation and to evaluate some of the solutions that can be adopted to mitigate this problem. The methodology is applied to the Portuguese power system, in which the wind energy is expected to represent more than 25% of the installed capacity in a near future. The results show that the pumped-hydro units will not provide enough energy storage capacity and, therefore, wind curtailments are expected to occur in the Portuguese system. Additional energy storage devices can be implemented to offset the wind energy curtailments. However, the investment analysis performed show that they are not economically viable, due to the present high capital costs involved.

Step count algorithm adapted to indoor localization

This paper presents a step count algorithm designed to work in real-time using low computational power. This proposal is our first step for the development of an indoor navigation system, based on Pedestrian Dead Reckoning (PDR). We present two approaches to solve this problem and compare them based in their error on step counting, as well as, the capability of their use in a real time system.

Molecular details of INH-C-10 binding to wt KatG and Its S315T mutant

Isoniazid (INH) is still one of the two most effective antitubercular drugs and is included in all recommended multitherapeutic regimens. Because of the increasing resistance of Mycobacterium tuberculosis to INH, mainly associated with mutations in the katG gene, new INH-based compounds have been proposed to circumvent this problem. In this work, we present a detailed comparative study of the molecular determinants of the interactions between wt KatG or its S315T mutant form and either INH or INH-C10, a new acylated INH derivative. MD simulations were used to explore the conformational space of both proteins, and results indicate that the S315T mutation did not have a significant impact on the average size of the access tunnel in the vicinity of these residues. Our simulations also indicate that the steric hindrance role assigned to Asp137 is transient and that electrostatic changes can be important in understanding the enzyme activity data of mutations in KatG. Additionally, molecular docking studies were used to determine the preferred modes of binding of the two substrates. Upon mutation, the apparently less favored docking solution for reaction became the most abundant, suggesting that S315T mutation favors less optimal binding modes. Moreover, the aliphatic tail in INH-C10 seems to bring the hydrazine group closer to the heme, thus favoring the apparent most reactive binding mode, regardless of the enzyme form. The ITC data is in agreement with our interpretation of the C10 alkyl chain role and helped to rationalize the significantly lower experimental MIC value observed for INH-C10. This compound seems to be able to counterbalance most of the conformational restrictions introduced by the mutation, which are thought to be responsible for the decrease in INH activity in the mutated strain. Therefore, INH-C10 appears to be a very promising lead compound for drug development.

Application-Specific Modified Particle Swarm Optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding the management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

Resolução do problema de atribuição de salas a exames

Este trabalho pretende resolver o problema das alocações de salas a exames no Departamento de Engenharia Mecânica do Instituto Superior de Engenharia do Porto. A solução desenvolvida atribui salas a exames respeitando as restrições de capacidade de salas e a restrição de realização dum único exame por sala num determinado período, por forma a minimizar a atribuição de salas e, consequentemente, docentes a exames. Foi criado um modelo matemático, que representa as variáveis relevantes do problema, e realiza a sua implementação numa plataforma informática amigável para o utilizador. O modelo matemático foi validado comparando as suas soluções com as obtidas através do processo manual. Os resultados do novo método demonstram a sua supremacia relativamente ao modelo atual. No futuro, poderá ser estudada a possibilidade de usar esta ferramenta na resolução do mesmo problema em realidades diferentes da do Departamento de Engenharia Mecânica do ISEP.

An Extension of Estimation of Domain of Attraction for Fractional Order Linear System Subject to Saturation Control

This paper employs the Lyapunov direct method for the stability analysis of fractional order linear systems subject to input saturation. A new stability condition based on saturation function is adopted for estimating the domain of attraction via ellipsoid approach. To further improve this estimation, the auxiliary feedback is also supported by the concept of stability region. The advantages of the proposed method are twofold: (1) it is straightforward to handle the problem both in analysis and design because of using Lyapunov method, (2) the estimation leads to less conservative results. A numerical example illustrates the feasibility of the proposed method.

Task partitioning and priority assignment for distributed hard real-time systems

In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic that finds a feasible partitioning and priority assignment for distributed applications based on the linear transactional model. DOPA partitions the tasks and messages in the distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm known as Audsley’s algorithm, to find the priorities for that partition. The experimental results show how the use of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the use of Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these results to the assignment of Parallel/Distributed applications and present a second heuristic named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction transformation algorithm introduced in [1].

Crowdsourcing innovation: a strategy to leverage enterprise innovation

Innovation is recognized by academics and practitioners as an essential competitive enabler for any company to survive, to remain competitive and to grow. Investments in tasks of R&D have not always brought the expected results. But that doesn't mean that the outcomes would not be useful to other companies of the same business area or even from another area. Thus, there is much knowledge already available in the market that can be helpful to some and profitable to others. So, the ideas and expertise can be found outside a company's boundaries and also exported from within. Information, knowledge, experience, wisdom is already available in the millions of the human beings of this planet, the challenge is to use them through a network to produce new ideas and tips that can be useful to a company with less costs. This was the reason for the emergence of the area of crowdsourcing innovation. Crowdsourcing innovation is a way of using the Web 2.0 tools to generate new ideas through the heterogeneous knowledge available in the global network of individuals highly qualified and with easy access to information and technology. So, a crowdsourcing innovation broker is an organization that mediates the communication and relationship between the seekers - companies that aspire to solve some problem or to take advantage of any business opportunity - with a crowd that is prone to give ideas based on their knowledge, experience and wisdom. This paper makes a literature review on models of open innovation, crowdsourcing innovation, and technology and knowledge intermediaries, and discusses this new phenomenon as a way to leverage the innovation capacity of enterprises. Finally, the paper outlines a research design agendafor explaining crowdsourcing innovation brokering phenomenon, exploiting its players, main functions, value creation process, and knowledge creation in order to define a knowledge metamodel of such intermediaries.

How to engage low category users through social media: The case of the make-up sector in Portugal

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

How to engage low category users through social media- The case of the make-up sector in Portugal

Purpose: This work project should be inevitably deemed as a practical approach to a marketing problem; “How to engage low category users through the social media – the case of the make-up sector in Portugal”. Design/methodology/approach: Online structured questionnaires and in-depth interviews were used. The questionnaire was answered by 110 women aged from 15 to 45 years old and the interviews were conducted with 14 women of the same age. The interviews provided key insights for the questionnaire formulation. Findings: Women are poorly informed on make-up properties and characteristics, feeling a genuine concern in regard to this subject. Lack of time, occasional usage and skin damage are the main barriers for make-up usage by low category users. Overcoming these aspects pass by demystifying the association of make-up with skin damage and emphasise the functional and emotional benefits of make-up. Further, brands need to create contents more consumer-oriented and ask directly to fans/followers suggestions and other insights. Resort to Portuguese “common” women for greater empathy in campaigns, promote online meetings between followers and make-up professionals on social media; and finally take advantage of the hybrid condition of Facebook, which incorporates multiple forms of content presentation, including videos, the most appealing format of make-up presentation for women. Research limitations/implications: Further studies addressing this topic, by using larger samples and study of specific make-up brands and campaign programs, over social media to reach a solid growth potential of make-up market evidences in Portugal. Originality/ value: Make-up brands are emphasising their interest in linking social media and marketing their promotional mix around social marketing.

Um modelo de programação inteira para a otimização da distribuição do serviço docente

Dissertação de mestrado em Engenharia Industrial

Periodic orbits of the planar collision restricted 3-body problem

Using the continuation method we prove that the circular and the elliptic symmetric periodic orbits of the planar rotating Kepler problem can be continued into periodic orbits of the planar collision restricted 3–body problem. Additionally, we also continue to this restricted problem the so called “comets orbits”.