No description available.

With the proliferation of computer networking technologies and improved systems development practice, organizationally-based information systems are beginning to include automated information interchange that transcends organizational boundaries. The scope of interorganizational systems ranges from the simple exchange of standardized messages to the integration of separate organizationally-based hardware and software components. The dissertation considers the characteristics of Automated Information Sharing Systems (IS*s) with a view toward developing classification schema and predicting issues of relevance to organizations and society arising from IS* development and evolution. Development of IS*s may be examined from a variety of perspectives including participation incentives and objectives as well as structural, growth and technical characteristics. Each of these is investigated by the analysis of actual case studies representing current and prototype IS* implementations. The output of the initial investigatory process is a set of representative taxonomies which may be used to classify and categorize IS*s. The primary taxonomic scheme, participation levels, represents categorization of IS*s on two bases: operational/technical characteristics and strategic utilization potentialities. Application taxonomies, interchange objective and interchange type, are also developed to provide a foundation for assessing the underlying characteristics of interchange prior to determining appropriate IS* application features. In this way, the thesis presents fundamental concepts for continuing research into the development and potential impact of IS*s.

No description available.

No description available.

No description available.

The aim of the work in this thesis is to develop a new approach of interacting with adhoc networked environments. These are networks where devices connect on demand with no underlying network infrastructure. The intention of this work is to develop these environments so that devices and services on these networks can publish their services, query for other services and connect with each other when required. The devices need to be able to perform these actions without prior knowledge of each other, therefore a theory of communication, semiotics, is presented. Ad-hoc networks provide an appropriate test-bed for this application of semiotics as they allow services to `know' about each other and communicate with one another. By using semiotics, we aim to create a representation of communication that allows a system to communicate within the networked environment and ask for services and connections as well as interact with users and provide. This way a user can demand something from the surrounding environment and the elements within this environment can communicate with each other to provide the service the user required. To create an effective model for this representation, various research areas will be discussed such as smart environments, natural language processing, multicast environments and human computer interaction. Principles will be used from all these areas to implement an approach of interacting with smart environments. Different types of smart environments, such as as smart homes and m-commerce environments, will be used to observe how di erent contexts a ect communication. A prototype system was realised for proof of concept and evaluated by subjects. This work highlighted the feasibility of this approach and opened a new area worthwhile of further research.

No description available.

Approved for public release; distribution is unlimited / An effective method of practicing cyber attack and defend techniques is through cyber-exercises, coordinated over the Internet. The Virtual Private Network (VPN) is an effective way to link cyber attack and defend teams, providing for the encryption of exercise traffic that transits the public network infrastructure. However, VPNs and the technologies and devices behind them are not yet widely understood. Research and evaluation of VPN solutions will identify those most conducive to supporting a cyber-exercise. Users demand a solution that is secure, reliable, and easy to employ. The research in this thesis applies directly to the selection and implementation of an optimal VPN solution to support cyber-exercises. / Major, United States Marine Corps

by Tat-keung Chan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 60-[62]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Video Conferencing Systems --- p.1 / Chapter 1.3 --- Thesis Organization --- p.5 / Chapter 2 --- Conferencing Network Model --- p.8 / Chapter 2.1 --- Conferee Distribution --- p.9 / Chapter 2.2 --- Conference Node Set --- p.11 / Chapter 2.3 --- Route Configuration --- p.11 / Chapter 2.4 --- Mode of Operation --- p.14 / Chapter 3 --- Conferencing Network Management --- p.17 / Chapter 3.1 --- Call Admission --- p.17 / Chapter 3.2 --- Route Configuration Assignment --- p.19 / Chapter 3.2.1 --- Basic Route Configuration Assignment --- p.19 / Chapter 3.2.2 --- Reroutable Route Configuration Assignment --- p.19 / Chapter 4 --- Conferencing Network Capacity --- p.22 / Chapter 4.1 --- Basic Capacity Derivation --- p.22 / Chapter 4.1.1 --- Limiting Probability Distribution --- p.23 / Chapter 4.1.2 --- Video Freeze Probability --- p.24 / Chapter 4.1.3 --- Basic Capacity Space --- p.26 / Chapter 4.1.4 --- Representation of Ω --- p.27 / Chapter 4.1.5 --- Example --- p.31 / Chapter 4.2 --- Extended Capacity Derivation --- p.39 / Chapter 4.2.1 --- Reroutable Assignment --- p.39 / Chapter 4.2.2 --- Limiting Probability Distribution --- p.41 / Chapter 4.2.3 --- Video Freeze Probability --- p.44 / Chapter 4.2.4 --- Extended Capacity Space --- p.44 / Chapter 4.2.5 --- Example --- p.45 / Chapter 4.2.6 --- State Space Size --- p.46 / Chapter 5 --- Call Blocking Probability --- p.49 / Chapter 5.1 --- Call Blocking Probability for Basic Assignment --- p.51 / Chapter 5.1.1 --- Example --- p.52 / Chapter 5.2 --- Call Blocking Probability for Reroutable Assignment --- p.55 / Chapter 6 --- Conclusion --- p.57 / Chapter 6.1 --- Summary of Results --- p.57 / Chapter 6.2 --- Issues for future investigations --- p.58 / Bibliography --- p.60

Kwok Pui Wing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 66-67). / Abstracts in English and Chinese. / Abstract --- p.i / Abstract (Chinese Version) --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Linear Network Coding --- p.7 / Chapter 2.1 --- Single Source Network Coding --- p.8 / Chapter 2.2 --- Descriptions of Linear Network Codes --- p.9 / Chapter 2.3 --- Desirable Properties of Linear Network Codes --- p.12 / Chapter 2.4 --- Linear Network Codes Constructions --- p.14 / Chapter 3 --- Node-based Characterization --- p.16 / Chapter 3.1 --- Channel-based characterization --- p.16 / Chapter 3.2 --- A Necessary Condition for the Existence of Linear Network Codes --- p.17 / Chapter 3.3 --- Insufficiency of the condition --- p.22 / Chapter 4 --- Relation between Linear Network Codes --- p.25 / Chapter 4.1 --- Relation between Multicast and Broadcast --- p.26 / Chapter 4.1.1 --- Auxiliary Graph --- p.26 / Chapter 4.2 --- Relation between Broadcast and Dispersion --- p.29 / Chapter 4.2.1 --- Expanded Graph --- p.29 / Chapter 4.3 --- Relation between Dispersion and Generic Net- work Code --- p.31 / Chapter 4.3.1 --- Edge Disjoint Path --- p.31 / Chapter 4.3.2 --- Path Rearrangement --- p.34 / Chapter 4.3.3 --- Extended Graph --- p.50 / Chapter 5 --- Upper Bound on the Size of the Base Field --- p.57 / Chapter 5.1 --- Base Field Size Requirement --- p.58 / Chapter 5.1.1 --- Linear Multicast --- p.58 / Chapter 5.1.2 --- Linear Broadcast --- p.58 / Chapter 5.1.3 --- Linear Dispersion --- p.59 / Chapter 5.1.4 --- Generic Network Code --- p.60 / Chapter 5.2 --- Upper Bounds Comparison for Generic Network Code --- p.61 / Chapter 6 --- Future Work --- p.62 / Bibliography --- p.66