HackerTrans
トップ新着トレンドコメント過去質問紹介求人

vlfig

93 カルマ登録 12 年前
Lisbon-London – Software, Politics, and Economics.

[ my public key: https://keybase.io/vlfig; my proof: https://keybase.io/vlfig/sigs/m5-4eTUpqZsAvvl2vInWmcBN29lCs_WSgL94CZuS3jo ]

コメント

vlfig
·6 日前·議論
But you still let the user put in the effort before revealing they'll have to sign up. Just be upfront.
vlfig
·24 日前·議論
You're absolutely right, and I share the frustration.

I'm thinking a possible solution to this signal-to-noise problem is to embrace the longitudinal view: instead of comparing each scan with the normal across the population compare only against past self, unless there's a risk factor that warrants it.

This way we could presumably make use of plentiful scan data and mostly look at the stuff that evolves in suspicious ways, not what looks suspicious.
vlfig
·3 か月前·議論
You are not alone. https://en.wikipedia.org/wiki/Wu_wei
vlfig
·4 か月前·議論
Don't "let it" generate tests. Be intentional. Define them in a way that's slightly oblique to how the production code approaches the problem, so the seams don't match. Heck, that's why it's good to write them before even thinking about the prod side.
vlfig
·5 か月前·議論
Eminently doable, yes.

Two notes:

- I'm not convinced the graph is necessarily cyclic. Often two codependents are actually dependent on some common bits and otherwise independent.

- this is essentially deterministic propagation of configuration (think dhall, jsonnet, etc) plus reconciliation loops for external state, terraform style — not dissimilar to how the rest of CI/CD should operate, in fact my view is this is an extension of CI/CD practices up the value stream.

I'm definitely strive for something like this when possible.
vlfig
·6 か月前·議論
Next step: embeddings and similarity.
vlfig
·9 か月前·議論
I sanction this comment.
vlfig
·10 か月前·議論
Although it isn't yet clear how much the brakes did actually brake, it is known they would never be enough.

So the cable was a critical component and initial findings suggest it wasn't being verified as rigourously, thoroughly and often as it perhaps should have.