An exercises editor for an e-learning environment

One of the most important tenets of e-learning is that it bridges work and learning. A great e-learning experience brings learning into the work environment. This is a key point, the capacity to construct a work environment when the student can develop proper tasks to complete the learning process. This paper describes a work environment based on the development of two tools, an exercises editor and an exercises viewer. Both tools are able to manage color images where, because of the implementation of basic steganographic techniques, it is possible to add information, exercises, questions, and so on. The exercises editor allows to decide which information must be visible or remain hidden to the user, when the image is loaded in the exercises viewer. Therefore, it is possible to hide the solutions of the proposed tasks; this is very useful to complete a self-evaluation learning process. These tools constitute a learning architecture with the final objective that learners can apply and practice new concepts or skills.

A viability analysis of a secure VoIP and instant messaging system on a Pocket PC platform

We propose a secure full-duplex VoIP and instant messaging system on a Pocket PC platform, allowing for session key transport using a public-key protocol and encrypted text or voice communication using a private-key algorithm. The full-duplex VoIP scheme presents good performance for long duration communication over LAN networks.

Lightweight peer-to-peer secure multi-party VoIP protocol

Multi-party voice-over-IP (MVoIP) services provide economical and convenient group communication mechanisms for many emerging applications such as distance collaboration systems, on-line meetings and Internet gaming. In this paper, we present a light peer-to-peer (P2P) protocol to provide MVoIP services on small platforms like mobile phones and PDAs. Unlike other proposals, our solution is fully distributed and self-organizing without requiring specialized servers or IP multicast support.

Fast pseudorandom generator based on packed matrices

Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security. The resulting generator is successfully compared to world class standards.

An optimized pseudorandom generator using packed matrices

Most cryptographic services and information security protocols require a dependable source of random data; pseudorandom generators are convenient and efficient for this application working as one of the basic foundation blocks on which to build the required security infrastructure. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security by using word packed matrices and modifying key scheduling and bit extraction schemes. The resulting generator is then successfully compared to world class standards.

Incorporating global positioning data in real time P2P audio/video streams for mobile devices

We propose an original method to geoposition an audio/video stream with multiple emitters that are at the same time receivers of the mixed signal. The achieved method is suitable for those comes where a list of positions within a designated area is encoded with a degree of precision adjusted to the visualization capabilities; and is also easily extensible to support new requirements. This method extends a previously proposed protocol, without incurring in any performance penalty.

P2P audio/video protocol with global positioning data in real time for mobile devices

In this paper, we propose an original method to geoposition an audio/video stream with multiple emitters that are at the same time receivers of the mixed signal. The obtained method is suitable when a list of positions within a known area is encoded with precision tailored to the visualization capabilities of the target device. Nevertheless, it is easily adaptable to new precision requirements, as well as parameterized data precision. This method extends a previously proposed protocol, without incurring in any performance penalty.

Estadística. Problemas resueltos. Contraste de una población normal

Ejercicio resuelto. Contraste para los parámetros de una población Normal, varianza de la población desconocida.

Estadística. Problemas resueltos. Contraste de dos poblaciones normales dependientes

Ejercicio resuelto paso a paso sobre el contraste para los parámetros (media) de dos poblaciones Normales dependientes.

Estadística. Problemas resueltos. Contraste de dos poblaciones normales independientes, varianzas desconocidas distintas

Ejercicio resuelto paso a paso sobre el contraste para los parámetros (media) de dos poblaciones Normales independientes, con varianzas desconocidas y diferentes.

Estadística. Problemas resueltos. Contraste de dos poblaciones normales independientes, varianzas desconocidas iguales

Ejercicio resuelto paso a paso sobre el contraste para los parámetros (media) de dos poblaciones Normales independientes y varianzas iguales.

Estadística. Problemas resueltos. Análisis de la Varianza (ANOVA) de un factor y test a posteriori

Ejercicio resuelto paso a paso sobre el contraste ANOVA de un factor y contrastes a posteriori.

Estadística. Problemas resuetos. Contrastes de Bondad de Ajuste para variables continuas, Kolmogorov-Smirnov

Ejercicio resuelto paso a paso sobre el contraste de bondad de ajuste a una distribución normal mediante el método de Kolmogorov-Smirnov.

Estadística. Problemas resueltos. Contraste de bondad de ajuste para variables discretas, Chi cuadrado

Ejercicio resuelto paso a paso sobre el contraste de bondad de ajuste en variables disctretas (en a una distribución de Poisson) a partir de Chi-cuadrado.