946 resultados para incremental computation
Resumo:
This paper is a contribution for the assessment and comparison of magnet properties based on magnetic field characteristics particularly concerning the magnetic induction uniformity in the air gaps. For this aim, a solver was developed and implemented to determine the magnetic field of a magnetic core to be used in Fast Field Cycling (FFC) Nuclear Magnetic Resonance (NMR) relaxometry. The electromagnetic field computation is based on a 2D finite-element method (FEM) using both the scalar and the vector potential formulation. Results for the magnetic field lines and the magnetic induction vector in the air gap are presented. The target magnetic induction is 0.2 T, which is a typical requirement of the FFC NMR technique, which can be achieved with a magnetic core based on permanent magnets or coils. In addition, this application requires high magnetic induction uniformity. To achieve this goal, a solution including superconducting pieces is analyzed. Results are compared with a different FEM program.
Resumo:
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.
Resumo:
OBJETIVO: Conduzir uma análise de custo-efetividade das alternativas medicamentosas com terapia de resgate na recaída por resistência viral para tratamento de pacientes com hepatite crônica B (HCB). MÉTODOS: Coorte hipotética de pacientes com HCB, HBeAg negativo, sem evidência clínica ou histológica de cirrose, DNA do VHB detectável, diagnóstico histológico da doença, HBsAg positivo no soro por mais de seis meses, elevados níveis de alanina transferase (ALT) (duas vezes maior que o limite superior da normalidade [LSN]) e média de idade de 40 anos. Modelo de Markov foi desenvolvido para a hepatite crônica B (antígeno HBeAg negativo) com horizonte temporal de 40 anos. Custos e benefícios foram descontados em 5%. As taxas anuais de progressão, custos devido a complicações e a eficácia dos medicamentos foram obtidos da literatura. As incertezas foram avaliadas por análises de sensibilidade unidirecional e probabilística. RESULTADOS: Iniciar o tratamento com entecavir resultou em 0,35 ano de vida ganho em relação à lamivudina. A razão de custo-efetividade incremental foi de R$ 16.416,08 por anos de vida ganhos. Na análise de sensibilidade a razão de custo-efetividade incremental foi mais sensível à variação na probabilidade de transição de hepatite crônica B para cirrose compensada, taxa de desconto e preço dos medicamentos (± 10%). Na análise de sensibilidade probabilística, a curva de aceitabilidade mostrou que iniciar com entecavir foi a alternativa mais custo-efetiva na comparação ao uso de lamivudina. CONCLUSÕES: A disponibilidade do entecavir é economicamente atrativa como parte do tratamento precoce para pacientes com hepatite crônica B sem coinfecção com o HIV.
Resumo:
Dissertação de natureza Científica para obtenção do grau de Mestre em Engenharia Civil
Resumo:
Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.
Resumo:
Our day-to-day life is dependent on several embedded devices, and in the near future, many more objects will have computation and communication capabilities enabling an Internet of Things. Correspondingly, with an increase in the interaction of these devices around us, developing novel applications is set to become challenging with current software infrastructures. In this paper, we argue that a new paradigm for operating systems needs to be conceptualized to provide aconducive base for application development on Cyber-physical systems. We demonstrate its need and importance using a few use-case scenarios and provide the design principles behind, and an architecture of a co-operating system or CoS that can serve as an example of this new paradigm.
Resumo:
Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.
Resumo:
This paper proposes a stochastic mixed-integer linear approach to deal with a short-term unit commitment problem with uncertainty on a deregulated electricity market that includes day-ahead bidding and bilateral contracts. The proposed approach considers the typically operation constraints on the thermal units and a spinning reserve. The uncertainty is due to the electricity prices, which are modeled by a scenario set, allowing an acceptable computation. Moreover, emission allowances are considered in a manner to allow for the consideration of environmental constraints. A case study to illustrate the usefulness of the proposed approach is presented and an assessment of the cost for the spinning reserve is obtained by a comparison between the situation with and without spinning reserve.
Resumo:
OBJETIVO Avaliar o custo-efetividade de diferentes tratamentos medicamentosos para hepatite B crônica entre pacientes adultos. MÉTODOS Utilizando modelo de Markov, construiu-se coorte hipotética de 40 anos para pacientes HBeAg-positivo ou HBeAg-negativo. Foram comparados os usos de adefovir, entecavir, tenofovir e lamivudina (com terapia de resgate em caso de resistência viral) para tratamento de pacientes adultos com hepatite B crônica, virgens de tratamento, com elevados níveis de alanina aminotransferase, sem evidência de cirrose e sem coinfecção por HIV. Valores para custo e efeito foram obtidos da literatura. A medida do efeito foi expressa em anos de vida ganhos (AVG). Taxa de desconto de 5% foi aplicada. Análise de sensibilidade univariada foi conduzida para avaliar incertezas do modelo. RESULTADOS O tratamento inicial com entecavir ou tenofovir apresentou melhores resultados clínicos. As menores razões custo-efetividade foram de entecavir para pacientes HBeAg-positivo (R$ 4.010,84/AVG) e lamivudina para pacientes HBeAg-negativo (R$ 6.205,08/AVG). Para pacientes HBeAg-negativo, a razão custo-efetividade incremental de entecavir (R$ 14.101,05/AVG) está abaixo do limiar recomendado pela Organização Mundial da Saúde. Análise de sensibilidade mostrou que variação nos custos dos medicamentos pode tornar tenofovir alternativa custo-efetiva tanto para pacientes HBeAg-positivo quanto para HBeAg-negativo. CONCLUSÕES Entecavir é alternativa recomendada para iniciar o tratamento de pacientes com hepatite B crônica no Brasil. Contudo, se houver redução no custo de tenofovir, esta pode se tornar alternativa mais custo-efetiva.
Resumo:
This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.
Resumo:
Distributed real-time systems, such as factory automation systems, require that computer nodes communicate with a known and low bound on the communication delay. This can be achieved with traditional time division multiple access (TDMA). But improved flexibility and simpler upgrades are possible through the use of TDMA with slot-skipping (TDMA/SS), meaning that a slot is skipped whenever it is not used and consequently the slot after the skipped slot starts earlier. We propose a schedulability analysis for TDMA/SS. We assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to deadline monotonic. Firstly, we present a non-exact (but fast) analysis and then, at the cost of computation time, we also present an algorithm that computes exact queuing times.
Resumo:
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.
Resumo:
There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.
Resumo:
This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.
Resumo:
A brief introduction to the fractional continuous-time linear systems is presented. It will be done without needing a deep study of the fractional derivatives. We will show that the computation of the impulse and step responses is very similar to the classic. The main difference lies in the substitution of the exponential by the Mittag-Leffler function. We will present also the main formulae defining the fractional derivatives.