links for 2010-08-31
Posted in delicious on September 1, 2010 by blarneyfellowlinks for 2010-08-30
Posted in delicious on August 31, 2010 by blarneyfellow-
Bottlenose is a smarter way to surf the Stream. The brainchild of Dominiek ter Heide and Nova Spivack, Bottlenose is currently in closed beta, and access is limited to only a select few. Enter Now or register to be invited when we start letting more people in. Also follow @bottlenoseapp, @dominiek and @novaspivack on Twitter to keep up with our progress.
links for 2010-08-28
Posted in delicious on August 29, 2010 by blarneyfellowlinks for 2010-08-27
Posted in delicious on August 28, 2010 by blarneyfellow-
This is a textbook about classical elementary number theory and elliptic curves. The first part discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography, computation, and deep open research problems. The second part is about elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory such as Fermats Last Theorem, the Congruent Number Problem, and the Conjecture of Birch and Swinnerton-Dyer. The intended audience of this book is an undergraduate with some familiarity with basic abstract algebra, e.g. rings, fields, and finite abelian groups.
links for 2010-08-27
Posted in delicious on August 28, 2010 by blarneyfellow-
This is a textbook about classical elementary number theory and elliptic curves. The first part discusses elementary topics such as primes, factorization, continued fractions, and quadratic forms, in the context of cryptography, computation, and deep open research problems. The second part is about elliptic curves, their applications to algorithmic problems, and their connections with problems in number theory such as Fermats Last Theorem, the Congruent Number Problem, and the Conjecture of Birch and Swinnerton-Dyer. The intended audience of this book is an undergraduate with some familiarity with basic abstract algebra, e.g. rings, fields, and finite abelian groups.
links for 2010-08-26
Posted in delicious on August 27, 2010 by blarneyfellow-
Multiple machines:
1 Overpartition the data into k blocks for k clusters (i.e. for each cluster simply randomly draw a fraction c = O(m/k) of the entire dataset).
2 Now perform stochastic gradient descent on each machine separately with constant learning rate.
3 Average the solutions between different machines.One machine/multiple cores:
One option is to execute the above loop in each core independently while working with a common shared weight vector x. This means that if we update x in a round-robin fashion we will have a delay of k-1 when using k cores. The delay is due to the time it takes between seeing an instance of f and when we can actually apply the update to x. -
In summary, I believe one of the keys to interactive narrative is to provide a continuous sense of forward progress – or at least, no sense of completely retrograde progress – and a feeling that everything that happens in the game world happens for a reason related to the storyline, not happenstance or accident. To provide true dramatic novelty, a videogame designer must abstain from two of the tools in our traditional gameplay toolbox, repetitious play and randomness.
-
A software companion to a 30+ year-old CIA research methodology, Open Source Analysis of Competing Hypotheses (ACH) will help you think objectively and logically about overwhelming amounts of data and hypotheses. It can also guide research teams toward more productive discussions by identifying the exact points of contention.
links for 2010-08-25
Posted in delicious on August 26, 2010 by blarneyfellow-
The answer is curious. Barret and Gisin prove that if there is any information shared by the experimenters and the particles they are to measure, then entanglement can be explained by some kind of hidden process that is deterministic.
In practical terms, this means that there can be no shared information between the random number generators that determine the parameters of the experiments to be made, and the particles to be measured.
But the same also holds true for the experimenters themselves. It means there can be no information shared between them and the particles to be measured either. In other words, they must have completely free will.
In fact, if an experimenter lacks even a single bit of free will then quantum mechanics can be explained in terms of hidden variables. Conversely, if we accept the veracity of quantum mechanics, then we are able to place a bound on the nature of free will.
