Extended ageing time and temperature effects on quality of sub-primal cuts of boxed beef

[EN]Most of the information indicating ageing improves tenderness has been collected on the loin and rib-eye muscles over relatively short ageing times, assuming that all muscles will react similarly. In the present study, the effect of extended ageing times on instrumental texture (56 d) and sensory characteristics (42 d) of six different beef sub-primals [striploin (SL), inside round (IR), outside round (OR), eye of round (ER), blade eye (BE) and chuck tender (CT)] was studied. The effects of two ageing temperatures (1and 58C) were also compared. In general, ageing increased tenderness (P<0.05) of SL, BE, ER and CT sub-primals, although BE shear force increased after 42 d of ageing. On the other hand, ageing had no effect on IR tenderness (P<0.05) and resulted in a decrease in tenderness of OR (P<0.05) until day 35, with a later increase after 42 d of ageing. Increasing ageing temperature (58C) had limited effect on tenderness, but ageing time and temperature increases led to lower flavour and higher off-flavour intensity (P<0.05) of the studied sub-primals. These results suggest that cutspecific maximum ageing times and rigid adherence to temperature maximums would be of benefit to optimize postslaughter processes and meat quality

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.

Parada en boxes: juego Formula 1 para Android

Juego de reflejos y habilidad para dispositivos con SO Android. Este proyecto consiste en la creación de un juego utilizando todas las herramientas posibles proporcionadas por Android. El juego se diseñará en 2 dimensiones, contará de un menú inicial donde se podrá elegir entre las opciones; Jugar, Puntuaciones y Ayuda. La parte de jugar llevará todo el peso de la aplicación y es donde se desarrollará toda la acción. Habrá que hacer transiciones entre distintas pantallas para cada uno de los distintos mini juegos. Además, llevará la cuenta del tiempo transcurrido con un preciso cronometro. El reloj de parará cuando se hayan terminado todas las pruebas. Si ha superado alguno de los mejores tiempos, guardaremos el record en el lugar que le corresponde. La parte de las puntuaciones mostrará los cinco mejores tiempos realizados en el juego. Estos tiempos seguirán guardados aún reiniciando la aplicación. La parte de ayuda mostrará las instrucciones de cada prueba; donde, cuándo, y de qué manera tienes que pulsar en cada momento. Hay que tener en cuenta que esta aplicación de desarrollará para versiones de Android 2.1 o superiores, así que es necesario basarse en API’s para estas versiones, y que no se debe necesitar nada más que el archivo de instalación (.apk) para poder disfrutar de el juego en cualquier terminal.

Análisis y mejora de la gestión y organización del equipo Formula Student Bizkaia usando como referencia el modelo EFQM

[ES]El presente trabajo de fin de grado tiene como objetivo analizar y mejorar la gestión y organización del equipo Formula Student Bizkaia, de tal manera que le permita ser más competitivo frente al resto de universidades. Para su realización, en primer lugar, se exponen las distintas alternativas que existen para evaluar la calidad de gestión del equipo. En segundo lugar, una vez se haya escogido el modelo más conveniente, se prosigue al estudio de los distintos criterios clave en los que se basa. En tercer lugar, cuando se haya llevado a cabo el estudio de los puntos fuertes, así como evidencias y áreas a mejorar, se procede a realizar una evaluación que permita determinar las fortalezas y debilidades, para de esta manera potenciarlas y solventarlas, respectivamente. Por último, se presenta un desglose de los gastos que conlleva realizar la elaboración de un estudio de estas características, así como un desglose de las diferentes tareas a llevar a cabo y su respectiva duración.

Estudio del comportamiento aerodinámico de un alerón trasero de un monoplaza tipo Formula Student

[ES]El proyecto investigador tiene el objeto el estudio del comportamiento de un perfil aerodinámico frente a un flujo turbulento, en este caso el aire. Se trata de evaluar las presiones que se ejercen sobre dicho perfil, que será un alerón de monoplaza tipo Formula Student, para comprobar si aporta alguna mejora en el comportamiento del monoplaza la introducción de este paquete aerodinámico. Con la introducción de este perfil en el monoplaza se pretende ganar un mayor agarre en el paso por curva siendo la resistencia al avance en recta la mínima posible, ya que lo que se pretende es hacer el recorrido del circuito en el menor tiempo posible. Por tanto hay dos variables a tener en cuenta a la hora de diseñar el alerón, por un lado esta mejorar el agarre de los neumáticos sobre el asfalto al tomar una curva, lo que nos permitirá tomar la curva a mayor velocidad y por tanto en menos tiempo, y por otro lado, la oposición que el alerón ejerce en el avance en recta disminuyendo su velocidad máxima. En resumen, se trata de comparar la fuerza horizontal y la fuerza vertical que el aire ejerce sobre el perfil aerodinámico a introducir en el monoplaza y evaluar si es beneficioso para este, es decir, si añadiendo dicho perfil se realiza el trazado del circuito en menor tiempo que sin él. Para ello se realizarán simulaciones con un software de modelado físico de flujos y turbulencias sobre un diseño de un alerón dado, con diferentes tipos de flujo, de forma que se asemeje de mejor forma a las condiciones de la pista y se obtendrán los resultados de las presiones que el flujo de aire ejerce sobre las superficies del perfil. Después se obtendrán las fuerzas puntuales vertical y horizontal y se analizaran los datos obtenidos. Deberán tenerse en cuenta, además de los resultados obtenidos, los materiales a emplear a la hora de su fabricación, el proceso de dicha fabricación y el coste que supone tanto el proceso como los materiales empleados.

Synthesis and structural characterisation of [Cu2[(PDC)2(bpa)(H2O)2]•nH2O•mDMF (n=3 and m=1 for 1, n=7 and m=0 for 2, PDC=2,5-pyrindinedicarboxylate and bpa= 1,2-di(4-pyridil)ethane))

[EN] Combination of polycarboxylate anions and dipyridyl ligands is an effective strategy to produce solid coordination frameworks (SCF) which are crystalline materials based on connections between metal ions through organic ligands. In this sense, combination of polycarboxylate anions and dipyridyl ligands is an effective strategy to produce extended structures. In this context, this work is focused on two novel CuII-based SCFs exhibiting PDC (2,5-pyridinedicarboxylate) and bpa (1,2-di(4-pyridyl)ethane), being the first structures reported in literature containing both ligands. Chemical formula are [Cu2[(PDC)2(bpa)(H2O)2]•3H2O•DMF (1), and [Cu2(PDC)2(bpa)(H2O)2]•7H2O (2), where DMF is dimethylformamide. Compounds 1 and 2 have been characterized by means of XRD, IR, TG/DTG, and DTA analysis.