Are you over 18 and want to see adult content?
More Annotations
وظفني.كوم – أكبر محرك بحث عربي مجاني للوظائف | فرص عمل و وظائف شاغرة
Are you over 18 and want to see adult content?
APKIsland - Download Trusted APKs - The First Free APK Island.
Are you over 18 and want to see adult content?
Create Your Forum In Seconds - Website Toolbox
Are you over 18 and want to see adult content?
Online Peticije - Napravi Peticiju - Peticije24.com
Are you over 18 and want to see adult content?
Sign in to your account
Are you over 18 and want to see adult content?
Aldiss | Home Furnishings, Furniture, Sofas and More
Are you over 18 and want to see adult content?
Deshumidificadores, desecantes y por condensación
Are you over 18 and want to see adult content?
Favourite Annotations
A complete backup of www.www.amkingdom.com
Are you over 18 and want to see adult content?
A complete backup of www.vintagemags.org
Are you over 18 and want to see adult content?
Text
CORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
A company that maps the deep structure of the web. binvis.io. Visualising and exploring data with space-filling curves. mitmproxy. A man-in-the-middle proxy for pen testers and developers. modd. A flexible developer tool for responding to filesystem changes. devd. A self-contained HTTP server for developers.CORTE.SI
The basic idea is to use a 3-d Hilbert curve traversal of the RGB colour cube to create a palette of colours. This makes use of the locality-preserving properties of the Hilbert curve to make sure that similar elements have similar colours in the visualization. See the original post for more. So, here's a Hilbert curve mapping of a binaryfile
CORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things. CORTE.SISEE MORE ON CORTE.SICORTE.SI
The Hilbert curve is a remarkable construct in many ways, but the thing that makes it useful in computer science is the fact that it has good clustering properties. If we take a curve like the one above and straighten it out, points that are close together in the two-dimensional layout will also tend to be close together in thelinear sequence.
CORTE.SI
In other words, an equidistant sequence of colours that are simultaneously as different from each other as possible, and where colours 'close' to each other on the sequence are as similar as possible. The result is a colour sequence that looks like this: 512-colour Hilbert-order swatch. We do, of course, pay a price for this mathematical marvelCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
A company that maps the deep structure of the web. binvis.io. Visualising and exploring data with space-filling curves. mitmproxy. A man-in-the-middle proxy for pen testers and developers. modd. A flexible developer tool for responding to filesystem changes. devd. A self-contained HTTP server for developers.CORTE.SI
The basic idea is to use a 3-d Hilbert curve traversal of the RGB colour cube to create a palette of colours. This makes use of the locality-preserving properties of the Hilbert curve to make sure that similar elements have similar colours in the visualization. See the original post for more. So, here's a Hilbert curve mapping of a binaryfile
CORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things. CORTE.SISEE MORE ON CORTE.SICORTE.SI
The Hilbert curve is a remarkable construct in many ways, but the thing that makes it useful in computer science is the fact that it has good clustering properties. If we take a curve like the one above and straighten it out, points that are close together in the two-dimensional layout will also tend to be close together in thelinear sequence.
CORTE.SI
In other words, an equidistant sequence of colours that are simultaneously as different from each other as possible, and where colours 'close' to each other on the sequence are as similar as possible. The result is a colour sequence that looks like this: 512-colour Hilbert-order swatch. We do, of course, pay a price for this mathematical marvelCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
Edit: Since this post, I've created an interactive tool for binary visualisation - see it at binvis.io. Last week, I wrote about visualizing binary files using space-filling curves, a technique I use when I need to get a quick overview of the broad structure of a file.Today, I'll show you an elaboration of the same basic idea - still based on space-filling curves, but this time using a colourCORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things.CORTE.SI
The percentage of commits by contributors is shown on the Y axis, and the matching f-value on the X axis. An f-value of 25 is the bottom quartile, 50 is the median, and 75 is the upper quartile.Looking at the Python graph, for example, we can see that the bottom 75% of contributors provided aCORTE.SI
Here's a riff on Malcolm Gladwell's rule of thumb about mastery: you don't really know a programming language until you've written 10,000 lines of production-quality code in it.Like the original this is a generalization that is undoubtedly false in many cases - still, it broadly matches my intuition for most languages and most programmers 1.At the beginning of this year, I wrote a sniffy postCORTE.SI
Clicking will show you high-detail versions of both visualizations, and let you look up the binary hash to see what it is. I've used a square Hilbert curve layout - the files start in the top-left corner, and pass through the quadrants clockwise.CORTE.SI
The Hilbert Curve is a space-filling curve that is usually produced iteratively, with the N-th step in the iteration referred to as the "order N" curve. Here are orders 1 to 5: N=1. N=2. N=3. N=4. N=5. To translate from one order to the next, we simply replace U-shapes like the the N=1 diagram with Y-shapes like the N=2 diagram. So, in the N=1CORTE.SI
Last week, I had the pleasure of attending Dropbox's annual company hack fest.It was a great opportunity to get a look at how Dropbox works internally, and mingle with the smart and driven folks who make one of my favourite products.CORTE.SI
This morning Zoe and I took Hobbes to the vet one last time. He always hated being in the cat carrier, and would pace, tense and wide-eyed, ready to spring out like a jack-in-the-box when we opened the door. Today, he just seemed tired and sore, huddled motionlessly in an uncomfortable-looking crouch. We held him together as the vet gave himCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
corte.si. I've spent a few days this week working on a side-project that relies heavily on Bloom Filters (look for a post on the result of my labours in the next week or so). If you don't know what a Bloom filter is, you should probably find out - they're very neat and have aCORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
A company that maps the deep structure of the web. binvis.io. Visualising and exploring data with space-filling curves. mitmproxy. A man-in-the-middle proxy for pen testers and developers. modd. A flexible developer tool for responding to filesystem changes. devd. A self-contained HTTP server for developers.CORTE.SI
I've just released modd, a new 1 project of mine. Like its sister project devd, it's distributed as a single, self-contained binary for all major platforms - get it while it's fresh.. Modd is a simple tool that's hard to explain pithily. It triggers commands and manages daemons in response to filesystem changes - but that is a technically-correct mouthful that doesn't really convey how it isused.
CORTE.SI
The basic idea is to use a 3-d Hilbert curve traversal of the RGB colour cube to create a palette of colours. This makes use of the locality-preserving properties of the Hilbert curve to make sure that similar elements have similar colours in the visualization. See the original post for more. So, here's a Hilbert curve mapping of a binaryfile
CORTE.SISEE MORE ON CORTE.SICORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generate CORTE.SISEE MORE ON CORTE.SICORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things.CORTE.SI
corte.si. I've spent a few days this week working on a side-project that relies heavily on Bloom Filters (look for a post on the result of my labours in the next week or so). If you don't know what a Bloom filter is, you should probably find out - they're very neat and have aCORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
A company that maps the deep structure of the web. binvis.io. Visualising and exploring data with space-filling curves. mitmproxy. A man-in-the-middle proxy for pen testers and developers. modd. A flexible developer tool for responding to filesystem changes. devd. A self-contained HTTP server for developers.CORTE.SI
I've just released modd, a new 1 project of mine. Like its sister project devd, it's distributed as a single, self-contained binary for all major platforms - get it while it's fresh.. Modd is a simple tool that's hard to explain pithily. It triggers commands and manages daemons in response to filesystem changes - but that is a technically-correct mouthful that doesn't really convey how it isused.
CORTE.SI
The basic idea is to use a 3-d Hilbert curve traversal of the RGB colour cube to create a palette of colours. This makes use of the locality-preserving properties of the Hilbert curve to make sure that similar elements have similar colours in the visualization. See the original post for more. So, here's a Hilbert curve mapping of a binaryfile
CORTE.SISEE MORE ON CORTE.SICORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generate CORTE.SISEE MORE ON CORTE.SICORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things.CORTE.SI
corte.si. I've spent a few days this week working on a side-project that relies heavily on Bloom Filters (look for a post on the result of my labours in the next week or so). If you don't know what a Bloom filter is, you should probably find out - they're very neat and have aCORTE.SI
Here's a riff on Malcolm Gladwell's rule of thumb about mastery: you don't really know a programming language until you've written 10,000 lines of production-quality code in it.Like the original this is a generalization that is undoubtedly false in many cases - still, it broadly matches my intuition for most languages and most programmers 1.At the beginning of this year, I wrote a sniffy postCORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things.CORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
corte.si. I've spent a few days this week working on a side-project that relies heavily on Bloom Filters (look for a post on the result of my labours in the next week or so). If you don't know what a Bloom filter is, you should probably find out - they're very neat and have aCORTE.SI
The percentage of commits by contributors is shown on the Y axis, and the matching f-value on the X axis. An f-value of 25 is the bottom quartile, 50 is the median, and 75 is the upper quartile.Looking at the Python graph, for example, we can see that the bottom 75% of contributors provided aCORTE.SI
In other words, an equidistant sequence of colours that are simultaneously as different from each other as possible, and where colours 'close' to each other on the sequence are as similar as possible. The result is a colour sequence that looks like this: 512-colour Hilbert-order swatch. We do, of course, pay a price for this mathematical marvelCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
This morning Zoe and I took Hobbes to the vet one last time. He always hated being in the cat carrier, and would pace, tense and wide-eyed, ready to spring out like a jack-in-the-box when we opened the door. Today, he just seemed tired and sore, huddled motionlessly in an uncomfortable-looking crouch. We held him together as the vet gave himCORTE.SI
A year ago, my wife and I decided to become citizens of New Zealand. Both of our sons were born here and are full, native Kiwis. It felt odd for our family not to have this in common, and besides, our own connection with New Zealand had grown strong over the happy decadewe'd lived here.
CORTE.SI
I used mitmproxy to observe Skout's traffic, but because the request is unencrypted any tool that allows you to inspect network traffic would be enough. The result is a stalker's wet dream - click on an anonymous profile, watch your network traffic, and find out exactly where the victim lives.CORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
Projects netograph.io A company that maps the deep structure of the web binvis.io Visualising and exploring data with space-filling curvesmitmproxy
CORTE.SI
I've just released modd, a new 1 project of mine. Like its sister project devd, it's distributed as a single, self-contained binary for all major platforms - get it while it's fresh.. Modd is a simple tool that's hard to explain pithily. It triggers commands and manages daemons in response to filesystem changes - but that is a technically-correct mouthful that doesn't really convey how it isused.
CORTE.SI
This covers the most common padding bytes, nicely highlights strings, and lumps everything else into a miscellaneous bucket. The broad outline of what we need to do next is clear - we sample the file at regular intervals, translate each sampled byte to a colour, and write the corresponding pixel to our image.CORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
Edit: Since this post, I've created an interactive tool for binary visualisation - see it at binvis.io. Last week, I wrote about visualizing binary files using space-filling curves, a technique I use when I need to get a quick overview of the broad structure of a file.Today, I'll show you an elaboration of the same basic idea - still based on space-filling curves, but this time using a colourCORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
Here's a riff on Malcolm Gladwell's rule of thumb about mastery: you don't really know a programming language until you've written 10,000 lines of production-quality code in it.Like the original this is a generalization that is undoubtedly false in many cases - still, it broadly matches my intuition for most languages and most programmers 1.At the beginning of this year, I wrote a sniffy postCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
2 - The optimal number of hash functions is about 0.7 times the number of bits per item. This means that the number of hashes is "small", varying from about 3 at a 10% false positive rate, to about 13 at a 0.01% false positive rate.CORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
Projects netograph.io A company that maps the deep structure of the web binvis.io Visualising and exploring data with space-filling curvesmitmproxy
CORTE.SI
I've just released modd, a new 1 project of mine. Like its sister project devd, it's distributed as a single, self-contained binary for all major platforms - get it while it's fresh.. Modd is a simple tool that's hard to explain pithily. It triggers commands and manages daemons in response to filesystem changes - but that is a technically-correct mouthful that doesn't really convey how it isused.
CORTE.SI
This covers the most common padding bytes, nicely highlights strings, and lumps everything else into a miscellaneous bucket. The broad outline of what we need to do next is clear - we sample the file at regular intervals, translate each sampled byte to a colour, and write the corresponding pixel to our image.CORTE.SI
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort.It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine.CORTE.SI
Edit: Since this post, I've created an interactive tool for binary visualisation - see it at binvis.io. Last week, I wrote about visualizing binary files using space-filling curves, a technique I use when I need to get a quick overview of the broad structure of a file.Today, I'll show you an elaboration of the same basic idea - still based on space-filling curves, but this time using a colourCORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
Here's a riff on Malcolm Gladwell's rule of thumb about mastery: you don't really know a programming language until you've written 10,000 lines of production-quality code in it.Like the original this is a generalization that is undoubtedly false in many cases - still, it broadly matches my intuition for most languages and most programmers 1.At the beginning of this year, I wrote a sniffy postCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
2 - The optimal number of hash functions is about 0.7 times the number of bits per item. This means that the number of hashes is "small", varying from about 3 at a 10% false positive rate, to about 13 at a 0.01% false positive rate.CORTE.SI
corte.si. Index 2020. Generative zoology with neural networks; 2019. Some personal thoughts on our national tragedyCORTE.SI
A couple of years ago a paper titled Progressive Growing of GANs for Improved Quality, Stability, and Variation cropped up on my reading list. It describes growing generative adversarial networks progressively, starting with low-resolution images, and then building up more detail as training goes on. It got quite a bit of press at the time because the authors used their idea to generateCORTE.SI
Here's a riff on Malcolm Gladwell's rule of thumb about mastery: you don't really know a programming language until you've written 10,000 lines of production-quality code in it.Like the original this is a generalization that is undoubtedly false in many cases - still, it broadly matches my intuition for most languages and most programmers 1.At the beginning of this year, I wrote a sniffy postCORTE.SI
Update See sortvis.org for many more visualisations!. I dislike animated sorting algorithm visualisations - there's too much of an air of hocus-pocus about them. Something impressive and complicated happens on screen, but more often than not the audience is left mystified. I think their creators must also know that they have precious little explanatory value, because the better ones are sexedCORTE.SI
I've just released devd, a small, self-contained, command-line-only HTTP server for developers.It started as a weekend stress-relief hack (that's a thing where I'm from), but has now become my preferred "daily driver" for most web-ish things.CORTE.SI
2 - The optimal number of hash functions is about 0.7 times the number of bits per item. This means that the number of hashes is "small", varying from about 3 at a 10% false positive rate, to about 13 at a 0.01% false positive rate.CORTE.SI
Eight years ago my wife and I walked into the Cat Protection Society near our house in Sydney on a whim - just to look, we assured each other, and most definitely not to get another cat. Thirty minutes later we emerged with a box containing a tiny ball of scraggly orange fluff, a wee kitten we immediately named Hobbes.CORTE.SI
The mailing list for my local LUG recently had a small flurry of posts on The Tau Manifesto, a proposal to replace of the constant π with τ, equal to 2π.Pro- and anti- camps quickly emerged, and much beer will likely be spilt over the issue at our next meeting. Disregarding for the moment any conceptual elegance or expanatory power that Tau might have, I was interested to know if the moveCORTE.SI
A year ago, my wife and I decided to become citizens of New Zealand. Both of our sons were born here and are full, native Kiwis. It felt odd for our family not to have this in common, and besides, our own connection with New Zealand had grown strong over the happy decadewe'd lived here.
CORTE.SI
Last week, I had the pleasure of attending Dropbox's annual company hack fest.It was a great opportunity to get a look at how Dropbox works internally, and mingle with the smart and driven folks who make one of my favourite products.ALDO CORTESI
* _@cortesi_
* _@cortesi_
* _aldo@corte.si_
* _coder_
* _security guy_
* _entrepreneur_
* _beekeeper_
* _goatherd_
* _tinkerer_
* _investor_
PROJECTS
* netograph.io A company that maps the deep structure of the web * binvis.io Visualising and exploring data with space-filling curves * mitmproxy A man-in-the-middle proxy for pen testers and developers * modd A flexible developer tool for responding to filesystem changes * devd A self-contained HTTP server for developers * qtile A hackable window manager written inPython
BLOG
* Generative zoology with neural networks_(2020-06-30)_
* Some personal thoughts on our national tragedy_(2019-03-19)_
* mitmproxy v1.0.0: Christmas Edition_(2016-12-26)_
* mitmproxy v0.18
_(2016-10-17)_
* Hobbes _(2016-03-22)_ * modd: a flexible tool for responding to filesystem change_(2016-02-11)_
* mitmproxy v0.15
_(2015-12-04)_
* Trawling Github for cookies, bookmarks and browsing history_(2015-11-26)_
...all posts
Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0