992 resultados para shift radix systems


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation to obtain the degree of Doctor in Electrical and Computer Engineering, specialization of Collaborative Networks

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Thesis for the Degree of Master of Science in Bioorganic Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation presented to obtain a Master degree in Biotechnology

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation presented to obtain the Ph.D degree in Ciências da Engenharia e Tecnologia, especialidade Biotecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertation to obtain a Master Degree in Biotechnology

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove a one-to-one correspondence between (i) C1+ conjugacy classes of C1+H Cantor exchange systems that are C1+H fixed points of renormalization and (ii) C1+ conjugacy classes of C1+H diffeomorphisms f with a codimension 1 hyperbolic attractor Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. However, we prove that there is no C1+alpha Cantor exchange system, with bounded geometry, that is a C1+alpha fixed point of renormalization with regularity alpha greater than the Hausdorff dimension of its invariant Cantor set.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We exhibit the construction of stable arc exchange systems from the stable laminations of hyperbolic diffeomorphisms. We prove a one-to-one correspondence between (i) Lipshitz conjugacy classes of C(1+H) stable arc exchange systems that are C(1+H) fixed points of renormalization and (ii) Lipshitz conjugacy classes of C(1+H) diffeomorphisms f with hyperbolic basic sets Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. Let HD(s)(Lambda) and HD(u)(Lambda) be, respectively, the Hausdorff dimension of the stable and unstable leaves intersected with the hyperbolic basic set L. If HD(u)(Lambda) = 1, then the Lipschitz conjugacy is, in fact, a C(1+H) conjugacy in (i) and (ii). We prove that if the stable arc exchange system is a C(1+HDs+alpha) fixed point of renormalization with bounded geometry, then the stable arc exchange system is smooth conjugate to an affine stable arc exchange system.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An ever increasing need for extra functionality in a single embedded system demands for extra Input/Output (I/O) devices, which are usually connected externally and are expensive in terms of energy consumption. To reduce their energy consumption, these devices are equipped with power saving mechanisms. While I/O device scheduling for real-time (RT) systems with such power saving features has been studied in the past, the use of energy resources by these scheduling algorithms may be improved. Technology enhancements in the semiconductor industry have allowed the hardware vendors to reduce the device transition and energy overheads. The decrease in overhead of sleep transitions has opened new opportunities to further reduce the device energy consumption. In this research effort, we propose an intra-task device scheduling algorithm for real-time systems that wakes up a device on demand and reduces its active time while ensuring system schedulability. This intra-task device scheduling algorithm is extended for devices with multiple sleep states to further minimise the overall device energy consumption of the system. The proposed algorithms have less complexity when compared to the conservative inter-task device scheduling algorithms. The system model used relaxes some of the assumptions commonly made in the state-of-the-art that restrict their practical relevance. Apart from the aforementioned advantages, the proposed algorithms are shown to demonstrate the substantial energy savings.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The last decade has witnessed a major shift towards the deployment of embedded applications on multi-core platforms. However, real-time applications have not been able to fully benefit from this transition, as the computational gains offered by multi-cores are often offset by performance degradation due to shared resources, such as main memory. To efficiently use multi-core platforms for real-time systems, it is hence essential to tightly bound the interference when accessing shared resources. Although there has been much recent work in this area, a remaining key problem is to address the diversity of memory arbiters in the analysis to make it applicable to a wide range of systems. This work handles diverse arbiters by proposing a general framework to compute the maximum interference caused by the shared memory bus and its impact on the execution time of the tasks running on the cores, considering different bus arbiters. Our novel approach clearly demarcates the arbiter-dependent and independent stages in the analysis of these upper bounds. The arbiter-dependent phase takes the arbiter and the task memory-traffic pattern as inputs and produces a model of the availability of the bus to a given task. Then, based on the availability of the bus, the arbiter-independent phase determines the worst-case request-release scenario that maximizes the interference experienced by the tasks due to the contention for the bus. We show that the framework addresses the diversity problem by applying it to a memory bus shared by a fixed-priority arbiter, a time-division multiplexing (TDM) arbiter, and an unspecified work-conserving arbiter using applications from the MediaBench test suite. We also experimentally evaluate the quality of the analysis by comparison with a state-of-the-art TDM analysis approach and consistently showing a considerable reduction in maximum interference.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

RESUMO - Nas últimas décadas, a especialização dos cuidados médicos tem conduzido a uma fragmentação do sistema de prestação, que, associada a uma deficiente coordenação entre serviços, cuidados e prestadores, torna a navegabilidade dos utentes nos sistemas de saúde uma tarefa complexa. Um novo modelo de organização, assente na procura de valor para os cidadãos, deve adoptar uma abordagem sistémica, que tenha subjacente uma coordenação integrada de serviços, numa perspectiva de ciclo de cuidados. Reorientar a prestação de cuidados para a obtenção de resultados e valor em saúde, exige uma reengenharia em torno da estrutura, organização e avaliação1 dos cuidados, requerendo, nomeadamente: i) instrumentos e ferramentas que auxiliem e estruturem este novo modelo; ii) assumpção dos papéis definidos para cada um dos actores do sistema, nomeadamente ao nível da coordenação; iii) encorajamento à adopção de modelos de contratualização, pagamento e competição, que responsabilizem os actores envolvidos não só pela prática que desenvolvem, mas pelos resultados em saúde. Estes mecanismos constituem uma oportunidade para expandir e sustentar abordagens, programas e intervenções integradas. Investir num sistema de pagamento por valor em saúde — P4V — payment for value, traduz uma aposta na relação entre diagnóstico, tratamento, resultados clínicos e custos, enquanto estratégia para assegurar ganhos em qualidade dos cuidados, eficiência dos processos e valor em saúde para o cidadão. Neste contexto, a gestão da doença enquanto modelo direccionado para o reforço da perspectiva e participação activa do cidadão, e avaliação compreensiva de novas formas de organização e gestão do sistema de prestação, constitui um instrumento para informar e sustentar esse processo de reengenharia do sistema. Um modelo que procura assegurar o encontro entre o estado da arte na prestação de cuidados e um nível óptimo, garantindo a qualidade de vida expectável para a pessoa com doença crónica. ----------------- ---------ABSTRACT – In the last decades advanced medical sciences trend to specialized care and fragmented health systems, leaving patients with a challenge on navigating services and care, requiring them to see a sequence of specialists each delivering discrete interventions. To overcome these challenges, every health system must redefine health care delivery to use its resources more efficiently and improve quality of care through an organization of the system as a whole. A system currently organized around value for patients, entails a framework that comprises the entire set of activities needed to address a patient´s medical condition, over the full cycle of care. Value- based care delivery therefore requires an integrated practice, both across services and time, and implies a movement through new structures, organization models, evaluation efforts and payment systems that enables, catalyze and reinforces the extension and sustainability of the steps needed to the change required. A shift from a payment for performance to a payment for value focuses attention on maximizing the overall value of care, and encourages coordination and integration between components of care that extends from screening, diagnoses, all the way through treatment, outcomes and costs, and ensuring an incentive for potentially high value types of care as well as innovation. These leave the actors of the system with the task of best allocating and valuing components of care. Disease management as a model designed to structure patient engagement and involvement in their care, and assure a comprehensive evaluation and monitoring of new organization and care delivery strategies align an opportunity as a source of information and sustainability for the progress of a growing number of likeminded efforts now underway across care delivery for chronic diseases. This framework will allow the fulfillment of the gap between sta

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this manuscript we tackle the problem of semidistributed user selection with distributed linear precoding for sum rate maximization in multiuser multicell systems. A set of adjacent base stations (BS) form a cluster in order to perform coordinated transmission to cell-edge users, and coordination is carried out through a central processing unit (CU). However, the message exchange between BSs and the CU is limited to scheduling control signaling and no user data or channel state information (CSI) exchange is allowed. In the considered multicell coordinated approach, each BS has its own set of cell-edge users and transmits only to one intended user while interference to non-intended users at other BSs is suppressed by signal steering (precoding). We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF) and Distributed Virtual Signalto-Interference-plus-Noise Ratio (DVSINR). Considering multiple users per cell and the backhaul limitations, the BSs rely on local CSI to solve the user selection problem. First we investigate how the signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs impact the effective channel gain (the magnitude of the channels after precoding) and its relationship with multiuser diversity. Considering that user selection must be based on the type of implemented precoding, we develop metrics of compatibility (estimations of the effective channel gains) that can be computed from local CSI at each BS and reported to the CU for scheduling decisions. Based on such metrics, we design user selection algorithms that can find a set of users that potentially maximizes the sum rate. Numerical results show the effectiveness of the proposed metrics and algorithms for different configurations of users and antennas at the base stations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

4th International Conference on Future Generation Communication Technologies (FGCT 2015), Luton, United Kingdom.