'What ever happened to breakdancing?' : transnational b-boy/b-girl networks, underground video magazines and imagined affinities

In 1997, Paul Gilroy was able to write: "I have been asking myself, whatever happened to breakdancing" (21), a form of vernacular dance associated with urban youth that emerged in the 1970s. However, in the last decade, breakdancing has experienced a massive renaissance in movies (You Got Served), commercials ("Gotta Have My Pops!") and documentaries (the acclaimed Freshest Kids). In this thesis, 1 explore the historical development of global b-boy/bgirl culture through a qualitative study involving dancers and their modes of communication. Widespread circulation of breakdancing images peaked in the mid-1980s, and subsequently b-boy/b-girl culture largely disappeared from the mediated landscape. The dance did not reemerge into the mainstream of North American popular culture until the late 1990s. 1 argue that the development of major transnational networks between b-boys and b-girls during the 1990s was a key factor in the return of 'b-boying/b-girling' (known formerly as breakdancing). Street dancers toured, traveled and competed internationally throughout this decade. They also began to create 'underground' video documentaries and travel video 'magazines.' These video artefacts circulated extensively around the globe through alternative distribution channels (including the backpacks of traveling dancers). 1 argue that underground video artefacts helped to produce 'imagined affinities' between dancers in various nations. Imagined affinities are identifications expressed by a cultural producer who shares an embodied activity with other practitioners through either mediated texts or travels through new places. These 'imagined affinities' helped to sustain b-boy/b-girl culture by generating visual/audio representations of popularity for the dance movement across geographical regions.

Community Detection in Multi-Layer Networks

In the scope of the current thesis we review and analyse networks that are formed by nodes with several attributes. We suppose that different layers of communities are embedded in such networks, besides each of the layers is connected with nodes' attributes. For example, examine one of a variety of online social networks: an user participates in a plurality of different groups/communities – schoolfellows, colleagues, clients, etc. We introduce a detection algorithm for the above-mentioned communities. Normally the result of the detection is the community supplemented just by the most dominant attribute, disregarding others. We propose an algorithm that bypasses dominant communities and detects communities which are formed by other nodes' attributes. We also review formation models of the attributed networks and present a Human Communication Network (HCN) model. We introduce a High School Texting Network (HSTN) and examine our methods for that network.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.