Currently, many systems improve transparency and efficiency in the transmission and utilization of financial information. For example, Electronic Data Gathering And Retrieval (EDGAR), which is used by the Securities Exchange Commission (SEC) in USA is an electronic filing system for listed companies to submit financial documents. After validation, those documents are disseminated electronically to investors. Securities Markets Automated Research Training and Surveillance (SMARTS), developed in Australia, is a market monitoring system, which detects market behavior, trading patterns, and aberrant trading activities. Also, many financial information retrieval and analysis systems support searching, retrieval, and analysis of financial information, one such example is BOOM. Boom collects, organizes, analyzes and delivers financial information to their subscribers. However, these systems are designed to support vertical perspective of market information transmission, which may be duplicated and error prone, and can be collaborated to provide a more complete view of information for market monitoring and investment decision. / This dissertation is aimed to integrate the financial information in a horizontal perspective---an Integrated Trading Environment is proposed which has five systems to provide the needed functionality. In which, two surveys were conducted on the adoption of on-line trading by both investors and brokers in order to develop strategies for launching the online trading system. To cooperate with the strategies, a knowledge-based financial information infrastructure was proposed in the new trading environment. With the support of proposed Financial Information to Knowledge Transforming Model (FIKTM), a XML-based data integration architecture was constructed to improve the market transparency and efficiency. / Lau Sau Mui. / "August 2002." / Source: Dissertation Abstracts International, Volume: 63-10, Section: B, page: 4873. / Supervisor: Jerome Yen. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (p. 210-219). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. Ann Arbor, MI : ProQuest dissertations and theses, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Motivated by the fact that the contention graph associated with ICN is a Markov random field (MRF) with respect to the probability distribution of its system states, and that the belief propagation algorithm (BP) is an efficient way to solve "inference" problems in graphical models such as MRF, we study how to apply BP algorithms to the analysis and control of CSMA wireless networks. We investigate three applications: (1) computation of link throughputs given link access intensities; (2) computation of link access intensities required to meet target link throughputs; and (3) optimization of network utility via the control of link access intensities. We show that BP solves the three problems with exact results in tree networks and has manageable computation errors in a network with loopy contention graph. In particular, we show how a generalized version of BP, GBP, can be designed to solve the three problems above with higher accuracy. Importantly, we show how the BP and GBP algorithms can be implemented in a distributed manner, making them useful in practical CSMA network operation. / The above studies focus on computation and control of "equilibrium" link throughputs. Besides throughputs, an important performance measure in CSMA networks is the propensity for starvation. In this thesis, we show that links in CSMA wireless networks are particularly susceptible to "temporal" starvation. Specifically, certain links may have good equilibrium throughputs, yet they can still receive no throughput for extended periods from time to time. We develop a "trap theory" to analyze temporal throughput fluctuations. The trap theory serves two functions. First, it allows us to derive new mathematical results that shed light on the transient behavior of CSMA networks. Second, we can develop automated analytical tools for computing the "degrees of starvation" for CSMA networks to aid network design. We believe that the ability to identify and characterize temporal starvation as established in this thesis will serve as an important first step toward the design of effective remedies for it. / This thesis investigates the performance and control of CSMA wireless networks. To this end, an analytical model of CSMA wireless networks that captures the essence of their operation is important. We propose an Ideal CSMA Network (ICN) model to characterize the dynamic of the interactions and dependency of links in CSMA wireless networks. This model allows us to address various issues related to performance and control of CSMA networks. / We show that the throughput distributions of links in ICN can be computed from a continuous-time Markov chain and are insensitive to the distributions of the transmission time (packet duration) and the backoff countdown time in the CSMA MAC protocol given the ratio of their means rho, referred to as the access intensity. An outcome of the ICN model is a Back-of-the-Envelope (BoE) approximate computation method that allows us to bypass complicated stochastic analysis to compute link throughputs in many network configurations quickly. The BoE computation method emerges from ICN in the limit rho → infinity. Our results indicate that BoE is a good approximation technique for modest-size networks such as those typically seen in 802.11 deployments. Beyond serving as the foundation for BoE, the theoretical framework of ICN is also a foundation for understanding and optimization of large CSMA networks. / Kai, Caihong. / Adviser: Soung Chang Liew. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 180-183). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

At last, we focus on the detection problem in the protocol sequence design. The objective is to construct user-detectable sequences that allow any active user be detected by the receiver via some algorithm within some bounded delay if and only if it has become active. / First of all, in order to minimize variation of throughput due to delay offsets, we investigate protocol sequences whose pairwise Hamming cross-correlation is a constant for all possible relative offsets. It can be viewed as a generalization of completely shift-invariant sequences, which can achieve the zero-variation in throughput over a slot-synchronized channel. / Provided that the number of active users is smaller than the number of potential users, strongly conflict-avoiding codes are introduced with the non-blocking property in the asynchronous channel. It can be viewed as an extension of completely irrepressible sequences. / The second one is a non-blocking property which ensures that each active user can successfully transmit information at least once in its each active period. With the assumption that all potential users may be active simultaneously, user-irrepressible sequences and completely irrepressible sequences are studied respectively for different level of synchronization, to support the non-blocking property. / This thesis is based on Massey's model on collision channels without feedback, in which collided packets are considered unrecoverable. A collision occurs if two or more packets are partially or totally overlapped. Each potential user is assigned a deterministic zero-one pattern, called the protocol sequence, and sends a packet if and only if it is active and the value of the sequence is equal to one. Due to lack of feedback, the beginning of the protocol sequences cannot be synchronized and variation in relative offsets is inevitable. It further yields variation in throughput. / We study the design of protocol sequences from three different perspectives. / Zhang, Yijin. / Adviser: Wing Shing Wong. / Source: Dissertation Abstracts International, Volume: 73-03, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 1116). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

In this research work we propose a 3D node deployment strategy by carefully considering the unique characteristics of underwater acoustic communication as well as 3D dynamic nature of UWSN. This strategy targets 3D UWSN and not only improves the routing protocol performance significantly in terms of end to end delay and energy consumption but also provides reliability in data transmission. This strategy has been developed step by step from a single line of vertical communication to an effective 3D node deployment for UWSN. Several simulation experiments were carried out after adding different features to the final design to observe their impact on the overall routing performance. Finally, it is verified that this design strategy improves the routing performance, provides reliability to the network and increases network lifetime. Furthermore, we compared our results to the random node deployment in 3D, which is commonly used for analysing the performance of UWSN routing protocols. The comparison results verified our effective deployment design and showed that it provides almost 150% less end-to-end delay and almost 25% less energy consumption to the random deployment. It also revealed that by increasing the data traffic, our 3D node deployment strategy has no loss of data due to several back-up paths available, which is in contrast to random node deployment, where the packet loss occurs by increasing the data traffic. Improving the routing performance by carefully analysing the impact of 3D node deployment strategy and ensuring full sensing, transmission and back-up coverage in a highly unpredictable underwater environment, is a novel approach. Embedding this strategy with any networking protocol will improve its performance significantly.

Wan, Wing San. / "September 2010." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (p. 53-55). / Abstracts in English and Chinese. / Acknowledgements --- p.ii / Abstract --- p.iii / 摘要 --- p.iv / Contents --- p.v / Chapter Chapter 1 --- INTRODUCTION --- p.1 / Chapter Chapter 2 --- BACKGROUND AND RELATED WORK --- p.4 / Chapter 2.1 --- Sender-receiver-based approaches --- p.4 / Chapter 2.2 --- Sender-based approaches --- p.5 / Chapter 2.3 --- Receiver-based approaches --- p.6 / Chapter Chapter 3 --- TCP FLOW CONTROL REVISITED --- p.8 / Chapter Chapter 4 --- OPPORTUNISTIC TRANSMISSION --- p.12 / Chapter 4.1 --- Link bandwidth estimation --- p.16 / Chapter 4.2 --- Reception rate estimation --- p.18 / Chapter 4.3 --- Transmission scheduling --- p.19 / Chapter 4.4 --- Performance --- p.21 / Chapter Chapter 5 --- Local Retransmission --- p.23 / Chapter 5.1 --- The blackout period --- p.24 / Chapter 5.2 --- Proactive retransmission --- p.28 / Chapter 5.3 --- Performance --- p.30 / Chapter Chapter 6 --- Loss Event Suppression --- p.31 / Chapter 6.1 --- RTT modulation --- p.32 / Chapter 6.2 --- Performance --- p.35 / Chapter Chapter 7 --- Fairness --- p.37 / Chapter 7.1 --- Packet forwarding --- p.37 / Chapter 7.2 --- Non-uniform bandwidth allocation --- p.41 / Chapter Chapter 8 --- EXPERIMENTS --- p.43 / Chapter 8.1 --- Experiment setup --- p.43 / Chapter 8.2 --- Packet loss --- p.44 / Chapter 8.3 --- Unaccelerated TCP throughput --- p.45 / Chapter 8.4 --- Accelerated TCP throughput --- p.46 / Chapter 8.5 --- Fairness --- p.47 / Chapter 8.6 --- Mobile handset performance --- p.47 / Chapter Chapter 9 --- FUTURE WORK --- p.49 / Chapter 9.1 --- Dynamic AWnd control --- p.49 / Chapter 9.2 --- Split-TCP --- p.50 / Chapter 9.3 --- Dynamic resource allocation --- p.50 / Chapter 9.4 --- Sender-based acceleration --- p.51 / Chapter Chapter 10 --- CONCLUSION --- p.52 / BIBLIOGRAPHY --- p.53

by Patrick Lam Sze Fan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 163-[170]). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Fault-tolerant CUM LAUDE NET --- p.7 / Chapter 2.1 --- Overview of CUM LAUDE NET --- p.7 / Chapter 2.2 --- Network architecture of CUM LAUDE NET --- p.8 / Chapter 2.3 --- Design of Router-node --- p.10 / Chapter 2.3.1 --- Architecture of the Router-node --- p.10 / Chapter 2.3.2 --- Buffers Arrangement of the Router-node --- p.12 / Chapter 2.3.3 --- Buffer transmission policies --- p.13 / Chapter 2.4 --- Protocols of CUM LAUDE NET --- p.14 / Chapter 2.5 --- Frame Format of CUM LAUDE NET --- p.15 / Chapter 2.6 --- Fault-tolerant (FT) and Auto-healing (AH) algorithms --- p.16 / Chapter 2.6.1 --- Overview of the algorithms --- p.16 / Chapter 2.6.2 --- Network Failure Scenarios --- p.18 / Chapter 2.6.3 --- Design and Implementation of the Fault Tolerant Algorithm --- p.19 / Chapter 2.6.4 --- Design and Implementation of the Auto Healing Algorithm --- p.26 / Chapter 2.6.5 --- Network Management Signals and Restoration Times --- p.27 / Chapter 2.6.6 --- Comparison of fault-tolerance features of other networks with the CUM LAUDE NET --- p.31 / Chapter 2.7 --- Chapter Summary --- p.31 / Chapter 3 --- Overview of the Asynchronous Transfer Mode (ATM) --- p.33 / Chapter 3.1 --- Introduction --- p.33 / Chapter 3.2 --- ATM Network Interfaces --- p.34 / Chapter 3.3 --- ATM Virtual Connections --- p.35 / Chapter 3.4 --- ATM Cell Format --- p.36 / Chapter 3.5 --- ATM Address Formats --- p.36 / Chapter 3.6 --- ATM Protocol Reference Model --- p.38 / Chapter 3.6.1 --- The ATM Layer --- p.39 / Chapter 3.6.2 --- The ATM Adaptation Layer --- p.39 / Chapter 3.7 --- ATM Signalling --- p.44 / Chapter 3.7.1 --- ATM Signalling Messages and Call Setup Procedures --- p.45 / Chapter 3.8 --- Interim Local Management Interface (ILMI) --- p.47 / Chapter 4 --- Issues of Connectionless Gateway --- p.49 / Chapter 4.1 --- Introduction --- p.49 / Chapter 4.2 --- The Issues --- p.50 / Chapter 4.3 --- ATM Internetworking --- p.51 / Chapter 4.3.1 --- LAN Emulation --- p.52 / Chapter 4.3.2 --- IP over ATM --- p.53 / Chapter 4.3.3 --- Comparing IP over ATM and LAN Emulation --- p.59 / Chapter 4.4 --- Connection Management --- p.61 / Chapter 4.4.1 --- The Indirect Approach --- p.62 / Chapter 4.4.2 --- The Direct Approach --- p.63 / Chapter 4.4.3 --- Comparing the two approaches --- p.64 / Chapter 4.5 --- Protocol Conversion --- p.65 / Chapter 4.5.1 --- Selection of Protocol Converter --- p.68 / Chapter 4.6 --- Packet Forwarding Modes --- p.68 / Chapter 4.7 --- Bandwidth Assignment --- p.70 / Chapter 4.7.1 --- Bandwidth Reservation --- p.71 / Chapter 4.7.2 --- Fast Bandwidth Reservation --- p.72 / Chapter 4.7.3 --- Bandwidth Advertising --- p.72 / Chapter 4.7.4 --- Bandwidth Advertising with Cell Drop Detection --- p.73 / Chapter 4.7.5 --- Bandwidth Allocation on Source Demand --- p.73 / Chapter 4.7.6 --- The Common Problems --- p.74 / Chapter 5 --- Design and Implementation of the Connectionless Gateway --- p.77 / Chapter 5.1 --- Introduction --- p.77 / Chapter 5.1.1 --- Functions Definition of Connectionless Gateway --- p.79 / Chapter 5.2 --- Hardware Architecture of the Connectionless Gateway --- p.79 / Chapter 5.2.1 --- Imposed Limitations --- p.82 / Chapter 5.3 --- Software Architecture of the Connectionless Gateway --- p.83 / Chapter 5.3.1 --- TCP/IP Internals --- p.84 / Chapter 5.3.2 --- ATM on Linux --- p.85 / Chapter 5.4 --- Network Architecture --- p.88 / Chapter 5.4.1 --- IP Addresses Assignment --- p.90 / Chapter 5.5 --- Internal Structure of Connectionless Gateway --- p.90 / Chapter 5.5.1 --- Protocol Stacks of the Gateway --- p.90 / Chapter 5.5.2 --- Gateway Operation by Example --- p.93 / Chapter 5.5.3 --- Routing Table Maintenance --- p.97 / Chapter 5.6 --- Additional Features --- p.105 / Chapter 5.6.1 --- Priority Output Queues System --- p.105 / Chapter 5.6.2 --- Gateway Performance Monitor --- p.112 / Chapter 5.7 --- Setup an Operational ATM LAN --- p.117 / Chapter 5.7.1 --- SVC Connections --- p.117 / Chapter 5.7.2 --- PVC Connections --- p.119 / Chapter 5.8 --- Application of the Connectionless Gateway --- p.120 / Chapter 6 --- Performance Measurement of the Connectionless Gateway --- p.121 / Chapter 6.1 --- Introduction --- p.121 / Chapter 6.2 --- Experimental Setup --- p.121 / Chapter 6.3 --- Measurement Tools of the Experiments --- p.123 / Chapter 6.4 --- Descriptions of the Experiments --- p.124 / Chapter 6.4.1 --- Log Files --- p.125 / Chapter 6.5 --- UDP Control Rate Test --- p.126 / Chapter 6.5.1 --- Results and analysis of the UDP Control Rate Test --- p.127 / Chapter 6.6 --- UDP Maximum Rate Test --- p.138 / Chapter 6.6.1 --- Results and analysis of the UDP Maximum Rate Test --- p.138 / Chapter 6.7 --- TCP Maximum Rate Test --- p.140 / Chapter 6.7.1 --- Results and analysis of the TCP Maximum Rate Test --- p.140 / Chapter 6.8 --- Request/Response Test --- p.144 / Chapter 6.8.1 --- Results and analysis of the Request/Response Test --- p.144 / Chapter 6.9 --- Priority Queue System Verification Test --- p.149 / Chapter 6.9.1 --- Results and analysis of the Priority Queue System Verifi- cation Test --- p.150 / Chapter 6.10 --- Other Observations --- p.153 / Chapter 6.11 --- Solutions to Improve the Performance --- p.154 / Chapter 6.12 --- Future Development --- p.157 / Chapter 7 --- Conclusion --- p.158 / Bibliography --- p.163 / A List of Publications --- p.171

by Po Chun-Wong. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1997. / Incldues bibliographical references (leaves 110-113). / ABSTRACT --- p.ii / TABLE OF CONTENTS --- p.iii / LIST OF TABLES --- p.v / ACKNOWLEDGMENTS --- p.vi / Chapter / Chapter I. --- INTRODUCTION --- p.1 / The Hong Kong Securities Market --- p.1 / The Way How Listed Securities are Traded --- p.4 / The Low Participation Rate of Individual Investors and Its Adverse Consequences --- p.9 / The Services Provided by Stockbrokers --- p.10 / How Listed Securities are Promoted --- p.10 / Internet and Online Financial Information Services --- p.14 / Online Securities Trading via the Internet --- p.18 / The Pros and Cons of Dealing Securities on the Internet --- p.20 / "The Listed Companies, Stockbrokers and the Hong Kong Stock Exchange's Presence on the Internet" --- p.34 / Chapter II. --- THIS STUDY --- p.38 / Purpose of the Study --- p.38 / Justification of the Study --- p.38 / Scope of the Study ………………… --- p.39 / Chapter III. --- RESEARCH METHODOLOGY --- p.40 / Research Design --- p.40 / Sample Selection --- p.41 / Survey Design --- p.42 / Questionnaire Development --- p.43 / Timing of the Study --- p.43 / Chapter IV. --- ANALYSIS OF FINDINGS --- p.44 / Response Rate --- p.45 / Demographics of the Samples --- p.45 / Stock Trading Behaviour --- p.48 / Computer Usage --- p.53 / Internet and Web Usage --- p.54 / "Data Privacy, Censorship & Security of Transaction" --- p.62 / Attitude of Online Securities Trading --- p.66 / Chapter V. --- LIMITATIONS OF THE STUDY --- p.67 / Non-Response Bias --- p.67 / Response Bias --- p.67 / Sample Selection Bias --- p.69 / Language Used in Questionnaire --- p.69 / Chapter VI. --- COMPARISON OF STUDIES --- p.70 / Hong Kong Internet User Survey 1996 --- p.70 / GVU's 6th WWW User Survey --- p.72 / "Find/SVP's “The American Home Financial Services Survey""" --- p.77 / IntelliQuest Information Group --- p.80 / Chapter VII. --- RECOMMENDATIONS --- p.81 / Market Segmentation --- p.81 / Market Positioning and Strategy --- p.82 / Other Recommendations --- p.88 / Directions for Future Studies --- p.92 / Chapter VIII. --- CONCLUSIONS --- p.94 / APPENDICES --- p.96 / BIBLIOGRAPHY --- p.110

Cheung Wing Hang. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 107-112). / Abstracts in English and Chinese. / Abstract --- p.ii / Abstract in Chinese --- p.iv / Acknowledgments --- p.v / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Firewall Issue in Distributed Systems --- p.2 / Chapter 1.2 --- Heterogeneous Communication Protocols --- p.4 / Chapter 1.3 --- Translator for Converting Interface Definition to Flexible XML --- p.8 / Chapter 1.4 --- An Implementation of a Scalable Mediator Query System --- p.9 / Chapter 1.5 --- Our Contributions --- p.9 / Chapter 1.6 --- Outline of This Thesis --- p.10 / Chapter 2 --- Related Work and Technologies --- p.12 / Chapter 2.1 --- Overview of XML Technology --- p.12 / Chapter 2.1.1 --- XML Basic Syntax --- p.13 / Chapter 2.1.2 --- DTD: The Grammar Book --- p.15 / Chapter 2.1.3 --- Representing Complex Data Structures --- p.17 / Chapter 2.2 --- Overview of Java Servlet Technology --- p.18 / Chapter 2.3 --- Overview of Simple Object Access Protocol --- p.20 / Chapter 2.4 --- Overview of XML-RPC --- p.21 / Chapter 2.5 --- Overview of XIOP --- p.22 / Chapter 3 --- Using XML and Servlets to Support CORBA Calls --- p.24 / Chapter 3.1 --- Objective --- p.24 / Chapter 3.2 --- General Concept of Our Mechanism --- p.25 / Chapter 3.2.1 --- At Client Side --- p.27 / Chapter 3.2.2 --- At Server Side --- p.28 / Chapter 3.3 --- Data in Transmission --- p.30 / Chapter 3.3.1 --- Using XML --- p.30 / Chapter 3.3.2 --- Format of Messages in Transmission --- p.30 / Chapter 3.4 --- Supporting Callbacks in CORBA Systems --- p.33 / Chapter 3.4.1 --- What is callback? --- p.33 / Chapter 3.4.2 --- Enhancement to Allow Callbacks --- p.34 / Chapter 3.5 --- Achieving Transparency with Add-on Components --- p.37 / Chapter 4 --- A Translator to Convert CORBA IDL to XML --- p.39 / Chapter 4.1 --- Introduction to CORBA IDL --- p.39 / Chapter 4.2 --- Mapping from IDL to XML --- p.40 / Chapter 4.2.1 --- IDL Basic Data Types --- p.41 / Chapter 4.2.2 --- IDL Complex Data Types --- p.42 / Chapter 4.2.3 --- IDL Interface --- p.48 / Chapter 4.2.4 --- Attributes --- p.48 / Chapter 4.2.5 --- Operations (Methods) --- p.49 / Chapter 4.2.6 --- Exceptions --- p.50 / Chapter 4.2.7 --- Inheritance --- p.51 / Chapter 4.2.8 --- IDL Modules --- p.52 / Chapter 4.2.9 --- A Sample Conversion --- p.52 / Chapter 4.3 --- Making a Request or Response --- p.53 / Chapter 4.4 --- Code Generation for Add-on Components --- p.54 / Chapter 4.4.1 --- Generation of Shadow Objects --- p.54 / Chapter 4.4.2 --- Generation of Servlet Components --- p.55 / Chapter 5 --- Communication in Heterogeneous Distributed Environments --- p.58 / Chapter 5.1 --- Objective --- p.58 / Chapter 5.2 --- General Concept --- p.60 / Chapter 5.3 --- Case Study 1 - Distributed Common Object Model --- p.61 / Chapter 5.3.1 --- Brief Overview of Programming in DCOM --- p.61 / Chapter 5.3.2 --- Mapping the Two Different Interface Definitions --- p.63 / Chapter 5.3.3 --- Sample Architecture of Communicating Between DCOM and CORBA --- p.66 / Chapter 5.4 --- Case Study 2 - Java Remote Methods Invocation --- p.67 / Chapter 5.4.1 --- Brief Overview of Programming in Java RMI --- p.67 / Chapter 5.4.2 --- Mapping the Two Different Interface Definitions --- p.69 / Chapter 5.4.3 --- Sample Architecture of Communicating Between JavaRMI and CORBA --- p.71 / Chapter 5.5 --- Be Generic: Binding with the WEB --- p.72 / Chapter 6 --- Building a Scalable Mediator-based Query System --- p.74 / Chapter 6.1 --- Objectives --- p.74 / Chapter 6.2 --- Introduction to Our Mediator-based Query System --- p.76 / Chapter 6.2.1 --- What is mediator? --- p.76 / Chapter 6.2.2 --- The Architecture of our Mediator Query System --- p.77 / Chapter 6.2.3 --- The IDL Design of the Mediator System --- p.79 / Chapter 6.2.4 --- Components in the Query Mediator System --- p.80 / Chapter 6.3 --- Helping the Mediator System to Expand Across the Firewalls --- p.83 / Chapter 6.3.1 --- Implementation --- p.83 / Chapter 6.3.2 --- Across Heterogeneous Systems with DTD --- p.87 / Chapter 6.4 --- Adding the Callback Feature to the Mediator System --- p.89 / Chapter 6.5 --- Connecting our CORBA System with Other Environments --- p.90 / Chapter 6.5.1 --- Our Query System in DCOM --- p.91 / Chapter 6.5.2 --- Our Query System in Java RMI --- p.92 / Chapter 6.5.3 --- Binding Heterogeneous Systems --- p.93 / Chapter 7 --- Evaluation --- p.95 / Chapter 7.1 --- Performance Statistics --- p.95 / Chapter 7.1.1 --- Overhead in other methods --- p.97 / Chapter 7.2 --- Means for Enhancement --- p.98 / Chapter 7.2.1 --- Connection Performance of HTTP --- p.98 / Chapter 7.2.2 --- Transmission Data Compression --- p.99 / Chapter 7.2.3 --- Security Concern --- p.99 / Chapter 7.3 --- Advantages of Using Our Mechanism --- p.101 / Chapter 7.4 --- Disadvantages of Using Our Mechanism --- p.102 / Chapter 8 --- Conclusion --- p.104

Ho Ho-ching. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 104-107). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgment --- p.vi / Chapter 1. --- Introduction --- p.1 / Chapter 1.1. --- Introduction to PBX based Call Center --- p.1 / Chapter 1.2. --- The Scenarios --- p.2 / Chapter 1.3. --- Thesis Overview --- p.5 / Chapter 2. --- Features of Collaborative Browsing --- p.8 / Chapter 2.1. --- Feature Synchronization vs Bitmap Screen Transfer --- p.8 / Chapter 2.2. --- Basic Collaborative Features of the Collaborative Browser --- p.9 / Chapter 2.2.1. --- Web Page Pushing --- p.10 / Chapter 2.2.2. --- Screen Widget Synchronization --- p.11 / Chapter 2.2.3. --- Tele-pointing and Shared Whiteboard --- p.12 / Chapter 2.3. --- Collaborative Form Manipulation --- p.13 / Chapter 2.3.1. --- Importance of Electronic Form Collaboration --- p.13 / Chapter 2.3.2. --- Basic Support for Form Collaboration ´ؤ´ؤData Synchronization --- p.14 / Chapter 2.3.3. --- Existence of Form Complexity ´ؤForm Data Dependency --- p.75 / Chapter 2.3.4. --- Hinting --- p.17 / Chapter 2.4. --- Collaborative IVR --- p.23 / Chapter 2.4.1. --- Traditional Interactive Voice Response (IVR) Service --- p.23 / Chapter 2.4.2. --- Abstraction ´ؤCorrelating Form Interaction Mechansim with IVR --- p.25 / Chapter 2.4.3 --- Collaborative IVR by Form Interaction Mechanism --- p.27 / Chapter 3. --- Software Architecture --- p.33 / Chapter 3.1. --- The Three-Tier Architecture --- p.33 / Chapter 3.2. --- The Collaboration Mechanism for Collaborative Browser --- p.37 / Chapter 3.2.1. --- Session Initialization/Termination --- p.37 / Chapter 3.2.2. --- Data Flow of the Basic Collaboration Features --- p.39 / Chapter 3.2.3. --- Control Mechanism --- p.40 / Chapter 3.2.4. --- The Hinting Mechanism for Collaborative Form Manipulation --- p.43 / Chapter 3.3. --- The Collaboration Mechanism for Collaborative IVR --- p.45 / Chapter 4. --- Implementation --- p.51 / Chapter 4.1. --- Shareable Document Object Architecture for Collaboration --- p.51 / Chapter 4.1.1. --- Document Object Architecture --- p.51 / Chapter 4.1.2. --- Generalizing to Shareable Document Object Architecture --- p.53 / Chapter 4.2. --- Whiteboard Mechanism --- p.55 / Chapter 4.3. --- Packet Data Unit for Communication --- p.57 / Chapter 4.4. --- Bridging Different Software Components --- p.60 / Chapter 4.5. --- Hinting Mechanism for Collaborative Form Manipulation --- p.63 / Chapter 4.5.1. --- Relating Form Fields to Table Fields --- p.63 / Chapter 4.5.2. --- Hinting by the Hinting Tables --- p.69 / Chapter 4.6. --- Collaborative IVR --- p.73 / Chapter 4.6.1. --- Using Mediator for Collaborative IVR --- p.73 / Chapter 4.6.2. --- Concept of Telephone Form --- p.74 / Chapter 4.6.3. --- Hinting for Collaborative IVR --- p.78 / Chapter 4.7. --- System Integration --- p.81 / Chapter 5. --- Performance Evaluation and Experiment Results --- p.84 / Chapter 5.1. --- Optimizing the Transmission Methodology --- p.84 / Chapter 5.2. --- Browser Responsiveness Study --- p.86 / Chapter 5.2.1. --- Experiment Details --- p.86 / Chapter 5.2.2. --- The Assumptions --- p.89 / Chapter 5.2.3. --- Experiment Results and Analysis --- p.90 / Chapter 5.3. --- Bandwidth Consumption --- p.94 / Chapter 6. --- Conclusions --- p.97 / Appendix A 一 Government Profit Tax Return Form --- p.101 / Appendix B ´ؤ A Phone Banking IVR Service Tree --- p.103 / Bibliography --- p.104

Yeung, Fei-Fei. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 144-146). / Abstracts in English and Chinese. / Introduction --- p.1 / Chapter Part I: --- A New Socket API for Enhancing Server Efficiency --- p.5 / Chapter Chapter 1 --- Introduction --- p.6 / Chapter 1.1 --- Brief Background --- p.6 / Chapter 1.2 --- Deficiencies of Nagle's Algorithm and Goals and Objectives of this Research --- p.7 / Chapter 1.2.1 --- Effectiveness of Nagle's Algorithm --- p.7 / Chapter 1.2.2 --- Preventing Small Packets via Application Layer --- p.9 / Chapter 1.2.3 --- Minimum Delay in TCP Buffer --- p.10 / Chapter 1.2.4 --- Maximum Delay in TCP Buffer --- p.11 / Chapter 1.2.5 --- New Socket API --- p.12 / Chapter 1.3 --- Scope of Research and Summary of Contributions --- p.12 / Chapter 1.4 --- Organization of Part 1 --- p.13 / Chapter Chapter 2 --- Background --- p.14 / Chapter 2.1 --- Review of Nagle's Algorithm --- p.14 / Chapter 2.2 --- Additional Problems Inherent in Nagle's Algorithm --- p.17 / Chapter 2.3 --- Previous Proposed Modifications on Nagle's Algorithm --- p.22 / Chapter 2.3.1 --- The Minshall Modification --- p.22 / Chapter 2.3.1.1 --- The Minshall Modification --- p.22 / Chapter 2.3.1.2 --- The Minshall et al. Modification --- p.23 / Chapter 2.3.2 --- The Borman Modification --- p.23 / Chapter 2.3.3 --- The Jeffrey et al. Modification --- p.25 / Chapter 2.3.3.1 --- The EOM and MORE Variants --- p.25 / Chapter 2.3.3.2 --- The DLDET Variant --- p.26 / Chapter 2.3.4 --- Comparison Between Our Proposal and Related Works --- p.26 / Chapter Chapter 3 --- Min-Delay-Max-Delay TCP Buffering --- p.28 / Chapter 3.1 --- Minimum Delay --- p.29 / Chapter 3.1.1 --- Why Enabling Nagle's Algorithm Alone is Not a Solution? --- p.29 / Chapter 3.1.2 --- Advantages of Min-Delay TCP-layer Buffering versus Application-layer Buffering --- p.30 / Chapter 3.2 --- Maximum Delay --- p.32 / Chapter 3.2.1 --- Why Enabling Nagle's Algorithm Alone is Not a Solution? --- p.32 / Chapter 3.2.2 --- Advantages of Max-delay TCP Buffering versus Nagle's Algorithm --- p.33 / Chapter 3.3 --- Interaction with Nagle's Algorithm --- p.34 / Chapter 3.4 --- When to Apply Our Proposed Scheme? --- p.36 / Chapter 3.5 --- New Socket Option Description --- p.38 / Chapter 3.6 --- Implementation --- p.40 / Chapter 3.6.1 --- Small Packet Transmission Decision Logic --- p.42 / Chapter 3.6.2 --- Modified API --- p.44 / Chapter Chapter 4 --- Experiments --- p.46 / Chapter 4.1 --- The Effect of Kernel Buffering Mechanism on the Service Time --- p.47 / Chapter 4.1.1 --- Aims and Methodology --- p.47 / Chapter 4.1.2 --- Comparison of Transmission Time Required --- p.49 / Chapter 4.2 --- Performance of Min-Delay-Max-Delay Scheme --- p.56 / Chapter 4.2.1 --- Methodology --- p.56 / Chapter 4.2.1.1 --- Network Setup --- p.56 / Chapter 4.2.1.2 --- Traffic Model --- p.58 / Chapter 4.2.1.3 --- Delay Measurement --- p.60 / Chapter 4.2.2 --- Efficiency of Busy Server --- p.62 / Chapter 4.2.2.1 --- Performance of Nagle's algorithm --- p.62 / Chapter 4.2.2.2 --- Performance of Min-Delay TCP Buffering Scheme --- p.67 / Chapter 4.2.3 --- Limiting Delay by Setting TCP´ؤMAXDELAY --- p.70 / Chapter 4.3 --- Performance Sensitivity Discussion --- p.77 / Chapter 4.3.1 --- Sensitivity to Data Size per Invocation of send() --- p.77 / Chapter 4.3.2 --- Sensitivity to Minimum Delay --- p.83 / Chapter 4.3.3 --- Sensitivity to Round Trip Time --- p.85 / Chapter Chapter 5 --- Conclusion --- p.88 / Chapter Part II: --- Two Analytical Models for a Refined TCP Algorithm (TCP Veno) for Wired/Wireless Networks --- p.91 / Chapter Chapter 1 --- Introduction --- p.92 / Chapter 1.1 --- Brief Background --- p.92 / Chapter 1.2 --- Motivation and Two Analytical Models --- p.95 / Chapter 1.3 --- Organization of Part II --- p.96 / Chapter Chapter 2 --- Background --- p.97 / Chapter 2.1 --- TCP Veno Algorithm --- p.97 / Chapter 2.1.1 --- Packet Loss Type Identification --- p.97 / Chapter 2.1.2 --- Refined AIMD Algorithm --- p.99 / Chapter 2.1.2.1 --- Random Loss Management --- p.99 / Chapter 2.1.2.2 --- Congestion Management --- p.100 / Chapter 2.2 --- A Simple Model of TCP Reno --- p.101 / Chapter 2.3 --- Stochastic Modeling of TCP Reno over Lossy Channels --- p.103 / Chapter Chapter 3 --- Two Analytical Models --- p.104 / Chapter 3.1 --- Simple Model --- p.104 / Chapter 3.1.1 --- Random-loss Only Case --- p.105 / Chapter 3.1.2 --- Congestion-loss Only Case --- p.108 / Chapter 3.1.3 --- The General Case (Random + Congestion Loss) --- p.110 / Chapter 3.2 --- Markov Model --- p.115 / Chapter 3.2.1 --- Congestion Window Evolution --- p.115 / Chapter 3.2.2 --- Average Throughput Formulating --- p.119 / Chapter 3.2.2.1 --- Random-loss Only Case --- p.120 / Chapter 3.2.2.2 --- Congestion-loss Only Case --- p.122 / Chapter 3.2.2.3 --- The General Case (Random + Congestion Loss) --- p.123 / Chapter Chapter 4 --- Comparison with Experimental Results and Discussions --- p.127 / Chapter 4.1 --- Throughput versus Random Loss Probability --- p.127 / Chapter 4.2 --- Throughput versus Normalized Buffer Size --- p.132 / Chapter 4.3 --- Throughput versus Bandwidth in Asymmetric Networks --- p.135 / Chapter 4.3 --- Summary --- p.136 / Chapter Chapter 5 --- Sensitivity of TCP Veno Throughput to Various Parameters --- p.137 / Chapter 5.1 --- Multiplicative Decrease Factor (α) --- p.137 / Chapter 5.2 --- Number of Backlogs (β) and Fractional Increase Factor (γ) --- p.139 / Chapter Chapter 6 --- Conclusions --- p.142 / Bibliography --- p.144