This thesis investigates how web users negotiate and engage with contemporary algorithmic personalisation practices; that is, practices which seek to infer (via data tracking mechanisms and other algorithmic means) a user's habits, preferences or identity categorisations in order to ‘make personal' some component of that user's web experience. Drawing on thirty-six semi-structured interviews, I employ a qualitative methodology that seeks to bridge the gap between critical theorisations of algorithmic personalisation and the negotiations of web users themselves who encounter algorithmic personalisation in everyday life. To do this I focus on three sites of investigation. I first examine privacy tool Ghostery and the ways in which Ghostery users' negotiate their positions as data-tracked subjects, especially in relation to privacy, knowledge and their sense of self. I then investigate Facebook's autoposting apps as examples of algorithmic personalisation that act on the user's behalf, and draw on the accounts of Facebook app users to explore themes such as identity performance, autonomous control and algorithmic governance. Finally I examine users' engagement with the ‘predictive powers' (Google Now, 2014) of the personalisation app Google Now, specifically in regards to notions of user trust, expectation and speculation. My critical enquiries produced a number of themes that tie this thesis together. Central were: the epistemic uncertainties that emerged as trust and anxiety in participant responses; the implications for a performative understanding of selfhood when algorithmic personalisation intervenes in user self-articulation; the (asymmetrical) data-for-services exchange which web users must negotiate with commercial data trackers; and the struggle for autonomy between user and system that algorithmic personalisation creates. The thesis also argues that algorithmic personalisation demands that web users' identities be constituted as both a stable and fixable ‘single identity', but also as recursively reworkable, dividualised and endlessly expressable entities.

This research proposes a new secure token profile for improving the existing Web Services security standards. It provides a new authentication mechanism. This additional level of security is important for the Service-Oriented Architecture (SOA), which is an architectural style that uses a set of principles and design rules to shape interacting applications and maintain interoperability. Currently, the market push is towards SOA, which provides several advantages, for instance: integration with heterogeneous systems, services reuse, standardization of data exchange, etc. Web Services is one of the technologies to implement SOA and it can be implemented using Simple Object Access Protocol (SOAP). A SOAP-based Web Service relies on XML for its message format and common application layer protocols for message negotiation and transmission. However, it is a security challenge when a message is transmitted over the network, especially on the Internet. The Organization for Advancement of Structured Information Standards (OASIS) announced a set of Web Services Security standards that focus on two major areas. “Who” can use the Web Service and “What” are the permissions. However, the location or domain of the message sender is not authenticated. Therefore, a new secure token profile called: Participant Domain Name Token Profile (PDNT) is created to tackle this issue. The PDNT provides a new security feature, which the existing token profiles do not address. Location-based authentication is achieved if adopting the PDNT when using Web Services. In the performance evaluation, PDNT is demonstrated to be significantly faster than other secure token profiles. The processing overhead of using the PDNT with other secure token profiles is very small given the additional security provided. Therefore all the participants can acquire the benefits of increased security and performance at low cost.

by Wong Leung-Chung Chris. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 86-[92]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Routing Overview --- p.2 / Chapter 1.2 --- Routing in the Internet --- p.5 / Chapter 1.2.1 --- Inter-Domain Routing --- p.6 / Chapter 1.2.2 --- Intra-Domain Routing --- p.7 / Chapter 1.2.3 --- The Future Trend --- p.7 / Chapter 2 --- Inter-Domain Routing --- p.9 / Chapter 2.1 --- Inter-Domain Routing Protocols --- p.9 / Chapter 2.1.1 --- Exterior Gateway Protocol (EGP) --- p.10 / Chapter 2.1.2 --- Border Gateway Protocol (BGP) --- p.11 / Chapter 2.1.3 --- Inter-Domain Policy Routing (IDPR) --- p.12 / Chapter 2.1.4 --- Other Protocols --- p.13 / Chapter 2.2 --- The Need for Pricing on Inter-Domain Routing Protocols --- p.13 / Chapter 2.3 --- Pricing Scheme on the Inter-Domain level --- p.15 / Chapter 2.4 --- Routing Protocols to Support Pricing on the Internet --- p.16 / Chapter 2.4.1 --- Routing Towards Multiple-Additive Metrics --- p.16 / Chapter 2.4.2 --- "Network Model, Notations and Assumptions" --- p.16 / Chapter 2.4.3 --- The Problem Statement --- p.18 / Chapter 3 --- Application of Neural Nets in Route Selection --- p.20 / Chapter 3.1 --- Neural Network (NN) Overview --- p.20 / Chapter 3.1.1 --- Brief History on Neural Network Research --- p.20 / Chapter 3.1.2 --- Definition of Neural Network --- p.21 / Chapter 3.1.3 --- Neural Network Architectures --- p.22 / Chapter 3.1.4 --- Transfer Fucntion of a Neuron --- p.24 / Chapter 3.1.5 --- Learning Methods --- p.25 / Chapter 3.1.6 --- Applications in Telecommunications --- p.26 / Chapter 3.2 --- Review on the Applications of Neural Networks in Packet Routing --- p.27 / Chapter 3.2.1 --- The JEB Branch --- p.27 / Chapter 3.2.2 --- The Hopfield/Energy Minimization Branch (HEM) --- p.29 / Chapter 3.2.3 --- Supervised Learning (SL) --- p.34 / Chapter 3.3 --- Discussions --- p.35 / Chapter 4 --- Route Selection as “Link-state´ح Classification --- p.36 / Chapter 4.1 --- Multi-Layer Feedforward Network (MLFN) --- p.37 / Chapter 4.1.1 --- Function Approximation Power of MLFN --- p.38 / Chapter 4.1.2 --- Choosing MLFN parameters..........´ب --- p.40 / Chapter 4.1.3 --- Trailing a MLFN --- p.41 / Chapter 4.2 --- The Utility Function --- p.43 / Chapter 4.3 --- The Neural Network Architecture --- p.46 / Chapter 4.3.1 --- Routing Graph Representation with Successor Sequence Table (SST) --- p.46 / Chapter 4.3.2 --- The Neural Network Layout --- p.52 / Chapter 4.3.3 --- How the Neural Network Controller Works --- p.55 / Chapter 4.3.4 --- Training --- p.56 / Chapter 4.4 --- Simulation --- p.56 / Chapter 4.4.1 --- Performance Parameters --- p.56 / Chapter 4.4.2 --- Simulation Results --- p.57 / Chapter 4.5 --- Conclusions and Discussions --- p.70 / Chapter 5 --- Route Selection as Energy Minimization - A Theoretical Study --- p.73 / Chapter 5.1 --- The Hopfield/Tank NN Model --- p.73 / Chapter 5.2 --- Boltzman's Machine --- p.76 / Chapter 5.3 --- Boltzman's Machine Model for Multiple-Metrices Routing --- p.79 / Chapter 5.4 --- Conclusions --- p.82 / Chapter 6 --- Conclusions --- p.84 / Bibliography --- p.86

by Tsang Hin Chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 118-124). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Authentication and Transaction Protocol --- p.2 / Chapter 1.2 --- E-Commerce Enabler --- p.3 / Chapter 2 --- Literature Review --- p.4 / Chapter 2.1 --- Cryptographic Preliminaries --- p.4 / Chapter 2.1.1 --- One-Way Hash Function --- p.4 / Chapter 2.1.2 --- Triple DES --- p.5 / Chapter 2.1.3 --- RSA --- p.7 / Chapter 2.1.4 --- Elliptic Curve --- p.8 / Chapter 2.2 --- Smart Cards --- p.8 / Chapter 2.2.1 --- Smart Card Operating Systems --- p.11 / Chapter 2.2.2 --- Java Card --- p.12 / Chapter 2.3 --- Authentication Protocol --- p.14 / Chapter 2.3.1 --- Properties --- p.15 / Chapter 2.3.2 --- Survey --- p.16 / Chapter 2.4 --- Transaction Protocol --- p.19 / Chapter 2.5 --- BAN Logic --- p.20 / Chapter 2.5.1 --- Notation --- p.20 / Chapter 2.5.2 --- Logical Postulates --- p.22 / Chapter 2.5.3 --- Protocol Analysis --- p.25 / Chapter 3 --- Authentication Protocol --- p.26 / Chapter 3.1 --- Formulation of Problem --- p.26 / Chapter 3.2 --- The New Idea --- p.27 / Chapter 3.3 --- Assumptions --- p.29 / Chapter 3.4 --- Trust Model --- p.29 / Chapter 3.5 --- Protocol --- p.30 / Chapter 3.5.1 --- Registration --- p.30 / Chapter 3.5.2 --- Local Authentication --- p.31 / Chapter 3.5.3 --- Remote Authentication --- p.33 / Chapter 3.5.4 --- Silent Key Distribution Scheme --- p.35 / Chapter 3.5.5 --- Advantages --- p.37 / Chapter 3.6 --- BAN Logic Analysis --- p.38 / Chapter 3.7 --- Experimental Evaluation --- p.43 / Chapter 3.7.1 --- Configuration --- p.44 / Chapter 3.7.2 --- Performance Analysis --- p.45 / Chapter 4 --- Transaction Protocol --- p.51 / Chapter 4.1 --- Assumptions --- p.52 / Chapter 4.2 --- Protocol --- p.55 / Chapter 4.3 --- Conflict Resolution Policy --- p.58 / Chapter 4.4 --- Justifications --- p.58 / Chapter 4.5 --- Experimental Evaluation --- p.59 / Chapter 4.5.1 --- Configuration --- p.59 / Chapter 4.5.2 --- Performance Analysis --- p.60 / Chapter 5 --- E-Commerce Builder --- p.65 / Chapter 5.1 --- Overview --- p.66 / Chapter 5.2 --- Design of Smart RAD --- p.68 / Chapter 5.2.1 --- Mechanism --- p.68 / Chapter 5.2.2 --- Java Card Layer --- p.69 / Chapter 5.2.3 --- Host Layer --- p.71 / Chapter 5.2.4 --- Server Layer --- p.72 / Chapter 5.3 --- Implementation --- p.73 / Chapter 5.3.1 --- Implementation Reflection --- p.73 / Chapter 5.3.2 --- Implementation Issues --- p.76 / Chapter 5.4 --- Evaluation --- p.77 / Chapter 5.5 --- An Application Example: Multi-MAX --- p.79 / Chapter 5.5.1 --- System Model --- p.79 / Chapter 5.5.2 --- Design Issues --- p.80 / Chapter 5.5.3 --- Implementation Issues --- p.80 / Chapter 5.5.4 --- Evaluation --- p.84 / Chapter 5.6 --- Future Work --- p.89 / Chapter 6 --- Conclusion --- p.91 / Chapter A --- Detail Experimental Result --- p.93 / Chapter A.1 --- Authentication Time Measurement --- p.94 / Chapter A.2 --- On-Card and Off-Card Computation Time in Authentication --- p.95 / Chapter A.3 --- Authentication Time with Different Servers --- p.96 / Chapter A.4 --- Transaction Time Measurement --- p.97 / Chapter A.5 --- On-card and Off-card Computation Time in Transaction --- p.97 / Chapter B --- UML Diagram --- p.99 / Chapter B.1 --- Package cuhk.cse.demo.applet --- p.99 / Chapter B.2 --- Package cuhk.cse.demo.client --- p.105 / Chapter B.3 --- Package server --- p.110 / Chapter C --- Glossary and Abbreviation --- p.115 / Bibliography --- p.118

Jorden Yeong-Tswen, Tse. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 76-76). / Abstracts in English and Chinese. / ACKNOWLEDGEMENTS --- p.2 / ABSTRACT --- p.3 / 摘要 --- p.4 / CONTENTS --- p.5 / Chapter CHAPTER 1: --- INTRODUCTION --- p.8 / Chapter 1.1. --- First Mile Evolution --- p.8 / Chapter 1.2. --- Access： Passive Optical Network (PON) --- p.10 / Chapter 1.2.1. --- ATM-PON (APON) --- p.13 / Chapter 1.2.2. --- Ethernet PON (EPON) --- p.14 / Chapter 1.3. --- Problem Definition and Possible Solutions --- p.16 / Chapter 1.3.1. --- Wavelength Division Multiplexing (WDM) --- p.17 / Chapter 1.3.2. --- Time Division Multiplexing (TDM) --- p.18 / Chapter 1.3.3. --- Sub-carrier Multiplexing (SCM) & Frequency Division Multiplexing (FDM) --- p.20 / Chapter 1.3.4. --- Code Division Multi Access (CDMA) --- p.20 / Chapter 1.4. --- Thesis Organization --- p.20 / Chapter CHAPTER 2: --- BACKGROUND --- p.22 / Chapter 2.1. --- EPON Solution：- MPCP --- p.22 / Chapter 2.2. --- CSMA/CD on PON --- p.26 / Chapter 2.3. --- Motivation --- p.28 / Chapter CHAPTER 3: --- CSMA/CA PROTOCOL USING PILOT TONE ON PON --- p.29 / Chapter 3.1. --- Basic Protocol Description --- p.29 / Chapter 3.1.1. --- With No Contention --- p.31 / Chapter 3.1.2. --- With Contention --- p.32 / Chapter 3.1.3. --- With Contention and Winner --- p.33 / Chapter 3.2. --- Simulation --- p.35 / Chapter 3.2.1. --- Effect of Loading on Network Utilization --- p.37 / Chapter 3.2.2. --- Effect of Network Size on Utilization --- p.39 / Chapter 3.2.3. --- Delay Performance --- p.41 / Chapter 3.2.4. --- Effect of Distance from Remote Node --- p.44 / Chapter 3.2.5. --- Effect of Maximum Packet Duration on Utilization and Delay --- p.45 / Chapter 3.3. --- Conclusions --- p.47 / Chapter CHAPTER 4: --- PROTOCOL ENHANCEMENT ON VARIOUS ASPECTS --- p.48 / Chapter 4.1. --- Utilization Enhancement --- p.48 / Chapter 4.1.1. --- Improvement on Network Utilization --- p.50 / Chapter 4.1.2. --- Network Delay Performance --- p.52 / Chapter 4.1.3. --- Conclusions --- p.53 / Chapter 4.2. --- Capture Effect --- p.53 / Chapter 4.2.1. --- Solution by Varying Ts --- p.54 / Chapter 4.2.2. --- Simulations --- p.55 / Chapter 4.2.3. --- Conclusions --- p.58 / Chapter 4.3. --- Introducing Cos to existing network --- p.59 / Chapter 4.3.1. --- Principle --- p.59 / Chapter 4.3.2. --- Simulation Model --- p.60 / Chapter 4.3.3. --- Utilization Performance --- p.61 / Chapter 4.3.4. --- Delay Performance --- p.64 / Chapter 4.3.5. --- Conclusions --- p.68 / Chapter CHAPTER 5: --- CONCLUSIONS --- p.69 / Chapter 5.1. --- Thesis Summary --- p.69 / Chapter 5.2. --- Future Work --- p.71 / REFERENCES --- p.73

Zhao, Qiao. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 35-36). / Abstracts also in Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Model Description --- p.3 / Chapter 2.1 --- An Incentive Model for P2P Networks --- p.3 / Chapter 2.2 --- Learning Models for P2P Networks --- p.5 / Chapter 2.2.1 --- Current-best Learning Model (CBLM) --- p.5 / Chapter 2.2.2 --- Opportunistic Learning Model (OLM) --- p.6 / Chapter 2.3 --- Incentive Policies for P2P Networks --- p.7 / Chapter 2.3.1 --- Mirror Incentive Policy Vmirror --- p.8 / Chapter 2.3.2 --- Proportional Incentive Policy Vprop --- p.9 / Chapter 2.3.3 --- Linear Incentive Policy Class CLIP --- p.9 / Chapter 2.4 --- Performance and Robustness of Incentive Policies --- p.10 / Chapter 2.4.1 --- Robustness Analysis of Mirror Incentive Policy using the current-best learning method --- p.10 / Chapter 2.4.2 --- Robustness Analysis of Mirror Incentive Policy using the opportunistic learning method --- p.12 / Chapter 2.4.3 --- Robustness Analysis of Proportional Incentive Policy Using the current-best learning method --- p.12 / Chapter 2.4.4 --- Robustness Analysis of Proportional Incentive Policy Using the opportunistic learning method --- p.13 / Chapter 2.4.5 --- Robustness Analysis for Incentive Protocol in the Linear Incentive Class --- p.14 / Chapter 2.5 --- Connection with Evolutionary Game Theory --- p.17 / Chapter 3 --- Performance Evaluation --- p.21 / Chapter 3.1 --- Performance and Robustness of the Mirror Incentive Policy (Pmirror): --- p.21 / Chapter 3.2 --- Performance and Robustness of the Proportional Incentive Policy {Pprop): --- p.23 / Chapter 3.3 --- Performance and Robustness of incentive policy in the Linear Incentive Class (CLIP)： --- p.24 / Chapter 3.4 --- The Effect of Non-adaptive Peers: --- p.25 / Chapter 4 --- Adversary Effect of Altruism --- p.29 / Chapter 4.1 --- The Effect of Protocol Cost --- p.29 / Chapter 4.2 --- The Tradeoff between Altruism and System Robustness --- p.30 / Chapter 5 --- Related Work --- p.33 / Chapter 6 --- Conclusion --- p.34 / Bibliography --- p.35

Chan, Hing Pan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 107-109). / Abstracts in English and Chinese. / Chapter Chapter 1 - --- Introduction --- p.1 / Chapter Chapter 2 - --- Background --- p.3 / Chapter 2.1 --- IEEE 802.11 MAC Protocol --- p.3 / Chapter 2.2 --- Related Work --- p.5 / Chapter Chapter 3 - --- Design Principles --- p.8 / Chapter Chapter 4 - --- Load-Adaptive Transmission Scheduling --- p.11 / Chapter 4.1 --- Contention Period (CP) --- p.14 / Chapter 4.2 --- Service Period (SP) --- p.22 / Chapter Chapter 5 - --- Synchronization --- p.27 / Chapter 5.1 --- Slot Boundary Detection --- p.27 / Chapter 5.2 --- Period Boundary Detection --- p.29 / Chapter 5.3 --- Period Identification --- p.30 / Chapter 5.4 --- Exception Handling --- p.62 / Chapter Chapter 6 - --- Performance Analysis --- p.70 / Chapter Chapter 7 - --- Performance Evaluations --- p.73 / Chapter 7.1 --- Parameter Tuning --- p.75 / Chapter 7.2 --- CBR UDP Traffic --- p.82 / Chapter 7.3 --- TCP Traffic --- p.94 / Chapter 7.4 --- Performance in Multi-hop Networks --- p.101 / Chapter Chapter 8 - --- Conclusions --- p.105 / Bibliography --- p.107

Ip, Yin Ki. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 96-102). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- DTN Reference Implementation Model --- p.7 / Chapter 2.2 --- DTN Applications --- p.9 / Chapter 2.3 --- Multiple-copy Routing Strategies --- p.11 / Chapter 2.4 --- Buffer Management Strategies --- p.12 / Chapter 2.5 --- Performance Modeling of Multiple-copy Routing --- p.14 / Chapter 2.6 --- Conclusion on Background Study --- p.18 / Chapter 3 --- DTN with Resource Constraints --- p.20 / Chapter 3.1 --- Introduction --- p.20 / Chapter 3.2 --- Related Work --- p.21 / Chapter 3.3 --- "System Model, Replication, Forwarding and Buffer Management Strategies" --- p.22 / Chapter 3.4 --- Performance Evaluation --- p.29 / Chapter 3.4.1 --- Analysis on single-message-delivery with unlimited network resource --- p.29 / Chapter 3.4.2 --- Simulation study on multi-message-delivery with limited resource constraint --- p.34 / Chapter 3.5 --- Conclusion on DTN with Resource Constraints --- p.39 / Chapter 4 --- Multiple-copy Routing in DTN with Heteroge- neous Node Types --- p.41 / Chapter 4.1 --- Introduction --- p.41 / Chapter 4.2 --- Related Work --- p.44 / Chapter 4.3 --- System Model --- p.44 / Chapter 4.4 --- Performance Modeling --- p.46 / Chapter 4.4.1 --- Continuous Time Markov Chain (CTMC) Model --- p.46 / Chapter 4.4.2 --- Fluid Flow Approximation (FFA) --- p.53 / Chapter 4.5 --- Conclusion on DTN with Node Heterogeneity --- p.73 / Chapter 5 --- Conclusion and Future Work --- p.75 / Chapter A --- Random Direction Mobility Model --- p.78 / Chapter A.1 --- Mean Inter-encounter Interval --- p.79 / Chapter A.2 --- Inter-encounter Interval Distribution --- p.86 / Chapter A.3 --- Concluding Remarks --- p.88 / Chapter B --- Additional Results by Fluid Flow Approximation and Moment Closure Methods --- p.92 / Bibliography --- p.96

Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.

Security protocols provide a communication architecture upon which security-sensitive distributed applications are built. Flaws in security protocols can expose applications to exploitation and manipulation. A number of formal analysis techniques have been applied to security protocols, with the ultimate goal of verifying whether or not a protocol fulfils its stated security requirements. These tools are limited in a number of ways. They are not fully automated and require considerable effort and expertise to operate. The specification languages often lack expressiveness. Furthermore the model checkers often cannot handle large industrial scale protocols due to the enormous number of states generated.Current research is addressing many of the limitations of the older tools by using state-of-the-art search optimisation and modelling techniques. This dissertation examines new ways in which industrial protocols can be analysed and presents abstract communication channels; a method for explicitly specifying assumptions made about the medium over which participants communicate.