Valor predictivo de los tests Boehm y Peabody en la detecci??n de futuras dificultades escolares en orden a una intervenci??n preventiva y compensadora

Se analiza la medida en que las pruebas psicopedag??gicas Boehm y Peabody predicen las dificultades en el ??mbito lectoescritor que pueden presentarse en el alumnado de Primaria. Para ello se ha desarrollado un estudio de tipo correlacional en el que se han reunido datos de alumnos desde su ingreso en la Educaci??n Infantil hasta su escolarizaci??n en el segundo ciclo de Educaci??n Primaria. La informaci??n obtenida tiene por tanto, un car??cter diacr??nico. El informe est?? constituido por una breve alusi??n te??rica al problema que se trata para situarse en el lugar preciso donde se centra la investigaci??n, descripci??n de la metodolog??a de investigaci??n, resultados y conclusiones, la discusi??n de los resultados y las propuestas. Se recogen tambi??n la bibliograf??a usada y el estudio de an??lisis de los casos utilizados. Las conclusiones afirman que existe una correlaci??n estad??sticamente significativa entre los tests Peabody y Boehm. Las correlaciones m??s altas son las que implican, de una parte a los tests Peabody y Boehm y, de otra, a las notas escolares de segundo ciclo de Educaci??n Primaria en Matem??ticas y Lengua. Las notas escolares obtenidas por los alumnos del primer ciclo de Educaci??n Primaria en Lengua y Matem??ticas no tienen una correlaci??n estad??sticamente significativa con los tests Boehm y Peabody. En el primer ciclo de Educaci??n Primaria, s??lo el test Peaboy permite predecir las notas escolares en Lengua y Matem??ticas. Estimar y determinar el rendimiento de los alumnos en las citadas asignaturas tomando como punto de partida s??lo los datos aportados por el test Peabody resulta desaconsejable dado el escaso poder predictivo de dicho test. El test Boehm, por su parte, tiene a??n menos poder predictivo sobre las notas escolares y, en el presente estudio, aparece como un mal predictor.

Optimal Unsupervised Learning in Feedforward Neural Networks

We investigate the properties of feedforward neural networks trained with Hebbian learning algorithms. A new unsupervised algorithm is proposed which produces statistically uncorrelated outputs. The algorithm causes the weights of the network to converge to the eigenvectors of the input correlation with largest eigenvalues. The algorithm is closely related to the technique of Self-supervised Backpropagation, as well as other algorithms for unsupervised learning. Applications of the algorithm to texture processing, image coding, and stereo depth edge detection are given. We show that the algorithm can lead to the development of filters qualitatively similar to those found in primate visual cortex.

Sequential Optimal Recovery: A Paradigm for Active Learning

In most classical frameworks for learning from examples, it is assumed that examples are randomly drawn and presented to the learner. In this paper, we consider the possibility of a more active learner who is allowed to choose his/her own examples. Our investigations are carried out in a function approximation setting. In particular, using arguments from optimal recovery (Micchelli and Rivlin, 1976), we develop an adaptive sampling strategy (equivalent to adaptive approximation) for arbitrary approximation schemes. We provide a general formulation of the problem and show how it can be regarded as sequential optimal recovery. We demonstrate the application of this general formulation to two special cases of functions on the real line 1) monotonically increasing functions and 2) functions with bounded derivative. An extensive investigation of the sample complexity of approximating these functions is conducted yielding both theoretical and empirical results on test functions. Our theoretical results (stated insPAC-style), along with the simulations demonstrate the superiority of our active scheme over both passive learning as well as classical optimal recovery. The analysis of active function approximation is conducted in a worst-case setting, in contrast with other Bayesian paradigms obtained from optimal design (Mackay, 1992).

Optimal Methodology for Synchronized Scheduling of Parallel Station Assembly with Air Transportation

We present an optimal methodology for synchronized scheduling of production assembly with air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain (CESC). This problem was motivated by a major PC manufacturer in consumer electronics industry, where it is required to schedule the delivery requirements to meet the customer needs in different parts of South East Asia. The overall problem is decomposed into two sub-problems which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as a Linear Programming Problem with earliness tardiness penalties for job orders. For the assembly scheduling problem, it is basically required to sequence the job orders on the assembly stations to minimize their waiting times before they are shipped by flights to their destinations. Hence the second sub-problem is modelled as a scheduling problem with earliness penalties. The earliness penalties are assumed to be independent of the job orders.

Randomization tests for ABAB designs : Comparing-data-divisionspecific and common distributions. 'Pruebas de aleatorizaci??n para dise??os ABAB : comparaci??n entre distribuciones espec??ficas y comunes'

Resumen tomado de la publicaci??n. Resumen tambi??n en ingl??s

Networks of PhD Students and Academic Performance: A Comparison across Countries

In this article we compare regression models obtained to predict PhD students’ academic performance in the universities of Girona (Spain) and Slovenia. Explanatory variables are characteristics of PhD student’s research group understood as an egocentered social network, background and attitudinal characteristics of the PhD students and some characteristics of the supervisors. Academic performance was measured by the weighted number of publications. Two web questionnaires were designed, one for PhD students and one for their supervisors and other research group members. Most of the variables were easily comparable across universities due to the careful translation procedure and pre-tests. When direct comparison was not possible we created comparable indicators. We used a regression model in which the country was introduced as a dummy coded variable including all possible interaction effects. The optimal transformations of the main and interaction variables are discussed. Some differences between Slovenian and Girona universities emerge. Some variables like supervisor’s performance and motivation for autonomy prior to starting the PhD have the same positive effect on the PhD student’s performance in both countries. On the other hand, variables like too close supervision by the supervisor and having children have a negative influence in both countries. However, we find differences between countries when we observe the motivation for research prior to starting the PhD which increases performance in Slovenia but not in Girona. As regards network variables, frequency of supervisor advice increases performance in Slovenia and decreases it in Girona. The negative effect in Girona could be explained by the fact that additional contacts of the PhD student with his/her supervisor might indicate a higher workload in addition to or instead of a better advice about the dissertation. The number of external student’s advice relationships and social support mean contact intensity are not significant in Girona, but they have a negative effect in Slovenia. We might explain the negative effect of external advice relationships in Slovenia by saying that a lot of external advice may actually result from a lack of the more relevant internal advice

Tests de pensamiento creativo de Torrance (TTCT) : elementos para la validez de constructo en adolescentes portugueses.

Resumen tomado de la publicación

Optimal Traffic Grooming in WDM using Lighttours

Recent developments in optical communications have allowed simpler optical devices to improve network resource utilization. As such, we propose adding a lambda-monitoring device to a wavelength-routing switch (WRS) allowing better performance when traffic is routed and groomed. This device may allow a WRS to aggregate traffic over optical routes without incurring in optical-electrical-optical conversion for the existing traffic. In other words, optical routes can be taken partially to route demands creating a sort of "lighttours". In this paper, we compare the number of OEO conversions needed to route a complete given traffic matrix using either lighttours or lightpaths

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

RAN : un programa inform??tico para estimar patrones de respuesta aleatorios en tests objetivos

Resumen tomado de la publicaci??n

Deterioro de par??metros de los ??tems en tests adaptativos informatizados : estudio con eCAT

Resumen tomado de la publicaci??n

GenTAI : generador de tests adaptativos informatizados

Resumen tomado del autor. Incluye gráficos e imágenes capturadas de la pantalla del ordenador

Herramienta Autor para la gesti??n de tests informatizados dentro del sistema AHA!

Resumen tomado del autor. Este trabajo ha sido financiado por el proyecto TIN 2005-08386-C05-02 y los fondos FEDER

Comparación del tiempo de despertar y tiempo de descarga entre dos técnicas de anestesia total intravenosa manual : Remifentanil vs Fentanil.

Introducción: A pesar de que las combinaciones de Propofol y opioides son ampliamente usadas para inducir y mantener una adecuada anestesia y analgesia, disminuir la dosis del inductor, incrementar la estabilidad hemodinámica y suprimir la respuesta a la laringoscopia y la intubación; no existen estudios que comparen el uso de Anestesia Total Intravenosa manual con Remifentanil - Propofol versus Fentanil - Propofol. Objetivo: Comparar el tiempo de despertar y el tiempo de descarga entre dos técnicas de Anestesia Total Intravenosa manual empleadas en el Hospital Occidente de Kennedy, una basada en Propofol y Remifentanil y otra basada en Propofol y Fentanil controlado por Stangraf. Metodología: Estudio de corte transversal, en 43 pacientes llevados a cirugía bajo Anestesia Total Intravenosa en el Hospital Occidente de Kennedy. Se analizó la información mediante las pruebas de Shapiro-Wilks, t de Student y U de Mann Withney y los coeficientes de correlación de Spearman y de Pearson, usando SPSS versión 20 para Windows. Un valor de p < 0.05 fue aceptado como estadísticamente significativo. Resultados: Al comparar las dos técnicas, no se encontraron diferencias estadísticamente significativas en los tiempos evaluados. El tiempo de despertar promedio fue 10,1 minutos para Fentanil y 10,2 minutos para Remifentanil. El tiempo de descarga para Fentanil fue 11,9 minutos y para Remifentanil fue 11,5 minutos. Conclusiones: El uso de Fentanil - Propofol guiado por Stangraf es equivalente al uso de Remifentanil – Propofol en cuanto a los tiempos de despertar y de descarga. Se requieren nuevos estudios para corroborar estos hallazgos.

Existen diferencias farmacocinéticas y tiempos de despertar entre mujeres y hombres con anestesia total intravenosa

Introducción: La anestesia total intravenosa (TIVA) es ampliamente usada y reportada en la literatura como técnica para disminuir la respuesta a la laringoscopia e intubación, en la inducción y mantenimiento de una adecuada anestesia, además de una mejor estabilidad hemodinámica y recuperación pos anestésica; sin embargo no existen un gran número de estudios que comparen el uso de TIVA, determinando si existen diferencias en el perfil farmacocinético según el género del paciente. Objetivo: Describir diferencias farmacocinéticas y de los tiempos de despertar y salida a la unidad de cuidados pos anestésicos (descarga), según el género; en pacientes que reciben TIVA, con remifentanil y propofol, orientado por Stangraf. Metodología: Estudio observacional analítico de corte transversal, en pacientes llevados a cirugía bajo TIVA en el Hospital Occidente de Kennedy en el periodo de junio de 2013 a Enero de 2014.Usando SPSS versión 20 Windows, se analizaron los datos mediante pruebas Kolmogorov-Smirnov y Shapiro-Wilk y U de Mann Withney. Un valor de p menor 0.05 fue aceptado como estadísticamente significativo. Resultados: Se aplicaron pruebas de normalidad y no se encontraron diferencias estadísticamente significativas entre género. El tiempo de despertar fue 9.36 minutos para mujeres y 11.26 minutos para hombres. Los tiempos de descarga fueron 10.71 minutos para mujeres y 12.82 minutos para hombres. Discusión. El tiempo de despertar y descarga no es diferente entre mujeres y hombres en los pacientes analizados. Se requieren estudios adicionales entre grupos poblacionales de diversas condiciones farmacocineticas para corroborar los datos.