The binary response experiments are often used in many areas. In many investigations, different kinds of optimal designs are discussed under an assumed model. There are also some discussions on optimal designs for discriminating models. The main goal in this work is to find an optimal design with two support points which minimizes the maximal probability differences between possible models from two types of symmetric location and scale families. It is called the minimum bias two-points design, or the $mB_2$ design in short here. D- and A-efficiencies of the $mB_2$ design obtained here are evaluated under an assumed model. Furthermore, when the assumed model is incorrect, the biases and the mean square errors in evaluating the true probabilities are computed and compared with that by using the D- and A-optimal designs for the incorrectly assumed model.

Bingo game is a popular and interesting game. This paper considers some interesting properties of the Bingo game played in Taiwan. We discuss how to use the computer to calculate some interesting probability value for various sizes of bingo games. For example, the expectation of the calls to hit a Bingo and the expectation of the Bingo number after the $k$th number is called. Some interesting results are also discussed.

In these few years, gradually Internet develops to wideband, multimedia is being used on video or music. In addition, the use of IP Multicast must be based on the deployment of routers, which is too difficult to arrange. Utilities of Application Layer Multicast is in the middle and just between IP Multicast and Unicast.Therefore, in this paper, Application Layer Multicast is still worth to study it. In this paper, is applied effectively build the Application Layer Multicast. Control through the IP Anycast Technique, we can lower the time for host join the Multicast Tree. Every host can join the nearest cluster. We use the hierarchical cluster-based Method in order to serve more hosts. This concept about cluster can substantially decrease control overhead. The Complete Binary Trees lower the cluster leader¡¦s burden, also phased RTT decided effectively the transit sequence. In Summary, associate techniques with methods, to make up the defects from NICE and I-Zigzag.

Certain nonlinear binary codes having at least twice as many codewords as any known linear binary code can be regarded as the binary images of linear codes over Z4. This vision leads to a new concept in coding theory, called the Z4-linearity of binary codes. This thesis is a survey on the linear quaternary codes and their binary images under the Gray map. The conditions for the binary image of a linear quaternary code to be linear are thoroughly investigated and the Z4-linearity of the Reed-Muller and Hamming codes is discussed. The contribution of this study is a simplification on the testing method of linearity conditions via a few new lemmas and propositions. Moreover, binary images (of length 8) of all linear quaternary codes of length 4 are analyzed and it is shown that all 184 binary codes in the nonlinear subset of these images are worse than the (8, 4) Hamming code. This thesis also includes the Hensel lift and Galois ring which are important tools for the study of quaternary cyclic codes. Accordingly, the quaternary cyclic versions of the well-known nonlinear binary codes such as the Kerdock and Preparata codes and their Z4-linearity are studied in detail.

In this study binary and ternary ion exchange on Zeolite NaA using silver and cadmium ions were investigated. Ion exchange were conducted at constant temperature (25oC) and normality (0.1N) in a batch system for both binary and ternary experiments. Zeolite weights were varied between 0.1 and 1 g for binary experiments. Thermodynamic analysis of binary ion exchange between Cd2+-Na+ and Ag+-Na+ were examined and thermodynamic equilibrium constant and Gibbs free energy were calculated. Thermodynamic equilibrium constants were found as respectively 28.2 and 300.4 for Cd2+-Na+ and Ag+-Na+ binary system. Standart free energy of Cd2+-Na+ and Ag+-Na+ binary exchange were calculated as -4.1 kJ/mol and -14.1 kJ/mol respectively. In literature Ay (2008) calculated the Gibbs free energy for Ag+-Na+ binary system as -14.4 kJ/mol and Biskup and Subotic (2010) and Gal et al. (1970) calculated the Gibbs free energy for Cd2+-Na+ binary system as -3.7 kJ/mol and -4.4 kJ/mol respectively. It is concluded Zeolite 4A has higher affinity to silver than cadmium and selectivity sequence was found as / Ag+&gt / Cd2+&gt / Na+. Langmuir and Freundlich isotherms were drawn to describe experimental data. As compared the R2 of isotherms, it is clearly seen that Freundlich isotherm provides better fit for Cd2+-Na+ binary ion exchange and Ag+-Na+ binary ion exchange. The ternary ion exchange isotherms were plotted using equivalent fraction of three ions (Ag+,Na+,Cd2+) which participated in ion exchange experiments to determine selectivity of zeolite 4A for cadmium and silver. Selectivity sequence was determined as Ag+ &gt / Cd2+ &gt / Na+ for ternary ion exchange.

This thesis is to investigate the power system operation strategy for an electrified mass rapid transit¡]MRT¡^network with the load transfer among main transformers by considering load growth and due to annual ridership increase, the loading factors of main transformers are improved so that the power system loss can be reduced. For the conventional planning of an electrified MRT system to serve the public transportation for the metropolitan area, the transformer capacity is often designed to meet the criterion of not only covering the peak demand but also providing the 100% fully capacity reserve for the system operation of target year. With such a high backup capability, the transformers are very lightly loaded for most of the operation time and significant core loss will be introduced over the lifecycle. In this thesis the train motion equation has been applied to find the mechanical power required, the proper strategy of unit commitment of main transformers and network reconfiguration by switching operation has been considered to enhance the operation efficiency of an MRT power system. To demonstrate the effectiveness of the proposed methodology, the Taipei MRT network is selected for computer simulation. It is found that the loading factors of main transformers can be improved dramatically and the load balance among the transformers can be obtained by the proper switching operation. An efficient strategy for transformer planning by taking into account the growth rate of load so that the overall investment cost of main transformers can be justified. The load characteristics and load growth rate of mass rapid transit¡]MRT¡^are derived by an Energy Management Model (EMM) and the AC load flow analysis is used to solve the transformer copper loss and core loss over the study period. To obtain optimal planning and operation strategy of main transformers for the MRT power system, the transformers initial investment cost and depreciation cost, peak power loss and energy loss, and reliability cost of distribution transformers are combined to form the overall cost function .By performing the dynamic programming (DP) the unit commitment of main transformers by considering the annual peak and off peak power loading of whole MRT system is derived. It is found that more efficient system operation can be obtained by the proposed methodology.

The essential procedure of constructing 3-D building models in urban areas is to extract the building boundary footprint. In the past researches, the common procedures used in extracting the building footprint are applying edge detection, vectorization, and generalization. However, the derived boundary lines occasionally occur zigzag patterns, thus, it still needs further building footprint regularization. This study proposed a new approach in the point of view that the points, lines and polygons are the essential elements in reconstructing 3-D building models. The proposed new method is based on ¡§corner detection approach (CDA)¡¨ and ¡§Adjustment of building footprints and corner points (ABFCO)¡¨ algorithm on Light Detection And Ranging (LiDAR) or binary classification resultant imagery. This study implements Harris and Local Binary Pattern (LBP) corner detection, afterward, connects all detected points by using convex hull algorithm. However, ortho-non-rectangle buildings would compose poor outlines after convex hull. This study combines open and dilation morphology with the find ignored point algorithm to improve any incorrect connections. Finally, performs the ABFCO algorithm to those points which belong to the same boundary to generalize a line segment, and to figure out the intersections and boundary lines of the buildings. The experiment results have proved that the overall accuracy of LBP corner detection is about 3.5% higher than Harris corner detection, its overall accuracy is about 92% in rectangular buildings and about 91% in non-rectangular buildings, its standard deviation of boundary length is 0.29m and better than Harris¡¦s 0.55m. We also compared LBP corner detection with edge detection. The overall accuracy of corner detection is about 3% higher than edge detection, standard deviation of boundary length 0.37m is also better than edge detection 0.75m. This study not only proved the corner detection is better than edge detection from data, but also developed ABFCO algorithm is helpful for extracting more accurate building footprint lines.

This thesis is about coalgebraic methods in software specification and verification. It extends known techniques of coalgebraic specification to a more general level to pave the way for real world applications of software verification. There are two main contributions of the present thesis: 1. Chapter 3 proposes a generalisation of the familiar notion of coalgebra such that classes containing methods with arbitrary types (including binary methods) can be modelled with these generalised coalgebras. 2. Chapter 4 presents the specification language CCSL (short for Coalgebraic Class Specification Language), its syntax, its semantics, and a prototype compiler that translates CCSL into higher-order logic. / Die Dissertation beschreibt coalgebraische Mittel und Methoden zur Softwarespezifikation und -verifikation. Die Ergebnisse dieser Dissertation vereinfachen die Anwendung coalgebraischer Spezifikations- und Verifikationstechniken und erweitern deren Anwendbarkeit. Damit werden Softwareverifikation im Allgemeinen und im Besonderen coalgebraische Methoden zur Softwareverifikation der praktischen Anwendbarkeit ein Stück nähergebracht. Diese Dissertation enthält zwei wesentliche Beiträge: 1. Im Kapitel 3 wird eine Erweiterung des klassischen Begriffs der Coalgebra vorgestellt. Diese Erweiterung erlaubt die coalgebraische Modellierung von Klassenschnittstellen mit beliebigen Methodentypen (insbesondere mit binären Methoden). 2. Im Kapitel 4 wird die coalgebraische Spezifikationssprache CCSL (Coalgebraic Class Specification Language) vorgestellt. Die Bescheibung umfasst Syntax, Semantik und einen Prototypcompiler, der CCSL Spezifikationen in Logik höherer Ordnung (passend für die Theorembeweiser PVS und Isabelle/HOL) übersetzt.

Thesis (Ph. D.)--University of Missouri-Columbia, 2000. / Typescript. Vita. Includes bibliographical references (leaves 113-117). Also available on the Internet.

Thesis (Ph. D.)--University of California, San Diego, 2004. / Vita. Includes bibliographical references (leaves 189-190).