Setting the stage: social-environmental and motivational predictors of optimal training engagement

In this paper, we will firstly explore the central tenets of SDT. Research that has examined the social-environmental and motivation-related correlates of optimal training, performance and health-related engagement through the theoretical lens of SDT will be reviewed. Drawing from SDT-driven work undertaken in educational, sport and dance settings, we will draw conclusions and suggest future directions from a research and applied perspective

Dynamic communicability predicts infectiousness

Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network.We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures

Guaranteed clustering and biclustering via semidefinite programming

Identifying clusters of similar objects in data plays a significant role in a wide range of applications. As a model problem for clustering, we consider the densest k-disjoint-clique problem, whose goal is to identify the collection of k disjoint cliques of a given weighted complete graph maximizing the sum of the densities of the complete subgraphs induced by these cliques. In this paper, we establish conditions ensuring exact recovery of the densest k cliques of a given graph from the optimal solution of a particular semidefinite program. In particular, the semidefinite relaxation is exact for input graphs corresponding to data consisting of k large, distinct clusters and a smaller number of outliers. This approach also yields a semidefinite relaxation for the biclustering problem with similar recovery guarantees. Given a set of objects and a set of features exhibited by these objects, biclustering seeks to simultaneously group the objects and features according to their expression levels. This problem may be posed as partitioning the nodes of a weighted bipartite complete graph such that the sum of the densities of the resulting bipartite complete subgraphs is maximized. As in our analysis of the densest k-disjoint-clique problem, we show that the correct partition of the objects and features can be recovered from the optimal solution of a semidefinite program in the case that the given data consists of several disjoint sets of objects exhibiting similar features. Empirical evidence from numerical experiments supporting these theoretical guarantees is also provided

Embeddings in Spacetimes Sourced by Scalar Fields

The extension of the Campbell-Magaard embedding theorem to general relativity with minimally-coupled scalar fields is formulated and proven. The result is applied to the case of a self-interacting scalar field for which new embeddings are found, and to Brans-Dicke theory. The relationship between Campbell-Magaard theorem and the general relativity, Cauchy and initial value problems is outlined.Comment: RevTEX (11 pages)/ To appear in the Journal of Mathematical Physic

Interplay of chiral and helical states in a Quantum Spin Hall Insulator lateral junction

We study the electronic transport across an electrostatically-gated lateral junction in a HgTe quantum well, a canonical 2D topological insulator, with and without applied magnetic field. We control carrier density inside and outside a junction region independently and hence tune the number and nature of 1D edge modes propagating in each of those regions. Outside the 2D gap, magnetic field drives the system to the quantum Hall regime, and chiral states propagate at the edge. In this regime, we observe fractional plateaus which reflect the equilibration between 1D chiral modes across the junction. As carrier density approaches zero in the central region and at moderate fields, we observe oscillations in resistance that we attribute to Fabry-Perot interference in the helical states, enabled by the broken time reversal symmetry. At higher fields, those oscillations disappear, in agreement with the expected absence of helical states when band inversion is lifted.Comment: 5 pages, 4 figures, supp. ma

Sampling-based Motion Planning via Control Barrier Functions

Robot motion planning is central to real-world autonomous applications, such as self-driving cars, persistence surveillance, and robotic arm manipulation. One challenge in motion planning is generating control signals for nonlinear systems that result in obstacle free paths through dynamic environments. In this paper, we propose Control Barrier Function guided Rapidly-exploring Random Trees (CBF-RRT), a sampling-based motion planning algorithm for continuous-time nonlinear systems in dynamic environments. The algorithm focuses on two objectives: efficiently generating feasible controls that steer the system toward a goal region, and handling environments with dynamical obstacles in continuous time. We formulate the control synthesis problem as a Quadratic Program (QP) that enforces Control Barrier Function (CBF) constraints to achieve obstacle avoidance. Additionally, CBF-RRT does not require nearest neighbor or collision checks when sampling, which greatly reduce the run-time overhead when compared to standard RRT variants

The Archimedes 2 mechanical assembly planning system

We describe the implementation and performance of Archimedes 2, an integrated mechanical assembly planning system. Archimedes 2 includes two planners, two assembly sequence animation facilities, and an associated robotic workcell. Both planners use full 3 dimensional data. A rudimentary translator from high level assembly plans to control code for the robotic workcell has also been implemented. We can translate data from a commercial CAD system into input data for the system, which has allowed us to plan assembly sequences for many industrial assemblies. Archimedes 2 has been used to plan sequences for assemblies consisting of 5 to 109 parts. We have also successfully taken a CAD model of an assembly, produced an optimized assembly sequence for it, and translated the plan into robot code, which successfully assembles the device specified in the model

LDRD final report: Automated planning and programming of assembly of fully 3D mechanisms

This report describes the results of assembly planning research under the LDRD. The assembly planning problem is that of finding a sequence of assembly operations, starting from individual parts, that will result in complete assembly of a device specified as a CAD model. The automated assembly programming problem is that of automatically producing a robot program that will carry out a given assembly sequence. Given solutions to both of these problems, it is possible to automatically program a robot to assemble a mechanical device given as a CAD data file. This report describes the current state of our solutions to both of these problems, and a software system called Archimedes 2 we have constructed to automate these solutions. Because Archimedes 2 can input CAD data in several standard formats, we have been able to test it on a number of industrial assembly models more complex than any before attempted by automated assembly planning systems, some having over 100 parts. A complete path from a CAD model to an automatically generated robot program for assembling the device represented by the CAD model has also been demonstrated

Enterprise Education Competitions: A Theoretically Flawed Intervention?

The demand for including enterprise in the education system, at all levels and for all pupils is now a global phenomenon. Within this context, the use of competitions and competitive learning activities is presented as a popular and effective vehicle for learning. The purpose of this chapter is to illustrate how a realist method of enquiry – which utilises theory as the unit of analysis – can shed new light on the assumed and unintended outcomes of enterprise education competitions. The case developed here is that there are inherent flaws in assuming that competitions will ‘work’ in the ways set out in policy and guidance. Some of the most prevalent stated outcomes – that competitions will motivate and reward young people, that they will enable the development of entrepreneurial skills, and that learners will be inspired by their peers – are challenged by theory from psychology and education. The issue at stake is that the expansion of enterprise education policy into primary and secondary education increases the likelihood that more learners will be sheep dipped in competitions, and competitive activities, without a clear recognition of the potential unintended effects. In this chapter, we employ a realist-informed approach to critically evaluate the theoretical basis that underpins the use of competitions and competitive learning activities in school-based enterprise education. We believe that our findings and subsequent recommendations will provide those who promote and practice the use of competitions with a richer, more sophisticated picture of the potential flaws within such activities.Peer reviewedFinal Published versio

New variable separation approach: application to nonlinear diffusion equations

The concept of the derivative-dependent functional separable solution, as a generalization to the functional separable solution, is proposed. As an application, it is used to discuss the generalized nonlinear diffusion equations based on the generalized conditional symmetry approach. As a consequence, a complete list of canonical forms for such equations which admit the derivative-dependent functional separable solutions is obtained and some exact solutions to the resulting equations are described.Comment: 19 pages, 2 fig