MOOC Dropout Prediction with Model Stacking

We are asked to predict the probability of the event that a student will drop out a course. We firstly extracted many features from the huge dataset. Then we used ensemble learning machine and model stacking technique to get the final result, which ranked the 1st in 68 teams.

Qi Zhao

Geometria de superfícies isentrópicas

A dinâmica topológica de inversões geométricas foi estudada em [6]. O espa ̧co de parâmetros das medidas de Markov com suporte no atrator do sistema é um aberto de R3 folheado por superfícies de nível compactas definidas pela entropia métrica: superfícies isentrópicas [7]. Neste artigo abordaremos o aspecto geométrico dessas superfícies. Em particular, classificaremos suas geodésicas e pontos umbílicos.

Deyvisson Ribeiro

Modélisation de l’évacuation d’un immeuble en cas d’incendie

When an issue arises in a building, people's evacuation is a recurring challenge. We wondered whether we could make a realistic simulation of people’s evacuation based on a simple physical model. First, we elaborated this model and then we simulate the people’s comportment on MATLAB. We could conclude that our simulation is enough to describe the general comportment of people.

Guillaume

Robot localization in a mapped environment using Adaptive Monte Carlo algorithm

Localization is the challenge of determining the robot's pose in a mapped environment. This is done by implementing a probabilistic algorithm to filter noisy sensor measurements and track the robot's position and orientation. This paper focuses on localizing a robot in a known mapped environment using Adaptive Monte Carlo Localization or Particle Filters method and send it to a goal state. ROS, Gazebo and RViz were used as the tools of the trade to simulate the environment and programming two robots for performing localization.

Sagarnil Das

Edge-Disjoint Tree Realization of Tree Degree Matrices that avoid routine induction

Identifying whether a degree matrix has an edge-disjoint realization is an NP-hard problem. In comparison, identifying whether a tree degree matrix has an edge-disjoint realization is easier, but the task is still challenging. In 1975, a sufficient condition for the tree degree matrices with three rows has been found, but the condition has not been improved since. This paper contains an essential part of the proof which improves the sufficient condition.

Ian Seong