Desenvolvimento de uma ferramenta para cálculo de estruturas em material compósito

Os desafios à engenharia moderna são cada vez maiores, pretendendo-se quase sempre obter estruturas mais leves, com propriedades mecânicas atrativas e muitas vezes com geometrias complexas. Com tais requisitos, um dos materiais que tem vindo a ter uma crescente aplicação é o material compósito. Contudo, no que toca ao cálculo estrutural destes materiais, tudo se torna mais complexo, já que são materiais que geralmente são formados por empilhamento de várias camadas de material heterogéneo, podendo estas encontrarem-se dispostas segundo diferentes orientações. Assim, a utilização de um software que permita a previsão das propriedades mecânicas de uma estrutura em material compósito através da micromecânica, a aplicação da Teoria Clássica dos Laminados e de um critério de rotura, como por exemplo o de Tsai-Hill, é fundamental para agilizar o processo de estudo da estrutura a fabricar. Para dar uma resposta a tal necessidade foi desenvolvida uma aplicação, em MATLAB® GUI, denominada CAFE – Composite Analysis For Engineers, com ambiente gráfico apelativo, que permite determinar todas as variáveis importantes no estudo de estruturas em material compósito. Esta aplicação visa suportar e agilizar a aprendizagem desta área do conhecimento, permitindo também o acesso ao código de cálculo por parte do utilizador, de modo a conhecerem-se as equações utilizadas e, eventualmente, ser alvo de futuros desenvolvimentos. O programa desenvolvido foi alvo de validação, recorrendo-se para tal, a uma comparação dos resultados obtidos entre o respetivo programa e por um outro programa de grande fiabilidade. Assim sendo, concluiu-se que o software CAFE apresenta resultados válidos, encontrando-se apto a ser utilizado.

On the adaptation of broadcast transactions in token-passing fieldbus networks with heterogeneous transmission media

Broadcast networks that are characterised by having different physical layers (PhL) demand some kind of traffic adaptation between segments, in order to avoid traffic congestion in linking devices. In many LANs, this problem is solved by the actual linking devices, which use some kind of flow control mechanism that either tell transmitting stations to pause (the transmission) or just discard frames. In this paper, we address the case of token-passing fieldbus networks operating in a broadcast fashion and involving message transactions over heterogeneous (wired or wireless) physical layers. For the addressed case, real-time and reliability requirements demand a different solution to the traffic adaptation problem. Our approach relies on the insertion of an appropriate idle time before a station issuing a request frame. In this way, we guarantee that the linking devices’ queues do not increase in a way that the timeliness properties of the overall system turn out to be unsuitable for the targeted applications.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

Redes “Fiber To The Home – FTTH”. O despertar de novos serviços de telecomunicações

Se ha poucos anos nao imaginavamos as nossas vidas sem o conforto proporcionado pela iluminacao artificial, fruto do desenvolvimento e proliferacao da producao, transporte e distribuicao de energia electrica, seguramente que nos dias de hoje e indissociavel juntar a esse mesmo conforto e estilo de vida a utilizacao dos meios de telecomunicacoes actuais. Com efeito, a vulgarizacao do uso de telemoveis, a recepcao e transmissao de dados a velocidades cada vez maiores, o aparecimento de televisao de alta definicao (TVAD) em substituicao do actual formato PAL, a surgimento de ofertas de novos servicos como o Video on Demand a par da emergente televisao digital terrestre constituem, seguramente, uma nova revolucao nas infra-estruturas de telecomunicacoes domesticas e profissionais. O sector das telecomunicacoes tem sido aquele que se encontra em pleno crescimento, com os fabricantes e operadores a lancarem novos produtos e solucoes de forma continuada, bem como uma atenta e perspicaz reaccao por parte dos legisladores. Assiste-se verdadeiramente na industria das telecomunicacoes a um movimento relacionado com a convergencia para as redes IP (“Internet Protocol”, ou Protocolo de Internet).

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Energy-conscious tasks partitioning onto a heterogeneous multi-core platform

Modern multicore processors for the embedded market are often heterogeneous in nature. One feature often available are multiple sleep states with varying transition cost for entering and leaving said sleep states. This research effort explores the energy efficient task-mapping on such a heterogeneous multicore platform to reduce overall energy consumption of the system. This is performed in the context of a partitioned scheduling approach and a very realistic power model, which improves over some of the simplifying assumptions often made in the state-of-the-art. The developed heuristic consists of two phases, in the first phase, tasks are allocated to minimise their active energy consumption, while the second phase trades off a higher active energy consumption for an increased ability to exploit savings through more efficient sleep states. Extensive simulations demonstrate the effectiveness of the approach.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Two-type heterogeneous multiprocessor scheduling: Is there a phase transition? (Extended Abstract)

Consider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.

Provably good task assignment on heterogeneous multiprocessor platforms for a restricted case but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We consider a restricted case where the maximum utilization of any task on any processor in the system is no greater than one. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee for this restricted case but for a stronger adversary. We show that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast.

Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

Assigning real-time tasks on heterogeneous multiprocessors with two types of processors

Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance.

Castor fiber na gruta do Caldeirão. Existência, distribuição e extinção do castor em Portugal

Beaver only had been found in Portugal in a Chalcolithic locality, the Vila Nova de S. Pedro castrum. It has now been identified in the Upper Paleolithic (Solutrean) from Gruta do Caldeirão, near Tomar. The species has been found recently at «Gruta do Almonda»; 4 teeth were collected in bed C, older than a Solutrean sequence (see Anexo for details). The species seems to have been rare, as it was also the case with portuguese Miocene Castoridae Enroxenomys minutus and Chalicomys jaegeri. If account is taken of the presence in the Middle Ages until Castille of words meaning beaver (relared to the popular latin Fiber/Biber), it is obvious that these animais still existed then. Such nouns were largely predominant over rhe rather erudite latin (greek deríved) words as Castor,-óris and derived ones, as it could be expected. This allowed us to recognize that veiro should be the corresponding word with Fiber affinities in archaic portuguese. It was previously supposed to mean only expensive furs then imported into Portugal. Indeed it was also a zoonym. Anywày, beaver should be scarce by XIIIth century since it is not included in the quite detailed price list imposed by the «Lei da Almotaçaria» from December 26, 1253 (see Quadro II). Toponyms in veiro and derived words (fig. 2; Quadro III) (plural, feminines, diminutives, inhabited places) give a resrrictive view of rhe Middle Age distribution. Some of them are certainly older than Portugal itself (firsr half of XIlth cenrury); others existed by the XIVth century bur were probably older. Some rare toponyms seem to be derived from the erudite latin Castor,-óris. Nothing suggests that these words were still in use as zoonyms during the Middle Ages. All toponyms are located in regions near rivers and other freshwaters ecologically suitable for beavers, so we can approximately retrace its former, Middle Age disrribution in Portugal (fig. 2; Quadro III). Most of them are locared in the Center-West and Northwest of Portugal, with a suitable c1imate (rainfall in general over 800 mílimerers per year); the only sure geographical exception is Veiros, in Alto Alentejo province, in a region with comparable precipitations and less dry climate conditions than mosr of the territories South of rhe Tagus. There are less and less of these toponyms towards rhe South and the inner part of the country, and they are enrirely lacking in all drier regions from Trás-os-Montes, Beira, Alentejo beyond Tagus' basin, and in Algarve. Nothing suggests beavers lived there, No post-medieval toponym is known, nor any reference after middle XVth century. No such locality was at, or close by to, any frontier. Hence the hypothesis of veiro (et al.} as meaning but points where expensive furs (supposedly known as veiros in general but without c1early saying from what animal they were obrained from) is to be discarded. During the Middle Ages, beaver discriburion concerned all the main river basins from Minho to Tagus ones. Quite rarefied in rhe XIIIth, the beavers may have disappeared from Portugal during the XVth century. Ecological requiremenrs restricted their former distriburion. Vulnerability to natural causes (i.e., severe drought) and to human pressure may have accounted heavily for this species' extinction. Last (1446) reference for Portugal known to us suggests the species was by then almost extinct.

Molecular mobility of n-ethylene glycol dimethacrylate glass formers upon free radical polymerization

Quando um líquido evita a cristalização durante o arrefecimento, diz-se que entra no estado sobrearrefecido. Se a temperatura continuar a diminuir, o consequente aumento da viscosidade reflecte-se na mobilidade molecular de tal maneira que os tempos característicos se tornam da mesma ordem de grandeza que os tempos acessíveis experimentalmente. Se o arrefecimento continuar, o líquido altamente viscoso acaba por vitrificar, i.e. entra no estado vítreo onde apenas os movimentos locais são permitidos. Os monómeros da família n -etileno glicol dimetacrilato ( n -EGDMA, para n = 1 até 4, que constituem o objecto deste estudo, facilmente evitam a cristalização, sendo pois bons candidatos para estudar a mobilidade molecular nos estados sobrearrefecido e vítreo. A Espectroscopia de Relaxação Dieléctrica (DRS) foi a técnica escolhida para obter informação detalhada sobre a sua dinâmica molecular (Capítulos 1 e 2). A primeira parte deste trabalho consistiu na caracterização dieléctrica dos processos de relaxação existentes acima e abaixo da temperatura de transição vítrea (g T ), a qual aumenta com o aumento do peso molecular (w M ), sendo este resultado confirmado por Calorimetria Diferencial de Varrimento (DSC). No que respeita ao processo cooperativo a , associado à transição vítrea, e ao processo secundário b, observa-se uma dependência com w M , enquanto que o outro processo secundário, g , aparenta ser independente deste factor (Capítulo 3). Nos capítulos seguintes, foram levadas a cabo diferentes estratégias com o objectivo de clarificar os mecanismos que estão na origem destas duas relaxações secundárias (b e g ), assim como conhecer a sua respectiva relação com a relaxação principal (a ). Do estudo, em tempo real, da polimerização isotérmica via radicais livres do TrEGDMA por Calorimetria de Varrimento Diferencial com Modulação de Temperatura (TMDSC), levado a cabo a temperaturas abaixo da g T do polímero final, concluem-se entre outros, dois importantes aspectos: i) que a vitrificação do polímero em formação conduz a graus de conversão relativamente baixos, e ii) que o monómero que está por reagir é expulso da rede polimérica que se forma, dando lugar a uma clara separação de fases (Capítulo 4). Com base nesta informação, o passo seguinte foi estudar separadamente a polimerização isotérmica do di-, tri- e tetra-EGDMA, dando especial atenção às alterações de mobilidade do monómero ainda por reagir. Com as restrições impostas pela formação de ligações químicas, as relaxações a e b detectadas no monómero tendem a desaparecer no novo polímero formado, enquanto que a relaxação g se mantém quase inalterada. Os diferentes comportamentos que aparecem durante a polimerização permitiram a atribuição da origem molecular dos processos secundários: o processo g foi associado ao movimento twisting das unidades etileno glicol, enquanto que a rotação dos grupos carboxilo foi relacionada com a relaxação b (Capítulo 5). No que respeita ao próprio polímero, um processo de relaxação adicional foi detectado, pol b , no poly-DEGDMA, poly-TrEGDMA e poly-TeEGDMA, com características similares ao encontrado nos poli(metacrilato de n -alquilo). Este processo foi confirmado e bem caracterizado aquando do estudo da copolimerização do TrEGDMA com acrilato de metilo (MA) para diferentes composições (Capítulo 6). Para finalizar, o EGDMA, o elemento mais pequeno da família de monómeros estudada, além de vitrificar apresenta uma marcada tendência para cristalizar quer a partir do estado líquido ou do estado vítreo. Durante a cristalização, a formação de uma fase rígida afecta principalmente o processo a , cuja intensidade diminui sem no entanto se observarem modificações significativas na dependência do tempo de relaxação característico com a temperatura. Por outro lado, o processo secundário b torna-se melhor definido e mais estreito, o que pode ser interpretado em termos de uma maior homogeneidade dos micro-ambientes associados aos movimentos locais(Capítulo 7).