'Artificial Immune Systems Tutorial'

The biological immune system is a robust, complex, adaptive system that defends the body from foreign pathogens. It is able to categorize all cells (or molecules) within the body as self-cells or non-self cells. It does this with the help of a distributed task force that has the intelligence to take action from a local and also a global perspective using its network of chemical messengers for communication. There are two major branches of the immune system. The innate immune system is an unchanging mechanism that detects and destroys certain invading organisms, whilst the adaptive immune system responds to previously unknown foreign cells and builds a response to them that can remain in the body over a long period of time. This remarkable information processing biological system has caught the attention of computer science in recent years. A novel computational intelligence technique, inspired by immunology, has emerged, called Artificial Immune Systems. Several concepts from the immune have been extracted and applied for solution to real world science and engineering problems. In this tutorial, we briefly describe the immune system metaphors that are relevant to existing Artificial Immune Systems methods. We will then show illustrative real-world problems suitable for Artificial Immune Systems and give a step-by-step algorithm walkthrough for one such problem. A comparison of the Artificial Immune Systems to other well-known algorithms, areas for future work, tips & tricks and a list of resources will round this tutorial off. It should be noted that as Artificial Immune Systems is still a young and evolving field, there is not yet a fixed algorithm template and hence actual implementations might differ somewhat from time to time and from those examples given here.

A Pre-processing Moving Mesh Method for Discontinuous Galerkin Approximations of Advection-Diffusion-Reaction Problems

We propose a pre-processing mesh re-distribution algorithm based upon harmonic maps employed in conjunction with discontinuous Galerkin approximations of advection-diffusion-reaction problems. Extensive two-dimensional numerical experiments with different choices of monitor functions, including monitor functions derived from goal-oriented a posteriori error indicators are presented. The examples presented clearly demonstrate the capabilities and the benefits of combining our pre-processing mesh movement algorithm with both uniform, as well as, adaptive isotropic and anisotropic mesh refinement.

Trabajo Final de Grado y Plan de Acción Tutorial en el curriculum del Grado en Enfermería: diseño, desarrollo y evaluación

La acción tutorial (PAT), en los estudios universitarios de Enfermería, se halla en el centro de la acción docente del profesorado. El tutor/a orienta en el proceso de aprendizaje y en la preparación del Trabajo Final de Grado (TFG). En este artículo presentamos los resultados de la investigación realizada con tutores y estudiantes, que tiene por objetivo evaluar el diseño y desarrollo del TFG, los resultados académicos y su vivencia y experiencia. Diseño mixto cuantitativo descriptivo y cualitativo de investigación acción participación. Muestra total de 124 estudiantes de 4º curso de Grado Enfermería y 37 tutores del TFG. Técnicas de recogida de datos: resultados académicos y evaluativos; 3 grupos focales con estudiantes y profesores; 3 entrevistas semiestructuradas abiertas a estudiantes. Los resultados constatan que las tipologías más elegidas fueron revisiones bibliográficas (38,75%) y Planes de cuidados (24,2%). El 63,9 % de la temática escogida es Enfermería Maternal, Pediátrica y Clínica. Estudiantes y tutores viven con dificultad la elaboración del TFG y se requiere una mayor cultura tutorial. Es un proceso complejo de organización y coordinación que, sin embargo, permite un trabajo colaborativo de todo el equipo docente.

Programación de videojuegos de puzzles en 2D usando Unity: tutorial y ejemplo práctico del juego.

Unity3d es un motor gráfico para la implementación de videojuegos creado por Unity3d Technologies que tiene el honor de ser una de las principales herramientas que propició el auge de los estudios independientes. Pese a estar enfocado al desarrollo de videojuegos en 3D, los desarrolladores lograban crear contenido en 2D a base de manipulaciones como la cámara y de utilizar herramientas no nativas. Afortunadamente, a partir de la versión 4.3 Unity3d integra herramientas nativas que facilitan esta tarea. Este proyecto consiste en la creación de un tutorial sobre la implementación de un videojuego del género puzles en 2D y enfocado a plataformas móviles, empleando para ello Unity3d y concretamente las nuevas herramientas nativas para 2D. La implementación de un videojuego es una tarea muy complicada y extensa, es por ello que en el tutorial se va a tratar la fase de diseño del videojuego y a nivel de implementación centrarse en dichas herramientas para el 2D, mostrando al final una versión jugable del videojuego implementado. Por otra parte, al ser numerosas las herramientas, es imposible tratar cada una de las herramientas aunque se intentará abarcar lo máximo posible y mencionar las que no se incluyan dentro de la implementación del videojuego. El resultado generado de este proyecto puede constituir una referencia para otras personas interesadas en aprender cómo usar Unity3d para programar videojuegos en 2D, lo cual les allanará seguramente el camino y les suavizará la curva de aprendizaje.

Inverse identification of the bending stiffness of a braided polyethylene twine subject to large deformation: application to the identification of the mesh opening rigidity of fishing nets.

The evaluation of the mesh opening stiffness of fishing nets is an important issue in assessing the selectivity of trawls. It appeared that a larger bending rigidity of twines decreases the mesh opening and could reduce the escapement of fish. Nevertheless, netting structure is complex. A netting is made up of braided twines made of polyethylene or polyamide. These twines are tied with non-symmetrical knots. Thus, these assemblies develop contact-friction interactions. Moreover, the netting can be subject to large deformation. In this study, we investigate the responses of netting samples to different types of solicitations. Samples are loaded and unloaded with creep and relaxation stages, with different boundary conditions. Then, two models have been developed: an analytical model and a finite element model. The last one was used to assess, with an inverse identification algorithm, the bending stiffness of twines. In this paper, experimental results and a model for netting structures made up of braided twines are presented. During dry forming of a composite, for example, the matrix is not present or not active, and relative sliding can occur between constitutive fibres. So an accurate modelling of the mechanical behaviour of fibrous material is necessary. This study offers experimental data which could permit to improve current models of contact-friction interactions [4], to validate models for large deformation analysis of fibrous materials [1] on a new experimental case, then to improve the evaluation of the mesh opening stiffness of a fishing net

La función tutorial ante el reto de la enseñanza online: algunas experiencias

La introducción de las TICs en los procesos de enseñanza-aprendizaje exige hacer frente al reto de su inserción y adaptación al mismo en el ámbito universitario, así como analizar las diversas estrategias formativas y comunicativas recomendadas para el uso de las TICs en la docencia. En este entorno resulta conveniente examinar el rol asignado al e-tutor o e-profesor y, como correlato, el papel del alumno en el marco de la enseñanza online del Derecho. Ello pasa por la identificación de las funciones que debe llevar a cabo el tutor online (lo que, en definitiva, contribuye a definir y reforzar los rasgos de esta figura) que, si bien deben adaptarse a la nueva metodología docente, no deben ser necesariamente distintas a las del tutor presencial. Este objetivo exige determinar las técnicas y competencias más adecuadas para la acción tutorial virtual y requiere una seria reflexión sobre el uso de las herramientas disponibles para este fin, cuestión conectada con las innumerables ventajas de las TICs para la comunicación profesor-alumno (sin olvidar la necesidad de superar también algunos problemas). Se trata de aprovechar el e-learning para imprimir un cambio en la metodología docente respecto del rol que está llamado a desempeñar el e-tutor. Todo ello parte de nuestra experiencia en esta materia.

La acción tutorial en los trabajos de fin de grado: análisis de su funcionamiento en la Titulación de Grado en Derecho de la Universidad de Málaga

En los nuevos planes de estudio la función tutorial alcanza un papel clave en el proceso de aprendizaje del estudiante. A diferencia del viejo concepto de acción tutorial que existía en los antiguos estudios de licenciatura, actualmente la tutorización del estudiante por parte del profesor es parte esencial de su profesor de aprendizaje. En el caso de los trabajos fin de grado esta función toma un mayor protagonismo al ser necesario que el profesor realice un seguimiento del alumno para orientarle desde su inicio hasta la finalización del trabajo fin de grado. A través de este trabajo expondremos cuáles son las funciones que el profesor-tutor debe desarrollar durante la tutorización del trabajo fin de grado y cuál es la valoración que podemos realizar de su regulación y funcionamiento en la titulación de Grado en Derecho de la Universidad de Málaga, tras dos años de experiencia.

Aplicación de redes Mesh en el área de videovigilancia y ampliación de zonas Wi-Fi en el municipio de San José las Flores, Chalatenango

El trabajo describe la aplicación de redes Mesh (tecnología inalámbrica) en campos de la videovigilancia y ampliación de zonas Wi-Fi, basado en la realización de una red prototipo capaz de soportar tales servicios, todo esto aplicado al caso de estudio del municipio de San José las Flores, Chalatenango, comunidad de escasos recursos, pues uno de los principales objetivo de este trabajo es hacer accesible esta tecnología a las municipalidades más pobres, para ello se utilizaron herramientas y software libres, dejando plasmado en el documento las factibilidades económicas, técnica y operativa, así como los resultados obtenidos durante la investigación

Mesh Adaption for Tracking Vortex Structures in OVERTURNS Simulation of the S-76 Rotor in Hover

The constant need to improve helicopter performance requires the optimization of existing and future rotor designs. A crucial indicator of rotor capability is hover performance, which depends on the near-body flow as well as the structure and strength of the tip vortices formed at the trailing edge of the blades. Computational Fluid Dynamics (CFD) solvers must balance computational expenses with preservation of the flow, and to limit computational expenses the mesh is often coarsened in the outer regions of the computational domain. This can lead to degradation of the vortex structures which compose the rotor wake. The current work conducts three-dimensional simulations using OVERTURNS, a three-dimensional structured grid solver that models the flow field using the Reynolds-Averaged Navier-Stokes equations. The S-76 rotor in hover was chosen as the test case for evaluating the OVERTURNS solver, focusing on methods to better preserve the rotor wake. Using the hover condition, various computational domains, spatial schemes, and boundary conditions were tested. Furthermore, a mesh adaption routine was implemented, allowing for the increased refinement of the mesh in areas of turbulent flow without the need to add points to the mesh. The adapted mesh was employed to conduct a sweep of collective pitch angles, comparing the resolved wake and integrated forces to existing computational and experimental results. The integrated thrust values saw very close agreement across all tested pitch angles, while the power was slightly over predicted, resulting in under prediction of the Figure of Merit. Meanwhile, the tip vortices have been preserved for multiple blade passages, indicating an improvement in vortex preservation when compared with previous work. Finally, further results from a single collective pitch case were presented to provide a more complete picture of the solver results.

Error estimation and adaptive mesh refinement for aerodynamic flows

This lecture course covers the theory of so-called duality-based a posteriori error estimation of DG finite element methods. In particular, we formulate consistent and adjoint consistent DG methods for the numerical approximation of both the compressible Euler and Navier-Stokes equations; in the latter case, the viscous terms are discretized based on employing an interior penalty method. By exploiting a duality argument, adjoint-based a posteriori error indicators will be established. Moreover, application of these computable bounds within automatic adaptive finite element algorithms will be developed. Here, a variety of isotropic and anisotropic adaptive strategies, as well as $hp$-mesh refinement will be investigated.

Spectral-based mesh segmentation

In design and manufacturing, mesh segmentation is required for FACE construction in boundary representation (BRep), which in turn is central for featurebased design, machining, parametric CAD and reverse engineering, among others -- Although mesh segmentation is dictated by geometry and topology, this article focuses on the topological aspect (graph spectrum), as we consider that this tool has not been fully exploited -- We preprocess the mesh to obtain a edgelength homogeneous triangle set and its Graph Laplacian is calculated -- We then produce a monotonically increasing permutation of the Fiedler vector (2nd eigenvector of Graph Laplacian) for encoding the connectivity among part feature submeshes -- Within the mutated vector, discontinuities larger than a threshold (interactively set by a human) determine the partition of the original mesh -- We present tests of our method on large complex meshes, which show results which mostly adjust to BRep FACE partition -- The achieved segmentations properly locate most manufacturing features, although it requires human interaction to avoid over segmentation -- Future work includes an iterative application of this algorithm to progressively sever features of the mesh left from previous submesh removals

Triangular mesh parameterization with trimmed surfaces

Given a 2manifold triangular mesh \(M \subset {\mathbb {R}}^3\), with border, a parameterization of \(M\) is a FACE or trimmed surface \(F=\{S,L_0,\ldots, L_m\}\) -- \(F\) is a connected subset or region of a parametric surface \(S\), bounded by a set of LOOPs \(L_0,\ldots ,L_m\) such that each \(L_i \subset S\) is a closed 1manifold having no intersection with the other \(L_j\) LOOPs -- The parametric surface \(S\) is a statistical fit of the mesh \(M\) -- \(L_0\) is the outermost LOOP bounding \(F\) and \(L_i\) is the LOOP of the ith hole in \(F\) (if any) -- The problem of parameterizing triangular meshes is relevant for reverse engineering, tool path planning, feature detection, redesign, etc -- Stateofart mesh procedures parameterize a rectangular mesh \(M\) -- To improve such procedures, we report here the implementation of an algorithm which parameterizes meshes \(M\) presenting holes and concavities -- We synthesize a parametric surface \(S \subset {\mathbb {R}}^3\) which approximates a superset of the mesh \(M\) -- Then, we compute a set of LOOPs trimming \(S\), and therefore completing the FACE \(F=\ {S,L_0,\ldots ,L_m\}\) -- Our algorithm gives satisfactory results for \(M\) having low Gaussian curvature (i.e., \(M\) being quasi-developable or developable) -- This assumption is a reasonable one, since \(M\) is the product of manifold segmentation preprocessing -- Our algorithm computes: (1) a manifold learning mapping \(\phi : M \rightarrow U \subset {\mathbb {R}}^2\), (2) an inverse mapping \(S: W \subset {\mathbb {R}}^2 \rightarrow {\mathbb {R}}^3\), with \ (W\) being a rectangular grid containing and surpassing \(U\) -- To compute \(\phi\) we test IsoMap, Laplacian Eigenmaps and Hessian local linear embedding (best results with HLLE) -- For the back mapping (NURBS) \(S\) the crucial step is to find a control polyhedron \(P\), which is an extrapolation of \(M\) -- We calculate \(P\) by extrapolating radial basis functions that interpolate points inside \(\phi (M)\) -- We successfully test our implementation with several datasets presenting concavities, holes, and are extremely nondevelopable -- Ongoing work is being devoted to manifold segmentation which facilitates mesh parameterization