Priority constructions are the trademark of theorems on the recursively enumerable Turing degrees. By their combinatorial patterns, they are naturally identified as finite injury, infinite injury, and so forth. Following Chong and Yang [4], [3], we analyze the complexity of infinite injury arguments and pinpoint exactly the position of their degree-theoretic applications within the hierarchy of...

SYNOPSIS. Hypotheses explaining the use of intermittent bounding and undulating flight modes in birds are considered. Existing theoretical models of intermittent flight have assumed that the animal flies at a constant speed throughout. They predict that mean mechanical power in undulating (flap-gliding) flight is reduced compared to steady flight over a broad range of speeds, but is reduced in ...

Distance bounding protocols can be employed in mutual entity authentication schemes to determine an upper bound on the distance to another entity. As these protocols are conducted over noisy wireless adhoc channels, they should be designed to cope well with substantial bit error rates during the rapid single bit exchanges. This paper investigates the robustness to high bit error rates of two im...

Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution techniques. In particular, the fundamental idea is to exploit our ability to either optimize over and/or separate from the convex hull of solutions to a given relaxation in order to derive improved methods of bounding the optimal solution value. These boundi...

This article investigates aspects in the context of the step-wise development of software product lines. Specifically, we propose the integration of aspects into AHEAD, an architectural model for feature-based product line development. We introduce the notion of aspect refinement based on Aspectual Mixin Layers, a technique for implementing features. Aspect refinement enables a programmer to ev...

Textual grounding is an important but challenging task for human-computer interaction, robotics and knowledge mining. Existing algorithms generally formulate the task as selection from a set of bounding box proposals obtained from deep net based systems. In this work, we demonstrate that we can cast the problem of textual grounding into a unified framework that permits efficient search over all...

This paper formulates the search for a set of bounding boxes (as needed in object proposal generation) as a monotone submodular maximization problem over the space of all possible bounding boxes in an image. Since the number of possible bounding boxes in an image is very large O(#pixels), even a single linear scan to perform the greedy augmentation for submodular maximization is intractable. Th...

In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated with over approximation of contact information for time-critical collision detection schemes that utilise sphere-tree bounding volume hierarchies. Existing solutions to time-critical collision handling can at times suffe...

We address the state reachability problem in concurrent programs running over the TSO weak memory model. This problem has been shown to be decidable with non-primitive recursive complexity in the case of finite-state threads. For recursive threads this problem is undecidable. The aim of this paper is to provide under-approximate analyses for TSO systems that are decidable and have better (eleme...

Oxygen consumption (VO2) of minks increased non-linearly with running speed over the range of 0.70-6.40 km h-1. A break in the VO2 vs speed relationship occurred at approximately 3.94 km h-1 and corresponded to the transition from a walking to a half-bounding gait pattern. Incremental transport costs associated with bounding were 36% lower than for walking at similar speeds. The lower energetic...