27 resultados para Transferencia Temporal de Valores (TTV)

em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Nivel educativo: Grado. Duración (en horas): Más de 50 horas

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The main objective of this paper is to estimate wage differentials between permanent and temporal workers for different qualification levels and decompose such differentials to see which factors contribute more to explain them. The data we use is the "Encuesta de Estructura Salarial", a survey carried out in 1995 in all countries of the European Union, which contains very detailed information on wages and other characteristics for about 180.000 workers. The empirical results indicate that (a) the wage gap between permanent and temporal workers increases with qualification and it is smaller for females than for males, (b) when decomposing average wage differentials for each qualification level, we observe that the vast majority of such differential is explainedby differences in characteristics, and in particular by differences in tenure and occupation. With respect to differences in returns, our results indicate that the returns to tenure are higher for temporal workres relative to permanent workers for both males and females and for every qualification level. Returns to occupation are higher for permanent than for temporal workers, and the differenceis particularly high for females.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Contributed to: Fusion of Cultures. XXXVIII Annual Conference on Computer Applications and Quantitative Methods in Archaeology – CAA2010 (Granada, Spain, Apr 6-9, 2010)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES] Este trabajo plantea y analiza, con un enfoque teórico, el papel que puede tener Internet como factor impulsor clave de la convergencia cultural entre países. En este respecto, se reflexiona en torno a una propuesta teórica central, tomando como base principal la aproximación cultural constructivista dinámica. En esencia, se teoriza sobre cómo los valores compartidos por parte de los individuos (consumidores) procedentes de diferentes culturas en este medio, fruto de procesos interactivos e iterativos de comunicación online, pueden ser transferidos de manera plausible a cada una de sus culturas primarias o de origen, fomentando, por tanto, la aproximación de las mismas en el largo plazo.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[ES] El presente trabajo presenta una experiencia aplicada que pretende conocer las opiniones, de los agentes sociales que rodean a los jóvenes deportistas, para la promoción de valores. A través de la actividad del World Café, los agentes sociales implicados en el deporte escolar aportaron orientaciones enfocadas a mejorar la calidad educativa del deporte. Un grupo de 56 participantes [padres/madres (8), árbitros (8), profesores de educación física (8), entrenadores (8), deportistas de élite (8), deportistas escolares (8) y representantes institucionales (8)] debatieron, desde su perspectiva, cómo consideraban que podían ayudar en la promoción de valores en los contextos deportivos escolares en los que participan. Entre los resultados más relevantes destacan, la necesidad de concretar desde el propio centro escolar los valores que se pretenden promocionar a través del deporte; en segundo lugar, la importancia de llevar a cabo una coordinación entre los agentes directos que rodean a los jóvenes deportistas; y finalmente, llevar a cabo una formación dirigida a monitores y padres/madres, que les permita adquirir herramientas adecuadas para la promoción de valores.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ponencia leída en el Foro de Comunicaciones IkasArt III (BEC Barakaldo, 2011.11.11)[por Skype]

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Santamaría, José Miguel; Pajares, Eterio; Olsen, Vickie; Merino, Raquel; Eguíluz, Federico (eds.)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Raquel Merino Álvarez, José Miguel Santamaría, Eterio Pajares (eds.)