Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

Glacial Survival of Boreal Trees in Northern Scandinavia

It is commonly believed that trees were absent in Scandinavia during the last glaciation and first recolonized the Scandinavian Peninsula with the retreat of its ice sheet some 9000 years ago. Here, we show the presence of a rare mitochondrial DNA haplotype of spruce that appears unique to Scandinavia and with its highest frequency to the west—an area believed to sustain ice-free refugia during most of the last ice age. We further show the survival of DNA from this haplotype in lake sediments and pollen of Trøndelag in central Norway dating back ~10,300 years and chloroplast DNA of pine and spruce in lake sediments adjacent to the ice-free Andøya refugium in northwestern Norway as early as ~22,000 and 17,700 years ago, respectively. Our findings imply that conifer trees survived in ice-free refugia of Scandinavia during the last glaciation, challenging current views on survival and spread of trees as a response to climate changes.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Are systemizing and autistic traits related to talent and interest in mathematics and engineering? Testing some of the central claims of the empathizing-systemizing theory.

In two experiments, we tested some of the central claims of the empathizing-systemizing (E-S) theory. Experiment 1 showed that the systemizing quotient (SQ) was unrelated to performance on a mathematics test, although it was correlated with statistics-related attitudes, self-efficacy, and anxiety. In Experiment 2, systemizing skills, and gender differences in these skills, were more strongly related to spatial thinking styles than to SQ. In fact, when we partialled the effect of spatial thinking styles, SQ was no longer related to systemizing skills. Additionally, there was no relationship between the Autism Spectrum Quotient (AQ) and the SQ, or skills and interest in mathematics and mechanical reasoning. We discuss the implications of our findings for the E-S theory, and for understanding the autistic cognitive profile.

The link between logic, mathematics and imagination: evidence from children with developmental dyscalculia and mathematically gifted children

This study examined performance on transitive inference problems in children with developmental dyscalculia (DD), typically developing controls matched on IQ, working memory and reading skills, and in children with outstanding mathematical abilities. Whereas mainstream approaches currently consider DD as a domain-specific deficit, we hypothesized that the development of mathematical skills is closely related to the development of logical abilities, a domain-general skill. In particular, we expected a close link between mathematical skills and the ability to reason independently of one's beliefs. Our results showed that this was indeed the case, with children with DD performing more poorly than controls, and high maths ability children showing outstanding skills in logical reasoning about belief-laden problems. Nevertheless, all groups performed poorly on structurally equivalent problems with belief-neutral content. This is in line with suggestions that abstract reasoning skills (i.e. the ability to reason about content without real-life referents) develops later than the ability to reason about belief-inconsistent fantasy content.A video abstract of this article can be viewed at http://www.youtube.com/watch?v=90DWY3O4xx8.

Response to Comment on "Glacial Survival of Boreal Trees in Northern Scandinavia"

Birks et al. question our proposition that trees survived the Last Glacial Maximum (LGM) in Northern Scandinavia. We dispute their interpretation of our modern genetic data but agree that more work is required. Our field and laboratory procedures were robust; contamination is an unlikely explanation of our results. Their description of Endletvatn as ice-covered and inundated during the LGM is inconsistent with recent geological literature.

Does flexibility in secondary level mathematics curriculum affect degree performance?

The authors have much experience in developing mathematics skills of first-year engineering students and attempting to ensure a smooth transition from secondary school to university. Concerns exist due to there being flexibility in the choice of modules needed to obtain a secondary level (A-level) mathematics qualification. This qualification is based on some core (pure maths) modules and a selection from mechanics and statistics modules. A survey of aerospace and mechanical engineering students in Queen’s University Belfast revealed that a combination of both mechanics and statistics (the basic module in both) was by far the most popular choice and therefore only about one quarter of this cohort had studied mechanics beyond the basic module within school maths. Those students who studied the extra mechanics and who achieved top grades at school subsequently did better in two core, first-year engineering courses. However, students with a lower grade from school did not seem to gain any significant advantage in the first-year engineering courses despite having the extra mechanics background. This investigation ties in with ongoing and wider concerns with secondary level mathematics provision in the UK.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

Glued trees algorithm under phase damping

We study the behaviour of the glued trees algorithm described by Childs et al. in [1] under decoherence. We consider a discrete time reformulation of the continuous time quantum walk protocol and apply a phase damping channel to the coin state, investigating the effect of such a mechanism on the probability of the walker appearing on the target vertex of the graph. We pay particular attention to any potential advantage coming from the use of weak decoherence for the spreading of the walk across the glued trees graph. © 2013 Elsevier B.V.

How does Oyster work? The simple interpretation of Oyster mathematics

Oyster® is a surface-piercing flap-type device designed to harvest wave energy in the nearshore environment. Established mathematical theories of wave energy conversion, such as 3D point-absorber and 2D terminator theory, are inadequate to accurately describe the behaviour of Oyster, historically resulting in distorted conclusions regarding the potential of such a concept to harness the power of ocean waves. Accurately reproducing the dynamics of Oyster requires the introduction of a new reference mathematical model, the “flap-type absorber”. A flap-type absorber is a large thin device which extracts energy by pitching about a horizontal axis parallel to the ocean bottom. This paper unravels the mathematics of Oyster as a flap-type absorber. The main goals of this work are to provide a simple–yet accurate–physical interpretation of the laws governing the mechanism of wave power absorption by Oyster and to emphasise why some other, more established, mathematical theories cannot be expected to accurately describe its behaviour.

A-level Mathematics Module Choice and Subsequent Performance in First Year of an Engineering Degree

The A-level Mathematics qualification is based on a compulsory set of pure maths modules and a selection of applied maths modules. The flexibility in choice of applied modules has led to concerns that many students would proceed to study engineering at university with little background in mechanics. A survey of aerospace and mechanical engineering students in our university revealed that a combination of mechanics and statistics (the basic module in both) was by far the most popular choice of optional modules in A-level Mathematics, meaning that only about one-quarter of the class had studied mechanics beyond the basic module within school mathematics. Investigation of student performance in two core, first-year engineering courses, which build on a mechanics foundation, indicated that any benefits for students who studied the extra mechanics at school were small. These results give concern about the depth of understanding in mechanics gained during A-level Mathematics.