JanhaviDadhania

good start course series: https://www.youtube.com/watch?v=CpW4W257RHE&list=PLadnyz93xCLhSlm2tMYJSKaik39EZV_Uk&index=3
matlab: https://in.mathworks.com/help/fusion/ug/introduction-to-multiple-target-tracking.html
Blog KALMAN FILTER : https://towardsdatascience.com/kalman-filter-an-algorithm-for-making-sense-from-the-insights-of-various-sensors-fused-together-ddf67597f35e
https://www.intechopen.com/books/introduction-and-implementations-of-the-kalman-filter/introduction-to-kalman-filter-and-its-applications
https://www.youtube.com/watch?v=DE6Jn2cB4J4
https://automaticaddison.com/extended-kalman-filter-ekf-with-python-code-example/
code taken : https://github.com/zziz/kalman-filter/blob/master/kalman-filter.py
extended kalman : https://github.com/mez/extended_kalman_filter_python

RNNs vs NN

JanhaviDadhania

#include<bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int t;
    cin>>t;

JanhaviDadhania

Chef gets scared in the exam if he sees a question containing description of more than 10 lines and leaves the exam 
hall and due to this he is not able to perform well in his exams. Cheffina is chef's best friend and 
she decides to give him a question which she believes would help chef to overcome his fear of reading lengthy questions. 
Chef invites you for pair-problem-solving and askes you to help him in solving this question because he is again scared 
to read it. Question is as below.

Raj has 10,000 sets of strings named 1, 2, 3, 4 and so on till 10,000, where string is sequence of alphabates e.g NAN.

A function f from set of alphabets to set {1,0} is defined as below:  
f(x) = 0, x E {A,B,C,D,E,F,G,H,I,J,K,L,M}

JanhaviDadhania

#include "spoj_interactive.h"
#include <bits/stdc++.h>

#define MAX 500005
long long int a[MAX],n,cnt[MAX];

using namespace std;
void verdict_wrong(int i)
{
    fprintf(spoj_for_tested,"poof %d\n",i);

JanhaviDadhania

#include "spoj_interactive.h"
#include <bits/stdc++.h>

#define MAX 500005
long long int a[MAX],n,cnt[MAX];

using namespace std;
void verdict_wrong(int i)
{
    fprintf(spoj_for_tested,"%d\n",i);

JanhaviDadhania

#include "spoj_interactive.h"
#include <bits/stdc++.h>
#define MAX 500005
long long int a[MAX],n,cnt[MAX];
using namespace std;
void verdict_wrong(int i)
{
    fprintf(spoj_for_tested,"%d\n",i);
    spoj_assert(false);
}

JanhaviDadhania

Installation

1. Install Atom on your computer (https://atom.io)

2. Launch Atom, go in Preferences, then chose Install, search for "remote-atom", and install it

3. On the distant machine:

   cd ~
   wget https://raw.githubusercontent.com/aurora/rmate/master/rmate
   chmod +x rmate

JanhaviDadhania

Eval 1 : Meeting 26-09-2020

- Planning to get the first version ready by the next eval. 
- using GTZAN dataset with (10 X 1000) data. (30seconds videos divided into 10 parts)
- version 1.0 : Using basic features (given csv files)
- version 1.1 : Using advanced features generated using librosa

:)

JanhaviDadhania

We couldn’t find that file to show.

JanhaviDadhania

Chef has decided to take break from her busy schedule. She decides to visit Hogwarts. As chef is from moggle world she is 
not aware that voldemort has poisoned the water bodies in hogwarts. There are two perfect circular water bodies inside forbidden forest
with negligible width. One of them is maintained by house gryffindor and other by house slytherin. Hagrid is good friend of
chef and has gifted her broomstick to travel around.
Broomstick has few characteristics as below: <br>
1. Hogwards has infinite area and broomstick can start from anywhere outside forbidden forest <br>
2. It always travel in straight line <br>
3. Once started, it will not stop and will continue to fly till infinity <br>
4. The path it follows must be tangent to the ring maintained by house Gryffendor <br>
5. Broomstick always fly at ground level <br>