Holocene vegetation change in relation to fire and volcanic events in Jilin, Northeastern China

Volatiles erupted from large-scale explosive volcanic activities have a significant impact on climate and environmental changes. As an important ecological factor, the occurrence of fire is affected by vegetation cover, and fire can feed back into both vegetation and climatic change. The causes of fire events are diverse; and can include volcanic eruptions. The amount of charcoal in sediment sequences is related to the frequency and intensity of fire, and hence under good preservation conditions fire history can be reconstructed from fossil charcoal abundance. Until now, little research on the role of fire has been carried out in northeastern China. In this study, through research on charcoal and tephra shards from Gushantun and Hanlongwan, Holocene vegetation change in relation to fire and volcanic events in Jilin, Northeastern China, was investigated. Where tephra shards are present in Gushantun it is associated with low level of both conifers and broadleaved trees, and is also associated with a pronounced charcoal peak. This suggests forest cover was greatly reduced from a fire caused by an eruption of the Tianchi volcano. We also detected one tephra layer in Hanlongwan, which also has the almost same depth with low level forest pollen values and one charcoal peak. This was caused probably by an eruption of the Jinlongdingzi volcano.

Modelling Duqu 2.0 Malware using Attack Trees with Sequential Conjunction

In this paper we identify requirements for choosing a threat modelling formalisation for modelling sophisticated malware such as Duqu 2.0. We discuss the gaps in current formalisations and propose the use of Attack Trees with Sequential Conjunction when it comes to analysing complex attacks. The paper models Duqu 2.0 based on the latest information sourced from formal and informal sources. This paper provides a well structured model which can be used for future analysis of Duqu 2.0 and related attacks.

Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities

Partially ordered preferences generally lead to choices that do not abide by standard expected utility guidelines; often such preferences are revealed by imprecision in probability values. We investigate five criteria for strategy selection in decision trees with imprecision in probabilities: “extensive” Γ-maximin and Γ-maximax, interval dominance, maximality and E-admissibility. We present algorithms that generate strategies for all these criteria; our main contribution is an algorithm for Eadmissibility that runs over admissible strategies rather than over sets of probability distributions.

Compact Routing Messages in Self-Healing Trees

Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only O(log2 n) memory, and are thus, compact schemes.
We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only O(log n) local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008]. The second algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick’s treebased compact routing scheme [SPAA 2001] to produce a fully compact self-healing routing scheme. In the self-healing model, the adversary deletes nodes one at a time with the affected nodes self-healing locally by adding few edges. CompactFT recovers from each attack in only O(1) time and ∆ messages, with only +3 degree increase and O(log∆) graph diameter increase, over any sequence of deletions (∆ is the initial maximum degree).
Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver has not been deleted, with only an additional O(y log ∆) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet removed from the network.