Ng, Cheuk Hang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 89-95). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Problem Definition --- p.2 / Chapter 1.2 --- Main Contributions --- p.4 / Chapter 1.3 --- Thesis Organization --- p.5 / Chapter 2 --- Background --- p.6 / Chapter 2.1 --- Background of Peer-to-Peer --- p.6 / Chapter 2.2 --- Background of Content-Based Image Retrieval System --- p.9 / Chapter 2.3 --- Literature Review of Peer-to-Peer Application --- p.10 / Chapter 2.4 --- Literature Review of Discovery Mechanisms for Peer-to-Peer Applications --- p.13 / Chapter 2.4.1 --- Centralized Search --- p.13 / Chapter 2.4.2 --- Distributed Search - Flooding --- p.15 / Chapter 2.4.3 --- Distributed Search - Distributed Hash Table --- p.21 / Chapter 3 --- Peer Clustering and Firework Query Model --- p.25 / Chapter 3.1 --- Peer Clustering --- p.26 / Chapter 3.1.1 --- Peer Clustering - Simplified Version --- p.27 / Chapter 3.1.2 --- Peer Clustering - Single Cluster Version --- p.29 / Chapter 3.1.3 --- "Peer Clustering - Single Cluster, Multiple Layers of Con- nection Version" --- p.34 / Chapter 3.1.4 --- Peer Clustering - Multiple Clusters Version --- p.35 / Chapter 3.2 --- Firework Query Model Over Clustered Network --- p.38 / Chapter 4 --- Experiments and Results --- p.43 / Chapter 4.1 --- Simulation Model of Peer-to-Peer Network --- p.43 / Chapter 4.2 --- Performance Metrics --- p.45 / Chapter 4.3 --- Experiment Results --- p.47 / Chapter 4.3.1 --- Performances in different Number of Peers in P2P Network --- p.47 / Chapter 4.3.2 --- Performances in different TTL value of query packet in P2P Network --- p.52 / Chapter 4.3.3 --- "Performances in different different data sets, synthetic data and real data" --- p.55 / Chapter 4.3.4 --- Performances in different number of local clusters of each peer in P2P Network --- p.58 / Chapter 4.4 --- Evaluation of different clustering algorithms --- p.64 / Chapter 5 --- Distributed COntent-based Visual Information Retrieval (DIS- COVIR) --- p.67 / Chapter 5.1 --- Architecture of DISCOVIR and Functionality of DISCOVIR Components --- p.68 / Chapter 5.2 --- Flow of Operations --- p.72 / Chapter 5.2.1 --- Preprocessing (1) --- p.73 / Chapter 5.2.2 --- Connection Establishment (2) --- p.75 / Chapter 5.2.3 --- "Query Message Routing (3,4,5)" --- p.75 / Chapter 5.2.4 --- "Query Result Display (6,7)" --- p.78 / Chapter 5.3 --- Gnutella Message Modification --- p.78 / Chapter 5.4 --- DISCOVIR EVERYWHERE --- p.81 / Chapter 5.4.1 --- Design Goal of DISCOVIR Everywhere --- p.82 / Chapter 5.4.2 --- Architecture and System Components of DISCOVIR Ev- erywhere --- p.83 / Chapter 5.4.3 --- Flow of Operations --- p.84 / Chapter 5.4.4 --- Advantages of DISCOVIR Everywhere over Prevalent Web-based Search Engine --- p.86 / Chapter 6 --- Conclusion --- p.87 / Bibliography --- p.89

Sia Ka Cheung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 85-91). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Problem Statement --- p.1 / Chapter 1.2 --- Contributions --- p.3 / Chapter 1.3 --- Thesis Organization --- p.4 / Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Content-Based Image Retrieval --- p.5 / Chapter 2.1.1 --- Feature Extraction --- p.6 / Chapter 2.1.2 --- Indexing and Retrieval --- p.7 / Chapter 2.2 --- Relevance Feedback --- p.7 / Chapter 2.2.1 --- Weight Updating --- p.9 / Chapter 2.2.2 --- Bayesian Formulation --- p.11 / Chapter 2.2.3 --- Statistical Approaches --- p.12 / Chapter 2.2.4 --- Inter-query Feedback --- p.12 / Chapter 2.3 --- Peer-to-Peer Information Retrieval --- p.14 / Chapter 2.3.1 --- Distributed Hash Table Techniques --- p.16 / Chapter 2.3.2 --- Routing Indices and Shortcuts --- p.17 / Chapter 2.3.3 --- Content-Based Retrieval in P2P Systems --- p.18 / Chapter 3 --- Parameter Estimation-Based Relevance Feedback --- p.21 / Chapter 3.1 --- Parameter Estimation of Target Distribution --- p.21 / Chapter 3.1.1 --- Motivation --- p.21 / Chapter 3.1.2 --- Model --- p.23 / Chapter 3.1.3 --- Relevance Feedback --- p.24 / Chapter 3.1.4 --- Maximum Entropy Display --- p.26 / Chapter 3.2 --- Self-Organizing Map Based Inter-Query Feedback --- p.27 / Chapter 3.2.1 --- Motivation --- p.27 / Chapter 3.2.2 --- Initialization and Replication of SOM --- p.29 / Chapter 3.2.3 --- SOM Training for Inter-query Feedback --- p.31 / Chapter 3.2.4 --- Target Estimation and Display Set Selection for Intra- query Feedback --- p.33 / Chapter 3.3 --- Experiment --- p.35 / Chapter 3.3.1 --- Study of Parameter Estimation Method Using Synthetic Data --- p.35 / Chapter 3.3.2 --- Performance Study in Intra- and Inter- Query Feedback . --- p.40 / Chapter 3.4 --- Conclusion --- p.42 / Chapter 4 --- Distributed COntent-based Visual Information Retrieval --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Peer Clustering --- p.45 / Chapter 4.2.1 --- Basic Version --- p.45 / Chapter 4.2.2 --- Single Cluster Version --- p.47 / Chapter 4.2.3 --- Multiple Clusters Version --- p.51 / Chapter 4.3 --- Firework Query Model --- p.53 / Chapter 4.4 --- Implementation and System Architecture --- p.57 / Chapter 4.4.1 --- Gnutella Message Modification --- p.57 / Chapter 4.4.2 --- Architecture of DISCOVIR --- p.59 / Chapter 4.4.3 --- Flow of Operations --- p.60 / Chapter 4.5 --- Experiments --- p.62 / Chapter 4.5.1 --- Simulation Model of the Peer-to-Peer Network --- p.62 / Chapter 4.5.2 --- Number of Peers --- p.66 / Chapter 4.5.3 --- TTL of Query Message --- p.70 / Chapter 4.5.4 --- Effects of Data Resolution on Query Efficiency --- p.73 / Chapter 4.5.5 --- Discussion --- p.74 / Chapter 4.6 --- Conclusion --- p.77 / Chapter 5 --- Future Works and Conclusion --- p.79 / Chapter A --- Derivation of Update Equation --- p.81 / Chapter B --- An Efficient Discovery of Signatures --- p.82 / Bibliography --- p.85

As necessidades computacionais de experimentos científicos muitas vezes exigem computadores potentes. Uma forma alternativa de obter esse processamento é aproveitar o processamento ocioso de computadores pessoais de modo voluntário. Essa técnica é conhecida como computação voluntária e possui grande potencial na ajuda aos cientistas. No entanto existem diversos fatores que podem reduzir sua eficiência quando aplicada a experimentos científicos complexos, por exemplo, aqueles que envolvem processamento de longa duração, uso de dados de entrada ou saída muito grandes, etc. Na tentativa de solucionar alguns desses problemas surgiram abordagens que aplicam conceitos de computação ponto-a-ponto. Neste projeto foram especificados, desenvolvidos e testados um ambiente e um escalonador de atividades que aplicam conceitos de computação ponto-a-ponto à execução de workflows com computação voluntária. Quando comparado com a execução local de atividades e com a computação voluntária tradicional houve melhoras em relação ao tempo de execução (até 22% de redução quando comparada com a computação voluntária tradicional nos testes mais complexos) e em alguns casos também houve uma redução no consumo de banda de upload do servidor de até 62%. / The computational needs of scientific experiments often require powerful computers. One alternative way to obtain this processing power is taking advantage of the idle processing of personal computers as volunteers. This technique is known as volunteer computing and has great potential in helping scientists. However, there are several issues which can reduce the efficiency of this approach when applied to complex scientific experiments, such as, the ones with long processing time, very large input or output data, etc. In an attempt to solve these problems some approaches based on P2P concepts arisen. In this project a workflow execution environment and a scheduler of activities were specified, developed and tested applying P2P concepts in the workflows execution using volunteer computing. When compared with the local execution of activities and traditional volunteer computing was the execution time was improved (until 22% of reduction when compared with the traditional volunteer computing in the most complex tests) and in some cases there was also a reduction of the server upload bandwidth use of until 62%.

A grande demanda por computação de alto desempenho culminou na construção de ambientes de execução de larga escala como as Grades Computacionais. Não diferente de outras plataformas de execução, seus usuários precisam obter os dados de entrada para suas aplicações e muitas vezes precisam armazenar os resultados por elas gerados. Apesar de o termo Grade ter surgido de uma metáfora onde os recursos computacionais estão tão facilmente acessíveis como os da rede elétrica, as ferramentas para gerenciamento de dados e de recursos de armazenamento disponíveis estão muito aquém do necessário para concretizar essa idéia. A imaturidade desses serviços se torna crítica para aplicações científicas que necessitam processar grandes volumes de dados. Nesses casos, utiliza-se apenas os recursos de alto desempenho e assegura-se confiabilidade, disponibilidade e segurança para os dados através de presença humana. Este trabalho apresenta o JavaRMS, um sistema de gerência de dados para Grades. Ao empregar um modelo par-a-par, consegue-se agregar os recursos menos capacitados disponíveis no ambiente de Grade, diminuindo-se assim o custo da solução. O sistema utiliza a técnica de nodos virtuais para lidar com a grande heterogeneidade de recursos, distribuindo os dados de acordo com o espaço de armazenamento fornecido. Empregase fragmentação para viabilizar o uso dos recursos menos capacitados e para melhorar o desempenho das operações que envolvem a transferência de arquivos. Utiliza-se replicação para prover persistência aos dados e para melhorar sua disponibilidade. JavaRMS lida ainda com a dinamicidade e a instabilidade dos recursos através de um modelo de estados, de forma a diminuir o impacto das operações de manutenção. A arquitetura contempla também serviços para gerenciamento de usuários e protege os recursos contra fraudes através de um sistema de cotas. Todas as operações foram projetadas para serem seguras. Por fim, disponibiliza-se toda a infra-estrutura necessária para que serviços de busca e ferramentas de interação com o usuário sejam futuramente fornecidos. Os experimentos realizados com o protótipo do JavaRMS comprovam que usar um modelo par-a-par para organizar os recursos e localizar os dados resulta em boa escalabilidade. Já a técnica de nodos virtuais se mostrou eficiente para distribuir de forma balanceada os dados entre as máquinas, de acordo com a capacidade de armazenamento oferecida. Através de testes com a principal operação que envolve a transferência de arquivos, comprovou-se que o modelo é capaz de melhorar significativamente o desempenho de aplicações que necessitam processar grandes volumes de dados. / Large scale execution environments such as Grids emerged to meet high-performance computing demands. Like in other execution platforms, its users need to get input data to their applications and to store their results. Although the Grid term is a metaphor where computing resources are so easily accessible as those from the eletric grid, its data and resource management tools are not sufficiently mature to make this idea a reality. They usually target high-performance resources, where data reliability, availability and security is assured through human presence. It turns to be critical when scientific applications need to process huge amounts of data. This work presents JavaRMS, a Grid data management system. By using a peer-topeer model, it aggregates low capacity resources to reduce storage costs. Resource heterogeneity is dealt with the virtual node technique, where peers receive data proportionally to their provided storage space. It applies fragmentation to make feasible the usage of low capacity resources and to improve file transfer operations performance. Also, the system achieves data persistence and availability through replication. In order to decrease the impact of maintenance operations, JavaRMS deals with resource dinamicity and instability with a state model. The architecture also contains user management services and protects resources through a quota system. All operations are designed to be secure. Finally, it provides the necessary infrastructure for further deployment of search services and user interactive tools. Experiments with the JavaRMS prototype showed that using a peer-to-peer model for resource organization and data location results in good scalability. Also, the virtual node technique showed to be efficient to provide heterogeneity-aware data distribution. Tests with the main file transfer operation proved the model can significantly improve data-intensive applications performance.

As grades computacionais e as redes peer-to-peer (P2P) surgiram como áreas distintas, com diferentes propósitos, modelos e ferramentas. No decorrer dos últimos anos, estas áreas foram convergindo, uma vez que a infraestrutura e o modelo de execução descentralizada das redes P2P provaram ser uma alternativa adequada para o tratamento de questões relacionadas à manutenção de grades de larga escala, tais como escalabilidade, descoberta, alocação e monitoramento de recursos. O modelo MultiCluster trata a convergência entre grades computacionais e redes peer-to-peer de uma forma mais restrita: os problemas de escalabilidade, de descoberta e alocação de recursos são minimizados considerando-se apenas recursos localmente disponíveis para a construção de uma grade, a qual pode ser usada para a execução de aplicações com diferentes características de acoplamento e comunicação. Esse trabalho apresenta a arquitetura do modelo e seus aspectos funcionais, bem como um primeira implementação do modelo, realizada através da adaptação da biblioteca de programação DECK sobre os protocolos do projeto JXTA. A avaliação do funcionamento dessa implementação é apresentada e discutida, com base em algumas aplicações com diferentes características. / Grid computing and peer-to-peer computing emerged as distinct areas with different purposes, models and tools. Over the last years, these areas has been converging since the infrastructure and the execution model used in peer-to-peer networks have proven to be a suitable way to treat some problems related to the maintenance of large scale grids, such as scalability, monitoring, and resource discovery and allocation. The MultiCluster model addresses the convergence of grids and peer-to-peer networks in a more restricted way: the problems related to scalability, resource allocation and discovery are minimized by considering only local resources for the conception of a small scale grid, which can be used to run applications with different characteristics of granularity and communication. This work presents the MultiCluster architecture and its functional aspects, as well as a first implementation carried out by adapting the DECK programming library to use JXTA protocols and its consequent evaluation, based on applications with different characteristics.

abstract: Pierce College at Joint Base Lewis – McChord (PCJBLM) is a community college extension campus that is challenged with complying with multiple policies while serving a transient student population amid budget constraints. Through multiple cycles of research, entry-level student services staff expressed concern about their professional development and their ability to contribute meaningfully to initiatives around student success. Student services staff were also concerned with their connection to colleagues and leaders within the unit. Research shows that leaders may need to be more flexible and creative in staff development to appreciate the diverse values and talents of their teams. Research also identifies professional development as essential to solidifying student affairs as a profession and meeting the demands of today’s educational environment. Through multiple cycles of research, peer-to-peer mentoring was identified as the innovation to address the problem of practice at PCJBLM. The program was evaluated as part of an action research study. The theoretical perspectives guiding of the study were wicked problems, theory of structural empowerment, theory of psychological empowerment, and social learning theory and communities of practice. Peer-to-peer mentoring was evaluated over eight-weeks. Participants were selected via purposeful sampling. Key artifacts produced by participants were reflective journals and an individual development plan (IDP). Multiple qualitative data sources were used to triangulate the results. The quantitative instrument, Conditions of Work Empowerment Questionnaire – II (CWEQ-II), was administered to support learning about the participants’ feelings and perceptions about empowerment. The pre- and post-test (CWEQ-II) measures were used in conjunction with the qualitative sources. Credibility and rigor were addressed through triangulation, prolonged engagement, and member checking. Results indicate more investigation is needed to address the identified wicked problem. Peer-to-peer mentoring supported a broadened view of the problem practice. The peer-to-peer mentoring program was structurally empowering while not completely psychologically empowering. The participants’ conflicts related to psychological empowerment were identified and will support continued learning in this area. Additionally, through multiple cycles of qualitative analysis, the values of this unit were identified. These values were essential to the developing community of practice. Continued research in empowerment and wicked problems is needed to support the future growth of the community of practice. / Dissertation/Thesis / Doctoral Dissertation Leadership and Innovation 2018

Wang, Yongzhi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p.68-72). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Abstract Model --- p.7 / Chapter 2.1 --- Request allocation problem --- p.7 / Chapter 2.2 --- Neighbor selection problem --- p.11 / Chapter 3 --- Simulation Model --- p.14 / Chapter 4 --- Load Balancing Algorithms --- p.18 / Chapter 4.1 --- Request allocation --- p.18 / Chapter 4.2 --- Neighbor selection algorithms --- p.24 / Chapter 4.2.1 --- What to measure? --- p.24 / Chapter 4.2.2 --- Timeout-based neighbor selection algorithms --- p.25 / Chapter 4.2.3 --- Periodic neighbor selection algorithms --- p.33 / Chapter 4.2.4 --- Comparison: Timeout-based versus Periodical neighbor selection algorithms --- p.39 / Chapter 4.3 --- Further experiments --- p.41 / Chapter 4.3.1 --- Request window size --- p.41 / Chapter 4.3.2 --- Impact of K --- p.42 / Chapter 4.3.3 --- Adaptive adjustment of the neighbor selection period --- p.43 / Chapter 4.3.4 --- Performance with adequate bandwidth --- p.45 / Chapter 5 --- Minimizing Server´ةs Load --- p.49 / Chapter 6 --- Background Study --- p.56 / Chapter 6.1 --- P2P content distribution system --- p.56 / Chapter 6.1.1 --- P2P File sharing system --- p.56 / Chapter 6.1.2 --- P2P streaming system --- p.59 / Chapter 6.1.3 --- P2P Video on Demand system --- p.61 / Chapter 6.2 --- Congestion control --- p.62 / Chapter 7 --- Conclusion --- p.67 / Bibliography --- p.68

Lin, Minghong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (p. 49-51). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- A Stochastic Framework --- p.5 / Chapter 2.1 --- Model Description --- p.5 / Chapter 2.2 --- Altruistic File Sharing System with Download Con- straint --- p.7 / Chapter 2.2.1 --- Model Formulation --- p.8 / Chapter 2.2.2 --- Steady State Analysis --- p.9 / Chapter 2.3 --- Altruistic File Sharing System with Download and Upload Constraints --- p.14 / Chapter 2.3.1 --- Model Formulation --- p.14 / Chapter 2.3.2 --- Steady State Analysis --- p.15 / Chapter 2.4 --- Incentive File Sharing via Coordinated Matching --- p.18 / Chapter 2.4.1 --- Without Incentive Mechanism --- p.18 / Chapter 2.4.2 --- With Incentive Mechanism --- p.19 / Chapter 2.5 --- Simulation --- p.23 / Chapter 3 --- An ISP-friendly Protocol --- p.28 / Chapter 3.1 --- Simple Mathematical Models --- p.28 / Chapter 3.1.1 --- Assumptions --- p.29 / Chapter 3.1.2 --- Homogeneous Case Analysis --- p.30 / Chapter 3.1.3 --- Heterogeneous Case Analysis --- p.31 / Chapter 3.1.4 --- Flash Crowd Analysis --- p.32 / Chapter 3.2 --- An ISP-friendly BitTorrent Protocol --- p.33 / Chapter 3.3 --- Performance Evaluation & Measurements --- p.36 / Chapter 3.3.1 --- Choice of the BitTorrent Client --- p.37 / Chapter 3.3.2 --- Experimental Setup --- p.37 / Chapter 3.3.3 --- Regular Peer Arrival --- p.38 / Chapter 3.3.4 --- Flash Crowd --- p.41 / Chapter 3.4 --- Black Hole Security Attack --- p.42 / Chapter 4 --- Related Work --- p.46 / Chapter 5 --- Conclusion --- p.48 / Bibliography --- p.49 / Appendix --- p.52

Lu, Mengwei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 52-54). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Introduction of P2P-VoD Systems --- p.5 / Chapter 2.1 --- Major Components of the System --- p.5 / Chapter 2.2 --- Peer Join and Content Discovery --- p.6 / Chapter 2.3 --- Segment Sizes and Replication Strategy --- p.7 / Chapter 2.4 --- Piece Selection --- p.8 / Chapter 2.5 --- Transmission Strategy --- p.9 / Chapter 3 --- Detection Methodology --- p.10 / Chapter 3.1 --- Capturing Technique --- p.11 / Chapter 3.2 --- Analytical Framework --- p.15 / Chapter 3.3 --- Results of our Detection Methodology --- p.24 / Chapter 4 --- Protective Architecture --- p.25 / Chapter 4.1 --- Architecture Overview --- p.25 / Chapter 4.2 --- Content Servers --- p.27 / Chapter 4.3 --- Shield Nodes --- p.28 / Chapter 4.4 --- Tracker --- p.29 / Chapter 4.5 --- A Randomized Assignment Algorithm --- p.30 / Chapter 4.6 --- Seeding Algorithm --- p.31 / Chapter 4.7 --- Connection Management Algorithm --- p.33 / Chapter 4.8 --- Advantages of the Shield Nodes Architecture --- p.33 / Chapter 4.9 --- Markov Model for Shield Nodes Architecture Against Single Track Anonymity Attack --- p.35 / Chapter 5 --- Experiment Result --- p.40 / Chapter 5.1 --- Shield Node architecture against anonymity attack --- p.40 / Chapter 5.1.1 --- Performance Analysis for Single Track Anonymity Attack --- p.41 / Chapter 5.1.2 --- Experiment Result on PlanetLab for Single Track Anonymity Attack --- p.42 / Chapter 5.1.3 --- Parallel Anonymity Attack --- p.44 / Chapter 5.2 --- Shield Nodes architecture-against DoS attack --- p.45 / Chapter 6 --- Related Work --- p.48 / Chapter 7 --- Future Work --- p.49 / Chapter 8 --- Conclusion --- p.50

There is a lack of persistence and completion of students enrolled in a local college culinary arts program, a problem also evident in national data. Some students entering the college program have participated in a defined high school curriculum focused on culinary arts, such as the National Restaurant Association Education Association's ProStart curriculum. The purpose of this study was to determine if participation in the ProStart program was related to the mean grade point average (GPA) and time to completion in the college culinary arts program. Dewey's theory of experience provided the theoretical framework. Participants from 2 cohorts at the local college students who participated in ProStart (n = 17) and those who did not (n = 122) were examined for GPA and number of months to program completion. A t test revealed the students who participated in ProStart had higher average GPAs. There was no statistically significant difference in the time to completion between the 2 groups. The analysis must be viewed within the limitations of the available sample size of the ProStart group, and further study is recommended with larger group sizes. Based on the results of this study, a peer-to-peer mentoring program pairing ProStart with non ProStart students was developed and recommended to the research site. The implications for social change include providing research results to the local site and a recommendation for a mentoring program to improve the rate of completion in the culinary arts program.