Is meridional circulation important in modelling irregularities of the solar cycle?

We explore the importance of meridional circulation variations in modelling the irregularities of the solar cycle by using the flux transport dynamo model. We show that a fluctuating meridional circulation can reproduce some features of the solar cycle like the Waldmeier effect and the grand minimum. However, we get all these results only if the value of the turbulent diffusivity in the convection zone is reasonably high.

Context dependent splicing functions of Bud31/Ycr063w define its role in budding and cell cycle progression

The yeast Bud31 protein, a Prp19 complex (NTC) member, aids spliceosome assembly and thus promotes efficient pre-mRNA splicing. The bud31 null cells show mild budding abnormalities at optimal growth temperatures and, at higher temperatures, have growth defects with aberrant budding. Here we have assessed cell cycle transitions which require Bud31. We find Bud31 facilitates passage through G1-S regulatory point (Start) but is not needed for G2-M transition or for exit from mitosis. To co-relate Bud31 functions in cell division with splicing, we studied the splicing status of transcripts that encode proteins involved in budding. We find Bud31 promotes efficient splicing of only some of these pre-mRNAs, for example, ARP2 and SRC1. Wild type cells have a long and a short isoform of SRC1 mRNA and protein, out of which the shorter mRNA splice variant is predominant. bud31 Delta cells show inefficient SRC1 splicing and entirely lack the shorter SRC1 spliced mRNA isoform. Yeast PRP17, another NTC sub-complex member, is also required for G1-S and G2-M cell cycle transitions. We examined genetic interactions between BUD31 and PRP17. While both factors were needed for efficient cell cycle dependent gene expression, our data indicate that distinct pre-mRNAs depend on each of these non-essential splicing factors.

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.

TURBULENT PUMPING OF MAGNETIC FLUX REDUCES SOLAR CYCLE MEMORY AND THUS IMPACTS PREDICTABILITY OF THE SUN'S ACTIVITY

Prediction of the Sun's magnetic activity is important because of its effect on space environment and climate. However, recent efforts to predict the amplitude of the solar cycle have resulted in diverging forecasts with no consensus. Yeates et al. have shown that the dynamical memory of the solar dynamo mechanism governs predictability, and this memory is different for advection- and diffusion-dominated solar convection zones. By utilizing stochastically forced, kinematic dynamo simulations, we demonstrate that the inclusion of downward turbulent pumping of magnetic flux reduces the memory of both advection- and diffusion-dominated solar dynamos to only one cycle; stronger pumping degrades this memory further. Thus, our results reconcile the diverging dynamo-model-based forecasts for the amplitude of solar cycle 24. We conclude that reliable predictions for the maximum of solar activity can be made only at the preceding minimum-allowing about five years of advance planning for space weather. For more accurate predictions, sequential data assimilation would be necessary in forecasting models to account for the Sun's short memory.

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.

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.

Analysing modifica-tions in the synthesis of multiple state mechanical devices using configuration space and topology graphs

Automated synthesis of mechanical designs is an important step towards the development of an intelligent CAD system. Research into methods for supporting conceptual design using automated synthesis has attracted much attention in the past decades. In our research, ten experimental studies are conducted to find out how designers synthesize solution concepts for multi-state mechanical devices. The designers are asked to think aloud, while carrying out the synthesis. These design synthesis processes are video recorded. It has been found that modification of kinematic pairs and mechanisms is the major activity carried out by all the designers. This paper presents an analysis of these synthesis processes using configuration space and topology graph to identify and classify the types of modifications that take place. Understanding of these modification processes and the context in which they happened is crucial to develop a system for supporting design synthesis of multiple state mechanical devices that is capable of creating a comprehensive variety of solution alternatives.

Comparison of one cycle control of charge and current for bi-directional boost rectifiers

Classical control and one cycle control of current are popular methods used to modulate pulses in active rectifiers for ac-dc power conversion. One cycle control has lower control complexity and can be implemented using linear analog circuits when compared with the classical approach. However, it also suffers from problems such as instability and offsets in current that is severe at light load conditions. A control strategy for bidirectional boost rectifiers based on one cycle control of charge is proposed for that overcomes these limitations. The integral of sensed current, which represents charge, is compared with a non-linear carrier, which is modified for ac-dc power conversion. This generates the gating signals for the switching devices. The modifications required for the control law governing one cycle control of charge is derived in the paper. Detailed simulation studies are carried out to compare one cycle control of current with the proposed method for ac-dc power conversion, which are validated on a laboratory hardware prototype.

An estimate of equilibrium sensitivity of global terrestrial carbon cycle using NCAR CCSM4

Increasing concentrations of atmospheric CO2 influence climate, terrestrial biosphere productivity and ecosystem carbon storage through its radiative, physiological and fertilization effects. In this paper, we quantify these effects for a doubling of CO2 using a low resolution configuration of the coupled model NCAR CCSM4. In contrast to previous coupled climate-carbon modeling studies, we focus on the near-equilibrium response of the terrestrial carbon cycle. For a doubling of CO2, the radiative effect on the physical climate system causes global mean surface air temperature to increase by 2.14 K, whereas the physiological and fertilization on the land biosphere effects cause a warming of 0.22 K, suggesting that these later effects increase global warming by about 10 % as found in many recent studies. The CO2-fertilization leads to total ecosystem carbon gain of 371 Gt-C (28 %) while the radiative effect causes a loss of 131 Gt-C (10 %) indicating that climate warming damps the fertilization-induced carbon uptake over land. Our model-based estimate for the maximum potential terrestrial carbon uptake resulting from a doubling of atmospheric CO2 concentration (285-570 ppm) is only 242 Gt-C. This highlights the limited storage capacity of the terrestrial carbon reservoir. We also find that the terrestrial carbon storage sensitivity to changes in CO2 and temperature have been estimated to be lower in previous transient simulations because of lags in the climate-carbon system. Our model simulations indicate that the time scale of terrestrial carbon cycle response is greater than 500 years for CO2-fertilization and about 200 years for temperature perturbations. We also find that dynamic changes in vegetation amplify the terrestrial carbon storage sensitivity relative to a static vegetation case: because of changes in tree cover, changes in total ecosystem carbon for CO2-direct and climate effects are amplified by 88 and 72 %, respectively, in simulations with dynamic vegetation when compared to static vegetation simulations.

Supercritical carbon dioxide Brayton cycle for concentrated solar power

Supercritical carbon dioxide based Brayton cycle for possible concentrated solar power applications is investigated and compared with trans- and sub-critical operations of the same fluid. Thermal efficiency, specific work output and magnitude of irreversibility generation are used as some of the performance indicators. While the thermal efficiency increases almost linearly with low side pressure in the sub- and trans-critical cycles, it attains a maximum in the supercritical regime at 85 bar after which there are diminishing returns on increasing the low side pressure. It is also found that supercritical cycle is capable of producing power with a thermal efficiency of >30% even at a lower source temperature (820K) and accounting for foreseeable non-idealities albeit with a higher turbine inlet pressure (similar to 300 bar) which is not matched by a conventional sub-critical cycle even with a high source temperature of 978K. The reasons for lower efficiency than in an ideal cycle are extracted from an irreversibility analysis of components, namely, compressor, regenerator, turbine and gas cooler. Low sensitivity to the source temperature and extremely small volumetric flow rates in the supercritical cycle could offset the drawback of high pressures through a compact system.

Propyl-2-(8-(3,4-Difluorobenzyl)-2 `,5 `-Dioxo-8-AzaspiroBicyclo3.2.1] Octane-3,4 `-Imidazolidine]-1 `-yl) Acetate Induces Apoptosis in Human Leukemia Cells through Mitochondrial Pathway following Cell Cycle Arrest

Background: Due to the functional defects in apoptosis signaling molecules or deficient activation of apoptosis pathways, leukemia has become an aggressive disease with poor prognosis. Although the majority of leukemia patients initially respond to chemotherapy, relapse is still the leading cause of death. Hence targeting apoptosis pathway would be a promising strategy for the improved treatment of leukemia. Hydantoin derivatives possess a wide range of important biological and pharmacological properties including anticancer properties. Here we investigated the antileukemic activity and mechanism of action of one of the potent azaspiro hydantoin derivative, (ASHD). Materials and Methods: To investigate the antileukemic efficacy of ASHD, we have used MTT assay, cell cycle analysis by FACS, tritiated thymidine incorporation assay, Annexin V staining, JC1 staining and western blot analysis. Results: Results showed that ASHD was approximately 3-fold more potent than the parent compounds in inducing cytotoxicity. Tritiated thymidine assay in conjunction with cell cycle analysis suggests that ASHD inhibited the growth of leukemic cells. The limited effect of ASHD on cell viability of normal cells indicated that it may be specifically directed to cancer cells. Translocation of phosphatidyl serine, activation of caspase 3, caspase 9, PARP, alteration in the ratio of BCL2/BAD protein expression as well as the loss of mitochondrial membrane potential suggests activation of the intrinsic pathway of apoptosis. Conclusion: These results could facilitate the future development of novel hydantoin derivatives as chemotherapeutic agents for leukemia.

Product Dimension of Forests and Bounded Treewidth Graphs

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.