Ed Poor wrote:
> I am willing to moderate any English-language mailing list
> that Elian wants me to moderate.
I am against Ed administrating one of our mailing lists since he has
repeatedly shown in the past that he is capable of all sorts of stupid
actions in the heat of the moment.
Axel
__________________________________________________
Do you Yahoo!?
Yahoo! Web Hosting - Let the expert host your site
http://webhosting.yahoo.com
Note: forwarded message attached.
__________________________________________________
Do you Yahoo!?
Yahoo! Web Hosting - Let the expert host your site
http://webhosting.yahoo.com
> It's not really a problem ;-), but it would be maybe more appropriate if
> someone native to the English wikipedia did the administration.
>
> If someone likes to do it, drop me a mail and I'll add your address to the
> administrators-list.
>
> greetings,
> elian
I am willing to moderate any English-language mailing list that Elian wants me to moderate.
Just tell me what you want me to do. For example, help sort out which posts belong on which list?
Ed Poor
From: Jimmy Wales <jwales(a)bomis.com>
Subject: Re: [Wikitech-l] Request for setting up of
the Polish mailing list
>Now *this* is funny. I also propose that we have a
meta policy >list,
>not to discuss policy, but to discuss policies on
policies. >That's
>99% of what wikipedia-l is about. :-)
There is no use to set up a meta list, it already
exist and is called the main list.
elian wrote:
> Jason Richey <jasonr(a)bomis.com> writes:
>
> > Anybody else need a list?
>
> Yes, an english list to reduce traffic at
wikipedia-l.
Yes, an english list for english users.
No, it is not a joke.
What about copying all the main list accounts on the
english list accounts ?
__________________________________________________
Do you Yahoo!?
Yahoo! Web Hosting - Let the expert host your site
http://webhosting.yahoo.com
I checked the user_id with the following:
select user_id, user_name from user where user_name like 'Throb%'
and I got:
user_id user_name
------- ---------
4754 Throbbing Monster Cock
So I think the 5 update queries Brion wrote will work.
Ed Poor
How hard is it going to be for me to change Throbbing Monster Cock's
username to TMC?
Any discussion of the wisdom of so doing should be directed to
wikipedia-l.
I can easily change his name in the table of users, but this will
break a lot of links in articles and elsewhere? So those would need
to be changed as well?
--Jimbo
I'm working on a project right now using GNU's multiprecision library.
However, and unfortunately, there are no library functions to do any
logarithmic functions.
I'm merely trying to get a ceiling (or floor) or the lg (base 2) of a
large integer. Of course, I could always send it into a loop requiring
O(lg^3(n)) to get it, but I know there must be a way to do a simpler
approximation, especially since I don't need very high precision.
I asked this question of some math associates and they suggested the usual
taylor series, etc. However, I am unable to find a satisfactory series
for a large n (taylor only works for x<1, right?).
Any help would be appreciated.
-----------------------------------------------
Chris Bourke
cbourke(a)cse.unl.edu
402-432-0795
How about shifting left, and counting how many shifts it takes to get to the first "1" digit? This will work, if you have an unsigned two's-complement integer, won't it?
Ed Poor
-----Original Message-----
From: Chris Bourke [mailto:cbourke@cse.unl.edu]
Sent: Thursday, November 14, 2002 10:19 AM
To: wikitech-l(a)wikipedia.org
Subject: [Wikitech-l] logarithmic approximations
I'm working on a project right now using GNU's multiprecision library.
However, and unfortunately, there are no library functions to do any
logarithmic functions.
I'm merely trying to get a ceiling (or floor) or the lg (base 2) of a
large integer. Of course, I could always send it into a loop requiring
O(lg^3(n)) to get it, but I know there must be a way to do a simpler
approximation, especially since I don't need very high precision.
I asked this question of some math associates and they suggested the usual
taylor series, etc. However, I am unable to find a satisfactory series
for a large n (taylor only works for x<1, right?).
Any help would be appreciated.
-----------------------------------------------
Chris Bourke
cbourke(a)cse.unl.edu
402-432-0795
> Ed, can you do a dump of a freshly created wikipedia database and let
me
> see it?
>
> Jonathan
No, I can't. I only joined the mailing list this week, and I have
neither Developer rights nor the knowledge of how to do a Wikipedia
dump. (I do know what a dump is, though.)
Regretfully,
Ed Poor
Jonathan Walther wrote:
> On Mon, Nov 11, 2002 at 06:38:41PM -0500, The Cunctator wrote:
> >I'm always suspicious when someone makes the assertion that Language or
> >Database X is vastly inferior to Language or Database Y, especially when
>
> I'm not saying Postgres would result in dramatic speedups; it's about
> equal to MySQL in speed. But I believe the slowdown caused by locks
> WOULD go away. I agree with you that better indexing could speed things
This is just like an edit war, so let's apply the NPOV. That is,
let's agree that we are working towards a faster, smoother operation
of the system, regardless of which combination of tools eventually
achieve that goal. Before we have tried Postgres, let's refrain from
claiming that it has "obvious" advantages or drawbacks. Otherwise we
risk getting entrenched in prestigious preferences, and few things can
be more destructive.
To assess whether an alternative solution really is better or worse, I
think we should begin by measuring the current performance, then
change, then measure again. Luckily, I've been running some
response time measurements continuously since we were running the
phase II software. And yes, it has gotten worse in the last 3-4 weeks
than before.
Week Percentage of samples when [[Chemistry]]
starting took more than 5 seconds to retrieve
--------- ----------------------------------------
13 May 02 9%
20 May 02 8%
27 May 02 8%
3 Jun 02 11%
10 Jun 02 8%
17 Jun 02 n/a
24 Jun 02 n/a
1 Jul 02 n/a
8 Jul 02 13%
15 Jul 02 8%
22 Jul 02 4% <-- move to phase III software, all gets faster
29 Jul 02 5%
5 Aug 02 0%
12 Aug 02 n/a
19 Aug 02 n/a
26 Aug 02 1%
2 Sep 02 n/a
9 Sep 02 n/a
16 Sep 02 n/a
23 Sep 02 n/a <-- n/a means my measurement script was broken
30 Sep 02 1%
7 Oct 02 3% <-- still pretty good
14 Oct 02 6% <-- worse
21 Oct 02 17% <-- bad
28 Oct 02 12% <-- bad
4 Nov 02 8% <-- bad
11 Nov 02 11% (Mon-Wed)
(Yes, in Sweden weeks start on Monday)
Let's get those numbers below 5% again.
My script only tries to retrieve (read) pages. It doesn't try
to submit updates. At regular intervals, it accesses a URL for a
page, and outputs a log of the date and time, the URL, the HTTP status
code, the number of bytes retrieved, and the amount of elapsed time.
If you have a better idea for how to extract useful conclusions from
such data, please let me know.
--
Lars Aronsson (lars(a)aronsson.se)
tel +46-70-7891609
http://aronsson.se/http://elektrosmog.nu/http://susning.nu/