Admissible Hierachic Sets

In this paper we present a solution concept for abstract systems called the admissible hierarchic set. The solution we propose is a refinement of the hierarchic solution, a generalization of the von Neumann and Morgenstern solution. For finite abstract systems we show that the admissible hierarchic sets and the von Neumann and Morgenstern stable sets are the only outcomes of a coalition formation procedure (Wilson, 1972 and Roth, 1984). For coalitional games we prove that the core is either a vN&M stable set or an admissible hierarchic set.

Efectos tamaño y sector sobre la rentabilidad, endeudamiento y coste de la deuda de las empresas familiares riojanas

Ponencia presentada y defendida en las XIV jornadas Hispano Lusas de Gestión Científica celebradas en Azores en febrero de 2004.

Randomized, double-blind, placebo-controled clinical trial of sublingual immunotherapy in natural rubber latex allergic patients

Trial registration number: CTRN12611000543987

Introducción: Variedad de temas y de tratamientos sobre la Innovación

[ES] Este artículo de introducción al número especial sobre innovación de la revista Cuadernos de Gestión consta de dos apartados bien diferenciados. En el primero, se recogen algunas ideas que pueden ser útiles para los lectores que se aproximan al tema de la innovación y observan una gran variedad conceptual. En concreto, se ha tratado de explicar de una manera más o menos exhaustiva el concepto de Open Innovation (OI). La OI surge del reconocimiento de que la empresa no puede innovar de manera aislada, y, por lo tanto, necesita siempre adquirir las ideas y los recursos del entorno exterior.

Materiales vascos del legado de Wilhelm von Humboldt: la relevancia de Astarloa y el Plan de Lenguas

Este artículo es traducción del original alemán «Zum Stellenwert Astarloas und des Plan de Lenguas», publicado en B. Hurch (ed.), Die baskischen Materialien aus dem Nachlaß Wilhelm von Humboldts. Astarloa, Charpentier, Fréret, Aizpitarte und anderes. Paderborn: Schöningh, pp. 21-42. La traducción al español es obra de Oroitz Jauregi y ha sido revisada por Ricardo Gómez y Bernhard Hurch.

Asymmetric flow networks

This paper provides a new model of network formation that bridges the gap between the two benchmark models by Bala and Goyal, the one-way flow model, and the two-way flow model, and includes both as particular extreme cases. As in both benchmark models, in what we call an "asymmetric flow" network a link can be initiated unilaterally by any player with any other, and the flow through a link towards the player who supports it is perfect. Unlike those models, in the opposite direction there is friction or decay. When this decay is complete there is no flow and this corresponds to the one-way flow model. The limit case when the decay in the opposite direction (and asymmetry) disappears, corresponds to the two-way flow model. We characterize stable and strictly stable architectures for the whole range of parameters of this "intermediate" and more general model. We also prove the convergence of Bala and Goyal's dynamic model in this context.

Gehiago Pierre Urteren gramatikaren iturriez: Lilyren gramatika

[EN] Pierre Urte wrote Grammaire cantabrique circa 1714, when he was exiled in England. In this article we want to prove that the main source for Urte’s work was the socalled “Lily’s grammar”, which was the oficial grammar to learn Latin language in England from the 16th to the 19th century. The indentification of that source allows us to support the claim that Urte’s grammar must be included in the tradition of language teaching, as was already pointed out by Oyharçabal (1989). In this article, we first offer a brief history of Lily’s grammar. Then, we provide some clues in order to identify the exact edition used by Urte. Finally, in the main section of the article, we confront the two grammatical works; our aim is to ensure Urte’s debt to Lily’s grammar, and to show in detail the principal parts which Urte took from his source (mainly grammatical clasifications and examples).

Mechanisms implied in Escherichia coli removal during wastewater treatment

Poster presentado 12th Symposium on Aquatic Microbial Ecology (SAME12) August 28 – September 02, 2011 Germany , Rostock–Warnemünde

A monotonic core concept for convex games: The SD-prenucleolus

We prove that the SD-prenucleolus satisfies monotonicity in the class of convex games. The SD-prenucleolus is thus the only known continuous core concept that satisfies monotonicity for convex games. We also prove that for convex games the SD-prenucleolus and the SD-prekernel coincide.

Justicia victimal. Contribuciones y retos

[ES]La pena de cárcel, como única respuesta al delito, no constituye ninguna solución para el hecho delincuencial. No es solución para la víctima porque queda en el más profundo de los desamparos. No es solución para el infractor porque la cárcel no sólo no rehabilita sino que puede generar más delincuencia, como lo acredita el alto índice de reincidencia. Finalmente, no es una solución para la Comunidad por los altos costes, no sólo penitenciarios. Sólo integrada con otras respuestas no carcelarias, la respuesta prisional permite un abordaje sensato de la delincuencia. Se aboga, por ello, por una justicia que reconozca la existencia de otras instancias reparadoras como: la mediación, el arbitraje, el diálogo víctima - agresor, etc.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Designing High Performance Factory Automation Applications on Top of DDS

13 p.

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Design, Construction and Testing of a Hydraulic Power Take-Off for Wave Energy Converters

This paper presents the construction, mathematical modeling and testing of a scaled universal hydraulic Power Take-Off (PTO) device for Wave Energy Converters (WECs). A specific prototype and test bench were designed and built to carry out the tests. The results obtained from these tests were used to adjust an in-house mathematical model. The PTO was initially designed to be coupled to a scaled wave energy capture device with a low speed and high torque oscillating motion and high power fluctuations. Any Energy Capture Device (ECD) that fulfils these requirements can be coupled to this PTO, provided that its scale is adequately defined depending on the rated power of the full scale prototype. The initial calibration included estimation of the pressure drops in the different components, the pressurization time of the oil inside the hydraulic cylinders and the volumetric efficiency of the complete circuit. Since the overall efficiency measured during the tests ranged from 0.69 to 0.8 and the dynamic performance of the PTO was satisfactory, the results are really promising and it is believed that this solution might prove effective in real devices.

Structural study of CUG-repeating small RNAs complexed with silencing suppressor P19

The study is focused on structural aspects of interaction between silencing suppressor p19 and CUG-repeating small RNAs. The work involves crystal structure determination of a protein-unbound RNA form and RNA fragments of various lengths (19, 20, 21 nucleotides) complexed with p19-suppressor. Results prove the ability of silencing suppressor p19 to bind CUG-repeating small RNAs, as well as reveal features of U•U mismatches flanked by Watson-Crick C•G base pairs in p19-bound and p19-unbound states. In addition, structural data reveal a p19 specific site for anchoring extra nucleotides in small RNAs. In general, the study extends our knowledge about the mechanism of small RNA recognition by silencing suppressor p19.