Here they are disappointing again, with a really short article, short compared to the scope of the topic. It can really only count as a draft; maybe the author was interrupted, and clicked Submit by accident?
"When developing search engine technology...." maybe the first problem was calling it "developing search engine technology". Sounds pretentious to me.
Especially compared to what came out.
Stephan
I think it is just like learning anything. Keep at it.
The most important thing is whether you have an efficient way to look at what effect any changes have that you may make. Any effort you put into that is probably not going to be wasted. (Might be unit tests? Sounds like they did not come with the code)
I tried to argue with people on the wikipedia help desk: it is hard to make out when the copyright for a particular wikipedia article will expire, or has expired, since one has hardly any handle on who contributed.
It's kind of the other end of the GPL, and Creative Commons, etc. licenses.
In general I think it would be better to have markers (C) Copright-Expires-Date, instead of (C) Creation-Date. The problem being, of course, that the expiration date is tied to when the creator dies.
The slashdot article says, "German law states that they can't be referred to by name in relation to the killings."
The New York Times article says, "German courts allow the suppression of a criminal’s name in news accounts once he has paid his debt to society, noted Alexander H. Stopp, the lawyer for the two men, who are now out of prison." Note: it says "in news accounts"!
Publishing the names "in news accounts" is different from publishing the names in history articles or other. But I don't know the laws involved.
"This observation established an upper limit on the dispersion of the integalactic vacuum." -> That is not how it is presented. It is presented as if it was known to be a vacuum. (Einstein would still have an easy way out otherwise)
The form collects the date of birth only, not when they died.
Here are the fields:
* Full Name on the account
* Date of birth
* Account email addresses, which may have been used to create the account)
* Networks, which the person may have been in (e.g., the Stanford University educational network)
* Relationship to the person:
* Proof of death:an obituary or news article
* Additional information
Meaning it is not new as a method by itself, but applying it to the linking-structure of the WWW in order to produce relevant documents for a query, was new. I think it is fair to say that the Google Pagerank matters very little, outside of being able to rank otherwise
not-comparable search results.
And so it is better to state that "a specialized Eigenvector Centrality Measure can predict with great accuracy which species are vital to the existence of others" instead of "a modified version of PageRank can predict with great accuracy which species are vital to the existence of others". One can see that also when one realizes that these biologists have no query, no search, no equivalent of search keywords.
On the other hand, when the post says "Co-author Dr. Stefano Allesina realized he could apply PageRank to the problem when he stumbled across an article in a journal of applied mathematics describing the Google algorithm." -- I guess he might have found the method through the Google name.
Viewed in the context of net neutrality -- how can there be net neutrality if they don't even provide net access according to the semantics of the protocols?
Well, then there would be the equivalent of Patent-Troll-Companies.
They would just run websites to claim that their are still distributing the work (against a fee)
I never read anything useful in The Economist.
Here they are disappointing again, with a really short article, short compared to the scope of the topic. It can really only count as a draft; maybe the author was interrupted, and clicked Submit by accident?
Stephan
"When developing search engine technology ...." maybe the first problem was calling it "developing search engine technology". Sounds pretentious to me.
Especially compared to what came out.
Stephan
Having worked in recursion theory, my (mental) picture of a Turing Machine is a little different.
The tape is vertical, and the head writes and reads from the side. The "state-transition table" is next
O__________O
^
!
[ ]
Stephan
2000 lines can be enough to throw you off!
I think it is just like learning anything. Keep at it.
The most important thing is whether you have an efficient way to
look at what effect any changes have that you may make. Any effort you put into
that is probably not going to be wasted. (Might be unit tests? Sounds like they did not come with the code)
Stephan
Sorry if it was too subtle; I was suggesting spoons should get the Nobel Peace Prize before the Internet. -- Stephan
Spoon!
You wouldn't even think of running a contest to defeat this blocking method.
Stephan
I tried to argue with people on the wikipedia help desk: it is hard to make out when the copyright for a particular wikipedia article will expire, or has expired, since one has hardly any handle on who contributed.
It's kind of the other end of the GPL, and Creative Commons, etc. licenses.
In general I think it would be better to have markers (C) Copright-Expires-Date, instead of (C) Creation-Date. The problem being, of course, that the expiration date is tied to when the creator dies.
Stephan
I use loggingit.com -- been working at it for a year now. I find it really useful -- it's so simple!
Check it out for yourself.
Stephan
The term for this is "Low Quality Legal System", LQLS
Stephan
Are you using 1U just as an example or are there really rules somewhere about using only 1U's, and not 4U ?
Stephan
But was never convicted and never went to prison and never was released from prison either!
Stephan
Well, I think wikipedia articles don't count as news. There wouldn't be much argument about that.
Stephan
The slashdot article says, "German law states that they can't be referred to by name in relation to the killings."
The New York Times article says, "German courts allow the suppression of a criminal’s name in news accounts once he has paid his debt to society, noted Alexander H. Stopp, the lawyer for the two men, who are now out of prison." Note: it says "in news accounts"!
Publishing the names "in news accounts" is different from publishing the names in history articles or other.
But I don't know the laws involved.
Stephan
"This observation established an upper limit on the dispersion of the integalactic vacuum." ->
That is not how it is presented. It is presented as if it was known to be a vacuum. (Einstein would still have an easy way out otherwise)
Stephan
I thought the speed of light does depend on the medium through which light travels.
* http://en.wikipedia.org/wiki/Dispersion_(optics)
* http://en.wikipedia.org/wiki/Prism_(optics)
What they measured is a bit surprising that way.
Stephan
The form collects the date of birth only, not when they died.
Here are the fields:
* Full Name on the account
* Date of birth
* Account email addresses, which may have been used to create the account)
* Networks, which the person may have been in (e.g., the Stanford University educational network)
* Relationship to the person:
* Proof of death:an obituary or news article
* Additional information
(URL: http://www.facebook.com/help/contact.php?show_form=deceased )
Stephan
As usual, Zen is ignored. They don't take into account that when nothing happens that can also be your computation (accuracy -> oo).
Stephan
Thermodynamic cost of reversible computing
thermo-arxiv
February 1, 2008
Lev B. Levitin and Tommaso Toffoli
http://arxiv.org/pdf/quant-ph/0701237v2
Not sure it is the same as in the Phys. Rev. Lett. 99, 110502 (2007) -- linked from the article -- which is from 2007
Stephan
The pagerank algorithm is better understood as a kind of Eigenvector Centrality Measure.
See http://en.wikipedia.org/wiki/Eigenvector_centrality#Eigenvector_centrality
Meaning it is not new as a method by itself, but applying it to the linking-structure of the WWW in order to produce
relevant documents for a query, was new. I think it is fair to say that the Google Pagerank matters very little, outside of being able to rank otherwise
not-comparable search results.
And so it is better to state that "a specialized Eigenvector Centrality Measure can predict with great accuracy which species are vital to the existence of others" instead of "a modified version of PageRank can predict with great accuracy which species are vital to the existence of others". One can see that also when one realizes that these biologists have no query, no search, no equivalent of search keywords.
On the other hand, when the post says "Co-author Dr. Stefano Allesina realized he could apply PageRank to the problem when he stumbled across an article in a journal of applied mathematics describing the Google algorithm." -- I guess he might have found the method through the Google name.
Stephan
Sorry, the point was that gcc issues a warning:
m.c:7: warning: function returns address of local variable
Stephan
$ cat m.c
#include
void *f(void)
{
a:
printf("Here!\n");
return &
}
int main(int ac, char **av) ./a.out ../src/configure -v --enable-languages=c,c++,fortran,objc,obj-c++,treelang --prefix=/usr --enable-shared --with-system-zlib --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --enable-nls --with-gxx-include-dir=/usr/include/c++/4.2 --program-suffix=-4.2 --enable-clocale=gnu --enable-libstdcxx-debug --enable-objc-gc --enable-mpfr --enable-targets=all --enable-checking=release --build=i486-linux-gnu --host=i486-linux-gnu --target=i486-linux-gnu
{
goto *f();
printf("There\n");
return 0;
}
$ gcc -std=gnu99 m.c
m.c: In function âfâ(TM):
m.c:7: warning: function returns address of local variable
$
Here!
Here!
$ uname -a
Linux myosin 2.6.24-19-generic #1 SMP Wed Aug 20 22:56:21 UTC 2008 i686 GNU/Linux
$ gcc -v
Using built-in specs.
Target: i486-linux-gnu
Configured with:
Thread model: posix
gcc version 4.2.4 (Ubuntu 4.2.4-1ubuntu4)
Use a different -std switch?
Stephan
Viewed in the context of net neutrality -- how can there be net neutrality if they don't even provide net access
according to the semantics of the protocols?
Stephan
Browsers can take care of this quite well!
I think they mostly do.
Or put otherwise, this is a pretty heavy solution to the problem, if the problem is what it is to solve -- unlikely.
Stephan