Augmenting graphs to minimize the diameter

We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm for the problem.Comment: 15 pages, 3 figure

Image Reconstruction with a LaBr3-based Rotational Modulator

A rotational modulator (RM) gamma-ray imager is capable of obtaining significantly better angular resolution than the fundamental geometric resolution defined by the ratio of detector diameter to mask-detector separation. An RM imager consisting of a single grid of absorbing slats rotating ahead of an array of a small number of position-insensitive detectors has the advantage of fewer detector elements (i.e., detector plane pixels) than required by a coded aperture imaging system with comparable angular resolution. The RM therefore offers the possibility of a major reduction in instrument complexity, cost, and power. A novel image reconstruction technique makes it possible to deconvolve the raw images, remove sidelobes, reduce the effects of noise, and provide resolving power a factor of 6 - 8 times better than the geometric resolution. A 19-channel prototype RM developed in our laboratory at Louisiana State University features 13.8 deg full-angle field of view, 1.9 deg geometric angular resolution, and the capability of resolving sources to within 35' separation. We describe the technique, demonstrate the measured performance of the prototype instrument, and describe the prospects for applying the technique to either a high-sensitivity standoff gamma-ray imaging detector or a satellite- or balloon-borne gamma-ray astronomy telescope.Comment: submitted to Nuclear Instrument & Methods, special edition: SORMA 2010 on June 16, 201

Identification of Critical Molecular Determinants of West Nile Virus PrM Protein: A Potential Site for Antiviral Targeting

Digitalitzat per Artypla

Negative-coupling resonances in pump-coupled lasers

We consider coupled lasers, where the intensity deviations from the steady state, modulate the pump of the other lasers. Most of our results are for two lasers where the coupling constants are of opposite sign. This leads to a Hopf bifurcation to periodic output for weak coupling. As the magnitude of the coupling constants is increased (negatively) we observe novel amplitude effects such as a weak coupling resonance peak and, strong coupling subharmonic resonances and chaos. In the weak coupling regime the output is predicted by a set of slow evolution amplitude equations. Pulsating solutions in the strong coupling limit are described by discrete map derived from the original model.Comment: 29 pages with 8 figures Physica D, in pres

Mechanical Properties of Bulk Metallic Glasses and Composites

We have studied the mechanical properties of monolithic bulk metallic glasses and composite in the La based alloys. La₈₆₋yAl₁₄(Cu, Ni)y (y=24 to 32) alloy systems was used to cast the in-situ structure and subsequently tested under compression. We found that the ductility of the monolithic is actually poorer than that of the fully crystalline composite.Singapore-MIT Alliance (SMA

Adhesion mechanics of graphene membranes

The interaction of graphene with neighboring materials and structures plays an important role in its behavior, both scientifically and technologically. The interactions are complicated due to the interplay between surface forces and possibly nonlinear elastic behavior. Here we review recent experimental and theoretical advances in the understanding of graphene adhesion. We organize our discussion into experimental and theoretical efforts directed toward: graphene conformation to a substrate, determination of adhesion energy, and applications where graphene adhesion plays an important role. We conclude with a brief prospectus outlining open issues.Comment: Review article to appear in special issue on graphene in Solid State Communication

The asymptotic iteration method for the angular spheroidal eigenvalues with arbitrary complex size parameter c

The asymptotic iteration method is applied, to calculate the angular spheroidal eigenvalues $\lambda^{m}_{\ell}(c)$ with arbitrary complex size parameter $c$. It is shown that, the obtained numerical results of $\lambda^{m}_{\ell}(c)$ are all in excellent agreement with the available published data over the full range of parameter values $\ell$, $m$, and $c$. Some representative values of $\lambda^{m}_{\ell}(c)$ for large real $c$ are also given.Comment: 15 pages, 1 figur

The magnetic field topology associated to two M flares

On 27 October, 2003, two GOES M-class flares occurred in the lapse of three hours in active region NOAA 10486. The two flares were confined and their associated brightenings appeared at the same location, displaying a very similar shape both at the chromospheric and coronal levels. We focus on the analysis of magnetic field (SOHO/MDI), chromospheric (HASTA, Kanzelhoehe Solar Observatory, TRACE) and coronal (TRACE) observations. By combining our data analysis with a model of the coronal magnetic field, we compute the magnetic field topology associated to the two M flares. We find that both events can be explained in terms of a localized magnetic reconnection process occurring at a coronal magnetic null point. This null point is also present at the same location one day later, on 28 October, 2003. Magnetic energy release at this null point was proposed as the origin of a localized event that occurred independently with a large X17 flare on 28 October, 2003, at 11:01 UT. The three events, those on 27 October and the one on 28 October, are homologous. Our results show that coronal null points can be stable topological structures where energy release via magnetic reconnection can happen, as proposed by classical magnetic reconnection models.Comment: 14 pages, 7 figure

A simpler and more efficient algorithm for the next-to-shortest path problem

Given an undirected graph $G=(V,E)$ with positive edge lengths and two vertices $s$ and $t$, the next-to-shortest path problem is to find an $st$-path which length is minimum amongst all $st$-paths strictly longer than the shortest path length. In this paper we show that the problem can be solved in linear time if the distances from $s$ and $t$ to all other vertices are given. Particularly our new algorithm runs in $O(|V|\log |V|+|E|)$ time for general graphs, which improves the previous result of $O(|V|^2)$ time for sparse graphs, and takes only linear time for unweighted graphs, planar graphs, and graphs with positive integer edge lengths.Comment: Partial result appeared in COCOA201