I have a large data set (12,000 rows X 14 columns); the first 4 rows as below: x1 y1 0.02 NAN NAN NAN NAN NAN NAN 0.004 NAN NAN NAN NAN x2 y2 NAN 0.003 NAN 10 NAN 0.03 NAN 0.004 NAN NAN NAN NAN x3 y3 NAN NAN NAN NAN NAN NAN NAN NAN NAN NAN NAN NAN x4 y4 NAN 0.004 NAN NAN NAN NAN 10 NAN NAN 30 NAN 0.004 I need to remove any row with "NAN" in columns 3-14 and then output the rest of the dataset. I wrote the following code: #!usr/bin/perl use warnings; … |
+0 forum
4 | ||

Hi All, I'm copying a long text from word and pasting into a html textarea and from here I send it to MySQL database. If the submited text is too long nothing happens. Any ideas on how to submit a large amount of text from a webpage to a MySQL database? Thanks in advance. Regards |
+0 forum
1 | ||

how to send mp3,avi(large) files via socket...small files with size less than 100kb is possible but how to send large file.. |
+0 forum
11 | ||

I've found out from experience and Apple Care that I can no longer print documents or .jpgs that are taller than my 23" portrait/vertical oriented monitor or any other for that matter. Preview has been crippled in Snow Leopard so that it will not recognize that the image/document is taller/longer and then spread that out into 2 to 10 or more pages. Apple senior advisor told me to try iPhoto, so I did while he was on the phone. No luck. Tried Photoshop CS4 to no avail. I finally just used a 3rd party application called SnapNDrag to take selected … |
+0 forum
3 | ||

I want to download 2 large files which is better 1-downloading each file alone or 2-download both at same time please say 1 or 2 and reason |
+0 forum
9 | ||

I would like to make a LUDICROUSLY high number calculator in Python. I am thinking 60 numbers and a decimal point. So numbers could be in a format like these: 60 numbers, 30 numbers decimal point 30 numbers (30nums.30nums), or decimal point 60 numbers (.60nums). E.g. 999,999,999,999,999,999,999,999,999,999.999999999999999999999999999999 But, I am wondering if Python has anything that would support such large numbers (including math functions)? If not, I think I can program the whole process myself, but I'd prefer not to. :) Any ideas welcome! - [B][I]WolfShield[/I][/B] |
+0 forum
4 | ||

Hi everyone! I've built prime testers and prime listers before, but they only work sufficiently fast for values <= 1e6. I was thinking about all the prime tester projects they have going on, how do they test very large numbers for primality? I'm talking numbers on the order 1e12, 1e13, or perhaps even larger (I don't know the currently feasible upper limit). Are there special numerical methods, algorithms, or tests to check large numbers? If so, please share. I'm very interested in how this works. Thanks! To get started, I'll list my own prime lister (I don't know if something … |
+0 forum
9 | ||

Yes, it's yet another thread about implementing three basic operations (addition, subtraction and multiplication) on abnormally large numbers (> 100 digits). I've stored each digit inside an array of [icode]int[/icode]s, as the following piece of code illustrates [code=C] while((ch = getchar()) != EOL) a[len_a++] = ch - CHR; [/code] Now, when it comes to adding them, I add the [i](len_number - k)[/i]th digits of both numbers, compute their reminder and their quotient, and store the reminder on the [i]k[/i]th place of the [icode]sum[/icode] array. The following piece of code works nicely for, say, 132 and 32, but when I try … |
+0 forum
7 | ||

Well, I'm making this script that deals with numbers that can go up to some VERY large numbers. Like 1.0E+150 I have tried [CODE] <?php echo number_format(1.0E+10); ?> [/CODE] But that returns 10,000,000,000 I want a way to show that number, but without the comas. Can anyone help? |
+0 forum
3 | ||

Hello everyone, This piece of C# code does not produce any overflow exception. wordsize is a constant equal to 32. the x and y can be very big at the computation time. So big that long or decimal even cant hold. But C# handles the problem even the value of the variables exceeds its limits. The computation gives thr right result.(I dont know how it does it) [CODE=C#] /** * Perform a right "spin" of the word. The rotation of the given * word <em>x</em> is rotated left by <em>y</em> bits. * Only the <em>lg(wordSize)</em> low-order bits of <em>y</em> * … |
+0 forum
5 |

The End.