Nonlocal control of pulse propagation in excitable media

We study the effects of nonlocal control of pulse propagation in excitable media. As a generic example for an excitable medium the FitzHugh-Nagumo model with diffusion in the activator variable is considered. Nonlocal coupling in form of an integral term with a spatial kernel is added. We find that the nonlocal coupling modifies the propagating pulses of the reaction-diffusion system such that a variety of spatio-temporal patterns are generated including acceleration, deceleration, suppression, or generation of pulses, multiple pulses, and blinking pulse trains. It is shown that one can observe these effects for various choices of the integral kernel and the coupling scheme, provided that the control strength and spatial extension of the integral kernel is appropriate. In addition, an analytical procedure is developed to describe the stability borders of the spatially homogeneous steady state in control parameter space in dependence on the parameters of the nonlocal coupling

The N-end rule pathway controls multiple functions during Arabidopsis shoot and leaf development

The ubiquitin-dependent N-end rule pathway relates the in vivo half-life of a protein to the identity of its N-terminal residue. This proteolytic system is present in all organisms examined and has been shown to have a multitude of functions in animals and fungi. In plants, however, the functional understanding of the N-end rule pathway is only beginning. The N-end rule has a hierarchic structure. Destabilizing activity of N-terminal Asp, Glu, and (oxidized) Cys requires their conjugation to Arg by an arginyl–tRNA–protein transferase (R-transferase). The resulting N-terminal Arg is recognized by the pathway's E3 ubiquitin ligases, called “N-recognins.” Here, we show that the Arabidopsis R-transferases AtATE1 and AtATE2 regulate various aspects of leaf and shoot development. We also show that the previously identified N-recognin PROTEOLYSIS6 (PRT6) mediates these R-transferase-dependent activities. We further demonstrate that the arginylation branch of the N-end rule pathway plays a role in repressing the meristem-promoting BREVIPEDICELLUS (BP) gene in developing leaves. BP expression is known to be excluded from Arabidopsis leaves by the activities of the ASYMMETRIC LEAVES1 (AS1) transcription factor complex and the phytohormone auxin. Our results suggest that AtATE1 and AtATE2 act redundantly with AS1, but independently of auxin, in the control of leaf development

Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints

The monadic shallow linear Horn fragment is well-known to be decidable and has many application, e.g., in security protocol analysis, tree automata, or abstraction refinement. It was a long standing open problem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. We prove decidability of the non-Horn monadic shallow linear fragment via ordered resolution further extended with dismatching constraints and discuss some applications of the new decidable fragment.Comment: 29 pages, long version of CADE-26 pape

Abstract Canonical Inference

An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) "fairness," which yields completeness, and "uniform fairness," which yields saturation.Comment: 28 pages, no figures, to appear in ACM Trans. on Computational Logi

Completeness and Decidability Results for First-order Clauses with Indices

Session: Inference systems (www.cl.cam.ac.uk/~gp351/cade24)International audienceWe define a proof procedure that allows for a limited form of inductive reasoning. The first argument of a function symbol is allowed to belong to an inductive type. We will call such an argument an index. We enhance the standard superposition calculus with a loop detection rule, in order to encode a particular form of mathematical induction. The satisfiability problem is not semi-decidable, but some classes of clause sets are identified for which the proposed procedure is complete and/or terminating

Hierarchic Superposition Revisited

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably complete" even in the presence of free function symbols ranging into a background theory sort. The hierarchic superposition calculus of Bachmair, Ganzinger, and Waldmann already supports such symbols, but, as we demonstrate, not optimally. This paper aims to rectify the situation by introducing a novel form of clause abstraction, a core component in the hierarchic superposition calculus for transforming clauses into a form needed for internal operation. We argue for the benefits of the resulting calculus and provide two new completeness results: one for the fragment where all background-sorted terms are ground and another one for a special case of linear (integer or rational) arithmetic as a background theory

Synthesis for Polynomial Lasso Programs

We present a method for the synthesis of polynomial lasso programs. These programs consist of a program stem, a set of transitions, and an exit condition, all in the form of algebraic assertions (conjunctions of polynomial equalities). Central to this approach is the discovery of non-linear (algebraic) loop invariants. We extend Sankaranarayanan, Sipma, and Manna's template-based approach and prove a completeness criterion. We perform program synthesis by generating a constraint whose solution is a synthesized program together with a loop invariant that proves the program's correctness. This constraint is non-linear and is passed to an SMT solver. Moreover, we can enforce the termination of the synthesized program with the support of test cases.Comment: Paper at VMCAI'14, including appendi