This thesis studies social influence from the perspective of users' characteristics. The importance of users' characteristics in word-of-mouth applications has been emphasized in economics and marketing fields. We model a category of users called mavens where their unique characteristics nominate them to be the preferable seeds in viral marketing applications. In addition, we develop some methods to learn their characteristics based on a real dataset. We also illustrate the ways to maximize information flow through mavens in social networks. Our experiments show that our model can successfully detect mavens as well as fulfill significant roles in maximizing the information flow in a social network where mavens considerably outperform general influential users for influence maximization. The results verify the compatibility of our model with real marketing applications.

The extraordinary conditions of a disaster, require the mobilisation of all available resources, inducing the rush of humanitarian partners into the affected area. This phenomenon called the proliferation of actors, causes serious problems during the disaster response phase including the oversupply, duplicated efforts, lack of planning. The aim of this research is to provide a solution to reduce the partner proliferation problem. To that end the main research question is put forward as “How to reduce the proliferation of partners in a disaster response”? Panel analysis of the historic record of 4,252 natural onset disasters between 1980 to 2013 via regression analysis, MA and AHP gives rise to the formation of a predictive decision-making platform called PREDIS. It is capable of predicting the human impact of the disaster (fatality, injured, homeless) of up to 3% of errors and enables the decision makers to estimate the required needs for each disaster and prioritises them based on the disaster type and socio-economics of the affected country. It further renders it possible to rank and optimise the desired partners based on the decision maker’s preferences. Verification of the PREDIS through a simulation game design using a sample group of decision makers, show that this technique enables the user to decide within one hour after the disaster strike using the widely available data at the time of the disaster. It also enables non-experts to decide almost identically to experts in terms of the similarity of the choices and the speed of the decision. The lack of an extensive database for the potential humanitarian partners from which to choose, is the limitation of this research in addition to the lack of standardised set of minimum requirements for the suitable partners. The model is also as strong as its data feed which is inconsistent in various humanitarian sources.

Over the past twenty years industrial communications networks have become common place in most industrial plants. The high availability of these networks is crucial in smooth plant operations. Therefore local and remote diagnostics of these networks is of primary importance in solving any existing or emerging network problems. Users for most part consider the “plant networks” as black boxes, and often not sure of the actual health of the networks. The major part of the work outlined in this research concentrates on the proposed “Network Diagnostics Model” for local and remote monitoring. The main objective of the research is to aid the establishment of tools and techniques for diagnosis of the industrial networks, with particular emphasis on PROFIBUS and PROFINET. Additionally this research has resulted in development of a number of devices to aid in network diagnostics. The work outlined in this submission contributes to the developments in the area of online diagnostics systems. The development work was conducted in the following phases: 1. Development of Function Block (FB) for diagnosing PROFIBUS network for implementation on PLC. 2. Development of OPC server for diagnosing PROFIBUS network for implementation on PC. 3. Development of a web based diagnostic software for multiple fieldbuses for implementation on imbedded XP platform. 4. Development of OPC server for diagnosing PROFINET network for implementation on PC 5. Conformance testing of masters (PLC) in PROFIBUS network to increase the health of the network. 6. Use of diagnostics tools for performance analysis of fieldbuses networks for high performance applications. The research work outlined in this submission has made a significant and coherent contribution to online diagnostics of fieldbus communications networks, and has paved the way for the introduction of the online diagnostics devices to the market place. It has shown that the proposed model provides a uniform framework for research and development of diagnostics tools and techniques for fieldbus networks. Organizations that use fieldbus should consider installing advanced online diagnostic systems to boost maintenance efficiency and reduce operating costs, and maintain the availability of plant resources. Based on the experience gained over a number of years a multilayer model is proposed for future development of diagnostics tools.

Ransomware is a type of malware that has gained immense popularity in recent time due to its money extortion techniques. It locks out the user from the system files until the ransom amount is paid. Existing approaches for ransomware detection predominantly focus on system level monitoring, for instance, by tracking the file system characteristics. To date, only a small amount of research has focused on detecting ransomware at the network level, and none of the published proposals have addressed the challenges raised by the fact that an increasing number of ransomware are using encrypted channels for communication with the command and control (C&C) server, mainly, over the HTTPS protocol. Despite the limited amount of ransomware-specific data available in network traffic, network-level detection represents a valuable extension of system-level detection as this would provide early indication of ransomware activities and allow disrupting such activities before serious damage can take place. To address the aforementioned gap, we propose, in the current thesis, a new approach for detecting ransomware in encrypted network traffic that leverages network connection and certificate information and machine learning. We observe that network traffic characteristics can be divided into 3 categories – connection based, encryption based, and certificate based. Based on these characteristics, we explore a feature model that separates effectively ransomware traffic from normal traffic. We study three different classifiers – Random Forest, SVM and Logistic Regression. Experimental evaluation on diversified dataset yields a detection rate of 99.9% and a false positive rate of 0% for random forest, the best performing of the three classifiers. / Graduate

There are 1 files which have been withheld at the author's request. Master of Science in Engineering - Engineering / Modelling of telecommunications access networks which concentrate traffic is essential for architectural studies, design and operational efficiency. This work develops the concept of an Intermediate Services Access Network (ISAN) that represents an enhanced narrowband synchronous transfer mode access network which provides an evolutionary step from the existing POTS and N-ISDN access networks to the Fibre to the x (FTTx) networks. Models of the ISAN are developed to support architectural and traffic studies. Generic components are identified from a study of several typical ISAN network architectures. The components include intelligent nodes, transmission links and exchange interfaces. The modelling methodology used seeks firstly to identify resources in the access network and then model them as object classes. Entity-Relationship diagram techniques, defined by the International Telecommunications Union, are used in this work to identify, decompose and represent components in an access network. Recurring components in this work are termed generic components and have attributes that make them reusable. The classes developed consist of generic classes, and technology or application specific classes. Software classes are developed to represent traffic sources with selectable parameters including Poisson arrivals, negative exponential or lognormal holding times and asymmetric originating and terminating models. The identified object classes are implemented using the object-oriented simulation language MODSIM III. An existing unidirectional ring network is simulated to quantify the traffic performance of this type of network under telephone traffic conditions. The ring network is further developed to enhance traffic capacity and performance under link failure conditions. As an economic consideration, this hypothetical ring network uses a single backup link in the event of link failure. The network is simulated with different types of types of traffic (telephone, payphone and Internet dial-up traffic) and under link failure conditions to establish the grade of service.

Research within the last fifteen years on global advocacy networks has often focused on their accomplishments through the linking of similar groups. The majority of this research while being useful to examine transnational political dynamics has two deficiencies. The first is that there is little or no consideration of the network infrastructure (from code to cables) that allows the aforementioned linkage to occur. It is therefore important to investigate the politics of infrastructure, architecture and design and the power and control thereof. Secondly, prior to Web 2.0. technologies, advocacy networks were nodes of information distribution, rather than nodes to which information was directed, and then subsequently collected, compiled and used for political purposes. It is quite reasonable to argue that Web 2.0. technologies (again due to considerations of code, digital architecture and design) have altered the manner in advocacy networks interact with their supporters, other organizations and formal political institutions. This change is located within the advocacy network’s technoorganizational structure. Subsequently, as the digital architecture for the internet is an inter-operable free/libre open source software (FLOSS) common to information exchange, it stands to reason that as an infrastructure this technology is directly a political landscape over which and in which friction and contestation can and does occur. In regard to the methods of interaction, FLOSS technologies have greatly expanded the pool of potential social activists and reduced the costs of engagement, activism and highlighting issues. With these factors in mind it can be argued that FLOSS has created opportunities for civil society to emerge and engage with society at large in ways that are both new (in a digital medium) and similar (tackling issues of social justice as constructed by the social activists). When considered at a systematic level this process has several implications. These implications include the impact of 4 networking on identity, social relations, power relations and so on, which in turn acknowledges that modern computer networking can act as a mechanism that radically restructures various political relations. This itself acknowledges various contests over modern computer networking (one position which is expressed by various FLOSS proponents), and the physical infrastructure and the power and control thereof which allows such networking to even exist in the first instance. Within this context, which could be described as an information ecosystem, there is a recognition that advocacy networks have emerged as new sources of power ready to exert influence through networking that occurs in a) a non formal manner and b) ‘beneath the radar’ as it were.

by Kong Tat Cheong. / Thesis (M.Sc.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 64-65). / Chapter CHAPTER 1. --- INTRODUCTION --- p.1 / Chapter CHAPTER 2. --- RECENT RESEARCH REVIEW --- p.4 / Chapter CHAPTER 3. --- IMAGE ACCESS PROTOCOL --- p.8 / Chapter 3.1 --- Design Principles --- p.11 / Chapter 3.2 --- Protocol Mechanism --- p.16 / Chapter 3.3 --- IAP Packet Formats --- p.20 / Chapter 3.4 --- Protocol Operation Example --- p.28 / Chapter CHAPTER 4. --- SYSTEM IMPLEMENTATION --- p.31 / Chapter 4.1 --- Software Architecture and Interfaces --- p.33 / Chapter 4.2 --- System Operations and Applications --- p.43 / Chapter 4.3 --- Image Transmission Efficiency --- p.48 / Chapter CHAPTER 5. --- ENHANCED SYSTEM SERVICES --- p.51 / Chapter 5.1 --- Progressive Coding --- p.51 / Chapter 5.2 --- Call Management --- p.56 / Chapter 5.3 --- Priority Control --- p.57 / Chapter 5.4 --- Concurrent Control --- p.58 / Chapter CHAPTER 6. --- CONCLUSION --- p.59 / Chapter APPENDIX 1. --- APPLICATION PROGRAMMING INTERFACE --- p.61 / REFERENCE --- p.64

Wen Yonggang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references. / Abstracts in English and Chinese. / Chapter 1 --- Introduction / Chapter 1.1 --- Multi-Protocol Label Switching (MPLS) Technology --- p.1 / Chapter 1.2 --- Objective of this Thesis --- p.4 / Chapter 1.3 --- Reference --- p.5 / Chapter 2 --- Optical MPLS Network and Optical Label Schemes / Chapter 2.1 --- Optical MPLS Network --- p.7 / Chapter 2.2 --- Optical Label Schemes --- p.10 / Chapter 2.2.1 --- Time-division OMPLS scheme --- p.12 / Chapter 2.2.2 --- Wavelength-division OMPLS scheme --- p.16 / Chapter 2.2.3 --- Frequency-division OMPLS scheme --- p.22 / Chapter 2.2.3.1 --- UCSB Testbed --- p.23 / Chapter 2.2.3.2 --- UC-Davis Testbed --- p.26 / Chapter 2.2.3.3 --- NCTU-Telecordia Testbed --- p.28 / Chapter 2.2.4 --- Code-division OMPLS scheme --- p.30 / Chapter 2.2.4.1 --- Coherent Code-Division Label Scheme --- p.30 / Chapter 2.2.4.2 --- Noncoherent Code-Division Label Scheme --- p.32 / Chapter 2.3 --- Reference --- p.35 / Chapter 3 --- Architecture of OOC-based OMPLS network / Chapter 3.1 --- Infrastructure of OOC-label switch router (code converter) --- p.37 / Chapter 3.1.1 --- Architecture of the Proposed Code Converter --- p.38 / Chapter 3.1.2 --- Enhancement of the Code Converter --- p.41 / Chapter 3.2 --- Implementation of the OOC code converter --- p.43 / Chapter 3.2.1 --- Encoders/Decoders --- p.43 / Chapter 3.2.1.1 --- All-parallel encoders/decoders --- p.43 / Chapter 3.2.1.2 --- All-serial encoders/decoders --- p.45 / Chapter 3.2.1.3 --- Serial-to-parallel encoder/decoders --- p.47 / Chapter 3.2.1.4 --- Comparison of the three kinds of encoders/decoders --- p.49 / Chapter 3.2.2 --- Time-Gate-Intensity-Threshold (TGIT) Device --- p.50 / Chapter 3.2.3 --- Optical Space Switch Array --- p.54 / Chapter 3.2.3.1 --- All-optical Space Switch --- p.54 / Chapter 3.2.3.2 --- Optical switching technologies --- p.56 / Chapter 3.2.3.2.1 --- Scalability --- p.56 / Chapter 3.2.3.2.2 --- Switching Speed --- p.57 / Chapter 3.2.3.2.3 --- Reliability --- p.57 / Chapter 3.2.3.2.4 --- Losses --- p.58 / Chapter 3.2.3.2.5 --- Port-to-Port repeatability --- p.58 / Chapter 3.2.3.2.6 --- Cost --- p.59 / Chapter 3.2.3.2.7 --- Power Consumption --- p.60 / Chapter 3.3 --- Reference --- p.61 / Chapter 4 --- Scalability of OOC-based MPLS network / Chapter 4.1 --- Limitation on Label Switching Capacity --- p.63 / Chapter 4.1.1 --- Upper Bound --- p.65 / Chapter 4.1.2 --- Lower Bound --- p.66 / Chapter 4.2 --- Limitation on Switching Cascadability --- p.70 / Chapter 4.2.1. --- Limit Induced by the Inter-channel Crosstalk --- p.70 / Chapter 4.2.2 --- Limits Induced by the Residue Intensity of Sidelobes --- p.74 / Chapter 4.3 --- Appendix --- p.78 / Chapter 4.3.1 --- Derivation of Chip Intensity --- p.78 / Chapter 4.3.2 --- The 5% residue power criterion --- p.81 / Chapter 4.4 --- Reference --- p.83 / Chapter 5 --- Conclusion / Chapter 5.1 --- Summary of the Thesis --- p.85 / Chapter 5.2 --- Future work --- p.86

Li Pingping = 网络的结构性质及其动态过程 / 李萍萍. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 113-118). / Text in English; abstracts in English and Chinese. / Li Pingping = Wang luo de jie gou xing zhi ji qi dong tai guo cheng / Li Pingping. / Chapter 1 --- Overview --- p.1 / Chapter 2 --- Networks: A Review --- p.6 / Chapter 2.1 --- Graph Theory --- p.6 / Chapter 2.1.1 --- Degree --- p.7 / Chapter 2.1.2 --- Shortest-Path Length --- p.7 / Chapter 2.1.3 --- Clustering Coefficient --- p.8 / Chapter 2.2 --- Random Graphs --- p.9 / Chapter 2.2.1 --- Degree Distribution --- p.10 / Chapter 2.2.2 --- Shortest-Path Length --- p.11 / Chapter 2.2.3 --- Clustering Coefficient --- p.11 / Chapter 2.2.4 --- Shortcomings of The Model --- p.12 / Chapter 2.3 --- Small-World Network --- p.14 / Chapter 2.3.1 --- Small-World Effect in Real-World Networks --- p.14 / Chapter 2.3.2 --- Watts-Strogatz Model --- p.16 / Chapter 2.3.3 --- Properties --- p.17 / Chapter 2.3.4 --- Newman-Watts Model --- p.23 / Chapter 2.4 --- Scale-Free Network --- p.24 / Chapter 2.4.1 --- Background --- p.24 / Chapter 2.4.2 --- The Barabasi-Albert Model --- p.25 / Chapter 2.4.3 --- Shortest-Path Length --- p.28 / Chapter 2.4.4 --- Clustering Coefficient --- p.28 / Chapter 2.5 --- Summary --- p.29 / Chapter 3 --- Clustering Coefficient in Complex Networks --- p.30 / Chapter 3.1 --- Introduction --- p.30 / Chapter 3.2 --- Barabasi-Albert Networks --- p.32 / Chapter 3.3 --- Random Growing Networks --- p.37 / Chapter 3.4 --- Hybrid Networks with both Preferential and Random Attachments --- p.40 / Chapter 3.5 --- Summary --- p.42 / Chapter 4 --- Voter Model --- p.44 / Chapter 4.1 --- Introduction --- p.44 / Chapter 4.2 --- Voter Model --- p.45 / Chapter 4.3 --- Conservation Laws --- p.46 / Chapter 4.4 --- Ordering Process on Complex Networks --- p.47 / Chapter 4.5 --- Effective Dimension --- p.51 / Chapter 4.6 --- Summary --- p.52 / Chapter 5 --- Opinion Formation in Newman-Watts Networks --- p.54 / Chapter 5.1 --- Introduction --- p.54 / Chapter 5.2 --- Majority Rule Model in Newman-Watts Networks --- p.56 / Chapter 5.3 --- Shortening of Consensus Time --- p.58 / Chapter 5.4 --- Shortcuts and Mean-Field Limit --- p.61 / Chapter 5.5 --- Consensus Time and Shortest-Path Length --- p.65 / Chapter 5.6 --- Summary --- p.67 / Chapter 6 --- Opinion Formation in Hierarchical Networks --- p.68 / Chapter 6.1 --- Hierarchical Networks --- p.69 / Chapter 6.2 --- Shortest-Path Length --- p.72 / Chapter 6.3 --- Dynamics of Opinion Formation Model --- p.74 / Chapter 6.4 --- Summary --- p.81 / Chapter 7 --- An Introduction to Iterated Games --- p.82 / Chapter 7.1 --- Background --- p.82 / Chapter 7.2 --- Matrix Games --- p.83 / Chapter 7.3 --- The Prisoner's Dilemma --- p.85 / Chapter 7.4 --- Iterated Prisoner's Dilemma --- p.87 / Chapter 7.5 --- Evolutionary Game Theory --- p.90 / Chapter 7.5.1 --- Games in a Well-Mixed Population --- p.91 / Chapter 7.5.2 --- Games in Spatial Structure --- p.92 / Chapter 7.6 --- The Snowdrift Game --- p.92 / Chapter 8 --- Stochastic Reactive Strategies in Infinitely Iterated Games --- p.95 / Chapter 8.1 --- The PD and SD Games --- p.95 / Chapter 8.2 --- Stochastic Reactive Strategies --- p.97 / Chapter 8.3 --- Evolution of Stochastic Strategies --- p.100 / Chapter 8.4 --- Stochastic Strategies in Infinitely IPD --- p.101 / Chapter 8.5 --- Summary --- p.107 / Chapter 9 --- Summary --- p.109 / Bibliography --- p.113

Internet measurements have previously been done mostly from research labs and universities. The number of home users is growing rapidly and we need a good way to measure their network performance. This thesis focuses on building a web application that allows users to check what their network is like for online activities they are interested in. The application has minimal impediment to use by only requiring a Web browser. A list of online activities we offer users to choose from includes browsing web site categories such as news or social networks, having voice and video conferences, playing online games and other activities.