This website is a virtual proof that I'm awesome https://sayefsakin.github.io/ Time Series Updates for Traveler Mentor - Kate Isaacs                In this Google summer project, my goal is to make the Traveler interface more illustrative, interactive, and responsive by reducing visual lagging, adding new linked visualizations, and enhancing existing visualizations and interactivity. Older SVG views have been converted to HTML5... Thu, 27 Aug 2020 15:13:00 -0400 https://sayefsakin.github.io/2020-08-27-google-summer-of-code-2020/ https://sayefsakin.github.io/2020-08-27-google-summer-of-code-2020/ There's lots to learn! - This is a demo post to show you how to write blog posts with markdown. I strongly encourage you to take 5 minutes to learn how to write in markdown - it’ll teach you how to transform regular text into bold/italics/tables/etc.I also encourage you to look at the code that... Fri, 28 Feb 2020 00:00:00 -0500 https://sayefsakin.github.io/2020-02-28-sample-markdown/ https://sayefsakin.github.io/2020-02-28-sample-markdown/ Little bit of ranting During my MS Thesis work in 2015, I researched on the resource (subchannel, power) scheduling problem in wireless regional area network (WRAN). IEEE 802.22 standard is considered as the first wireless standard based on CR technology for WRAN. I worked under the supervision of professor Dr.... Fri, 02 Feb 2018 11:08:00 -0500 https://sayefsakin.github.io/2018-02-02-a-dedicated-ns-3-module-for-ieee-80222/ https://sayefsakin.github.io/2018-02-02-a-dedicated-ns-3-module-for-ieee-80222/ Set the network details: netsh wlan set <network_name> mode=allow ssid=<ssid> key=<password> netsh wlan start <network_name> Example: netsh wlan set hostednetwork mode=allow ssid=ss key=ssssss netsh wlan start hostednetwork To stop the Wireless Hosted Network: netsh wlan stop <network_name> To see the Wireless Hosted Network details, including the MAC addresses of connected... Mon, 14 Oct 2013 09:32:00 -0400 https://sayefsakin.github.io/2013-10-14-setup-virtual-router-windows/ https://sayefsakin.github.io/2013-10-14-setup-virtual-router-windows/ Wired link: http://www.wired.com/wiredenterprise/2013/06/d-wave-quantum-computer-usc/ blog post: http://googleresearch.blogspot.com/2013/05/launching-quantum-artificial.html John Preskill: Quantum Computing and the Entanglement Frontier https://www.youtube.com/watch?v=8-IqQnGYB2M Googles explanation about quantum computing https://www.youtube.com/watch?v=CMdHDHEuOUE official google+ page: https://plus.google.com/+QuantumAILab/posts Microscopic and macroscopic systems It is useful, at this stage, to make a distinction between the different sizes of the systems that we are going... Mon, 14 Oct 2013 04:30:00 -0400 https://sayefsakin.github.io/2013-10-14-quantum-computing-resources/ https://sayefsakin.github.io/2013-10-14-quantum-computing-resources/ Boot from the ubuntu Live CD. Open the terminal from applications -> Accessories -> Terminal. Then find the partition of your Ubuntu OS from the list generated with the command, sudo fdisk -l  If your ubuntu(linux) partion is sda6, sudo mkdir /media/sda6 sudo mount /dev/sda6 /media/sda6 After that you have... Sat, 03 Mar 2012 08:18:00 -0500 https://sayefsakin.github.io/2012-03-03-restore-boot-manager-after-installing/ https://sayefsakin.github.io/2012-03-03-restore-boot-manager-after-installing/ *#92702689# -> Warranty settings. *#7760# -> Production serial no. *#bta0# -> MAC address of bluetooth. *#9999# -> Firmware version. *#2640# -> Security code. *#7328748263373738# -> Default security code. *#43# -> Call waiting status. *#2820# -> Bluetooth info. *#7370# -> Format mobile memory. *#delset# -> reset GPRS & E-mail Setting. *#06#... Fri, 17 Feb 2012 11:32:00 -0500 https://sayefsakin.github.io/2012-02-17-some-secret-code-of-mobile/ https://sayefsakin.github.io/2012-02-17-some-secret-code-of-mobile/ //&ltO(N logN, O(logN)&gt #define mx 10010 #define logmx ceil(log(mx)) #define pii pair &lt int, int &gt //#define i64 __int64 #define inf 2147483647 int L[mx], T[mx], P[mx][logmx]; const int root = 1; bool color[mx]; long long d[mx]; vector &lt pii &gt G[mx]; void preprocess(int n){ int i,j; for(i = 1; i... Tue, 25 Oct 2011 16:57:00 -0400 https://sayefsakin.github.io/2011-10-25-lowest-common-ancestor/ https://sayefsakin.github.io/2011-10-25-lowest-common-ancestor/ #define mx 1000010 #define tmx 2000020 int a[mx]; int t[tmx]; void init(int node, int i, int j){ if(i==j){ t[node] = a[i]; return; } int mid = (i+j)&gt&gt 1; init(2*node, i, mid); init((2*node)+1, mid+1, j); t[node] = max(t[2*node], t[(2*node)+1]); } int query(int node, int i, int j, int si, int sj){... Tue, 25 Oct 2011 16:43:00 -0400 https://sayefsakin.github.io/2011-10-25-rmq-with-segment-tree/ https://sayefsakin.github.io/2011-10-25-rmq-with-segment-tree/ #define i64 long long i64 BIT[mx]; int n; //1-D BIT i64 read(int idx){ i64 sum = 0; while (idx &gt 0){ sum += BIT[idx]; idx -= (idx & -idx); } return sum; } void update(int idx, i64 val){ while (idx &lt= m){ BIT[idx] += val; idx += (idx & -idx);... Tue, 25 Oct 2011 16:33:00 -0400 https://sayefsakin.github.io/2011-10-25-binary-indexed-tree/ https://sayefsakin.github.io/2011-10-25-binary-indexed-tree/ //Complexity: O(e√v) //n: number of nodes in left side n=[1,n] //m: number of nodes in right side m=[n+1,n+m] //G: NIL U G1[G[1,n]] U G2[G[n+1,n+m]] #define mx 100010 #define inf (1 Tue, 25 Oct 2011 16:11:00 -0400 https://sayefsakin.github.io/2011-10-25-bipartite-matching-hopcroft-karp/ https://sayefsakin.github.io/2011-10-25-bipartite-matching-hopcroft-karp/ Little talk..... This was my 3rd assignment in System programming lab(3rd year undergrad course). The main task of this assignment is to design a character driver which should exist in linux kernel. I make a kernel module which module implements a driver that exposes two character devices to user-space. Lets... Thu, 06 Oct 2011 11:04:00 -0400 https://sayefsakin.github.io/2011-10-06-character-device-driver-for-linux/ https://sayefsakin.github.io/2011-10-06-character-device-driver-for-linux/ Little talk about 'ls' (since I have very small knowledge about it): ls - list directory contents. The 'ls' program lists information about files (of any type, including directories). Options and file arguments can be intermixed arbitrarily, as usual. Know details about 'ls' in linux man page: http://unixhelp.ed.ac.uk/CGI/man-cgi?ls Little talk about coding: Probably... Sun, 04 Sep 2011 11:32:00 -0400 https://sayefsakin.github.io/2011-09-04-ls-my-own-implementation/ https://sayefsakin.github.io/2011-09-04-ls-my-own-implementation/ Sample code project1: data.o main.o io.o         cc data.o main.o io.o -o project1 data.o: data.c data.h         cc -c data.c main.o: data.h io.h main.c         cc -c main.c io.o: io.h io.c         cc -c io.c #this is a... Sun, 04 Sep 2011 10:15:00 -0400 https://sayefsakin.github.io/2011-09-04-makefile-at-glance/ https://sayefsakin.github.io/2011-09-04-makefile-at-glance/ Append: It can be used by programs to open files in another directory as if they were located in the current directory. Arp: It is used to display or change entries in the ARP cache.. Assoc: The assoc command is used to display or change the file type associated with... Mon, 15 Aug 2011 13:57:00 -0400 https://sayefsakin.github.io/2011-08-15-windows-7-command-prompt-commands/ https://sayefsakin.github.io/2011-08-15-windows-7-command-prompt-commands/ Linux Mint How To Restore Grub After Windows 7 Repair Install Sun, 14 Aug 2011 13:20:00 -0400 https://sayefsakin.github.io/2011-08-14-linux-tutorials/ https://sayefsakin.github.io/2011-08-14-linux-tutorials/ My vi/vim cheatsheet Cursor movement h - move left j - move down k - move up l - move right w - jump by start of words (punctuation considered words) W - jump by words (spaces separate words) e - jump to end of words (punctuation considered words) E... Sun, 14 Aug 2011 13:16:00 -0400 https://sayefsakin.github.io/2011-08-14-vivim-cheat-sheet/ https://sayefsakin.github.io/2011-08-14-vivim-cheat-sheet/ C++ String Examples constructors 1. #include <iostream> #include <string> using namespace std; int main () { char *line = "short line for testing"; // with no arguments string s1; s1 = "Anatoliy"; cout << "s1 is: " << s1 << endl; // copy constructor string s2 (s1); cout << "s2... Sun, 14 Aug 2011 13:14:00 -0400 https://sayefsakin.github.io/2011-08-14-c-string-references-with-example/ https://sayefsakin.github.io/2011-08-14-c-string-references-with-example/ vector< int > M[MX]; int color[MX],f[MX],low[MX],ftm,st[MX],top,scc; bool instack[MX]; void dfs(int u){ int i,v,sz; f[u] = ftm; low[u] = ftm; ftm++; st[top] = u;top++;instack[u] = true; sz = M[u].size(); color[u] = 1; for(i=0;i<sz;i++){ v = M[u][i]; if(!color[v]){ dfs(v); low[u] = _min(low[u],low[v]); } else if(instack[v])low[u] = _min(low[u],f[v]); } if(f[u] == low[u]){ scc++;... Sun, 14 Aug 2011 10:00:00 -0400 https://sayefsakin.github.io/2011-08-14-strongly-connected-component-tarjan/ https://sayefsakin.github.io/2011-08-14-strongly-connected-component-tarjan/ vector < int > M[mx]; int pre[mx], cap[mx][mx]; bool color[mx]; int bfs(int s, int t){ int ok,u,v,sz,i,path_cap; memset(pre,-1,sizeof(pre)); memset(color,0,sizeof(color)); queue < int > q; color[s] = 1; q.push(s); ok = 1; while(!q.empty() && ok){ u = q.front(); q.pop(); sz = M[u].size(); for(i=0;i<sz;i++){ v = M[u][i]; if(!color[v] && cap[u][v] > 0){... Sun, 14 Aug 2011 09:58:00 -0400 https://sayefsakin.github.io/2011-08-14-maximum-flow-basic/ https://sayefsakin.github.io/2011-08-14-maximum-flow-basic/