by Chi-kwong Fong. / Thesis (M.Sc.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaves 30-[31]). / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Data Capture Subsystem --- p.7 / Chapter 3 --- Anomaly Detection Subsystem --- p.10 / Chapter 4 --- Descriptive Language Translation System --- p.14 / Chapter 5 --- Rule-based Analysis Subsystem --- p.20 / Chapter 6 --- Testing Results --- p.22 / Chapter 7 --- Summary --- p.27 / Bibliography --- p.30

Layered manufacturing plays important role in industry. Conventional pro-cess planning takes polygon soup as input and has high quality requirements on these polygonal model such as no self-intersection, no degenerate polygon et al. A growing number of models, especially for those in complex shape are acquired from reverse engineering. Implicit representation always serves as intermediate representation and ¯nally need to be tesselated into polygonal mesh for layered manufacturing applications. However, the present tessellation techniques have difficulties to provide topologically faithful and self-intersection free polygonal mesh from implicit model. On the other hand, implicit representation are mathematically compact and robust, which is important for presenting complex freeform models. / I develop a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, I generate contours through a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded; therefore, correct objects can be fabricated from them by layered manufacturing. Moreover, since I do not need to generate the tessellated B-rep of given solids, my direct slicing approach is memory efficient - only the binary image and the finest contours on one particular slicing plane need to be stored in-core. My method is general and can be applied to any implicit representations of solids. / Moreover, I also investigate techniques for support generation for layered manufacturing in image space. Region subtraction is a crucial operation for support generation. I develop a robust and reliable region subtraction method on implicit solid slicing. Compared with the conventional approach in which support regioncontours are produced from part slicing contours by polygonal operations, my approach calculates reasonable support region on binary image for each layer. I investigate a conservative growing-swallow technique to remove as much as possible the support material for self-support region while still guarantee the safety of building process. My region subtraction can serve as core technique for many layered manufacturing processes. In my research, I demonstrate region subtraction technique in both Fused Decomposition Modeling(FDM) and Stereolithography(SLA). A region cleaning technique which can reduce topology complexity of calculated support structure region is developed to fulfil specific requirement of FDM. With all the operations involved being discrete on binary image, my approach is more robust compared with the polygonal operations which are based on numerical computation. Moreover, processing on binary image makes my approach highly parallelizable. My self-intersection free contour extraction technique used in direct slicing can also be adopted to extract support structure contour on binary image if necessary. / Huang, Pu. / "October 2012." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 80-84). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract --- p.i / Chinese Abstract --- p.iii / Acknowledgements --- p.iv / List of Figures --- p.vii / List of Tables --- p.ix / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Contribution --- p.4 / Chapter 1.3 --- Organization --- p.5 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Direct Slicing on Implicit Solid --- p.7 / Chapter 2.2 --- Slicing based Support Generation --- p.9 / Chapter 3 --- Problem Definition --- p.10 / Chapter 4 --- Topologically Faithful Slicing Contour Generation --- p.12 / Chapter 4.1 --- Introduction --- p.12 / Chapter 4.2 --- Sampling and Contour Generation --- p.15 / Chapter 4.2.1 --- Sampling --- p.16 / Chapter 4.2.2 --- Topologically faithful contouring --- p.17 / Chapter 4.2.3 --- r-Regularity and Accuracy in Layered Manufacturing --- p.19 / Chapter 4.3 --- Constrained Smoothing --- p.20 / Chapter 4.4 --- Contour Simplification --- p.24 / Chapter 4.4.1 --- Variational segmentation --- p.25 / Chapter 4.4.2 --- Topology and distortion verification --- p.27 / Chapter 4.4.3 --- Hausdorff Error Analysis --- p.31 / Chapter 4.5 --- Results and Discussion --- p.33 / Chapter 5 --- Reliable and Robust Region Subtraction for Support Generation --- p.43 / Chapter 5.1 --- Introduction --- p.43 / Chapter 5.2 --- Preliminary --- p.46 / Chapter 5.3 --- Region Subtraction --- p.48 / Chapter 5.3.1 --- Binary Image Grid-width and Self-support Feature Threshold --- p.48 / Chapter 5.3.2 --- Conservative Growing-swallow Method --- p.50 / Chapter 5.4 --- Region Cleaning Technique for FDM --- p.53 / Chapter 5.5 --- Anchor Support Generation for SLA --- p.57 / Chapter 5.6 --- Result and Discussion --- p.60 / Chapter 6 --- Conclusion --- p.71 / Chapter 6.1 --- Summary and Discussion --- p.71 / Chapter 6.2 --- Future Work --- p.73 / Chapter A --- Inconsistent Contouring Problem Analysis --- p.76 / Bibliography --- p.80

Thesis. 1977. M.Arch.A.S.--Massachusetts Institute of Technology. Dept. of Architecture. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH. / Bibliography : leaves 174-178. / by Conrad Heeschen. / M.Arch.A.S.

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING / Bibliography: leaves 164-168. / by Joseph Githu Kimemia. / Ph.D.

Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING / Bibliography: leaf 44. / by Nathan Graham. / B.S.

Li Xiang. / "September 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 164-172) / 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 Company, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

As an example, the thesis proposes a real-time route guidance system to show how it supports other transportation services, which can then automatically guide vehicles by voice. It illustrates the system architecture and describes the establishment of each part. The concept of agent network is introduced to build up the system. Furthermore, a dynamic route algorithm is presented in brief. A communication system integrating the existing infrastructure is discussed and simulation results are provided to testify the applicability of the proposed wireless data communication system. / Finally, the thesis sums up the contributions achieved and proposes some future works. / For the communication network, the main challenging problems are the large scale of the network, the movement of vehicles that may cause the levity of the network structure, and the large demands on communication capacity. In order to solve these problems, the performance optimization technique is accredited as one of the most important techniques for such a large scale wireless sensor network. This thesis focuses on the research in the following aspects. First, the optimal combination of the duty cycle, one of the most important parameters, is introduced to optimize the system performance. A duty cycle optimization model is put forward based on calculating n-times reachable matrix. Now that the parameter optimization model can be boiled down to a NP-hard problem, an improved genetic algorithm is introduced to solve the problem. The computational procedure and efficiency are discussed, and simulation study based on a practical road network is given to illustrate the validity of the proposed method. Second, the topological structure optimization problem is formulated as a graph problem, while fulfilling random node-to-node communication demands. A new optimization method, called un-detour optimization, is proposed to optimize the topological structure based on the improved genetic algorithm. In addition, the approach is evaluated quantitatively by simulating community wireless sensor networks. The comparison results demonstrate that some significant performance advantages can be achieved by this approach. / In addition, two important techniques required to build the new surveillance system are discussed in this thesis. (1) the sensors to collect traffic information; (2) the communication network to transmit information among all sensors and vehicles. / In order to detect and track the moving objects, this thesis presents a creative background updating method, which can works effectively even for some complex circumstances. The image processing results show that this method can realize the segmentation of the moving objects. Due to the simple model and fast calculation speed, the method can satisfy the requirements of detecting and tracking traffic objects in real time and at a high speed. Additionally, the thesis designs a new kind of object detection and tracking algorithm based on the attributive combination of contour and color in order to deal with the occlusion problem to some extent. Some experiments have testified to the robustness and practicability of the proposed system. / Nowadays, with the rapid development of economics and societies, transportation is playing a very important role in the balanced running of social and economic systems. However, urban traffic problems such as traffic accidents and traffic congestions are becoming more and more serious in almost all large cities in the world. / This thesis is focused on a traffic surveillance system which collects and transmits real-time traffic information in a large city, which is one of the most important steps in solving the transportation problems above. Considering the drawbacks of current traffic surveillance system, a brand-new system with a distributed architecture is proposed based on the concept of sensor networks. Then, an intelligent sensor node using an embedded ARM chip and MCU is developed and software system is built up accordingly, including Linux operating system, hardware drivers, and so on. Finally, a simulation program proves the validity of the system. / Shi, Xi. / "September 2007." / Adviser: YangShong Xu. / Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4946. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 120-130). / 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, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

by Arion Ko Kin Wa. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 101-[106]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Service Survivability Planning --- p.2 / Chapter 1.3 --- Categories of Outages --- p.3 / Chapter 1.4 --- Goals of Restoration --- p.4 / Chapter 1.5 --- Technology Impacts on Network Survivability --- p.5 / Chapter 1.6 --- Performance Models and Measures in Quantifying Network Sur- vivability --- p.6 / Chapter 1.7 --- Organization of Thesis --- p.6 / Chapter 2 --- Design and Implementation of A Survivable High-Speed Mul- timedia Network --- p.8 / Chapter 2.1 --- An Overview of CUM LAUDE NET --- p.8 / Chapter 2.2 --- The Network Architecture --- p.9 / Chapter 2.2.1 --- Architectural Overview --- p.9 / Chapter 2.2.2 --- Router-Node Design --- p.11 / Chapter 2.2.3 --- Buffer Allocation --- p.12 / Chapter 2.2.4 --- Buffer Transmission Priority --- p.14 / Chapter 2.2.5 --- Congestion Control --- p.15 / Chapter 2.3 --- Protocols --- p.16 / Chapter 2.3.1 --- Design Overview --- p.16 / Chapter 2.3.2 --- ACTA - The MAC Protocol --- p.17 / Chapter 2.3.3 --- Protocol Layering --- p.18 / Chapter 2.3.4 --- "Segment, Datagram and Packet Format" --- p.20 / Chapter 2.3.5 --- Fast Packet Routing --- p.22 / Chapter 2.3.6 --- Local Host NIU --- p.24 / Chapter 2.4 --- The Network Restoration Strategy --- p.25 / Chapter 2.4.1 --- The Dual-Ring Model and Assumptions --- p.26 / Chapter 2.4.2 --- Scenarios of Network Failure and Remedies --- p.26 / Chapter 2.4.3 --- Distributed Fault-Tolerant Algorithm --- p.26 / Chapter 2.4.4 --- Distributed Auto-Healing Algorithm --- p.28 / Chapter 2.4.5 --- The Network Management Signals --- p.31 / Chapter 2.5 --- Performance Evaluation --- p.32 / Chapter 2.5.1 --- Restoration Time --- p.32 / Chapter 2.5.2 --- Reliability Measures --- p.34 / Chapter 2.5.3 --- Network Availability During Restoration --- p.41 / Chapter 2.6 --- The Prototype --- p.42 / Chapter 2.7 --- Technical Problems Encountered --- p.45 / Chapter 2.8 --- Chapter Summary and Future Development --- p.46 / Chapter 3 --- A Simple Experimental Network Management Software - NET- MAN --- p.48 / Chapter 3.1 --- Introduction to NETMAN --- p.48 / Chapter 3.2 --- Network Management Basics --- p.49 / Chapter 3.2.1 --- The Level of Management Protocols --- p.49 / Chapter 3.2.2 --- Architecture Model --- p.51 / Chapter 3.2.3 --- TCP/IP Network Management Protocol Architecture --- p.53 / Chapter 3.2.4 --- A Standard Network Management Protocol On Internet - SNMP --- p.54 / Chapter 3.2.5 --- A Standard For Managed Information --- p.55 / Chapter 3.3 --- The CUM LAUDE Network Management Protocol Suite (CNMPS) --- p.56 / Chapter 3.3.1 --- The Architecture --- p.53 / Chapter 3.3.2 --- Goals of the CNMPS --- p.59 / Chapter 3.4 --- Highlights of NETMAN --- p.61 / Chapter 3.5 --- Functional Descriptions of NETMAN --- p.63 / Chapter 3.5.1 --- Topology Menu --- p.64 / Chapter 3.5.2 --- Fault Manager Menu --- p.65 / Chapter 3.5.3 --- Performance Meter Menu --- p.65 / Chapter 3.5.4 --- Gateway Utility Menu --- p.67 / Chapter 3.5.5 --- Tools Menu --- p.67 / Chapter 3.5.6 --- Help Menu --- p.68 / Chapter 3.6 --- Chapter Summary --- p.68 / Chapter 4 --- A Local Map Based (LMB) Self-Healing Scheme for Arbitrary Topology Networks --- p.70 / Chapter 4.1 --- Introduction --- p.79 / Chapter 4.2 --- An Overview of Existing DCS-Based Restoration Algorithms --- p.72 / Chapter 4.3 --- The Network Model and Assumptions --- p.74 / Chapter 4.4 --- Basics of the LMB Scheme --- p.75 / Chapter 4.4.1 --- Restoration Concepts --- p.75 / Chapter 4.4.2 --- Terminology --- p.76 / Chapter 4.4.3 --- Algorithm Parameters --- p.77 / Chapter 4.5 --- Performance Assessments --- p.78 / Chapter 4.6 --- The LMB Network Restoration Scheme --- p.80 / Chapter 4.6.1 --- Initialization - Local Map Building --- p.80 / Chapter 4.6.2 --- The LMB Restoration Messages Set --- p.81 / Chapter 4.6.3 --- Phase I - Local Map Update Phase --- p.81 / Chapter 4.6.4 --- Phase II - Update Acknowledgment Phase --- p.82 / Chapter 4.6.5 --- Phase III - Restoration and Confirmation Phase --- p.83 / Chapter 4.6.6 --- Phase IV - Cancellation Phase --- p.83 / Chapter 4.6.7 --- Re-Initialization --- p.84 / Chapter 4.6.8 --- Path Route Monitoring --- p.84 / Chapter 4.7 --- Performance Evaluation --- p.84 / Chapter 4.7.1 --- The Testbeds --- p.84 / Chapter 4.7.2 --- Simulation Results --- p.86 / Chapter 4.7.3 --- Storage Requirements --- p.89 / Chapter 4.8 --- The LMB Scheme on ATM and SONET environment --- p.92 / Chapter 4.9 --- Future Work --- p.94 / Chapter 4.10 --- Chapter Summary --- p.94 / Chapter 5 --- Conclusion and Future Work --- p.96 / Chapter 5.1 --- Conclusion --- p.95 / Chapter 5.2 --- Future Work --- p.99 / Bibliography --- p.101 / Chapter A --- Derivation of Communicative Probability --- p.107 / Chapter B --- List of Publications --- p.110

A prototype hybrid knowledge-based advisory system for indoor radon mitigation has been developed to assist Pacific Northwest mitigators in the selection and design of mitigation systems for existing homes. The advisory system employs a heuristic inferencing strategy to determine which mitigation techniques are applicable, and applies procedural methods to perform the fan selection and cost estimation for particular techniques. The rule base has been developed employing knowledge in existing publications on radon mitigation. Additional knowledge has been provided by field experts. The benefits of such an advisory system include uniform record-keeping and consistent computations for the user, and verification of approved radon mitigation methods.

Problem: The process planning task for a given design problem in additive manufacturing can be greatly enhanced by referencing previously developed process plans. However, identifying appropriate process plans for the given design problem requires appropriate mapping between the design domain and the process planning domain. Hence, the objective of this research is to establish mathematical mapping between the design domain and the process planning domain such that the previously developed appropriate process plans can be identified for the given design task. Further more, identification of an appropriate mathematical theory that enables computational mapping between the two domains is of interest. Through such computational mapping, previously developed process plans are expected to be shared in a distributed environment using an open repository. Approach: The design requirements and process plans are discretized using empirical models that compute exact values of process variables for the given design requirements. Through this discretization, subsumption relations among the discretized design requirements and process plans are identified. Appropriate process plans for a given design requirement are identified by subsumption relations in the design requirements. Also, the design requirements that can be satisfied by the given process plans are identified by subsumption relations among the process plans. To computationally realize such mapping, a description logic (ALE) is identified and justified to represent and compute subsumption relation. Based on this investigation, a retrieval method (DFM framework) is realized that enables storage and retrieval of process plans. Validation: Theoretical and empirical validations are performed using the validation square method. For the theoretical validation, an appropriate description logic (ALE) is identified and justified. Also, subsumption utilization in mapping two domains and realizing the DFM framework is justified. For the empirical validation, the storing and retrieval performance of the DFM framework is tested to demonstrate its theoretical validity. Contribution: In this research, two areas of contributions are identified: DFM and engineering information management. In DFM, the retrieval method that relates the design problem to appropriate process plans through mathematical mapping between design and process planning domain is the major contribution. In engineering information management, the major contributions are the development of information models and the identification of their characteristics. Based on this investigation, an appropriate description logic (ALE) is selected and justified. Also, corresponding computational feasibility (non deterministic polynomial time) of subsumption is identified.