rootAvish
/ clusters_transitioned_meaningful_june.txt
Created
July 24, 2020 04:40
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 014b5d1c-d0a3-405a-ba0b-41666ee1ae38 | |
| 16abb73f-6f9a-4b62-a56b-c46878a6e375 | |
| 1fc01018-d7f8-4f2a-b20a-707a73a85ee0 | |
| 30e91d77-6182-41b0-9aa6-7b4eb9fe5e5c | |
| 374c0629-fc1d-4149-aa29-72b12b2872fb | |
| 4432fdf0-ee50-40b0-822e-14eafa3856c3 | |
| 4794d717-1e62-489c-8160-eb1c5b98e17e | |
| 47b10413-5c4c-4db0-b907-21d4159636d5 | |
| 5fafcdaa-35d1-4c22-becb-0e64de723bb4 | |
| 6979f029-5411-4cef-9fa9-e1fd5e29d548 |
rootAvish
/ trend_cluster_ids.txt
Created
July 20, 2020 05:43
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 009abb65-9ff3-40fa-a5ed-b933e8b90d4d | |
| 0136e96c-595b-4d0b-8554-95ff36904804 | |
| 014b5d1c-d0a3-405a-ba0b-41666ee1ae38 | |
| 01821035-b2a4-4ca7-ba9b-16300827a2a4 | |
| 0183fe57-4eae-48c2-be5e-bca8ab2ddf7d | |
| 0184afaf-5205-4003-b6d5-d374d12f7fc9 | |
| 019efbf8-0359-4a83-8c2a-a0cff6cf71e2 | |
| 020b8eaf-24ef-4ec9-a420-dc92ab7dc1fa | |
| 0286fa19-c90a-4bb4-82d0-a52b10f528a0 | |
| 02e8bbf2-4472-44fb-abb1-8d2cb31856d4 |
rootAvish
/ full-requirements.txt
Last active
March 26, 2020 19:02
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| absl-py==0.9.0 | |
| astor==0.8.1 | |
| attrs==19.3.0 | |
| boto3==1.12.29 | |
| botocore==1.15.29 | |
| cachetools==4.0.0 | |
| certifi==2019.11.28 | |
| chardet==3.0.4 | |
| click==7.1.1 | |
| dill==0.3.1.1 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [20:17:15] avgupta:~ $ code --list-extensions | |
| Arjun.swagger-viewer | |
| donjayamanne.jupyter | |
| eamodio.gitlens | |
| humao.rest-client | |
| James-Yu.latex-workshop | |
| kisstkondoros.vscode-gutter-preview | |
| mohsen1.prettify-json | |
| ms-kubernetes-tools.vscode-kubernetes-tools | |
| ms-python.python |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ~/f8a/mercator-go | |
| go get 'gopkg.in/yaml.v2' | |
| # for 'go build' to work properly, we need to be in OPATH_SRC | |
| pushd /Users/avgupta/f8a/mercator-go/src/github.com/fabric8-analytics/mercator-go; \ | |
| go build -o mercator; \ | |
| popd | |
| ~/f8a/mercator-go/src/github.com/fabric8-analytics/mercator-go ~/f8a/mercator-go | |
| main.go:36:2: build constraints exclude all Go files in /Users/avgupta/f8a/mercator-go/src/github.com/fabric8-analytics/mercator-go/core/fileutils | |
| ~/f8a/mercator-go | |
| /Applications/Xcode.app/Contents/Developer/usr/bin/make install |
rootAvish
/ dnn.py
Last active
August 29, 2015 14:27
— forked from syhw/dnn.py
A simple deep neural network with or w/o dropout in one file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| A deep neural network with or w/o dropout in one file. | |
| License: Do What The Fuck You Want to Public License http://www.wtfpl.net/ | |
| """ | |
| import numpy, theano, sys, math | |
| from theano import tensor as T | |
| from theano import shared | |
| from theano.tensor.shared_randomstreams import RandomStreams |
rootAvish
/ dijkstra.c
Last active
September 11, 2015 16:50
This is an implementation of dijkstra's algorithm in vanilla C
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * Copyright @rootavish | |
| * LICENSE: Do whatever the fuck you want to do license. | |
| */ | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <limits.h> | |
| #define N 6 | |
| int visited_all(int visited[]) |
rootAvish
/ webview-snapshot.c
Last active
February 14, 2024 00:30
This program will create an offscreen(invisible) webkit-web-view, and take a screenshot of the loaded document, the document/URL is passed as a command line argument to the program
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <gtk/gtk.h> | |
| #include <webkit/webkit.h> | |
| static void destroyWindowCb(GtkWidget* widget, GtkWidget* window); | |
| static gboolean closeWebViewCb(WebKitWebView* webView, GtkWidget* window); | |
| static void | |
| webkit_render_cb(WebKitWebView *webview, |
rootAvish
/ setdistance.c
Last active
August 29, 2015 13:58
program generates a set U of n random numbers , and then generates m random permutations of this set. Our objective is to find a set S , such that the distance of this set S from all sets L[i] is minimum .
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * The following program generates a set U of n random numbers , and then generates m random permutations of this set. | |
| * Our objective is to find a set S , such that the distance of this set S from all sets L[i] is minimum . | |
| * | |
| * The distance between two arrays A and B is given by: | |
| * | |
| * distance = 0 | |
| * for i = 1 to N do: | |
| * distance = distance + | position of element i in set A - position of element i in set B | | |
| * |