Study of conjugate natural convection between vertical coaxial rectangular cylinders

Laminar natural convection between two coaxial vertical rectangular cylinders is numerically studied in this work. The outer cylinder is connected with vertical rectangular inlet and outlet pipes. The inner cylinder dissipates volumetric heat. The fluid flow and heat transfer characteristics between the cylinders are analyzed in detail for various Grashof numbers. The heat transfer rates on the individual faces of the inner cylinder are reported. The bottom face of the inner cylinder is found to associate with much higher heat rates than those of the other faces. The average Nusselt number on bottom face is more than 2.5 times of the Nusselt number averaged on all the faces. At a given elevation, local Nusselt number on the inner cylinder faces increases towards cylinder edges. The effect of thermal condition of the walls of outer cylinder, inlet and outlet on the natural convection is analyzed. The thermal condition shows strong qualitative and quantitative impact on the fluid flow and heat transfer. The variation of induced flow rate, dimensionless maximum temperature and average Nusselt numbers with Grashof number is studied. Correlations for dimensionless buoyancy-induced mass flow rate and temperature maximum are presented. (c) 2012 Elsevier Ltd. All rights reserved.

Cumulus clouds and convective boundary layers: a tropical perspective on two turbulent shear flows

This paper is a review prepared for the second Marseille Colloquium on the mechanics of turbulence, held in 2011, 50 years after the first. The review covers recent developments in our understanding of the large-scale dynamics of cumulus cloud flows and of the atmospheric boundary layer in the low-wind convective regime that is often encountered in the tropics. It has recently been shown that a variety of cumulus cloud forms and life cycles can be experimentally realized in the laboratory, with the transient diabatic plume taken as the flow model for a cumulus cloud. The plume is subjected to diabatic heating scaled to be dynamically similar to heat release from phase changes in clouds. The experiments are complemented by exact numerical solutions of the Navier-Stokes-Boussinesq equations for plumes with scaled off-source heating. The results show that the Taylor entrainment coefficient first increases with heating, reaches a positive maximum and then drops rapidly to zero or even negative values. This reduction in entrainment is a consequence of structural changes in the flow, smoothing out the convoluted boundaries in the non-diabatic plume, including the tongues engulfing the ambient flow. This is accompanied by a greater degree of mixedness in the core flow because of lower dilution by the ambient fluid. The cloud forms generated depend strongly on the history of the diabatic heating profile in the vertical direction. The striking effects of heating on the flow are attributable to the operation of the baroclinic torque due to the temperature field. The mean baroclinic torque is shown to peak around a quasi-cylindrical sheet situated midway between the axis of the flow and the edges. This torque is shear-enhancing and folds down the engulfment tongues. The increase in mixedness can be traced to an explosive growth in the enstrophy, triggered by a strong fluctuating baroclinic torque that acts as a source, especially at the higher wave numbers, thus enhancing the mixedness. In convective boundary layers field measurements show that, under conditions prevailing in the tropics, the eddy fluxes of momentum and energy do not follow the Monin-Obukhov similarity. Instead, the eddy momentum flux is found to be linear in the wind speed at low winds; and the eddy heat flux is, to a first approximation, governed by free convection laws, with wind acting as a small perturbation on a regime of free convection. A new boundary layer code, based on heat flux scaling rather than wall-stress scaling, shows promising improvements in predictive skills of a general circulation model.

Methane and carbon dioxide adsorption on edge-functionalized graphene: a comparative DFT study

With a view towards optimizing gas storage and separation in crystalline and disordered nanoporous carbon-based materials, we use ab initio density functional theory calculations to explore the effect of chemical functionalization on gas binding to exposed edges within model carbon nanostructures. We test the geometry, energetics, and charge distribution of in-plane and out-of-plane binding of CO2 and CH4 to model zigzag graphene nanoribbons edge-functionalized with COOH, OH, NH2, H2PO3, NO2, and CH3. Although different choices for the exchange-correlation functional lead to a spread of values for the binding energy, trends across the functional groups are largely preserved for each choice, as are the final orientations of the adsorbed gas molecules. We find binding of CO2 to exceed that of CH4 by roughly a factor of two. However, the two gases follow very similar trends with changes in the attached functional group, despite different molecular symmetries. Our results indicate that the presence of NH2, H2PO3, NO2, and COOH functional groups can significantly enhance gas binding, making the edges potentially viable binding sites in materials with high concentrations of edge carbons. To first order, in-plane binding strength correlates with the larger permanent and induced dipole moments on these groups. Implications for tailoring carbon structures for increased gas uptake and improved CO2/CH4 selectivity are discussed. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4736568]

Adsorption on Edge-Functionalized Bilayer Graphene Nanoribbons: Assessing the Role of Functional Groups in Methane Uptake

A combination of ab initio and classical Monte Carlo simulations is used to investigate the effects of functional groups on methane binding. Using Moller-Plesset (MP2) calculations, we obtain the binding energies for benzene functionalized with NH2, OH, CH3, COOH, and H2PO3 and identify the methane binding sites. In all cases, the preferred binding sites are located above the benzene plane in the vicinity of the benzene carbon atom attached to the functional group. Functional groups enhance methane binding relative to benzene (-6.39 kJ/mol), with the largest enhancement observed for H2PO3 (-8.37 kJ/mol) followed by COOH and CH3 (-7.77 kJ/mol). Adsorption isotherms are obtained for edge-functionalized bilayer graphene nanoribbons using grand canonical Monte Carlo simulations with a five-site methane model. Adsorbed excess and heats of adsorption for pressures up to 40 bar and 298 K are obtained with functional group concentrations ranging from 3.125 to 6.25 mol 96 for graphene edges functionalized with OH, NH2, and COOH. The functional groups are found to act as preferred adsorption sites, and in the case of COOH the local methane density in the vicinity of the functional group is found to exceed that of bare graphene. The largest enhancement of 44.5% in the methane excess adsorbed is observed for COOH-functionalized nanoribbons when compared to H terminated ribbons. The corresponding enhancements for OH- and NH2-functionalized ribbons are 10.5% and 3.7%, respectively. The excess adsorption across functional groups reflects the trends observed in the binding energies from MP2 calculations. Our study reveals that specific site functionalization can have a significant effect on the local adsorption characteristics and can be used as a design strategy to tailor materials with enhanced methane storage capacity.

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.

An adaptive singular ES-FEM for mechanics problems with singular field of arbitrary order

This paper presents a singular edge-based smoothed finite element method (sES-FEM) for mechanics problems with singular stress fields of arbitrary order. The sES-FEM uses a basic mesh of three-noded linear triangular (T3) elements and a special layer of five-noded singular triangular elements (sT5) connected to the singular-point of the stress field. The sT5 element has an additional node on each of the two edges connected to the singular-point. It allows us to represent simple and efficient enrichment with desired terms for the displacement field near the singular-point with the satisfaction of partition-of-unity property. The stiffness matrix of the discretized system is then obtained using the assumed displacement values (not the derivatives) over smoothing domains associated with the edges of elements. An adaptive procedure for the sES-FEM is proposed to enhance the quality of the solution with minimized number of nodes. Several numerical examples are provided to validate the reliability of the present sES-FEM method. (C) 2012 Elsevier B.V. All rights reserved.

Exploiting the Structure of the Constraint Graph for Efficient Points-to Analysis

Points-to analysis is a key compiler analysis. Several memory related optimizations use points-to information to improve their effectiveness. Points-to analysis is performed by building a constraint graph of pointer variables and dynamically updating it to propagate more and more points-to information across its subset edges. So far, the structure of the constraint graph has been only trivially exploited for efficient propagation of information, e.g., in identifying cyclic components or to propagate information in topological order. We perform a careful study of its structure and propose a new inclusion-based flow-insensitive context-sensitive points-to analysis algorithm based on the notion of dominant pointers. We also propose a new kind of pointer-equivalence based on dominant pointers which provides significantly more opportunities for reducing the number of pointers tracked during the analysis. Based on this hitherto unexplored form of pointer-equivalence, we develop a new context-sensitive flow-insensitive points-to analysis algorithm which uses incremental dominator update to efficiently compute points-to information. Using a large suite of programs consisting of SPEC 2000 benchmarks and five large open source programs we show that our points-to analysis is 88% faster than BDD-based Lazy Cycle Detection and 2x faster than Deep Propagation. We argue that our approach of detecting dominator-based pointer-equivalence is a key to improve points-to analysis efficiency.

Sensory-organ-like response determines the magnetism of zigzag-edged honeycomb nanoribbons

We present an analytical effective theory for the magnetic phase diagram for zigzag-edge terminated honeycomb nanoribbons described by a Hubbard model with an interaction parameter U. We show that the edge magnetic moment varies as ln U and uncover its dependence on the width W of the ribbon. The physics of this owes its origin to the sensory-organ-like response of the nanoribbons, demonstrating that considerations beyond the usual Stoner-Landau theory are necessary to understand the magnetism of these systems. A first-order magnetic transition from an antiparallel orientation of the moments on opposite edges to a parallel orientation occurs upon doping with holes or electrons. The critical doping for this transition is shown to depend inversely on the width of the ribbon. Using variational Monte Carlo calculations, we show that magnetism is robust to fluctuations. Additionally, we show that the magnetic phase diagram is generic to zigzag-edge terminated nanostructures such as nanodots. Furthermore, we perform first-principles modeling to show how such magnetic transitions can be realized in substituted graphene nanoribbons. DOI: 10.1103/PhysRevB.87.085412

Prioritizing constraint evaluation for efficient points-to analysis

Pervasive use of pointers in large-scale real-world applications continues to make points-to analysis an important optimization-enabler. Rapid growth of software systems demands a scalable pointer analysis algorithm. A typical inclusion-based points-to analysis iteratively evaluates constraints and computes a points-to solution until a fixpoint. In each iteration, (i) points-to information is propagated across directed edges in a constraint graph G and (ii) more edges are added by processing the points-to constraints. We observe that prioritizing the order in which the information is processed within each of the above two steps can lead to efficient execution of the points-to analysis. While earlier work in the literature focuses only on the propagation order, we argue that the other dimension, that is, prioritizing the constraint processing, can lead to even higher improvements on how fast the fixpoint of the points-to algorithm is reached. This becomes especially important as we prove that finding an optimal sequence for processing the points-to constraints is NP-Complete. The prioritization scheme proposed in this paper is general enough to be applied to any of the existing points-to analyses. Using the prioritization framework developed in this paper, we implement prioritized versions of Andersen's analysis, Deep Propagation, Hardekopf and Lin's Lazy Cycle Detection and Bloom Filter based points-to analysis. In each case, we report significant improvements in the analysis times (33%, 47%, 44%, 20% respectively) as well as the memory requirements for a large suite of programs, including SPEC 2000 benchmarks and five large open source programs.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Improving query focused summarization using look-ahead strategy

Query focused summarization is the task of producing a compressed text of original set of documents based on a query. Documents can be viewed as graph with sentences as nodes and edges can be added based on sentence similarity. Graph based ranking algorithms which use 'Biased random surfer model' like topic-sensitive LexRank have been successfully applied to query focused summarization. In these algorithms, random walk will be biased towards the sentences which contain query relevant words. Specifically, it is assumed that random surfer knows the query relevance score of the sentence to where he jumps. However, neighbourhood information of the sentence to where he jumps is completely ignored. In this paper, we propose look-ahead version of topic-sensitive LexRank. We assume that random surfer not only knows the query relevance of the sentence to where he jumps but he can also look N-step ahead from that sentence to find query relevance scores of future set of sentences. Using this look ahead information, we figure out the sentences which are indirectly related to the query by looking at number of hops to reach a sentence which has query relevant words. Then we make the random walk biased towards even to the indirect query relevant sentences along with the sentences which have query relevant words. Experimental results show 20.2% increase in ROUGE-2 score compared to topic-sensitive LexRank on DUC 2007 data set. Further, our system outperforms best systems in DUC 2006 and results are comparable to state of the art systems.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.

Graphene transistors for CMOS applications: opportunities and challenges

In the last decade, there has been a tremendous interest in Graphene transistors. The greatest advantage for CMOS nanoelectronics applications is the fact that Graphene is compatible with planar CMOS technology and potentially offers excellent short channel properties. Because of the zero bandgap, it will not be possible to turn off the MOSFET efficiently and hence the typical on current to off current ratio (Ion/Ioff) has been less than 10. Several techniques have been proposed to open the bandgap in Graphene. It has been demonstrated, both theoretically and experimentally, that Graphene Nanoribbons (GNR) show a bandgap which is inversely proportional to their width. GNRs with about 20 nm width have bandgaps in the range of 100meV. But it is very difficult to obtain GNRs with well defined edges. An alternate technique to open the band gap is to use bilayer Graphene (BLG), with an asymmetric bias applied in the direction perpendicular to their plane. Another important CMOS metric, the subthreshold slope is also limited by the inability to turn off the transistor. However, these devices could be attractive for RF CMOS applications. But even for analog and RF applications the non-saturating behavior of the drain current can be an issue. Although some studies have reported current saturation, the mechanisms are still not very clear. In this talk we present some of our recent findings, based on simulations and experiments, and propose possible solutions to obtain high on current to off current ratio. A detailed study on high field transport in grapheme transistors, relevant for analog and RF applications will also be presented.

Automatic road extraction using high resolution satellite images based on Level Set and Mean Shift methods

Analysis of high resolution satellite images has been an important research topic for urban analysis. One of the important features of urban areas in urban analysis is the automatic road network extraction. Two approaches for road extraction based on Level Set and Mean Shift methods are proposed. From an original image it is difficult and computationally expensive to extract roads due to presences of other road-like features with straight edges. The image is preprocessed to improve the tolerance by reducing the noise (the buildings, parking lots, vegetation regions and other open spaces) and roads are first extracted as elongated regions, nonlinear noise segments are removed using a median filter (based on the fact that road networks constitute large number of small linear structures). Then road extraction is performed using Level Set and Mean Shift method. Finally the accuracy for the road extracted images is evaluated based on quality measures. The 1m resolution IKONOS data has been used for the experiment.

Time dependent superhydrophobicity of drag reducing surfaces

Air can be trapped on the crevices of specially textured hydrophobic surfaces immersed in water. This heterogenous state of wetting in which the water is in contact with both the solid surface and the entrapped air is not stable. Diffusion of air into the surrounding water leads to gradual reduction in the size and numbers of the air bubbles. The sustainability of the entrapped air on such surfaces is important for many underwater applications in which the surfaces have to remain submersed for longer time periods. In this paper we explore the suitability of different classes of surface textures towards the drag reduction application by evaluating the time required for the disappearance of the air bubbles under hydrostatic conditions. Different repetitive textures consisting of holes, pillars and ridges of different sizes have been generated in silicon, aluminium and brass by isotropic etching, wire EDM and chemical etching respectively. These surfaces were rendered hydrophobic with self-assembled layer of fluorooctyl trichlorosilane for silicon and aluminium surfaces and 1-dodecanethiol for brass surfaces. Using total internal reflection the air bubbles are visualized with the help of a microscope and time lapse photography. Irrespective of the texture, both the size and the number of air pockets were found to decrease with time gradually and eventually disappear. In an attempt to reverse the diffusion we explore the possibility of using electrolysis to generate gases at the textured surfaces. The gas bubbles are nucleated everywhere on the surface and as they grow they coalesce with each other and get pinned at the texture edges.