“A low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arrivals of packets in each flow follow a Poisson process”
“It’s safe to say that when someone pays that much for a bug, they’re not going to tell the vendor to patch it.”
“Regulation is not the primary driver for new technology, new investment, or new training; the threats are”
Protecting Europe against large-scale cyber attacks
Would you have spotted this ATM skimmer?
DoE and power grid security
This entry was posted on Monday, April 5th, 2010 at 16:50 and is filed under Communications security, Mathematics, Networks, Random bits. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
Fill in your details below or click an icon to log in:
Please log in to WordPress.com to post a comment to your blog.
You are commenting using your Twitter account. ( Log Out / Change )
You are commenting using your Facebook account. ( Log Out / Change )
Connecting to %s
Notify me of follow-up comments via email.
Why Poissonian traffic models matter more now than ever, part 1 2 3 4 5 6
Common data sets and the illusion of scientific security testing
A minimal periodic coloring theorem part 1 2 3
Dynamical bias in the dice roll
The fundamental law of statistical physics
Jaynes and the Gibbs paradox
A graded lexicographic index, part 1 2 3
Solution of second-order matrix difference equations
Birds on a wire and the Ising model
The chimera of cyberdeterrence
Martingales from finite Markov processes, part 1
Initial software release
[All Equilibrium-related posts]
[All commentary]
[Nonrandom bits]
Get every new post delivered to your Inbox.
