976 resultados para Patent citation
Resumo:
Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.
Resumo:
Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.
Resumo:
Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.
Resumo:
“Many-core” systems based on a Network-on-Chip (NoC) architecture offer various opportunities in terms of performance and computing capabilities, but at the same time they pose many challenges for the deployment of real-time systems, which must fulfill specific timing requirements at runtime. It is therefore essential to identify, at design time, the parameters that have an impact on the execution time of the tasks deployed on these systems and the upper bounds on the other key parameters. The focus of this work is to determine an upper bound on the traversal time of a packet when it is transmitted over the NoC infrastructure. Towards this aim, we first identify and explore some limitations in the existing recursive-calculus-based approaches to compute the Worst-Case Traversal Time (WCTT) of a packet. Then, we extend the existing model by integrating the characteristics of the tasks that generate the packets. For this extended model, we propose an algorithm called “Branch and Prune” (BP). Our proposed method provides tighter and safe estimates than the existing recursive-calculus-based approaches. Finally, we introduce a more general approach, namely “Branch, Prune and Collapse” (BPC) which offers a configurable parameter that provides a flexible trade-off between the computational complexity and the tightness of the computed estimate. The recursive-calculus methods and BP present two special cases of BPC when a trade-off parameter is 1 or ∞, respectively. Through simulations, we analyze this trade-off, reason about the implications of certain choices, and also provide some case studies to observe the impact of task parameters on the WCTT estimates.
Resumo:
Introdução – Ao aumento exponencial de informação, sobretudo a científica, não corresponde obrigatoriamente a melhoria de qualidade na pesquisa e no uso da mesma. O conceito de literacia da informação ganha pertinência e destaque, na medida em que abarca competências que permitem reconhecer quando é necessária a informação e de atuar de forma eficiente e efetiva na sua obtenção e utilização. A biblioteca académica assume, neste contexto, o papel de parceiro privilegiado, preparando o momento em que o estudante se sente capaz de produzir e registar novo conhecimento através da escrita. Objectivo – A Biblioteca da ESTeSL reestruturou as sessões desenvolvidas desde o ano lectivo 2002/2003 e deu início a um projecto mais formal denominado «Saber usar a informação de forma eficiente e eficaz». Objectivos: a) promover a melhoria da qualidade dos trabalhos académicos e científicos; b) contribuir para a diminuição do risco de plágio; c) aumentar a confiança dos estudantes nas suas capacidades de utilização dos recursos de informação; d) incentivar uma participação mais ativa em sala de aulas; e) colaborar para a integração dos conteúdos pedagógicos e das várias fontes de informação. Método – Dinamizaram-se várias sessões de formação de curta duração, versando diferentes temas associados à literacia de informação, designadamente: 1) Pesquisa de informação com sessões dedicadas à MEDLINE, RCAAP, SciELO, B-ON e Scopus; 2) Factor de impacto das revistas científicas: Journal Citation Reports e SciMAGO; 3) Como fazer um resumo científico?; 4) Como estruturar o trabalho científico?; 5) Como fazer uma apresentação oral?; 6) Como evitar o plágio?; 7) Referenciação bibliográfica usando a norma de Vancouver; 8) Utilização de gestores de referências bibliográficas: ZOTERO (primeira abordagem para os estudantes de 1º ano de licenciatura) e a gestão de referências e rede académica de informação com o MENDELEY (direcionado para estudantes finalistas, mestrandos, docentes e investigadores). O projecto foi apresentado à comunidade académica no site da ESTeSL; cada sessão foi divulgada individualmente no site e por email. Em 2015, a divulgação investiu na nova página da Biblioteca (https://estesl.biblio.ipl.pt/), que alojava informações e recursos abordados nas formações. As inscrições eram feitas por email, sem custos associados ou limite mínimo ou máximo de sessões para participar. Resultados – Em 2014 registaram-se 87 inscrições. Constatou-se a presença de, pelo menos, um participante em cada sessão de formação. Em 2015, o total de inscrições foi de 190. Foram reagendadas novas sessões a pedido dos estudantes cujos horários não eram compatíveis com os inicialmente agendados. Foram então organizados dois dias de formação seguida (cerca de 4h em cada dia) com conteúdos selecionados pelos estudantes. Registou-se, nestas sessões, a presença contante de cerca de 30 estudantes em sala. No total, as sessões da literacia da informação contaram com estudantes de licenciatura de todos os anos, estudantes de mestrado, docentes e investigadores (internos e externos à ESTeSL). Conclusões – Constata-se a necessidade de introdução de novos conteúdos no projeto de literacia da informação. O tempo, os conteúdos e o interesse demonstrado por aqueles que dele usufruíram evidenciam que este é um projeto que está a ganhar o seu espaço na comunidade da ESTeSL e que a literacia da informação contribui de forma efetiva para a construção e para a produção de conhecimento no meio académico.
Resumo:
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.
Resumo:
Relatório de Estágio apresentado ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Marketing Digital, sob orientação do Mestre Especialista António Silva Vieira
Resumo:
Direct blood examination and xenodiagnosis of 47 synanthropic rodents (Rattus rattus, R. norvegicus, Mus musculus) captured in the valley of Caracas, Venezuela, revealed trypanosomal infections in 12 R. rattus, 10 with T. lewisi and 2 with T. cruzi. Of the latter the course of parasitemia, the pleomorphism of the bloodstream trypomastigotes, tissue tropism in naturally and experimentally infected rats and mice, host mortality, morphology of fecal parasites in Rhodnius prolixus used for xenodiagnosis, and infectivity of the bug feces for NMRI mice, were all characteristic of Trypanosoma (Schizotrypanum) cruzi. One rat, with a patent parasitemia, had numerous nests of amastigotes in cardiac muscle and moderate parasitism of the smooth muscle of the duodenum and of skeletal muscle. Mice inoculated with fecal flagellates from the bugs had moderate tissue tropism in the same organs and also in the colon and pancreas. The possible role of R. rattus in the establishment of foci of Chagas disease in Caracas is discussed
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Doutor no Ramo da Engenharia Biomédica,Especialidade Biomecânica
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Biotecnologia
Resumo:
Infotainment applications in vehicles are currently supported both by the in-vehicle platform, as well as by user’s smart devices, such as smartphones and tablets. More and more the user expects that there is a continuous service of applications inside or outside of the vehicle, provided in any of these devices (a simple but common example is hands-free mobile phone calls provided by the vehicle platform). With the increasing complexity of ‘apps’, it is necessary to support increasing levels of Quality of Service (QoS), with varying resource requirements. Users may want to start listening to music in the smartphone, or video in the tablet, being this application transparently ‘moved’ into the vehicle when it is started. This paper presents an adaptable offloading mechanism, following a service-oriented architecture pattern, which takes into account the QoS requirements of the applications being executed when making decisions.
Resumo:
This article introduces schedulability analysis for global fixed priority scheduling with deferred preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved using gFPDS via appropriate choice of priority assignment and final non-pre-emptive region lengths, and provide algorithms which optimize schedulability in this way. Via an experimental evaluation we compare the performance of multiprocessor scheduling using global approaches: gFPDS, gFPPS, and gFPNS, and also partitioned approaches employing FPDS, FPPS, and FPNS on each processor.
Resumo:
Over the past decades several approaches for schedulability analysis have been proposed for both uni-processor and multi-processor real-time systems. Although different techniques are employed, very little has been put forward in using formal specifications, with the consequent possibility for mis-interpretations or ambiguities in the problem statement. Using a logic based approach to schedulability analysis in the design of hard real-time systems eases the synthesis of correct-by-construction procedures for both static and dynamic verification processes. In this paper we propose a novel approach to schedulability analysis based on a timed temporal logic with time durations. Our approach subsumes classical methods for uni-processor scheduling analysis over compositional resource models by providing the developer with counter-examples, and by ruling out schedules that cause unsafe violations on the system. We also provide an example showing the effectiveness of our proposal.
Encerramento Percutâneo de Shunts Interauriculares: Experiência de uma Década de um Centro Terciário
Resumo:
INTRODUCTION: Atrial septal defects (ASD) are among the most common congenital anomalies and account for 10% of congenital heart disease in the pediatric age-group and 30% in adults. Closure is indicated when there is evidence of hemodynamic significance or after a paradoxical embolic event. Ten years ago, percutaneous closure became the treatment of choice in our center for all patients with a clear indication and favorable anatomy. In this paper we report the experience of this first decade. OBJECTIVE: To assess the short- and long-term results of our ten-year experience with percutaneous closure of atrial septal defects. METHODS: We studied retrospectively all patients with ASD treated with a percutaneous approach between November 1998 and December 2008. The pediatric age-group consisted of patients younger than 19 years old. Demographic data, clinical indications, minor and major complication rates, success rate and long-term outcome were assessed. RESULTS: In the first ten years of experience 510 patients, of whom 166 were in the pediatric group, were treated in our center by a team of adult and pediatric cardiologists. The overall success rate of the procedure was 98% (97.5% in ASD and 99.5% in patent foramen ovale (PFO). The minor complication rate was 3% (3.4% in ASD and 2% in PFO). The most frequent complication was supraventricular tachycardia. The major complication rate was 1.2% (0.6% in ASD and 2% in PFO). Two patients developed cardiac tamponade due to hemopericardium that was resolved by pericardiocentesis, without need for surgery. One patient had an arterial pseudoaneurysm corrected by vascular surgery. There was no device embolization and no need for urgent surgery in this population. During follow-up two patients had recurrence of ischemic stroke, one had a transient ischemic attack and another had a hemorrhagic stroke. Mortality was 0.6% (0.6% in ASD and 0.5% in PFO). There were no in-hospital deaths. During follow-up there were two deaths, both in the adult group. DISCUSSION AND CONCLUSION: In this population the success rate was high and most of the complications were minor. The results of this collaboration between adult and pediatric cardiologists in the first ten years of activity confirm the safety and efficacy of percutaneous closure of septal defects, when there is careful patient selection and a standardized technique.
Resumo:
OBJECTIVES: Atrio-ventricular septal (AVSD) defects include a variable spectrum of congenital malformations with different forms of clinical presentation. We report the surgical results, from a single institution, with this type of congenital cardiac malformation. Patients with hypoplasia of one of the ventricles were excluded from this analysis. POPULATION: Between November of 1998 and June of 2005, 49 patients with AVSD were operated on by the same team and in the same department. The average age was 37.3 months (medium 6 months) and 31 patients were female. In 38 patients (78%) an inter-ventricular communication was present (AVSD-complete) and of these, 26 were of the type A of Rastelli, being 13 of type B or C. The age for defect correction of the complete form was of 5.5 months, palliative surgery was not carried out on any of the patients. Associated lesions included: Down's syndrome in 22 patients (45%), patent arterial duct in 17 patients (35%), severe AV regurgitation in 4 patients (8%), tetralogy of Fallot in two (4%) and sub-aortic stenosis in one patient (2%). Pre-operatively 10 patients presented severe congestive heart failure and two were mechanically ventilated. RESULTS: Complete biventricular correction was carried out in all patients. The average time on bypass (ECC) was 74.1+/-17.5 min. and time of aortic clamping was 52.0+/-12.9 min. The complete defects were corrected by the double patch technique, and in all patients the mitral cleft was closed, except in two with single papillary muscle. There was no intra-operative mortality, but hospital mortality was 8%(4 patients), due to pulmonary hypertension crises, in the first 15 post-operative days. The mean ventilation time was of 36.5+/-93 hours (medium 7 h) and the average ICU stay was of 4.3+/-4.8 days (medium 3 days). The minimum follow-up period is 1 month and the maximum is 84 months (medium 29.5 months), during which time 4 re-operations (8%) took place: two for residual VSD's and two for mitral regurgitation. There was no mortality at re-do surgery. At follow up there was residual mitral regurgitation, mild in 17 patients and moderate in two. Four other patients presented with minor residual defects. CONCLUSIONS: The complete correction of AVSD can be carried out with acceptable results, in a varied spectrum of anatomic forms and of clinical severity. Despite the age of correction, for the complete forms, predominantly below 12 months, pulmonary hypertension was the constant cause for post operative mortality. Earlier timing of surgery and stricter peri-operative control might still improve results.