A thesis submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Doctor of Philosophy, School of Physics. Johannesburg. February, 2017 / The discovery of the Higgs boson at the Large Hadron Collider in Switzerland marks the beginning of a new era: Physics beyond the Standard Model (SM). A model is proposed to describe numerous Run I features observed with both the ATLAS and CMS experiments. The model introduces a heavy scalar estimated to be around 270 GeV and an intermediate scalar which can decay into both dark matter and SM particles. Three different final state searches, linked by the new hypothesis, are presented. These are the hh → γγb¯ b, γγ + Emiss T and high mass diphoton channels. No significant excesses were observed in any channel using the available datasets and limits were set on the relevant cross sections times branching ratios. The lack of statistics in the γγb¯ b analysis prevents any conclusive statement in regard to the excess observed with Run I data. Observing no excess in the γγ + Emiss T channel with the current amount of data is also consistent with the intermediate scalar decaying to SM particles. This could explain the excess of Higgs bosons produced in associations with top quarks in the multilepton final states observed in ATLAS and CMS in Run I and Run II. The work presented provides a deeper understanding on the underlying phenomenology of the hypothesis and provides a foundation for future work. The ATLAS detector underwent a stringent consolidation and validation effort before data taking could commence in 2015. A high voltage board was designed and implemented into a portable test-bench used in the certification and validation process. In addition to these efforts, the electronics on the ATLAS detector are being improved for the Phase-II upgrade program in 2024. A software tool has been designed which integrates the envisioned Phase-II backend infrastructure into the existing ATLAS detector control system. This software is now an ATLAS wide common tool used by multiple sub-detectors in the community. / XL2017

A Dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Master of Science. Johannesburg, 2016. / Plastic scintillators play a key role in reconstructing the energy and tracks of hadronic particles that impinge the Tile Calorimeter of the ATLAS detector as a result of high energy particle collisions generated by the Large Hadron Collider of CERN. In the detector, plastic scintillators are exposed to harsh radiation environments and are therefore susceptible to radiation damage. The radiation damage effects to the optical properties and structural damage were studied for PVT based commercial scintillators EJ200, EJ208, EJ260 and BC408, as well as PS based UPS923A and scintillators manufactured for the Tile Calorimeter. Samples of dimensions 5x5x0.3 mm were subjected to irradiation using 6 MeV protons to doses of approximately 0.8 MGy, 8 MGy, 25 MGy and 25 MGy using the 6 MV tandem accelerator of iThemba LABS. Results show that damage leads to a reduced light output and loss in transmission character. Structural damage to the polymer base and the formation of free radicals occur for doses ≥ 8 MGy leading to reduced scintillation in the base and re-absorption of scintillation light respectively. Scintillators containing a larger Stokes shift, i.e. EJ260 and EJ208 exhibit the most radiation hardness. EJ208 is recommended as a candidate to be considered for the replacement of Gap scintillators in the TileCal for the 2018 upgrade. / LG2017

A dissertation submitted to the Faulty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Master of Science. April 2017. / Plastic scintillators, situated in the Tile Calorimeter (TileCal) of the ATLAS detector at the Large Hadron Collider (LHC), play an integral part in the detection of diffractive, energetic hadronic particles that result from high energy proton-proton collisions. As these particles traversetheplastic, theresultantdecayofthepolymerbaseemitsluminescentlightwhichacts as a signature of this interaction. However, the deleterious radiation environment in which the plastics are situated ultimately degrade the plastic through the formation of free radicals which initiate chemical reactions and alter the structure of the plastic. Radical formation was studied using electron paramagnetic resonance (EPR) spectroscopy in six plastic scintillator types of either polystyrene (PS) or polyvinyl toluene (PVT) base, and computational EPR studies were conducted on two small monomer structures and two large polymer, plastic-like computer models. Damage was simulated in the computational models by removing an increasing number of hydrogen atoms. Plastic samples, of volume 500 ⇥500 ⇥ 250 µm, were to subjected protons accelerated to 6 MeV using the tandem accelerator at iThemba LABS, Gauteng, to increasing target doses of 0.8 MGy, 2.5 MGy, 8.0 MGy, 25 MGy, 50 MGy, and 80 MGy. The experimental EPR data taken after two weeks of the sample exposure to air indicate the presence of peroxy-type radicals that initiate chemical reactions, discolour the plastic, and decrease the efficiency of the plastic. Furthermore, the data suggests that damaged PS and PVT samples are susceptible to different mechanisms of radiation damage. However, results pertaining to the decrease in the g-factor and the increase in normalised EPR intensity suggest that all plastics behave similarly using an EPR analysis as a function of dose. Thus, the EPR analysis could not identify a specific plastic that would perform better than the existing plastics used in the TileCal. The computational chemical potential results indicate that electron transfer between damaged pristine and damaged models is possible. In the two small damaged models, the computational EPR data indicate the presence of a various stable akyl-like radicals depending on the site from which the hydrogen atoms are removed. In the two large damaged models, these results indicate a number of alkyl-, benzyl-, and cyclohexadienyl-like radicals. / LG2017

To find out what differs between two versions of a file can be done with several different techniques and programs. These techniques and programs are often focusd on finding differences in text files, in documents, or in class files for programming. An example of a program is the popular git tool which focuses on displaying the difference between versions of files in a project. A common way to find these differences is to utilize an algorithm called Longest common subsequence, which focuses on finding the longest common subsequence in each file to find similarity between the files. By excluding all similarities in a file, all remaining text will be the differences between the files. The Longest Common Subsequence is often used to find the differences in an acceptable time. When two lines in a file is compared to see if they differ from each other hashing is used. The hash values for each correspondent line in both files will be compared. Hashing a line will give the content on that line a unique value. If as little as one character on a line is different between the version, the hash values for those lines will be different as well. These techniques are very useful when comparing two versions of a file with text content. With data from a database some, but not all, of these techniques can be useful. A big difference between data in a database and text in a file will be that content is not just added and delete but also updated. This thesis studies the problem on how to make use of these techniques when finding differences between large datasets, and doing this in a reasonable time, instead of finding differences in documents and files.  Three different methods are going to be studied in theory. These results will be provided in both time and space complexities. Finally, a selected one of these methods is further studied with implementation and testing. The reason only one of these three is implemented is because of time constraint. The one that got chosen had easy maintainability, an easy implementation, and maintains a good execution time.

Thesis advisor: Noah P. Snyder / Thesis advisor: Gail C. Kineke / Maine coastal rivers host the last remaining runs of endangered anadromous Atlantic salmon in the United States, whose populations have decline from ~500,000 returning adults in the 1880s to only ~1000 in 2000. Restoration projects have focused on these coastal river systems to bring natural populations back to the area, and recent efforts involve adding large woody debris (LWD) to small tributaries to improve salmon rearing habitat. Large woody debris actively changes the hydraulics and geomorphology of small streams by acting as a barrier to flow and creating decreased velocity zones, scour pools, and sediment storage and sorting. I study the effects of LWD additions in early August 2008 on hydraulics and substrate in Baker Brook, a west-flowing tributary of the Narraguagus River. Hydraulically, I focus on the treatment reach nearest the confluence with the Narraguagus River (Baker1), and I also study changes in substrate in Baker1 and the upstream treatment location (Baker3). Both study locations are divided into two reaches, treatment (Baker1-T and Baker3-T) and control (Baker1-C and Baker3-C). In Baker1, the treatment and control reaches are further divided into four 50 m sub-reaches based on channel gradient (~1% in Baker1-C-Flat and Baker1-T-Flat; >2% in Baker1-C-Steep and Baker1-T-Steep). In Baker3, we use two 50 m sub-reaches of similar gradient (ranges from ~1% to 2%) to determine substrate changes. Significant post-LWD addition changes are determined by comparison with the control sub-reaches. Changes in the treatment sub-reaches must be larger than those in the control sub-reaches to be deemed significant. I seek to answer three research questions: (1) how much does mean velocity through the study sub-reaches change as a result of additions; (2) how much does hydraulic roughness change; and (3) does sediment storage and spatial sorting result from the LWD additions? I measured reach-average velocities (Ureach) in Baker1 using the salt dilution method in May, July and August 2008 and May 2009. I use rating curves to compare the post-treatment to the pre-treatment Ureach-stage relationship. A temporary decrease in Ureach occurred in October 2008 in Baker1-T-Flat, whereas the other sub-reaches experienced no change in Ureach. A localized change in cross-sectionally averaged velocity (U) measured with a flow meter, is also evident at Baker1-T-Flat, but this is because an added tree lies directly in the downstream cross-section where measurements are recorded. I assessed channel roughness changes by comparing roughness rating curves created using the Manning roughness parameter, n (back-calculated from velocity measurements) for each sub-reach. Because of the short-term decrease in Ureach, roughness increased in Baker1-T-Flat in October 2008 as well. No change in roughness is evident in the other sub-reaches because post-treatment values of n plot on the same decreasing trend with respect to stage as pre-treatment values. I quantified pre- and post-treatment sub-reach substrate median grain size (D50) with intensive clast counts in July 2008 and May 2009. In Baker1, analysis of pre-treatment substrate size show that the flat sub-reaches have a finer substrate size (34-38 mm) than the steep sub-reaches (88-134 mm). Baker3 pre-treatment grain size is similar to that of the flat Baker1 sub-reaches, with a median grain size of 38 mm in Baker3-T and 28 mm in Baker3-C. Two of the three treatment sub-reaches exhibited significant fining (D50 decreased by 37-54%) between the surveys, and the third changed less than measurement uncertainty. One of the three control sub-reaches coarsened significantly (D50 increased by 29%), one fined significantly (-42%), and one coarsened less than measurement uncertainty. In summary, I find that LWD additions in Baker Brook had little effect on reach-scale hydraulics during the flows we observed, but did influence bed-grain size during the 10-month study interval, underscoring the importance of floods on channel change. / Thesis (MS) — Boston College, 2009. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Geology and Geophysics.

The expansion of the universe is currently accelerating, as first inferred by Efstathiou et al. (1990), Ostriker & Steinhardt (1995) and directly determined by Riess et al. (1998) and Perlmutter et al. (1999). Current constraints are consistent with a time independent equation-of-state of w = -1, which is to be expected when a constant vacuum energy density dominates. But the Quantum Field Theory prediction for the magnitude of this vacuum energy is very much larger than that inferred (Weinberg, 1989; Koksma & Prokopec, 2011). It is entirely possible that the cause of the expansion has an alternative explanation, with both the inclusion of a quantum scalar field and modified gravity theories able to reproduce an expansion history close to, but potentially deviating from, that of a cosmological constant and cold dark matter. In this work I investigate the consistency of the VIMOS Public Extragalactic Redshift Survey (VIPERS) v7 census of the galaxy distribution at z = 0:8 with the expansion history and linear growth rate predicted by General Relativity (GR) when a Planck Collaboration et al. (2016) fiducial cosmology is assumed. To do so, I measure the optimally weighted redshift-space power spectrum (Feldman et al., 1994), which is anisotropic due to the coherent infall of galaxies towards overdensities and outflow from voids (Kaiser, 1987). The magnitude of this anisotropy can distinguish between modified theories of gravity as the convergence (divergence) rate of the velocity field depends on the effective strength of gravity on cosmological scales (Guzzo et al., 2008). This motivates measuring the linear growth rate rather than the background expansion, which is indistinguishable for a number of modified gravity theories. In Chapter 6 I place constraints of fσ8(0:76) = 0:44 ± 0:04; fσ8(1:05) = 0:28 ± 0:08; with the completed VIPERS v7 survey; the combination remains consistent with General Relativity at 95% confidence. The dependence of the errors on the assumed priors will be investigated in future work. Further anisotropy is introduced by the Alcock-Paczynski effect - a distortion of the observed power spectrum due to the assumption of a fiducial cosmology differing from the true one. These two sources of anisotropy may be separated based on their distinct scale and angular dependence with sufficiently precise measurements. Doing so degrades the constraints: fσ8(0:76) = 0:31 ± 0:10; fσ8(1:05) = -0:04 ± 0:26; but allows for the background expansion (FAP ≡ (1 + z)DAH=c) to be simultaneously constrained. Galaxy redshift surveys may then directly compare both the background expansion and linear growth rate to the GR predictions I find the VIPERS v7 joint-posterior on (fσ8; FAP ) shows no compelling deviation from the GR expectation although the sizeable errors reduce the significance of this conclusion. In Chapter 4 I describe and outline corrections for the VIPERS spectroscopic selection, which enable these constraints to be made. The VIPERS selection strategy is (projected) density dependent and may potentially bias measures of galaxy clustering. Throughout this work I present numerous tests of possible systematic biases, which are performed with the aid of realistic VIPERS mock catalogues. These also allow for accurate statistical error estimates to be made { by incorporating the sample variance due to both the finite volume and finite number density. Chapter 5 details the development and testing of a new, rapid approach for the forward modelling of the power spectrum multipole moments obtained from a survey with an involved angular mask. An investigation of the necessary corrections for the VIPERS PDR-1 angular mask is recorded. This includes an original derivation for the integral constraint correction for a smoothed, joint-field estimate of ¯n(z) and a description of how the mask should be accounted for in light of the Alcock- Paczynski effect. Chapter 7 investigates the inclusion of a simple local overdensity transform: 'clipping' prior to the redshift-space distortions (RSD) analysis. This tackles the root cause of non-linearity and potentially extends the validity of perturbation theory. Moreover, this marked clustering statistic potentially amplifies signatures of modified gravity and, as a density-weighted two-point statistic, includes information not available to the power spectrum. I show that a linear real-space power spectrum with a Kaiser factor and a Lorentzian damping yields a significant bias without clipping, but that this may be removed with a sufficiently strict transform; similar behaviour is observed for the VIPERS v7 dataset. Estimates of fσ8 for different thresholds are highly correlated due to the overlapping volume, but the bias for insufficient clipping can be calibrated and the correlation obtained using mock catalogues. A maximum likelihood value for the combined constraint of a number of thresholds is shown to achieve a ' 16% decrease in statistical error relative to the most precise single-threshold estimate. The results are encouraging to date but represent a work in progress; the final analysis will be submitted to Astronomy & Astrophysics as Wilson et al. (2016). In addition to this, an original extension of the prediction for a clipped Gaussian field to a clipped lognormal field is presented. The results of tests of this model with a real-space cube populated according to the halo occupation distribution model are also provided.

As the ever-advancing fabrication technologies in semiconductor industry enable the VLSI circuits with increasing integration and decreasing cost, the circuits suffer from much severer Signal Integrity (SI) faults, where SI is the capability of signals generating correct responses in their downstream circuits. SI faults are complex problems to tackle since SI may be damaged by numerous kinds of causes and SI faults may impact multiple aspects of circuits' performance. Such SI problems can seriously reduce product yield, result in function error or even permanently damage the chip. Therefore, effective testing methodologies are essential to alleviate SI problems by verifying the SI satisfaction of VLSI circuits efficiently. / Hereby the thesis has examined the SI problems systematically and proposed effective test methods corresponding to the specific feature of SI faults. Firstly, considering that SI on inter-core interconnects of SOCs is under severe danger, new test wrapper design has been proposed to achieve accurate SI test on interconnects. Secondly, test architecture has been optimized for cost reduction considering SI test and logic test simultaneously. Thirdly, the impact of power distribution network (PDN) defects on SI has been analyzed and efficient computation method has been proposed to identify those potentially harmful PDN defects. Effective test pattern manipulation method has also been proposed to improve test coverage of PDN defects. Fourthly, considering the increasing impact of process variation and aging effect on SI, an innovative online test architecture has been proposed, which can accurately measure the delay of critical paths when the circuit is working in function mode, where such valuable information is of great help for a variety of applications. / Zhang, Yubin. / Adviser: Qiang Xu. / Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 121-133). / 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.

by Man-chung Suen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves [123]-[126]). / Acknowledgement --- p.ii / Abstract --- p.iii / List of Tables --- p.vii / List of Figures --- p.xii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Approach to Find the Equivalent Models --- p.5 / Chapter 2.1 --- Scattering Parameters of the Microstrip Structure --- p.5 / Chapter 2.2 --- Optimization Process --- p.7 / Chapter 2.3 --- Summary --- p.8 / Chapter 3 --- Microstrip Discontinuities Being Modelled --- p.9 / Chapter 3.1 --- Right-Angled Bend --- p.9 / Chapter 3.2 --- T-Junction --- p.10 / Chapter 3.3 --- Tapered Line --- p.10 / Chapter 4 --- Deficiency of Lumped Equivalent Circuits --- p.13 / Chapter 4.1 --- Scattering Parameter of the T-Network --- p.13 / Chapter 4.2 --- Optimization Result for the T-Network --- p.14 / Chapter 4.3 --- Summary --- p.15 / Chapter 5 --- Proposed Wideband Equivalent Circuits --- p.17 / Chapter 5.1 --- Model of a Uniform Non-Homogeneous Microstrip Line --- p.17 / Chapter 5.2 --- Right-Angled Bend --- p.22 / Chapter 5.2.1 --- Circuit 1L --- p.24 / Chapter 5.2.2 --- Circuit 2L --- p.25 / Chapter 5.2.3 --- Circuit 3L --- p.26 / Chapter 5.2.4 --- Circuit 4L --- p.27 / Chapter 5.3 --- T-Junction --- p.28 / Chapter 5.3.1 --- Circuit IT --- p.28 / Chapter 5.3.2 --- Circuit 2T --- p.31 / Chapter 5.3.3 --- Circuit 3T --- p.31 / Chapter 5.3.4 --- Circuit 4T --- p.34 / Chapter 5.4 --- Tapered Line --- p.36 / Chapter 5.4.1 --- Circuit It -n =3 --- p.37 / Chapter 5.5 --- Summary --- p.38 / Chapter 6 --- Performance of the Equivalent Circuits --- p.39 / Chapter 6.1 --- Right-Angled Bend --- p.40 / Chapter 6.1.1 --- Without Conductor Loss --- p.40 / Chapter 6.1.2 --- With Conductor Loss --- p.48 / Chapter 6.2 --- T-Junction --- p.49 / Chapter 6.2.1 --- Without Conductor Loss --- p.53 / Chapter 6.2.2 --- With Conductor Loss --- p.63 / Chapter 6.3 --- Tapered Line --- p.69 / Chapter 6.3.1 --- Without Conductor Loss --- p.69 / Chapter 6.3.2 --- With Conductor Loss --- p.72 / Chapter 6.4 --- Summary --- p.73 / Chapter 7 --- Modelling Performance Using TEM Approximation --- p.77 / Chapter 7.1 --- Right-Angled Bend --- p.77 / Chapter 7.1.1 --- Without Conductor Loss --- p.78 / Chapter 7.1.2 --- With Conductor Loss --- p.87 / Chapter 7.2 --- T-Junction --- p.92 / Chapter 7.2.1 --- Without Conductor Loss --- p.92 / Chapter 7.2.2 --- With Conductor Loss --- p.104 / Chapter 7.3 --- Tapered Line --- p.115 / Chapter 7.3.1 --- Without Conductor Loss --- p.116 / Chapter 7.3.2 --- With Conductor Loss --- p.117 / Chapter 7.4 --- Summary --- p.117 / Chapter 8 --- Conclusion --- p.120 / Bibliography --- p.123

by Tsz Shing Cheung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1990. / Includes bibliographical references. / Chapter Section 1 --- Introduction --- p.2 / Chapter 1.1 --- The Affinity Clustering Phase --- p.2 / Chapter 1.2 --- The Alteration Phase --- p.3 / Chapter 1.3 --- Floorplan of Macrocell Array --- p.3 / Chapter 1.4 --- Chip Model --- p.4 / Chapter 1.4.1 --- Location Representation --- p.4 / Chapter 1.4.2 --- Interconnection Length Estimation --- p.6 / Chapter 1.5 --- Cost Function Evaluation --- p.6 / Chapter 1.5.1 --- Net-length Calculation --- p.6 / Chapter 1.5.2 --- Net-length Estimated by Half of the Perimeter of Bounding Box --- p.7 / Chapter 1.6 --- Thesis Layout --- p.8 / Chapter Section 2 --- Reviews of Partitioning and Placement Methods --- p.9 / Chapter 2.1 --- Partitioning Methods --- p.9 / Chapter 2.1.1 --- Direct Method --- p.10 / Chapter 2.1.2 --- Group Migration Method --- p.10 / Chapter 2.1.3 --- Metric Allocation Methods --- p.10 / Chapter 2.1.4 --- Simulated Annealing --- p.11 / Chapter 2.2 --- Placement Methods --- p.12 / Chapter 2.2.1 --- Min-cut Methods --- p.13 / Chapter 2.2.2 --- Affinity Clustering Methods --- p.13 / Chapter 2.2.3 --- Other Placement Methods --- p.16 / Chapter Section 3 --- Algorithm --- p.17 / Chapter 3.1 --- The Affinity Clustering Phase --- p.18 / Chapter 3.1.1 --- Construction of Connection Lists --- p.18 / Chapter 3.1.2 --- Primary Grouping --- p.21 / Chapter 3.1.3 --- Element Appendage to Existing Groups --- p.23 / Chapter 3.1.4 --- Loose Appendage of Ungrouped Elements --- p.25 / Chapter 3.1.5 --- Single Element Groups Formation --- p.26 / Chapter 3.2 --- The Alteration Phase --- p.27 / Chapter 3.2.1 --- Element Assignment to a Group --- p.29 / Chapter 3.2.2 --- Empty Space Searching --- p.30 / Chapter 3.2.3 --- Determination of Direction of Element Allocation --- p.31 / Chapter 3.2.3.1 --- Cross-cut Direction of Allocation --- p.32 / Chapter 3.2.3.2 --- Dynamic Determination of Path Based on Size Functions --- p.34 / Chapter 3.2.3.2.1 --- Segmentation of Cross-cut --- p.35 / Chapter 3.2.3.2.2 --- Partial Optimization of Segments --- p.36 / Chapter 3.2.3.2.3 --- Dynamic Linking of Segments --- p.38 / Chapter 3.2.4 --- Element Allocation --- p.39 / Chapter Section 4 --- Implementation --- p.41 / Chapter 4.1 --- The System Row --- p.41 / Chapter 4.1.1 --- The Affinity Clustering Phase --- p.43 / Chapter 4.1.2 --- The Alteration Phase --- p.44 / Chapter 4.2 --- Data Structures --- p.47 / Chapter 4.2.1 --- Insertion of Elements to a Linked List --- p.54 / Chapter 4.2.2 --- Dynamic Linking of Segments --- p.56 / Chapter 4.2.3 --- Advantages of the Dynamic Data Structure --- p.59 / Chapter 4.3 --- Data Manipulation and File Management --- p.60 / Chapter 4.3.1 --- The Connection Lists and the Group List --- p.60 / Chapter 4.3.2 --- Description on Programs and Data Files --- p.62 / Chapter 4.3.2.1 --- The Affinity Clustering Phase --- p.63 / Chapter 4.3.2.2 --- The Alteration Phase --- p.64 / Chapter Section 5 --- Results --- p.70 / Chapter 5.1 --- Results on Affinity Clustering Phase --- p.84 / Chapter 5.2 --- Details of Affinity Clustering Procedure on Ckt. 2 and Ckt. 5 --- p.92 / Chapter 5.3 --- Results on Alteration Phase --- p.97 / Chapter 5.4 --- Details of Alteration Procedure on Ckt. 2 and Ckt. 5 --- p.101 / Chapter Section 6 --- Discussion --- p.107 / Chapter 6.1 --- Computation Time of the Algorithm --- p.107 / Chapter 6.2 --- Alternative Methods on the Determination of Propagation Path --- p.110 / Chapter 6.2.1 --- Method 1 --- p.110 / Chapter 6.2.2 --- Method 2 --- p.111 / Chapter 6.2.3 --- Method 3 --- p.114 / Chapter 6.2.4 --- Comparison on Execution Time of the Four Methods --- p.117 / Chapter 6.3 --- Wiring Optimization --- p.118 / Chapter 6.3.1 --- Data Structure --- p.119 / Chapter 6.3.2 --- Overlapping and Separate Bounding Boxes --- p.120 / Chapter 6.4 --- Generalization of the Data Structure --- p.122 / Chapter 6.4.1 --- Cell Types --- p.123 / Chapter 6.4.2 --- Adhesive Attributes --- p.124 / Chapter 6.4.3 --- Blocks Representation --- p.124 / Chapter 6.4.4 --- Critical Path Adjustment --- p.125 / Chapter 6.4.5 --- Total Interconnection Length Estimation --- p.129 / Chapter 6.5 --- A New Placement Algorithm --- p.130 / Chapter 6.6 --- An Alternative Method on Element Allocation --- p.132 / Chapter Section 7 --- Conclusion --- p.136 / Chapter Section 8 --- References --- p.138 / Chapter Section 9 --- Appendix I --- p.142 / Chapter 9.1 --- Definition of the Problem --- p.142 / Chapter 9.2 --- The Simulated Annealing Algorithm --- p.142 / Chapter 9.3 --- Example Circuit --- p.143 / Chapter 9.4 --- Performance Indices and Energy Value --- p.144 / Chapter 9.4.1 --- Total Interconnection Length --- p.144 / Chapter 9.4.2 --- Delay on Critical Paths --- p.144 / Chapter 9.4.3 --- Skew in Input-to-Output Delays --- p.146 / Chapter 9.4.4 --- Energy Value --- p.146 / Chapter 9.5 --- The Simulation Program --- p.146 / Chapter 9.5.1 --- "The ""function"" Subroutines" --- p.147 / Chapter 9.5.1.1 --- alise --- p.147 / Chapter 9.5.1.2 --- max delay --- p.147 / Chapter 9.5.1.3 --- replace --- p.147 / Chapter 9.5.1.4 --- total length --- p.147 / Chapter 9.5.2 --- "The ""procedure"" Subroutines" --- p.148 / Chapter 9.5.2.1 --- init_weight --- p.148 / Chapter 9.5.2.2 --- inverse --- p.148 / Chapter 9.5.2.3 --- initial --- p.148 / Chapter 9.5.2.4 --- shuffle --- p.148 / Chapter 9.5.3 --- The Main Program --- p.148 / Chapter 9.6 --- Results and Discussion --- p.149 / Chapter 9.7 --- Summary --- p.156 / Chapter 9.8 --- References --- p.156 / Chapter Section 10 --- Appendix II --- p.157

by Chan Lap-kong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 77-80). / ABSTRACT / ACKNOWLEDGEMENTS / LIST OF FIGURES / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Problems in Testing VLSI Circuits --- p.3 / Chapter 1.2.1 --- Test-cost-per-gate --- p.3 / Chapter 1.2.2 --- Tester Complexity --- p.3 / Chapter 1.3 --- Tester Based on Terminals Characteristics -Automatic Testing Equipment(ATE) --- p.4 / Chapter 1.4 --- Tester Based on Terminal and Internal Characteristics --- p.6 / Chapter 1.4.1 --- Mechanical Probing Method --- p.6 / Chapter 1.4.2 --- E-beam Probing Method --- p.7 / Chapter 1.5 --- Movitation for this Research --- p.7 / Chapter 1.6 --- Outline of the Remaining Chapters --- p.9 / Chapter 2. --- E-BEAM TESTER --- p.10 / Chapter 2.1 --- State-of-art of E-Beam Tester --- p.10 / Chapter 2.2 --- An Electron-optical Column of a SEM --- p.12 / Chapter 2.3 --- Beam Rastering Methods --- p.13 / Chapter 2.4 --- Voltage Contrast Phenomenon --- p.14 / Chapter 2.5 --- Configuration of an E-Beam Test System --- p.18 / Chapter 2.6 --- Advantages of an E-beam Tester --- p.20 / Chapter 3. --- BASIC PRINCIPLES --- p.21 / Chapter 3.1 --- Single-Stuck-At Fault Model --- p.21 / Chapter 3.2 --- Observability and Controllability --- p.24 / Chapter 3.3 --- Netlist Format --- p.25 / Chapter 3.4 --- Level --- p.27 / Chapter 3.5 --- Reconvergent Fanout --- p.28 / Chapter 4. --- CONVENTIONAL TEST GENERATION --- p.29 / Chapter 4.1 --- Conventional Automatic Test Generation for ATEs --- p.29 / Chapter 4.3 --- Conventional E-Beam Test Generation --- p.31 / Chapter 5. --- TEST AND PROBE POINT GENERATION --- p.32 / Chapter 5.1 --- Wafer Stage E-beam Testing --- p.32 / Chapter 5.2 --- Critical Paths Generation --- p.33 / Chapter 5.3 --- Assumptions of the Test and Probe Point Generation Algorithm --- p.35 / Chapter 5.4 --- Rules of the Test and Probe Point Generation Algorithm --- p.36 / Chapter 5.5 --- Probe Points Selection and Reduction --- p.38 / Chapter 5.6 --- Test and Probe Point Generation Algorithm --- p.40 / Chapter 5.7 --- Propagation and Justification at Fanout Site --- p.42 / Chapter 6. --- EXAMPLES --- p.45 / Chapter 6.1 --- Example of Test and Probe Point Generation for Circuit sc2 --- p.45 / Chapter 6.2 --- Example of Test and Probe Point Generation for Circuit sfc4 --- p.53 / Chapter 7. --- CONCLUSIONS --- p.61 / Chapter 7.1 --- Summary of Results --- p.61 / Chapter 7.2 --- Further Research --- p.63 / APPENDIX / Appendix A: Algorithm to Find Reconvergent Fanouts / Appendix B: Results of Test Generation for Circuit sc1 / Appendix C: Results of Test Generation for Circuit sc3 / REFERENCES --- p.77