The Evolution of a Responsibility to Protect in Africa : The African Unions Emerging Peace and Security Regime

The thesis focuses on, and tries to evaluate, the role that the African Union (AU) plays in protecting the peace and security on the African continent. The thesis takes an interdisciplinary approach to the topic by both utilizing international relations and international law theories. The two disciplines are combined in an attempt to understand the evolution of the AU’s commitment to the pragmatist doctrine: responsibility to protect (R2P). The AU charter is considered to be the first international law document to cover R2P as it allows the AU to interfere in the internal affairs of its member states. The R2P doctrine was evolved around the notion of a need to arrive at a consensus in regard to the right to intervene in the face of humanitarian emergencies. A part of the post-Cold War shift in UN behaviour has been to support local solutions to local problems. Hereby the UN acts in collaboration with regional organizations, such as the AU, to achieve the shared aspirations to maintain international peace and security without getting directly involved on the ground. The R2P takes a more holistic and long-term approach to interventions by including an awareness of the need to address the root causes of the crisis in order to prevent future resurrections of conflicts. The doctrine also acknowledges the responsibility of the international community and the intervening parties to actively participate in the rebuilding of the post-conflict state. This requires sustained and well planned support to ensure the development of a stable society.While the AU is committed to implementing R2P, many of the AU’s members are struggling, both ideologically and practically, to uphold the foundations on which legitimate intervention rests, such as the protection of human rights and good governance. The fact that many members are also among the poorest countries in the world adds to the challenges facing the AU. A lack of human and material resources leads to a situation where few countries are willing, or able, to support a long-term commitment to humanitarian interventions. Bad planning and unclear mandates also limit the effectiveness of the interventions. This leaves the AU strongly dependent on regional powerbrokers such as Nigeria and South Africa, which in itself creates new problems in regard to the motivations behind interventions. The current AU charter does not provide sufficient checks and balances to ensure that national interests are not furthered through humanitarian interventions. The lack of resources within the AU also generates worries over what pressure foreign nations and other international actors apply through donor funding. It is impossible for the principle of “local solutions for local problems? to gain ground while this donor conditionality exists.The future of the AU peace and security regime is not established since it still is a work in progress. The direction that these developments will take depends on a wide verity of factors, many of which are beyond the immediate control of the AU.

Network density and the p-median solution

The p-medianmodel is commonly used to find optimal locations of facilities for geographically distributed demands. So far, there are few studies that have considered the importance of the road network in the model. However, Han, Håkansson, and Rebreyend (2013) examined the solutions of the p-median model with densities of the road network varying from 500 to 70,000 nodes. They found as the density went beyond some 10,000 nodes, solutions have no further improvements but gradually worsen. The aim of this study is to check their findings by using an alternative heuristic being vertex substitution, as a complement to their using simulated annealing. We reject the findings in Han et al (2013). The solutions do not further improve as the nodes exceed 10,000, but neither do the solutions deteriorate.

Face Detection and Facial Feature Localization for multi-pose faces and complex backgroundimages

The objective of this thesis work, is to propose an algorithm to detect the faces in a digital image with complex background. A lot of work has already been done in the area of face detection, but drawback of some face detection algorithms is the lack of ability to detect faces with closed eyes and open mouth. Thus facial features form an important basis for detection. The current thesis work focuses on detection of faces based on facial objects. The procedure is composed of three different phases: segmentation phase, filtering phase and localization phase. In segmentation phase, the algorithm utilizes color segmentation to isolate human skin color based on its chrominance properties. In filtering phase, Minkowski addition based object removal (Morphological operations) has been used to remove the non-skin regions. In the last phase, Image Processing and Computer Vision methods have been used to find the existence of facial components in the skin regions.This method is effective on detecting a face region with closed eyes, open mouth and a half profile face. The experiment’s results demonstrated that the detection accuracy is around 85.4% and the detection speed is faster when compared to neural network method and other techniques.

Creating Prestige and Global Networks through Conference Rituals

An international conference is a secular ritual which serves to create, recreate and shape global-wide translocal cultural sharings. Social anthropological theories and methods are used to show that, besides being an information flow junction, the international conference is a network crossroad and a way of socialising new members into aninternational research community. It is also capable of creating prestige and honour for the individual researcher,for the arranging research team, university and city. Rituals do not merely reflect the social relations or cosmology of a society, but are events that in themselves do important things through ritual forms and symbolic statements.

Manoeuvring between anxiety and control : Patients experience of learning to live with diabetes: a lifeworld phenomenological study

Research shows that people with diabetes want their lives to proceed as normally as possible, but some patients experience difficulty in reaching their desired goals with treatment. The learning process is a complex phenomenon interwoven into every facet of life. Patients and healthcare providers often have different perspectives in care which gives different expectations on what the patients need to learn and cope with. The aim of this study, therefore, is to describe the experience of learning to live with diabetes. Interviews were conducted with 12 patients afflicted with type 1 or type 2 diabetes. The interviews were then analysed with reference to the reflective lifeworld research approach. The analysis shows that when the afflicted realize that their bodies undergo changes and that blood sugar levels are not always balanced as earlier in life, they can adjust to their new conditions early. The afflicted must take responsibility for balancing their blood sugar levels and incorporating the illness into their lives. Achieving such goals necessitates knowledge. The search for knowledge and sensitivity to changes are constant requirements for people with diabetes. Learning is driven by the tension caused by the need for and dependence on safe blood sugar control, the fear of losing such control, and the fear of future complications. The most important responsibilities for these patients are aspiring to understand their bodies as lived bodies, ensuring safety and security, and acquiring the knowledge essential to making conscious choices.

How do different densities in a network affect the optimal location of service centers?

The p-median problem is often used to locate p service centers by minimizing their distances to a geographically distributed demand (n). The optimal locations are sensitive to geographical context such as road network and demand points especially when they are asymmetrically distributed in the plane. Most studies focus on evaluating performances of the p-median model when p and n vary. To our knowledge this is not a very well-studied problem when the road network is alternated especially when it is applied in a real world context. The aim in this study is to analyze how the optimal location solutions vary, using the p-median model, when the density in the road network is alternated. The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 service centers we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000. To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when nodes in the road network increase and p is low. When p is high the improvements are larger. The results also show that choice of the best network depends on p. The larger p the larger density of the network is needed. 

Distance measure and the p-median problem in rural areas

The p-median model is used to locate P facilities to serve a geographically distributed population. Conventionally, it is assumed that the population patronize the nearest facility and that the distance between the resident and the facility may be measured by the Euclidean distance. Carling, Han, and Håkansson (2012) compared two network distances with the Euclidean in a rural region witha sparse, heterogeneous network and a non-symmetric distribution of thepopulation. For a coarse network and P small, they found, in contrast to the literature, the Euclidean distance to be problematic. In this paper we extend their work by use of a refined network and study systematically the case when P is of varying size (2-100 facilities). We find that the network distance give as gooda solution as the travel-time network. The Euclidean distance gives solutions some 2-7 per cent worse than the network distances, and the solutions deteriorate with increasing P. Our conclusions extend to intra-urban location problems.

Ubiquitous computing in education : a SWOT analysis by students and teachers

Learning from anywhere anytime is a contemporary phenomenon in the field of education that is thought to be flexible, time and cost saving. The phenomenon is evident in the way computer technology mediates knowledge processes among learners. Computer technology is however, in some instances, faulted. There are studies that highlight drawbacks of computer technology use in learning. In this study we aimed at conducting a SWOT analysis on ubiquitous computing and computer-mediated social interaction and their affect on education. Students and teachers were interviewed on the mentioned concepts using focus group interviews. Our contribution in this study is, identifying what teachers and students perceive to be the strength, weaknesses, opportunities and threats of ubiquitous computing and computer-mediated social interaction in education. We also relate the findings with literature and present a common understanding on the SWOT of these concepts. Results show positive perceptions. Respondents revealed that ubiquitous computing and computer-mediated social interaction are important in their education due to advantages such as flexibility, efficiency in terms of cost and time, ability to acquire computer skills. Nevertheless disadvantages where also mentioned for example health effects, privacy and security issues, noise in the learning environment, to mention but a few. This paper gives suggestions on how to overcome threats mentioned.

How does data quality in a network affect heuristic solutions?

To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly used p-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p). The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (low p) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.