Cure and prevention of cardiovascular diseases: herbs for heart

Herbs contribute to more than 60-70% in development of modern medicines in the world market either directly or indirectly. The herbal treatments for congestive heart failure, systolic hypertension, angina, atherosclerosis, cerebral insufficiency and venous insufficiency etc. has been known since ancient times. Unlike allopathic medicines, Ayurveda medicines are considered safe, however, the adverse reactions of herbal drugs is also reported. In this paper, we have compiled 128 herbs and their parts that have medicinal value to prevent, alleviate or cure heart disease related disorders. Jaccard Neighbour-joining cluster analysis using Free Tree software was used to assess the relative importance of plants in context with its healing potential for heart related disease. Based on the medicinal value in context with the heart, five major clusters of the selected 128 herbs were made. Correlation of the distance between herbs revealed that most of these herbs were found to have more than one medicinal property. The distance in dendogram depicted closeness of properties curing heart disease; as less the distance between two medicinal plants or two groups they will more close to cure particular heart disease. During drug development, a medicinal plant can be replaced by another plant of same group or by another plant of its neighbour group but from same pedigree. Thus, in case of non-availability of herbs or if it belongs to the category of rare, threatened, and endangered species, such method may add to new ways of drug development.

Constraint and Satisfiability Reasoning for Graph Coloring

Graph coloring is an important problem in combinatorial optimization and a major component of numerous allocation and scheduling problems. In this paper we introduce a hybrid CP/SAT approach to graph coloring based on the addition-contraction recurrence of Zykov. Decisions correspond to either adding an edge between two non-adjacent vertices or contracting these two vertices, hence enforcing inequality or equality, respectively. This scheme yields a symmetry-free tree and makes learnt clauses stronger by not committing to a particular color. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to produce a clausal explanation of this bound for use in a CDCL algorithm; a branching heuristic emulating Br´elaz’ heuristic on the Zykov tree; and dedicated pruning techniques relying on marginal costs with respect to the bound and on reasoning about transitivity when unit propagating learnt clauses. The combination of these techniques in both a branch-and-bound and in a bottom-up search outperforms other SAT-based approaches and Dsatur on standard benchmarks both for finding upper bounds and for proving lower bounds.

Always delayed? Holocene and current evolution of Pasterze Glacier, Austria

<p>The glaciers in the Alps are currently shrinking, in some cases dramatically, due to progressive warming. At some glaciers this recession has made it possible to find tree remains and other organic material at or near the termini. At Pasterze Glacier, such findings have been made since about 1990, allowing new insights into the Holocene evolution and variability of this glacier. Initially, only relocated wood and peat boulders were collected, but around 2010 an in-situ locality became ice-free. Tree remains and other organic material from this site have mainly provided dates for a period of more than a thousand years in the middle Holocene (around 6 ka) proving a continuously smaller extent of this glacier during this period compared to today. Furthermore, a comparative interpretation of all available, some 80 radiocarbon and dendro dates suggests that Pasterze Glacier was probably at least from about 10.2 ka to about 3.5 ka continuously shorter compared to the extent around 2010 AD. For the last nearly 2800 years there is no similar evidence of comparable small glacier extents. Finally, after the early- to mid-Holocene retreat phase, a relatively delayed increase of Pasterze Glacier during the early Neoglacial (in the Alps after about 4 ka) can be deduced. Other glaciers almost reached or even exceeded the later LIA dimensions already during this period.</p><p>Moreover, Pasterze Glacier is also lagging behind the current climatic changes, i.e., its extent is not in equilibrium with the current warming. This circumstance is not only proven by the rapid recession during recent years, but also by simulations with the glacier model OGGM. The simulation results show on the one hand that Pasterze glacier has to melt back for several more kilometres to reach equilibrium with the climatic conditions of 1980-2010. On the other hand, this also documents that the recent climate conditions are already sufficient to allow a recession comparable to the early and middle Holocene stages of this glacier. Both the delayed increase in extent during the early Neoglacial and the considerably delayed current recession can be explained by the size of the glacier and the topographic conditions.</p>

Profil Pohon pada jenis Litsea spp. di Hutan Pendidikan

The purpose of this study was to determine the morphological condition of Litsea spp. Including the condition of the trunk, branching, the canopy, especially the relationship between the diameter of the trunk and the total height of the tree, the diameter of the trunk to the width of the canopy, and the total height of the tree to the width of the canopy in the Education Forest, Faculty of Forestry, Mulawarman University Samarinda East Kalimantan. The method of this study was purposive sampling method, which looking for Litsea spp. As the object of research as many as 33 trees and seven types of Litsea spp. The tree parameters measured were diameter, branch free, tree height, and canopy width. The results showed that 57.4% of the trees were healthy. The results of the tree's overall data analysis showed that the regression coefficient value between diameter and height, and diameter with canopy width have a moderate correlation value, this indicated that the diameter of the tree has no relationship to tree height and canopy width in Litsea spp. And similar conditions also occurred in the correlation between the height of the tree, which also has a moderate correlation, so it indicated the tree's height does not affect the width of the canopy

Clause Learning and New Bounds for Graph Coloring

Graph coloring is a major component of numerous allocation and scheduling problems. We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph. We introduce a new lower bound for this problem based on Mycielskian graphs; a method to produce a clausal explanation of this bound for use in a CDCL algorithm; and a branching heuristic emulating Brelaz on the Zykov tree. The combination of these techniques in a branch- and-bound search outperforms Dsatur and other SAT-based approaches on standard benchmarks both for finding upper bounds and for proving lower bounds.

Controlling the trapping efficiency in a family of scale-free tree networks

Efficiently controlling the trapping process is very significant in the study of trapping problem in diverse dynamic processes. In this paper, we explore the trapping efficiency on a family of scale-free tree networks with a deep trap positioned at an initial node, which is controlled by three different strategies. In the first technique, the transition probability is modified by an edge weight parameter. In the second method, the transition probability is controlled by a delay parameter. In the third approach, we use the delay parameter and weight parameter simultaneously to control the trapping process. For all the three control methods, the analytical results of average trapping time (ATT) exactly agree with the numerical results. The result of the first control strategy shows that the average trapping time can scale sublinearly, linearly or superlinearly by modifying the weight parameter. The analytic expression of the ATT in the second method shows that the delay parameter can only modify the main coefficient of ATT, but cannot change the dominant behavior of trapping efficiency. The explicit expression of average trapping time when random walk on scale-free tree network is controlled by the third method shows that it is a fine control. We can get desired trapping efficiency by changing the weight parameter and the delay parameter simultaneously. This work provides a better understanding of controlling the trapping process in a family of scale-free tree networks.