Skip to content

Instantly share code, notes, and snippets.

@tegansnyder
tegansnyder / Preventing-Puppeteer-Detection.md
Created February 23, 2018 02:41
Preventing Puppeteer Detection

I’m looking for any tips or tricks for making chrome headless mode less detectable. Here is what I’ve done so far:

Set my args as follows:

const run = (async () => {

    const args = [
        '--no-sandbox',
        '--disable-setuid-sandbox',
        '--disable-infobars',
@timkock
timkock / sing.js
Last active December 2, 2015 11:57
sing.js
'use strict';
// instructions
// 0. save this code to sing.js
// 1. npm install request cheerio commander
// 2. node sing.js -l http://tinyurl.com/qxmreql -s 50
// dependencies
var request = require('request')
, cheerio = require('cheerio')
@ngpestelos
ngpestelos / remove-docker-containers.md
Last active May 31, 2024 15:10
How to remove unused Docker containers and images

May 8, 2018

I wrote this four years ago, so instead use this command:

$ docker rmi $(docker images -q -f dangling=true)
@rogierslag
rogierslag / Question 1.md
Last active January 4, 2016 13:59
Advanced Algorithms example questions on empirical evaluation

Give a description of the DPL algorithm for SAT as analysed by Hooker and Vinay.

The DPLL algorithms works with the following steps:

  1. Monotone variable fixing: This means that all variables which appear only in a positive form (no negated terms) are set to true and all variables which appear only in a negative form are set to false.
  2. Unit resolution: In this step all unit clauses (which are clauses with only one remaining literal) are set to true (hence the variable within may be true or false, depending on the negation). Consequently the value of the literal is propagated trough the formula. The formula can then be shortened (if L is true, remove the clause; if L is false, remove L from the clause). A contradiction may appear here if L appears once negated and once positive. This branch is then not satisfiable and terminates
  3. If the algorithms was not stopped in step 2 a check is made to verify is S is empty. If yes return "Satisfiable"; otherwise continue with step 4
  4. Pick a new literal L