User talk:Cuddlyable3

From Wikipedia, the free encyclopedia

Archives

/Archive 1

[edit] Welcome to my Talk Page

[edit] My policy is to keep my page open for any new contact or old friend with ideas on how I can help contribute to Wikipedia. Please be prepared to identify yourself to me, if asked, and do not bring conflict. WP:RPA is applied here.

Cuddlyable3 07:16, 16 July 2007 (UTC)

[edit] FPC

A Koch curve has an infinitely repeating self-similarity when it is magnified.

Anti-aliased example

900x450 pixel view of points along a finitely iterated Koch curve

Verison by Thegreenj

Your animation Image:Kochsim.gif has been nominated for Featured Picture. Beacause it has recieved some complaints over size and aliasing, I wonder if you might be able to upload a larger, anti-aliased version. It certatinly is interesting, and I would love to see a better version. J Are you green? 21:08, 6 May 2007 (UTC)

I have added notes to the image description that may interest you.Cuddlyable3 19:17, 7 May 2007 (UTC)

It really is an interesting illustration. Do you think that you could redo it as, perhaps, a 400 by 200 pixel animation in greyscale with antialiasing? I love the idea, and I would absolutely support a newer version. J Are you green? 20:07, 7 May 2007 (UTC)

Increasing the pixel resolution is easy and just makes the file bigger. Rendering in a greyscale however would need some arbitrary process which goes beyond what the Koch curve defines. Aliasing is the result of sampling in space or time (see my image description notes) so there are several possible sources to consider. Strictly speaking, we should not see a 2-D line at all, nor the structure of the fully developed Koch curve. For a beautiful image, search out (Google) the sphereflake! Cuddlyable3 08:18, 8 May 2007 (UTC)

That's OK - I just thought it might have a chance if you could do that. J Are you green? 00:39, 9 May 2007 (UTC)

To do anti-aliasing, just render it 3x as big as the final image, and shrink it down (e.g. with bi-cubic). Of course to do "perfect" anti-aliasing you'd need an infinitely large initial rendering, but it doesn't need to be perfect. A separate comment, there's too much white space as the bottom. —Pengo 15:23, 9 May 2007 (UTC)

Do you have the means to do this and see the result? The code to draw the Koch curve is rather simple and I can help you with that if you wish. However you could also take the existing image (or just one frame of it) and reduce its size to 67 x 34 pixels; that simple exercise might save you some time and possible disapointment. As to the white space, you are right that it could be reduced. Cuddlyable3 19:29, 9 May 2007 (UTC)

I reduced one frame - looks tiny but antialiased to me... If you upoload a new version of the Koch curve that is identical to this one except that it is rendered at, perhaps, 900 by 450 pixels, I can shrink it down for you to 300 by 150 pixels and get antialiasing as a side-effect, as Pengo suggested. J Are you green? 20:31, 10 May 2007 (UTC)

J, please post your reduced frame here if you can, so we can all see it. Since the object is scaling invariant we don't need to push especially large files through the Wiki server, do we?

I note that the antialiasing process Pengo describes if done on a 2-colour (monochrome) image generates a 16-colour (greyscale) image. This is because one filters by taking 3x3 blocks of pixels, using 3 different coefficients for center, mid-side and corner.

However I think a quest for an "antialiased" Koch curve by increasing pixel resolution will only lead to huge image files (slow to load) and no new aesthetic delight, until one has magnified it so much that the finite iteration limit of the curve computation becomes visible. At that stage you are just seeing a monochrome line figure, which is where it all started. Cuddlyable3 07:48, 11 May 2007 (UTC)

OK; here you go. It obviously is tiny, which is why I am asking you to render the original at 900 by 450 pixels. As for file size, relax. Your GIF is currently 4 KB; I cannot see a 900 by 450 version being more than 85 KB, still a really small file. If you upload a large verision over the current one, I'll downsample it for you. J Are you green? 20:08, 11 May 2007 (UTC)

Oh, and as for the resolution and limitations, its not really how much deatil is really there (especially for something like this where antialiasing will destroy that ultrafine detail) as how easy it is on the eye. To be honest, a 200 by 100 pixel image looks tiny on my screen (about 2 by 4 cm). I really wouldn't mind the lack detail so much as to have a larger, anti-aliased image. By the way, downsampling probably will destroy any visible limitations of the "finite iteration limit," so I wouldn't worry about that too much. J Are you green? 20:44, 11 May 2007 (UTC)

OK; there you go J. Cuddlyable3 18:14, 14 May 2007 (UTC)

This is my first time ever working with an animation, so forgive me if I did anything stupid... but here is my version. J Are you green? 00:17, 16 May 2007 (UTC)

J, I was expecting you to reduce Kochsim2 33% as you did with the tiny image, which has grey pixels. Kochsim3 is reduced only 66% and, from the looks of it, is still 2-colour (it's hard to see at the moment as I am on an office computer. I find that I can freeze the frame by jiggling energetically with the mouse!).Cuddlyable3 08:23, 16 May 2007 (UTC)

I reduced it to 66 % because it had a sufficient enough anti-aliasing effect for me. It is four shades of grey. I can upload one reduced to 300 pixels if you wish, but adding more shades of grey makes my computer play the animation too slowly. J Are you green? 20:30, 16 May 2007 (UTC)

I have replaced the big image with one that A) shows only the points along the finite Koch curve that I have been using in these animations, without connecting them with straight lines, and B) has a finer time resolution. I find it interesting that A) the thinning out of points density during the zoom can always be hidden by storing a higher iterated curve. (Mine has 4097 points which was adequate for the original 200x100 pixel illustration.) B) The subjective effect of the continuous zoom is not linear! We have self-similarity in shape but I think we need the time scale (or the zoom ratios) to be exponential to get a smooth zoom. Cuddlyable3 10:10, 17 May 2007 (UTC)

[edit] FPC

An audio signal (top) may be carried by an AM or FM radio wave.

Another of your animations is at FPC, if you would like to comment. thegreen J Are you green? 01:23, 5 September 2007 (UTC)

Thank you for letting me know. I added comments.Cuddlyable3 16:15, 5 September 2007 (UTC)

[edit] Sieve of Eratosthenes

At right is my new animation of a 2-millenium old algorithm. Bring popcorn and lean back to watch this little movie.

The Sieve of Eratosthenes finds prime numbers (white) among natural numbers (grey) by discarding multiples of each new prime discovered. This animation shows primes up to 137 but the sieve can be extended much higher using a computer.

Cuddlyable3 16:49, 19 September 2007 (UTC)

[edit] Ziggurat algorithm

Thanks for the image, but the caption and animation seem to imply that:

1. The areas A under the curve are equal, and
2. The right-hand (solid white) part is eliminated by rejection.

Neither of those are true. Each layer's black + vertical hatched regions total a constant area A (except for the base layer, which is special), and the right-hand region is eliminated by multiplying a [0,1)-distributed random point by the width of the slice x_i.

I tried to edit the caption to clarify the second point, but the first is pretty hard to fix.

Also, the fact that the distribution tail is, in fact infinite, is not clear from the graphics. It's asymptotic to, but never quite reaches, the X axis.

Sorry to complain, but to illustrate it accurately, you have to demonstrate:

1. Choose a point in a vertical interval divided evenly into 8 regions. This gives the slice number i.
2. Map that region number, via a loojup table, onto a slice of non-uniform height and width.
3. Choose a point x uniformly between 0 and x_i−1
4. Test if the point is less than x_i, and accept x immediately if so.
5. Otherwise, generate a random point y between y_i−1 and y_i and test if y < f(x). If so, accept the point. If not, restart from the beginning.
6. (Step 5 is different in the i=0 case, but let's not try to illustrate that.)

71.41.210.146 02:06, 25 September 2007 (UTC)

Thank you anonymous user. I respond on talk:ziggurat_algorithm.

Further replies in the same place. That animation seems like a ridiculous amount of work to me, but if you are inspired, far be it from me to discourage you! I have a script for a significantly different animation. I apologize for asking you to re-do so much work, but I couldn't have imagined it without seeing your first effort. 71.41.210.146 08:47, 29 September 2007 (UTC)

[edit] Barnstar

Eh, even though your images didn't make it to Featured, I still think you deserve one of these.

		The Graphic Designer's Barnstar
		Awarded for two very-near featured images, and several other very good ones. Temperalxy 21:54, 22 October 2007 (UTC)

[edit] Computation of CRC

Hello there, I saw your excellent diagrams under Linear feedback shift register and would like to submit a request for something similar for the above page. If you can also find a way to work Galois LFSRs into the text then great, my brain's tired right now and just mentioning them in the lead section would be a tease. Thanks. -- Regregex (talk) 20:35, 7 February 2008 (UTC)

Hallo Regregex. Please can you describe some more of the diagram that you would like to have made?Cuddlyable3 (talk) 12:31, 10 February 2008 (UTC)

I was thinking of an animated modified Galois LFSR to accompany Code Fragment 2 and calculate the same result as the long division example above. Also perhaps demonstrations of fragments 4 and 5 to show the difference endianness makes. -- Regregex (talk) 11:49, 12 February 2008 (UTC)

I have put 2 animations at Computation of CRC. Cuddlyable3 (talk) 14:43, 23 March 2008 (UTC)

They look great, thanks again. -- Regregex (talk) 22:22, 23 March 2008 (UTC)

[edit] User:193.156.194.5

Hello there, thank you for offering to help with any need to make contacts in Norwegian. At the moment there's no urgent need to do anything special unless you would like help with forwarding abuse reports to your network administrators there (Students can always create an account elsewhere and use it at school to edit). If so, you should take a look at Wikipedia:Abuse reports. I can help with the initial report but you would want to coordinate with the investigator / contactor. You could also volunteer to become a Norwegian "contactor" in general (see Wikipedia:Abuse reports/Volunteers)) if you have the time to do so. Regards – Zedla (talk) 04:58, 6 May 2008 (UTC)

Following your suggestion I have volunteered as contactor.Cuddlyable3 (talk) 07:09, 6 May 2008 (UTC)

[edit] re: Talk:Fuel Injection

You're welcome. It was overdue; I apologise for my tardiness and for making the remark in the first place. —Scheinwerfermann (talk) 15:31, 14 June 2008 (UTC)