13 resultados para Cryptographic Protocols, Provable Security, ID-Based Cryptography


Relevância:

100.00% 100.00%

Publicador:

Resumo:

RESUMO: O Líbano é um pequeno país na costa leste do Mar Mediterrâneo, com uma população de aproximadamente 4.350.000 pessoas, incluindo 1,5 milhões de refugiados, 400 mil dos quais são palestinos atendidos pela UNRWA (Agência das Nações Unidas de Socorro aos Refugiados da Palestina) (UNHCR, 2013; OMS, 2010a). Desde 2012, um excedente de 1.000.000 refugiados sírios cruzaram a fronteira com o Líbano, representando um aumento populacional de aproximadamente 25%. Além disso, entre 1975 e 1990, a violenta guerra civil pela qual o Líbano passou, destruiu grande parte da infra-estrutura do país, incluindo os serviços de saúde. O sector da saúde, mais especificamente os serviços de saúde mental, é majoritariamente privado. Serviços especializados em Saúde Mental estão disponíveis em três hospitais psiquiátricos privados, e em 4 unidades psiquiátricas de hospitais gerais, que estão localizados centralmente em torno da capital, Beirute. O Líbano é um dos dois únicos países da região que não tem uma Política de Saúde Mental e um dos seis países que não têm uma Legislação em Saúde Mental. Nos últimos anos, a Saúde Mental está sendo colocada no topo da agenda nacional, apesar das contínuas questões políticas e de segurança. Baseando-se nas informações acima, um projecto de estratégia em Saúde Mental, conduzido pelo Ministério da Saúde e apoiado pela OMS, foi escrito para servir como um guia para trabalhar em diferentes aspectos relacionados tanto em saúde mental quanto em organização dos serviços, revisão de legislação, financiamento e proteção dos direitos humanos básicos dos usuários do serviço. Esta tese descreve o processo pelo qual o projecto de estratégia nacional de Saúde Mental foi desenvolvido, seus principais componentes, os próximos passos a serem tomados para a sua implementação, os desafios e as oportunidades para implementá-lo e propõe alguns passos iniciais a serem tomados em primeiro lugar.----------ABSTRACT: Lebanon is a small country on the eastern shore of the Mediterranean Sea with a population of approximately 4,350,000 including 1,500,000 refugees, 400,000 of whom are Palestinians served by UNRWA (the United Nations Relief and Works Agency for Palestine Refugees) (UNHCR, 2013; WHO, 2010a). Since 2012 an excess of 1,000,000 Syrian refugees have crossed the border into Lebanon accounting for approximately 25% increase in the population. In addition, from 1975 to 1990 Lebanon underwent a violent civil war that had also destroyed much of the country infrastructure including health services. The health sector, more so the mental health services, is mostly private. Specialized Mental Health services are available at three private mental hospitals, and 4 psychiatric units within general hospitals, which are located centrally around the capital, Beirut. Lebanon is one of only two countries of the region that does not have a Mental Health policy and one out of the six countries that does not have a Mental Health legislation. In recent years, Mental Health is getting placed higher on the national agenda despite the ever continuing political and security issues. Based on the above, A Mental Health strategy draft, lead by the Ministry of Health and supported by WHO, was written to serve as a guide to work on different aspects related to Mental Health from service organization, to the revision of legislation, financing and the protection of the basic human rights of service users. This thesis describes the process through which the national Mental Health draft strategy was developed, its main components, the next steps to be taken for its implementation, the challenges and the opportunities to implementing it and proposes a few initial steps to be taken first.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação apresentada na Faculdade de Ciências e Tecnologias da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação apresentada para obtenção do Grau de Doutor em Bioquímica pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia.A presente dissertação foi preparada no âmbito do convénio bilateral existente entre a Universidade Nova de Lisboa e a Universidade de Vigo.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This chapter appears in Encyclopaedia of Human Resources Information Systems: Challenges in e-HRM edited by Torres-Coronas, T. and Arias-Oliva, M. Copyright 2009, IGI Global, www.igi-global.com. Posted by permission of the publisher. URL:http://www.igi-pub.com/reference/details.asp?id=7737

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This chapter appears in Encyclopaedia of Distance Learning 2nd Edition edit by Rogers, P.; Berg, Gary; Boettecher, Judith V.; Howard, Caroline; Justice, Lorraine; Schenk, Karen D.. Copyright 2009, IGI Global, www.igi-global.com. Posted by permission of the publisher. URL: http://www.igi-global.com/reference/ details.asp?ID=9703&v=tableOfContents

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Thesis submitted to the Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia, for the degree of Doctor of Philosophy in Biochemistry

Relevância:

30.00% 30.00%

Publicador:

Resumo:

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

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Economics from the NOVA – School of Business and Economics

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Mutable state can be useful in certain algorithms, to structure programs, or for efficiency purposes. However, when shared mutable state is used in non-local or nonobvious ways, the interactions that can occur via aliases to that shared memory can be a source of program errors. Undisciplined uses of shared state may unsafely interfere with local reasoning as other aliases may interleave their changes to the shared state in unexpected ways. We propose a novel technique, rely-guarantee protocols, that structures the interactions between aliases and ensures that only safe interference is possible. We present a linear type system outfitted with our novel sharing mechanism that enables controlled interference over shared mutable resources. Each alias is assigned separate, local roles encoded in a protocol abstraction that constrains how an alias can legally use that shared state. By following the spirit of rely-guarantee reasoning, our rely-guarantee protocols ensure that only safe interference can occur but still allow many interesting uses of shared state, such as going beyond invariant and monotonic usages. This thesis describes the three core mechanisms that enable our type-based technique to work: 1) we show how a protocol models an alias’s perspective on how the shared state evolves and constrains that alias’s interactions with the shared state; 2) we show how protocols can be used while enforcing the agreed interference contract; and finally, 3) we show how to check that all local protocols to some shared state can be safely composed to ensure globally safe interference over that shared memory. The interference caused by shared state is rooted at how the uses of di↵erent aliases to that state may be interleaved (perhaps even in non-deterministic ways) at run-time. Therefore, our technique is mostly agnostic as to whether this interference was the result of alias interleaving caused by sequential or concurrent semantics. We show implementations of our technique in both settings, and highlight their di↵erences. Because sharing is “first-class” (and not tied to a module), we show a polymorphic procedure that enables abstract compositions of protocols. Thus, protocols can be specialized or extended without requiring specific knowledge of the interference produce by other protocols to that state. We show that protocol composition can ensure safety even when considering abstracted protocols. We show that this core composition mechanism is sound, decidable (without the need for manual intervention), and provide an algorithm implementation.