2 resultados para pacs: computer networks and techniques
em Glasgow Theses Service
Resumo:
This thesis examines the development of state-narco networks in post-transition Bolivia. Mainstream discourses of drugs tend to undertheorise such relationships, holding illicit economies, weak states and violence as synergistic phenomena. Such assumptions fail to capture the nuanced relations that emerge between the state and the drug trade in different contexts, their underlying logics and diverse effects. As an understudied case, Bolivia offers novel insights into these dynamics. Bolivian military authoritarian governments (1964-1982), for example, integrated drug rents into clientelistic systems of governance, helping to establish factional coalitions and reinforce regime authority. Following democratic transition in 1982 and the escalation of US counterdrug efforts, these stable modes of exchange between the state and the coca-cocaine economy fragmented. Bolivia, though, continued to experience lower levels of drug-related violence than its Andean neighbours, and sustained democratisation despite being a major drug producer. Focusing on the introduction of the Andean Initiative (1989-1993), I explore state-narco interactions during this period of flux: from authoritarianism to (formal) democracy, and from Cold War to Drug War. As such, the thesis transcends the conventional analyses of the drugs literature and orthodox readings of Latin American narco-violence, providing insights into the relationship between illicit economies and democratic transition, the regional role of the US, and the (unintended) consequences of drug policy interventions. I utilise a mixed methods approach to offer discrete perspectives on the object of study. Drawing on documentary and secondary sources, I argue that state-narco networks were interwoven with Bolivia’s post-transition political settlement. Uneven democratisation ensured pockets of informalism, as clientelistic and authoritarian practices continued. This included police and military autonomy, and tolerance of drug corruption within both institutions. Non-enforcement of democratic norms of accountability and transparency was linked to the maintenance of fragile political equilibrium. Interviews with key US and Bolivian elite actors also revealed differing interpretations of state-narco interactions. These exposed competing agendas, and were folded into alternative paradigms and narratives of the ‘war on drugs’. The extension of US Drug War goals and the targeting of ‘corrupt’ local power structures, clashed with local ambivalence towards the drug trade, opposition to destabilising, ‘Colombianised’ policies and the claimed ‘democratising mission’ of the Bolivian government. In contrasting these US and Bolivian accounts, the thesis shows how real and perceived state-narco webs were understood and navigated by different actors in distinct ways. ‘Drug corruption’ held significance beyond simple economic transaction or institutional failure. Contestation around state-narco interactions was enmeshed in US-Bolivian relations of power and control.
Resumo:
Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.