Non-parametric Reconstruction of Cluster Mass Distribution from Strong Lensing: Modelling Abell 370

We describe a new non-parametric technique for reconstructing the mass distribution in galaxy clusters with strong lensing, i.e., from multiple images of background galaxies. The observed positions and redshifts of the images are considered as rigid constraints and through the lens (ray-trace) equation they provide us with linear constraint equations. These constraints confine the mass distribution to some allowed region, which is then found by linear programming. Within this allowed region we study in detail the mass distribution with minimum mass-to-light variation; also some others, such as the smoothest mass distribution. The method is applied to the extensively studied cluster Abell 370, which hosts a giant luminous arc and several other multiply imaged background galaxies. Our mass maps are constrained by the observed positions and redshifts (spectroscopic or model-inferred by previous authors) of the giant arc and multiple image systems. The reconstructed maps obtained for \a370 reveal a detailed mass distribution, with substructure quite different from the light distribution. The method predicts the bimodal nature of the cluster and that the projected mass distribution is indeed elongated along the axis defined by the two dominant cD galaxies. But the peaks in the mass distribution appear to be offset from the centres of the cDs. We also present an estimate for the total mass of the central region of the cluster. This is in good agreement with previous mass determinations. The total mass of the central region is M=(2.0-2.7) 10^14 Msun/h50, depending on the solution chosen.Comment: 14 pages(19 postscript figures), minor corrections, MNRAS in pres

Reconstructing Generalized Staircase Polygons with Uniform Step Length

Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of uniform step length polygons can be reconstructed efficiently by finding and removing rectangles formed between consecutive convex boundary vertices called tabs. In particular, we give an $O(n^2m)$-time reconstruction algorithm for orthogonally convex polygons, where $n$ and $m$ are the number of vertices and edges in the visibility graph, respectively. We further show that reconstructing a monotone chain of staircases (a histogram) is fixed-parameter tractable, when parameterized on the number of tabs, and polynomially solvable in time $O(n^2m)$ under reasonable alignment restrictions.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Precise 3D track reconstruction algorithm for the ICARUS T600 liquid argon time projection chamber detector

Liquid Argon Time Projection Chamber (LAr TPC) detectors offer charged particle imaging capability with remarkable spatial resolution. Precise event reconstruction procedures are critical in order to fully exploit the potential of this technology. In this paper we present a new, general approach of three-dimensional reconstruction for the LAr TPC with a practical application to track reconstruction. The efficiency of the method is evaluated on a sample of simulated tracks. We present also the application of the method to the analysis of real data tracks collected during the ICARUS T600 detector operation with the CNGS neutrino beam.Comment: Submitted to Advances in High Energy Physic

Canonical Phase Diagrams of the 1-D Falicov-Kimball Model at T=0

The Falicov-Kimball model of spinless quantum electrons hopping on a 1-dimensional lattice and of immobile classical ions occupying some lattice sites, with only intrasite coupling between those particles, have been studied at zero temperature by means of well-controlled numerical procedures. For selected values of the unique coupling parameter $U$ the restricted phase diagrams (based on all the periodic configurations of localized particles (ions) with period not greater than 16 lattice constants, typically) have been constructed in the grand-canonical ensemble. Then these diagrams have been translated into the canonical ensemble. Compared to the diagrams obtained in other studies our ones contain more details, in particular they give better insight into the way the mixtures of periodic phases are formed. Our study has revealed several families of new characteristic phases like the generalized most homogeneous and the generalized crenel phases, a first example of a structural phase transition and a tendency to build up an additional symmetry -- the hole-particle symmetry with respect to the ions (electrons) only, as $U$ decreases.Comment: 24 pages, 8 figures (not included

Annotating Synapses in Large EM Datasets

Reconstructing neuronal circuits at the level of synapses is a central problem in neuroscience and becoming a focus of the emerging field of connectomics. To date, electron microscopy (EM) is the most proven technique for identifying and quantifying synaptic connections. As advances in EM make acquiring larger datasets possible, subsequent manual synapse identification ({\em i.e.}, proofreading) for deciphering a connectome becomes a major time bottleneck. Here we introduce a large-scale, high-throughput, and semi-automated methodology to efficiently identify synapses. We successfully applied our methodology to the Drosophila medulla optic lobe, annotating many more synapses than previous connectome efforts. Our approaches are extensible and will make the often complicated process of synapse identification accessible to a wider-community of potential proofreaders

SLIC Based Digital Image Enlargement

Low resolution image enhancement is a classical computer vision problem. Selecting the best method to reconstruct an image to a higher resolution with the limited data available in the low-resolution image is quite a challenge. A major drawback from the existing enlargement techniques is the introduction of color bleeding while interpolating pixels over the edges that separate distinct colors in an image. The color bleeding causes to accentuate the edges with new colors as a result of blending multiple colors over adjacent regions. This paper proposes a novel approach to mitigate the color bleeding by segmenting the homogeneous color regions of the image using Simple Linear Iterative Clustering (SLIC) and applying a higher order interpolation technique separately on the isolated segments. The interpolation at the boundaries of each of the isolated segments is handled by using a morphological operation. The approach is evaluated by comparing against several frequently used image enlargement methods such as bilinear and bicubic interpolation by means of Peak Signal-to-Noise-Ratio (PSNR) value. The results obtained exhibit that the proposed method outperforms the baseline methods by means of PSNR and also mitigates the color bleeding at the edges which improves the overall appearance.Comment: 6 page

Reconstructing the Local Twist of Coronal Magnetic Fields and the Three-Dimensional Shape of the Field Lines from Coronal Loops in EUV and X-Ray Images

Non-linear force-free fields are the most general case of force-free fields, but the hardest to model as well. There are numerous methods of computing such fields by extrapolating vector magnetograms from the photosphere, but very few attempts have so far made quantitative use of coronal morphology. We present a method to make such quantitative use of X-Ray and EUV images of coronal loops. Each individual loop is fit to a field line of a linear force-free field, allowing the estimation of the field line's twist, three-dimensional geometry and the field strength along it. We assess the validity of such a reconstruction since the actual corona is probably not a linear force-free field and that the superposition of linear force-free fields is generally not itself a force-free field. To do so, we perform a series of tests on non-linear force-free fields, described in Low & Lou (1990). For model loops we project field lines onto the photosphere. We compare several results of the method with the original field, in particular the three-dimensional loop shapes, local twist (coronal alpha), distribution of twist in the model photosphere and strength of the magnetic field. We find that, (i) for these trial fields, the method reconstructs twist with mean absolute deviation of at most 15% of the range of photospheric twist, (ii) that heights of the loops are reconstructed with mean absolute deviation of at most 5% of the range of trial heights and (iii) that the magnitude of non-potential contribution to photospheric field is reconstructed with mean absolute deviation of at most 10% of the maximal value.Comment: submitted to Ap

Prioritized Data Compression using Wavelets

The volume of data and the velocity with which it is being generated by com- putational experiments on high performance computing (HPC) systems is quickly outpacing our ability to effectively store this information in its full fidelity. There- fore, it is critically important to identify and study compression methodologies that retain as much information as possible, particularly in the most salient regions of the simulation space. In this paper, we cast this in terms of a general decision-theoretic problem and discuss a wavelet-based compression strategy for its solution. We pro- vide a heuristic argument as justification and illustrate our methodology on several examples. Finally, we will discuss how our proposed methodology may be utilized in an HPC environment on large-scale computational experiments