Simulations of slow positron production using a low energy electron accelerator

Monte Carlo simulations of slow positron production via energetic electron interaction with a solid target have been performed. The aim of the simulations was to determine the expected slow positron beam intensity from a low energy, high current electron accelerator. By simulating (a) the fast positron production from a tantalum electron-positron converter and (b) the positron depth deposition profile in a tungsten moderator, the slow positron production probability per incident electron was estimated. Normalizing the calculated result to the measured slow positron yield at the present AIST LINAC the expected slow positron yield as a function of energy was determined. For an electron beam energy of 5 MeV (10 MeV) and current 240 $\mu$A (30 $\mu$A) production of a slow positron beam of intensity 5 $\times$ 10$^{6}$ s$^{-1}$ is predicted. The simulation also calculates the average energy deposited in the converter per electron, allowing an estimate of the beam heating at a given electron energy and current. For low energy, high-current operation the maximum obtainable positron beam intensity will be limited by this beam heating.Comment: 11 pages, 15 figures, submitted to Review of Scientific Instrument

Ear-clipping Based Algorithms of Generating High-quality Polygon Triangulation

A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer sliver triangles. To reduce sliver triangles in further, a bound of angle is set to determine whether a newly formed triangle has sharp angles, and edge swapping is accepted when the triangle is sharp. To apply the two algorithms on polygons with holes, "Bridge" edges are created to transform a polygon with holes to a degenerate polygon which can be triangulated by the two algorithms. Applications show that the basic algorithm can avoid creating sliver triangles and obtain better triangulations than the traditional ear clipping algorithm, and the improved algorithm can in further reduce sliver triangles effectively. Both of the algorithms run in O(n2) time and O(n) space.Comment: Proceedings of the 2012 International Conference on Information Technology and Software Engineering Lecture Notes in Electrical Engineering Volume 212, 2013, pp 979-98

Does bariatric surgery improve adipose tissue function?

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/134250/1/obr12429_am.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/134250/2/obr12429.pd

Relative importance of βcyto- and γcyto-actin in primary mouse embryonic fibroblasts

The highly homologous β (βcyto) and γ (γcyto) cytoplasmic actins are hypothesized to carry out both redundant and unique essential functions, but studies using targeted gene knockout and siRNA-mediated transcript knockdown to examine βcyto- and γcyto-isoform--specific functions in various cell types have yielded conflicting data. Here we quantitatively characterized actin transcript and protein levels, as well as cellular phenotypes, in both gene- and transcript-targeted primary mouse embryonic fibroblasts. We found that the smooth muscle αsm-actin isoform was the dominantly expressed actin isoform in WT primary fibroblasts and was also the most dramatically up-regulated in primary βcyto- or β/γcyto-actin double-knockout fibroblasts. Gene targeting of βcyto-actin, but not γcyto-actin, led to greatly decreased cell proliferation, decreased levels of cellular ATP, and increased serum response factor signaling in primary fibroblasts, whereas immortalization induced by SV40 large T antigen supported fibroblast proliferation in the absence of βcyto-actin. Consistent with in vivo gene-targeting studies in mice, both gene- and transcript-targeting approaches demonstrate that the loss of βcyto-actin protein is more disruptive to primary fibroblast function than is the loss of γcyto-actin

Engineering Art Galleries

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this survey, we describe this work, show the chronology of developments, and compare current algorithms, including two unpublished versions, in an exhaustive experiment. Furthermore, we show what core algorithmic ingredients have led to recent successes

Effects of salt water on the ballistic protective performance of bullet-resistant body armour

Bullet-resistant body armour is used by law enforcement agencies and military personnel worldwide, often in inclement weather. Some fibre types used in body armour perform poorly when wet, resulting in a reduced level of protection; this is why most body armour protective elements are water-repellent treated and/or protected by a water-resistant cover. Some of the users operate in the maritime environment. The effect of salt water on body armour performance has not been previously reported. In this work the effect of soaking body armour in salt water and exposing body armour for up to 10 soaking and drying cycles in salt water was investigated. The effectiveness of the water-resistant cover was investigated by considering three cover conditions: (i) intact, (ii) cut and (iii) removed. Wet armour was heavier and provided significantly less protection from 9 mm Luger FMJ ammunition when compared to not-exposed armour irrespective of cover condition. A degradation in performance of armours exposed to soaking and drying cycles was noted, but this was similar across all regimes considered (one, three, five and ten cycles) and not as great as for wet armours

Wavelet Based Fractal Analysis of Airborne Pollen

The most abundant biological particles in the atmosphere are pollen grains and spores. Self protection of pollen allergy is possible through the information of future pollen contents in the air. In spite of the importance of airborne pol len concentration forecasting, it has not been possible to predict the pollen concentrations with great accuracy, and about 25% of the daily pollen forecasts have resulted in failures. Previous analysis of the dynamic characteristics of atmospheric pollen time series indicate that the system can be described by a low dimensional chaotic map. We apply the wavelet transform to study the multifractal characteristics of an a irborne pollen time series. We find the persistence behaviour associated to low pollen concentration values and to the most rare events of highest pollen co ncentration values. The information and the correlation dimensions correspond to a chaotic system showing loss of information with time evolution.Comment: 11 pages, 7 figure

Rates of convergence for empirical spectral measures: a soft approach

Understanding the limiting behavior of eigenvalues of random matrices is the central problem of random matrix theory. Classical limit results are known for many models, and there has been significant recent progress in obtaining more quantitative, non-asymptotic results. In this paper, we describe a systematic approach to bounding rates of convergence and proving tail inequalities for the empirical spectral measures of a wide variety of random matrix ensembles. We illustrate the approach by proving asymptotically almost sure rates of convergence of the empirical spectral measure in the following ensembles: Wigner matrices, Wishart matrices, Haar-distributed matrices from the compact classical groups, powers of Haar matrices, randomized sums and random compressions of Hermitian matrices, a random matrix model for the Hamiltonians of quantum spin glasses, and finally the complex Ginibre ensemble. Many of the results appeared previously and are being collected and described here as illustrations of the general method; however, some details (particularly in the Wigner and Wishart cases) are new. Our approach makes use of techniques from probability in Banach spaces, in particular concentration of measure and bounds for suprema of stochastic processes, in combination with more classical tools from matrix analysis, approximation theory, and Fourier analysis. It is highly flexible, as evidenced by the broad list of examples. It is moreover based largely on "soft" methods, and involves little hard analysis

Optimal Consensus set for nD Fixed Width Annulus Fitting

International audienceThis paper presents a method for fitting a nD fixed width spherical shell to a given set of nD points in an image in the presence of noise by maximizing the number of inliers, namely the consensus set. We present an algorithm, that provides the optimal solution(s) within a time complexity O(N n+1 log N) for dimension n, N being the number of points. Our algorithm guarantees optimal solution(s) and has lower complexity than previous known methods