Wikipedia:Reference desk/Computing: Difference between revisions
edited by robot: adding date header(s) |
|||
Line 1: | Line 1: | ||
<noinclude>{{Wikipedia:Reference desk/header|WP:RD/C|WP:CHD}} |
|||
[[Category:Non-talk pages that are automatically signed]] |
|||
[[Category:Pages automatically checked for incorrect links]] |
|||
[[Category:Wikipedia help forums]] |
|||
[[Category:Wikipedia reference desk|Computing]] |
|||
[[Category:Wikipedia help pages with dated sections]] |
|||
[[Category:Wikipedia resources for researchers]] |
|||
</noinclude> |
|||
= October 29 = |
|||
{{Wikipedia:Reference_desk/Archives/Computing/2008 March 8}} |
|||
== Late '90s/early 2000s MIDI generator? == |
|||
{{Wikipedia:Reference_desk/Archives/Computing/2008 March 9}} |
|||
Hello, I'm sure I've asked this before, at least once and likely twice or more, several years ago, but I've lost track of the answer in the interim so I'm asking again. |
|||
{{Wikipedia:Reference_desk/Archives/Computing/2008 March 10}} |
|||
I'm looking for a procedural MIDI generation software that existed probably by the year 2000. I do not remember what the name was; it was something similar to, but not, 'DirectMusic Composer'. It was relatively limited, but easy to use. When using it, you could pick from a selection of styles; for each style, you could select from a list of instrument sets, and a list of 'moods' that were available for that style, and you could move the instruments around on a 2D square to make them quieter, louder, or more towards the left or right side; you could set the song length, and enable or disable intro and outtro; and you could export the results to MIDI. |
|||
= March 11 = |
|||
The program was used to create some part of the music for the turn-of-the-millennium MMO "Graal Online"; consequently, examples of what the MIDI music output could sound like can be found [https://www.youtube.com/watch?v=hFZd9ChAHIE here] (played with the default Windows soundfont) and [https://www.youtube.com/playlist?list=PLyRC0Fdzog585UHkGpCJob3LuTDwmkjK1 in this playlist] (played with a different soundfont). |
|||
== Software to save memory of an application == |
|||
Can you help me figure out what this program was, please? |
|||
I wonder if there are apps that can "save" the memory usage of another app so that the memory can be loaded back later and the app would think its at the point it was at during savetime. |
|||
[[Special:Contributions/2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4|2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4]] ([[User talk:2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4|talk]]) 23:49, 29 October 2024 (UTC) |
|||
For example, ability to "save" a dos game that doesn't have a save option. |
|||
:: Found it. Microsoft Music Producer. Thank you! [[Special:Contributions/2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4|2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4]] ([[User talk:2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4|talk]]) 00:05, 30 October 2024 (UTC) |
|||
I need it to be runnable under WinXP. |
|||
Thanks! |
|||
= October 31 = |
|||
[[Special:Contributions/24.83.195.130|24.83.195.130]] ([[User talk:24.83.195.130|talk]]) 03:52, 11 March 2008 (UTC) |
|||
:Perhaps there are some debuggers or dump applications that can do that. One issue is preserving the state of all the gadgets in the PC such as the interrupt timer, video memory, sound card etc. Under DOS there is more direct control by programs and so it will be more tricky to interrupt and restore control later. [[User:Graeme Bartlett|Graeme Bartlett]] ([[User talk:Graeme Bartlett|talk]]) 04:11, 11 March 2008 (UTC) |
|||
::If possible, it would be an acceptable option for me to preserve not the dos prog itself but an emulator running it, such as doxbox. Of course I have no idea what kind of cans of worms that option can open... [[Special:Contributions/24.83.195.130|24.83.195.130]] ([[User talk:24.83.195.130|talk]]) 04:14, 11 March 2008 (UTC) |
|||
== Unsafe connection == |
|||
:One option that may be overkill but which is guaranteed to work is to use vmware server (which is free). You could run freedos or windows in the virtual machine. Vmware server allows you to suspend the state of the machine and restart it later. [[User:Morana|Morana]] ([[User talk:Morana|talk]]) 10:29, 11 March 2008 (UTC) |
|||
::Why not [[Hibernate (OS feature)|hibernate]] your whole computer? Then everything would be saved. xxx [[User:Hyper Girl]] 14:34, 11 March 2008 (UTC) |
|||
How comes I get an unsafe connection message for an ''https://'' site? The address bar shows ''https://www.--.--.--''. But the on-screen message is {{blue|The connection has timed out / An error occurred during a connection to www.---.--.--}}. The strange thing is that the address bar says it's a secure site, but the error message doesn't (and nor does Firefox's site information). Thoughts? [[User talk:Serial Number 54129|<b style="color:#7a0427;">SerialNumber</b>]]''[[Special:Contributions/Serial_Number_54129|<b style="color:#17662c;">54129</b>]]'' 16:38, 31 October 2024 (UTC) |
|||
:It sounds to me like what you want is a general [[Savestate]] feature for DOS programs. No clue if any DOS emulators have them but that'd be the term to search for. Googling for "Dosbox save state" turns up a lot of hits -- some seem to imply you can do it though I don't see instructions how anywhere. I dunno. --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 15:01, 11 March 2008 (UTC) |
|||
:The error message does not specify the communication protocol. This does not imply the protocol was less secure. --[[User talk:Lambiam#top|Lambiam]] 20:56, 31 October 2024 (UTC) |
|||
On a related note, how come [[MAME]]32 can save memory states but [[DOSBox]] can't? Is it a matter of complexity? Or is it simply that noone's bothered to program it into DSOBox yet? '''<font color="red">[[User:Zunaid|Zun]]</font><font color="green">[[User Talk:Zunaid|aid]]</font><font color="blue">[[Special:Contributions/Zunaid|©]]</font><font color="orange">[[Wikipedia:Editor review/Zunaid|®]]</font>''' 08:18, 12 March 2008 (UTC) |
|||
= November 1 = |
|||
== NEED PSP HELP!!!! == |
|||
== 360 street view images == |
|||
I have recently downloaded the god of war demo for the psp on the playstationstore.com.I took and put in the removable disk thingy or "psp" then I tried to look for a games file but I could'nt find it. AND NOW I CAN'T PLAY MY DEMO!! whats wrong. Thank you for your and generousity ([[User:Computerwookie|Computerwookie]] ([[User talk:Computerwookie|talk]]) 04:14, 11 March 2008 (UTC)) |
|||
:Downloads are supposed to go onto a memory stick - did you download onto a memory stick? Did you download onto a PC - if so you need to transfer the data to a memory stick.[[Special:Contributions/87.102.14.194|87.102.14.194]] ([[User talk:87.102.14.194|talk]]) 08:12, 11 March 2008 (UTC) |
|||
Are there any cars with cameras that are built-in in a way such that you can extract 360 street view images from them? Like Google street view, but without any added parts. ―<span style="font-family:Poppins, Helvetica, Sans-serif;">[[User:Panamitsu|Panamitsu]]</span> [[User_talk:Panamitsu|(talk)]] 07:00, 1 November 2024 (UTC) |
|||
Thank you for your answer and time but I am 100% sure it went into the psp memory card, I just can't find the game file in the psp.The only files there is the "PHOTO" and "MUSIC" place and I was able to put pictures and music in but since I can't find the "GAMES" file I cant put the game in. ([[User:Computerwookie|Computerwookie]] ([[User talk:Computerwookie|talk]]) 21:31, 11 March 2008 (UTC)) |
|||
:Most likely not. Tesla is an example. It is covered in cameras for full view, but the cameras are 720p, which is too low quality to get usable images as the vehicle speeds down the road. There isn't much reason for them to have better cameras. So, why would any other vehicle have high quality cameras all around? [[Special:Contributions/68.187.174.155|68.187.174.155]] ([[User talk:68.187.174.155|talk]]) 12:35, 1 November 2024 (UTC) |
|||
:Create it! *Right Click* → "New" → "Folder" <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:WikiY|WikiY]] ([[User talk:WikiY|talk]] • [[Special:Contributions/WikiY|contribs]]) 00:57, 12 March 2008 (UTC)</small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> |
|||
::[[Formula One]] and other racing cars often have multiple cameras, used for both TV broadcast views and for monitoring body parts at speed; some are mandatory and some optional. It may be that a particular one could have sufficient that a computer could reconstruct a 360° view (though this would not be routinely done). However, this is a very special case doubtless outside your scope of enquiry. {The poster formerly known as 87.81.230.195} [[Special:Contributions/94.6.86.81|94.6.86.81]] ([[User talk:94.6.86.81|talk]]) 13:20, 1 November 2024 (UTC) |
|||
::I think what the above is saying is you need to make a 'games' folder then download the file to that. |
|||
::Can you connect the memory stick to a PC and check if the file is anywhere in there - it looks possible that the PSP hasn't recognised it because it isn't in a specific games folder.[[Special:Contributions/87.102.17.32|87.102.17.32]] ([[User talk:87.102.17.32|talk]]) 13:11, 12 March 2008 (UTC) |
|||
:::I remember something from penny arcade recently that you had to make a folder with a crazy numerical name [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 15:37, 12 March 2008 (UTC) |
|||
::::Surely the software supports its own downloads in a simple fashion - downloads are an official feature of PSP right??[[Special:Contributions/87.102.17.32|87.102.17.32]] ([[User talk:87.102.17.32|talk]]) 20:33, 12 March 2008 (UTC) |
|||
:found this http://www.us.playstation.com/psp/downloads/systemupdate/pc.html looks like you need to create a folder called 'GAME' hopefully that fixed it.. did it work or are you still having problems?[[Special:Contributions/87.102.17.32|87.102.17.32]] ([[User talk:87.102.17.32|talk]]) 20:53, 12 March 2008 (UTC) |
|||
= November 2 = |
|||
== Cybersquatting for Fraud and Profit == |
|||
== Please Simplify - What is Answer Engine Optimization (AEO)? == |
|||
Does anyone know if there have been published cases of cybersquatting where the squatter mimics a charity site in order to receive donations? [[User:AlmostReadytoFly|AlmostReadytoFly]] ([[User talk:AlmostReadytoFly|talk]]) 09:25, 11 March 2008 (UTC) |
|||
:I don't know whether you'd consider [[Madeleine McCann]]'s disappearance as a "charity" but [http://www.timesonline.co.uk/tol/news/world/europe/article.ece]? <span style="font-family: Tahoma; font-size: 8pt;">[[User:x42bn6|<b>x42bn6</b>]] <span style="font-size: 7pt;">[[User talk:x42bn6|Talk]] [[Special:Contributions/x42bn6|Mess]]</span></span> 18:33, 11 March 2008 (UTC) |
|||
::Thanks for the interesting link, but what I meant was something that mimics the original in appearance, with a "Click here to donate" button that sends money to the squatter. [[User:AlmostReadytoFly|AlmostReadytoFly]] ([[User talk:AlmostReadytoFly|talk]]) 19:38, 11 March 2008 (UTC) |
|||
Please help me to list down the resourses from where I can learn more on What is Answer Engine Optimization (AEO)? be it a course or from any blog - Thanks in Advance [[User:MPBhopal|MPBhopal]] ([[User talk:MPBhopal|talk]]) 11:11, 2 November 2024 (UTC) |
|||
== Toshiba Laptop switching itself on == |
|||
:@[[User:MPBhopal|MPBhopal]] Maybe the same as [[query optimization]]? [[User:Shantavira|Shantavira]]|[[User talk:Shantavira|<sup>feed me</sup>]] 16:32, 2 November 2024 (UTC) |
|||
Last night my fiancé's Toshiba Satellite M30 laptop switched itself on in the middle of the night, despite the fact that she put it in standby mode before going to bed. She got up in the middle of the night, saw a glow coming from the screen, and for some reason it was on, so she had to shut it down again. We'd both been up before then and it was definitely off, so we're somewhat confused. It's actually the second time it's happened. She's worried that it may have a virus and someone is accessing it while she sleeps, and while I know this is unlikely, I can't explain what's happening. Can anyone help? Is there a known explanation for this (other than 'are you sure you turned it off?')? Thanks in advance! [[User:Phileas|Phileas]] ([[User talk:Phileas|talk]]) 12:54, 11 March 2008 (UTC) |
|||
:The term [[Answer engine]] redirects to our article [[Question answering]], which needs to be updated. [https://brave.com/blog/answer-with-ai/ This page about the Brave browser's answer engine] might make a good source. {{Bq|An answer engine is a system that tries to answer a question, rather than point to websites about the question. Thanks to the proliferation and quality of large language models (LLMs), search-integrated answer engines are now a possibility at scale. In fact, several companies that operate search engines have released similar systems (including Bing Copilot and Google Gemini).}} |
|||
:Edit- Maybe I should have mentioned that the laptop is nearly four years old. [[User:Phileas|Phileas]] ([[User talk:Phileas|talk]]) 12:56, 11 March 2008 (UTC) |
|||
:Crucially, these LLM-type answer engines rely on [[Retrieval-augmented generation]]: |
|||
:I can't think of anything except network boot, which AFAIK requires a hard ethernet connection [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 12:57, 11 March 2008 (UTC) |
|||
:{{bq|The secret ingredient of an answer engine is not the LLM that powers it [...] an effective answer engine requires both a model and access to a search engine.}} |
|||
:So [[Answer Engine Optimization]] is a branch of [[Search Engine Optimization]]. Here "optimization" is used in the sense of ''making things worse for everybody.'' It is an attempt to promote websites - or perhaps product names - to bias search engine results ''and'' the answers provided by an LLM that has accessed the search engine, and summarized the sites it found, on behalf of a user. This [https://news.ycombinator.com/item?id=42015869 comment from a Hacker News thread about ChatGPT Search] gives a clue about the details of these shenanigans: {{bq|> Why would anyone ever publish stuff on the web for free unless it was just a hobby? So that ChatGPT mentions you, not your competitor, in the answer to the user. I have seen multiple SEO agencies already advertise that.}} |
|||
:It's worth noting that one reason for the popularity of LLMs as a replacement for direct web searching is that they are currently sidestepping SEO manipulation. From [https://news.ycombinator.com/item?id=42013070 another comment on that thread]: {{bq|Third search (company name) got me an ENTIRE PAGE of ads and SEO optimized pages before the actual link to the actual product.}} |
|||
:So this AEO thing is the latest development in the [[arms race]] between those seeking to enable product promoters and those trying to provide unbiased search results. (Within a large search company like Google or Bing, these may merely be different departments.) The objective is to defeat the use of LLMs to improve search results. |
|||
:You apparently want a how-to guide. Such a guide would be hot property at the moment, I expect. That is to say, I would be surprised if anyone skilled in making money from the promotion of websites was willing to give away their secret methods for doing this in the very much hyped current context of LLMs, without ''also'' seeking money for sharing these putative secrets. |
|||
:Edit: of course, that money could come from Google ads. Since manipulating search rankings is their business, it will presumably be easy to find the sites of those most competent at it, yet difficult to find the most useful guidance. [[User:Card_Zero|<span style=" background-color:#fffff0; border:1px #995; border-style:dotted solid solid dotted;"> Card Zero </span>]] [[User_talk:Card_Zero|(talk)]] 16:57, 2 November 2024 (UTC) |
|||
::My usb-keyboard kept turning my computer on from stand-by mode until I unallowed it from doing it, but it was not a laptop and that happened quite frequently. You could try the same for all (usb-)devices. --[[Special:Contributions/212.149.216.233|212.149.216.233]] ([[User talk:212.149.216.233|talk]]) 13:48, 11 March 2008 (UTC) |
|||
= November 4 = |
|||
:For some values of "last night", some machines will change their own clocks for DST, which may for some odd reason start everything else up.... SandyJax (why amn't I logged in?) <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/66.55.10.178|66.55.10.178]] ([[User talk:66.55.10.178|talk]]) 18:45, 11 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
== floating-point "accuracy" == |
|||
• Some options exist like 'allow ethernet to wake computer' or similar things including bluetooth. [[Special:Contributions/86.139.91.153|86.139.91.153]] ([[User talk:86.139.91.153|talk]]) 11:40, 12 March 2008 (UTC) |
|||
It's frequently stated that |
|||
::My old Toshiba had a BIOS setting for a timed power-on. --<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 19:42, 12 March 2008 (UTC) |
|||
[[Floating-point arithmetic|computer floating point]] is |
|||
"inherently inaccurate", because of things like the way the C code |
|||
float f = 1. / 10.; |
|||
== I need a textfile splitter == |
|||
printf("%.15f\n", f); |
|||
tends to print <code>0.100000001490116</code>. |
|||
OS: Windows XP |
|||
Now, I know full well why it prints <code>0.100000001490116</code>, |
|||
I have thusands ASCII plain text files. Each file consists of up to hundreds of documents. Each document ends with "<b><tt>END OF DOCUMENT</tt></b>". Some individal documents are more than 500 KBytes. Some files are several MBs. These are very large text files. |
|||
since the [[decimal]] fraction 0.1 isn't representable in |
|||
[[Binary number|binary]]. |
|||
That's not the question. |
|||
My question concerns those words "inherently inaccurate", |
|||
I need to split the files into separate documents and save them. Naming is not an issue because I can rename them later. They can be indxed by a desktop search engine. |
|||
which I've come to believe are, well, inaccurate. |
|||
I believe that computer floating point is as accurate as the numbers |
|||
you feed into it and the algorithms you use on them, and that |
|||
it is also extremely precise (120 parts per billion for |
|||
[[Single-precision floating-point format|single precision]], |
|||
220 parts per quintillion for |
|||
[[Double-precision floating-point format|double precision]].) |
|||
So I would say that floating point is not inaccurate, although |
|||
it is indeed "inherently imprecise", although that's obviously |
|||
no surprise, since its precision is inherently finite (24 bits |
|||
for single precision, 53 bits for double, both assuming [[IEEE 754]]). |
|||
The other thing about binary floating point is that since it's |
|||
I tried [http://sourceforge.net/projects/textwedge/ TextWedge]. It is buggy. From time to time it fails to split the documents properly. I have no idea why some large files are correctly splited while some others are not. |
|||
done in base 2, its imprecisions show up ''differently'' than they |
|||
would in base 10, which is what leads to the <code>0.100000001490116</code> |
|||
anomaly I started this question with. (Me, I would say that |
|||
those extra nonzero digits <code>…1490116</code> are neither "inaccurate" nor |
|||
"imprecise"; they're basically just [[false precision]], since |
|||
they're beyond the precision limit of [[float32]].) |
|||
But I can see from our page on [[accuracy and precision]] that |
|||
Is there a good tool for this job? |
|||
there are a number of subtly different definitions of these |
|||
terms, so perhaps saying that floating point is "inherently |
|||
inaccurate" isn't as wrong as I've been thinking. |
|||
So my question is just, what do other people think? |
|||
Most text splitters only split files by size or by line count. Many of them do not support drag-and-drop, batch or multiple files. Some shareware products are simply crap. |
|||
Am I missing something? |
|||
Is saying "floating point is inherently inaccurate" an informal |
|||
but inaccurate approximation, or is it meaningful? |
|||
—[[User:scs|scs]] ([[User talk:scs|talk]]) 13:50, 4 November 2024 (UTC) |
|||
:[[wikt:accurate|Wiktionary: accurate]] says "accurate ... Telling the truth or giving a true result; exact", but float is not exact so it is not accurate in that sense. [[Special:Contributions/213.126.69.28|213.126.69.28]] ([[User talk:213.126.69.28|talk]]) 14:10, 4 November 2024 (UTC) |
|||
:See also {{section link|Floating-point arithmetic#Accuracy problems}}. What is not mentioned, is the problem that little inaccuracies can accumulate. For example, consider this code: |
|||
I can actually use a line splitter to do this job. I can batch replace all <tt>/n</tt> to a placeholder and then add <tt>/n</tt> before and after "<b><tt>END OF DOCUMENT</tt></b>" so the file would look like: |
|||
::<syntaxhighlight lang="python"> |
|||
x = 0.1 |
|||
for i in range(62): |
|||
x = 4*x*(1-x) |
|||
</syntaxhighlight> |
|||
:The true mathematical value computed, rounded to 15 decimals, is <code>0.256412535470218</code>, but the value computed using IEEE floating point arithmetic will come out as <code>0.988021660873313</code>. --[[User talk:Lambiam#top|Lambiam]] 16:06, 4 November 2024 (UTC) |
|||
:: {{Re|Lambiam}} Cute example. (Does it have a name?) Lately I've been impressed at how often cascading precision loss ''isn't'' a problem, although it's certainly one of the things you always have to watch out for, as here. (It's why I said "as accurate as... the algorithms you use on them".) —[[User:scs|scs]] ([[User talk:scs|talk]]) 14:28, 5 November 2024 (UTC) |
|||
:::See [[Logistic map#Solution when r = 4|Logistic map § Solution when {{math|1=''r'' = 4}}]]. --[[User talk:Lambiam#top|Lambiam]] 20:01, 5 November 2024 (UTC) |
|||
:::: {{Re|Lambiam}} Aha: An "archetypal example of complex, [[Chaos theory|chaotic]] behaviour". So we shouldn't be ''too'' surprised it's particularly sensitive to slight computational differences along the way... :-) —[[User:scs|scs]] ([[User talk:scs|talk]]) 22:48, 5 November 2024 (UTC) |
|||
:The basic floating point operations are as accurate as it possible for them to be and the specification normally talks about precision which measures the unavoidable deviation from being completely accurate. But no-one is going to carp about calling it inaccurate! [[User:NadVolum|NadVolum]] ([[User talk:NadVolum|talk]]) 16:57, 4 November 2024 (UTC) |
|||
# Very lengthy single-line document 1 ... blah ... blah ... blah ... <tt>/n</tt> |
|||
:: {{Re|NadVolum}} I am here to prove you wrong, because that is exactly what I am carping about! :-) —[[User:scs|scs]] ([[User talk:scs|talk]]) 17:31, 4 November 2024 (UTC) |
|||
# <b><tt>END OF DOCUMENT</tt></b> <tt>/n</tt> |
|||
:There are two issues with floating point numbers that are both wrapped up in "they are not accurate." I personally never say that. What I say is that the same number can be stored in memory different ways. For example, a human can tell you that 10e4 and 100e3 are the same number. But, to a computer, they are different. It doesn't parse out the value and computer 100000 and 100000. It compares exactly what it sees. 10e4 and 100e3 are not the same. Of course, computers use binary, not decimal, but that isn't the point. The point is that you have the same value being stored in different ways. You, as the human, don't control it. As you do operations on a value in memory, the value updates and the exact way it is stored can change. Separately, floating point numbers do tend to drift at the very end. So, 3.000000... can become 2.99999999... or 3.00000000....0001. That is not "wildy" inaccurate. But, 2.99999... is not the same value as 3.00000. In the end, why do we care? It comes down to programming. If you have two floating point variables x and y and you want to know if they are the same value, you can't simply compare x==y and hope to get the right answer. What if x is 3.00000.... and y is 2.99999...? Instead, you do something like abs(x-y)<0.000000001. Then, if there is a little drift or if the two numbers are the same value but stored slightly different, you get the correct answer. This came to a head way back in the 80s when there was a flame war about making the early c++ compiler automatically convert x==y to abs(x-y)<0.0000000000000000001. But, what I believe you are arguing is that memory storage should be fixed instead of the programming so the numbers are always stored in the exact same format and there is never ever any drift of any kind. That would be more difficult in my opinion. 17:24, 5 November 2024 (UTC) |
|||
# Very lengthy single-line document 2 ... blah ... blah ... blah ... <tt>/n</tt> |
|||
:: That's not what I was saying, but thanks for your reply. [P.S. <code>10e4</code> and <code>100e3</code> ''are'' the same number, in any normalized floating-point format; they're both stored as 1.52587890625 × 2<sup>16</sup>, or more to the point, in binary as 1.10000110101<sub>2</sub> × 2<sup>16</sup>.] [P.P.S. Testing <code>fabs(x - y) < some_small_number</code> is not a very good way of doing it, but that wasn't the question, either.] —[[User:scs|scs]] ([[User talk:scs|talk]]) 20:12, 5 November 2024 (UTC) |
|||
# <b><tt>END OF DOCUMENT</tt></b> <tt>/n</tt> |
|||
:::A fundamental problem is that numbers represented in numerical form, whether on paper or in a computer, are [[rational number]]s. In print, we typically have numbers of the form <math>m\cdot 10^n,</math> where <math>m</math> and <math>n</math> are whole numbers. In computers, <math>m\cdot 2^n</math> is more common. However, most numbers are not rational. There is no way to compute the exact value of, for example, <math>\frac{\ln 24591257752}{\pi\sqrt{48}}.</math> There is no known algorithm that will decide in general whether the mathematical value of such an expression with [[transcendental function]]s is itself [[Transcendental number|transcendental]], so at a branch asking whether this value is equal to <math>1</math> we have no better recourse than computing this with limited accuracy and making a decision that may be incorrect. |
|||
# Very lengthy single-line document 3 ... blah ... blah ... blah ... <tt>/n</tt> |
|||
:::BTW, "comparison tolerance" was a feature of [[APL]].<sup>[https://dl.acm.org/doi/10.1145/800114.803685]</sup> The "fuzz", as it was colloquially called, was not a fixed constant but was a system variable with the strange name {{serif|⎕ct}} to which a user could assign a value. The comparison was more complicated than just the absolute difference; it was relative to the larger absolute value of the two comparands (if not exactly equal as rational numbers). --[[User talk:Lambiam#top|Lambiam]] 21:37, 5 November 2024 (UTC) |
|||
# <b><tt>END OF DOCUMENT</tt></b> <tt>/n</tt> |
|||
:::: I actually don't agree with the claim that ''numbers represented in numerical form...are rational numbers''. If you're talking about the main use for them, namely representing physical quantities, they aren't rational numbers, not conceptually anyway. Conceptually they're "fuzzy real numbers". They don't represent any exact value, rational or otherwise, but rather a position along the real line known with some uncertainty. --[[User:Trovatore|Trovatore]] ([[User talk:Trovatore|talk]]) 22:36, 5 November 2024 (UTC) |
|||
# Very lengthy single-line document 4 ... blah ... blah ... blah ... <tt>/n</tt> |
|||
:(Taking the above comments as read:) Most of the significant issues with floating point numbers are programming errors, often slightly subtle ones. It is ''possible'' in the majority of cases to use rational numbers as an alternative, only producing a floating point representation when display or output is needed in that form. Again for the majority of cases this would be a good solution, but for a very few cases the numerator and denominator could be very large (the logistic map example above would require ~ 2^62 digits (cancelling helps but a little)), and for compute intensive cases the general slowdown could be important. All the best: ''[[User:Rich Farmbrough|Rich]] [[User talk:Rich Farmbrough|Farmbrough]]''<small> 12:00, 6 November 2024 (UTC).</small><br /> |
|||
# <b><tt>END OF DOCUMENT</tt></b> <tt>/n</tt> |
|||
:: It's conceptually wrong, though, in most cases. Floating-point numbers usually represent physical quantities, and physical quantities aren't conceptually rational numbers. What we want is something that approximates our state of knowledge about a real-valued quantity, and floating point is the closest thing we have to that in wide use. (Interval arithmetic would be a *little* closer but it's a pain.) |
|||
# Very lengthy single-line document 5 ... blah ... blah ... blah ... <tt>/n</tt> |
|||
:: That doesn't actually prove that you couldn't get good solutions with rationals, but it's kind of an article of software-engineering faith that things work best when your data structures align with your concepts. I don't know if that's ever been put to a controlled test. --[[User:Trovatore|Trovatore]] ([[User talk:Trovatore|talk]]) 18:25, 6 November 2024 (UTC) |
|||
# <b><tt>END OF DOCUMENT</tt></b> <tt>/n</tt> |
|||
:::Sure you are absolutely right for representing physical quantities in most cases - in chaotic scenarios whatever accuracy you measure with might not be enough regardless of the way you calculate. However computing is used for many purposes including mathematics. It's also used in ways where careful application of floating point will bring an acceptable answer, but naive application won't. All the best: ''[[User:Rich Farmbrough|Rich]] [[User talk:Rich Farmbrough|Farmbrough]]''<small> 23:03, 6 November 2024 (UTC).</small><br /> |
|||
# ... <tt>/n</tt> |
|||
::::Incidentally here's a perl program that gets a more accurate answer to the logistic map problem above, using floating point: |
|||
::::<syntaxhighlight lang="python"> |
|||
use Math::BigFloat; |
|||
my $x = Math::BigFloat->new('0.1'); |
|||
$x->accuracy(50); # Set desired precision |
|||
for (my $i = 0; $i < 62; $i++) { |
|||
$x = 4 * $x * (1 - $x); |
|||
} |
|||
print "$x\n"; |
|||
</syntaxhighlight> |
|||
::::All the best: ''[[User:Rich Farmbrough|Rich]] [[User talk:Rich Farmbrough|Farmbrough]]''<small> 23:07, 6 November 2024 (UTC).</small><br /> |
|||
::::: I guess you meant "...using ''arbitrary precision'' floating point" (i.e. perl's "BigFloat" package). |
|||
::::: But this ends up being a nice illustration of another principle of numerical programming, namely the importance of using excess precision for intermediate results. Evidently that call to <code>accuracy(50)</code> sets not only the final printout precision, but also the maximum precision carried through the calculations. So although it prints 50 digits, only 32 of them are correct, with the rest lost due to accumulated roundoff error along the way. (The perl program prints <code>0.25641253547021802388934423187010674334774769183115</code>, but I believe the correct answer to 50 digits — at least, according to my own, homebrew multiprecision calculator — is <code>0.25641253547021802388934423187010494728798714960746</code>.) —[[User:scs|scs]] ([[User talk:scs|talk]]) 04:02, 7 November 2024 (UTC), edited 13:45, 8 November 2024 (UTC) |
|||
::: My original question was about how to describe the imperfections, not what the imperfections are or where they come from. But since someone brought up rational numbers, my own take is that there are several models you might imagine using for how computer floating point works: |
|||
Then I can split the files every other line. I can then restore <tt>/n</tt>. |
|||
:::* [[rational numbers]] |
|||
:::* [[decimal fractions]] |
|||
:::* [[scientific notation]] |
|||
:::* [[real numbers]] |
|||
::: Now, although real numbers are arguably what floating-point numbers are the farthest from — there are an [[Uncountable set|uncountably infinite]] number of real numbers, but "only" 18,437,736,874,454,810,626 floating-point ones — it's the real numbers that floating-point at least ''tries'' to approximate. The approximation is supremely imperfect — both the range and the precision are strictly limited — but if you imagine that floating-point numbers are approximate, limited-precision renditions of certain real numbers, you won't go too far wrong. (As for the rationals, it's not strictly ''wrong'' to say that "floating point numbers are rational numbers", because the floating point numbers are indeed a proper subset of the rational numbers — but I don't think it's a useful model.) —[[User:scs|scs]] ([[User talk:scs|talk]]) 13:35, 8 November 2024 (UTC) |
|||
:::: Actually, it is "strictly wrong to say that 'floating point numbers are rational numbers'". At least there is no injective ring homomorphism from the floats into the rationals, because the arithmetic is different. <small>Of course the floats aren't literally a ring in the first place, but you can work out what I mean.</small> --[[User:Trovatore|Trovatore]] ([[User talk:Trovatore|talk]]) 19:35, 8 November 2024 (UTC) |
|||
= November 5 = |
|||
Are there GOOD tools for this job? -- [[User:Toytoy|Toytoy]] ([[User talk:Toytoy|talk]]) 18:12, 11 March 2008 (UTC) |
|||
== Monitor Is Dark == |
|||
:It would be trivial to do this with a programming language like C, Pascal (Delphi), (Visual) Basic or Perl. I take it you don't know any? I suppose it can be done with a tool that supports macro scripting but I would not be bothered with the effort. I also would not trust shareware to do this. Backup your files! [[User:Sandman30s|Sandman30s]] ([[User talk:Sandman30s|talk]]) 18:20, 11 March 2008 (UTC) |
|||
I have a Dell desktop computer running Windows 11 with a full-screen monitor. Early this afternoon, it was displaying the screen to prompt me to enter my passnumber, which I entered, and then the screen went dark. The computer itself is still functioning. I have shared some of its folders, and I can see them as shared drives on my laptop computer. My question is what I should try short of replacing the monitor. I haven't priced monitors yet, but I know that they cost between $100 and $200, and I am willing to spend that if necessary, but would of course rather spend on something else. I tried unplugging the monitor from the UPS and plugging it back in. Is there anything that can be inferred from the fact that the monitor turned off while it was logging me on? Is there anything in particular that I should try? [[User:Robert McClenon|Robert McClenon]] ([[User talk:Robert McClenon|talk]]) 00:42, 5 November 2024 (UTC) |
|||
::I'd use csplit. I think it is a standard BASH command. I'm sure there are a million other ways to do it. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 18:23, 11 March 2008 (UTC) |
|||
::Please disregard this question. I disconnected the monitor power cord from both the monitor and the power supply. Then I plugged it back into a different socket of the power supply, and back into the monitor, and the display is fine again. I don't know whether a connection had been loose or whether the socket in the power supply failed, more likely the former, but I will just leave it alone now that it is working. [[User:Robert McClenon|Robert McClenon]] ([[User talk:Robert McClenon|talk]]) 01:14, 5 November 2024 (UTC) |
|||
:I am running Windows 11 and the same thing happened to me a few hours ago. I have three monitors. All went black. The computer was still on and running, but no display except for the mouse. It took me a bit to realize that as I moved the mouse, a gray pixel moved around the screens. I forced a shutdown on the computer by long-holding the power button, turned it back on, and all three monitors started working again. [[Special:Contributions/12.116.29.106|12.116.29.106]] ([[User talk:12.116.29.106|talk]]) 17:15, 5 November 2024 (UTC) |
|||
:::That was a different problem. That sounds like a failure in Windows 11. My problem turned out to be a hardware problem. I am satisfied that I solved my problem and that you solved yours. [[User:Robert McClenon|Robert McClenon]] ([[User talk:Robert McClenon|talk]]) 04:01, 6 November 2024 (UTC) |
|||
= November 6 = |
|||
:Right, the problem is that the task you want done is highly specific to your particular needs, though the ways of doing it are relatively easy with scripting languages, so there's not going to be some sort of not-quite-scripting solution out there for this particular task. |
|||
:Given what you've told us the easiest way to do it will probably be in Visual Basic, just because you probably already have programs with VBA interpreters in them (e.g. Microsoft Office), so you won't have to install anything new, and VBA (of this sort) is relatively easy to read comparative to other scripting languages. Perhaps someone on here will take the time to write out the code for you but basically what you want to do is have it go through every file in a directory, open the file, loop through the lines of a file and see if it equals END OF DOCUMENT or not and if so take the lines since the last END OF DOCUMENT and put them in a new file (named?). I haven't written VBA in awhile so if I try to do it from scratch it'll probably be buggy (and I don't have time to really try it out), but it's not hard to do if you can find someone who knows VBA. --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 18:28, 11 March 2008 (UTC) |
|||
== Turning Off Ad Blocker == |
|||
:If you grab [[ActiveState]] [[Perl]] the following command will do the trick: |
|||
perl -ne 'sub bump { open STDOUT, ">out" . ++$i . ".txt" } bump unless $i; bump and next if /END OF DOCUMENT/; print' in.txt |
|||
:--[[User:TotoBaggins|Sean]] 14:00, 12 March 2008 (UTC) |
|||
Sometimes when I am viewing a news web site, there is a message asking me to turn off my ad blocker. I have not deliberately enabled an ad blocker, so I assume that something, maybe Norton, is blocking ads. If I am using Firefox, how do I determine what ad blocker is in use, so that I can turn it off if I want to view a page that doesn't like ad blockers? If I am using Chrome, how do I determine what ad blocker is in use, so that I can turn the ad blocker off? I have found that if I really want to bypass the ad blocker, I can use Opera, which is a less commonly used web browser, so that common security software doesn't mess with it, but I would like to be able to turn off the ad blocker if the web site tells me to turn off the ad blocker. |
|||
::I use HJSplit[http://www.freebyte.com/hjsplit/#win32] to split just about anything. --<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 19:43, 12 March 2008 (UTC) |
|||
This is sort of an electronic arms race, with electronic counter-measures, and electronic counter-counter-measures. [[User:Robert McClenon|Robert McClenon]] ([[User talk:Robert McClenon|talk]]) 04:11, 6 November 2024 (UTC) |
|||
== Anasoft Licence Manager? Nitrogen service? Anybody heard of? == |
|||
:@[[User:Robert McClenon|Robert McClenon]]: I believe it potentially could be the tracker blocking from Firefox itself. I'm not sure whether there's an easy way to see what's blocking the adverts as it could potentially be down at network level. I suspect it's Firefox blocking trackers as occasionally when I use a browser that blocks trackers, I do get ad blocker disable notices. [[User:Zippybonzo|Zippybonzo]] | [[User talk:Zippybonzo|<small>talk</small>]] | [[Special:Contributions/Zippybonzo|<small>contribs</small>]] (they/them) 13:14, 6 November 2024 (UTC) |
|||
Has anybody heard of "Anasoft License Manager" or the "Nitrogen" service? [[User:Here7ic|Here7ic]] ([[User talk:Here7ic|talk]]) 18:22, 11 March 2008 (UTC) |
|||
:{{u|Robert McClenon}}: using Firefox, I had a similar problem with YouTube, and learned that not only Adguard Adblocker and uBlock origin needed to be turned off for YouTube to work, but that Malwarebytes had also acquired an ad-blocking aspect and also needed to be turned off. |
|||
:Other than the fact that the software package -"Anasoft License Manager"- was assigned TCP ports 1083 and 1084 in the IETF's old "Well known ports" list -which makes said package at least 15 years old- a quick Google search doesn't turn up much that's useful. Um, dry nitrogen is often the working fluid of choice for pneumatic systems that must be both inert and cheap, and many machines using it are computerized. Not much help on that one. There, I'm logged in now. -[[User:SandyJax|SandyJax]] ([[User talk:SandyJax|talk]]) 19:04, 11 March 2008 (UTC) |
|||
:On Firefox, you may be able to click a jigsaw-piece icon at top right, labelled 'Extensions' and see what you currently have turned on and off. Hope this helps. {The poster formerly known as 87.81.230.195} [[Special:Contributions/94.6.86.81|94.6.86.81]] ([[User talk:94.6.86.81|talk]]) 21:52, 6 November 2024 (UTC) |
|||
==Intermittent but predictable IP connectivity== |
|||
== Windows Vista, suitable directory for standalone command line utility == |
|||
Context: I had an interesting issue, which I would like to know the technical cause of, partly out of curiosity, and partly so that I can have a more elegant fix should it recur. I resolved the issue by restarting my laptop (restarting the router didn't work and other devices did not have the problem). |
|||
My laptop had been working fine for a week or so on a new fibre connection, using the same router that we have had for several years. I went out and used my phone as a hotspot for my laptop. Came home, with hotspot turned off the to discover very intermittent Internet access. |
|||
I'm trying to help my father-in-law, who bought a new PC with Windows Vista, to get a command line utility working. I've never touched Vista. His hearing isn't too good, and he lives in a different city, so this is (a rather difficult case of) telephone support. So far, he has managed to copy the .exe file to a usb-stick. The question is, where to put it. On XP, I'd simply drop it in C:\Windows or C:\Windows\System32. Is the directory setup the same on Vista, and if so, would copying it there work as it would in xp? Otherwise, what would be the easiest solution? Having him create a directory for it, modify the PATH environment variable etc. to make Vista aware of the program would be *very* difficult. --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 19:52, 11 March 2008 (UTC) |
|||
: I believe command line support was removed from Vista. [[User:ArcAngel|ArcAngel]] ([[User talk:ArcAngel|talk]]) 21:17, 11 March 2008 (UTC) |
|||
::It's still there, just less obvious. Either hit start and search for 'cmd' or go to all programs->accessories->command prompt. Anyway, I just checked the directory structure on my Vista box, it's the same as XP - those paths are still good. Not sure if UAC would take too kindly to it, but unless it does really wierd stuff, it should be fine. What does this program do? [[User:CaptainVindaloo|CaptainVindaloo]] <sup>[[User talk:CaptainVindaloo|t]] [[Special:Contributions/CaptainVindaloo|c]] [[Special:Emailuser/CaptainVindaloo|e]]</sup> 21:29, 11 March 2008 (UTC) |
|||
:::It's good old [[grep]], which he uses for searching his genealogy data base (a ''huge'' collection of ''huge'' text files). Unfortunately, the fact that he's working from the command line does not imply that he's computer savvy, just that he started doing this on a [[CP/M]] machine... On Vista, we had a hard time even launching a shell, but [http://www.computerperformance.co.uk/vista/vista_run_command.htm this site] came to the rescue. Will we be able to copy the .exe to c:\windows from an ordinary dos shell, or will we need a shell with special privileges? If special privileges are needed, can these be acquired once the shell is launched (like su in unix)? --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 22:04, 11 March 2008 (UTC) |
|||
::::I think maybe I found the answer to my preceding question in a subpage of the site I linked to, but I'd be grateful if someone would check it out and confirm: |
|||
::::# Logon to Vista using your normal username and password. |
|||
::::# Click on the Start button |
|||
::::# Click on Start Search. |
|||
::::# Type, cmd. |
|||
::::# Right-click cmd, select 'Run as administrator' from the shortcut menu. |
|||
::::In the last step, what exactly is meant by right-clicking? Clicking on the blank background of the shell, on the icon at the top left of the window frame (system menu) or something else? If you're thinking, "well why don't you try?", remember: I cannot see the machine, the gentleman I'm trying to help does not communicate very clearly what he is doing, and has problems in hearing what I am saying. --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 22:20, 11 March 2008 (UTC) |
|||
The lap top was connected for 3 minutes, disconnected for 1 minute. I ran ping -t from command line to the gateway and logged the results. Ping -t should run once per second. I got between 177 and 179 successful pings, followed by 60-63 unsuccessful pings. I believe the slight variance from 180/60 was due to the reset happening in a lower level of the stack, so losing a little time while higher level connections were established (of course I'd expect the counts to vary by 1 or 2 simply because of the coarse resolution). |
|||
:::::That's right, I was just typing up a response to say the same thing. You need to close the command prompt, right click the command prompt icon and select run as admin from the menu. Provided the text files are in his workspace (C:\Users\''username''), there shouldn't be any more problems from here. [[User:CaptainVindaloo|CaptainVindaloo]] <sup>[[User talk:CaptainVindaloo|t]] [[Special:Contributions/CaptainVindaloo|c]] [[Special:Emailuser/CaptainVindaloo|e]]</sup> 23:04, 11 March 2008 (UTC) |
|||
::::::You definitely should ''not'' need elevated privileges to grep. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 01:49, 12 March 2008 (UTC) |
|||
:::::::Clearly not, the question was whether you need elevated privileges to copy grep.exe from the usb-stick to C:\windows. CaptainVindaloo, you're saying that you need to right-click the cmd-icon ''in the start-menu'', right? Is there no way to elevate the privileges of a shell that is already running? --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 12:54, 12 March 2008 (UTC) |
|||
::::::::Yep, it's the start menu icon you're after. I don't think there is a way of elevating cmd's permissions while it's still running. Sorry Froth, I didn't mean to imply you needed elevated permissions to use grep, I just meant you just need it once to install it in system32 without aggroing UAC. [[User:CaptainVindaloo|CaptainVindaloo]] <sup>[[User talk:CaptainVindaloo|t]] [[Special:Contributions/CaptainVindaloo|c]] [[Special:Emailuser/CaptainVindaloo|e]]</sup> 18:27, 12 March 2008 (UTC) |
|||
::::::::{{resolved}} |
|||
:::::::::Thanks a lot! --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 19:22, 12 March 2008 (UTC) |
|||
Hypotheses welcome, they should explain the 3 minute and 1 minute time spans. |
|||
Another way to do it: Browse to the desired folder. Hold down shift and right click on the folder. Select "Open Command Window Here". --<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 19:49, 12 March 2008 (UTC) |
|||
Note: I found a Reddit post where someone had connectivity in "2-3 minute" chunks , but the answers weren't particularly informative. |
|||
== Python: extreme index == |
|||
All the best: ''[[User:Rich Farmbrough|Rich]] [[User talk:Rich Farmbrough|Farmbrough]]''<small> 11:45, 6 November 2024 (UTC).</small><br /> |
|||
My Python-fu is rusty, and I've had surprisingly little luck with available documentation. |
|||
What's the "standard" way to find the '''index''' of the lowest (or highest) element in a list? —[[User:Tamfang|Tamfang]] ([[User talk:Tamfang|talk]]) 20:57, 11 March 2008 (UTC) |
|||
:Something like <code>L.index(max(L))</code>. --[[Special:Contributions/71.162.233.151|71.162.233.151]] ([[User talk:71.162.233.151|talk]]) 23:03, 11 March 2008 (UTC) |
|||
:: Okay. Seems inelegant, though, as it involves searching the list twice. —[[User:Tamfang|Tamfang]] ([[User talk:Tamfang|talk]]) 23:38, 11 March 2008 (UTC) |
|||
:::You could just do it the real way and loop through L, keeping track of the index and highest value. Probabaly no slower than using max() unless functions aren't actually interpreted on the fly, I have no idea how python works [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 01:14, 12 March 2008 (UTC) |
|||
::::My goodness, are you suggesting that a programmer actually should manually ''loop'' through a list in python! Heresy! <small>Python people are crazy-lazy, I'm just sayin'. It's like two lines, fer chrissakes!</small> --[[User:Oskar Sigvardsson|Oskar]] 10:34, 12 March 2008 (UTC) |
|||
:::Using builtins will almost always be faster than coding it explicitly, since the builtins are written in C. The following program shows the builtins (even with the double-lookup) to be 4 times faster than searching the list explicitly. --[[User:TotoBaggins|Sean]] 14:36, 12 March 2008 (UTC) |
|||
<source lang="python"> |
|||
#!/usr/bin/python |
|||
= November 9 = |
|||
import random, time |
|||
list = [random.random() for x in range)] |
|||
iterations = 1000 |
|||
start = time.time() |
|||
for i in xrange(iterations): |
|||
list.index(max(list)) |
|||
end = time.time() |
|||
per = (end - start) / iterations |
|||
print "%f seconds per loop with builtins" % per |
|||
start = time.time() |
|||
max_idx = -1 |
|||
max_val = -1 |
|||
for i in xrange(iterations): |
|||
for idx in xrange(len(list)): |
|||
if list[idx] > list[max_idx]: |
|||
max_idx = idx |
|||
end = time.time() |
|||
per = (end - start) / iterations |
|||
print "%f seconds per loop by hand" % per |
|||
</source> |
|||
:I get 7.3 times faster, and yet another 10% slower if I actually implement the <code>max_val</code> "optimization" you implied that loads each element of the list only once. With <tt>-O</tt> and (of course) a different list, I get 6.1 times faster, and 8% slower; the <code>index()</code> solution, of course, only has to rescan a random-length prefix of the list. It's amazing just how much slower Python is than C — even C that has to test the type of each list element and so on. Of course, no index manipulation has to occur, and I guess the interpreter doesn't even know that <code>xrange</code> isn't modifying the list... --[[User:Tardis|Tardis]] ([[User talk:Tardis|talk]]) 23:34, 12 March 2008 (UTC) |
|||
= March 12 = |
|||
== Distributed Computing == |
|||
I searched wikipedia on the topic "'''Large archive sharing and rights management''' " but couldnt find any article about it, can anyone please give me detail info about this topic? --[[Special:Contributions/58.65.203.8|58.65.203.8]] ([[User talk:58.65.203.8|talk]]) 08:32, 12 March 2008 (UTC) |
|||
:Of note - the search tool in Wikipedia is terrible. You are better off going to Google and seraching "large archive sharing and rights management site:wikipedia.org". As for the topic, I am confused. The name of the section here is [[distributed computing]], which is a method of running a program such that different parts of the program run on different processors, all running with a common goal for the overall program. Then, your question appears to be about large archive sharing, which I use a [[Network-attached storage|NAS]] for. Also, you mention what appears to be [[file system permissions]]. None of those topics really have a lot to do with one another. So, I'm not sure what you are asking about. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 12:06, 12 March 2008 (UTC) |
|||
::I've always been mystified why our search tool doesn't just use Google itself. --[[User:TotoBaggins|Sean]] 20:11, 12 March 2008 (UTC) |
|||
:::Because a good built-in search would be able to take into account assumptions about the structure of Wikipedia that Google can't. --[[User:Carnildo|Carnildo]] ([[User talk:Carnildo|talk]]) 20:59, 12 March 2008 (UTC) |
|||
::::Plus all the legal issues of licensing Google search, the intrusive ads, etc. It's more trouble than it's worth for the way Wikipedia is structured. -- [[User:Kesh|Kesh]] ([[User talk:Kesh|talk]]) 21:25, 12 March 2008 (UTC) |
|||
:::::And there is no reason to assume Google is anything more than the flavor of the moment. The number 1 search engine comes and goes. It won't be long before some new search engine supplants Google as #1. Why should Wikipedia blindly show support for Google over the others? Instead, it makes it very easy to choose to search with google after you click the "search" button. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 00:06, 13 March 2008 (UTC) |
|||
== Wireless broadband == |
|||
Hi, I live in the uk and have Virgin media home phone tv and internet, my internet modem is in one room and my ps3 in the other, this makes it hard to use an ethernet cable to link my ps3 to the internet, can anyone suggest a way to get around this problem (i cant move the tv nearer) <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/193.115.175.247|193.115.175.247]] ([[User talk:193.115.175.247|talk]]) 09:48, 12 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
:Get a [[Residential gateway|wireless router]]? -- [[User:Consumed Crustacean|Consumed Crustacean]] <small>([[User talk:Consumed Crustacean|talk]])</small> 14:36, 12 March 2008 (UTC) |
|||
::Yes - your PS3 has WiFi, so a wireless router would solve it. Alternately, get a longer ethernet cable. You can buy ones up to 50m in length from a big Comet store or somewhere like that (although they are expensive - I'd look online at dabs.com or somewhere like that). [[User:Neil|<u style="text-decoration:none;font:100% cursive;color:#060">Neıl</u>]] [[User_talk:Neil|<u style="text-decoration:none;color:#060">☎</u>]] 17:52, 12 March 2008 (UTC) |
|||
:::There's also power over ethernet, PCWorld stock them, they're not cheap though [[User:Silent52|Silent52]] ([[User talk:Silent52|talk]]) 03:49, 13 March 2008 (UTC) |
|||
== How to find USB port speed using visual basic 6.0 == |
|||
Hai, |
|||
I am working in visual basic 6.0.Using Cypress driver i will communicate with the Device |
|||
using USB Cable. But I have the Problem is wtether I will communicate at High Speed or Full |
|||
Speed.But I want to Communicate in Both Version USB 1.1 to USB 2.0.So Please Help me How to Find |
|||
the Speed of Port. |
|||
Details: |
|||
Cyusb.sys ------> USB Driver |
|||
Visual Basic 6.0---------> Platform(Language) |
|||
Please any one send the code to communicate or Give me guidence to Me. |
|||
Advance thanks |
|||
By |
|||
R.Rajesh Kumar <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/122.164.59.117|122.164.59.117]] ([[User talk:122.164.59.117|talk]]) 11:18, 12 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
== Watching pages? == |
|||
How much memory it would take on Wikipedia's servers if single user clicked "Watch" on the top of all >2 million articles? Yes I'm not planning to try. --[[Special:Contributions/212.149.216.233|212.149.216.233]] ([[User talk:212.149.216.233|talk]]) 13:56, 12 March 2008 (UTC) |
|||
:It would probably take a lot of memory to execute all of that php, but to actually store the user's watchlist wouldn't take more than 100mb [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 15:36, 12 March 2008 (UTC) |
|||
::That would be a monster watchlist. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 16:12, 12 March 2008 (UTC) |
|||
:::That would be a "Recent changes", I should say :) '''<span style="background:black;"> <font face="Palatino Linotype">[[User:Artyom|<font color="white"><big>A</big>R</font>]][[User talk:Artyom|<font color="limegreen">TYOM</font>]]</font> </span>''' 16:52, 12 March 2008 (UTC) |
|||
::::You ''had'' to remind me of that page. And so I dove head-first into the muck after I swore I wouldn't - and cleared up enough vandalism to somehow earn a barnstar. Now I wish I had the courage to log in. [[Special:Contributions/206.252.74.48|206.252.74.48]] ([[User talk:206.252.74.48|talk]]) 14:03, 13 March 2008 (UTC) |
|||
:::::Haha, wow! That's the first time I see a barnstar on an IP's page! Lol :) '''<span style="background:black;"> <font face="Palatino Linotype">[[User:Artyom|<font color="white"><big>A</big>R</font>]][[User talk:Artyom|<font color="limegreen">TYOM</font>]]</font> </span>''' 16:31, 13 March 2008 (UTC) |
|||
::::::It sometimes [[User_talk:24.147.86.187|happens]]. (I liked my IP more when it started with 24.147, but alas!) --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 04:00, 14 March 2008 (UTC) |
|||
: Several (three or more) years ago lengthy watchlists were a real issue, with occasional database slowdowns getting so bad that the developers had to institute severe limits on the "view my watchlist" query (not on the watchlist you actually have, but on the maximum number of watchlist changes you could see), down as few as 20 one time. Subsequent (software and DB structure) improvements seem to have mostly fixed this problem. A few times the devs have complained that people running semi-automated queries with URLs manipulated to request very large datasets have made the servers slow, but I've not seen that lately either. Most large database-backed websites eventually institude mechanisms to cull any user-generated query that's taking more than a reasonable one should (say a second or two), to limit the asymmetric leverage available to DoS-ers; I don't know of WikiMedia has done this on their MediaWiki/PHP/MySQL setup. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 17:57, 13 March 2008 (UTC) |
|||
== The Evils of Geek Squad == |
|||
A few weeks ago I asked about what was wrong with my ThinkPad and from the answers I've decided to hand my laptop over for repairs. Since I have no warrenty or anything of the sort (and I'm lazy and impatient), I'm thinking of going over to Geek Squad (which I can literally hit with a stone throw from my home) and entrusting it to their care. However, my friend told me he hates Geek Squad because they just send it back to the manufacturer - who replaces the components with cheaper ones. I really don't want to go to the local mom and pop computer repair shop (although normally I would, but this particular one charges ridiculous prices), so I'm wondering if this is true. [[Special:Contributions/206.252.74.48|206.252.74.48]] ([[User talk:206.252.74.48|talk]]) 14:39, 12 March 2008 (UTC) |
|||
:[[Geek_Squad#Controversy|This]] and the [http://ask.slashdot.org/article.pl?sid=06/06/28/ various] [http://yro.slashdot.org/article.pl?sid=06/04/13/&from=rss slashdot] [http://it.slashdot.org/article.pl?sid=07/07/06/ stores] (and their comments) may be somewhat enlightening. And there's [http://www.cbc.ca/marketplace/2007/10/03/geeks/ this] and [http://www.10tv.com/live/contentbe/EPIC_shim.php?story=sites/10tv/content/pool//.html this]... and so on. They're not ''all'' like this, but it's all YMMV. -- [[User:Consumed Crustacean|Consumed Crustacean]] <small>([[User talk:Consumed Crustacean|talk]])</small> 14:51, 12 March 2008 (UTC) |
|||
:Do '''not''' give your money to geek squad- seriously. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 15:29, 12 March 2008 (UTC) |
|||
::Circuit City's Firedog is better than Geek Squad. Personally, I'd fix my computer myself and take the opportunity to throw that stone you speak of at Geek Squad. But, being that it's a laptop, instead of a desktop, which was your first mistake, I guess take it to Circuit City. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 16:12, 12 March 2008 (UTC) |
|||
:::Every time someone asks me to repair a laptop, my solution is to send in all the guts and replace them. I'm not going to waste time poking around in those mini-components. Now, if it was a real computer, I'd happily open up the case and try to figure out specifically what is wrong and replace it with possibly better parts. So, I would expect any repair shop to do the same thing. Just swap out the guts for whatever they can find. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 16:23, 12 March 2008 (UTC) |
|||
::::Why are some of you complaining that I have a laptop? I have a desktop, and I ''do'' repair it myself. I have a laptop because it is very useful when I'm running my D&D campaigns. Like Kainaw said, everything is too damn small to mess around with. As for Firedog - the Circuit City that I could throw a stone at has turned into a restaurant, and the nearest one is 20 minutes away. But if I get enough support for Firedog then I'll risk the engine failure gladly. [[Special:Contributions/206.252.74.48|206.252.74.48]] ([[User talk:206.252.74.48|talk]]) 16:29, 12 March 2008 (UTC) |
|||
:::::I definitely wouldn't take it to a restaurant. Are you saying you aren't sure if your car can make a 20 minute drive? You may have more pressing things to fix, especially if your desktop is working fine. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 21:23, 12 March 2008 (UTC) |
|||
::::::Given current gasoline prices, a 20 minute drive can be a major consideration depending on your income and vehicle involved. -- [[User:Kesh|Kesh]] ([[User talk:Kesh|talk]]) 21:28, 12 March 2008 (UTC) |
|||
:I love the anti-laptop sentiment. Nothing more entertaining that irrational discounting of an entire category of machines on the sole basis that their compact nature makes them harder to repair, as if that were the sole deciding factor in purchasing a computer. (But not impossible. You can often find very wonderful and detailed instructions online about what order to remove things and then it's just a case of keeping track of all the screws. I've taken apart iBooks, Powerbooks, and Macbooks multiple times. It's not that hard once you've done it once and have a general idea of where everything goes. You just have to be more organized than a desktop, which you can rip into without paying much attention to what you are doing.) --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 22:47, 12 March 2008 (UTC) |
|||
::The anti-laptop sentiment is understandable. It comes from dealing with people who do not take their needs into account when purchasing a computer. They spend twice the money on a laptop with half the capabilities of a desktop and then never, under any circumstances, move the laptop off their desk. It isn't just limited to computers. A coworker just purchased a blackberry pearl. I asked if she liked the email reader. She said didn't get email service with her plan. I asked if she liked the web browser. She said she didn't get internet service with her plan. I asked what she had. Just telephone. So why, I wondered, did she buy a blackberry? Because it is the cool thing to do. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 00:03, 13 March 2008 (UTC) |
|||
:::It's ridiculous to assume that just because someone has a laptop they aren't using it as a laptop. If you've been around a university in the past four years, for example, you'll see that laptops greatly outnumber desktops because the latter force you to be bolted in one location to get any work done. In any case, berating someone for buying a laptop when they are asking about where to get it repaired is a bit like, well, something terribly unproductive, and the sort of smarmy thing that tech-savvy people do that makes the non-tech-savvy think they are all pricks. --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 00:51, 13 March 2008 (UTC) |
|||
::::I didn't voice any anti-laptop ownership rhetoric in my reply. I only mentioned that they are too small to easily work on and then explained why others have an anti-laptop sentimentality. Also, I never claimed that all the tech-savvy people weren't pricks. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 01:26, 13 March 2008 (UTC) |
|||
:::::Personal story time: I bought a laptop once, and I used it roughly as many times. There's no doubt there are people to whom laptops are invaluable, but I think that too many misidentify themselves as such. For me, having a reliable, comfortable, powerful and affordable bolted-in station for serious work & play, and a book for when I'm on the go, is a wonderful arrangement - and I think it should be satisfactory for most. -- [[User:Meni Rosenfeld|Meni Rosenfeld]] ([[User Talk:Meni Rosenfeld|talk]]) 11:29, 13 March 2008 (UTC) |
|||
== 9600gt and compatible motherboards == |
|||
Hello |
|||
I would like to purchase the graphics card here: |
|||
http://www.novatech.co.uk/novatech/specpage.html?NOV-96GTS |
|||
But was wondering whether it will work on the motherboard here: |
|||
http://www.novatech.co.uk/novatech/specpage.html?ASU-P5N32E |
|||
And if not whether you lovely guys and girls could find: |
|||
a) A motherboard it will work on for no more than £200 and sli-ready |
|||
b) Whether this motherboard: |
|||
http://www.novatech.co.uk/novatech/specpage.html?ASU-P5KC |
|||
Would be a better selection. |
|||
Thank you ever so much, I look forward to your replies. |
|||
[[Special:Contributions/89.241.203.130|89.241.203.130]] ([[User talk:89.241.203.130|talk]]) 19:56, 12 March 2008 (UTC) |
|||
:I see no reason the card shouldn't work on either of the boards. The P5KC doesn't support SLI, though. Its main advantage is that it supports both DDR2 and DDR3, but I don't think this is all that beneficial. -- [[User:Meni Rosenfeld|Meni Rosenfeld]] ([[User Talk:Meni Rosenfeld|talk]]) 21:10, 12 March 2008 (UTC) |
|||
::The 9600GT requires an extra power connector that you should make sure your PSU has. It needs a 6 pin molex connector but depending on the brand of graphics card you have it should come with an adaptor for a standard 4 pin molex connector of the sort you'd use to power an IDE hard drive. The motherboards you have posted are fine by the way, and will work with the 9600GT [[User:TheGreatZorko|TheGreatZorko]] ([[User talk:TheGreatZorko|talk]]) 13:56, 13 March 2008 (UTC) |
|||
== Download Wikipedia == |
|||
Hello, |
|||
On an unrelated subject I've always wondered if it were possible to download the entire of wikipedia (for arguments sake lets say I have a computer that is capable of holding and running this download of wikipedia). I would imagine that the process would save the entire of wikipedia as it is in that state and then transfer the data. |
|||
Just Wondering |
|||
[[Special:Contributions/89.241.203.130|89.241.203.130]] ([[User talk:89.241.203.130|talk]]) 20:01, 12 March 2008 (UTC) |
|||
:Yes, you can - see [[m:Database dumps]]. '''''<font color="#FF0000">[[User:Hut 8.5|Hut 8.5]]</font>''''' 20:06, 12 March 2008 (UTC) |
|||
::It takes a lot of computer these days, though. The last time I did it (a year and a half ago), the current versions of pages in the English Wikipedia took 100GB of disk space and ten days to import the database. --[[User:Carnildo|Carnildo]] ([[User talk:Carnildo|talk]]) 21:05, 12 March 2008 (UTC) |
|||
:::100GB! That's a lot of space to dedicate. Even though my PC's capacity is 1.1TB, I can't imagine a need to have Wikipedia offline that merits the use of 100GB. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 21:20, 12 March 2008 (UTC) |
|||
::::Compressed article pages (excluding talk pages, history, pictures, photos, user pages and so on) will take considerably less than 100 GB, though. --'''[[User:Kjoonlee|Kjoon]]'''[[User talk:Kjoonlee|lee]] 21:59, 12 March 2008 (UTC) |
|||
:::::For example, the latest pages-articles.xml.bz2 file is 3.2 G. |
|||
:::::*http://users.softlab.ece.ntua.gr/~ttsiod/buildWikipediaOffline.html |
|||
:::::*http://download.wikimedia.org/enwiki/ --'''[[User:Kjoonlee|Kjoon]]'''[[User talk:Kjoonlee|lee]] 22:03, 12 March 2008 (UTC) |
|||
::I used to have wikipedia on my pocket pc with the tomeraider files that wikimedia puts up on this page, http://download.wikimedia.org/tomeraider/, It does require the tomeraider application which i dont think is free, but you might find it useful to know. The files are not complete, eg some wikipedia files are missing, but the size is less than a Gb, you can also find tr3 files that contain pictures. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Iownatv|Iownatv]] ([[User talk:Iownatv|talk]] • [[Special:Contributions/Iownatv|contribs]]) 01:28, 13 March 2008 (UTC)</small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> |
|||
= March 13 = |
|||
== the purpose of binding a socket to an address == |
|||
In standard unix programming, what is the purpose of binding a socket (via the bind(2) command) to an address? I can see why one needs to bind to a certain port, obviously it is to tell the socket to listen on that port, but why give the option of an address? --[[User:Iownatv|Iownatv]] ([[User talk:Iownatv|talk]]) 01:22, 13 March 2008 (UTC) |
|||
:It is possible to have multiple addresses on a single computer. You need to be able to tell the computer which address to use. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 01:29, 13 March 2008 (UTC) |
|||
::what else than 127.0.0.1 would it be? the local loopback. I thought it was uncommon in code to know what one's own address is. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Iownatv|Iownatv]] ([[User talk:Iownatv|talk]] • [[Special:Contributions/Iownatv|contribs]]) 01:43, 13 March 2008 (UTC)</small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> |
|||
:::If you were using it as a server, you could use a different IP for each service: Web, FTP, SMTP, etc. If your network is divided into subnets, the you could assign an IP for each subnet. --<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 01:54, 13 March 2008 (UTC) |
|||
:::(ec) You appear to be thinking along the lines of desktop computers. I work primarily with servers. Two quick examples of multiple IP address uses: |
|||
:::*Server has a network connection to the world with an IP address of something like 11.22.33.44. There is a mirror server sitting right by it that the main program copies all changes to. The mirror is connected on a separate network connection with a fake address like 192.168.0.1. The program handles real-world activity on, say port 123 address 11.22.33.44. It talks to the mirror on, say, port 777 address 192.168.0.1. |
|||
:::*You have three websites on one server. Each requires SSL. Since the SSL handshake takes place before the hostname requested is given, you have to give the server three IP addresses. Each one requires a unique certificate for SSL. So, you listen on port 443 address 11.22.33.1, port 443 address 11.22.33.2, and port 443 address 11.22.33.3. Since you can uniquely identify which address is hit, you know which certificate to use. |
|||
:::There are many other reasons to use multiple IP addresses on a single server. I'm sure you can quickly think of a few. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 01:56, 13 March 2008 (UTC) |
|||
:::To bind to all interfaces, 0.0.0.0 is used. (I think.) <span style="font-family:monospace;">--[[User:Grawity|<font color="#06c">grawity</font>]]</span> <sup>[[User talk:Grawity|talk]] / [[User:Grawity/PGP key|PGP]]</sup> 15:46, 13 March 2008 (UTC) |
|||
==TI-BASIC semicircle== |
|||
Does anyone know how to draw a half-circle using [[TI-Basic]]? <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/68.108.249.191|68.108.249.191]] ([[User talk:68.108.249.191|talk]]) 02:04, 13 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
:Well, figure out whatever command it is to plot points and you could easily write a [[Midpoint circle algorithm]] function that would do it. --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 02:08, 13 March 2008 (UTC) |
|||
::Or not- it's a graphing calculator just graph the equation- it's going to be a lot faster than plotting individual points in BASIC. Use uhh strtoeq I think, something like that to convert "sqrt(1-x^2)" and store it in Y1, then turn Y1 on if it isn't already and then put one of the zoom commands to flush it [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 02:17, 13 March 2008 (UTC) |
|||
:::''strtoeq''? <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/68.108.249.191|68.108.249.191]] ([[User talk:68.108.249.191|talk]]) 02:29, 13 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
::::I'll check.. ok check the catalog for String>Eq( [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:35, 13 March 2008 (UTC) |
|||
::::Can you give me specific steps? It gives back an argument error. --<font color="green" face="Berling Antiqua">hello, i'm a [[User:Member|<font color="orange">member</font>]]</font> | [[User talk:Member|<font color="grey">talk to me!</font>]] 04:14, 13 March 2008 (UTC) |
|||
::::You need to write the equivalent of: |
|||
:::::x=x value of centre of circle !insert a value here |
|||
:::::y=y value of centre of circle !insert a value here |
|||
:::::a=angle that semicircle will make to the horizontal !insert a value here |
|||
:::::r=radius of circle !insert a value here |
|||
:::::For n=0 to pi step (1/(2 x pi x r) !use radians or change pi to 180 if you are using degrees |
|||
:::::plot {x + r cos (n+a) , y+ r x sin (n+a)} ! plot each point |
|||
:::::next n ! repeat for all the points |
|||
:::::stop |
|||
If you don't have a for/next loop use an 'if' statement and a loop |
|||
It should be easy for you to convert this to TI-84 syntax |
|||
If you can do that it would be interesting to look at [[Midpoint circle algorithm]] which is almost always a faster way to do it..[[Special:Contributions/87.102.8.240|87.102.8.240]] ([[User talk:87.102.8.240|talk]]) 10:18, 13 March 2008 (UTC) |
|||
:Why are you trying to plot points?! O_O Just: |
|||
String>Eq("sqrt(1 - x^2)") -> Y1 |
|||
ZoomSquare |
|||
:Note that String>Eq( is a token and so is sqrt( and so is ^2 (the 'squared' key) and so is -> (the STO key) [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 13:25, 13 March 2008 (UTC) |
|||
::Using my method I could plot semicircles at any angle, upside down, side ways etc.. |
|||
::PS I'm sure the equation is sqrt(1-x^2) or sqrt(r^2-x^2) for radius r. For x>1 (or x>r second case) there's a possibility of an error code if the computer doesn't like being given complex numbers.. I don't know how good TI are in this respect - so it may not be a problem.[[Special:Contributions/87.102.35.142|87.102.35.142]] ([[User talk:87.102.35.142|talk]]) 13:40, 13 March 2008 (UTC) |
|||
::Yeh you're right I changed it [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 14:02, 13 March 2008 (UTC) |
|||
:::Also another one near the top - changed it for you.[[Special:Contributions/83.100.138.116|83.100.138.116]] ([[User talk:83.100.138.116|talk]]) 14:40, 13 March 2008 (UTC) |
|||
== SMS Gateways: How can I send an SMS text message via email to a Korean cell phone? == |
|||
In the US, almost all cellular service providers have an e-mail address associated to each cell phone to send text messages to the phone via e-mail (e.g., number@messaging.sprintpcs.com for Sprint, number@txt.att.net for AT&T, etc.). How can I do the same with Korean cell phone companies (SK, KT, LG)? I haven't found much information about Korean cell phone SMS gateways. I would rather use the actual telecom if possible, rather than a third party service, to avoid number harvesting. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/66.75.102.95|66.75.102.95]] ([[User talk:66.75.102.95|talk]]) 03:05, 13 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
:Wow that would be quite a useful feature, are the txts sent through email free to receive? From your description it seems like that the company merely sends the content of the email through SMS to your phone so as long as the phone is compatible to SMS I don't see what's the difference between a Korean cell phone to other cell phones. --[[User: Antilived|antilived]]<sup>[[User_talk:Antilived|T]] | [[Special:Contributions/Antilived|C]] | [[User:Antilived/Gallery|G]]</sup> 05:16, 13 March 2008 (UTC) |
|||
::With [[Sprint_Nextel|Sprint]], in the US, e-mailed texts cost the same to send/receive as any domestic texts. It is really great, however, when sending international texts. Instead of being routed through the phone company's private networks, and being subject to international text fees, they are sent over the public internet as e-mail, so they just cost the same as a regular domestic text. The problem (which I'm trying to solve) is figuring out what the [[SMS gateway|SMS gateways]] are for Korean mobile telecoms. I found that [[SK_Telecom|SK]] has a data service called [http://www.nate.com/ NATE] which may be in charge of their SMS gateways (if they even have any), since I've found a few [http://www.google.com/search?hl=en&q=vmms.nate.com&btnG=Search Google results] with the ''number''@vmms.nate.com syntax. However, sending texts to a few friends using SK in Korea gets me an SMTP delivery failed response when sending from both my phone and my e-mail client on the computer. Unfortunately, I can't read Hangul, so I can't go through the nate.com site, which is all in Korean, to see if they have any support pages that could give me some more information. :( [[Special:Contributions/66.75.102.95|66.75.102.95]] ([[User talk:66.75.102.95|talk]]) 16:09, 13 March 2008 (UTC) |
|||
=="Upgrade" to XP Pro?== |
|||
Honestly, I '''''should''''' know this but I've been a little stumped with it recently. I recently (Christmas time) received a new [[Gateway]] P-6301 with [[Windows Vista]] Home Premium pre-installed on it. The computer's hardware is all still factory, with the exceptions of a few scratches. Heh. Anyway, without having to go through 10 acts of Congress could someone please tell me if there's a fairly simple and hassle-free way to ''upgrade'' to Windows XP Pro from pre-installed Vista? '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 04:48, 13 March 2008 (UTC) |
|||
:Do you have a copy of Windows XP Pro? If so, I don't think there should be a problem at all - just install XP as usual and format the drive. If you are asking about getting an XP license cheaper based on your current Vista - I don't know, but a [http://search.microsoft.com/results.aspx?q=Downgrade+XP&qsc0=0&SearchBtn0=Search&FORM=QBME1&l=1&mkt=en-US&PageType=99 quick search] at Microsoft's site (for some reason they call moving from Vista to XP "downgrading") reveals some seemingly relevant results. -- [[User:Meni Rosenfeld|Meni Rosenfeld]] ([[User Talk:Meni Rosenfeld|talk]]) 11:07, 13 March 2008 (UTC) |
|||
:::I technically don't '''own''' a copy, but I have a <s>copied</s>''LEGAL!'' disc with a good key. When I insert the disc, the option for installation is shaded over. And booting from the CD (as it doesn't want to work otherwise), I attempted to install but, of course, it just effectively ruined my current OS by removing NTLDR (and likely other key files.) '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 01:43, 14 March 2008 (UTC) |
|||
::::Yeah you're supposed to boot from the disk .. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:59, 14 March 2008 (UTC) |
|||
:: The trouble with that (just installing XP as usual) is that it consumes a licence (so you've paid for Vista, and paid for XP, but are only using one). As the Vista licence Crassic has is a Gateway OEM licence, he should approach Gateway and enquire about their Vista->XP migration options. Microsoft does allow OEMs to offer this capability (and I think provides them with some tools to that end), although they don't exactly shout it from the rooftops. I'd also check that they'll allow a return to Vista at some future time when Vista is actually finished. The other programmes I've seen (I don't know anything about Gateway's) allow you do all this on one licence without any (financial) cost. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 11:53, 13 March 2008 (UTC) |
|||
:Vista's perfectly fine if your computer doesn't suck- yours unfortunately does. What's with all the vista bashing? You're not hard or something if you stay with XP (after all, it's all Windows garbage)- XP is stable but sorely out-of-date, which is painfully obvious every time I have to work with it. Vista's a memory hog but it's a far more mature OS than 7-year-old XP. Or switch to linux and dual boot XP for gaming- for its lower memory overhead. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 13:20, 13 March 2008 (UTC) |
|||
:::You would want to make sure that XP drivers are available for all of the hardware in your Gateway, which I understand can be an issue. --[[User:LarryMac|<font color="#3EA99F">LarryMac</font>]][[User talk:LarryMac|<font color="#3EA99F"><small> | Talk</small></font>]] 13:19, 13 March 2008 (UTC) |
|||
::::Yah, I've seen a lot of Vista gateway laptops that have no device drivers for XP. You'll have a 800x600 screen, no networking. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 13:22, 13 March 2008 (UTC) |
|||
:::My computer isn't really terrible, I honestly just believe Vista is too much of a hassle to deal with currently with all of the bugs. And having to reinstall often isn't much fun, since I've heard a few of my friends have had to do it as well. '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 01:43, 14 March 2008 (UTC) |
|||
:Vista isn't actually a memory hog, and I wish people would stop calling it that. It uses about 50mb more than XP SP2, with only its services running. The rest that you see in the task manager is something called [[Superfetch]] which means Vista puts programs it thinks you might use in the RAM so they launch faster. If another program requires that memory then the Superfetch cache is emptied, and the other program is allowed to use it as normal. |
|||
:However Vista runs a lot better on 2GB of memory than the 1GB that you have (It still runs fine on 1GB of memory so I'm not sure why you want to switch). You could probably buy another 1GB stick of laptop memory for less than the price of a copy of XP Pro. [[User:TheGreatZorko|TheGreatZorko]] ([[User talk:TheGreatZorko|talk]]) 13:50, 13 March 2008 (UTC) |
|||
::I wasn't talking about [[commit charge]] I meant specifically dwm.exe. I do run vista and compiz fusion and I have the memory for it, but compositing window managers like them suck. you. dry. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 13:59, 13 March 2008 (UTC) |
|||
:DWM.exe often sits around at 30-50MB, which is hardly sucking all my memory, if that's what you are implying. Oh and turning off Aero gives you almost no speed boost by the way (because it's all done on the graphics card, and is turned off or frozen when a 3d application (or something that demands the use of the graphics card) has focus), so if you can run it you may as well keep it. [[User:TheGreatZorko|TheGreatZorko]] ([[User talk:TheGreatZorko|talk]]) 14:19, 13 March 2008 (UTC) |
|||
::My computer is an Athlon FX-60 2.6GHz Dual Core, 3GB RAM, 1.1TB HDD, 8800GTX 768MB video card, so I would call it a gaming machine. And you want to know what OS I'm running? Windows XP Pro. I recommend the upgrade from Vista to XP. You can buy a XP install disc at tigerdirect.com or newegg.com and you should be good to go. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 16:40, 13 March 2008 (UTC) |
|||
:::Why don't you like Vista? Nvidia driver support is finally ok on vista.. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 16:46, 13 March 2008 (UTC) |
|||
::::Many reasons. Memory hog (even if that is just RAM being loaded with programs it thinks I might open (I'll open it when I want it)), slower boot time, annoying "Are you sure?" messages, the start button is now a circle that doesn't say start, driver incompatibility, takes up more hard drive space. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 02:08, 14 March 2008 (UTC) |
|||
:::::Come on, think about it. Intelligent caching is exactly what you want. Firefox is already loaded in my memory even when it's not open. If I need to run firefox, it loads pretty much instantly. If I need to run anything else, that just writes completely over the cached memory. It's that simple- that memory just gets wiped immediately if you need it for ''anything'' else. So while it looks like you only have 5% memory free, half of your memory is actually superfetch and is released the instant you need it. Disable UAC (just don't run untrusted code; UAC isn't going to protect you from something malicious) to turn off the annyoing popups, disable unnecessary services just like you would in XP to speed up your boot/shutdown. Driver incompatibility isn't an issue anymore unless you're trying to downgrade to XP, in which case you have to check for driver compatability. You're right about hard drive space. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:08, 14 March 2008 (UTC) |
|||
'''Note''': My computer isn't actually that terrible, though it is factory. 160 GB hard drive (250 GB external), dual 1.46 GHz processor (533 MHz FSB) with 1 MB level-2 cache, 1 GB DDR2 memory. The only thing I dislike about it is the video card, Intel should stop integrating their cards on every machine ... though I could understand it with a laptop (Graphics Accelerator X3100 with ''up to'' 384 MB of DV memory.) Anyway, the main reason I truly wanted to switch back to XP is that I'm hoping it will help free up memory to enhance my graphics for [[Counter-Strike: Source]]. '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 01:41, 14 March 2008 (UTC) |
|||
:I was still playing CS:S when vista came out; be aware that I actually had an increase of 2-3fps when I installed vista. Yah- my [[frames per second|fps]] ''increased''. I do have 2GB of memory though and I can take a bit of Vista overhead. But the XP video and audio interfaces/stacks are ancient; I guess Vista's are more efficient, even with all the DRM :[ [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:11, 14 March 2008 (UTC) |
|||
::Wow, it ''increased'' with Vista? A bit shocking to me, but meh. I actually only get about 9fps due to both of my computers having integrated video cards. So honestly, going back to XP wouldn't help much - or at all? '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 03:40, 14 March 2008 (UTC) |
|||
:::NINE fps? How can you play?! [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:58, 14 March 2008 (UTC) |
|||
::::Haha. I generally get good fps on fight yard (fy) maps, somewhere in the range of 40 (though I could be mistaken. It's been a while.) But 80% of the time I'm on, I stick to playing 1.6 or CZ. '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 04:50, 14 March 2008 (UTC) |
|||
:::::I get better fps on the Source engine (lowest settings except 1400x1050 resolution) than on the GoldSrc engine (any settings, doesn't matter). I guess my card doesn't do opengl well or something, but CS and CZ are really choppy [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 07:58, 14 March 2008 (UTC) |
|||
== Converting Outlook mail to Mbox == |
|||
Hi. I am trying to import my mail from Outlook to Mozilla Thunderbird. If I use Thunderbird's import feature, any international character in the bodies of some messages becomes corrupted (and no character encoding tweaking on Thunderbird's end will help). If I import to Outlook Express and then to Thunderbird, the subject lines become corrupted on the Outlook -> Express step. |
|||
So, does anyone know a solution to this problem? Perhaps some script I can run that will hybridate the correct subject lines from one version of the mail with the correct bodies of the other? Or a different program to do the conversion? I have encountered an Outlook plug-in called MessageSave that can do the trick, but its trial version is too limiting and its full version is too pricey. Does anyone know of a free alternative, or at least one with a better cost / value? |
|||
Thanks. [[Special:Contributions/79.178.115.92|79.178.115.92]] ([[User talk:79.178.115.92|talk]]) 11:19, 13 March 2008 (UTC) |
|||
: I've used [http://www.aid4mail.com/ Aid4Mail] (which is commercial, if not terribly expensive) to interchange mail from a variety of formats, and in particular moving Outlook PST archives (which are its equivalent of MBOX files) to EML files that Thunderbird will read (so I'd have Outlook export a folder or account to PST, then have Aid4Mail turn them into EML files). While there are some open source libraries that claim to read Outlook's proprietary formats (and the different, incompatable, and proprietary Outlook Express formats) they don't appear to be heavily maintained and the tools that use them don't seem terribly effective. Update: Ah, I checked MessageSave's price, which is the same as Aid4Mail, so maybe this isn't what you're looking for. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 11:30, 13 March 2008 (UTC) |
|||
::Well, on one hand, Aid4Mail can do a lot more than MessageSave. On the other hand, it seems to still have problems with some of the messages. Since all I want is to convert my mail to mbox and forget any other format ever existed, I've decided to purchase MessageSave. Thanks for the help. [[Special:Contributions/79.178.115.92|79.178.115.92]] ([[User talk:79.178.115.92|talk]]) 14:31, 13 March 2008 (UTC) |
|||
:::Aid4Mail is great if you, like me, were going to be exchanging mails in various formats on a regular basis; it's a sorry state of affairs when someone who, like yourself, has to buy software just to get control of their own data for a one-time migration. If you're up for a bit of labour, you could try the following: get yourself an [[IMAP]] email account and configure both Outlook and Thunderbird to access it (Outlook, as usual, will try to do vexing things like download all the mail unless you make sure it knows not to). Then, in Outlook, drag your emails (ideally en-masse) from your existing account to the IMAP account (it should copy them up). Then, when they're all copied, use Thunderbird to drag them back down from the IMAP server to a local thunderbird folder (or you could choose to keep them in IMAP land permanently). -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 18:10, 13 March 2008 (UTC) |
|||
== Removal of icon from Sys Tray? == |
|||
Hey there, |
|||
I'm running [[Google Web Accelerator]], but I don't want it to show on the sys tray. Can I get rid of the icon on Windows XP, while still using it? |
|||
<font face="Forte">[[User:Perfect Proposal|<font color="Blue">Perfect Proposal</font>]] <sup>[[User talk:Perfect Proposal|<font color="Orange">Speak Out!</font>]]</sup></font> 14:22, 13 March 2008 (UTC) |
|||
:If you just want to hide it so that it doesn't show on the first sight (i.e. you'll have to click on the arrow at the left end of the sys tray to show the hidden icons), then you can right-click on the taskbar, go to properties, click customize, find the web accelerator and select the option "always hide" from the drop-down menu. I'm not sure if you can totally remove it, there might be an option for it in the program's options menu though, why don't you look thru it? '''<span style="background:black;"> <font face="Palatino Linotype">[[User:Artyom|<font color="white"><big>A</big>R</font>]][[User talk:Artyom|<font color="limegreen">TYOM</font>]]</font> </span>''' 16:43, 13 March 2008 (UTC) |
|||
:: Thanks! <font face="Forte">[[User:Perfect Proposal|<font color="Blue">Perfect Proposal</font>]] <sup>[[User talk:Perfect Proposal|<font color="Orange">Speak Out!</font>]]</sup></font> 00:18, 14 March 2008 (UTC) |
|||
== Google Maps == |
|||
Hello. When I open a Google Maps info window on the toolbar, I can only locate my destinations. When I ask for directions, a new Internet Explorer 7 window appears instead of a new tab. My tab settings are set such that programs open links in a new tab in the current window. How can I fix this? Thanks in advance. --[[User:Mayfare|Mayfare]] ([[User talk:Mayfare|talk]]) 15:15, 13 March 2008 (UTC) |
|||
:Maybe try holding down ctrl as you click, or right click and "Open in new tab." Or just try Firefox. --[[User:Ephilei|Ephilei]] ([[User talk:Ephilei|talk]]) 04:24, 14 March 2008 (UTC) |
|||
== Ultimate Bluetooth Mobile Phone Spy Software New Edition 2008? == |
|||
How does this work exactly? What do I need to do in order for this work? Has anyone used this before? --[[User:Jonasmanohar|Jonasmanohar]] ([[User talk:Jonasmanohar|talk]]) 16:36, 13 March 2008 (UTC) |
|||
http://www.e-stealth.com/ULTIMATE-BLUETOOTH-MOBILE-PHONE-SPY-SOFTWARE-NEW-EDITION-2008_p_1-8.html --[[User:Jonasmanohar|Jonasmanohar]] ([[User talk:Jonasmanohar|talk]]) 16:44, 13 March 2008 (UTC) |
|||
:It seems to be a program to grab data (SMS, phonebooks) from other cellphones via [[Bluetooth]]. Let's see... |
|||
:*Title: 0/5 |
|||
:*Website design: 0/5 |
|||
:*Price: -1/5 |
|||
:*Features: 2/5 |
|||
:*Overall rating: 0/5 |
|||
:Other things to notice: |
|||
:*Settings screenshot is from [http://trifinite.org/trifinite_stuff_bloooverii.html Blooover] |
|||
:*The four "Actions" shots are from [http://java.xor.sk/?en=1&x=ftp_bt BT Info] |
|||
:*One screenshot is from EasyJack |
|||
:Overall rating: '''SCAM!''' |
|||
:I suggest you to try [http://java.xor.sk/?en=1&x=ftp_bt BT Info] instead of wasting money. <span style="font-family:monospace;">--[[User:Grawity|<font color="#06c">grawity</font>]]</span> <sup>[[User talk:Grawity|talk]] / [[User:Grawity/PGP key|PGP]]</sup> 17:29, 13 March 2008 (UTC) |
|||
I'm sorry, Grawity, do you mind this in layman's terms? Also, how do I use the link you just provided? --[[User:Jonasmanohar|Jonasmanohar]] ([[User talk:Jonasmanohar|talk]]) 18:11, 13 March 2008 (UTC) |
|||
:[[Bluetooth]] is a short-range (10 or 100 m) wireless connection, usually between two mobile phones. |
|||
:There are programs that let you control other phones via Bluetooth - steal phonebooks and SMS, play sounds, call someone, usually without phone owner's knowledge. |
|||
:The program you linked to claims to do exactly that, but: |
|||
:*The screenshots (pictures) are actually from other programs. I've recognized BloooverII, BT Info and EasyJack. So in fact they're selling programs which are created by others and available for free. |
|||
:*The website's design is AWFUL. I don't trust any website which has such design. |
|||
:In short, it is a [[scam]]. |
|||
:If you have a phone with Bluetooth (and know how to use it), download [http://java.xor.sk/?en=1&x=ftp_bt BT Info] (click "ftp_bt 1.08") and copy it to your phone. <span style="font-family:monospace;">--[[User:Grawity|<font color="#06c">grawity</font>]]</span> <sup>[[User talk:Grawity|talk]] / [[User:Grawity/PGP key|PGP]]</sup> 08:46, 14 March 2008 (UTC) |
|||
::Isn't Bluetooth communications encrypted precisely to prevent this sort of thing? Why would anyone use it if this is possible? -- [[User:Meni Rosenfeld|Meni Rosenfeld]] ([[User Talk:Meni Rosenfeld|talk]]) 10:48, 14 March 2008 (UTC) |
|||
:::Yes, Bluetooth is encrypted, but the idea is that if you connect ("pair") two devices, for example, your and my phones, they both trust each other - I can connect to any paired device and most of them either do not ask owner for permission or are set to "always allow". Also, you can set your device name to "Enter 1234", go into a mall, and try to pair with everyone (using PIN 1234). |
|||
:::So now our devices are paired, and your phone allows mine to connect - and I do. You probably click "Allow" before even reading that darn popup which just appeared, and then I have absolute control over your phone. (That is, while your phone is in the range - 10 meters, or in some phones 100 m.) I can make your phone call me (and listen to whatever you're doing), I can change language (to Chinese for example), start a MP3, edit phonebook. |
|||
:::The problem is that you're not supposed to add a device if you don't trust its owner. <span style="font-family:monospace;">--[[User:Grawity|<font color="#06c">grawity</font>]]</span> <sup>[[User talk:Grawity|talk]] / [[User:Grawity/PGP key|PGP]]</sup> 14:50, 14 March 2008 (UTC) |
|||
That website almost certainly breaks laws eg [[passing off]] I'm not even going to try clicking on it as it sounds like an virus nest. Perhaps someone who knows what to do would care to report this to a regulatory body.[[Special:Contributions/87.102.83.204|87.102.83.204]] ([[User talk:87.102.83.204|talk]]) 11:21, 14 March 2008 (UTC) |
|||
As far as I'm concerned LARGE RED LETTERS mean only one thing - virus or spyware or spam or trojan. Give it a miss.[[Special:Contributions/87.102.83.204|87.102.83.204]] ([[User talk:87.102.83.204|talk]]) 11:23, 14 March 2008 (UTC) |
|||
== Simulating PowerPoint's increase/decrease font size features in OpenOffice.org Impress == |
|||
In PowerPoint, you can select a block of text and adjust the font size (upward or downward) by clicking the "increase font size" or "decrease font size" buttons. These buttons increases/decreases the font size of the selected text to the next predefined font size in the "font size" dropdown list. If original font size is between two predefined font sizes, the adjusted font size will be between two (new) predefined font sizes, too. In other words, relative font size is preserved in the adjustments. |
|||
These functions are not available natively in OpenOffice.org Impress. Is there simple way to add these functions to Impress, perhaps by means of an extension or via OpenOffice.org Basic macros? --[[Special:Contributions/71.162.242.230|71.162.242.230]] ([[User talk:71.162.242.230|talk]]) 16:21, 13 March 2008 (UTC) |
|||
== Linux System Calls == |
|||
What methods there are to do system calls on Linux, from x86 assembly viewpoint? It was easy enough to find int 80h, but what about mysterious glibc & others? I'm such of a hobbyist in all this (weird that way, should I say) that I don't have any clue on how they work. I'd just like to see a somewhat complete list here of elsewhere. --[[Special:Contributions/212.149.217.84|212.149.217.84]] ([[User talk:212.149.217.84|talk]]) 18:14, 13 March 2008 (UTC) |
|||
:I only know a little assembly but it seems like since the kernel is written in C and has a C interface, you'd need to use C [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 18:38, 13 March 2008 (UTC) |
|||
:[http://asm.sourceforge.net/ This site] will get you started. The basic idea is that you stick a syscall number from /usr/include/asm-i386/unistd.h into %eax, then put argument 1 in %ebx, argument 2 in %ecx, and so on. Do the int $0x80 to [[trap]] into the kernel, and get the return value out of %eax. E.g., to call time(), which is syscall #13, we do: |
|||
movl $13, %eax |
|||
movl $0, %ebx |
|||
int $0x80 |
|||
:Now %eax will contain the current [[unix time]]. As for [[glibc]], that's just a normal [[user space]] library (albeit one that makes heavy use of system calls), and has nothing to do with them ''per se''. --[[User:TotoBaggins|Sean]] 19:39, 13 March 2008 (UTC) |
|||
== Simulating PowerPoint's increase/decrease font size features in OpenOffice.org Impress == |
|||
In PowerPoint, you can select a block of text and adjust the font size (upward or downward) by clicking the "increase font size" or "decrease font size" buttons. These buttons increases/decreases the font size of the selected text to the next predefined font size in the "font size" dropdown list. If original font size is between two predefined font sizes, the adjusted font size will be between two (new) predefined font sizes, too. In other words, relative font size is preserved in the adjustments. |
|||
These functions are not available natively in OpenOffice.org Impress. Is there simple way to add these functions to Impress, perhaps by means of an extension or via OpenOffice.org Basic macros? --[[Special:Contributions/71.162.242.230|71.162.242.230]] ([[User talk:71.162.242.230|talk]]) 16:21, 13 March 2008 (UTC) |
|||
== Explorer.exe large Virtual Memory usage == |
|||
Hello to all. All my problems started when I was writing a program in Python (PythonWim IDE), requesting it to store quite large bitmap in memory, and then write it to a file. In calculating what to put in its header as width and height, I divided wrongly by 16 instead of 256, and ended up with astronomically large width and height values (57000x12000). Upon attempting to view the file (from my desktop) in Paint, everything locked up, needing to be resolved by closing a few processes (including explorer.exe). |
|||
Upon restarting the explorer.exe process, it began with quite a small amount of virtual memory usage (5000 kB), then suddenly jumping to 600 000 kB and locking up. Of course, I tried a reboot, but it didn't work. The problem does not seem to occur on other accounts apart from mine (the only administrator account). |
|||
To try to solve it, I fired up ''WinDbg'' and chose ''Step over'' many times until finally reaching the point where memory usage darted up. It did so in two stages: first to 250 000 kB, then to 600 000 kB. The error seems to occur in the BrowseUI.dll module of the explorer.exe process. This is the output of ''!analyze -v'': |
|||
<code> |
|||
================== |
|||
Exception Analysis |
|||
================== |
|||
FAULTING_IP: |
|||
GDI32!StretchDIBits+1bd |
|||
77f2c6ec f3a5 rep movs dword ptr es:[edi],dword ptr [esi] |
|||
Attempt to read from address |
|||
FAULTING_THREAD: 000009b0 |
|||
DEFAULT_BUCKET_ID: APPLICATION_FAULT |
|||
PROCESS_NAME: explorer.exe |
|||
ERROR_CODE: (NTSTATUS) 0xc - The instruction at "0x%08lx" referenced memory at "0x%08lx". The memory could not be "%s". |
|||
READ_ADDRESS: |
|||
BUGCHECK_STR: ACCESS_VIOLATION |
|||
LAST_CONTROL_TRANSFER: from 7e to 77f2c6ec |
|||
STACK_TEXT: |
|||
00ece84c 7e GDI32!StretchDIBits+0x1bd |
|||
00ece898 7e USER32!SmartStretchDIBits+0x16e |
|||
00ece8ec 7e USER32!BitmapFromDIB+0x1cf |
|||
00ece934 7e4284aa 2021000e USER32!ConvertDIBBitmap+0x10a |
|||
00ecedec 7e 00ecf USER32!RtlLoadObjectFromDIBFile+0x2e4 |
|||
00ecee10 7e4254de 7e 00ecf USER32!ObjectFromDIBResource+0x25 |
|||
00ecee60 7e422d2a USER32!LoadBmp+0x4b5 |
|||
00ecee84 7e 00ecf USER32!LoadImageW+0x7c |
|||
00eceed4 7e444d0a 00ecf USER32!ExtractIconFromBMP+0x35 |
|||
00ecf340 7ca2239b 00ecf USER32!PrivateExtractIconsW+0x202 |
|||
00ecf384 7ca232be 00ecf 0000000a SHELL32!SHDefExtractIconW+0xe7 |
|||
00ecf3b0 7ca232e7 00ecf 00ecf420 SHELL32!CExtractIcon::_ExtractW+0x82 |
|||
00ecf3cc 7ca22a09 001521ec 00ecf554 0968ebb5 SHELL32!CExtractIconBase::Extract+0x1f |
|||
00ecf3f4 7ca228d2 001521ec 00ecf554 0968ebb5 SHELL32!IExtractIcon_Extract+0x35 |
|||
00ecf760 7c9f6015 001521ec 01d0d2f0 SHELL32!_GetILIndexGivenPXIcon+0x29e |
|||
00ecf788 7c9fd9ce 000f0f18 001521ec 01d0d2f0 SHELL32!SHGetIconFromPIDL+0x90 |
|||
00ecfe04 7ca04859 000f0f1c 01d0d2f SHELL32!CFSFolder::GetIconOf+0x24e |
|||
00ecfe20 7c9fb22e 000f0f1c 01d0d2f SHELL32!CDesktopFolder::GetIconOf+0x35 |
|||
00ecfe40 7ca22a64 000f0d20 000f0cbc 01d0d2f0 SHELL32!SHGetIconFromPIDL+0x20 |
|||
00ecfe68 7c9f209d 01d0d2a0 01e0c608 01eef838 SHELL32!CGetIconTask::RunInitRT+0x47 |
|||
00ecfe84 75f81b9a 01d0d2a0 75f81b18 75f80000 SHELL32!CRunnableTask::Run+0x54 |
|||
00ecfee0 77f69498 01de57f8 01d8c748 77f6947b BROWSEUI!CShellTaskScheduler_ThreadProc+0x111 |
|||
00ecfef8 7c 01d8c748 7c97c3a0 000febe0 SHLWAPI!ExecuteWorkItem+0x1d |
|||
00ecff40 7c 77f6947b 01d8c ntdll!RtlpWorkerCallout+0x70 |
|||
00ecff60 7c 01d8c748 000febe0 ntdll!RtlpExecuteWorkerRequest+0x1a |
|||
00ecff74 7c92761c 7c 01d8c748 ntdll!RtlpApcCallout+0x11 |
|||
00ecffb4 7c80b 7ffd0000 7c ntdll!RtlpWorkerThread+0x87 |
|||
00ecffec 7c kernel32!BaseThreadStart+0x37 |
|||
FOLLOWUP_IP: |
|||
BROWSEUI!CShellTaskScheduler_ThreadProc+111 |
|||
75f81b9a 8945fc mov dword ptr [ebp-4],eax |
|||
SYMBOL_STACK_INDEX: 15 |
|||
FOLLOWUP_NAME: MachineOwner |
|||
MODULE_NAME: BROWSEUI |
|||
IMAGE_NAME: BROWSEUI.dll |
|||
DEBUG_FLR_IMAGE_TIMESTAMP: 47589cbf |
|||
SYMBOL_NAME: BROWSEUI!CShellTaskScheduler_ThreadProc+111 |
|||
STACK_COMMAND: ~8s ; kb |
|||
FAILURE_BUCKET_ID: ACCESS_VIOLATION_BROWSEUI!CShellTaskScheduler_ThreadProc+111 |
|||
BUCKET_ID: ACCESS_VIOLATION_BROWSEUI!CShellTaskScheduler_ThreadProc+111 |
|||
</code> |
|||
As convenient as it would seem to an assembly-language programmer, it is still giberish to me. Please help me regain control of explorer.exe, as it is extremely inconvenient to work without making use of the desktop or of the file manager. |
|||
--[[User:Danielsavoiu|Danielsavoiu]] ([[User talk:Danielsavoiu|talk]]) 18:22, 13 March 2008 (UTC) |
|||
:It looks like what's happening is Windows is trying to process the file to give you a nice icon for it, but choking on the large file. I would try to get access to the disk somehow (boot into DOS or whatever kind of [[single-user mode]] equivalent Windows has, or do it from another account if possible), and go and delete the bad file. I'm always amazed at how hard and noisily Windows sucks! :) --[[User:TotoBaggins|Sean]] 19:47, 13 March 2008 (UTC) |
|||
:: Thank you, Sean. It is also amazing how the human mind seeks to solve problems in a much more complicated way then necessary. To think that I tried debugging the whole process before trying to delete the file. Indeed, your advice worked perfectly. Thank you once more. --[[User:Danielsavoiu|Danielsavoiu]] ([[User talk:Danielsavoiu|talk]]) 19:59, 13 March 2008 (UTC) |
|||
== NFS Permission Problem == |
|||
I have a fileserver. /home is owned by root:users and 777. Inside that is library owned by root:users and 777. Inside that is text files owned by root:users and 666. All users are in group users. I NFS mount /home/library. On the fileserver, exports is using rw,no_root_squash,async. On the local computer, it mounts as nfs rw. I ensured all user and group IDs are the same between both machines. I can read files fine. When I try to save a file, it deletes the contents of the file and then complains that the local user doesn't have rights to save the file. If I change the owner of the file to the local user, I can open and save without problems. I need for all members of group users to be able to read/write the files. I really need to stop the current experience of clicking "save" and having it delete the contents of the file and then throw a permission error. Is there something obvious that I am missing? -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#'>i</font><font color='#'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 18:41, 13 March 2008 (UTC) |
|||
== Vista Security Camera Apps == |
|||
Does windows vista have any apps that would allow you to view imagery from a wireless camera. I have a AV 2.4GHZ Reciever. Does there happen to be any software that would help this to work.--[[User:Boxbone|logger]] ([[User talk:Boxbone|talk]]) 22:16, 13 March 2008 (UTC) |
|||
= March 14 = |
|||
== Windows Live Skydrive + Windows Explorer == |
|||
Dear Wikipedians: |
|||
Are there any software that allows me to map my Windows Live Skydrive as a virtual drive in Windows Explorer like what's shown in the following illustration?: |
|||
[[Image:Drive3.jpg]] |
|||
Thanks. |
|||
[[User:L33th4x0r|L33th4x0r]] ([[User talk:L33th4x0r|talk]]) 00:27, 14 March 2008 (UTC) |
|||
Can I ask where you got this image? Thanks. [[User: Kushal_one|Kushal]] 02:31, 14 March 2008 (UTC) |
|||
:I made it myself this time. Thanks. [[User:L33th4x0r|L33th4x0r]] ([[User talk:L33th4x0r|talk]]) 03:20, 14 March 2008 (UTC) |
|||
::Apparently it can't be done yet.--[[Special:Contributions/155.144.251.120|155.144.251.120]] ([[User talk:155.144.251.120|talk]]) 03:44, 14 March 2008 (UTC) |
|||
== rip == |
|||
can one rip clips from you tubb and save them to his pc? <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/41.220.113.117|41.220.113.117]] ([[User talk:41.220.113.117|talk]]) 02:13, 14 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
Yes! However, YouTube compresses files in a flash video (flv) format to save on storage space and download time. One can use [[Mozilla Firefox]] (aren't you excited about Firefox 3?) and add an addon like download helper to download the video. Then, one can use a media player like [[VLC media player]] to play the video. |
|||
Cheers, |
|||
[[User: Kushal_one|Kushal]] 02:30, 14 March 2008 (UTC) |
|||
:Yep and if you don't want to download an addon you can use [http://javimoya.com/ a web based tool] to determine the actual URL of the FLV file. You still need to install VLC though [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:01, 14 March 2008 (UTC) |
|||
:There are some tools out there that will let you transcode the FLV into other formats. [http://vixy.net/ Vixy.net] can do this though I've sometimes had problems getting it to work. If you convert it to AVI or MOV then you don't need VLC (you can use Windows Media Player to play AVI files if you use Windows, or Quicktime Player to view MOV files). (Can you tell I don't like VLC much? I find it just a wee bit too buggy for anything other than emergency use. It has a habit of crashing on me or just not doing what I tell it to do.) --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 03:14, 14 March 2008 (UTC) |
|||
::The video is compressed with H.263 or H.264- transcoding would just result in loss of information. [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 03:55, 14 March 2008 (UTC) |
|||
:::Yes and no. Yes, you lose information, no, that's not "just" what would result. Part of the result is having it in a format you can do other things with. Which can be important too. Especially if VLC crashes when seeking FLVs (which it usually does for me), which makes it pretty useless in this scenario. --[[Special:Contributions/98.217.18.109|98.217.18.109]] ([[User talk:98.217.18.109|talk]]) 12:31, 14 March 2008 (UTC) |
|||
:I personally use [http://www.downloadyoutubevideos.com DownloadYouTubeVideos] to get the .flv files and [http://www.rivavx.com/?encoder Riva FLV], which comes with an encoder and player. '''[[User:Crassic|<span style="font-family:Arial;color:#cc6600">crassic]]'''!<sup><nowiki>[</nowiki>[[User_talk:Crassic|talk]]<nowiki>]</nowiki></sup></span> 03:34, 14 March 2008 (UTC) |
|||
== Segfault hunting == |
|||
How does one trap a segmentation fault? The OS is managing memory; how does the processor know to switch back to the kernel when it encounters a segfault? I can't imagine that the OS can be like checking each instruction before it's executed; if you tried to check what's in the register you're jmping to, you'd have to context switch every instruction to actually have registers to work with in the checking code, which would just be insane so it has to be built into the processor somehow-- but how does it even know? [[User:Froth|:D\=<]] ([[User talk:Froth|talk]]) 02:59, 14 March 2008 (UTC) |
|||
:See [[protected mode]]. The operating system makes programs run in protected mode. If they try to reference memory outside of their alligned space, the CPU itself detects that the address is out side of an allowed segment range and an exception occurs, which the OS handles. It is a hardware thing. You cannot have a segment fault on CPU's that don't have protected type modes. Many microprocessors in embedded electronics for example have no such thing as real/protected mode and its impossible to detect and stop a segment fault. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/155.144.251.120|155.144.251.120]] ([[User talk:155.144.251.120|talk]]) 03:41, 14 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
:: It's not really protected mode per-se, but the presence of hardware memory mapping - indeed one can get get memory violations in kernel mode (see note at the end). The availability of a protected-memory userspace model is a ''consequence'' of there being memory management hardware. Froth: any memory access (read, write, execute) is actioned by the CPU via the hardware [[Memory management unit]], which generally maintains a cache (the [[Translation lookaside buffer|TLB]]) of segments (I hesitate to call them "pages", because depending on the architecture they're single pages or contiguous runs of pages) of memory that are mapped. On full-featured CPUs (not weird stuff or embedded) each entry in the TLB has permissions bits (can read, can write, can exec). When actioning a memory access, the MMU looks the requested address and action up in the TLB - if there isn't a mapping, or if the requested action isn't permitted, then the MMU throws an exception. Most of the time you don't actually see this as a SIGSEGV in your program, because this same mechanism is exactly how the paged-memory system works - most of the time the OS intercepts the exception, uses that information to load/unload virtual memory pages between disk and ram, twiddles the TLB accordinly, and then clears the exception - the new TLB entry allows your request to proceed and all is well. You only see a SIGSEGV when the OS can't figure out a way to meaningfully satisy your request - when you're addressing memory for which the OS's own tables don't have a valid virtual page to swap in - so the OS chucks a SIGSEGV up to the usermode program. |
|||
::The reasons kernel-space programs can still hit page faults is the entire physical address space isn't entirely filled with mapped RAM, ROM, Flash etc chips - only certain areas are, for which the MMU has a (generally fixed, sometimes hardwired) mapping to actual [[chip select]]s - so (depending on the architecture) if kernel space code tries to access physical memory that has no valid CS mapping the MMU will barf at it. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 13:23, 14 March 2008 (UTC) |
|||
:::If you want the ultimate low-level knowledge, see "AMD64 Architecture Programmer's Manual Volume 2: System Programming" [http://www.amd.com/us-en/Processors/DevelopWithAMD/0,,30_2252_875_7044,00.html here]. It also includes the 32-bit x86 things. --[[User:ÖhmMan|ÖhmMan]] ([[User talk:ÖhmMan|talk]]) 14:07, 14 March 2008 (UTC) |
|||
::: Actually "the MMU maintains the TLB" is misleading - the TLB presents a bunch of memory-mapped registers ''inside'' the MMU (or somewhere in physical memory that's read by the MMU, depending on architecture) but their contents are largely maintained by the memory-management part of the OS. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 14:35, 14 March 2008 (UTC) |
|||
:Some good things to read to understand this stuff without wading through CPU manuals are the memory-management bits of [http://www.oreilly.com/catalog/understandlk/toc.html Understanding the Linux Kernel], and especially the excellent [http://books.google.com/books?id=pdADAAAACAAJ&dq=UNIX+systems+for+modern+architectures&ei=ipraR4OAKIWQiQGv19nHCQ Unix Systems for Modern Architectures]. --[[User:TotoBaggins|Sean]] 15:33, 14 March 2008 (UTC) |
|||
== Distributing computing for Leopard == |
|||
What's a distributed computing application that runs well on OS X Leopard? I've had very bad experience with Folding@Home. --[[Special:Contributions/68.23.161.173|68.23.161.173]] ([[User talk:68.23.161.173|talk]]) 04:21, 14 March 2008 (UTC) |
|||
:[[Seti@Home]]? --<font color="green" face="Berling Antiqua">hello, i'm a [[User:Member|<font color="orange">member</font>]]</font> | [[User talk:Member|<font color="grey">talk to me!</font>]] 04:57, 14 March 2008 (UTC) |
|||
:Also Rosetta and WCG. --<font color="green" face="Berling Antiqua">hello, i'm a [[User:Member|<font color="orange">member</font>]]</font> | [[User talk:Member|<font color="grey">talk to me!</font>]] 04:58, 14 March 2008 (UTC) |
|||
== Overclocking CPU multiplier == |
|||
Hi. Is it in general possible to increase a CPU's clock multiplier (not FSB) above its factory setting? With my current ASUS P5B-V board and [[List_of_Intel_Core_2_microprocessors#.22Allendale.22_.2865_nm.29|Intel E4500]] CPU, I seem to only be able to decrease it. Will it be possible, say, with an ASUS Maximus Formula and [[List_of_Intel_Core_2_microprocessors#.22Wolfdale.22_.2845_nm.29|Intel E8400]]? Thanks. -- [[User:Meni Rosenfeld|Meni Rosenfeld]] ([[User Talk:Meni Rosenfeld|talk]]) 10:32, 14 March 2008 (UTC) |
|||
:I know some CPU's multipliers are unlocked in the BIOS, but some are locked. Mine (AMD FX-60) is unlocked, but I haven't ever messed with it, so I don't really know the best procedures for overclocking. [[User:Useight|Useight]] ([[User talk:Useight|talk]]) 15:26, 14 March 2008 (UTC) |
|||
:Erm I'm not very expert on these things and never have tried myself - but - I understand that the clock multiplier is a hardware thing - so if you've got say a 10 or 11x multiplier it's impossible to go higher since the circuitry isn't there.? That may all be wrong.. |
|||
:<s>have you tried downloading a different BIOS - eg have you got this one ASUS P5B-V BIOS 0804 [[Special:Contributions/87.102.83.204|87.102.83.204]] ([[User talk:87.102.83.204|talk]]) 16:20, 14 March 2008 (UTC)</s>that probably wont help.[[Special:Contributions/87.102.83.204|87.102.83.204]] ([[User talk:87.102.83.204|talk]]) 16:28, 14 March 2008 (UTC) |
|||
== bash here-document == |
|||
In bash, how do I make cat watch for a here document which is actually me pressing enter 3 times? |
|||
I want to do something like |
|||
cat << $(echo -e \\n\\n\\n) |
|||
But the above doesn't work. Any ideas? |
|||
Thanks --[[Special:Contributions/194.223.156.1|194.223.156.1]] ([[User talk:194.223.156.1|talk]]) 12:05, 14 March 2008 (UTC) |
|||
:<code>cat</code> is used to concatenate text (usually) files together. It doesn't "watch" for things. Also, what is a "here" document? The keyboard is considered a stream, not a file, and is normally called "standard in" or "stdin" for short. It appears you are trying to hit enter three times and have it appear on the screen. What do you want to happen after that? Do you want it to stop and go back to the command prompt? -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#990066'>i</font><font color='#660099'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 12:29, 14 March 2008 (UTC) |
|||
:: A "here document" is a bash trick whereby one can create a tmp file inline, without creating one explicitly - that's what the <code><<</code> thing does. So one can say <code>sort << FOO</code> and then (at the <code>></code> prompts that appear) type <code>obama</code>(return) then <code>mccain</code>(return) then <code>clinton</code>(return) then <code>FOO</code>(return) and it'll print those three names sorted. The OP wants this sequence to stop on an explicit three empty lines (rather than an explicit delimiter like <code>FOO</code>). I don't know how to do that - you can get it to stop on a ''single'' empty line with <code>sort << ""</code> -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 12:38, 14 March 2008 (UTC) |
|||
:::Cool. I've never used cat for that. When I want code before/after a delimiter (even when sending it from the console), I tend to use grep. -- [[User:Kainaw|<font color='#ff0000'>k</font><font color='#cc0033'>a</font><font color='#990066'>i</font><font color='#660099'>n</font><font color='#3300cc'>a</font><font color='#0000ff'>w</font>]][[User talk:Kainaw|™]] 13:05, 14 March 2008 (UTC) |
|||
::::It's not particularly for <code>cat</code>, and I think the OP's use of <code>cat</code> may just have been for illustrative purposes. A here-document is particularly useful for single-file installers, config scripts, and self-extracting archives, where you can have multiple final files (or things that, after processing, will become individual files) all nicey stored and pleasantly formatted inside a single master bash script. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 13:40, 14 March 2008 (UTC) |
|||
:::This isn't bad: [[here document]]. --[[User:TotoBaggins|Sean]] 15:36, 14 March 2008 (UTC) |
|||
:On looking at the [http://ftp.gnu.org/pub/old-gnu/Manuals/bash-2.05a/html_node/bashref_42.html relevant section of the bash manual] it doesn't look like what you ask for is possible. It looks like the code for here documents works something like: |
|||
forever: |
|||
x = read a line (probably using fgets or the like) |
|||
if x==theDelimiter: quit |
|||
do stuff on x |
|||
:so it's line by line - three carriage returns in the here document cause three seperate trips through the loop body (because fgets uses \n to split lines), so you'll never get a match. I can't think of a clever way to overcome this. <small><snarky comment>if you'd done this in perl or python you'd be sipping pina coladas with Natalie Portman by now :)</snarky comment></small>-- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 12:54, 14 March 2008 (UTC) |
|||
Yep, thinking about it that seems likely, unfortunately. To answer Kainaw: I was mostly using cat for illustrative purposes but in fact my script does use it (although of course it's then piped off somewhere else). I don't want users (well, me) to have to do Ctrl-D in this particular context. Thanks to all anyway. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/194.223.156.1|194.223.156.1]] ([[User talk:194.223.156.1|talk]]) 13:51, 14 March 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> |
|||
== MSN reply refusal == |
|||
I have just had two replies to MSN clients refused by MSN as "suspected namespace mining". What is "namespace mining" and how can it have anything to do with clicking the "reply" button on a message? TIA [[Special:Contributions/86.217.135.241|86.217.135.241]] ([[User talk:86.217.135.241|talk]]) 13:05, 14 March 2008 (UTC) |
|||
:Not sure exactly what it's supposed to mean, but "namespace mining" sounds like some kind of effort to collect valid identifiers in a namespace, such as valid (i.e. actually used) usernames among all identifiers allowable as usernames. --[[Special:Contributions/71.162.242.230|71.162.242.230]] ([[User talk:71.162.242.230|talk]]) 14:11, 14 March 2008 (UTC) |
Latest revision as of 00:05, 9 November 2024
of the Wikipedia reference desk.
Main page: Help searching Wikipedia
How can I get my question answered?
- Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
- Post your question to only one section, providing a short header that gives the topic of your question.
- Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
- Don't post personal contact information – it will be removed. Any answers will be provided here.
- Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
- Note:
- We don't answer (and may remove) questions that require medical diagnosis or legal advice.
- We don't answer requests for opinions, predictions or debate.
- We don't do your homework for you, though we'll help you past the stuck point.
- We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.
How do I answer a question?
Main page: Wikipedia:Reference desk/Guidelines
- The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
October 29
[edit]Late '90s/early 2000s MIDI generator?
[edit]Hello, I'm sure I've asked this before, at least once and likely twice or more, several years ago, but I've lost track of the answer in the interim so I'm asking again.
I'm looking for a procedural MIDI generation software that existed probably by the year 2000. I do not remember what the name was; it was something similar to, but not, 'DirectMusic Composer'. It was relatively limited, but easy to use. When using it, you could pick from a selection of styles; for each style, you could select from a list of instrument sets, and a list of 'moods' that were available for that style, and you could move the instruments around on a 2D square to make them quieter, louder, or more towards the left or right side; you could set the song length, and enable or disable intro and outtro; and you could export the results to MIDI.
The program was used to create some part of the music for the turn-of-the-millennium MMO "Graal Online"; consequently, examples of what the MIDI music output could sound like can be found here (played with the default Windows soundfont) and in this playlist (played with a different soundfont).
Can you help me figure out what this program was, please?
2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4 (talk) 23:49, 29 October 2024 (UTC)
- Found it. Microsoft Music Producer. Thank you! 2600:6C55:4A00:A18:A1E5:7EDB:844:C2C4 (talk) 00:05, 30 October 2024 (UTC)
October 31
[edit]Unsafe connection
[edit]How comes I get an unsafe connection message for an https:// site? The address bar shows https://www.--.--.--. But the on-screen message is The connection has timed out / An error occurred during a connection to www.---.--.--. The strange thing is that the address bar says it's a secure site, but the error message doesn't (and nor does Firefox's site information). Thoughts? SerialNumber54129 16:38, 31 October 2024 (UTC)
- The error message does not specify the communication protocol. This does not imply the protocol was less secure. --Lambiam 20:56, 31 October 2024 (UTC)
November 1
[edit]360 street view images
[edit]Are there any cars with cameras that are built-in in a way such that you can extract 360 street view images from them? Like Google street view, but without any added parts. ―Panamitsu (talk) 07:00, 1 November 2024 (UTC)
- Most likely not. Tesla is an example. It is covered in cameras for full view, but the cameras are 720p, which is too low quality to get usable images as the vehicle speeds down the road. There isn't much reason for them to have better cameras. So, why would any other vehicle have high quality cameras all around? 68.187.174.155 (talk) 12:35, 1 November 2024 (UTC)
- Formula One and other racing cars often have multiple cameras, used for both TV broadcast views and for monitoring body parts at speed; some are mandatory and some optional. It may be that a particular one could have sufficient that a computer could reconstruct a 360° view (though this would not be routinely done). However, this is a very special case doubtless outside your scope of enquiry. {The poster formerly known as 87.81.230.195} 94.6.86.81 (talk) 13:20, 1 November 2024 (UTC)
November 2
[edit]Please Simplify - What is Answer Engine Optimization (AEO)?
[edit]Please help me to list down the resourses from where I can learn more on What is Answer Engine Optimization (AEO)? be it a course or from any blog - Thanks in Advance MPBhopal (talk) 11:11, 2 November 2024 (UTC)
- @MPBhopal Maybe the same as query optimization? Shantavira|feed me 16:32, 2 November 2024 (UTC)
- The term Answer engine redirects to our article Question answering, which needs to be updated. This page about the Brave browser's answer engine might make a good source.
An answer engine is a system that tries to answer a question, rather than point to websites about the question. Thanks to the proliferation and quality of large language models (LLMs), search-integrated answer engines are now a possibility at scale. In fact, several companies that operate search engines have released similar systems (including Bing Copilot and Google Gemini).
- Crucially, these LLM-type answer engines rely on Retrieval-augmented generation:
The secret ingredient of an answer engine is not the LLM that powers it [...] an effective answer engine requires both a model and access to a search engine.
- So Answer Engine Optimization is a branch of Search Engine Optimization. Here "optimization" is used in the sense of making things worse for everybody. It is an attempt to promote websites - or perhaps product names - to bias search engine results and the answers provided by an LLM that has accessed the search engine, and summarized the sites it found, on behalf of a user. This comment from a Hacker News thread about ChatGPT Search gives a clue about the details of these shenanigans:
> Why would anyone ever publish stuff on the web for free unless it was just a hobby? So that ChatGPT mentions you, not your competitor, in the answer to the user. I have seen multiple SEO agencies already advertise that.
- It's worth noting that one reason for the popularity of LLMs as a replacement for direct web searching is that they are currently sidestepping SEO manipulation. From another comment on that thread:
Third search (company name) got me an ENTIRE PAGE of ads and SEO optimized pages before the actual link to the actual product.
- So this AEO thing is the latest development in the arms race between those seeking to enable product promoters and those trying to provide unbiased search results. (Within a large search company like Google or Bing, these may merely be different departments.) The objective is to defeat the use of LLMs to improve search results.
- You apparently want a how-to guide. Such a guide would be hot property at the moment, I expect. That is to say, I would be surprised if anyone skilled in making money from the promotion of websites was willing to give away their secret methods for doing this in the very much hyped current context of LLMs, without also seeking money for sharing these putative secrets.
- Edit: of course, that money could come from Google ads. Since manipulating search rankings is their business, it will presumably be easy to find the sites of those most competent at it, yet difficult to find the most useful guidance. Card Zero (talk) 16:57, 2 November 2024 (UTC)
November 4
[edit]floating-point "accuracy"
[edit]It's frequently stated that computer floating point is "inherently inaccurate", because of things like the way the C code
float f = 1. / 10.; printf("%.15f\n", f);
tends to print 0.100000001490116
.
Now, I know full well why it prints 0.100000001490116
,
since the decimal fraction 0.1 isn't representable in
binary.
That's not the question.
My question concerns those words "inherently inaccurate", which I've come to believe are, well, inaccurate. I believe that computer floating point is as accurate as the numbers you feed into it and the algorithms you use on them, and that it is also extremely precise (120 parts per billion for single precision, 220 parts per quintillion for double precision.) So I would say that floating point is not inaccurate, although it is indeed "inherently imprecise", although that's obviously no surprise, since its precision is inherently finite (24 bits for single precision, 53 bits for double, both assuming IEEE 754).
The other thing about binary floating point is that since it's
done in base 2, its imprecisions show up differently than they
would in base 10, which is what leads to the 0.100000001490116
anomaly I started this question with. (Me, I would say that
those extra nonzero digits …1490116
are neither "inaccurate" nor
"imprecise"; they're basically just false precision, since
they're beyond the precision limit of float32.)
But I can see from our page on accuracy and precision that there are a number of subtly different definitions of these terms, so perhaps saying that floating point is "inherently inaccurate" isn't as wrong as I've been thinking.
So my question is just, what do other people think? Am I missing something? Is saying "floating point is inherently inaccurate" an informal but inaccurate approximation, or is it meaningful? —scs (talk) 13:50, 4 November 2024 (UTC)
- Wiktionary: accurate says "accurate ... Telling the truth or giving a true result; exact", but float is not exact so it is not accurate in that sense. 213.126.69.28 (talk) 14:10, 4 November 2024 (UTC)
- See also Floating-point arithmetic § Accuracy problems. What is not mentioned, is the problem that little inaccuracies can accumulate. For example, consider this code:
x = 0.1 for i in range(62): x = 4*x*(1-x)
- The true mathematical value computed, rounded to 15 decimals, is
0.256412535470218
, but the value computed using IEEE floating point arithmetic will come out as0.988021660873313
. --Lambiam 16:06, 4 November 2024 (UTC)- @Lambiam: Cute example. (Does it have a name?) Lately I've been impressed at how often cascading precision loss isn't a problem, although it's certainly one of the things you always have to watch out for, as here. (It's why I said "as accurate as... the algorithms you use on them".) —scs (talk) 14:28, 5 November 2024 (UTC)
- See Logistic map § Solution when r = 4. --Lambiam 20:01, 5 November 2024 (UTC)
- @Lambiam: Aha: An "archetypal example of complex, chaotic behaviour". So we shouldn't be too surprised it's particularly sensitive to slight computational differences along the way... :-) —scs (talk) 22:48, 5 November 2024 (UTC)
- See Logistic map § Solution when r = 4. --Lambiam 20:01, 5 November 2024 (UTC)
- @Lambiam: Cute example. (Does it have a name?) Lately I've been impressed at how often cascading precision loss isn't a problem, although it's certainly one of the things you always have to watch out for, as here. (It's why I said "as accurate as... the algorithms you use on them".) —scs (talk) 14:28, 5 November 2024 (UTC)
- The basic floating point operations are as accurate as it possible for them to be and the specification normally talks about precision which measures the unavoidable deviation from being completely accurate. But no-one is going to carp about calling it inaccurate! NadVolum (talk) 16:57, 4 November 2024 (UTC)
- @NadVolum: I am here to prove you wrong, because that is exactly what I am carping about! :-) —scs (talk) 17:31, 4 November 2024 (UTC)
- There are two issues with floating point numbers that are both wrapped up in "they are not accurate." I personally never say that. What I say is that the same number can be stored in memory different ways. For example, a human can tell you that 10e4 and 100e3 are the same number. But, to a computer, they are different. It doesn't parse out the value and computer 100000 and 100000. It compares exactly what it sees. 10e4 and 100e3 are not the same. Of course, computers use binary, not decimal, but that isn't the point. The point is that you have the same value being stored in different ways. You, as the human, don't control it. As you do operations on a value in memory, the value updates and the exact way it is stored can change. Separately, floating point numbers do tend to drift at the very end. So, 3.000000... can become 2.99999999... or 3.00000000....0001. That is not "wildy" inaccurate. But, 2.99999... is not the same value as 3.00000. In the end, why do we care? It comes down to programming. If you have two floating point variables x and y and you want to know if they are the same value, you can't simply compare x==y and hope to get the right answer. What if x is 3.00000.... and y is 2.99999...? Instead, you do something like abs(x-y)<0.000000001. Then, if there is a little drift or if the two numbers are the same value but stored slightly different, you get the correct answer. This came to a head way back in the 80s when there was a flame war about making the early c++ compiler automatically convert x==y to abs(x-y)<0.0000000000000000001. But, what I believe you are arguing is that memory storage should be fixed instead of the programming so the numbers are always stored in the exact same format and there is never ever any drift of any kind. That would be more difficult in my opinion. 17:24, 5 November 2024 (UTC)
- That's not what I was saying, but thanks for your reply. [P.S.
10e4
and100e3
are the same number, in any normalized floating-point format; they're both stored as 1.52587890625 × 216, or more to the point, in binary as 1.100001101012 × 216.] [P.P.S. Testingfabs(x - y) < some_small_number
is not a very good way of doing it, but that wasn't the question, either.] —scs (talk) 20:12, 5 November 2024 (UTC)- A fundamental problem is that numbers represented in numerical form, whether on paper or in a computer, are rational numbers. In print, we typically have numbers of the form where and are whole numbers. In computers, is more common. However, most numbers are not rational. There is no way to compute the exact value of, for example, There is no known algorithm that will decide in general whether the mathematical value of such an expression with transcendental functions is itself transcendental, so at a branch asking whether this value is equal to we have no better recourse than computing this with limited accuracy and making a decision that may be incorrect.
- BTW, "comparison tolerance" was a feature of APL.[1] The "fuzz", as it was colloquially called, was not a fixed constant but was a system variable with the strange name ⎕ct to which a user could assign a value. The comparison was more complicated than just the absolute difference; it was relative to the larger absolute value of the two comparands (if not exactly equal as rational numbers). --Lambiam 21:37, 5 November 2024 (UTC)
- I actually don't agree with the claim that numbers represented in numerical form...are rational numbers. If you're talking about the main use for them, namely representing physical quantities, they aren't rational numbers, not conceptually anyway. Conceptually they're "fuzzy real numbers". They don't represent any exact value, rational or otherwise, but rather a position along the real line known with some uncertainty. --Trovatore (talk) 22:36, 5 November 2024 (UTC)
- That's not what I was saying, but thanks for your reply. [P.S.
- (Taking the above comments as read:) Most of the significant issues with floating point numbers are programming errors, often slightly subtle ones. It is possible in the majority of cases to use rational numbers as an alternative, only producing a floating point representation when display or output is needed in that form. Again for the majority of cases this would be a good solution, but for a very few cases the numerator and denominator could be very large (the logistic map example above would require ~ 2^62 digits (cancelling helps but a little)), and for compute intensive cases the general slowdown could be important. All the best: Rich Farmbrough 12:00, 6 November 2024 (UTC).
- It's conceptually wrong, though, in most cases. Floating-point numbers usually represent physical quantities, and physical quantities aren't conceptually rational numbers. What we want is something that approximates our state of knowledge about a real-valued quantity, and floating point is the closest thing we have to that in wide use. (Interval arithmetic would be a *little* closer but it's a pain.)
- That doesn't actually prove that you couldn't get good solutions with rationals, but it's kind of an article of software-engineering faith that things work best when your data structures align with your concepts. I don't know if that's ever been put to a controlled test. --Trovatore (talk) 18:25, 6 November 2024 (UTC)
- Sure you are absolutely right for representing physical quantities in most cases - in chaotic scenarios whatever accuracy you measure with might not be enough regardless of the way you calculate. However computing is used for many purposes including mathematics. It's also used in ways where careful application of floating point will bring an acceptable answer, but naive application won't. All the best: Rich Farmbrough 23:03, 6 November 2024 (UTC).
- Incidentally here's a perl program that gets a more accurate answer to the logistic map problem above, using floating point:
use Math::BigFloat; my $x = Math::BigFloat->new('0.1'); $x->accuracy(50); # Set desired precision for (my $i = 0; $i < 62; $i++) { $x = 4 * $x * (1 - $x); } print "$x\n";
- All the best: Rich Farmbrough 23:07, 6 November 2024 (UTC).
- I guess you meant "...using arbitrary precision floating point" (i.e. perl's "BigFloat" package).
- But this ends up being a nice illustration of another principle of numerical programming, namely the importance of using excess precision for intermediate results. Evidently that call to
accuracy(50)
sets not only the final printout precision, but also the maximum precision carried through the calculations. So although it prints 50 digits, only 32 of them are correct, with the rest lost due to accumulated roundoff error along the way. (The perl program prints0.25641253547021802388934423187010674334774769183115
, but I believe the correct answer to 50 digits — at least, according to my own, homebrew multiprecision calculator — is0.25641253547021802388934423187010494728798714960746
.) —scs (talk) 04:02, 7 November 2024 (UTC), edited 13:45, 8 November 2024 (UTC)
- Sure you are absolutely right for representing physical quantities in most cases - in chaotic scenarios whatever accuracy you measure with might not be enough regardless of the way you calculate. However computing is used for many purposes including mathematics. It's also used in ways where careful application of floating point will bring an acceptable answer, but naive application won't. All the best: Rich Farmbrough 23:03, 6 November 2024 (UTC).
- My original question was about how to describe the imperfections, not what the imperfections are or where they come from. But since someone brought up rational numbers, my own take is that there are several models you might imagine using for how computer floating point works:
- Now, although real numbers are arguably what floating-point numbers are the farthest from — there are an uncountably infinite number of real numbers, but "only" 18,437,736,874,454,810,626 floating-point ones — it's the real numbers that floating-point at least tries to approximate. The approximation is supremely imperfect — both the range and the precision are strictly limited — but if you imagine that floating-point numbers are approximate, limited-precision renditions of certain real numbers, you won't go too far wrong. (As for the rationals, it's not strictly wrong to say that "floating point numbers are rational numbers", because the floating point numbers are indeed a proper subset of the rational numbers — but I don't think it's a useful model.) —scs (talk) 13:35, 8 November 2024 (UTC)
- Actually, it is "strictly wrong to say that 'floating point numbers are rational numbers'". At least there is no injective ring homomorphism from the floats into the rationals, because the arithmetic is different. Of course the floats aren't literally a ring in the first place, but you can work out what I mean. --Trovatore (talk) 19:35, 8 November 2024 (UTC)
November 5
[edit]Monitor Is Dark
[edit]I have a Dell desktop computer running Windows 11 with a full-screen monitor. Early this afternoon, it was displaying the screen to prompt me to enter my passnumber, which I entered, and then the screen went dark. The computer itself is still functioning. I have shared some of its folders, and I can see them as shared drives on my laptop computer. My question is what I should try short of replacing the monitor. I haven't priced monitors yet, but I know that they cost between $100 and $200, and I am willing to spend that if necessary, but would of course rather spend on something else. I tried unplugging the monitor from the UPS and plugging it back in. Is there anything that can be inferred from the fact that the monitor turned off while it was logging me on? Is there anything in particular that I should try? Robert McClenon (talk) 00:42, 5 November 2024 (UTC)
- Please disregard this question. I disconnected the monitor power cord from both the monitor and the power supply. Then I plugged it back into a different socket of the power supply, and back into the monitor, and the display is fine again. I don't know whether a connection had been loose or whether the socket in the power supply failed, more likely the former, but I will just leave it alone now that it is working. Robert McClenon (talk) 01:14, 5 November 2024 (UTC)
- I am running Windows 11 and the same thing happened to me a few hours ago. I have three monitors. All went black. The computer was still on and running, but no display except for the mouse. It took me a bit to realize that as I moved the mouse, a gray pixel moved around the screens. I forced a shutdown on the computer by long-holding the power button, turned it back on, and all three monitors started working again. 12.116.29.106 (talk) 17:15, 5 November 2024 (UTC)
- That was a different problem. That sounds like a failure in Windows 11. My problem turned out to be a hardware problem. I am satisfied that I solved my problem and that you solved yours. Robert McClenon (talk) 04:01, 6 November 2024 (UTC)
November 6
[edit]Turning Off Ad Blocker
[edit]Sometimes when I am viewing a news web site, there is a message asking me to turn off my ad blocker. I have not deliberately enabled an ad blocker, so I assume that something, maybe Norton, is blocking ads. If I am using Firefox, how do I determine what ad blocker is in use, so that I can turn it off if I want to view a page that doesn't like ad blockers? If I am using Chrome, how do I determine what ad blocker is in use, so that I can turn the ad blocker off? I have found that if I really want to bypass the ad blocker, I can use Opera, which is a less commonly used web browser, so that common security software doesn't mess with it, but I would like to be able to turn off the ad blocker if the web site tells me to turn off the ad blocker.
This is sort of an electronic arms race, with electronic counter-measures, and electronic counter-counter-measures. Robert McClenon (talk) 04:11, 6 November 2024 (UTC)
- @Robert McClenon: I believe it potentially could be the tracker blocking from Firefox itself. I'm not sure whether there's an easy way to see what's blocking the adverts as it could potentially be down at network level. I suspect it's Firefox blocking trackers as occasionally when I use a browser that blocks trackers, I do get ad blocker disable notices. Zippybonzo | talk | contribs (they/them) 13:14, 6 November 2024 (UTC)
- Robert McClenon: using Firefox, I had a similar problem with YouTube, and learned that not only Adguard Adblocker and uBlock origin needed to be turned off for YouTube to work, but that Malwarebytes had also acquired an ad-blocking aspect and also needed to be turned off.
- On Firefox, you may be able to click a jigsaw-piece icon at top right, labelled 'Extensions' and see what you currently have turned on and off. Hope this helps. {The poster formerly known as 87.81.230.195} 94.6.86.81 (talk) 21:52, 6 November 2024 (UTC)
Intermittent but predictable IP connectivity
[edit]Context: I had an interesting issue, which I would like to know the technical cause of, partly out of curiosity, and partly so that I can have a more elegant fix should it recur. I resolved the issue by restarting my laptop (restarting the router didn't work and other devices did not have the problem).
My laptop had been working fine for a week or so on a new fibre connection, using the same router that we have had for several years. I went out and used my phone as a hotspot for my laptop. Came home, with hotspot turned off the to discover very intermittent Internet access.
The lap top was connected for 3 minutes, disconnected for 1 minute. I ran ping -t from command line to the gateway and logged the results. Ping -t should run once per second. I got between 177 and 179 successful pings, followed by 60-63 unsuccessful pings. I believe the slight variance from 180/60 was due to the reset happening in a lower level of the stack, so losing a little time while higher level connections were established (of course I'd expect the counts to vary by 1 or 2 simply because of the coarse resolution).
Hypotheses welcome, they should explain the 3 minute and 1 minute time spans.
Note: I found a Reddit post where someone had connectivity in "2-3 minute" chunks , but the answers weren't particularly informative.
All the best: Rich Farmbrough 11:45, 6 November 2024 (UTC).