3D line drawing from point clouds using chromatic stereo and shading

1 PDF document (8 pp., English).-- Contributed to: VSMM'08: 14th International Conference on Virtual Systems and Multimedia (Limassol, Cyprus, Oct 20-25, 2008)

La supervisión de la práctica profesional socioeducativa

[Es] La supervisión es uno de los métodos de desarrollo profesional de las profesiones de ayuda, ya que se manifiesta particularmente funcional en las profesiones en las que es importante el manejo de las relaciones: se dirige hacia el desarrollo de profesionales altamente integrados y competentes. Tras la revisión crítica de los diferentes enfoques de supervisión que históricamente se han desarrollado, se presenta un modelo integrativo de supervisión en grupo, que se mueve en la perspectiva crítica de la formación, exponiendo las bases teóricas en que se fundamenta, el desarrollo del proceso y las funciones del supervisor, así como algunas estrategias y técnicas propias de esta supervisión.

Una iniciativa social en la recuperación textil que genera empleo: Berohi S. Coop.

[ES] El incremento del consumo de ropa provoca que año a año aumente el volumen de ropa desechada, y con éste, la conciencia sobre la necesidad de reutilizar dicho recurso. Berohi S. Coop. es una de las empresas dedicadas a la recuperación y reciclaje del textil usado, con origen en Bizkaia. La concepción inicial y desarrollo del proyecto empresarial Berohi S. Coop. constituyen el eje central del caso.

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.

Fishing Long-Fingered Bats (Myotis capaccinii) Prey Regularly upon Exotic Fish

7 p.

FTT-MA: A Flexible Time-Triggered Middleware Architecture for Time Sensitive, Resource-Aware AmI Systems

There is an increasing number of Ambient Intelligence (AmI) systems that are time-sensitive and resource-aware. From healthcare to building and even home/office automation, it is now common to find systems combining interactive and sensing multimedia traffic with relatively simple sensors and actuators (door locks, presence detectors, RFIDs, HVAC, information panels, etc.). Many of these are today known as Cyber-Physical Systems (CPS). Quite frequently, these systems must be capable of (1) prioritizing different traffic flows (process data, alarms, non-critical data, etc.), (2) synchronizing actions in several distributed devices and, to certain degree, (3) easing resource management (e.g., detecting faulty nodes, managing battery levels, handling overloads, etc.). This work presents FTT-MA, a high-level middleware architecture aimed at easing the design, deployment and operation of such AmI systems. FTT-MA ensures that both functional and non-functional aspects of the applications are met even during reconfiguration stages. The paper also proposes a methodology, together with a design tool, to create this kind of systems. Finally, a sample case study is presented that illustrates the use of the middleware and the methodology proposed in the paper.

Somatisation in primary care: experiences of primary care physicians involved in a training program and in a randomised controlled trial

Background: A new intervention aimed at managing patients with medically unexplained symptoms (MUS) based on a specific set of communication techniques was developed, and tested in a cluster randomised clinical trial. Due to the modest results obtained and in order to improve our intervention we need to know the GPs' attitudes towards patients with MUS, their experience, expectations and the utility of the communication techniques we proposed and the feasibility of implementing them. Physicians who took part in 2 different training programs and in a randomised controlled trial (RCT) for patients with MUS were questioned to ascertain the reasons for the doctors' participation in the trial and the attitudes, experiences and expectations of GPs about the intervention. Methods: A qualitative study based on four focus groups with GPs who took part in a RCT. A content analysis was carried out. Results: Following the RCT patients are perceived as true suffering persons, and the relationship with them has improved in GPs of both groups. GPs mostly valued the fact that it is highly structured, that it made possible a more comfortable relationship and that it could be applied to a broad spectrum of patients with psychosocial problems. Nevertheless, all participants consider that change in patients is necessary; GPs in the intervention group remarked that that is extremely difficult to achieve. Conclusion: GPs positively evaluate the communication techniques and the interventions that help in understanding patient suffering, and express the enormous difficulties in handling change in patients. These findings provide information on the direction in which efforts for improving intervention should be directed.

Making object-oriented databases more knowledgeable (From ADAM to ABEL)

Tesis leida en la Universidad de Aberdeen. 178 p.

Sistema de control reconfigurable en célula de manipulación

[ES]Este trabajo trata sobre los sistemas de control reconfigurables. El objetivo es conseguir que el sistema de control siga controlando el proceso antes situaciones de cambio solicitadas por el usuario o ante situaciones de fallo en los controladores. Se aplicará sobre la primera estación de la célula de manipulación didáctica FMS 200 del laboratorio del Departamento de Ingeniería de Sistemas y Automática (DISA) de la ETSI de Bilbao.

Propuesta de catálogo para la selección de rodamientos de vuelco en aplicaciones cuasiestáticas

[ES]La propuesta de catálogo realizada en este proyecto, cuyo objetivo es convertirse en el catálogo de la empresa de rodamientos Iraundi S.A., constará de dos partes. La primera de ellas será una parte teórica e informativa que incluirá toda la información necesaria sobre la manipulación, montaje, mantenimiento y selección del tipo de rodamiento. Para ello se ha recabado información tanto del propio catálogo de Iraundi S.A., como de varios de los fabricantes de rodamientos más importantes del momento, como son INA, GOIMO, ROTHE-ERDE, y SKF. La segunda parte del catálogo lo formaran las tablas y gráficas de selección de rodamiento. Estas gráficas han sido renovadas con respecto al catálogo existente, y se ha tratado de conseguir unas gráficas que sean fáciles de interpretar, y que de manera sencilla se puedan obtener los tamaños y tipos de rodamiento adecuados, dependiendo de la aplicación de funcionamiento y de las fuerzas radiales, axiales y de momento que estos vayan a soportar. Éstas gráficas han sido calculadas exclusivamente para este proyecto, y validadas mediante la aplicación de elementos finitos, de los que finalmente se han obtenido unas gráficas que simplifican la selección óptima del rodamiento, y que tienen en cuenta el esfuerzo axial, radial, y momento que soportará el rodamiento, así como las fuerzas que serán capaces de soportar los tornillos empleados para el anclaje.

Advantages and Versatility of Fluorescence-Based Methodology to Characterize the Functionality of LDLR and Class Mutation Assignment

Familial hypercholesterolemia (FH) is a common autosomal codominant disease with a frequency of 1:500 individuals in its heterozygous form. The genetic basis of FH is most commonly mutations within the LDLR gene. Assessing the pathogenicity of LDLR variants is particularly important to give a patient a definitive diagnosis of FH. Current studies of LDLR activity ex vivo are based on the analysis of I-125-labeled lipoproteins (reference method) or fluorescent-labelled LDL. The main purpose of this study was to compare the effectiveness of these two methods to assess LDLR functionality in order to validate a functional assay to analyse LDLR mutations. LDLR activity of different variants has been studied by flow cytometry using FITC-labelled LDL and compared with studies performed previously with I-125-labeled lipoproteins. Flow cytometry results are in full agreement with the data obtained by the I-125 methodology. Additionally confocal microscopy allowed the assignment of different class mutation to the variants assayed. Use of fluorescence yielded similar results than I-125-labeled lipoproteins concerning LDLR activity determination, and also allows class mutation classification. The use of FITC-labelled LDL is easier in handling and disposal, cheaper than radioactivity and can be routinely performed by any group doing LDLR functional validations.

Helmholtz Fermi surface harmonics: an efficient approach for treating anisotropic problems involving Fermi surface integrals

We present a new efficient numerical approach for representing anisotropic physical quantities and/or matrix elements defined on the Fermi surface (FS) of metallic materials. The method introduces a set of numerically calculated generalized orthonormal functions which are the solutions of the Helmholtz equation defined on the FS. Noteworthy, many properties of our proposed basis set are also shared by the FS harmonics introduced by Philip B Allen (1976 Phys. Rev. B 13 1416), proposed to be constructed as polynomials of the cartesian components of the electronic velocity. The main motivation of both approaches is identical, to handle anisotropic problems efficiently. However, in our approach the basis set is defined as the eigenfunctions of a differential operator and several desirable properties are introduced by construction. The method is demonstrated to be very robust in handling problems with any crystal structure or topology of the FS, and the periodicity of the reciprocal space is treated as a boundary condition for our Helmholtz equation. We illustrate the method by analysing the free-electron-like lithium (Li), sodium (Na), copper (Cu), lead (Pb), tungsten (W) and magnesium diboride (MgB2)