Thesis (MTech (Business Administration)--Cape Peninsula University of Technology, 2009 / Over the years, the history of football has been characterised by several incidents of violence and disasters. According to Helding et al. (2002:4) globally, since 1945, approximately 1,000 people are believed to have lost their lives and about 3,400 people have been injured in nearly 30 serious soccer stadium accidents. In 1989, English soccer witnessed a stampede that left around 96 people dead at Hillsborough stadium in Sheffield during an FA cup semi-final match between Liverpool and Nottingham. Similar incidents in Africa occurred in Ghana in May 2001 when 126 supporters died after a stampede at Accra stadium at the end of a local league game. In South Africa, Ellis Park stadium witnessed a similar disaster on 11 April 2001, which left 43 people dead when soccer giants Kaizer Chiefs and Orlando Pirates clashed in a premier league soccer game. South Africa lost the bid to host the 2004 Olympic Games in Cape Town in favour of Athens and the 2006 FIFA World Cup to Germany as a result of perceived high crime rate. Whether perceived or real, issues of safety and security impact negatively on the image of a host nation. On the other hand, South Africa was selected to host the 2010 FIFA World Cup competition, despite a continued prevalence of high crime rates across the country. More effort from the Government is needed to guarantee adequate safety and security at soccer stadiums, training venues, and other areas used for public gatherings. Stakeholders that deal with safety and security, such as SAPS, Metro Police, Fire Brigade, and emergency medical services, should be deployed in such a way that they can respond quickly to emergency situations. A literature review has shown a close relationship between crime and event tourism. The crime mapping concept, which covers hot spot theory, routine activity, crime pattern approach and rational choice theory, helps in the understanding that some areas may be more affected by crime than others and that criminals' motivations can differ. Some of the most recent mega large-scale events used in the literature review includes: FIFA Soccer World Cup Competitions in Korea/Japan in 2002 and in Germany in 2006. This has provided guidance for South African organisers in terms of dealing with security issues. These examples have also provided a framework of reference on how to garner support and collaboration of national and international security agencies, which are relevant to the staging of the 2010 Soccer World Cup in South Africa. The foundation of this research considers the employees views concerning safety, security and health in Cape Town. It is envisioned that these ideas can strengthen future management decisions with regard to preparing safety, security and emergency services for major events such as the 2010 Soccer World Cup. This should not only involve taking note of security staff ideas, but also incorporating them into the grand national safety and security strategy and ensuring the full implementation of the security strategy at ground-level.

Thesis (DTech(Design)--Cape Peninsula University of Technology, 2009 / Universal Design (UD), as it is known in the USA and elsewhere, is an inclusive approach to designing for the broader population and is rapidly gaining popularity amongst design practitioners and planners globally. Similar non-exclusive approaches have evolved in diverse parts of the world to counter the systemic disablement and exclusion of vulnerable/special populations of users perpetuated by traditional approaches to design. The transdisciplinary field of UD is informed by concilience in accommodating a wide range of related fields, such as education, landscape architecture, architecture, town and regional planning, industrial/product/three-dimensional design, furniture design, interior design, communication/information/graphic design, interaction design, human-computer interaction (HCI)/usability studies, and ergonomics/human factors engineering. UD proposes a collaborative systems approach that benefits from the synergies of cross-functionalism by approaching the diverse challenges facing society through socially responsible design. In so doing, UD can potentially impact such diverse issues as health, transportation, inclusive education, sports and recreation, entertainment, social welfare, inclusive employment, transgenerational/lifespan housing, inclusive tourism, accessibility, safety, and ecological concerns on sustainability.

Teste de propriedades em grafos consiste no estudo de algoritmos aleatórios sublineares que determinam se um grafo $G$ de entrada com $n$ vértices satisfaz uma dada propriedade ou se é necessário adicionar ou remover mais do que $\\epsilon{n \\choose 2}$ arestas para fazer $G$ satisfazê-la, para algum parâmetro $\\epsilon$ de erro fixo. Uma propriedade de grafos $P$ é dita testável se, para todo $\\epsilon > 0$, existe um tal algoritmo para $P$ cujo tempo de execução é independente de $n$. Um dos resultados de maior importância nesta área, provado por Alon e Shapira, afirma que toda propriedade hereditária de grafos é testável. Neste trabalho, apresentamos resultados análogos para torneios --- grafos completos nos quais são dadas orientações para cada aresta. / Graph property testing is the study of randomized sublinear algorithms which decide if an input graph $G$ with $n$ vertices satisfies a given property or if it is necessary to add or remove more than $\\epsilon{n \\choose 2}$ edges to make $G$ satisfy it, for some fixed error parameter $\\epsilon$ . A graph property $P$ is called testable if, for every $\\epsilon > 0$, there is such an algorithm for $P$ whose run time is independent of $n$. One of the most important results in this area is due to Alon and Shapira, who showed that every hereditary graph property is testable. In this work, we show analogous results for tournaments --- complete graphs in which every edge is given an orientation.

Le but principal de cette thèse est de présenter des conditions suffisantes pour garantir l'existence de subdivisions dans les graphes dirigés. Bien que ce genre de questions soit assez bien maitrisé dans le cas des graphes non orientés, très peu de résultats sont connus sur le sujet des graphes dirigés. La conjecture la plus célèbre du domaine est sans doute celle attribuée à Mader en 1985 qui dit qu'il existe une fonction f tel que tout graphe dirigé de degré sortant minimal supérieur à f(k) contient le tournoi transitif sur k sommets comme subdivision. Cette question est toujours ouverte pour k=5. Cette thèse présente quelques résultats intermédiaires tendant vers cette conjecture. Il y est d'abords question de montrer l'existence de subdivisions de graphes dirigés autre que les tournois, en particulier les arborescences entrantes. Il y a aussi la preuve que les graphes dirigés de grand degré sortant contiennent des immersions de grand tournois transitifs, question qui avait été posée en 2011 par DeVos et al. En regardant un autre paramètre, on montre aussi qu'un grand nombre chromatique permet de forcer des subdivisions de certains cycles orientés, ainsi que d'autre structures, pour des graphes dirigés fortement connexes. Cette thèse présente également la preuve de la conjecture de Erd\H{o}s-Sands-Sauer-Woodrow qui dit que les tournois dont les arcs peuvent être partitionnés en k graphes dirigés transitifs peuvent être dominé par un ensemble de sommet dont la taille dépend uniquement de k. Pour finir, cette thèse présente la preuve de deux résultats, un sur l'orientation des hypergraphes et l'autre sur la coloration AVD,utilisant la technique de compression d'entropie. / The main purpose of the thesis was to exhibit sufficient conditions on digraphs to find subdivisions of complex structures. While this type of question is pretty well understood in the case of (undirected) graphs, few things are known for the case of directed graphs (also called digraphs). The most notorious conjecture is probably the one due to Mader in 1985. He asked if there exists a function f such that every digraph with minimum outdegree at least f(k) contains a subdivision of the transitive tournament on k vertices. The conjecture is still wide open as even the existence of f(5) remains open. This thesis presents some weakening of this conjecture. Among other results, we prove that digraphs with large minimum outdegree contain large in-arborescences. We also prove that digraphs with large minimum outdegree contain large transitive tournaments as immersions, which was conjectured by DeVos et al. in 2011. Changing the parameter, we also prove that large chromatic number can force subdivision of cycles and other structures in strongly connected digraphs. This thesis also presents the proof of the Erd\H{o}s-Sands-Sauer-Woodrow conjecture that states that the domination number of tournaments whose arc set can be partitioned into k transitive digraphs only depends on k. The conjecture, asked in 1982, was still open for k=3. Finally this thesis presents proofs for two results, one about orientation of hypergraphs and the other about AVD colouring using the recently developed probabilistic technique of entropy compression.

No description available.

No description available.

No description available.

In this dissertation, we introduce combinatorial interpretations for three types of HallLittlewood polynomials (denoted Rλ, Pλ, and Qλ) by using weighted combinatorial objects called abacus-tournaments. We then apply these models to give combinatorial proofs of properties of Hall-Littlewood polynomials. For example, we show why various specializations of Hall-Littlewood polynomials produce the Schur symmetric polynomials, the elementary symmetric polynomials, or the t-analogue of factorials. With the abacus-tournament model, we give a bijective proof of a Pieri rule for Hall-Littlewood polynomials that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with an elementary symmetric polynomial ek. We also give a bijective proof of certain cases of a second Pieri rule that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with another Hall-Littlewood polynomial Q(r) . In general, proofs using abacus-tournaments focus on canceling abacus-tournaments and then finding weight-preserving bijections between the sets of uncanceled abacus-tournaments. / Ph. D.

M.Sc. University of KwaZulu-Natal, Durban 2013.

Thesis (DTech (Tourism and Hospitality Management))--Cape Peninsula University of Technology, 2016. / The hosting of mega-events such as the 2010 FIFA World CupTM create expectations from the host nation, especially in the host cities. This is largely due to the impacts associated with the hosting of such events. Planning is perceived to be at the centre of successful hosting of such events. Planning also assists in making sure that benefits from such events are maximised and costs minimised. Events like the 2010 FIFA World CupTM do not only require high level planning but also a multi-stakeholder approach. With South Africa and the continent hosting the FIFA World CupTM for the first time since its inception, expectations were rising from both host and non-host areas. The study investigates a multi-stakeholder approach to planning on the 2010 FIFA World CupTM initiatives conducted by a non-host area - Cape Winelands District Municipality (CWDM), Western Cape, South Africa. The location of the CWDM is less than 45 minutes from the host city (Cape Town). By virtue of its close proximity, the CWDM positioned itself to leverage from the event as a result of possible spill-over effects. The study was driven mainly by five objectives. These include the identification of 2010 FIFA World CupTM planning initiatives, assessment of planning initiatives in relation to beneficiation of local municipalities, gaining an understanding of ways in which various stakeholders are involved in the planning initiatives, ascertaining ways in which various stakeholders perceive the benefits/spill-over effects and examining the alignment, integration and co-ordination of the 2010 FIFA World CupTM planned initiatives in the CWDM. In pursuing these objectives, both qualitative and quantitative research methods were used in the collection of data. Respondents included residents (n=1 250), established businesses (n=108) and CWDM officials (n=5), using stratified random sampling, convenient sampling and purposive sampling, respectively. A total of 1 363 questionnaires were administered among the respondents of the study.