The Impact of Firm Level Contracting on Wage Levels and Inequality: Spain 1995-2002

This paper provides microeconomic evidence on the variation over time of the firm-specific wage premium in Spain from 1995 to 2002, and its impact on wage inequality. We make use of two waves of a detailed linked employer-employee data set. In addition, a new data set with financial information on firms is used for 2002 to control as flexibly as possible for differences in the performance of firms (aggregated at industry level). To our knowledge, there is no microeconomic evidence on the dynamics of the firm-specific wage premium for Spain or for any other country with a similar institutional setting. Our results suggest that there is a clear tendency towards centralization in the collective bargaining process in Spain over this seven-year period, that the firm-level contract wage premium undergoes a substantial decrease, particularly for women, and finally that the "centralization" observed in the collective bargaining process has resulted in a slight decrease in wage inequality.

Regional Entrepreneurial Scorecard

[ES] Este trabajo analiza la relación entre el desarrollo regional y la creación de empresas desde una perspectiva micro del enfoque institucional, a partir de los stakeholders más relevantes que intervienen en el proceso. La contribución de los emprendedores al crecimiento económico regional viene siendo objeto de especial atención por los poderes públicos, para lo que se necesita un sistema de referencias que permita evaluar la adecuación de los programas públicos de fomento de la actividad emprendedora.

Una aproximación a la situación de la mujer en los estudios universitarios de informática

[ES]En los últimos años, la baja participación de la mujer y la tendencia al descenso de los porcentajes de alumnas matriculadas en los estudios universitarios de informática ha sido objeto de estudio para investigadoras/es en Estados Unidos, Europa y otros países. Habiendo constatado también en la Facultad de Informática de San Sebastián (FISS) de la Universidad del País Vasco (UPV/EHU) dicho descenso, nuestro objetivo ha sido recopilar información estadística para determinar si esta tendencia se ha producido también en otras universidades del Estado español. El estudio incluye, en primer lugar,porcentajes de mujeres inscritas en Ingeniería Informática comparados con los porcentajes en el área técnica en su conjunto. Por otra parte, recoge datos del tercer ciclo y porcentajes de profesoras de los departamentos que imparten docencia en la FISS, comparados con los porcentajes en los mismos departamentos en el conjunto del Estado. Por último, se presentan datos de inserción en el mundo laboral para las promociones 1998-2002 de egresadas/os en la UPV/EHU. Los datos revelan los bajos porcentajes de mujeres que se han matriculado en Ingeniería Informática los últimos años y la tendencia al descenso, las diferencias entre distintas universidades,y que apenas hay sesgo de género en los datos de inserción en el mundo laboral.

El clasicismo en el País Vasco: Ramón de Basterra

[ES] Este trabajo analiza la obra del poeta y ensayista Ramón de Basterra (1888-1928), tratando de establecer las peculiaridades de su dimensión clasicista, en comparación con las líneas generales del clasicismo de la época. El clasicismo es visto como un componente fundamental de las ideologías conservadoras y del fascismo en el siglo XX. Se destacan las relaciones del autor con la intelectualidad vasca, especialmente bilbaína , y española. El conjunto de su obra, en particular La obra de Trajano (1921) y Las ubres luminosas (1923), representan una singular aportación a la historia del clasicismo, poco estudiado todavía en nuestro país. Para Basterra. La romanidad, la latinidad y la cristiandad como ejes de la misión civilizatoria de Occidente y su concepción esencialista y ahistórica de la raza y la nacionalidad españolas son elementos centrales de la obra basterriana. En la perspectiva de un análisis del fascismo que destaca el papel nuclear del culto a la romanidad, este autor podría ser definido como "protofascista".

Combined Fluorescent-Chromogenic In Situ Hybridization for Identification and Laser Microdissection of Interphase Chromosomes

Chromosome territories constitute the most conspicuous feature of nuclear architecture, and they exhibit non-random distribution patterns in the interphase nucleus. We observed that in cell nuclei from humans with Down Syndrome two chromosomes 21 frequently localize proximal to one another and distant from the third chromosome. To systematically investigate whether the proximally positioned chromosomes were always the same in all cells, we developed an approach consisting of sequential FISH and CISH combined with laser-microdissection of chromosomes from the interphase nucleus and followed by subsequent chromosome identification by microsatellite allele genotyping. This approach identified proximally positioned chromosomes from cultured cells, and the analysis showed that the identity of the chromosomes proximally positioned varies. However, the data suggest that there may be a tendency of the same chromosomes to be positioned close to each other in the interphase nucleus of trisomic cells. The protocol described here represents a powerful new method for genome analysis

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.

Apuntes sobre clasicismo y modernidad

Mª José García Soler ( editora).Anejos de VELEIA. Serie Minor nº 17

Modelling rail corrugation with specific track parameters focusing on ballasted track and slab track

The objective of this paper is to compare 3 types of track (high performance ballasted track, STEDEF and AFTRAV) from the corrugation growth point of view. This work has considered different vehicle speeds and track radii, and the results have taken into account the four wheels of a bogie. These tracks have been studied using Finite Elements with Nastran-Patran and RACING, a tool developed in Matlab by the authors which estimates the corrugation growth tendency. The tracks are studied using the Finite Strip Method and the Periodic Structure Theory. Lateral and vertical receptances for track and vehicle have been obtained, as well as the corrugation growth functions. In the paper the tracks are ranked according to corrugation development.

Relaciones amorosas de pareja en las trayectorias vitales de las mujeres encarceladas

[ES]La tesis doctoral analiza las experiencias amorosas de pareja de mujeres encarceladas, con el doble objetivo de visibilizar a las mujeres presas en el ámbito de las ciencias sociales y de introducir las especificidades de las mujeres encarceladas en los debates sociológicos y feministas acerca del amor. Las escasas aproximaciones al amor entre las mujeres presas han tendido a explicar sus relaciones de pareja desde el concepto de “dependencia emocional”, que, como se muestra en la tesis, presenta dos debilidades básicas, de un lado la tendencia a la psicologización y patologización de cuestiones de claro sustrato social; de otro la homogeneización de experiencias que presentan gran diversidad. Otra debilidad de ciertos análisis sobre las mujeres presas y aquellas excluidas socialmente, es que se han basado en concepciones sexistas acerca de las mujeres transgresoras como “malas mujeres”, por considerar que no cumplen con las expectativas culturales y sociales asociadas a los supuestos atributos de género. Esta tesis doctoral adopta una epistemología basada en la crítica feminista que busca modelos analíticos alejados de los estereotipos y la estigmatización de las mujeres transgresoras. Desde una perspectiva metodológica cualitativa, el trabajo de campo fue desarrollado en la cárcel de Nanclares de Oca (País Vasco) durante el 2008. Desarrollé un trabajo etnográfico de observación participante y entrevistas en profundidad semiestructuradas que elaboraban información sobre aspectos relativos a sus trayectorias de vida (familia de origen, vivienda, empleo, nivel educativo, situación penal y penitenciaria, estado de salud, etc.) y sus experiencias amorosas de pareja. En mi análisis, he rastreado la diversidad y variabilidad de las experiencias amorosas de las mujeres presas, el impacto del encarcelamiento en sus trayectorias amorosas y en la configuración de su intimidad, los elementos que hacen para estas mujeres del amor un “cautiverio”, y al mismo tiempo, las estrategias “liberadoras” que despliegan en sus desarrollos afectivos. El amor puede constituir un cautiverio para las mujeres ya que favorece la acomodación a unos roles de género que definen a las mujeres como dependientes y carentes de libertad. Al mismo tiempo, el amor se puede entender como una “estrategia emocional”, una forma de superar las consecuencias del encierro y de lograr ciertos estándares de “normalización” social, en un contexto en que se encuentran excluidas socialmente y fuertemente estigmatizadas.

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

Role of G protein coupled inwardly rectifier K+ channels (GIRK) on the neurobiology depression

353 págs.

On the impact of independence of irrelevant alternatives: the case of two-person NTU games

On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is logically independent of the remaining axioms, and the logical independence of IIA is an open problem. We show that for n = 2 the first five axioms already characterize the Shapley NTU value, provided that the class of games is not further restricted. Moreover, we present an example of a solution that satisfies the first five axioms and violates IIA for two-person NTU games (N, V) with uniformly p-smooth V(N).

Multi-agent modelling for the simulation of a simple smart microgrid

The smart grid is a highly complex system that is being formed from the traditional power grid, adding new and sophisticated communication and control devices. This will enable integrating new elements for distributed power generation and also achieving an increasingly automated operation so for actions of the utilities as for customers. In order to model such systems a bottom-up method is followed, using only a few basic elements which are structured into two layers: a physical layer for the electrical power transmission, and one logical layer for element communication. A simple case study is presented to analyse the possibilities of simulation. It shows a microgrid model with dynamic load management and an integrated approach that can process both electrical and communication flows.

La ley del suelo del País Vasco : un paso más hacia la protección del suelo rural

[ES]La Ley del suelo del País Vasco del 2007 nace con el objeto de favorecer el acceso a una vivienda digna. Sin embargo, en la medida en que apuesta por frenar la especulación y la sostenibilidad del medio legisla sobre el tratamiento que se le ha de aportar al suelo no urbanizable. En este caso, no altera sustancialmente la regulación del suelo rural pero sí incorpora nuevas obligaciones dirigidas a frenar la intensidad de la urbanización en este suelo. Se regula la construcción de nueva vivienda, el desarrollo urbanístico de núcleos y barrios rurales y se obliga a profundizar en la calificación del suelo no urbanizable. La aplicación de los nuevos contenidos quedan en manos de los municipios e instituciones sectoriales y los primeros resultados parecen denotar un cambio de tendencia en municipios que han observado la pérdida de calidad paisajística del medio rural, la creciente especulación y la desagrarización de este entorno.

Procedimiento de refutación para un conjunto de restricciones sobre documentos XML

We present a prototype that implements a set of logical rules to prove the satis ability for a class of speci cations on XML documents. Speci cations are given by means of constraints built on Boolean XPath patterns. The main goal of this tool is to test if a given speci cation is satis able or not, showing the history of the execution. It can also be used to test if a given document is a model of a given speci cation and, as a subproduct, it allows to look for all the relations (monomorphisms) between two patterns or the result of doing some operations by combining patterns in di erent ways. The results of these operations are visually shown and therefore the tool makes these operations more understandable. The implementation of the algorithm has been written in Prolog but the prototype has a Java interface for an easy and friendly use.