Artisans and the Marketing of Ethnicity: Globalization, Indigenous Identity and Nobility Principle In Micro-Enterprise Development

As a constructed category of human difference, \u27ethnicity\u27 has given way to \u27culture\u27 in its shared genealogy in the new millennium. Public knowledge about such phenomena as \u27ethnic cleansing\u27, debates on immigration, and the use of ethnicity as both a dependent and independent variable in research and policy are central realities in the domestic and foreign policies of many nations. The social psychology of group affiliation, nationalism, and the use of ethnicity (as well as gender) in workplace diversity, or the deployment of ethnicity in electoral politics continues to perplex and complicate human social interaction

Quantum query complexity of minor-closed graph properties

We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether an $n$-vertex graph is planar, is a forest, or does not contain a path of a given length. We show that most minor-closed properties---those that cannot be characterized by a finite set of forbidden subgraphs---have quantum query complexity \Theta(n^{3/2}). To establish this, we prove an adversary lower bound using a detailed analysis of the structure of minor-closed properties with respect to forbidden topological minors and forbidden subgraphs. On the other hand, we show that minor-closed properties (and more generally, sparse graph properties) that can be characterized by finitely many forbidden subgraphs can be solved strictly faster, in o(n^{3/2}) queries. Our algorithms are a novel application of the quantum walk search framework and give improved upper bounds for several subgraph-finding problems.Comment: v1: 25 pages, 2 figures. v2: 26 page

Poor care and the professional duty of the registered nurse

Concerns have been raised in recent years about standards of care in the UK. Notable failures have been identified in the care of vulnerable older adults. This article identifies and discusses some logical steps which might be taken to minimise the risk of individual and systemic care failure in settings for older adults. These steps include frank discussion about ageism to promote empowerment and respect for older people; ensuring robust policies are in place that support and encourage the reporting of poor care; and ensuring that registered practitioners are aware of their accountability for their actions and also their omissions should they witness poor care. In addition to reducing the risk of poor care, these steps could contribute to having a more confident, competent and empowered workforce

Simulating sparse Hamiltonians with star decompositions

We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d^2(d+log* N)||Ht||)^{1+o(1)} queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d^4(log* N)||Ht||)^{1+o(1)}. To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component is a star, and efficiently simulate each of these pieces.Comment: 11 pages. v2: minor correction