Local supersymmetry in supergravity

We have studied the local supersymmetry in two D = 4 supergravity models, with N = 1 and N = 2, given the Lagrangians. We have used a simple method based on the differential of the action H, which provides an alternative systematic derivation of the gauge field variations in the first order formalism. This method may be used to find non-relativistic limits of supergravity models.Departamento de Física Teórica, Atómica y ÓpticaMáster en Físic

Bares 2.0 wave buoy and sustainable buoy network

The aim of this article is to show the operation of the Bares 2.0 wave buoy and the Bares network developed by HCTech. In the marine sector it is highly important to know the state of the sea for applications such as the construction of ports, the study of the impact of waves in coastal areas, the development and calibration of forecasting wave models, the knowledge of the state of the maritime navigation channels, etc. Some of the great difficulties that exist in order to obtain the information of ocean waves is the high cost of the buoys, installation and maintenance. The Bares network aims to cover areas of high oceanographic interest, the target is a sustainable network of buoys that facilitate the access to wave data. The features of this network are the optimized cost, high reliability and reduced maintenance.Peer Reviewe

Computation of numerical semigroups by means of seeds

For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative efficient way, since the seeds of each descendant can be easily obtained from the seeds of its parent. The paper is devoted to presenting the results which are related to this approach, leading to a new algorithm for computing and counting the semigroups of a given genus

A Full Non-Monotonic Transition System for Unrestricted Non-Projective Parsing

Restricted non-monotonicity has been shown beneficial for the projective arc-eager dependency parser in previous research, as posterior decisions can repair mistakes made in previous states due to the lack of information. In this paper, we propose a novel, fully non-monotonic transition system based on the non-projective Covington algorithm. As a non-monotonic system requires exploration of erroneous actions during the training process, we develop several non-monotonic variants of the recently defined dynamic oracle for the Covington parser, based on tight approximations of the loss. Experiments on datasets from the CoNLL-X and CoNLL-XI shared tasks show that a non-monotonic dynamic oracle outperforms the monotonic version in the majority of languages.Comment: 11 pages. Accepted for publication at ACL 201