No description available.

Thesis (M.Sc.)--York University, 2007. Graduate Programme in Computer Science and Engineering. / Typescript. Includes bibliographical references (leaves 170-173). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR38826

No description available.

Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 146-149).

Zhang, Zhenyi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 55-[58]). / Abstracts in Chinese and English. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Problem Formulation --- p.4 / Chapter 3 --- Examples --- p.7 / Chapter 3.1 --- Examples of Undirected Graph --- p.7 / Chapter 3.1.1 --- Example 1: SPF Routing --- p.7 / Chapter 3.1.2 --- Example 2: rings --- p.7 / Chapter 3.1.3 --- Example 3: grid --- p.8 / Chapter 3.1.4 --- Example 4: cube --- p.9 / Chapter 3.1.5 --- Example 5: random graph X --- p.10 / Chapter 3.1.6 --- Example 6: random graph Y --- p.10 / Chapter 3.2 --- An Example for Directive Graph --- p.11 / Chapter 4 --- The Framework --- p.13 / Chapter 4.1 --- The distributed algorithm --- p.13 / Chapter 4.2 --- The modules --- p.14 / Chapter 4.3 --- Path control --- p.15 / Chapter 4.4 --- The forwarding module --- p.18 / Chapter 4.5 --- The routing module --- p.19 / Chapter 4.5.1 --- Non-weighted Routing (NWR) --- p.19 / Chapter 4.5.2 --- Weighted Routing (WR) --- p.20 / Chapter 4.6 --- Packet Aggregation (PKA) --- p.21 / Chapter 5 --- Experiments of Path Aggregation --- p.23 / Chapter 5.1 --- System Setup --- p.24 / Chapter 5.2 --- Experiment Results --- p.25 / Chapter 6 --- Convergence --- p.28 / Chapter 6.1 --- Simulation study --- p.34 / Chapter 6.2 --- Optimality --- p.34 / Chapter 6.3 --- Speed of Convergence --- p.37 / Chapter 7 --- The adaptive property --- p.41 / Chapter 7.1 --- Adapting to new links --- p.42 / Chapter 7.2 --- Adapting to topology changing --- p.43 / Chapter 7.3 --- Adapting to interference and congestion --- p.45 / Chapter 7.4 --- Adapting to traffic flows --- p.45 / Chapter 7.5 --- Adapting to capacity --- p.46 / Chapter 8 --- Related works --- p.48 / Chapter 8.1 --- Spanning Tree --- p.48 / Chapter 8.2 --- Minimum Equivalent Directed Graph Problem --- p.49 / Chapter 8.3 --- Topology Control --- p.50 / Chapter 8.4 --- The Relationship with our problem --- p.53 / Chapter 9 --- Conclusion --- p.54

Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2004. / Includes bibliographical references (p. 65-[69]).

Thesis (M. Sc.)--York University, 1998. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 43-46). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://wwwlib.umi.com/cr/yorku/fullcit?pMQ27394.

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 69-70). Also available in electronic version. Access restricted to campus users.

The purpose of this thesis is to determine the most effective parallel algorithm for the solution of the parabolic differential equations characteristic of diffusion problems. The primary aim is to apply the chosen algorithm to obtain solutions to the equations governing the operation of membrane-covered oxygen sensors, known as Clark electrodes, which are used for monitoring the oxygen concentration of blood. The boundary conditions of this problem require the development of a singularity correction technique. A brief history of electrochemical sensors leading to the development of the Clark electrode is given, together with the two-dimensional equations and boundary conditions governing its operation. A locally valid series expansion is derived to take care of the boundary singularity, together with a robust method of matching this to the finite difference approximation. Parallel implementations of three representative numerical algorithms applied to a simple model problem are compared by extending Leland's parallel effectiveness model. The chosen parallel algorithm is combined with the singularity correction to obtain a solution to the Clark electrode problem. Numerical experiments show this solution to achieve the required accuracy. Previous one-dimensional models of the Clark electrode are shown to be inadequate before the two-dimensional model is used to examine the variation of operation with design. The understanding gained allows us to demonstrate the advantages of pulse amperometry over steady-state techniques, and to suggest the most appropriate method and design for use in in vivo clinical monitoring.

Thesis (Ph. D.)--University of Canterbury, 2007. / Typescript (photocopy). Includes bibliographical references (p. 212-223). Also available via the World Wide Web.