Determinants of self-reported smoking and misclassification during pregnancy, and analysis of optimal cut-off points for urinary cotinine: a cross-sectional study

10 p.

Scenario Cluster Lagrangian Decomposition in two stage stochastic mixed 0-1 optimization

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Una longeva técnica forestal: los trasmochos o desmochos guiados en Guipúzcoa durante la Edad Moderna

[ES] A fin de garantizar el aprovechamiento deun recurso renovable como la madera, en un momento de retroceso forestal y escasez de materiales, los habitantes de la provincia de Guipúzcoa, ante lo exiguo de su territorio, arbitraron un sistema que permitió combinar las necesidades y demandas de actividades tan dispares como la ganadería, el consumo doméstico, la siderurgia o la construcción naval. El presente artículo pretende analizar el origen, desarrollo y desaparición de los trasmochos guiados y describir su técnica en el territorio guipuzcoano. A falta de mayores evidencias, parece que la técnica del trasmochado o desmochado guiado inició su andadura en la Baja Edad Media, aunque hasta las primeras décadas del siglo XVI no existen datos documentales de su utilización en territorio guipuzcoano. Su generalización en todo el territorio guipuzcoano no parece producirse definitivamente hasta finales del siglo XVII, aunque para entonces se venía aplicando en la costa y el sector oriental de la reclamaciones de las autoridades reales y territoriales, la obligación de dejar horca y pendón se encontró con la oposición de carboneros y ferrones, quienes trasmochaban los árboles pero sin guiarlos, perjudicando de ese modo a las autoridades e intereses de la Marina Real. Precisamente el incumplimiento de las ordenanzas fue lo que provocó la aparición de dos modelos, con usos diferenciados: trasmochos sin guiar y trasmochos guiados. A lo largo del siglo XIX dicha técnica se fue perdiendo, coincidiendo con la paulatina desaparición de la construcción naval en madera.

Early Functional Deficit and Microglial Disturbances in a Mouse Model of Amyotrophic Lateral Sclerosis

11 p.

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.

Use of generalised additive models to categorise continuous variables in clinical prediction

13 P.

Fiabilidad de diferentes pruebas que se utilizan para evaluar el riesgo de lesión del miembro inferior en mujeres deportistas

233 p. : il. + anexo (247 p.)

Households WTP for the Reliability of Gas Supply

26 p.

Comparación de la rugosidad media y máxima obtenida mediante diferentes instrumentos: análisis del filtro y Lc empleados

[ES]Este trabajo pretende analizar la influencia que tiene la longitud de corte elegida y el filtro empleado en la medida de la rugosidad. Se realizan medidas de rugosidad en tres probetas que han sido sometidas a diferentes procesos de fabricación (fresado, rectificado y electroerosión). Además, se utilizan tres instrumentos diferentes para la medición. Tras realizar las medidas, se comparan los resultados y se extraen las conclusiones

Análisis de la fabricación de las tijas de una motocicleta de competición. Prototipo

[ES]Este trabajo fin de grado, TFG en adelante, consiste en el análisis de la fabricación de las tijas de una motocicleta de competición Motostudent. Se trata de conseguir fabricar las tijas de una manera óptima, tanto en que su material como el proceso de fabricación sea el más adecuado para su función siendo, además, lo más económico posible. Para llevar a cabo este trabajo es necesario conocer las cualidades que una tija debe cubrir en una motocicleta de competición. A partir de dichas cualidades se selecciona el material idóneo de entre otros muchos, estudiando las propiedades fiscas, químicas y mecánicas de cada uno de ellos. También se hará un estudio de dos alternativas de fabricación posibles, electroerosión y arranque de viruta con herramienta, para a posteriori elegir la más indicada. La idea no es construir un diseño final para la fabricación, sino un prototipo sobre el cual hacer las pruebas oportunas y posteriormente realizar cambios y mejoras para posteriores ediciones. El presente proyecto marcará las pautas de diseño y el proceso a seguir durante la fabricación de las tijas que el equipo representante de la Escuela técnica superior de Bilbao, ETSIB en adelante, empleará en la futura competición.

Fraccionamiento del licor gastado en pasteado al sulfito ácido mediante ultrafiltración

Lignosulphonates (LS) and fermentable sugars are the main components of spent sulphite liquors (SSL) produced in acid sulphite pulping. In spite of different methods have been used for spent liquor fractionation such as precipitation or vaporization; membrane technology allows the separation of these components from the SSL due to their different size molecular weight, offering great advantages with regards to the traditionally methods (less energy consumption, high selective separation, and many others). In the present study, ceramic membranes with different cut-offs (15 kDa, 5 kDa and 1 kDa) were used to achieve the sugar purification and the LS concentration. The membranes were evaluated according to their efficacy and efficiency properties. Different series system were tested in order to improve the aptitudes of a singular membrane. The system with the three membranes in series (15, 5 and 1 kDa respectively) obtained the most purified permeate stream, referred to the sugar content. Also, a characterisation of the LS contained in the different streams produced in this system was carried out in order to know in a more precise manner the valorisation potential of these components by means of biorefinery processes.

Optimización del proceso de producción del tubo vástago de un amortiguador Mcpherson: Caracterización del proceso de producción, metalográfica y propiedades mecánicas.

[ES]En este proyecto se va analizar metalúrgicamente todo el proceso de un tubo vástago para amortiguadores. El tubo a analizar es un tubo fabricado en Hijos de Juan Garay SA (HJG). Para analizar cada fase de fabricación del tubo, se cortan probetas en cada fase y se mandan a analizar a IK4-Azterlan. Con ello se obtiene la caracterización metalográfica y mecánica en cada momento, por lo tanto, analizando como conjunto todo los análisis de cada etapa de fabricación se podrá observar los cambios producidos en el tubo y obtener conclusiones para mejor sus proceso de producción.

Análisis de los requisitos de microfresado de un molde para fabricar microlentes.

[Es]Este documento muestra un análisis de los requisitos para el micro-fresado de un molde. Es importante remarcar que este molde será usado para producir micro-lentes. La herramienta realizará una matriz de cavidades en una pieza cilíndrica y el tamaño de estas coincidirá con el tamaño de las microlentes. Este proyecto será programado mediante el software de MATLAB. El objetivo es calcular tanto la trayectoria de la herramienta, como su inclinación, velocidad, aceleración y jerk. Además este programa calculará las fuerzas de corte en cada instante del mecanizado. Por último, cabe mencionar que los resultados de este proyecto darán soporte a otros proyectos.

Caracterización del error en el corte de desbaste de trayectorias circulares mediante WEDM.

[ES]En la actualidad el proceso de mecanizado mediante electroerosión por hilo (WEDM) posee varias problemáticas a la hora de la ejecución de los cortes para producir diferentes formas, ya sean esquinas, radios de redondeo o de acuerdo y por último la realización de círculos. Es por ello por lo que se elabora el presente trabajo cuya finalidad es llegar a caracterizar los errores cometidos en el corte de desbaste de probetas con trayectorias circulares y tecnología estándar. De esta manera se podrá cuantificar las desviaciones que se producen en las piezas en función del espesor y de sus radios. Toda la información obtenida en el trabajo permitirá una futura actuación en diversos parámetros máquina, elaborando nuevas tecnologías o bien poder mitigarlos realizando correcciones geométricas, ajustando sus tolerancias.

Proposal and validation of methodologies for the categorisation of continuous variables in the development of prediction models

158 p.