259 karma · joined March 1, 2011
Email me at alex.sharp@orionvm.com.au
You would probably notice that if you were using local (or even localish) sites, that there would be a dramatic improvement.
Also interesting is that this is a routed service as far as I can see....
You could then use bayes to find a final estimate of, say, H1. As each high level iteration is fairly small, feedback can be provided to the user, although it couldn't be acted on.
Speaking of which, if we have an expected number of false positives for any given number of test scores, couldn't you take the average number of positives generated as an rv and then try and determine if it is different to the expected number of false positives?
It seems as though this type of error relies on the fact that a single false positive stops the testing rather then continuing on and allowing regression to the mean. By stopping this, it should then stop, or at least reduce this type of error.
But that's not very interesting. What's interesting is if it's still useful regardless, or if there is some sort of modification that would improve it taking that into account.
Some of the claims made seem to be strange. Adding in additional choices is fine, dealing with multiple choices is fine, modifying each page as you give it to the user is fine, you're just adding in additional assumptions, which, when wrong would completely ruin your test. Similarly these results would completely ruin a bandit algorithm, because it relies on a much larger set of assumptions then a standard a/b test.
One quick example: You lose temporal independence and you are testing X and Y. For the first 15 rounds, X's metric is 100 and Y's is -100. after that, they are reversed. With an epsilon first gambit algorithm with N=15, the algorithm will simply choose X forever.
That said, they are an very interesting set of algorithms and it'd be interesting to see how brittle they are in practice.
So you take the output of the bandit algorithm and use that as an output (ie. X was the "best" design) for the next stage of design?
What type of bandit algorithm do you use?
Is it to try and better DRM the windows machines?
An OrionVM 16 gig of ram server gets an aggregate disk IO score of 156.79 vs. their 170.5 and an IOPS score of 159.79 vs. their 159.99.
And that's with redundant network backed hard disks in a visualised environment with all of those benefits and overheads.
What's also interesting is that this is a pxecloud with local 8 disk SAS raid 10 (Not san storage/etc.)
Overall, very interesting offering.
(NB: I work with orionvm a company that makes IOtastic servers)
Disclaimer: I'm a founder at orionvm
To give an example (taken from this page), put yourself into this sort of position. You have somebody who cares for you, wants all that is best for you. Somebody like a spouse. You live together, talk/etc. If you found out that they were spying on you, listening in on what you talk with to your friends, trying to find what websites you visit/etc. You'd consider it a rather massive invasion of privacy and you'd consider the spouse to be at the very least creepy, even if they were aiming to learn this information "for your own good".
Similarly a few posts here are variants on "spy on your kids", using various clandestine methods. I'd imagine that you would find it rather distasteful if your government were caught doing similar things to you, especially if the reasons used were that it was "for your own good", and yet the child's perspective in this isn't being considered.
To illustrate, say you are 18 and one day (age of majority 18), and had any of those things happen to you, you would be, quite understandably, pissed. Now as a 17 year old, your reaction would likely be unchanged, however there would be a lot less understanding and a lot more of a tendency to explain the anger generated and the resulting behavior as simply "poor behavior" of the child.
Isn't this what scrypt/bcrypt/etc. are designed for?
Basically when you get somebodies CCard, you take the details and pass them to the provider (storing them nowhere). You then receive back a token.
You can then bill said token like a standard card, but on compromise you can just invalidate all the tokens and no sensitive data has leaked.
Only the user info section of your profile gets seen by others.
ie. how long the user is on the page, how many pages they view, where they came from (did they come from google/news.yc/etc?)
If you're still stuck, send me an email! (You have no email on your profile page, btw)
For example, lets say you have one heuristic that is the number of page views on a particular page, then the number of people who fill out a particular form, then the number of people who.... (Basically various things that should correlate with sales).
The easy way is to then go through and first off measure the correlation between each heuristic and sales and then define some facsimile for the change in sales through something like the sum for all h(corr(h, s)*delta h) with h being the heuristic and s being sales.
You can then use that as a new test heuristic for A/B testing.
Where did you get the pricing from, to generate your cost estimates (ie. the 10/30c/gig)?
Currently Australia only, although if you are in the US and find it interesting, email me.
We can't due to Duponts patents on PEM :(
Once you know roughly how much it will cost and what you would need, you can file for provisional patents (at least here in AUS, IANAL), which are much cheaper and don't end up in the public domain but do establish a priority date.
Then you can easily get any monies required to secure your patents/start work, without having to worry about disclosing too much/etc.
Disclaimer: I'm a director at orionvm.
The problem is that by using a unique salt per user, you can't simply create one salted hash and use it on every user hash simultaneously, however you can still check one password each hash you generate. Bcrypt/scrypt are more secure as it requires much more effort to check each password.