This thesis deals with the Open Mapping Theorem for analytic functions on domains in the complex plane: A non-constant analytic function on an open subset of the complex plane is an open map. As applications of this fundamental theorem we study Schwarz’s Lemma and its consequences concerning the groups of conformal automorphisms of the unit disk and of the upper halfplane. In the last part of the thesis we indicate the first steps in hyperbolic geometry. / Denna uppsats behandlar satsen om öppna avbildningar för analytiska funktioner på domäner i det komplexa talplanet: En icke-konstant analytisk funktion på en öppen delmängd av det komplexa talplanet är en öppen avbildning. Som tillämpningar på denna fundamentala sats studeras Schwarz’s lemma och dess konsekvenser för grupperna av konforma automorfismer på enhetsdisken och på det övre halvplanet. I uppsatsens sista del antyds de första stegen inom hyperbolisk geometri.

Distributed Discrete Event Simulation (DDES) has received much attention in recent years, owing to the fact that uniprocessor based serial simulations may require excessive amount of simulation time and computational resources. It is therefore natural to attempt to use multiple processors to exploit the inherent parallelism in discrete event simulations in order to speed up the simulation process. In this dissertation we study the performance of distributed simulation of queueing networks, by analysing queueing models of message flows in distributed discrete event simulators. Most of the prior work in distributed discrete event simulation can be catego­rized as either empirical studies or analytic (or formal) models. In the empirical studies, specific experiments are run on both conservative and optimistic simulators to see which strategy results in a faster simulation. There has also been increasing activity in analytic models either to better understand a single strategy or to compare two strategies. Little attention seems to have been paid to the behaviour of the interprocessor message queues in distributed discrete event simulators. To begin with, we study how to model distributed simulators of queueing networks. We view each logical process in a distributed simulation as comprising a message sequencer with associated message queues, followed by an event processor. A major contribution in this dissertation is the introduction of the maximum lookahead sequencing protocol. In maximum lookahead sequencing, the sequencer knows the time-stamp of the next message to arrive in the empty queue. Maximum lookahead is an unachievable algorithm, but is expected to yield the best throughput compared to any realisable sequencing technique. The analysis of maximum lookahead, therefore, should lead to fundamental limits on the performance of any sequencing algorithm We show that, for feed forward type simulators, with standard stochastic assump-tions for message arrival and time-stamp processes, the message queues are unstable for conservative sequencing, and for conservative sequencing with maximum lookahead and hence for optimistic resequencing, and for any resequencing algorithm that does not employ interprocessor "flow control". It follows that the resequencing problem is fundamentally unstable and some form of interprocessor flow control is necessary in order to make the message queues stable (without message loss). We obtain some generalizations of the insta­bility results to time-stamped message arrival processes with certain ergodicity properties. For feedforward type distributed simulators, we study the throughput of the event sequencer without any interprocessor flow control. We then incorporate flow control and study the throughput of the event sequencer. We analyse various flow control mechanisms. For example, we can bound the buffers of the message queues, or various logical processes can be prevented from getting too far apart in virtual time by means of a mechanism like Moving Time Windows or Bounded Lag. While such mechanisms will serve to stabilize buffers, our approach, of modelling and analysing the message flow processes in the simulator, points towards certain fundamental limits of efficiency of distributed simulation, imposed by the synchronization mechanism. Next we turn to the distributed simulation of more general queueing networks. We find an upper bound to the throughput of distributed simulators of open and closed queueing networks. The upper bound is derived by using flow balance relations in the queueing network and in the simulator, processing speed constraints, and synchronization constraints in the simulator. The upper bound is in terms of parameters of the queueing network, the simulator processor speeds, and the way the queueing network is partitioned or mapped over the simulator processors. We consider the problem of choosing a mapping that maximizes the upper bound. We then study good solutions o! this problem as possible heuristics for the problem of partitioning the queueing network over the simulator processors. We also derive a lower bound to the throughput of the distributed simulator for a simple queueing network with feedback. We then study various properties of the maximum lookahead algorithm. We show that the maximum lookahead algorithm does not deadlock. Further, since there are no syn­chronization overheads, maximum lookahead is a simple algorithm to study. We prove that maximum lookahead sequencing (though unrealisable) yields the best throughput compared to any realisable sequencing technique. These properties make maximum lookahead a very useful algorithm in the study of distributed simulators of queueing networks. To investigate the efficacy of the partitioning heuristic, we perform a study of queue­ing network simulators. Since it is important to study the benefits of distributed simula­tion, we characterise the speedup in distributed simulation, and find an upper bound to the speedup for a given mapping of the queues to the simulator processors. We simulate distributed simulation with maximum lookahead sequencing, with various mappings of the queues to the processors. We also present throughput results foT the same mappings but using a distributed simulation with the optimistic sequencing algorithm. We present a num­ber of sufficiently complex examples of queueing networks, and compare the throughputs obtained from simulations with the upper bounds obtained analytically. Finally, we study message flow processes in distributed simulators of open queueing networks with feedback. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the "external" arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain "natural" modelling construct for the arrival process is exactly correct, whereas an "obvious" model for the feedback process is wrong; we then show how to develop the correct model. Our analysis throws light on the stability of distributed simulators of queueing networks with feedback. We show how the stability of such simulators depends on the parameters of the queueing network.

The current research is aimed at investigating the explosion behaviour of hazardous materials in relation to particle size. The materials of study are titanium powders having size distributions in both the micron- and nano-size ranges with nominal size distributions: -100 mesh, -325 mesh, ?20 ?m, 150 nm, 60-80 nm, and 40-60 nm. The explosibility parameters investigated explosion severity and explosion likelihood for both size ranges of titanium. Tests include, maximum explosion pressure (Pmax), maximum rate of pressure rise ((dP/dt)max), minimum explosible concentration (MEC), minimum ignition energy (MIE), minimum ignition temperature (MIT) and dust inerting using nano-titanium dioxide. ASTM protocols were followed using standard dust explosibility test equipment (Siwek 20-L explosion chamber, MIKE 3 apparatus, and BAM oven). The explosion behaviour of the micron-size titanium has been characterized to provide a baseline study for the nano-size testing, however, nano-titanium dust explosion research presented major experimental challenges using the 20-L explosion chamber.

Soit p un polynôme d'une variable complexe z. On peut trouver plusieurs inégalités reliant le module maximum de p et une combinaison de ses coefficients. Dans ce mémoire, nous étudierons principalement les preuves connues de l'inégalité de Visser. Nous montrerons aussi quelques généralisations de cette inégalité. Finalement, nous obtiendrons quelques applications de l'inégalité de Visser à l'inégalité de Chebyshev. / Let p be a polynomial in the variable z. There exist several inequalities between the coefficents of p and its maximum modulus. In this work, we shall mainly study known proofs of the Visser inquality together with some extensions. We shall finally apply the inequality of Visser to obtain extensions of the Chebyshev inequality.

Arnold and Strauss (1991) 探討2x2列聯表中的3個方格 (cell) 有相同機率θ的問題，他們比較了參數θ的最大概似估計值與最大擬概似估計值，發現參數θ的最大概似估計值與最大擬概似估計值是不相同的。在本論文中，我們將2x2列聯表中的3個方格的參數值 (機率值)，從限制為相同θ，放寬為成某種比例，並證明了在一般情況下參數θ的最大概似估計值與最大擬概似估計值也不相同。我們也提出一些使參數θ的最大概似估計值及最大擬概似估計值相同的特殊條件，諸如三個方格內的觀察值跟機率值成比例或格子內的觀察值有某些特定值。本論文也透過電腦模擬的結果，發現最大概似估計式較最大擬概似估計式來得精確，而且當參數θ在參數空間之中點附近時，最大概似估計值與最大擬概似估計值的差異為最大。 / Arnold and Strauss (1991) study the cases that three of the four cells in the 2x2 contingency table have the same cell probability θ. In particular, Arnold and Strauss (1991) compare the maximum likelihood estimate (MLE) and maximum pseudolikelihood estimate (MPLE) of the parameter θ. They find that MLE and MPLE of the parameter are not the same. In this thesis, we relax the assumptions so that those three cell probabilities may not be the same and each is proportional to a parameter θ. We find that, in general, MLE’s of θ are still not the same as MPLE’s of θ. Some special cases that make MLE the same as MPLE are also given. We also find, through computer simulations, that MLE’s are accurate than MPLE’s and that the difference between MLE and MPLE is getting larger when the parameter θ is closer to the midpoint of its space.

The shape of the thermocline and the depth of the lysoline in the western tropical Pacific are both influenced by the overlying atmosphere, and both the shape of thermocline and the depth of the lysocline can be reconstructed from foraminifera-based paleo-proxies. Paleoclimate proxy evidence suggests a southward shift of the Intertropical Convergence Zone (ITCZ) during times of Northern Hemisphere cooling, including the Last Glacial Maximum (LGM), 19-23 ka before present. However, evidence for movement over the Pacific has mainly been limited to precipitation reconstructions near the continents, and the position of the Pacific marine ITCZ is less well constrained. In this study, I address this problem by taking advantage of the fact that the upper ocean density structure reflects the overlying wind field. I reconstruct changes in the upper ocean density structure during the LGM using oxygen isotope measurements on the planktonic foraminifera G. ruber and G. tumida in a transect of sediment cores from the Western Tropical Pacific. The data suggest a ridge in the thermocline just north of the present-day ITCZ persists for at least part of the LGM, and a structure in the Southern Hemisphere that differs from today. The reconstructed structure is consistent with that produced in a General Circulation Model with both a Northern and Southern Hemisphere ITCZ. I also attempt to reconstruct the upper ocean density structure for Marine Isotope Stages 5e and 6, the interglacial and glacial periods, respectively, previous to the LGM. The data show a Northern Hemisphere thermocline ridge for both of these periods. There is insufficient data to draw any conclusions about the Southern Hemisphere thermocline. Using the same set of sediment cores, I also attempt to reconstruct lysocline depth over the last 23,000 years using benthic foraminiferal carbon isotope ratios, planktonic foraminiferal masses, and sediment coarse fraction percentage. Paleoclimate proxy evidence and modeling studies suggest that the deglaciation following the LGM is associated with a deepening of the lysocline and an increase in sedimentary calcite preservation. Although my data lack the resolution to constrain the depth of the lysocline, they do show an increase in calcite preservation during the last deglaciation, consistent with lysocline deepening as carbon moves from the deep ocean to the atmosphere.

Dans cette thèse, nous nous intéressons à différentes notions de colorations sous contraintes. Nous nous intéressons plus spécialement à la coloration acyclique, à la coloration forte d'arêtes et à la coloration d'arêtes sommets adjacents distinguants.Dans le Chapitre 2, nous avons étudié la coloration acyclique. Tout d'abord nous avons cherché à borner le nombre chromatique acyclique pour la classe des graphes de degré maximum borné. Ensuite nous nous sommes attardés sur la coloration acyclique par listes. La notion de coloration acyclique par liste des graphes planaires a été introduite par Borodin, Fon-Der Flaass, Kostochka, Raspaud et Sopena. Ils ont conjecturé que tout graphe planaire est acycliquement 5-liste coloriable. De notre côté, nous avons proposé des conditions suffisantes de 3-liste coloration acyclique des graphes planaires. Dans le Chapitre 3, nous avons étudié la coloration forte d'arêtes des graphes subcubiques en majorant l'indice chromatique fort en fonction du degré moyen maximum. Nous nous sommes également intéressés à la coloration forte d'arêtes des graphes subcubiques sans cycles de longueurs données et nous avons également obtenu une majoration optimale de l'indice chromatique fort pour la famille des graphes planaires extérieurs. Nous avons aussi présenté différents résultats de complexité pour la classe des graphes planaires subcubiques. Enfin, au Chapitre 4, nous avons abordé la coloration d'arêtes sommets adjacents distinguants en déterminant les majorations de l'indice avd-chromatique en fonction du degré moyen maximum. Notre travail s'inscrit dans la continuité de celui effectué par Wang et Wang en 2010. Plus précisément, nous nous sommes focalisés sur la famille des graphes de degré maximum au moins 5.

Made available in DSpace on 2015-03-26T13:32:15Z (GMT). No. of bitstreams: 1 texto completo.pdf: 1213757 bytes, checksum: a4899ab14bd6c737501e8ef972e42d9e (MD5) Previous issue date: 2012-02-01 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In logistic mixed models with random effect on intercept allows capturing the effects of sources of variation from the particular characteristics of a group (heterogeneity), deflating the pure error and causing a fluctuation in the model intercept. This inclusion brings complexity in estimation methods and also changes the interpretation of the parameters that, originally given by the odds ratio, is then seen from the median odds ratio. The estimation parameters of a mixed model can be made by many different methods with varying performance, as the Laplace s approximation method, maximum likelihood (ML) and restricted maximum likelihood (REML). The objective of this work was to verify in logistic mixed models with random effects on intercept the consequences in interpretation of parameters, in quality of experiment and in classification of treatment via the median odds ratio, and verify the performance of the estimation methods above cited. The analyzes were performed under simulation and after in set of real data from seeds germination experiment of physic nut (Jatropha curcas L.). Considering the logistic mixed model with random effects on intercept, it was verified that the REML estimation method performed better and that the variance of the random effect affects the performance of any of these methods being evaluated inversely proportional. We suggest further studies to determine more properly the influence of the inflexion points and the effective median level in performance methods. In the experiment to evaluate the seeds germination of physic nut involving roll paper, on paper, on sand and between sand substrates, the inclusion of random effects in logistic model showed considerable heterogeneity in seeds germination in different units of the same substrate. The median odds ratio showed the superiority of the substrate between sand over on paper in seeds germination of physic nut, result similar to that obtained by the Tukey s test. / Em modelos de regressão logística a inclusão do efeito aleatório no intercepto permite capturar os efeitos de fontes de variação provenientes das características particulares de um grupo (heterogeneidade), desinflacionando o erro puro e provocando uma flutuação no intercepto do modelo. Esta inclusão traz complexidade nos métodos de estimação e também muda a interpretação dos parâmetros que, dada originalmente pela razão de chances, passa a ser vista sob o enfoque da razão de chances mediana. A estimação dos parâmetros de um modelo misto pode ser feita por muitos métodos diferentes com desempenho variado, como o método da aproximação de Laplace, da máxima verossimilhança (ML) e da máxima verossimilhança restrita (REML). Assim, o objetivo deste trabalho foi verificar em modelos de regressão logística com efeito aleatório no intercepto as consequências na interpretação dos parâmetros, na qualidade de um experimento e na classificação de tratamentos via razão de chances mediana, e verificar o desempenho dos métodos de estimação acima citados. As análises foram feitas sob simulação e posteriormente num conjunto de dados reais de um experimento com germinação de sementes de pinhão-manso (Jatropha curcas L.). Considerando o modelo de regressão logística com efeito aleatório no intercepto, verificou-se que o método de estimação REML apresentou melhor desempenho e que a variância do efeito aleatório afeta o desempenho de qualquer um dos métodos avaliados sendo estes inversamente proporcionais. Sugerem-se novos estudos para determinar com mais propriedade a influência dos pontos de estabilização e do nível mediano de efetividade na eficiência dos métodos. No experimento de avaliação de germinação de sementes de pinhão-manso envolvendo os substratos rolo de papel, sobre papel, sobre areia e entre areia, a inclusão do efeito aleatório no modelo logístico apontou considerável heterogeneidade na germinação de sementes em unidades diferentes de um mesmo substrato. A razão de chances mediana apontou a superioridade do substrato entre areia em relação a sobre papel na germinação de sementes de pinhão-manso, resultado semelhante ao obtido pelo teste de Tukey.

Supervised machine learning models require a labeled data set of high quality in order to perform well. Available text data often exists in abundance, but it is usually not labeled. Labeling text data is a time consuming process, especially in the case where multiple labels can be assigned to a single text document. The purpose of this thesis was to make the labeling process of clinical reports as effective and effortless as possible by evaluating different multi-label active learning strategies. The goal of the strategies was to reduce the number of labeled documents a model needs, and increase the quality of those documents. With the strategies, an accuracy of 89% was achieved with 2500 reports, compared to 85% with random sampling. In addition to this, 85% accuracy could be reached after labeling 975 reports, compared to 1700 reports with random sampling.

Fluorescence microscopy is an indispensable tool in the areas of cell biology, histology and material science as it enables non-invasive observation of specimen in their natural environment. The main advantage of fluorescence microscopy is that, it is non-invasive and capable of imaging with very high contrast and visibility. It is dynamic, sensitive and allows high selectivity. The specificity and sensitivity of antibody-conjugated probes and genetically-engineered fluorescent protein constructs allows the user to label multiple targets and the precise location of intracellular components. However, its spatial reso- lution is limited to one-quarter of the excitation wavelength (Abbe’s diffraction limit). The advent of new and sophisticated optics and availability of fluorophores has made fluorescence imaging a flourishing field. Several advanced techniques like TIRF, 4PI, STED, SIM, SPIM, PALM, fPALM, GSDIM and STORM, have enabled high resolution imaging by breaking the diffraction barrier and are a boon to medical and biological research. Invention of confocal and multi-photon microscopes have enabled observation of the specimen embedded at depth. All these advances in fluorescence microscopy have made it a much sought-after technique. The first chapter provides an overview of the fundamental concepts in fluorescence imag- ing. A brief history of emergence of the field is provided in this chapter along with the evolution of different super-resolution microscopes. An introduction to the concept of fluorophores, their broad classification and their characteristics is discussed in this chap- ter. A brief explanation of different fluorescence imaging techniques and some trending techniques are introduced. This chapter provides a thorough foundation for the research work presented in the thesis. Second chapter deals with different microscopy techniques that have changed the face of biophotonics and nanoscale imaging. The resolution of optical imaging systems are dictated by the inherent property of the system, known as impulse response or more popularly “point spread function”. A basic fluorescence imaging system is presented in this chapter and introduces the concept of point spread function and resolution. The introduction of confocal microscope and multi-photon microscope brought about improved optical sectioning. 4PI microscopy technique was invented to improve the axial resolution of the optical imaging system. Using this microscopy modality, an axial resolution of upto ≈ 100nm was made possible. The basic concepts of these techniques is provided in this chapter. The chapter concludes with a discussion on some of the optical engineering techniques that aid in improved lateral and axial resolution improvements and then we proceed to take on these engineering techniques in detail in the next chapter. Introduction of spatial masks at the back aperture of the objective lens results in gen- eration of a Bessel-like beam, which enhances our ability to see deeper inside a spec- imen with reduced aberrations and improved lateral resolution. Bessel beams have non-diffracting and self-reconstructing properties which reduces the scattering while ob- serving cells embedded deep in a thick tissue. By coupling this with the 4PI super- resolution microscopy technique, multiple excitation spots can be generated along the optical axis of the two opposing high-NA objective lenses. This technique is known as multiple excitation spot optical (MESO) microscopy technique. It provides a lateral resolution improvement upto 150nm. A detailed description of the technique and a thorough analysis of the polarization properties is discussed in chapter 3. Chapters 4 and 5 bring the focus of the thesis to the main topic of research - multi- dimensional image reconstruction for fluorescence microscopy by employing the statis- tical techniques. We begin with an introduction to filtering techniques in Chapter 4 and concentrate on an edge-preserving denoising filter: Bilateral Filter for fluorescence microscopy images. Bilateral filter is a non-linear combination of two Gaussian filters, one based on proximity of two pixels and the other based on the intensity similarity of the two. These two sub-filters result in the edge-preserving capability of the filter. This technique is very popular in the field of image processing and we demonstrate the application of the technique for fluorescence microscopy images. The chapter presents a through description of the technique along with comparisons with Poisson noise mod- eling. Chapters 4 and 5 provide a detailed introduction to statistical iterative recon- struction algorithms like expectation maximization-maximum likelihood (EM-ML) and maximum a-posteriori (MAP) techniques. The main objective of an image reconstruc- tion algorithm is to recover an object from its noisy degraded images. Deconvolution methods are generally used to denoise and recover the true object. The choice of an appropriate prior function is the crux of the MAP algorithm. The remaining of chapter 5 provides an introduction to different potential functions. We show some results of the MAP algorithm in comparison with that of ML algorithm. In chapter 6, we continue the discussion on MAP reconstruction where two new potential functions are introduced and demonstrated. The first one is based on the application of Taylor series expansion on the image. The image field is considered to be analytic and hence Taylor series produces an accurate estimation of the field being reconstructed. The second half of the chapter introduces an interpolation function to approximate the value of a pixel in its neighborhood. Cubic B-splines are widely used as a basis function during interpolation and they are popular technique in computer vision and medical imaging techniques. These novel algorithms are tested on di_erent microscopy data like, confocal and 4PI. The results are shown at the _nal part of the chapter. Tagging cell organelles with uorescent probes enable their visualization and analysis non-invasively. In recent times, it is common to tag more than one organelle of interest and simultaneously observe their structures and functions. Multicolor uorescence imaging has become a key technique to study speci_c processes like pH sensing and cell metabolism with a nanoscale precision. However, this process is hindered by various problems like optical artifacts, noise, autouorescence, photobleaching and leakage of uorescence from one channel to the other. Chapter 7 deals with an image reconstruction technique to obtain noise-free and distortion-less data from multiple channels when imaging a multicolor sample. This technique is easily adaptable with the existing imaging systems and has potential application in biological imaging and biophysics where multiple probes are used to tag the features of interest. The fact that the lateral resolution of an optical system is better than the axial resolution is well known. Conventional microscopes focus on cells that are very close to the cover-slip or a few microns into the specimen. However, for cells that are embedded deep in a thick sample (ex: tissues), it is di_cult to visualize them using a conventional microscope. A number of factors like, scattering, optical aberrations, mismatch of refractive index between the objective lens and the mounting medium and noise, cause distortion of the images of samples at large depths. The system PSF gets distorted due to di_raction and its shape changes rapidly at large depths. The aim of chapter 8 is to introduce a technique to reduce distortion of images acquired at depth by employing image reconstruction techniques. The key to this methodology is the modeling of PSF at large depths. Maximum likelihood technique is then employed to reduce the streaking e_ects of the PSF and removes noise from raw images. This technique enables the visualization of cells embedded at a depth of 150_m. Several biological processes within the cell occur at a rate faster than the rate of acquisition and hence vital information is missed during imaging. The recorded images of these dynamic events are corrupted by motion blur, noise and other optical aberrations. Chapter 9 deals with two techniques that address temporal resolution improvement of the uorescence imaging system. The _rst technique focuses on accelerating the data acquisition process. This includes employing the concept of time-multiplexing to acquire sequential images from a dynamic sample using two cameras and generating multiple sheets of light using a di_raction grating, resulting in multi-plane illumination. The second technique involves the use of parallel processing units to enable real-time image reconstruction of the acquired data. A multi-node GPU and CUDA architecture effciently reduce the computation time of the reconstruction algorithms. Faster implementation of iterative image reconstruction techniques can aid in low-light imaging and dynamic monitoring of rapidly moving samples in real time. Employing rapid acquisition and rapid image reconstruction aids in real-time visualization of cells and have immense potential in the _eld of microbiology and bio-mechanics. Finally, we conclude the thesis with a brief section on the contribution of the thesis and the future scope the work presented. Thank you for using www.freepdfconvert.com service! Only two pages are converted. Please Sign Up to convert all pages. https://www.freepdfconvert.com/membership