Attention: this is the key used to sign the certificate requests, anyone holding this can sign certificates on your behalf. So keep it in a safe place!
openssl genrsa -des3 -out rootCA.key 4096
Warning this is a hardcore removal script, unlike the others, This tries to fully remove almost all uneeded services, without making the computer unusable
By running or using this script you accept. I am not hield responsible if anything breaks or stops working on your computer/machine. That is your fault and it is up to you to re-enable the service.
Printers will not work with this script.
[ | |
{ | |
"state": "welcome.0", | |
"rule": { | |
"condition": "function greeting_logic(){var timeSinceLastLogin=persona.timeSinceLastLogin();var openCounter=persona.openAppCountToday();var deviceTime=persona.deviceTime();if(timeSinceLastLogin<=600){return{'nextState':'welcome.5'};}else if(openCounter==4){return{'nextState':'welcome.6'};}else if(deviceTime>=14400&&deviceTime<37800){return{'nextState':'welcome.1'};}else if(deviceTime>=37800&&deviceTime<54000){return{'nextState':'welcome.2'};}else if(deviceTime>=54000&&deviceTime<61200){return{'nextState':'welcome.3'};}else{return{'nextState':'welcome.4'};}} greeting_logic();" | |
} | |
}, | |
{ | |
"state": "welcome.1", | |
"cards": [ |
const $ = (...fs) => { | |
const g = (fs, f = fs.shift(), n = f.length, a = []) => | |
x => (--n > 0) | |
? g(fs, f, n, [...a, x]) | |
: fs.length ? g(fs)(f(...a, x)) : f(...a, x) | |
return g(fs) | |
} |
/** | |
* The first commented line is your dabblet’s title | |
*/ | |
background: #f06; | |
background: linear-gradient(45deg, #f06, yellow); | |
min-height: 100%; |
// Use Gists to store code you would like to remember later on | |
console.log(window); // log the "window" object to the console |
The range sliders at the top change the values for the force-directed algorithm and the buttons load new graphs and apply various techniques. This will hopefully serve as a tool for teaching network analysis and visualization principles during my Gephi courses and general Networks in the Humanities presentations.
Notice this includes a pretty straightforward way to load CSV node and edge lists as exported from Gephi.
It also includes a pathfinding algorithm built for the standard data structure of force-directed networks in D3. This requires the addition of .id attributes for the nodes, however.
Now with Clustering Coefficients!
Also, it loads images for nodes but the images are not in the gist. The code also refers to different network types but the data files on Gist only refer to the transportation network.
pre, code { | |
display: none; | |
} | |
body { | |
background: #EEE; | |
} | |
.container { | |
font-size: 0; |
.histogram { | |
margin: 0; | |
padding: 0; | |
box-sizing: border-box; | |
display: inline-block; | |
} |
class Balloon { | |
constructor(text) { | |
this.id = Math.random().toString(36) | |
this.text = text | |
this.html = ` | |
<div class="balloon"> | |
<div class="close" onclick="balloons.remove('${this.id}')">✖</div> | |
<span class="text">${this.text}</span> | |
</div> | |
` |