Development of Stresses in Cohesionless Poured Sand

The pressure distribution beneath a conical sandpile, created by pouring sand from a point source onto a rough rigid support, shows a pronounced minimum below the apex (`the dip'). Recent work of the authors has attempted to explain this phenomenon by invoking local rules for stress propagation that depend on the local geometry, and hence on the construction history, of the medium. We discuss the fundamental difference between such approaches, which lead to hyperbolic differential equations, and elastoplastic models, for which the equations are elliptic within any elastic zones present .... This displacement field appears to be either ill-defined, or defined relative to a reference state whose physical existence is in doubt. Insofar as their predictions depend on physical factors unknown and outside experimental control, such elastoplastic models predict that the observations should be intrinsically irreproducible .... Our hyperbolic models are based instead on a physical picture of the material, in which (a) the load is supported by a skeletal network of force chains ("stress paths") whose geometry depends on construction history; (b) this network is `fragile' or marginally stable, in a sense that we define. .... We point out that our hyperbolic models can nonetheless be reconciled with elastoplastic ideas by taking the limit of an extremely anisotropic yield condition.Comment: 25 pages, latex RS.tex with rspublic.sty, 7 figures in Rsfig.ps. Philosophical Transactions A, Royal Society, submitted 02/9

Literature review on the dynamics of social movements in fragile and conflict-affected states

This literature review assesses the available academic and policy-oriented literature on social movements in fragile and conflict-affected contexts. It examines who becomes involved in collective action and why, the barriers to mobilisation and, where social movements do emerge, how these are able to sustain mobilisation and broaden their membership base to reflect the interests of the wider community. Evidence from this review suggests the importance of considering the interplay of movement activity and state stability, and of taking into account existing state-society relationships. Donors could focus on creating a supportive environment for social movements

Progression and Verification of Situation Calculus Agents with Bounded Beliefs

We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently, it has been shown that verifying temporal properties over such theories is decidable. We take a first-person view and use the theory to capture what the agent believes about the domain of interest and the actions affecting it. In this paper, we study verification of temporal properties over online executions. These are executions resulting from agents performing only actions that are feasible according to their beliefs. To do so, we first examine progression, which captures belief state update resulting from actions in the situation calculus. We show that, for bounded action theories, progression, and hence belief states, can always be represented as a bounded first-order logic theory. Then, based on this result, we prove decidability of temporal verification over online executions for bounded action theories. © 2015 The Author(s

Making Fathers Count: Assessing the Progress of Responsible Fatherhood Efforts

This report provides a history of the issue of fatherhood in policy debates and philanthropic action from the late 1960's through the present day. It then outlines research findings in seven core areas of fatherhood and discusses accomplishments and challenges for policymakers

PageRank Optimization by Edge Selection

The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts - including ranking websites - and can be interpreted as the average portion of time spent at the node by an infinite random walk. We consider the problem of maximizing the PageRank of a node by selecting some of the edges from a set of edges that are under our control. By applying results from Markov decision theory, we show that an optimal solution to this problem can be found in polynomial time. Our core solution results in a linear programming formulation, but we also provide an alternative greedy algorithm, a variant of policy iteration, which runs in polynomial time, as well. Finally, we show that, under the slight modification for which we are given mutually exclusive pairs of edges, the problem of PageRank optimization becomes NP-hard.Comment: 30 pages, 3 figure

Efficient Open World Reasoning for Planning

We consider the problem of reasoning and planning with incomplete knowledge and deterministic actions. We introduce a knowledge representation scheme called PSIPLAN that can effectively represent incompleteness of an agent's knowledge while allowing for sound, complete and tractable entailment in domains where the set of all objects is either unknown or infinite. We present a procedure for state update resulting from taking an action in PSIPLAN that is correct, complete and has only polynomial complexity. State update is performed without considering the set of all possible worlds corresponding to the knowledge state. As a result, planning with PSIPLAN is done without direct manipulation of possible worlds. PSIPLAN representation underlies the PSIPOP planning algorithm that handles quantified goals with or without exceptions that no other domain independent planner has been shown to achieve. PSIPLAN has been implemented in Common Lisp and used in an application on planning in a collaborative interface.Comment: 39 pages, 13 figures. to appear in Logical Methods in Computer Scienc

DeltaImpactFinder: Assessing Semantic Merge Conflicts with Dependency Analysis

In software development, version control systems (VCS) provide branching and merging support tools. Such tools are popular among developers to concurrently change a code-base in separate lines and reconcile their changes automatically afterwards. However, two changes that are correct independently can introduce bugs when merged together. We call semantic merge conflicts this kind of bugs. Change impact analysis (CIA) aims at estimating the effects of a change in a codebase. In this paper, we propose to detect semantic merge conflicts using CIA. On a merge, DELTAIMPACTFINDER analyzes and compares the impact of a change in its origin and destination branches. We call the difference between these two impacts the delta-impact. If the delta-impact is empty, then there is no indicator of a semantic merge conflict and the merge can continue automatically. Otherwise, the delta-impact contains what are the sources of possible conflicts.Comment: International Workshop on Smalltalk Technologies 2015, Jul 2015, Brescia, Ital

An Analysis of Aspect Composition Problems

The composition of multiple software units does not always yield the desired results. In particular, aspect-oriented composition mechanisms introduce new kinds of composition problems. These are caused by different characteristics as compared to object-oriented composition, such as inverse dependencies. The aim of this paper is to contribute to the understanding of aspect-oriented composition problems, and eventually composition problems in a more general context. To this extent we propose and illustrate a systematic approach to analyze composition problems in a precise and concrete manner. In this approach we represent aspect-based composition mechanisms as transformation rules on program graphs. We explicitly model and show where composition problems occur, in a way that can easily be fully automated. In this paper we focus on structural superimposition (cf. intertype declarations) to illustrate our approach; this results in the identification of three categories of causes of composition problems. \u