Dependence of climate forcing and response on the altitude of black carbon aerosols

Black carbon aerosols absorb solar radiation and decrease planetary albedo, and thus can contribute to climate warming. In this paper, the dependence of equilibrium climate response on the altitude of black carbon is explored using an atmospheric general circulation model coupled to a mixed layer ocean model. The simulations model aerosol direct and semi-direct effects, but not indirect effects. Aerosol concentrations are prescribed and not interactive. It is shown that climate response of black carbon is highly dependent on the altitude of the aerosol. As the altitude of black carbon increases, surface temperatures decrease; black carbon near the surface causes surface warming, whereas black carbon near the tropopause and in the stratosphere causes surface cooling. This cooling occurs despite increasing planetary absorption of sunlight (i.e. decreasing planetary albedo). We find that the trend in surface air temperature response versus the altitude of black carbon is consistent with our calculations of radiative forcing after the troposphere, stratosphere, and land surface have undergone rapid adjustment, calculated as ``regressed'' radiative forcing. The variation in climate response from black carbon at different altitudes occurs largely from different fast climate responses; temperature dependent feedbacks are not statistically distinguishable. Impacts of black carbon at various altitudes on the hydrological cycle are also discussed; black carbon in the lowest atmospheric layer increases precipitation despite reductions in solar radiation reaching the surface, whereas black carbon at higher altitudes decreases precipitation.

Dependence of diffusivity on density and solute diameter in liquid phase: A molecular dynamics study of Lennard-Jones system

Investigations into the variation of self-diffusivity with solute radius, density, and degree of disorder of the host medium is explored. The system consists of a binary mixture of a relatively smaller sized solute, whose size is varied and a larger sized solvent interacting via Lennard-Jones potential. Calculations have been performed at three different reduced densities of 0.7, 0.8, and 0.933. These simulations show that diffusivity exhibits a maximum for some intermediate size of the solute when the solute diameter is varied. The maximum is found at the same size of the solute at all densities which is at variance with the prediction of the levitation effect. In order to understand this anomaly, additional simulations were carried out in which the degree of disorder has been varied while keeping the density constant. The results show that the diffusivity maximum gradually disappears with increase in disorder. Disorder has been characterized by means of the minimal spanning tree. Simulations have also been carried out in which the degree of disorder is constant and only the density is altered. The results from these simulations show that the maximum in diffusivity now shifts to larger distances with decrease in density. This is in agreement with the changes in void and neck distribution with density of the host medium. These results are in excellent agreement with the predictions of the levitation effect. They suggest that the effect of disorder is to shift the maximum in diffusivity towards smaller solute radius while that of the decrease in density is to shift it towards larger solute radius. Thus, in real systems where the degree of disorder is lower at higher density and vice versa, the effect due to density and disorder have opposing influences. These are confirmed by the changes seen in the velocity autocorrelation function, self part of the intermediate scattering function and activation energy. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.3701619]

Quenching across quantum critical points in periodic systems: Dependence of scaling laws on periodicity

We study the quenching dynamics of a many-body system in one dimension described by a Hamiltonian that has spatial periodicity. Specifically, we consider a spin-1/2 chain with equal xx and yy couplings and subject to a periodically varying magnetic field in the (z) over cap direction or, equivalently, a tight-binding model of spinless fermions with a periodic local chemical potential, having period 2q, where q is a positive integer. For a linear quench of the strength of the magnetic field (or chemical potential) at a rate 1/tau across a quantum critical point, we find that the density of defects thereby produced scales as 1/tau(q/(q+1)), deviating from the 1/root tau scaling that is ubiquitous in a range of systems. We analyze this behavior by mapping the low-energy physics of the system to a set of fermionic two-level systems labeled by the lattice momentum k undergoing a nonlinear quench as well as by performing numerical simulations. We also show that if the magnetic field is a superposition of different periods, the power law depends only on the smallest period for very large values of tau, although it may exhibit a crossover at intermediate values of tau. Finally, for the case where a zz coupling is also present in the spin chain, or equivalently, where interactions are present in the fermionic system, we argue that the power associated with the scaling law depends on a combination of q and the interaction strength.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Compositional dependence optical properties study of As40Se60-xSbx thin films

Thin films were thermally evaporated from the bulk glasses of As40Se60-xSbx (with x = 0, 5, 10, 15 at.%) under high vacuum. We have characterized the deposited films by Fourier Transform Infrared spectroscopy. The relationship between the structural and optical properties and the compositional variation has been investigated. Increasing Sb content was found to affect the thermal and optical properties of these films. Non-direct electronic transition was found to be responsible for the photon absorption inside the investigated films. It was found that, the optical band gap E-o decreases while the width of localized states (Urbach energy) E-e increases. (C) 2011 Elsevier B.V. All rights reserved.

Dependence of Protein Adsorption on Wetting Behavior of UHMWPE-HA-Al2O3-CNT Hybrid Biocomposites

Ultrahigh-molecular-weight polyethylene (UHMWPE) is used as an articulating surface in total hip and knee joint replacement. In order to enhance long-term durability/wear resistance properties, UHMWPE-based polymer-ceramic hybrid composites are being developed. Surface properties such as wettability and protein adsorption alter with reinforcement or with change in surface chemistry. From this perspective, the wettability and protein adsorption behavior of compression-molded UHMWPE-hydroxyapatite (HA)-aluminum oxide (Al2O3)-carbon nanotube (CNT) composites were analyzed in conjunction with surface roughness. The combined effect of Al2O3 and CNT shows enhancement of the contact angle by similar to 37A degrees compared with the surface of the UHMWPE matrix reinforced with HA. In reference to unreinforced UHMWPE, protein adsorption density also increased by similar to 230% for 2 wt.%HA-5 wt.%Al2O3-2 wt.%CNT addition to UHMWPE. An important conclusion is that the polar and dispersion components of the surface free energy play a significant role in wetting and protein adsorption than do the total free energy or chemistry of the surface. The results of this study have major implications for the biocompatibility of these newly developed biocomposites.

Carrier concentration dependence of donor activation energy in n-type GaN epilayers grown on Si (111) by plasma-assisted MBE

The n-type GaN layers were grown by plasma-assisted MBE and either intentionally doped with Si or unintentionally doped. The optical characteristics of a donor level in Si-doped, GaN were studied in terms of photoluminescence (PL) spectroscopy as a function of electron concentration. Temperature dependent PL measurements allowed us to estimate the activation energy of a Si-related donor from temperature-induced decay of PL intensity. PL peak positions, full width at half maximum of PL and activation energies are found to be proportional to the cube root of carrier density. The involvement of donor levels is supported by the temperature-dependent electron concentration measurements. (C) 2012 Elsevier Ltd. All rights reserved.

Tight co-degree condition for perfect matchings in 4-graphs

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Mechanical properties of ZnS nanowires and thin films: Microscopic origin of the dependence on size and growth direction

Mechanical properties of ZnS nanowires and thin films are studied as a function of size and growth direction using all-atom molecular dynamics simulations. Using the stress-strain relationship we extract Young's moduli of nanowires and thin films at room temperature. Our results show that Young's modulus of 0001] nanowires has strong size dependence. On the other hand, 01 (1) over bar0] nanowires do not exhibit a strong size dependence of Young's modulus in the size range we have investigated. We provide a microscopic understanding of this behavior on the basis of bond stretching and contraction due to the rearrangement of atoms in the surface layers. The ultimate tensile strengths of the nanowires do not show much size dependence. To investigate the mechanical behavior of ZnS in two dimensions, we calculate Young's modulus of thin films under tensile strain along the 0001] direction. Young's modulus of thin films converges to the bulk value more rapidly than that of the 0001] nanowire.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Algorithmic aspects of k-tuple total domination in graphs

For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V. E) is a subset T D-k of V such that every vertex in V is adjacent to at least k vertices of T Dk. In minimum k-tuple total dominating set problem (MIN k-TUPLE TOTAL DOM SET), it is required to find a k-tuple total dominating set of minimum cardinality and DECIDE MIN k-TUPLE TOTAL DOM SET is the decision version of MIN k-TUPLE TOTAL DOM SET problem. In this paper, we show that DECIDE MIN k-TUPLE TOTAL DOM SET is NP-complete for split graphs, doubly chordal graphs and bipartite graphs. For chordal bipartite graphs, we show that MIN k-TUPLE TOTAL DOM SET can be solved in polynomial time. We also propose some hardness results and approximation algorithms for MIN k-TUPLE TOTAL DOM SET problem. (c) 2012 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Triangle-Free Planar Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G) ? ? + 2, where ? = ?(G) denotes the maximum degree of the graph. If every induced subgraph H of G satisfies the condition |E(H)| ? 2|V(H)|-1, we say that the graph G satisfies Property A. In this article, we prove that if G satisfies Property A, then a'(G) ? ? + 3. Triangle-free planar graphs satisfy Property A. We infer that a'(G) ? ? + 3, if G is a triangle-free planar graph. Another class of graph which satisfies Property A is 2-fold graphs (union of two forests). (C) 2011 Wiley Periodicals, Inc. J Graph Theory

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

Computing Reeb Graphs as a Union of Contour Trees

The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. This paper describes a fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds. The key idea in the proposed approach is to maximally leverage the efficient contour tree algorithm to compute the Reeb graph. The algorithm proceeds by dividing the input into a set of subvolumes that have loop-free Reeb graphs using the join tree of the scalar function and computes the Reeb graph by combining the contour trees of all the subvolumes. Since the key ingredient of this method is a series of union-find operations, the algorithm is fast in practice. Experimental results demonstrate that it outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input. The algorithm also extends to handle large data that do not fit in memory.