Sistemas lineares
Sistemas Lineares
Gustavo
Relaxing LHC constraints on the \(W_R\) mass
XIth International Symposium:
Quantum Theory and Symmetries (QTS)
Université de Montréal
July 1-5, 2019
Ozer Ozdal
Herramientas lab 2
laboratorio 2 herramientas
Simon Cifuentes
Acceleration in Fixed Point Iteration and Nesterov;s Gradient Method
A note on gradient-based optimization.
Jinxiong Zhang
Riemann多様体上の発散の同値な定義
Riemann多様体上の発散には幾つかの等価な定義が存在します.
それらについて証明も含めてまとめました.
Yuto Horikawa
Polynomials with infinite solutions
Can there be a polynomial with infinite solutions? If so, would it be a polynomial? Also, would it have an infinite solution set? Let's find out.
Rahul Chhabra
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
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
Extra Credit Problem
*
William Slatton