Final accepted manuscripts of parts 4 and 5 from Roadmap on Structured Light, authored by Masud Mansuripur, College of Optical Sciences, The University of Arizona.

published_or_final_version / Computer Science / Master / Master of Philosophy

No description available.

No description available.

Ahlberg Cameras is a company that manufactures advanced camera systems and inspection equipment for the nuclear industry. Every nuclear plant shuts down their reactors approximately every 18 months to perform visual inspections of the vessels to find cracks and other damage. The company has received a request from Electric Power Research Institute (EPRI) to develop a distance meter that will operate in the reactor vessel, placed in an inspection camera. The device should measure the distance between the camera and an object, and the angle between them. The measurement is performed in air and underwater and the device has therefore a requirement to be waterproof and radiation tolerant.   This thesis work has studied different possible technologies and technically excluded the ones that are not suitable for the intended application. A large part of the study has been about whether sound or light is a good enough source to use in the different technologies. The study has excluded to use sound mainly because the reflection back to the receiver at large angles becomes too weak. The choice of technology stands between structured light and a self-designed trigonometry technology, both using lasers. Tests have been made to determine if laser light underwater can be observed by the camera and the results indicates that lasers work well enough for this kind of application. Further in-depth studies into the sources of errors and measurement accuracy are needed for determining which of the two technologies is the most suitable.

Thesis (M.M. (Finance & Investment))--University of the Witwatersrand, Faculty of Commerce, Law and Management, Graduate School of Business Administration, 2013. / Corporations often find it difficult to raise capital in illiquid markets such as most African markets and if they do they pay a premium which is not only costly to them but also propagates illiquidity in these markets. Convertible bonds provide a cheaper source of nancing for issuers with the optionality of maintaining targeted capital structures. However, these instruments are not popular in these markets as they are less understood compared to their conventional counterparts and if used are often mispriced. The main objective of this research is to provide a valua- tion framework for structured bonds, speci cally convertible bonds where market imperfections such as illiquidity are prevalent. This will entail customising the standard valuation framework so that these market imperfections are incorporated in the model. The valuation framework of the convertible bond is then applied to an illiquid market where several deviations from the perfect-market benchmarks exist and then observe what e ect these deviations have by comparing the theo- retical value to that of a convertible bond assuming the market is liquid.

The aim of the work described in this thesis is to improve the understanding, implementation, and overall capabilities of structured illumination microscopy (SIM). SIM is a superresolution technique that excels in gentle live-cell volumetric imaging tasks. Many modalities of SIM were developed over the last decade that tailored SIM into the versatile and powerful technique that it is today. Nevertheless, the field of SIM continues to evolve and there is plenty of room for novel concepts. Specifically, in this thesis, a generalised framework for a theoretical description of SIM variants is introduced, the constraints of optical components for a flexible SIM system are discussed and the set-up is realised, the important aspect of deconvolution in SIM is highlighted and further developed, and finally novel SIM modalities introduced that improve its time-resolution, gentleness, and volumetric imaging capabilities. Based on the generalised theory, the computational steps for the extraction of superresolution information from SIM raw data are outlined and the essential concept of spatial frequency un-mixing explained for standard SIM as well as for multifocal SIM. Multifocal SIM hereby acts as a parallelised confocal as well as widefield technique and thus serves as link between the two modalities. Using this novel scheme deconvolution methods for SIM are then further developed to allow a holistic reconstruction procedure. Deconvolution is of great important in the SIM reconstruction process, and hence rigorous derivations of advanced deconvolution methods are provided and further developed to enable generalised ‘multi-image’ Richardson-Lucy deconvolution in SIM, called joint Richardson-Lucy deconvolution (jRL). This approach is demonstrated to robustly produce optically sectioned multifocal SIM images and, through the incorporation of a 3D imaging model, also volumetric standard SIM images within the jRL framework. For standard SIM this approach enabled acquisition speed doubling, because the recovery of superresolved images from a reduced number of raw frames through constrained jRL was made possible. The method is validated in silico and in vitro. For the study of yet faster moving samples deconvolution microscopy is found to be the method of choice. To enable optical sectioning, a key feature of SIM, in deconvolution microscopy, a new modality of optical sectioning microscopy is introduced that can be implemented as a single-shot technique. Via polarised excitation and detection in orthogonal directions in conjunction with structured illumination the theoretical framework is rigorously derived and validated.

Cryptographic protocols are in general difficult to analyze, and complicated attacks exposing security flaws have remained hidden years after a protocol is developed. Recently developed tools such as strand spaces and inductive logical proofs provide mechanical procedures for analyzing protocols. The key to these methods is that a generous upper bound on the activity of a malicious penetrator is often much easier to work with than a tighter bound. However, these formalizations make strong assumptions about the algebraic structure of the cryptosystem that are never met in a real application. In this work, we show that an extended form of the strand space machinery can be used to analyze protocols which contain nontrivial algebraic structure, specifically that which arises from the XOR operation. This work also serves as one of the first steps in reconciling computational and formal methods of analyzing cryptographic security.

This field study investigates the dissemination of an innovation through a descriptive analysis of the Structured Experiences for Use in the Classroom Project. Part I serves as an introduction to the field study and provides information about the role of the author in the Project, data collection methods and terminology used in the study. Part II provides a description of the operation of the Project and an analysis of the network of users of the innovation as well as some case studies of the users. Part III considers the operation of the Structured Experiences for Use in the Classroom Project in the light of the theory of the dissemination of innovations. This part also includes some conclusions about the theory and practice of the dissemination of innovations and raises implications for future practice and policy making. The Project team on the Structured Experiences for Use in the Classroom Project established a network of users of the innovation in order to further disseminate structured experiences and receive feedback on their use. The difficulties and the advantages of this approach are documented in the case studies in Part II. The conclusions from this field study raise questions and seek to indicate some directions in the areas of; the funding of projects, the styles of dissemination, the use of networks and the adoption of innovations.

With the advent of multicore processors and an increased emphasis on parallel computing, parallel programming has become a fundamental requirement for achieving available performance. Parallel programming is inherently hard because, to reason about the correctness of a parallel program, programmers have to consider large numbers of interleavings of statements in different threads in the program. Though structured parallelism imposes some restrictions on the programmer, it is an attractive approach because it provides useful guarantees such as deadlock-freedom. However, data races remain a challenging source of bugs in parallel programs. Data races may occur only in few of the possible schedules of a parallel program, thereby making them extremely hard to detect, reproduce, and correct. In the past, dynamic data race detection algorithms have suffered from at least one of the following limitations: some algorithms have a worst-case linear space and time overhead, some algorithms are dependent on a specific scheduling technique, some algorithms generate false positives and false negatives, some have no empirical evaluation as yet, and some require sequential execution of the parallel program. In this thesis, we introduce dynamic data race detection algorithms for structured parallel programs that overcome past limitations. We present a race detection algorithm called ESP-bags that requires the input program to be executed sequentially and another algorithm called SPD3 that can execute the program in parallel. While the ESP-bags algorithm addresses all the above mentioned limitations except sequential execution, the SPD3 algorithm addresses the issue of sequential execution by scaling well across highly parallel shared memory multiprocessors. Our algorithms incur constant space overhead per memory location and time overhead that is independent of the number of processors on which the programs execute. Our race detection algorithms support a rich set of parallel constructs (including async, finish, isolated, and future) that are found in languages such as HJ, X10, and Cilk. Our algorithms for async, finish, and future are precise and sound for a given input. In the presence of isolated, our algorithms are precise but not sound. Our experiments show that our algorithms (for async, finish, and isolated) perform well in practice, incurring an average slowdown of under 3x over the original execution time on a suite of 15 benchmarks. SPD3 is the first practical dynamic race detection algorithm for async-finish parallel programs that can execute the input program in parallel and use constant space per memory location. This takes us closer to our goal of building dynamic data race detectors that can be "always-on" when developing parallel applications.