|
[[Category:Non-talk pages that are automatically signed]]<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>
{{Wikipedia:Reference_desk/Archives/Computing/2008 September 12}}
= August 19 =
== Shortest video game ==
{{Wikipedia:Reference_desk/Archives/Computing/2008 September 13}}
[[A Short Hike]] (as the name suggests) can be beaten within a few hours. What other games are like that? [[User:JuniperChill|JuniperChill]] ([[User talk:JuniperChill|talk]]) 19:18, 19 August 2025 (UTC)
{{Wikipedia:Reference_desk/Archives/Computing/2008 September 14}}
: "50 Games Like" aims to be a weighted-category based games recomendation engine. Just based on ''A Short Hike'', it lists [https://www.50gameslike.com/games-like/a-short-hike these games]. But that's based on ''all'' the categories ''A Short Hike'' is in ("cute", "adventure", "exploration", etc.). If you just want "short" games, you click on just the category button and it gives you [https://www.50gameslike.com/best-games-by-type/short short games in all genres] (which aren't like ''A Short Hike'', except in shortness). Subjectively, it looks more useful than Steam's recommendation engine, which gives me some fairly bonkers suggestions ("you liked FTL, so you might like Doom Eternal"). -- [[User:Finlay McWalter|Finlay McWalter]]'''··–·'''[[User talk:Finlay McWalter|Talk]] 19:40, 19 August 2025 (UTC)
= September 15 =
:Finlay's answer is excellent, but I can't help mention that the original ''[[Portal (video game)|Portal]]'' game is both famously short and considered one of the best games of all time. If shortness is the prime criteria, you could do worse. But apart from the duration, it's nothing like ''A Short Hike''. [[User:Matt Deres|Matt Deres]] ([[User talk:Matt Deres|talk]]) 12:40, 20 August 2025 (UTC)
::Guess that means that ''A Short Hike'' is unique in its shortness, cosiness, and adventure. ''[[Lil Gator Game]]'' is quite close in terms of layout and that the player can climb but idk about its length since I haven't played the latter, but have played the former. I was mostly focusing on shortness, hence the title of the discussion. [[User:JuniperChill|JuniperChill]] ([[User talk:JuniperChill|talk]]) 19:37, 20 August 2025 (UTC)
:Check out https://howlongtobeat.com/user/a19xys/lists/25829/%5B-Short-%26-Good-(-5h)-%5D, perhaps. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 23:37, 20 August 2025 (UTC)
:@[[User:JuniperChill|JuniperChill]] In Far Cry 4, if you just sit at the table and wait for Pagan Min to return, it is a very short video game. Less than 15 minutes. [[User:Polygnotus|Polygnotus]] ([[User talk:Polygnotus|talk]]) 00:56, 21 August 2025 (UTC)
::Well, consuming the crab rangoon can't be so bad it's considered an "adventure", can it? [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 01:04, 21 August 2025 (UTC)
:::@[[User:Aaron Liu|Aaron Liu]] Traveling to a country far away, ending up in a firefight in which some people get killed, seeing a murder close-up (over a simple miscommunication), getting invited to the palace of the dictator of said country as a VIP guest, bringing moms ashes to their final resting place and learning about your tragic family history is quite an adventure (although some would just call that Tuesday). [[User:Polygnotus|Polygnotus]] ([[User talk:Polygnotus|talk]]) 13:40, 21 August 2025 (UTC)
= August 20 =
== Opening a file via the context menu in Windows Vista ==
== Which year American staté the bill on count ==
On previous versions of Windows, there was an option to edit how clicking on a file with a certain extension would allow it to open. This option exists under Windows Vista under a program called ''Default Programs''. However, it only allows an edit to change which file it opens on double-click; it completely wipes out any other options available under the right-click context menu.
We need to know that year [[Special:Contributions/41.114.142.143|41.114.142.143]] ([[User talk:41.114.142.143|talk]]) 05:21, 20 August 2025 (UTC)
For example, I have svg files on my system, as well as [[Inkscape]]. I had the default to open under Wordpad to allow manual edit, another option to open with Inkscape was added by the said program. But when I told the system to make Firefox the default program (to allow quick viewing), it wiped out all the other options.
:I can't understand the question. ―<span style="font-family:Poppins, Helvetica, Sans-serif;">[[User:Panamitsu|Panamitsu]]</span> [[User_talk:Panamitsu|(talk)]] 06:41, 20 August 2025 (UTC)
Help. [[User:Magog the Ogre|Magog the Ogre]] ([[User talk:Magog the Ogre|talk]]) 03:27, 15 September 2008 (UTC)
:Are you sure this question is about computing, which includes information technology, electronics, software and hardware? Otherwise, please post it at a more fitting section of the reference desk. If the question is about history, politics or economics, the appropriate section is [[Wikipedia:Reference desk/Humanities|Reference desk/Humanities]]. Also, do not repost your question as it is now. Please rephrase it, so that we have a chance to understand the question. ​‑‑[[User talk:Lambiam#top|Lambiam]] 13:21, 20 August 2025 (UTC)
:Google AI says: The United States passed the Coinage Act of 1792, which established the U.S. dollar as the unit of currency and mandated that public accounts and court proceedings use this standard, making it the first "bill on count" in the sense of the financial unit. [[User:Shantavira|Shantavira]]|[[User talk:Shantavira|<sup>feed me</sup>]] 17:45, 23 August 2025 (UTC)
::{{small|I am unaware of ''[[wikt:count#Noun|count]]'' having a sense "dollar" (or any financial unit). ​‑‑[[User talk:Lambiam#top|Lambiam]] 13:09, 24 August 2025 (UTC)}}
:::<small>AI is aware of all sorts of imaginary stuff.</small> [[User:Shantavira|Shantavira]]|[[User talk:Shantavira|<sup>feed me</sup>]] 07:54, 25 August 2025 (UTC)
:You can edit what programs are used to open which filename extension from Control Panel → Folder Options. Alternatively, you can add a shortcut to a program into the "Send To..." menu. There are some disadvantages: In Vista the "Send To ..." is well buried in c:\users\<username>\App Data\Roaming\?????? <small>(I'll find the rest of the path later)</small>, that shortcut will appear in every "Send To..." menu no matter what type of file it is. [[User:Astronaut|Astronaut]] ([[User talk:Astronaut|talk]]) 15:26, 17 September 2008 (UTC)
== Webdesign for dummies ==
I recently had an idea for a website, but I have limited coding experience and almost no webdesign experience. I won't go into the details of my website because, well, quite frankly I'm sorta paranoid about my idea getting jacked, but in any event after poking around I found Drupal and I think I want to use it to implement my project. Do I need to learn SQL or PHP to play around with Drupal? Should I try to maintain my own local server and database, or can I design the site locally and run it off a hosted server? My old computer is burnt out so I've been thinking of reformatting for use as an Apache server/MySQL database for use in this project, but I don't know if I need to go that far. --[[User:Shaggorama|Shaggorama]] ([[User talk:Shaggorama|talk]]) 08:21, 15 September 2008 (UTC)
:My (limited) experience is that it'll be handy to learn some PHP with Drupal; that's true for WordPress, where I have somewhat more experience. That said, since you say you have little experience, WordPress has many, many themes (for overall appearance) and plugins (for various kinds of customization), such that you might not need to get into the PHP code, or might be able to get by with examples from WordPress forums. I imagine it's similar with Drupal.
:For overall appearance of your site, you can do a great deal with CSS (cascading style sheets). As a simple example, a WordPress theme set the H2 tag as 18point blue italic centered text with 15 pixels of padding above and below. You could edit the CSS to change any or all of those to suit your taste. If you're serious about learning this, I recommend [http://oreilly.com/catalog/9780596101978/ Head First HTML] -- there's even a sample chapter at that link so you can see their approach.
:I myself would not want to run my own server; hosting is a commodity business, so you have many options that should not be expensive. Again, [http://www.wordpress.com WordPress.com] will give you the specifications that a hosting service would have to provide; some services advertise on the WP site. And for starters, you could begin your site at WordPress.org (though the number of themes is smaller, and you'd still have to pay a bit to have the ability to edit the CSS); later, you could find host companies who will move your mySQL data to a hosted site for you. --- [[User:OtherDave|OtherDave]] ([[User talk:OtherDave|talk]]) 12:07, 15 September 2008 (UTC)
= September 1 =
::I've looked into WP and I don't think it's right for my needs. I want my users to write articles, yes, but I want the articles to be associated with both the users and more global categories, sort of like the architecture of a product review site. Could this work within wordpress? I got the impression wordpress is really for straightforward blogging, so I thought Joomla or Drupal would probably be better options. --[[User:Shaggorama|Shaggorama]] ([[User talk:Shaggorama|talk]]) 19:50, 15 September 2008 (UTC)
== Estimating nodes in a tree for depth-first search ==
:::Well, as I said, I don't know much about Drupal, and I'm not trying to sell you WP (since it's free). You could give regular writers the ability to write posts (which you could treat as articles) without publishing them (leaving you as the final authority). You can assign both tags and categories to posts. E.g., you could have a category for REVIEW (or one for SOFTWARE REVIEW and one for HARDWARD REVIEW); you could have tags for vendor names or product types (a Microsoft tag, an open-source tag). That means with very little technical knowledge, you could have a site where I can easily find:
:::*All the articles written by Fred Frack
:::*All the reviews of hardware (in general)
:::*All reviews of 4-gigabyte berm divots (assuming you had a category "4-gigabyte berm divot")
:::*All content tagged "MicroPro," or tagged "office applications," or tagged "predictions."
:::You can assign more than one tag, and more than one category, to any item. This is not hard stuff; I'm not a computer wizard.
:::My point is only that there are a number of ways to control how your content appears in WP (and I'm sure in Drupal as well). If I can tell you any more about WP, send me an email. My impression (this is only an impression) is that the administration of Drupal requires more technical knowledge than does WordPress -- but I'm sure some Drupal expert will address that.
:::One thing you might consider is using either WP or Drupal (are there free Drupal hosts?) to build a small version of the site you're planning. You don't even have to make it public, but messing around with the software will help you see how things work, and will probably give you ideas for how to organize your eventual site. Throw together three dummy pages for each type of content you plan to have, and see if you can link the stuff together. --- [[User:OtherDave|OtherDave]] ([[User talk:OtherDave|talk]]) 23:56, 15 September 2008 (UTC)
I need to traverse a large tree with a depth-first search. I need an estimate of the number of nodes to get an idea if it is feasible to do it. What I have in mind is to start the search but at each node, select one edge at random. Keep track of the branching factor at each level. Then repeat this maybe 10<sup>5</sup> times and get an average branching factor at each level. Then multiply the branching factors to get an estimate of the total number of nodes.
== Line spacing in CSS ==
Should this give a reasonable estimate of the total number of nodes? [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 22:18, 1 September 2025 (UTC)
Generally, two paragraphs are separated by one additional line. How do I do single line spacing using CSS?
:If you know nothing about the tree in advance you will still not know, as the branches may go to any huge depth, including those branches you don't go near. Are you going to go full depth 10<sup>5</sup> times? That would give you some sort of probabilistic idea, but not any certainty. [[User:Graeme Bartlett|Graeme Bartlett]] ([[User talk:Graeme Bartlett|talk]]) 10:18, 2 September 2025 (UTC)
: <s>Do you have any way of knowing or estimating the total number of nodes? That in conjunction with your "branching factor" might give a better estimate.</s> —[[User:scs|scs]] ([[User talk:scs|talk]]) 10:48, 2 September 2025 (UTC)
::I think the point of the described sampling method is to ''obtain'' an estimate of the total number of nodes, to be used to determine whether a full traversal is feasible. ​‑‑[[User talk:Lambiam#top|Lambiam]] 14:44, 2 September 2025 (UTC)
:::Ah, yes. (And: "[[D'oh!]]") The emphasis on depth-first in the title had me assuming that the question was whether specifically depth-first traversal was possible, and the intent was to estimate the depth of the tree. —[[User:scs|scs]] ([[User talk:scs|talk]]) 21:24, 2 September 2025 (UTC)
:Assume you have a finite tree with a gazillion nodes that is completely linear: each internal node has exactly one child. With your method, you compute, each of these 10<sup>5</sup> times, the product of the branching factors as being 1<sup>gazillion</sup> = 1, which is not a good estimate. ​‑‑[[User talk:Lambiam#top|Lambiam]] 15:09, 2 September 2025 (UTC)
:: I was planning to go different random routes, each as deeply as I could, for enough trials to get an estimate. I picked 10<sup>5</sup> as an example. I could do more. The tree is largely unknown - I don't know how many edges a node has until I get to it, but the number of edges for each will be between 0 and 8. Very few paths will reach the maximum depth. The object is to get the path that goes to the maximum depth of the tree. [[User:Bubba73|Bubba73]] <sup>[[User talk:Bubba73|You talkin' to me?]]</sup> 22:58, 2 September 2025 (UTC)
What I need is:
= September 2 =
<tt><nowiki><p></nowiki></tt>Line 1<tt><nowiki></p></nowiki></tt><br />
<tt><nowiki><p><blockquote></nowiki></tt>Line 2<tt><nowiki></blockquote></p></nowiki></tt><br />
<tt><nowiki><p></nowiki></tt>Line 3<tt><nowiki></p></nowiki></tt>
== What does ''illegal'' mean in the context of HTML? ==
There shall be no additional lines between two paragraphs. -- [[User:Toytoy|Toytoy]] ([[User talk:Toytoy|talk]]) 11:37, 15 September 2008 (UTC)
To use it in a sentence (no pun intended), it's illegal to place a div inside an inline tag. – [[User:MrPersonHumanGuy|MrPersonHumanGuy]] ([[User talk:MrPersonHumanGuy|talk]]) 01:15, 2 September 2025 (UTC)
:The p-tag is a block container. It has padding and margin spacing (see "block container" rules on any of the millions of CSS introduction sites). So, you want the rule p { margin:0px; padding:0px; } to ensure there is no margin or padding around your text. -- [[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:06, 15 September 2008 (UTC)
:It violates the specs of the HTML syntax, is not correct HTML, and may be expected to cause renderers to behave erratically. [[User:Aaron Liu|<span class="skin-invert" style="color:#0645ad">Aaron Liu</span>]] ([[User talk:Aaron Liu#top|talk]]) 03:05, 2 September 2025 (UTC)
<p style="padding: 0px; margin: 0px;">Howdy there fella</p>
<p style="padding: 0px; margin: 0px;">Single-spaced paragraphs here</p>
<p style="padding: 0px; margin: 0px;">You just check the source</p>
--[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 19:53, 16 September 2008 (UTC)
== Roxio Streamer ==
I'm trying to use ROxio Streamer to stream my videos to my iPod Touch. However, when I try to go to the address it gives me to view my video, the browser says it can't find the page. I tried enabling UPnP, NAT-PMP and TCP but none of those work. I still cant see the webpage for some reason. Please help. --[[User:Randoman412|Randoman412]] ([[User talk:Randoman412|talk]]) 11:43, 15 September 2008 (UTC)
== Perl ==
What programme do you use to write a perl script, and to run it?
Thanks. <span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/87.84.118.226|87.84.118.226]] ([[User talk:87.84.118.226|talk]]) 12:18, 15 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:That would depend on what operating system you are running. Most [[Linux]] distributions come with a Perl interpreter pre-installed, and you could use [[vi]] or [[EMACS]] or a specialized editor and/or development environment. For Windows, you'd have to install a Perl interpreter and could use notepad. For Macintosh, I dunno. Lots of links in our handy [[Perl]] article. --[[User:LarryMac|<font color="#3EA99F">LarryMac</font>]][[User talk:LarryMac|<font color="#3EA99F"><small> | Talk</small></font>]] 12:47, 15 September 2008 (UTC)
:Normally you'd use any old text editor. I like to use [[vim]]. I usually run perl scripts from the command line, like this:
$ chmod u+x ./my_perl_script.pl
$ ./my_perl_script.pl
:--'''[[User:Kjoonlee|Kjoon]]'''[[User talk:Kjoonlee|lee]] 13:35, 15 September 2008 (UTC)
:Or you could run the script using the perl interpreter.
$ perl ./my_perl_script.pl
:--'''[[User:Kjoonlee|Kjoon]]'''[[User talk:Kjoonlee|lee]] 13:36, 15 September 2008 (UTC)
== vista directory explorer loses IE icon for .htm files ==
well, that about says it all.... all of a sudden, the vista explorer gives me a blank page icon for .htm instead of the little blue e icon for IE. what did i change just before that? umm... I reinstalled Real player... but the .htm files are still associated with IE, double clicking opens them up in IE; IE itself still has the blue e icon; I tried rebooting, I even tried going into control panel and associating the .htm files with IE again; no dice. ???? any advice will be gratefully appreciated. TIA. [[User:Gzuckier|Gzuckier]] ([[User talk:Gzuckier|talk]]) 15:07, 15 September 2008 (UTC)
== Computer Woes ==
I can open none of the drive-folders when I double-click the icons in the My Computer window. I use Windows XP Professional SP2. Can anyone help?? [[Special:Contributions/117.194.224.253|117.194.224.253]] ([[User talk:117.194.224.253|talk]]) 18:54, 15 September 2008 (UTC)
:If you can still open other folders, you should be able to navigate to your drives from there. Type the address of the drive in the address bar of the folder, or you can try right-clicking a folder and selecting "explore" to get a map of your computer, including drives. --[[User:Shaggorama|Shaggorama]] ([[User talk:Shaggorama|talk]]) 19:53, 15 September 2008 (UTC)
:I ran into a similar problem and found the [http://support.microsoft.com/kb/321186 solution] on Microsoft's help site. Your problem may be the same. --[[User:Bavi H|Bavi H]] ([[User talk:Bavi H|talk]]) 02:23, 16 September 2008 (UTC)
::Well, now the problem is that when I double-click the icons, the folder opens in a '''new''' window, instead of in the old one itself. Help, please. [[Special:Contributions/117.194.227.36|117.194.227.36]] ([[User talk:117.194.227.36|talk]]) 11:49, 16 September 2008 (UTC)
== Compression by generating sequences of data? ==
You could compress the first billion digits of pi in a normal zip fashion, which would likely generate a large-ish file, or you could compress it down to almost nothing, just a few lines of code to generate the whole sequence, if you knew or discovered the pattern in the input data. So the question is this: is it useful, or even possible, to compress data by looking for patterns and trying to create algorithms that re-create the correct sequence of bits? You don't of course need to generate the whole archive from one algorithm, but perhaps try to identify sections that can be successfully attacked this way. How might this be implemented? [[User Talk:Zunaid|Zunaid]] 19:12, 15 September 2008 (UTC)
:As a start I can come up with one "blunt instrument" approach: try many different algorithms (with different parameters) to see what sequences they generate and see if it matches any sequences in the data. This can be sharpened up by starting on sequences in the data that initially look promising by some prior test or knowledge. [[User Talk:Zunaid|Zunaid]] 19:12, 15 September 2008 (UTC)
::The problem here is that without prior knowledge of the data, there is an infinite amount of "patterns" you could look for. Generic lossless [[compression algorithm]]s are relatively crude, they look for one type of "pattern", ie repetition of bits or bytes or sequences thereof, which are then stored with sufficient information to recreate the original data through an algorithm. They work well enough for data commonly encountered such as text, machine code, pictures with large blocks of the same color ... much of the data we use is repetitive by nature. An advantage of this method is that the algorithm to recreate the original sequence can be externalised, saving further space, something that would not be possible with generated algorithms (though this is not so much of advantage on large amount of data). Prior knowledge of the data to compress makes it possible to come up with better schemes (for instance, it would be possible to externalise an "english language" sequencer based on the most common repetitions of characters and words).
::Anyway, I digress. What we have here is basically an [[optimization problem]] with a very complex [[solution space]]. Given the complexity of the solution space, a [[Brute-force search|brute force approach]] searching for a [[global optimum]] is not reasonable. We might however, want to search the solution space for [[local optimum|local optima]]. An appropriate scheme here would be a [[genetic algorithm]], where each individual is an algorithm and the fitness function is a factor of the length of the algorithm and ability to generate data close to the original data (and also to terminate in a reasonable time). This is no simple task to implement, you would most likely want to set up a virtual machine with an appropriate code set (prior knowledge of the data to compress would be very useful here), and the evolutionary scheme of a genetic algorithm is always a tricky part. Both [[lossless]] or [[lossy compression]] would be achievable. Now of course, there's no guarantee such a compression process would ever produce better results than common compression schemes, and it might take a very very long time to run. [[User:Equendil|Equendil]] <small>[[User talk:Equendil|''Talk'']]</small> 21:19, 15 September 2008 (UTC)
:This is more of a practical approach than a theoretical one: check your sequence against all the ones at the [http://www.research.att.com/~njas/sequences/Seis.html On-Line Encyclopedia of Integer Sequences]. This isn't really a compression question so much as a math one: "given a sequence of numbers, can one deduce the function that generated them?". I suspect the answer is "no", but perhaps the folks at [[WP:RD/Math]] might know better. --[[User:TotoBaggins|Sean]] 20:28, 15 September 2008 (UTC)
:It would work, but it wouldn't be too effective: given the infinite number of potential algorithms, you could never be sure that there was one or not. As a specific example, try finding a pattern in the following [[base64]]-encoded data that will let you compress it:
::Kln7j02PJpB59GqXW3zoX3fhPNaILd4srZw25cw0hNHtzOjB+lkSd2BQ75AVKjbfc+2ZS0/ODN6j
::vgLNRtz9Sq47YvxuE1rJHdznm5SwGJv0ScR14LBPuCx+FoK3i+E+T2LA6dh8YvQz2bsBf8yscExz
::EtqmllGnw1ITdn9RwuARTqNcYHTkNJq3cmpGhT6kQdqyrTLtoTjZiz8mif075VpwhJzQCn/YpwBQ
::Xuy9Iy2Xp95ooh9Fpp055yjvJyo6lopcMdvbQhROOjZCJ1T35Kofi6QII9F4W2TYLkUt1GOQqnIp
::lDmuWaObrjMsyGbdQrBkw211EsmWWzdhgFV2FQ==
:(Hint: it's impossible. This is 256 bytes of truly random data.)
:--[[User:Carnildo|Carnildo]] ([[User talk:Carnildo|talk]]) 20:35, 15 September 2008 (UTC)
:If only we knew the pattern for pi... It's irrational; I think that means there's no real pattern. So I doubt you could compress it in the manner you're discussing here. --[[User:Alinnisawest|Alinnisawest]],<sup>[[Special:Contributions/Alinnisawest|<font color="black">'''Dalek Empress'''</font>]]</sup> ([[User talk:Alinnisawest|<font color="#cf0021">'''extermination requests here]]'''</font>) 20:46, 15 September 2008 (UTC)
::The way to do this is to generate a sequence of algorithms, and test if they make the result. The type of computation is [[NP complete]], or computationally difficult, so you probably cannot use it. For particular applications you could probably improve the compression, eg XML, HTML, English text. In practice you don't often want to compress algorithmically generated sequences like pi to a billion decimal places. And yes there are methods to generate [[π]] decimal places. There is a classification of a number in the form of a bit string that asks if the string can be represented by a description shorter then writing out the bits. [[User:Graeme Bartlett|Graeme Bartlett]] ([[User talk:Graeme Bartlett|talk]]) 21:13, 15 September 2008 (UTC)
: You may be interested in [[procedural generation]]. When I was younger, about the era of the 14.4k baud modem (and dinosaurs roamed the Earth), when downloading a few megabyte demo was an all-night affair (and hope your phone didn't get disconnected!), there was a very "demo scene" game that had the look, polish, and engine (more or less) of - let's say, Quake - and the entire thing about about 27kb in size. Every asset was procedurally generated - in playable form, on the order of a few megabytes. [[Spore (2008 video game)]] would be a recent, commercial example of this. Now, arbitrary, post-facto, discrete algorhytmic compression? I believe above responders mostly cover it, although for real data, [[Benford's law]] may be a bit of a catch. [[Special:Contributions/98.169.163.20|98.169.163.20]] ([[User talk:98.169.163.20|talk]]) 01:51, 16 September 2008 (UTC)
There is actually an error in the question. The equation for calculating pi does not in fact expand out to the first billion digits of pi - it expands to ALL of the digits of pi. However, you could fix that by saying how many digits you'd like it to decompress to.
Anyway, we can easily PROVE that you can't compress every arbitary string of data:
:# Let us suppose you could take every possible sequence of N bits (binary digits) and using your algorithm, compress it into something representable in M bits (where M is always less than N) such that you could then take your M bit number and uncompress it again to get the exact same N bit number that you started with.
:# There are 2<sup>N</sup> possible N bit numbers. If you took every single one of those and fed each one, individually into your compression algorithm, getting strings that were at most N-1 bits long. You'd have 2<sup>N</sup> sets of compressed results - one from each of the possible inputs.
:# However, if the outputs only have at most N-1 digits then we must remember that there are only 2<sup>N-1</sup> possible N-1 bit numbers.
:# Since we got 2<sup>N</sup> N-1 digit numbers out of our compressor - but there are only 2<sup>N-1</sup> '''unique''' N-1 digit numbers possible - it follows that some of those N-1 digit numbers we got back are actually completely identical.
:# If we take two of those identical N-1 bit numbers and feed them into an algorithm that decompresses them back into their original strings - then there is a problem. How does the decompression algorithm "know" which of those two different N digit strings to produce since it's being fed the exact same N-1 digit string to decompress in both cases?
:The answer of course is that it can't. Hence lossless compression of all N digit inputs is flat out impossible - no matter how your algorithm works - no matter how clever it might be.
:Knowing that - it can only be that your approach cannot possibly work. However, it clearly does work for some numbers (like PI and e and 0.3333333333333333333...). What that means is it '''must''' fail for many other numbers - which leads you to the rather interesting conclusion that if your approach doesn't work - then some numbers are so "random" than every possible equation in any possible mathematical representation must result in an equation that's at least one bit longer than the number itself!
: We need a name for these numbers (Darn! "Complex number" has already been taken!)
: That's a very cool conclusion! [[User:SteveBaker|SteveBaker]] ([[User talk:SteveBaker|talk]]) 02:11, 16 September 2008 (UTC)
:: To put it more simply: if you could represent any sequence of bits as a shorter sequence of bits, then you could represent *that* shorter sequence of bits as an even shorter sequence of bits etc, which would eventually result in a sequence of bits of zero/negative length, which is absurd, hence not all sequences of bits can be "compressed". [[Reductio ad absurdum]]. That is pretty much a given however, what is interesting is that *some* sequences of bits can be compressed. [[User:Equendil|Equendil]] <small>[[User talk:Equendil|''Talk'']]</small> 17:25, 16 September 2008 (UTC)
Also, finding the shortest algorithm that would generate a piece of data is not possible in general, because that algorithm would have size equal to the [[Kolmogorov complexity]] of the data, which is incomputable. --[[Special:Contributions/71.147.13.131|71.147.13.131]] ([[User talk:71.147.13.131|talk]]) 09:15, 16 September 2008 (UTC)
Thanks guys. Some beautiful maths and engineering answers given here (which, being an engineer, are like air and water to me). Plenty of reading to do! I like the idea of checking sequences against the OIES. You could potentially keep a data store of hundreds of sequences and simply spit out algorithms to generate portions of your compressed data. SteveBaker, I think the term you are looking for is non-[[computable number]]. Anon 98, I've seen those procedurally generated demos before, in fact that is what I had in mind when I though of this, just didn't know the correct name for it so I stuck with billions digits of pi as an example.
I suppose this is (sort of) resolved, just thought I'd post one or two more examples to think about:
# You could generate an hour long video game demo and either save it as compressed lossless video (tens of gigabytes), or you could save the entire game (or if the company makes a "game viewer" then even better) and the player's mouse/keyboard inputs at a cost of maybe a few gigs.
# [[Procedural generation]] as 98 mentioned.
# You could use Microsoft Excel to generate dozens of charts from tabular data and save and compress the xls file (couple of megs maybe?), or you could record a macro of yourself carrying out all the chart-generating actions and simply save the macro and the input data (a few kb's). This one is actually quite useful if you're trying to send lots of excel graph data to someone.
[[User Talk:Zunaid|Zunaid]] 16:31, 16 September 2008 (UTC)
::The thing about procedurally generated stuff in games is NOT that you start off designing some carefully thought out game level - then compress the heck out of it. What they are actually doing is using random numbers (or perhaps pseudo-random numbers) to generate data - and writing the algorithm such that ANY sequence of data fed into it makes a "reasonable" game level. Superficially, this can be made to make a nice-looking game - but it'll never be as good as a game level designed by hand by experienced artists and level designers. Those guys have a lot of very "deep" knowledge that you're not going to get by random generation techniques. (BTW: I'm a professional video game developer.) [[User:SteveBaker|SteveBaker]] ([[User talk:SteveBaker|talk]]) 02:03, 17 September 2008 (UTC)
No - you don't understand what I'm saying. Your speculations for the uses of such an algorithm are truly pointless - it's not just that there would be a few instances of data that wouldn't compress...it's MUCH worse than that.
My argument (above) that proves that compression of arbitary data is impossible also yields a rough probability of being able to compress any given random bit-string by any given ratio: Consider that if you try to compress N bits of data by just '''one''' bit to produce N-1 bits. There are only 2<sup>N-1</sup> compressed data possibilities that have to "code" for 2<sup>N</sup> possible input sequences. It follows that AT BEST (2<sup>N-1</sup>/2<sup>N</sup>)=0.5...only half of all possible N bit sequences can be compressed down to N-1 bits!
Suppose you wanted to do some serious compression - perhaps halving the size of random 1000 bit data strings. 2:1 is a pretty modest compression ratio. So that means that you have to encode 2<sup>1000</sup> possible input data sequences using only 2<sup>(1000/2)</sup> possible compressed data strings...so only 2<sup>500</sup> of those 2<sup>1000</sup> strings can be compressed successfully. That's a TINY fraction of them! REALLY tiny!! In fact, if you fed random 1000 bit strings into your algorithm at a rate of one per second from now until the end of the life of the universe - then it's '''highly''' unlikely that you'd find even one set of input data that would compress successfully! That's a monumentally useless algorithm!! But even if it worked - a 2:1 compression ratio is pretty much useless for most purposes - and 1000 bits of data is less than the length of this paragraph! Now apply the same math to (say) a megabyte of data...there are effectively NO algorithms that can achieve any compression whatever of any piece of random data beyond a few tens of bits long.
So it's not just that there would be some things that wouldn't shrink - what you'd find is that this algorithm (and '''any''' other that attempts to work with truly random data) is simply doomed to being quite utterly useless.
Real compression algorithms (such as the one that 'ZIP' uses) only manage to do lossless compression because they know something about the nature of your data at the get-go. Mostly they assume there are lots of repeated sequences within the data.
So, for example, if you know the input data is ASCII text containing only grammatically correct English sentences - then there are ways to achieve very effective compression. (eg, you could make a list of the 1,000 commonest words with more than four letters and replace any of those words you found with an '?' symbol followed by a three digit number. All English text would get shorter (or at least, no longer) as a result. However, you can only do that because you know that there are definitely no strings like '?xxx' (where 'x' is a digit) in grammatical English sentences. Compression of English text is therefore possible - but only because we know something about the statistics of English and because there are some symbols that are only used in certain contexts.
However, if you tried to apply my trick to compressing (say) photographs - it would never manage to achieve any compression whatever!
[[User:SteveBaker|SteveBaker]] ([[User talk:SteveBaker|talk]]) 02:37, 17 September 2008 (UTC)
== Wireless network control ==
What is a good free replacement to the wireless network control feature in Windows? [[Special:Contributions/79.75.190.211|79.75.190.211]] ([[User talk:79.75.190.211|talk]]) 19:21, 15 September 2008 (UTC)
:Usually computers or wireless cards come with one. It's rarely ''better'' though. What's wrong with the Windows one? [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 23:36, 15 September 2008 (UTC)
== The CAPTCHA problem ==
I am trying to prepare a pywikipedia bot for use on Catalan wikipedia. I have followed all the instructions, but when I try to login I get the message "''wrong password or CAPTCHA answer''". I am completely sure the password is correct, but I don't know what the CAPTCHA problem is. I've added the <code>solve_captcha = True</code> to the ''user-config.py'' file, to no avail. What should I do to solve this problem? Thanks. [[User:Leptictidium|Leptictidium]] (''[[User talk:Leptictidium|mt]]'') 19:40, 15 September 2008 (UTC)
:I'm failry certain that the captcha only appears when you are adding external links, so if that's not fundamental to how your bot works, maybe remove that functionality. Also, the captcha goes away when a user is [[Wikipedia:AUTOCONFIRM|autoconfirmed]], which takes ten edits and four days. Why don't you edit manually using your bot-account for ten edits, and wait a few days :) [[Special:Contributions/90.235.12.16|90.235.12.16]] ([[User talk:90.235.12.16|talk]]) 11:03, 16 September 2008 (UTC)
== XML comment trick ==
Hi, when i do a comment in xml instead of <nowiki><!-- and --> </nowiki>, i just do <nowiki><!--></nowiki> on both sides and like that i just copy past it around. Do anyone here used this method also? [[Special:Contributions/212.150.162.66|212.150.162.66]] ([[User talk:212.150.162.66|talk]]) 21:55, 15 September 2008 (UTC) <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Jobnikon|Jobnikon]] ([[User talk:Jobnikon|talk]] • [[Special:Contributions/Jobnikon|contribs]]) 21:50, 15 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
:Presumably a good reason for not using this is that it makes code harder to read: you can't tell which <nowiki><!--></nowiki>s are starts of comments and which are ends. [[Special:Contributions/84.12.252.210|84.12.252.210]] ([[User talk:84.12.252.210|talk]]) 13:20, 16 September 2008 (UTC)
::Yeah, just stick to the regular kind. The more standard your XML the better. Easier for other people to read. [[Special:Contributions/195.58.125.46|195.58.125.46]] ([[User talk:195.58.125.46|talk]]) 15:02, 16 September 2008 (UTC)
= September 16 =
== Processes on start up ==
How do i stop annoying programs from automatically loading when I start up my computer? for example 'itunes helper' or 'adobe speed launcher' hiding in my processes list. I just don’t want to open at all is there a way to stop them loading? (Other then uninstalling the programs altogether). I am running Vista. <span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.202.144.223|203.202.144.223]] ([[User talk:203.202.144.223|talk]]) 02:44, 16 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:See http://www.howtogeek.com/howto/windows-vista/stop-an-application-from-running-at-startup-in-windows-vista/. --[[Special:Contributions/194.197.235.221|194.197.235.221]] ([[User talk:194.197.235.221|talk]]) 05:18, 16 September 2008 (UTC)
:As a simpler answer: Start -> Run -> msconfig, choose Startup tab when it opens. Basically, if it says 'Updater' in the path, you can generally disable it. jusched is a big one too (the Java auto-updater). Generally you can't mess up too much, though try to stay away from anything that you know is associated with your anti-virus (Symantec, AVG, Norton, long list there). Also, iTunes helper and Adobe speed launcher? Totally unneeded. [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 05:51, 16 September 2008 (UTC)
::Fixed to say "can't mess too much up."
Sweet thanks a lot. <span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.202.144.223|203.202.144.223]] ([[User talk:203.202.144.223|talk]]) 05:54, 16 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:There is actually a better way: msconfig isn't able to stop everything. A MUCH better program is [http://technet.microsoft.com/en-us/sysinternals/bb963902.aspx AutoRuns] from Sysinternals. It'll show you ''everything'' that goes on a start-up and gives you the option to stop it. [[Special:Contributions/90.235.12.16|90.235.12.16]] ([[User talk:90.235.12.16|talk]]) 11:13, 16 September 2008 (UTC)
:I second that, "autoruns" is good, make sure you understand what you are doing however, or you may soon find you have disabled processes you should not such as useful drivers. [[User:Equendil|Equendil]] <small>[[User talk:Equendil|''Talk'']]</small> 17:34, 16 September 2008 (UTC)
== Can't install an important Vista update ==
After installing Vista on a "Vista Ready" HP Pavilion desktop, I downloaded the available updates but got a 643 error on one of them. It turned out to be for Microsoft .NET Framework 1.1 Service Pack 1. But the Microsoft download website says this service pack was published in August 2004. If I download this version, wouldn't it clobber any later version of .NET Framework I might have? This is supposed to be an important security update. What do I do? --[[User:Halcatalyst|Halcatalyst]] ([[User talk:Halcatalyst|talk]]) 02:48, 16 September 2008 (UTC)
:Don't worry about it. It's probably installed in some form already. The Windows Update site is relatively dumb. However, if you'd like to check it anyway, grab the .NET 3.5 Network Installer (or Redistributable) and install that. It should install .NET 1.1 SP1, .NET 2.0 SP1 and .NET 3.0/3.5. You can also grab the .NET 3.5 SP1 installer and run that. Then you can make triply sure they're all up-to-date. [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 05:56, 16 September 2008 (UTC)
::.NET 3.5 Redistributable, does '''not''' install .NET 1.1. .NET 1.1 is also not included in Windows Vista, it is a separate system from .NET 2.0 onwards and will not interfere with it if installing afterwards. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 18:20, 16 September 2008 (UTC)
*Can I request a tie breaker? ;) --[[User:Halcatalyst|Halcatalyst]] ([[User talk:Halcatalyst|talk]]) 01:26, 18 September 2008 (UTC)
:Jimmi Hugh was right. I thought I saw 1.1 included in the list for 3.5, but I stand corrected. Also, installing these after having installed 2.0 or above won't affect anything but 1.1
:Here's the link for .NET Framework 1.1 Redistributable: http://www.microsoft.com/downloads/details.aspx?familyid=262D25E3-F589-4842-8157-034D1E7CF3A3&displaylang=en
:Here's the link for .NET Framework 1.1 SP1: http://www.microsoft.com/downloads/details.aspx?FamilyId=A8F5654F-088E-40B2-BBDB-A83353618B38&displaylang=en [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 05:14, 18 September 2008 (UTC)
== where do i buy kudzu? ==
::''(Moved to science desk -- OP meant plants, not software) --- [[User:OtherDave|OtherDave]] ([[User talk:OtherDave|talk]]) 10:58, 16 September 2008 (UTC) ''
== internet history ==
Hi There,
Is there any programme to clean internet history for good.
P.P.[[Special:Contributions/80.254.93.170|80.254.93.170]] ([[User talk:80.254.93.170|talk]]) 08:46, 16 September 2008 (UTC)
:You can clear your internet history for [[Internet Explorer]] by clicking tools > internet options, then clicking 'clear history'. You can also clear temporary-history-files within the same area (Tools > internet options > Delete files > tick 'delete all offline content' and click ok), in the same area you can also delete [[Internet cookies]] (tools > internet options > delete cookies... > 'ok'). The information should be then pretty much 'deleted' from the view of most everyday people. Clever people could still perhaps access information - and certainly recovery-specialists could potentially get information from your hard-drive, but realistically unless you're doing something illegal/highly dubious the above should be more than enough to remove your history from everyday viewing (i'll assume you are buying a present for someone and don't want them to look at page-history and find a link to the gift selling website...) [[Special:Contributions/194.221.133.226|194.221.133.226]] ([[User talk:194.221.133.226|talk]]) 09:30, 16 September 2008 (UTC)
:Every browser I know of lets you clean out the cache. For something really drastic: (1) save the bookmark file, (2) uninstall the browser (a bit difficult if it's MSIE), (3) install a newer version (there always is one available) of the browser, (4) copy back the bookmark file, (5) tell your parents (if they notice) that you upgraded as a "security measure." That's because "security" always sounds good. (But don't over-egg it with talk about "Islamic extremists" or other piffle too obviously borrowed from US electioneering.) [[User:Tama1988|Tama1988]] ([[User talk:Tama1988|talk]]) 09:37, 16 September 2008 (UTC)
:I use, [http://www.detectionmaster.com], just because it's so easy to use... but there's probably some free tools available too for those who know what they're doing with them. It also allows you to see deleted files, which i suppose some people might find useful, i've never used it. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 09:43, 16 September 2008 (UTC)
Thanks for your help, the main reason is that I am selling my pc, and I would like to clean it from all internet history,web sites, coockies etc. I don't want anybody sneaking on me, such as, on which web sites I hit.
p.p.[[Special:Contributions/80.254.93.170|80.254.93.170]] ([[User talk:80.254.93.170|talk]]) 10:36, 16 September 2008 (UTC)
:If you're selling your PC, you should wipe the entire hard-drive clean (not just the browser history) using something like [[Darik's Boot and Nuke]]. That will remove any trace of what was on there before (and it's free!). Then, if you want, you can just reinstall the OS clean or just sell it without an OS on it. [[Special:Contributions/90.235.12.16|90.235.12.16]] ([[User talk:90.235.12.16|talk]]) 11:06, 16 September 2008 (UTC)
::I should make something a little bit clearer: Darik's Boot and Nuke will wipe your ENTIRE hard-drive away. I mean, nothing on there will ever be recoverable, and you will not be able to boot it up because the OS has been wiped. So fair warning: if there's anything on there you want to save, be sure to save it before nuking it. And if you want your computer to start again, you'll need a Windows XP Install CD so you can reinstall the operating system (which will also be gone). [[Special:Contributions/90.235.12.16|90.235.12.16]] ([[User talk:90.235.12.16|talk]]) 11:10, 16 September 2008 (UTC)
::That's a little excessive... unless you think there is a serious shortage of computing power at a Major goverment or scientific institute, the chances of anyone with the ability to recover past a single layer of format and caring about the data they find is unlikely. Windows 98 Boot floppy, "format C:". Sorted, sell it and mention it doesn't have an OS unless you reinstall it. Also, some computers (I love Dell, so they're probably the only ones) come with a reinstall system mentioned in the manual that sets the computer back to the state it was in when you first got it. If you run this, it won't format your drive, so you should run a program like the one I mentioned above or cyberscrub to clean the unused clusters before selling it. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 12:18, 16 September 2008 (UTC)
:::I'm under the (possibly mistaken) impression that DOS <tt>format</tt> doesn't overwrite the contents of the drive even once. If you do a quick format (<tt>/Q</tt>) it never even looks at most of the disk surface. If you do a full format it tests the whole disk for bad sectors, but I think this is done by reading, not writing. It's easy to recover files from a formatted disk using software like [[PhotoRec]]. Probably the most convenient way to securely wipe your C: drive is to install [[TrueCrypt]] 5.0 or later and enable boot-drive encryption, choosing a nice long passphrase. You can keep using your computer while it scrambles the disk contents, and in fact up to the moment you give it away. Then you simply power it down and wipe the passphrase from your mind. -- [[User:BenRG|BenRG]] ([[User talk:BenRG|talk]]) 13:16, 16 September 2008 (UTC)
::::I can't speak for all versions, but the Format included in the standard "Windows 98 Bootdisk" created by XP/Vista, fills the entire partition with 0's, meaning pyhsical drive analysis would be needed to recover any data. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 15:17, 16 September 2008 (UTC)
== BIOS with embedded OS ==
Why don't BIOS have an OS embedded? Flash memory is cheap enough and OS like Puppy Linux only have 128 MB....[[User:Mr.K.|Mr.K.]] [[User_talk:Mr.K.|(talk)]] 10:36, 16 September 2008 (UTC)
: Some do - [[SplashTop]], [[HyperSpace (software)]], and I think Dell are making a few machines with this (whether its their own tech or one of these I don't know). -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 10:42, 16 September 2008 (UTC)
:: Dell's thing is called "Dell Latitude ON" - http://www.engadget.com/2008/08/15/dells-latitude-on-instant-os-detailed-screenshooted/ I don't think they're actually selling it yet. -- [[User:Finlay McWalter|Finlay McWalter]] | [[User talk:Finlay McWalter|Talk]] 10:45, 16 September 2008 (UTC)
:The disadvantages out weigh the advantages. While there are some executive system programs being embedded in some BIOS to cover those advantages (resident recovery system etc.), given the longevity of some system's, the constant upgrading of software features and the size of hard drives, there are few good reason's to stick it all in ROM. While you can of course Flash ROM, it still limits the Operating System. Also note, that any speed advantages ever seen from ROM have long gone, and nearly all ROM is now shadowed into RAM before executing. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 12:13, 16 September 2008 (UTC)
:There are versions of Linux that can be burned into a BIOS ROM too. [http://www.coreboot.org/Welcome_to_coreboot Coreboot] (which used to be called "LinuxBIOS") does exactly that. [[User:SteveBaker|SteveBaker]] ([[User talk:SteveBaker|talk]]) 13:59, 16 September 2008 (UTC)
::Plus every embedded device you can find... I think his point was about featured desktop systems as opposed to utilities and specialist devices. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 15:14, 16 September 2008 (UTC)
== Camera / memory card ==
Will [http://cgi.ebay.com/4GB-Sandisk-MicroSD-4-G-GB-Micro-SD-TF-memory-card-new_W0QQitemZ220281895113QQihZ012QQcategoryZ18871QQssPageNameZWDVWQQrdZ1QQcmdZViewItem this type of memory card] work with my camera - a [http://www.walmart.com/catalog/product.do?product_id=5634178 Polaroid I633]. If not... what type do I need? Thank you in advance! --[[User:Endlessdan|Endless]][[User talk:Endlessdan|dan]] and [[User:Endlessdan/CLAN IN THE FRONT|his problem]] 14:26, 16 September 2008 (UTC)
:No. According to that Walmart page (assuming it's correct), the camera takes SD and MMC cards only. That is a MicroSD (actually MicroSDHC) card, which is a smaller version of SD. You can buy adapters, but there's no mention of the camera supporting SDHC; in that case, even an adapter would not allow the card to work. If the camera doesn't support SDHC then what you're stuck with is plain SD/MMC cards. Keep in mind that anything over 2GB is an SDHC card. [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 14:46, 16 September 2008 (UTC)
I can't get to the ebay link but based on the title it suggests that the type is 'micro SD'. Based on the information on the walmart link the camera takes an [[SD Card]]. These are cheap and available pretty much everywhere. There's no need for you to get micro-SD - although the SD Card article suggests it is possible for micro-sd cards to be used in SD card slots...but there's no point. You can find SD cards everywhere. The listing doesn't say whether or not High-capacity SD cards (SDHC) work so I would get a normal SD Card (say 1gb or 2gb) - that should provide plenty of storage at a reasoanble cost. [[Special:Contributions/194.221.133.226|194.221.133.226]] ([[User talk:194.221.133.226|talk]]) 14:48, 16 September 2008 (UTC)
:Two concerns, one minor
:1. Minor issue: Some<sup>[who?]</sup> have suggested that using an SD card might give you faster performance. I am not sure about it.
:2. Major issue: Most<sup>[citation needed]</sup> older consumer electronics do not support SD cards with a capacity greater than 2 GB. It might be that your camera falls under that category. As the eBay seller cautions, "Please make sure your devices can support microSDHC, we do not responsible for any compatibility problem."<s> I am sure someone more knowledgeable about digital photography and flash storage will come by to answer your question shortly.</s> <s>However, in the meantime, y</s>You might want to read [[Secure Digital card#SDHC ]]. (If your camera does not support SDHC, your only solution would be to get a card of 2 GB or smaller capacity.) Have a great day! [[User:Kushal one|Kushal]] ([[User talk:Kushal one|talk]]) 14:54, 16 September 2008 (UTC)
Thank you everyone for your help. I am a complete clod when it comes to computer junk. So, would [http://cgi.ebay.com/New-SANDISK-1GB-1-GB-SD-Secure-Digital-Memory-Card-USA_W0QQitemZ180289800762QQihZ008QQcategoryZ18871QQssPageNameZWDVWQQrdZ1QQcmdZViewItem this] kind of card be okay? I'd prefer a 2GB, but every time I do a search... it comes up with a micro card. Can someone kindly just point me in the direction of a cheap, non-micro 2GB card? --[[User:Endlessdan|Endless]][[User talk:Endlessdan|dan]] and [[User:Endlessdan/CLAN IN THE FRONT|his problem]] 15:00, 16 September 2008 (UTC)
: I think [http://cgi.ebay.com/NEW-SANDISK-2GB-2-GB-SD-Memory-Card-2G-G-TREO-wii_W0QQitemZ190252333163QQihZ009QQcategoryZ18871QQssPageNameZWDVWQQrdZ1QQcmdZViewItem I found one]. I just used -micro in my search. Would this card be suitable for my camera? Again, many thanks. --[[User:Endlessdan|Endless]][[User talk:Endlessdan|dan]] and [[User:Endlessdan/CLAN IN THE FRONT|his problem]] 15:01, 16 September 2008 (UTC)
::Too many edits. Yeah, that would work. [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 15:04, 16 September 2008 (UTC)
: (edit conflict) [http://www.meritline.com/pqi-2gb-60x-sd-card.html $7.25 to your door], assuming you're in the USA. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 15:02, 16 September 2008 (UTC)
::Unknown asian brand? [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 15:04, 16 September 2008 (UTC)
:A 2GB MicroSD card ''with an SD adapter'', kind of like the first listing, will work fine. The only issue is that it doesn't appear your camera supports SDHC (though that's not always well documented, you may want to check the manual), so you have to go for 2GB or lower. But yes, that 1GB card will work too. [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 15:03, 16 September 2008 (UTC)
Cool. I sorta assumed the cards I linked to on Ebay, the "scandisk" memory cards were bootleg. Should I avoid the Asian card for $7.25? --[[User:Endlessdan|Endless]][[User talk:Endlessdan|dan]] and [[User:Endlessdan/CLAN IN THE FRONT|his problem]] 15:08, 16 September 2008 (UTC)
: PQI is a pretty well-known memory manufacturer. You can see many more reviews at [http://www.newegg.com/Product/Product.aspx?Item=N82E16820141030&Tpk=pqi%20sd%202gb Newegg]. I've used PQI cards (other sizes) with good success. I've also used the vendor I linked to once or twice with no problems. I think you'll have trouble finding non-Asian memory products. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 15:26, 16 September 2008 (UTC)
:: Cool. I will get that card then. Thanks! --[[User:Endlessdan|Endless]][[User talk:Endlessdan|dan]] and [[User:Endlessdan/CLAN IN THE FRONT|his problem]] 15:35, 16 September 2008 (UTC)
:It is safe to assume that every single SD card on ebay is bootleg. --[[User:Carnildo|Carnildo]] ([[User talk:Carnildo|talk]]) 20:25, 16 September 2008 (UTC)
== html help for tables ==
<nowiki>border=" 3px solid #DFFF00"</nowiki> creates a border around all the cracks and crevasses of my table. What can I do make it go only round the very outside. Thanks, html noob --[[Special:Contributions/217.227.85.122|217.227.85.122]] ([[User talk:217.227.85.122|talk]]) 14:57, 16 September 2008 (UTC)
<table border="3">
<tr><td>cell</td><td>cell</td></tr>
<tr><td>cell</td><td>cell</td></tr>
</table>
<table style="border: 3px solid #dfff00" rules="all">
<tr><td>cell</td><td>cell</td></tr>
<tr><td>cell</td><td>cell</td></tr>
</table>
Could this be what you're looking for? You seem to be mixing HTML4 attributes and CSS. --'''[[User:Kjoonlee|Kjoon]]'''[[User talk:Kjoonlee|lee]] 15:31, 16 September 2008 (UTC)
<table style="border: 1px solid blue; border-collapse: collapse;">
<tr><td>cell</td><td>cell</td></tr>
<tr><td>cell</td><td>cell</td></tr>
</table>
--This what you want? --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 15:44, 16 September 2008 (UTC)
:Yep that's it. Why isn't it rendering the same on my screen? --[[Special:Contributions/217.227.89.144|217.227.89.144]] ([[User talk:217.227.89.144|talk]]) 16:02, 16 September 2008 (UTC)
::Look at the style guidelines I put on it. You have to set <tt>border-collapse: collapse;</tt> to make it stop automatically adding border lines to the TD elements as well. --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 17:25, 16 September 2008 (UTC)
== JPG Fullscreen, quick! ==
I need a quick way to display a jpg image fullscreen of my computer. Sorta like a [[boss key]]. Any suggestions? 15:04, 16 September 2008 (UTC)
:I assume you are using Windows. Make your desktop image whatever JPG you want to show. Remove the desktop icons (they shouldn't be there anyway). There is a "show me my desktop" icon, button, and keyboard command for Windows. I don't use Windows, so I don't know what the keyboard command is. Press it and all open windows will be replaced by your desktop - which is the jpg image you want to show. -- [[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|™]] 17:36, 16 September 2008 (UTC)
::If the keyboard has the "Windows" key, then the "Show Desktop" keystroke is Win-D. The Win key has to be held down while pressing the D. --[[User:LarryMac|<font color="#3EA99F">LarryMac</font>]][[User talk:LarryMac|<font color="#3EA99F"><small> | Talk</small></font>]] 17:43, 16 September 2008 (UTC)
:: Kainaw - what do you have against icons on the desktop (in an operating system you don't even use)? [[User:AndrewWTaylor|AndrewWTaylor]] ([[User talk:AndrewWTaylor|talk]]) 13:02, 17 September 2008 (UTC)
:::Many people feel that the windows desktop analogy has been corrupted by software manufacturers who believe that it is the place for short-cuts to their applications, where it should only be for the documents and files you are currently working on, just like a real desktop in an office. - [[User:Phydaux|Phydaux]] ([[User talk:Phydaux|talk]]) 14:49, 17 September 2008 (UTC)
::::The average user does not use the desktop as a desktop. He or she uses it as a repository for absolutely everything. Every application has a link on the desktop. Every picture they downloaded is on the desktop. Every attachment from their email is on the desktop. Every install program they downloaded is on the desktop. When I'm asked to fix a problem on their computer, I have to stand there as they spend 10-20 minutes looking around on their desktop for the icon they clicked that caused the problem. By having to support users who put hundreds of icons on the desktop - to the point that they are all overlapping, I am at the opposite extreme of not wanting to see a single icon on the desktop at all. -- [[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|™]] 01:32, 18 September 2008 (UTC)
==Syncing==
I am looking for a software solution which would allow me to efficiently sync the contents of two PCs (both running WinXP). The first PC has all of the data (in several thousand directories and files), a subset of which is updated daily (new files are added, some old files are deleted, some files moved around, some renamed, and some updated). The second PC is supposed to mirror the first one, which is done daily by copying the affected directories from the first PC to a USB key and then replacing the matching subset on the second PC with the USB key data. I am looking for a solution that would allow to automate the process—i.e., at the end of the day it should determine which files/directories on the first PC have changed, copy only the changed data to the USB key, and then update the second PC with that information. The size of the daily updates can be anywhere from a few megabytes to almost two gigabytes and over time is expected to grow on average. The PCs are not networked (and can't be, as they are located in separate physical locations and one is not connected to the Internet for security reasons).
Preferrably, the software should be free (or reasonably priced), run without installation (being able to run it from the USB key itself would be ideal), and be able to handle missed cycles (i.e., if the updated data from the first PC were copied to the key but never moved to the second PC, it should not be a problem on the next day when more updated data is added to the key), but I realize that meeting all of the criteria is probably asking too much. Nevertheless, I would most appreciate any suggestions, as no software I've tried so far was able to supply this supposedly trivial functionality with satisfactory results. Thanks!—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 16:08, 16 September 2008 (UTC)
:Would [[Robocopy]] work? I believe it lets you set job times. Alternatively, you may be able to script the [[SyncToy]] Windows XP PowerToy. You'll need to install one or the other, which may somewhat preclude the "run off USB." I'm not sure how well robocopy especially would hold up for that. [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 16:36, 16 September 2008 (UTC)
:Or, you could schedule a batch script with xcopy: xcopy src dest /D /E /V /C /I /H /Y /Z
:This will copy all newer files, copy all subdirectories, verify copies, continue on error, default to copying files to a directory, copy hidden+system files, suppress overwrite prompts, copy in restartable (could probably remove that).
:However, it may be better to use robocopy. Xcopy has some evil niggling details (if a path is >253 characters, it fails with an 'insufficient memory' error). I believe the third-party XXcopy doesn't have this limitation and supports mostly the same commands. [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 16:36, 16 September 2008 (UTC)
: I haven't used it, but the [http://portableapps.com/apps/utilities/toucan PortableApps version of Toucan] may satisfy your requirements. At the very least, it will run directly from the USB drive—that's the point of PortableApps. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 16:48, 16 September 2008 (UTC)
::Xcopy was my firsh thought, too, but it's unsuitable because it ignores the fact that some of the files are being deleted and some are moved around. Robocopy and Toucan, however, look promising, at least at the first glance; I'm going to give them a test run. Meanwhile, if anyone has other suggestions, I'm ready to try them out as well. Thanks much!—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 17:08, 16 September 2008 (UTC)
:::If you use robocopy /MIR, be very careful that you know what it does. My reasoning glitched the first and second times I used it. Give it a couple of shots on a fake folder-set so you know what it will do in varying situations. However, that should handle the 'remove files' cases. [[User:Washii|Washii]] ([[User talk:Washii|talk]]) 17:20, 16 September 2008 (UTC)
::::Thanks for the word of warning :) I'm going to test robocopy next, as Toucan did not work out for me—it's much like many other tools I tried, as it does a fairly decent job of syncing a source and a destination, but not through an intermediary means (USB key, in this case).—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 17:33, 16 September 2008 (UTC)
:::::I don't know how far you've gotten, but I did find out that just the robocopy executable should work all on its lonesome as long as you're using a Unicode-based Windows (at least Win2k and up). It should be fairly easy to write batch scripts for re-using the same parameters, but different paths, too. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Washii|Washii]] ([[User talk:Washii|talk]] • [[Special:Contributions/Washii|contribs]]) 17:53, 17 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
::::::I've so far been testing robocopy (and yes, it works on its own just fine) and found it to be an extremely useful and flexible tool (so thanks for the tip) which, unfortunately, does not work for my purposes. If I were able to copy the whole data set to the USB key, robocopy would do a marvelous job of syncing the first PC with the USB key and then the USB key with the second PC. However, since the whole thing is currently at 250 gigs and is only expected to grow, using a USB key for that is out of the question (and hauling a USB hard drive back and forth every single day is something I am desperately trying to avoid). The software I need should be able to work with subsets of the data (which probably means it needs to create a catalog of the first and second PC contents, be able to create USB key subsets/copy them to the second PC using those, and then update those catalogs accordingly at each run). Any other suggestions would be ''greatly'' appreciated. I have not tried the SyncToy yet, but by the looks of it it is going to have the same problem as robocopy (i.e., it would sync a source and a destination, but not via subsets recorded onto an intermediary device).—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 14:23, 18 September 2008 (UTC)
== Sorting a text file by line length, linux ==
I need to sort a huge text file, ordering it by increasing line length. The shortest lines in the input are to be the first in the output, then the second-shortest lines, and so on. I would imagine this to be a one-liner, but am not all that familiar with bash scripting, and would appreciate help on how to achieve this. Thanks. --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 18:15, 16 September 2008 (UTC)
: I don't know of a simple way to do that, as ''sort'' doesn't have that feature. The following ugly little script does it by prefixing each line with its line length, calling sort, and then removing that prefix.
<pre style="margin-left:5em;">
#!/bin/bash
python -c "import sys
for line in sys.stdin: sys.stdout.write('%08d%s' % (len(line),line))
" | sort | python -c "import sys
for line in sys.stdin: sys.stdout.write(line[8:])"
</pre>
: If you had that saved in lsort.sh, your command line would be <code>lsort.sh < longfile.txt > sortedlongfile.txt</code> [[Special:Contributions/87.114.18.90|87.114.18.90]] ([[User talk:87.114.18.90|talk]]) 20:35, 16 September 2008 (UTC)
::Thanks, I'll try it out! --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 20:48, 16 September 2008 (UTC)
:If you have Perl installed, you can do it with this one-liner:
<pre style="margin-left:5em;">
perl -e 'print sort { length $a <=> length $b } <>'
</pre>
:<s>The only</s>One caveat is that this won't work correctly if the last line isn't terminated with a newline. The best I can come up with for that case is
<pre style="margin-left:5em;">
perl -e 'print sort { length $a <=> length $b } map { chomp; "$_\n" } <>'
</pre>
:(edit: As mentioned below, it also won't work with files too large to fit in memory.) -- [[User:BenRG|BenRG]] ([[User talk:BenRG|talk]]) 21:01, 16 September 2008 (UTC)
::Beautiful! The last line was newline-terminated, so no problems with that. Worked like a charm, and fast, too. Thank you! --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 21:33, 16 September 2008 (UTC)
::Ben, does Perl's <tt>sort</tt> work properly on a dataset that's bigger than the process's available mem/swap? I copped out of the sort and used the coreutils sort because I was ''under the impression'' that it did, but on reviewing its man page it's silent on the topic. If NorwegianBlue's input file really is ''that'' huge, then this may be an issue. [[Special:Contributions/87.114.18.90|87.114.18.90]] ([[User talk:87.114.18.90|talk]]) 21:41, 16 September 2008 (UTC)
:::Ben's solution does indeed have that problem if the file is very large. The "<>" construct slurps all lines into memory. --[[User:TotoBaggins|Sean]] 23:23, 16 September 2008 (UTC)
::::I'll keep that in mind. I tried it out on a smaller (though still large) version of the file in question. If this turns out to be a problem, I'll use 87.114's script. Thanks again! --[[User:NorwegianBlue|NorwegianBlue]]<sup>[[User_talk:NorwegianBlue| <u>talk</u>]]</sup> 09:50, 17 September 2008 (UTC)
::A side effect of 87.114.18.90's bash method is that same-length lines are sorted. In BenRG's perl method same-length lines appear in an arbitrary order. If that matters. [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 13:16, 17 September 2008 (UTC)
:::According to [http://perldoc.perl.org/functions/sort.html this documentation], you could add <code>use sort 'stable';</code> to the beginning of BenRG's code, and it would guarantee [[stable sorting]]. That is, lines of the same length would come out in the same order that they went in. That's different from 87.114.18.90's output, where everything is sorted lexically. Either one might be preferred, or it might not matter. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 13:27, 17 September 2008 (UTC)
::::In my code you can get lexicographical sorting within each line length by replacing <code>{ length $a <=> length $b }</code> with <code>{ length $a <=> length $b || $a cmp $b }</code>. -- [[User:BenRG|BenRG]] ([[User talk:BenRG|talk]]) 16:13, 17 September 2008 (UTC)
:::::That's very cool. I've never perl'ed, it looks very handy. Thanks. [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 18:23, 17 September 2008 (UTC)
: In the event that ''huge'' really does mean "bigger than available RAM/swap" (and my suspicion that GNU/POSIX sort will only sort in memory) the following will do a bit better
<pre style="margin-left:5em;">
!/usr/bin/python
theGreatIndex=[]
___location=0
f = open('srcfile.txt','r')
for line in f:
length=len(line)
theGreatIndex.append((length,___location))
___location += length
theGreatIndex.sort()
for (len,pos) in theGreatIndex:
f.seek(pos)
line = f.readline()
print line,
</pre>
: As it only remembers the line length (and its position in the file) it uses memory more efficiently (by how much depends on the distribution of lines in the source data). If NorwegianBlue's file has a pretty long average line length (e.g. apache log files) then this should allow you to sort a file perhaps 10 times bigger. But if the file is significantly bigger than available memory that (essentially random) <tt>seek</tt> will annihilate the disk cache, and this will all run eyewateringly slowly. The best thing to do when sorting astronomically large files (by line length or anything else) is probably a multi-stage windowed mergesort between a bunch of temporary files. [[Special:Contributions/87.114.18.90|87.114.18.90]] ([[User talk:87.114.18.90|talk]]) 16:51, 17 September 2008 (UTC)
::Actually, I think GNU sort will operate on files larger than memory/swap. (I'm also surprised.) The [http://www.gnu.org/software/coreutils/manual/html_node/sort-invocation.html manual] doesn't say explicitly, but it uses TMPDIR for something, and it lets you specify the size of a "memory buffer". It also cautions that the "buffer grows beyond ''size'' if sort encounters input lines larger than ''size''", implying that the longest ''line'' has to fit in memory. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 16:59, 17 September 2008 (UTC)
== Gaming laptop ==
What is the cheapest laptop or netbook that could run a game like [[Team Fortress 2]] well enough to play it very smoothly at its lowest-end graphics settings?--[[Special:Contributions/142.108.107.93|142.108.107.93]] ([[User talk:142.108.107.93|talk]]) 18:40, 16 September 2008 (UTC)
:You can get cheap laptops at every major brand for about $400-$600 that can easily run such a game, provided no other program is running. The cost goes up by $200 if you plan on using genuine Windows. You should go for 1 GB of RAM, getting a good CPU is very expensive. [[User:Admiral Norton|Admiral Norton]] <sup>([[User talk:Admiral Norton|talk]])</sup> 18:52, 16 September 2008 (UTC)
::My friend's Toshiba laptop with a Core 1 Dual 1.8Ghz and Geforce 7300Go with 1GB of ram can play TF2 on lowest setting on its native resolution, 1280×800. TF2 isn't that demanding. --[[User: Antilived|antilived]]<sup>[[User_talk:Antilived|T]] | [[Special:Contributions/Antilived|C]] | [[User:Antilived/Gallery|G]]</sup> 04:36, 17 September 2008 (UTC)
:::It's also important to have separate graphics memory (ie not "shared graphics memory"). This will markedly improve gaming performance. — [[User:QuantumEleven|Quantum]]<i>[[User_talk:QuantumEleven|Eleven]]</i> 12:54, 18 September 2008 (UTC)
== Mobile MSN doesn't show contacts as online ==
Hi all,
I have a smartphone with WM6 and Windows Live Messenger. Why does Messenger show all contacts as offline even if they're for sure online?
Thanks, [[User:HardDisk|HardDisk]] ([[User talk:HardDisk|talk]]) 19:43, 16 September 2008 (UTC)
PS: How do I determine which program transmits how much data via GPRS/EDGE? I hate it that even if I'm connected via Wifi, that some app wants Internet access via GPRS :(
:It's a [http://www.pocketpcaddict.com/forums/software/22162-windows-live-messenger-problem.html known bug] (see also [http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=2031558&SiteID=1], [http://www.microsoft.com/communities/newsgroups/en-us/default.aspx?dg=microsoft.public.windows.live.messenger&tid=bbb4a740-8458-4c57-9432-d8359d3bbe0f&cat=&lang=&cr=&sloc=&p=1]). As far as I know, signing off and back on is the only way to "resolve" this problem.—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 20:31, 16 September 2008 (UTC)
::There was a hotfix mentioned on one of the links, it solved the problem. Thanks![[User:HardDisk|HardDisk]] ([[User talk:HardDisk|talk]]) 18:26, 17 September 2008 (UTC)
== Sign-in secure for this online banking? ==
Hi all,
I am a member of Cambridge Savings Bank, and the website for signing in is https://www.csbwebonline.com/onlineserv/HB/Signon.cgi
Although the protocol is https, the little info button to the left of my Firefox browser says that the site 1) does not supply any identity information about itself, and 2) my information is not encrypted. Compare this to my Bank of America info button, which not only says the information is encrypted, but also that it's been verified by Verisign.
Is there any reason to not feel safe on the Cambridge Savings website?
Thanks, — Sam 21:08, 16 September 2008 (UTC)
: The certificate itself is issued by [[VeriSign]] and is still not past it's expiration date. On FF3, I get a message saying that parts of the webpage are not encrypted before data is transmitted over the internet. The question that you should ask the bank is what is or isn't encrypted. Thanks [[User:AreJay|AreJay]] ([[User talk:AreJay|talk]]) 21:34, 16 September 2008 (UTC)
:: The message about parts of the page being insecure usually means that it's including bits of content that are accessed through plain [[HTTP]] instead of [[HTTPS]]. In this case the little house icon at the bottom of the page (before "Equal Housing Lender") is an example of this; the page also includes some [[CSS]] stylesheets and [[JavaScript]] files called by HTTP. Poor page design, as it is confusing, or even scary, to the non-technical user, but probably not actually a security hole. I'd suggest you should point out the problem to the bank (though I have done the same with a bank I have accounts with, to little effect other than a patronising "everything is fine" reply). [[User:AndrewWTaylor|AndrewWTaylor]] ([[User talk:AndrewWTaylor|talk]]) 12:52, 17 September 2008 (UTC)
:::OP, I think you should still talk with your bank about it. Why should we put up with the laziness of their Web Development team? [[User:Kushal one|Kushal]] ([[User talk:Kushal one|talk]]) 20:04, 17 September 2008 (UTC)
Thank you all very much! — Sam 00:52, 18 September 2008 (UTC) <span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/146.115.120.108|146.115.120.108]] ([[User talk:146.115.120.108|talk]]) </span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Dynamic Controls - Ideas please :) ==
Hi,
I'm writing a small program using vb express 2005. I currently have a form with a few controls (listview, comboboxes, a couple of masked editboxes and buttons here and there).. i need to make similar forms but with different controls, labels etc... So i thought it might be more efficient (and more flexible down the road) if the form / controls would be dynamically created from something like a list or database. But i'm afraid that might be making it a little too complicated (if need to store info like control type, ___location, etc) and take too much coding time. I was also considering just adding items (much like headers) to a list,and force all input to be done thru something like an edit box, but it would look too 'unprofessional'...
Anyone got ideas on how to implement this better? Am confident there are... Examples or links to articles pointing me in the right direction would also be much appreciated.
Thanks in advance [[Special:Contributions/119.111.70.146|119.111.70.146]] ([[User talk:119.111.70.146|talk]]) 21:17, 16 September 2008 (UTC)
:Sorry, I don't VB but in C++ (I know you want VB but a C++ response might be better than none?) it would go something like this. In the constructor of the form where the button is to appear:
Button *pBtn = new Button(this); // make a new Button. pBtn is a pointer to the new instance
pBtn->Parent = this; // attach it to the form
pBtn->Left = 0;
pBtn->Top = 0;
pBtn->Width = 25;
pBtn->Height = 15;
pBtn->Caption = "DynoButton";
pBtn->onClick = myDynamicButtonClickHandler;
etc.
:There's probably a list of properties like this in the button's "editor"? Don't forget to delete the button in the form's destructor. WYSIWYG is easier, huh? Hope this helps. [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 20:29, 17 September 2008 (UTC)
:You can do it programmatically in VB.NET but it isn't a trivial task. It's not really a trivial task in any language, frankly—even making forms in HTML (which takes care of most of the positioning issues automatically) requires a lot of tinkering, and for something like VB it's usually not worth doing unless there is a very strong need to have form information programatically assembled. Consider that in the end it would probably take as much if not more work than just doing it all in Design mode—even with a very robust system you're not going to be able to get off by just saying, "Oh, make me a few listboxes", you're still going to have to specify where they go, what data they have, what happens when you change them, etc. etc. etc.. --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 00:39, 18 September 2008 (UTC)
:It's incredibly simplistic. Create a new object of the type of control you want, set it's properties as you would any other class of control, even simpler if you load this data from a file, then add it to the specific Forms control collection. There's even a few simple examples in the MSDN library. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 00:48, 18 September 2008 (UTC)
:thank you all very much for your responses. i feel *.8.46 understood my question best, and was able to convince me to just hard-code it. [[Special:Contributions/119.111.70.146|119.111.70.146]] ([[User talk:119.111.70.146|talk]]) 17:59, 18 September 2008 (UTC)
= September 17 =
== LAN/WAN Engineer ==
What is the most practiical way to become schooled as a LAN/WAN engineer, while already employed F/T ? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Sandrums|Sandrums]] ([[User talk:Sandrums|talk]] • [[Special:Contributions/Sandrums|contribs]]) 03:36, 17 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
:What country do you live in? Your local college may provide evening courses to teach you the subject, otherwise, a correspondence course. — [[User:QuantumEleven|Quantum]]<i>[[User_talk:QuantumEleven|Eleven]]</i> 13:37, 17 September 2008 (UTC)
== Huge security problem in Linux ==
If people believe that Linux is reliable (in terms of phishing, virus, and the like), isn't it a huge security problem?[[User:Mr.K.|Mr.K.]] [[User_talk:Mr.K.|(talk)]] 08:39, 17 September 2008 (UTC)
:Isn't what a huge securtiy problem? - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 09:08, 17 September 2008 (UTC)
::To believe that something is completely secure. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Mr.K.|Mr.K.]] ([[User talk:Mr.K.|talk]] • [[Special:Contributions/Mr.K.|contribs]]) 11:13, 17 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
:::No one believes it to be completely secure; at least those who actually work on it don't. There is constant work upon the security in Linux, as there are in other systems. People only claim it to be somewhat superior to other systems, and you'll find that the people who work with the security are quite aware that there exists no "perfect" reliability. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 11:45, 17 September 2008 (UTC)
:::: An end-user who believes that her/his platform is perfectly secure is the security problem, not the platform itself. The Linux platform is generally more secure because the Linux source code is fortified and because the platform is provided with tools such as [[AppArmor]], [[Clam AntiVirus]], [[Netfilter]], [[Open Source Tripwire]], [[Security-Enhanced Linux]], [[Snort (software)]], just to mention a few. [[User:Rilak|Rilak]] ([[User talk:Rilak|talk]]) 12:26, 17 September 2008 (UTC)
:::::Also, Linux users who think it is completely secure are likely using a standard install which, under most flavors of Linux, includes a built-in firewall and automatic updates. That is ''more'' secure than some other OS that requires the user to somehow know to turn on the firewall and automatic updates. If he or she happened to use Fedora, it installs SELinux by default also. So, in my opinion, the "ignorant" user is more secure using Linux than Windows. Of course, it is harder to find ignorant Linux users than ignorant Windows users. -- [[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:59, 17 September 2008 (UTC)
::::::Except that Windows Firewall and Automatic Updates are indeed on by default, and the user is required to have less knowledge of the ins and outs of increasing privelleges of applications so there is less chance of user fault causing bad security. Either way, software inheriting privelleges is bad so none of them are very secure. - [[User:Jimmi Hugh|Jimmi Hugh]] ([[User talk:Jimmi Hugh|talk]]) 13:06, 17 September 2008 (UTC)
::::::Does Linux have [[Windows File Protection|File Protection]]? Since you seem to be a complete noob when it comes to Windows, I'll tell you what it is. WFP automatically detects if system files have been tampered with and replaces them instantaneously with new ones. Also, does iptables include outbound protection? You see, Windows' newest firewall prevents viruses from phoning home. Vista also includes an anti-spyware scanner (Windows Defender) enabled ''by default''. There's also black-hole router detection, [[address space layout randomization]], [[network access protection]], and so on; and so on. It seems that the Linux strategy for virus prevention is simply not supporting 99% of the programs on the net. Hey--that's not sophistication...--[[User:Tree 'uns 5|Tree 'uns 5]] ([[User talk:Tree 'uns 5|talk]]) 14:44, 17 September 2008 (UTC)
:::::::Back around 1995, I was running [[Tripwire (software)|Tripwire]] on Linux, with the statically-linked tripwire executable and the tripwire DB stored on a write-protected floppy disk (later CD-R). If you think change detection on critical files is some new technology, I have to wonder why you're calling other people "noob". -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 15:49, 17 September 2008 (UTC)
::::::::I actually don't use Linux. It's too primitive. I was talking about Windows when I used the word ''noob,'' anyway. So learn to read before you put words in my mouth. I actually could go on indefinitely by listing all of the security features Windows has that Linux does not. That was just one that you chose to discuss. Speaking of Tripwire, does it come installed by default or do you have to redesign your system to get it to work? It seems like you have to do that a lot to get things to work in Linux.--[[User:Tree 'uns 5|Tree 'uns 5]] ([[User talk:Tree 'uns 5|talk]]) 16:11, 17 September 2008 (UTC)
:::::::::Tree 'uns 5... To answer your myriad of questions... Yes. Most flavors of Linux (the popular ones) protect the filesystem, devices, and network access. I assume you don't care about the details. -- [[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|™]] 01:43, 18 September 2008 (UTC)
:::::::::: @Tree: <code>$IPT -P OUTPUT DROP</code> Oh my, whats this? Is Netfilter now blocking outgoing connections? No it can't be! Btw, Netfilter is the firewall, iptables is the program that configures it. [[User:Rilak|Rilak]] ([[User talk:Rilak|talk]]) 07:53, 18 September 2008 (UTC)
: Linux users justifiably feel themselves to be safe from viruses and malware. I've been using multiple unprotected Linux machines on open Internet connections for ALL of my work for 11 years - and I have never had a single intrusion of any kind whatever. I don't have virus checking software and I don't take any special precautions beyond what the distributions provide by default.
: There are many reasons for this wonderful situation - but in practical terms, casual home users and small office setups can simply ignore malware issues when using Linux. Open any attachments you like - visit any website you like - no worries.
: HOWEVER: Linux doesn't prevent "social engineering" attacks like phishing (where you're tricked to entering sensitive data into the bad guy's computer) - and it can't stop junk mail, nigerian scams, etc. If someone phones you up claiming to be from Homeland Security or from your ISP and asks for your password so they can "test the line" or something - then if you are stupid enough to tell them, you'll get just as hacked with Linux as you would with Windows...so you can't completely ignore security issues.
: In large commercial sites, it is important to be on guard and to keep up to date with the latest patches, etc - because Linux ISN'T 100% secure and a determined hacker could get in if he were sufficiently motivated. However, for a home or small office user - it's unlikely that anyone would be that determined...and if they were, there is probably no way for an occasional user to protect themselves - keeping up with the latest issues is a full-time job! In large organisations, the "social engineering" attack is by far the easiest - and disgruntled IT workers are a serious risk.
: [[User:SteveBaker|SteveBaker]] ([[User talk:SteveBaker|talk]]) 13:58, 17 September 2008 (UTC)
:People who believe that choosing the "best" software removes absolves them of the responsibility to think while using it... will always be getting themselves into trouble. The important differences between GNU/Linux and MSWin are cultural, not technical. One culture distrusts programs without source code from unknown authors; the other eagerly runs whatever it can. So to answer the original question: yes, complacency is the biggest security problem of all. --[[User:tcsetattr|tcsetattr]] ([[User talk:tcsetattr|talk]] / [[Special:Contributions/tcsetattr|contribs]]) 20:17, 17 September 2008 (UTC)
== Excel 2007 and formatted values ==
I have a cell, A, that has the actual value of 4.556 but is formatted to read "£4.56".
I have a cell, B, that has the actual value of 4 and is formatted to read "4".
A * B = C which has an actual value of 18.224 but is formatted to read "£18.22".
As you can see, when formatted as a currency value, the amount in the cell is rounded up / down to a set digit for displaying. My displayed cells A and B, when calculated on face value (how they are displayed) will calculate to 4 * 4.56 = 18.24; however the actual value displayed in C is 18.22 because the calculation is being done underneath.
I want cell C to show the product of the displayed values of A and B - that is, 4 * 4.56, not 4 * 4.556 so that the sheet looks consistent. Any help? [[Special:Contributions/81.187.252.174|81.187.252.174]] ([[User talk:81.187.252.174|talk]]) 12:43, 17 September 2008 (UTC)
:''C=round(A;2)*B''. Note, however, that having the sheet "look consistent" is normally not desired - I for one would prefer to maximize precision. [[User:Jørgen|Jørgen]] ([[User talk:Jørgen|talk]]) 12:55, 17 September 2008 (UTC)
::Select the cell(s) with currency. Go to Format / Cell / Currency, and set the number of decimal places you want. --- [[User:OtherDave|OtherDave]] ([[User talk:OtherDave|talk]]) 14:44, 17 September 2008 (UTC)
== windows jingles ==
is there anyway to turn off those stupid jingles that windows XP plays on being turned on/off; or change their volumes? thanks <span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/92.16.148.143|92.16.148.143]] ([[User talk:92.16.148.143|talk]]) 17:00, 17 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:Start→Settings→Control Panel→Sounds and Audio Devices→"Sounds" tab. There, either set the "sound scheme" to "No sounds" to get rid of all sounds, or set the "Exit Windows" and "Start Windows" program events to "(None)".—[[User:Ezhiki|Ëzhiki (Igels Hérissonovich Ïzhakoff-Amursky)]] • ([[User talk:Ezhiki|yo?]]); 17:11, 17 September 2008 (UTC)
== windows xp ==
why does windows xp have norton ? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Ourhero in doom2|Ourhero in doom2]] ([[User talk:Ourhero in doom2|talk]] • [[Special:Contributions/Ourhero in doom2|contribs]]) 18:24, 17 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
:It doesn't. Standard Windows XP does not come with any Norton Product. However, the Windows XP that comes when you buy a PC often does, because Norton pays money to Dell, HP or whoever to include it. This is called a software bundle (or, more accurately, [[crapware]]) [[Special:Contributions/195.58.125.39|195.58.125.39]] ([[User talk:195.58.125.39|talk]]) 18:39, 17 September 2008 (UTC)
== Using a Bluetooth headset as output for windows media player ==
Hi all,
another WM6-related question: I bought me some shiny BT headset and it works well, at least with phone calls. But Windows Media player and other programs still output sound through speaker/wired headset output, so I am forced to wear wired headset if I don't want to disturb a whole metro with awful metal music.
How do I force that the headset (if in-range) is used as primary sound output?
Thanks,[[User:HardDisk|HardDisk]] ([[User talk:HardDisk|talk]]) 19:24, 17 September 2008 (UTC)
:If you are using XP, then ther's a guide [http://www.windowsdevcenter.com/pub/a/windows/2005/07/05/bluetooth.html?page=4 here]. [[User:Fribbler|Fribbler]] ([[User talk:Fribbler|talk]]) 16:17, 18 September 2008 (UTC)
== iTunes album splitting problem ==
I'm having a problem where a single given album is being registered as multiple albums in iTunes. For example: track 1, track 2-10, and track 11 of ''[[Year of the Rabbit]]'' are being shown as three different (but the same) albums in cover flow view. Artist, album, track #s, etc. are all consistent, so the problem doesn't appear to be with labeling, so I can't figure out the problem.--[[User:SquareOuroboros|SquareOuroboros]] ([[User talk:SquareOuroboros|talk]]) 19:33, 17 September 2008 (UTC)
:Select all the tracks, edit info for them and retype the "Album Artist" - this will sort them correctly [[User:Lewiseason|Lewiseason]] ([[User talk:Lewiseason|talk]]) 20:04, 17 September 2008 (UTC)
:::The album artist thing seemed to fix things. What's supposed to be the difference between the artist and album artist fields? I'm still confused on that point.--[[User:SquareOuroboros|SquareOuroboros]] ([[User talk:SquareOuroboros|talk]]) 22:23, 17 September 2008 (UTC)
::::Many albums don't have a single author, while most songs will be listed as the artist being "Dr. Cool-Aid", others will be "Dr. Cool-Aid feat. The Huxtable Kid" (or something, I'm making artists up). These will be interpreted as different albums, unless the Album Artist is set. [[Special:Contributions/90.235.13.101|90.235.13.101]] ([[User talk:90.235.13.101|talk]]) 00:56, 18 September 2008 (UTC)
::maybe the sorting field wrecks you, remove it individually for each track. sorting sucks. [[User:HardDisk|HardDisk]] ([[User talk:HardDisk|talk]]) 20:28, 17 September 2008 (UTC)
== AcroRd32Info.exe ==
I have major problems with Adobe's AcroRd32Info.exe application. Almost every time I try to rename, move or delete a PDF file, the application I use (most commonly Windows Explorer, but, of course, for instance any application able to show file dialogs (open/save) can also be used) stops responding, until I use the task manager to kill AcroRd32Info.exe. Is there any known solution? --[[User:Andreas Rejbrand|Andreas Rejbrand]] ([[User talk:Andreas Rejbrand|talk]]) 20:09, 17 September 2008 (UTC)
:Warning, non-neutral POV ahead - Uninstall the Adobe [[bloatware]] and install [[Foxit Reader]] instead. --[[User:LarryMac|<font color="#3EA99F">LarryMac</font>]][[User talk:LarryMac|<font color="#3EA99F"><small> | Talk</small></font>]] 20:14, 17 September 2008 (UTC)
::Ditto. [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 20:31, 17 September 2008 (UTC)
:Whilst I agree with the above comments, if you want/need to continue using Acrobat, I recommend you uninstall your version of Acrobat Reader, download the latest version from Adobe's website, and reinstall. It sounds like a part of Acrobat Reader (possibly the explorer plugin) has somehow gotten messed up, the best way to fix it is to reinstall Acrobat Reader. — [[User:QuantumEleven|Quantum]]<i>[[User_talk:QuantumEleven|Eleven]]</i> 12:48, 18 September 2008 (UTC)
== Upgrading MS Office on a new PC ==
My current Dell PC came with MS Office xp installed, and I have the reinstallation disks. I recently ordered a new computer without Office. I will no longer use my old PC after I get the new one. What I want to do is just buy the Office 2007 Upgrade, for my new PC and use my old Office xp disks to show it that I already have a liscenced copy. Will I be able to do this? [[User:Ike9898|ike9898]] ([[User talk:Ike9898|talk]]) 20:51, 17 September 2008 (UTC)
:Quoting to Microsoft.com<sup>[http://office.microsoft.com/en-us/products/FX101754511033.aspx here]</sup>, it seems you will have little advantage in upgrading vs buying anew if you plan to spend USD 240 or less. Might I suggest using [[OpenOffice.org]] or at least giving it a try?
:Oops, forgot to sign. [[User:Kushal one|Kushal]] ([[User talk:Kushal one|talk]]) 01:47, 18 September 2008 (UTC)
::I need Office 2007 Professional; according to your link the upgrade is $160 less than the full version. Anyone know the answer to my original question? [[User:Ike9898|ike9898]] ([[User talk:Ike9898|talk]]) 10:41, 18 September 2008 (UTC)
== Are zipfile passwords effective anymore? ==
I keep some personal private information encrypted in zipfiles with a password. But since there is software available to "crack" zipfile passwords, can I be confident that my password-protected zipfiles are secure, or could a curious teenager open them after a few minutes or longer? In other words, are password protected zipfiles sufficiently difficult to open that a teenager is unlikely to succeed, or is the security just illusionary? Thanks [[Special:Contributions/78.149.194.247|78.149.194.247]] ([[User talk:78.149.194.247|talk]]) 23:42, 17 September 2008 (UTC)
:From what I can tell it depends on what software you've used to encrypt it with. If you use newer versions of WinZip with an [[Advanced Encryption Standard]] encryption then they should not be vulnerable to any sort of simple attack. The original encryption algorithm of PKZIP, etc., was very poor and is very vulnerable. So if you are worried about it, I'd get a new version of WinZip and re-encrypt the files with AES. Keep in mind that short and simple passwords are very vulnerable to simple brute-force methods, whereas odd passwords (e.g. mixing of alpha-numeric characters) or pass phrases are much less vulnerable. --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 00:34, 18 September 2008 (UTC)
::You can also use other programs to do encryption on any file. If you package a zip-file in a [[TrueCrypt]] container, you wont have to worry a lick about WinZips dodgy encryption-scheme [[Special:Contributions/90.235.13.101|90.235.13.101]] ([[User talk:90.235.13.101|talk]]) 00:58, 18 September 2008 (UTC)
:::Honestly, TrueCrypt is probably your best bet. Just be sure you don't couple that with a weak key, or someone will be able to get through it by guessing (ie. a dictionary attack). A sufficiently strong key with TrueCrypt is not feasibly breakable. For that matter, WinZip's new encyrption should be secure as well, if it actually implements AES properly. I'd still go for TrueCrypt though, as it's free, open-source, and works on OSX and Linux as well as Windows. Plus it has far more nifty options, like hidden volumes and full drive encryption and stuff. [[Special:Contributions/24.76.161.28|24.76.161.28]] ([[User talk:24.76.161.28|talk]]) 05:30, 18 September 2008 (UTC)
::::I think you mean a weak [[passphrase]]; [[weak key]] has a different meaning. As far as I know the AES encryption in WinZip (which is [http://www.winzip.com/aes_info.htm publicly documented]) is fine. I don't know how widely it's supported, and it only encrypts the file contents, not the file name, if you care about that. TrueCrypt is fine too, of course. You can also get a TrueCrypt-like effect by putting your file(s) in an ordinary zip archive and then putting that archive in a second, encrypted archive. Whatever's most convenient. -- [[User:BenRG|BenRG]] ([[User talk:BenRG|talk]]) 11:42, 18 September 2008 (UTC)
== Multiple classes ==
In what programming languages, if any, can an object belong to two classes at once when these classes do not share a subclass? [[User:NeonMerlin|<span style="background:#000;color:red;border:#0f0 solid;border-width:1px 0">Neon</span>]][[User talk:NeonMerlin|<span style="background:#0f0;color:#000;border:red solid;border-width:1px 0">Merlin</span>]] 23:44, 17 September 2008 (UTC)
:See [[type polymorphism]]. In languages such as PHP, an instance may be referred to as one type of object, then another unrelated one. This is because memory is reserved as necessary during runtime, not calculated during compile. So, the instance is very flexible and can be morphed into many different classes as necessary (and cause terrible runtime problems unexpected by the programmer). -- [[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|™]] 00:01, 18 September 2008 (UTC)
::Hey Kainaw, can you give an example of this please? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/194.223.156.1|194.223.156.1]] ([[User talk:194.223.156.1|talk]]) 12:58, 18 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:Also, [[multiple inheritance]]? --[[Special:Contributions/71.147.13.131|71.147.13.131]] ([[User talk:71.147.13.131|talk]]) 06:38, 18 September 2008 (UTC)
:Also multiple [[interface inheritance]] leads to objects being of multiple types. [[User:Equendil|Equendil]] <small>[[User talk:Equendil|''Talk'']]</small> 08:17, 18 September 2008 (UTC)
:As a general rule, any language that implements [[duck typing]] fits your criteria, because "class hierarchy" isn't well-defined in such a language. --[[User:Carnildo|Carnildo]] ([[User talk:Carnildo|talk]]) 19:01, 18 September 2008 (UTC)
= September 18 =
== Help ==
How do I clear away the cache of EVERY PAGE THAT I HAVE VISITED on the Internet? Because "Clear History" does not work. And sometimes, when I view pages on Wikipedia under which I am logged in, I still look like I'm logged in next time I use the page even when I'm not logged in. I am taking a Wikibreak and I want my ENTIRE Wikipedia cache cleared away so I don't look like I'm logged in on any page, and I also don't want my account to be hacked (or used abusively by anyone who is likely to abuse it when I'm using the toilet or sleeping over at a friend's house). [[User:February 15, 2009|February 15, 2009]] ([[User talk:February 15, 2009|talk]]) 06:37, 18 September 2008 (UTC)
:This is browser-dependent. On Firefox you want tools/clear private data. [[User talk:Algebraist|Algebraist]] 11:06, 18 September 2008 (UTC)
::To clear the cache in IE click "Delete Files" in the Temporary Internet Files section [[User:Jessica Thunderbolt|<span style="color:red">'''Jessica'''</span>]][[User talk:Jessica Thunderbolt|<span style="background-color:black;"><span style="color:yellow">Thunderbolt</span></span>]] 16:05, 18 September 2008 (UTC)
:::[[Wikipedia:Bypass your cache|Wikipedia:Bypass your cache]] -[[User:Google Spider|Abhishek]]<sup>[[User talk:Google Spider|Talk]]</sup> 17:09, 18 September 2008 (UTC)
:The still-logged-in part is "cookies". [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 17:44, 18 September 2008 (UTC)
::Try [[CCleaner]]. --—<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 18:51, 18 September 2008 (UTC)
== Security of email password ==
I want to know how secure those free email accounts (hotmail, google, yahoo) are. Can they be cracked with brute force? Should the user do something wrong to loose his password? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Mr.K.|Mr.K.]] ([[User talk:Mr.K.|talk]] • [[Special:Contributions/Mr.K.|contribs]]) 09:44, 18 September 2008 (UTC)</span><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
:My own rule of thumb is that the first three passwords you think of are no good. [http://www.microsoft.com/protect/yourself/password/create.mspx Here] are some suggestions for creating a strong password (including: make them longer; use letters, numbers, and symbols; avoid simple substitution (like zero for the letter O). And of course you can look at [[Strong password#Examples_that_follow_guidelines|the examples]] in the strong password article here. --- [[User:OtherDave|OtherDave]] ([[User talk:OtherDave|talk]])
::* Don't get [[Phishing|phished]]. That's how most passwords are snooped.{{fact}} Brute force is much difficult because websites have [[CAPTCHA|captchas]].
::* Don't use easily guessable passwords.
::* If possible, don't use public computers, they might be [[Keystroke logging|logging your keystrokes]]. I always carry [[Live USB|Linux on a pendrive]] to use on public computers. -[[User:Google Spider|Abhishek]]<sup>[[User talk:Google Spider|Talk]]</sup> 17:28, 18 September 2008 (UTC)
::** But that's useless against hardware keyloggers. --[[Special:Contributions/164.67.154.173|164.67.154.173]] ([[User talk:164.67.154.173|talk]]) 22:43, 18 September 2008 (UTC)
:::*Yeah...-[[User:Google Spider|Abhishek]]<sup>[[User talk:Google Spider|Talk]]</sup> 13:04, 19 September 2008 (UTC)
Brute force relies on you using short and common passwords. Using longer passwords that aren't dictionary words helps a lot. If the service supports it, use a pass phrase (a full sentence)—they are by far more secure (even if someone found a hashed table of all of the passwords for the service, they'd have a hard time brute forcing it). Unfortunately many current web services don't let you use pass phrases (Google does, bless them). --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 13:41, 19 September 2008 (UTC)
== Looking for a right-click upload to ftp server ==
Under XP, I'm looking for a program that will let me right-click to upload to a ftp server. The catch-- I want the file's local folder to determine what remote folder to upload to. So, if I have a folder called c:\htdocs\foobar\, I want all the files in that folder to upload to /public/foobar/ on the remote server.
In essence, I want to do one-way sync on a file-by-file basis, ideally accessible from within Windows Explorer.
Does anyone know of a good tool for such a thing? --[[User:Alecmconroy|Alecmconroy]] ([[User talk:Alecmconroy|talk]]) 10:34, 18 September 2008 (UTC)
:That sounds handy. You should be able to do that with a batch file and stick a shortcut in "SendTo". Drawback is that your username and passwd would have to be in the batch file. [[User:Saintrain|Saintrain]] ([[User talk:Saintrain|talk]]) 17:40, 18 September 2008 (UTC)
::Use [[http://www.snapfiles.com/get/sendtoftp.html SendTo FTP]] --—<i><b>— [[User:Gadget850|<font color = "gray">Gadget850 (Ed)</font>]]<font color = "darkblue"> <sup>[[User talk:Gadget850|''talk'']]</sup></font></b> - </i> 18:49, 18 September 2008 (UTC)
== Boot Ferrari 4000 from USB? ==
Can I boot my Acer Ferrari 4000 from a USB flash drive? [[User:NeonMerlin|<span style="background:#000;color:red;border:#0f0 solid;border-width:1px 0">Neon</span>]][[User talk:NeonMerlin|<span style="background:#0f0;color:#000;border:red solid;border-width:1px 0">Merlin</span>]] 14:45, 18 September 2008 (UTC)
:If it has a USB port, you should be able to boot by starting the computer and immediately pressing F8. It will get you to a screen from where you can select the device to boot from. If F8 doesn't work or produces a different result, try other function keys nearby. [[User:Admiral Norton|Admiral Norton]] <sup>([[User talk:Admiral Norton|talk]])</sup> 17:34, 18 September 2008 (UTC)
== simple OO question ==
I have a "Car" class that has a "Driver" member. I call theCar.theDriver.Drive() ... how can I see the other members of Car (like speed and position) from within theDriver.Drive()? Thanks! <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/76.106.15.180|76.106.15.180]] ([[User talk:76.106.15.180|talk]]) 15:55, 18 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:You need to either pass the car in as a parameter to Drive() or have the Driver save a reference to the car as a parameter to his [[constructor]]. --[[User:TotoBaggins|Sean]] 16:10, 18 September 2008 (UTC)
== programs at start up ==
how do i keep programs from automatically running when i restart my computer? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/98.150.20.248|98.150.20.248]] ([[User talk:98.150.20.248|talk]]) 16:08, 18 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
: I believe it is msconfig. Go to start/run msconfig, or with vista search for msconfig. and it will let you click the program. Some programs are stubborn, and this method doesn't work. This method works 90% of the time. [[User:Sentriclecub|Sentriclecub]] ([[User talk:Sentriclecub|talk]]) 16:26, 18 September 2008 (UTC)
: There's a very similar question above; see [[#Processes_on_start_up]]. -- [[User:Coneslayer|Coneslayer]] ([[User talk:Coneslayer|talk]]) 13:46, 19 September 2008 (UTC)
==HP LaserJet 3500n==
Hello. I cannot print to my LAN printer, but my assistant can. We're both connected to it in the same way. I can see the printer, but documents I send there just wait in the queue. Any suggestions would be welcome. [[Special:Contributions/216.49.181.128|216.49.181.128]] ([[User talk:216.49.181.128|talk]]) 18:20, 18 September 2008 (UTC)
{{resolved}} Got it. Had to change the name of the port. [[Special:Contributions/216.49.181.128|216.49.181.128]] ([[User talk:216.49.181.128|talk]]) 18:45, 18 September 2008 (UTC)
= September 19 =
==YouTube==
1. On my computer, Youtube videos load very slowly. It can sometimes take an hour for a whole video to be playable. How can I fix this?
2. What is the highest number of videos that one Youtube user has and who is that user?
[[User:February 15, 2009|February 15, 2009]] ([[User talk:February 15, 2009|talk]]) 03:00, 19 September 2008 (UTC)
:As for 1, what sort of internet connection do you have? Who's your [[ISP]]? If you simply have a slow connection, there's no way to speed it up. As for 2, I have no idea how you'd find that out, sorry. --[[User:Alinnisawest|Alinnisawest]],<sup>[[Special:Contributions/Alinnisawest|<font color="black">'''Dalek Empress'''</font>]]</sup> ([[User talk:Alinnisawest|<font color="#cf0021">'''extermination requests here]]'''</font>) 04:04, 19 September 2008 (UTC)
==MS Access Database Issue==
I have a database table with a field with around 800 records. The vast majority are null/empty (aroun 600) and the rest have a value. For some reason when filtering by 'null' only 47 of the records retrun when it should be 600. I have checked and these fields are definitely empty (i.e. no value, no spaces, no nothing). I've even done update-queries that add a value to each of the blank cells. Then I filter by that value and they all appear. I then find/replace said value with nothing and...back to the same issue. Any ideas what could be causing this? [[Special:Contributions/194.221.133.226|194.221.133.226]] ([[User talk:194.221.133.226|talk]]) 11:31, 19 September 2008 (UTC)
:Null and an empty string ("") aren't the same thing. Instead of doing <tt>SELECT * FROM myTable WHERE myField=NULL</tt> try <tt>SELECT * FROM myTable WHERE myField=NULL OR myField=""</tt>. If that doesn't work, try <tt>SELECT * FROM myTable WHERE Nz(myField,"")=""</tt> (which is similar but a bit slower since it uses an extra function). --[[Special:Contributions/98.217.8.46|98.217.8.46]] ([[User talk:98.217.8.46|talk]]) 13:38, 19 September 2008 (UTC)
== Overhead cost of get and set methods ==
In C++, C# and Java, if a class variable has the simplest possible get and set methods, how much slower will they run than if the underlying variable were public and other classes accessed it directly? Will compiler optimizations make any difference to this? [[User:NeonMerlin|<span style="background:#000;color:red;border:#0f0 solid;border-width:1px 0">Neon</span>]][[User talk:NeonMerlin|<span style="background:#0f0;color:#000;border:red solid;border-width:1px 0">Merlin</span>]] 14:16, 19 September 2008 (UTC)
:Without optimization, overhead can be considerable compared to just setting the variable, basically:
:*return address stacked
:*address of the method to call fetched (direct call possible in C++ if not virtual)
:*address of the object and parameter stacked
:*method called
:*address of the object and parameter popped out of the stack
:*object's variable set with parameter
:*return to caller from address on the stack
:Now that's naïve compilation, any decent compiler will just have the variable set and be done with it. Anyhow, don't hand-optimize before you know you have a bottleneck, and preferably use optimization hints (such as "inline" in C++) if it comes to that. [[User:Equendil|Equendil]] <small>[[User talk:Equendil|''Talk'']]</small> 15:00, 19 September 2008 (UTC)
==C++ compiler==
Hey , I want to learn C++.But to practise it ,what compiler or language interpreter is to be needed for my windows.what about Turbo C++ Explorer?Any suggestions please.Cheers <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/137.101.129.155|137.101.129.155]] ([[User talk:137.101.129.155|talk]]) 16:18, 19 September 2008 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
| 