Collaborative learning in class‐based teaching presents a challenge for a tutor to ensure every group and individual student has the best learning experience. We present Group Tagging, a web application that supports reflection on collaborative, group‐based classroom activities. Group Tagging provides students with an opportunity to record important moments within the class‐based group work and enables reflection on and promotion of professional skills such as communication, collaboration and critical thinking. After class, students use the tagged clips to create short videos showcasing their group work activities, which can later be reviewed by the teacher. We report on a deployment of Group Tagging in an undergraduate Computing Scie

Object detection in real time is considered as a challenging problem. However, it is very important in a wide range of applications, especially in field of multimedia. The players and ball are the most important objects in soccer game videos and detecting them is a challenging task because of many difficulties, such as shadow and illumination, ball size, ball occluded by players or merged with lines, and similar appearance of players. To overcome these problems, we present a new system to detect the players and ball in real-time by using background subtraction and Sobel detection. The results were more accurate and approximately two times faster than those using only background subtraction.

       Recently, much secured data has been sent across the internet and networks. Steganography is very important because it conceals secure data in images, texts, audios, protocols, videos, or other mediums. Video steganography is the method of concealing data in frames of video format. A video is a collection of frames or images used for hidden script messages. This paper proposes a technique to encrypt secret messages using DNA and a 3D chaotic map in video frames using the raster method. This technique uses three steps: Firstly, converting video frames into raster to extract features from each frame. Secondly, encryption of secret messages using encoded forms of DNA bases, inverse/inverse complements of DNA, a

Technological development in recent years leads to increase the access speed in the networks that allow a huge number of users watching videos online. Video streaming is one of the most popular applications in networking systems. Quality of Experience (QoE) measurement for transmitted video streaming may deal with data transmission problems such as packet loss and delay. This may affect video quality and leads to time consuming. We have developed an objective video quality measurement algorithm that uses different features, which affect video quality. The proposed algorithm has been estimated the subjective video quality with suitable accuracy. In this work, a video QoE estimation metric for video strea

In this paper, the Monte Carlo N-Particle extended  computer code (MCNP) were used to design a model of the European Sodium-cooled Fast Reactor. The multiplication factor, conversion factor, delayed neutrons fraction, doppler constant, control rod worth, sodium void worth, masses for major heavy nuclei, radial and axial power distribution at high burnup are studied. The results show that the reactor breeds fissile isotopes with a conversion ratio of 0.994 at fuel burnup 70 (GWd/T), and minor actinides are buildup inside the reactor core. The study aims to check the efficiency of the model on the calculation of the neutronic parameters of the core at high burnup.

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

Traffic classification is referred to as the task of categorizing traffic flows into application-aware classes such as chats, streaming, VoIP, etc. Most systems of network traffic identification are based on features. These features may be static signatures, port numbers, statistical characteristics, and so on. Current methods of data flow classification are effective, they still lack new inventive approaches to meet the needs of vital points such as real-time traffic classification, low power consumption, ), Central Processing Unit (CPU) utilization, etc. Our novel Fast Deep Packet Header Inspection (FDPHI) traffic classification proposal employs 1 Dimension Convolution Neural Network (1D-CNN) to automatically learn more representational c