Evaluación del programa modular de autoaprendizaje Cómo buscar empleo.

1. Fundamentar el programa de orientación profesional 'Cómo buscar un empleo' desde un punto de vista teórico-científico. 2. Evaluarlo como instrumento potente capaz de dotar al individuo de las competencias implicadas en la tarea de buscar empleo.. 50 personas inscritas en la oficina de empleo, divididas en dos grupos: grupo 1 (aprendizaje grupal) y grupo 2 (autoaprendizaje) compuestos por 16 y 34 sujetos respectivamente.. Se analiza un primer plan piloto de intervención formativa con dos grupos sometidos cada uno a un tipo de tratamiento y se obtienen unos resultados. Se trata de comprobar si hay cambios y si éstos están en relación con las hipótesis de partida. Se elabora un cuestionario de conocimientos en la búsqueda de empleo y se aplica a todos los sujetos de los dos grupos antes y después de la intervención.. Diferencial semántico de Osgood para analizar la actitud hacia el programa aplicado. Cuestionario de conocimientos en la búsqueda de empleo.. Análisis del rendimiento: análisis de equivalencia entre ambos grupos en el pretest, análisis de diferencias entre ambos grupos en el posttest, análisis de la ganancia media pretest-posttest en el grupo 1 y 2. Análisis de actitudes: contraste de medias.. Análisis del rendimiento: no existen diferencias significativas en la variable dependiente en el pretest entre ambos grupos. Existen diferencias en la variable dependiente en el pretest entre ambos grupos a favor del grupo tratado con aprendizaje formal. Tanto los sujetos del grupo 1 como los del grupo 2 son significativamente mejores en la variable dependiente en el posttest que el pretest. Análisis de las actitudes: existen diferencias significativas en las escalas práctico-teórico, pasivo-activo, útil-inútil, malo-bueno, estático-dinámico y oportuno-inoportuno en cuanto a actitudes hacia el programa entre los dos grupos a favor del grupo 1 que puntúa más alto en estas escalas.. 1. El programa parece adaptado al nivel de estudios de la muestra. 2. Todo el material es bien recibido. 3. La aplicación del programa produce una mejora, sobre todo en conocimientos. 4. Los resultados obtenidos en el grupo 1 tratado con aprendizaje grupal resultan ser mejores, tanto en conocimientos como en actitudes, hacia el programa que los obtenidos en el grupo 2 tratado con autoaprendizaje. En posteriores estudios se procurará dar continuidad y profundización al presente trabajo en los aspectos siguientes: ver si las conclusiones se corroboran en otros grupos; hacer un seguimiento de los sujetos diana para ver si las modificaciones derivadas del tratamiento tienen una relación demostrable con el paso del tiempo; determinar modificaciones o tratamientos diferenciales a introducir en algunos módulos del programa; comprobar qué competencias se logran más y cuáles menos con el programa; tratar de probar nuevas metodologías, tales como los sistemas interactivos..

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming

We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed.

Design and Development of 3-DOF Modular Micro Parallel Kinematic Manipulator

This paper presents the research and development of a 3-legged micro Parallel Kinematic Manipulator (PKM) for positioning in micro-machining and assembly operations. The structural characteristics associated with parallel manipulators are evaluated and the PKMs with translational and rotational movements are identified. Based on these identifications, a hybrid 3-UPU (Universal Joint-Prismatic Joint-Universal Joint) parallel manipulator is designed and fabricated. The principles of the operation and modeling of this micro PKM is largely similar to a normal size Stewart Platform (SP). A modular design methodology is introduced for the construction of this micro PKM. Calibration results of this hybrid 3-UPU PKM are discussed in this paper.

Desarrollo de la teoría modular aplicada al desarrollo curricular.

Estudiar la teoría modular de desarrollo curicular basada en la utilización de paquetes curriculares de aprendizaje y presentar un desarrollo práctico de una programación a partir de los sistemas de paquetes curriculares. Se hace en primer lugar un estudio teórico de la teoría modular y de otro modelo curricular denominado cognitivo. Se hace un estudio comparativo de ambos modelos viendo lo que aporta cada uno de ellos y por ultimo se presenta un ejemplo de programación de un paquete curricular. Tras este estudio teórico sería conveniente llevar a la práctica esta teoría con un grupo de alumnos y comparar con otros grupos que tengan otras programaciones para hacer comparaciones estadísticas de los datos.

Behavioral Measures and their Correlation with IPM Iteration Counts on Semi-Definite Programming Problems

We study four measures of problem instance behavior that might account for the observed differences in interior-point method (IPM) iterations when these methods are used to solve semidefinite programming (SDP) problem instances: (i) an aggregate geometry measure related to the primal and dual feasible regions (aspect ratios) and norms of the optimal solutions, (ii) the (Renegar-) condition measure C(d) of the data instance, (iii) a measure of the near-absence of strict complementarity of the optimal solution, and (iv) the level of degeneracy of the optimal solution. We compute these measures for the SDPLIB suite problem instances and measure the correlation between these measures and IPM iteration counts (solved using the software SDPT3) when the measures have finite values. Our conclusions are roughly as follows: the aggregate geometry measure is highly correlated with IPM iterations (CORR = 0.896), and is a very good predictor of IPM iterations, particularly for problem instances with solutions of small norm and aspect ratio. The condition measure C(d) is also correlated with IPM iterations, but less so than the aggregate geometry measure (CORR = 0.630). The near-absence of strict complementarity is weakly correlated with IPM iterations (CORR = 0.423). The level of degeneracy of the optimal solution is essentially uncorrelated with IPM iterations.

Introduction to JavaScript Programming

These are the resources for an introductory lecture in JavaScript programming. Exercises are provided to practice simple JavaScript programming, including a template for a DHTML implementation of Conway's Game of Life (with encrypted solution).

Mathematical Programming

Exam questions and solutions for a third year mathematical programming course.

Programming & Software

An overview of programming and software development.

Programming Principles: Starting Out

In this lecture we describe the structure of the Programming Principles course at Southampton, look at the definitions and paradigms of programming, and take a look ahead to the key things that we will be covering in the weeks ahead.

Programming Principles: Introduction to Java

In this lecture we look at key concepts in Java: how to write, compile and run Java programs, define a simple class, create a main method, and use if/else structures to define behaviour.

Programming Principles: Variables, Primitives, Objects and Scope

In this session we look more closely at the way that Java deals with variables, and in particular with the differences between primitives (basic types like int and char) and objects. We also take an initial look at the scoping rules in Java, which dictate the visibility of variables in your program