The state of the Martian climate

60°N was +2.0°C, relative to the 1981–2010 average value (Fig. 5.1). This marks a new high for the record. The average annual surface air temperature (SAT) anomaly for 2016 for land stations north of starting in 1900, and is a significant increase over the previous highest value of +1.2°C, which was observed in 2007, 2011, and 2015. Average global annual temperatures also showed record values in 2015 and 2016. Currently, the Arctic is warming at more than twice the rate of lower latitudes

Heavy decline of the largest European Arctic Skua Stercorarius parasiticus colony: interacting effects of food shortage and predation

Capsule: The number of breeding pairs of Europe’s largest Arctic Skua Stercorarius parasiticus colony at Slettnes, Norway, showed a dramatic decline of at least 50% over two decades, with food shortage in four years and increasing predation by Red Fox Vulpes vulpes leading to total breeding failure in five out of six recent study years. Aims: To document the decline of Europe’s largest Arctic Skua colony and quantify bottom-up and top-down effects on reproduction. Methods: We compared nest counts between 1997–1998 and 2014–2019 and collected data on egg size, clutch size and nest success for all years, and adult body mass, nest attendance, at-sea activity, aggressive nest defence, Red Fox Vulpes vulpes encounters, daily nest survival and adult survival for 2014–2019. We deployed nest cameras to identify predators in 2018–2019. In addition, we developed a demographic model to estimate the fecundity required for a stable population. Results: A higher proportion of time spent at sea, small eggs, low adult female body mass and indirect assessment of foraging fish availability suggested food shortages in four of six recent study years. At the same time, nest predation by Red Foxes, the likely predator involved, increased during the six-year study. The combined effects of food shortage and nest predation led to total breeding failures in 2017–2019. Conclusion: We provide evidence of both bottom-up (food shortage) and top-down (predation) effects on reproductive investment and hatching success in this colony. The reproductive output in recent years is far too low to sustain a stable population. The severe decline of the Arctic Skua colony at Slettnes fits reported trends for this species across most of its European breeding range, as well as for its important host species, the Arctic Tern Sterna paradisaea and the Black-legged Kittiwake Rissa tridactyla

Towards the Complexity of Recognizing Pseudo-intents

Abstract. Pseudo-intents play a key rôle in Formal Concept Analy-sis. They are the premises of the implications in the Duquenne-Guigues Base, which is a minimum cardinality base for the set of implications that hold in a formal context. It has been shown that checking whether a set is a pseudo-intent is in conp. However, it is still open whether this problem is conp-hard, or it is solvable in polynomial time. In the current work we prove a first lower bound for this problem by showing that it is at least as hard as transversal hypergraph, which is the problem of identifying the minimal transversals of a given hypergraph. This is a prominent open problem in hypergraph theory that is conjec-tured to form a complexity class properly contained between p and conp. Our result explains why the attempts to find a polynomial algorithm for recognizing pseudo-intents have failed until now. We also formulate a decision problem, namely first pseudo-intent, and show that if this problem is not polynomial, then, unless p = np, pseudo-intents cannot be enumerated with polynomial delay in a specified lexicographic order.

Some Computational Problems Related to Pseudo-intents

Abstract. We investigate the computational complexity of several deci-sion, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a subset of its set of pseudo-intents, checking whether this context has an additional pseudo-intent is in conp, and it is at least as hard as checking whether a given simple hypergraph is not saturated. We also show that recognizing the set of pseudo-intents is also in conp, and it is at least as hard as identifying the minimal transver-sals of a given hypergraph. Moreover, we show that if any of these two problems turns out to be conp-hard, then unless p = np, pseudo-intents cannot be enumerated in output polynomial time. We also investigate the complexity of finding subsets of a given Duquenne-Guigues Base from which a given implication follows. We show that checking the existence of such a subset within a specified cardinality bound is np-complete, and counting all such minimal subsets is #p-complete.