User talk:Qwertyus/archive1

Welcome

Welcome!

Hello, and welcome to Wikipedia. Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

• How to edit a page
• Editing, policy, conduct, and structure tutorial
• Picture tutorial
• How to write a great article
• Naming conventions
• Manual of Style
• If you're ready for the complete list of Wikipedia documentation, there's also Wikipedia:Topical index.

I hope you enjoy editing here and being a Wikipedian! By the way, you can sign your name on Talk and vote pages using three tildes, like this: ~~~. Four tildes (~~~~) produces your name and the current date. If you have any questions, see the help pages, add a question to the village pump or ask me on my Talk page. Again, welcome! Oleg Alexandrov 21:57, 30 Apr 2005 (UTC)

Thanks

Thanks for helping with SWI-Prolog. --Pavel Vozenilek 22:21, 29 July 2005 (UTC)

Cons

Nice job on the cons article. --maru (talk) Contribs 18:19, 6 January 2006 (UTC)

Make and NMAKE.

I don't know if it's fair to say that NMAKE is a variant of the traditional tool, given that it has no shared lineage, just some of the same syntax, which is covered by the list much later in the article. What are your thoughts on that? --juli. ^{t ?} 02:15, 27 February 2006 (UTC)

Well, BSD make (pmake) and GNU make share no code with Unix make, so there's no "shared lineage" there either. I must admit I've never used NMAKE. If you think it belongs in the "Similar Tools" section, feel free to move it there. Qwertyus 14:41, 28 February 2006 (UTC)

I mean lineage in a more general sense than code. Both of them were written with the old Make in mind. They have more in common than NMAKE does with any of the three (BSD, GNU and the PWB make). I'll leave it for now. I'm not entirely sure what the most correct thing is. --juli. ^{t ?} 09:50, 1 March 2006 (UTC)

Nmake (I hope you are talking about the program from David Korn) is very different from a traditional UNIX make as nmake implements something very similar to what you get from the schily makefilesystem + smake/Sunmake/gmake in native code. Both systems allow you to mention just a list of files and the system knows how to compile. --Schily (talk) 21:59, 10 July 2011 (UTC)

Moving pages

Hi Qwertyus. When you move a page as you did with The Dream, could you please check the What links here and fix the incoming links - especially if you overwrite the redirect with either a different article or a disambiguation page? I have fixed most of the incoming links to that page now, so this is just a request for a next time. Thanks. --Scott Davis ^Talk 14:05, 12 April 2006 (UTC)

Sorry, I was a bit lazy. Thanks for doing it for me. Qwertyus 14:12, 12 April 2006 (UTC)

Caldera

Hi. Last edit I didn't agree with I left a message on Talk:Caldera OpenLinux

Formula for primes

Please see the Talk page, where another editor has removed your formula for primes. I tested it, and it seemed to work, but we both agree that a source would be good for the information. My quick check of the web didn't provide any results, and I was hoping you had a source to use. Actually it doesn't seem too hard to prove, but I think wikipedia's policy on original research would disqualify that. So, how 'bout it? Care to dig up the 'ol number theory books?

I didn't add that formula, User:Henrygb moved it from prime number, where it was added by User:LC; see [1]. Qwertyus 23:29, 14 May 2006 (UTC)

Also, as an aside: which BSD? And, how old is too old for new languages? I've heard that after ~12yrs old (I assume to be peuberty related) new languages are processed in a different area of the brain compared to the primary language. Is there any truth to that? — vijay 22:31, 14 May 2006 (UTC)

Currently FreeBSD, formerly OpenBSD.

I'm not a psycho- or neurolinguist, and can't really comment on the brain area thing. However, it is commonly acknowledged that, after puberty, it is impossible to learn a new language at native speaker level. Qwertyus 23:29, 14 May 2006 (UTC)

Spam

Hi Qwertyus - you deleted something that I entered as spam which I don't believe it is. How can I contact you to discuss this?

Let's discuss it here. The site looks very commercial to me. Does it have enough educational/referential value to be included in an encyclopedia? Qwertyus 23:49, 16 May 2006 (UTC)

Thanks for your reply Qwertyus. The site is semi-commercial - it's a hobbyist site which covers its operational costs through AdSense. The site currently hosts 39 articles written and researched by myself. I write applications to support or refute market strategies, theories, and myths in an attempt to clarify popular market sayings etc. The formulae, data, spreadsheets etc. are usually made available in the articles and research so that they can be verfied, criticised and audited. The 2 calculators that are on the site are used daily (weekdays) by hundreds of traders. The calculator that I linked to the Fibonacci numbers is, I believe, a good example of how Fibonacci numbers are used every day in one industry (day trading). One of the objectives of wikipedia (I believe) is to educate the users in the subject at hand. It is my impression that a reader would benefit from seeing how day traders use fibonacci numbers and this page provides a calculator that they can plug numbers into and click calculate to see how it is done. A bit like a hands on exhibit at a museum where children can touch and try out science to gain a better understanding of it.

Vandalism

Please do not remove content from Wikipedia; it is considered vandalism. If you want to experiment, please use the sandbox. Thank you. —The preceding unsigned comment was added by Thecrisis5 (talk • contribs).

Can i ask you what your problem with my article is exactly? This is thecrisis5. Its simply a school of marxism, if you want to nit pick a bunch of articles theres a plethera on this site that are completly irrelevent an ill thought out. Numerous people have edited my article without requesting its deletion, that is competly redicilous. What made you decide to want to delete my article? It is gramtically correct, and does not say whether the ideas are correct. I tried to add the flaws with it, and you deleted it. So what do you want me to do?

I've already tried explain what's wrong several times, and I'm not talking to you until a mediator has looked into the issue. Qwertyus 00:20, 22 June 2006 (UTC)

Doesnt matter

I want the article deleted. Ill just start from scratch and give it a new title. You can nominate it for deletion, that would be helpful. Later. --Zhukov 02:35, 22 June 2006 (UTC) (thecrisis5)

Mediation for article Revolutionary Socialism

Are you satisfied with the outcome of the case? It didn't really require any mediation since the article was nominated for deletion by the main author, Thecrisis5. Can I close this case? Lewispb 23:40, 24 June 2006 (UTC)

Yes, sorry about the hassle! Qwertyus 01:00, 25 June 2006 (UTC)

Normal form (term rewriting)

Hi Qwertyus -- I reapplied the change to normal form (term rewriting) that you had made and that was reverted, and explained the reason at Talk:Normal form (term rewriting). Joriki 03:41, 8 July 2006 (UTC)

List of people by name Taylo move

_ _ Thanks for your move of List of people by name: Taylo. It was certainly not a bad or stupid idea, and i'm unwilling to even call it a bad edit, bcz it was superficially an excellent idea and was thorougly in the spirit of WP:BOLD. But (as you've no doubt guessed from that prelude) the result is bad, in leaving no place for the surname Taylo nor for surnames starting Tayloa - Tayloq or Taylos - Tayloz,

1. most clearly because Taylo, mentioned in

   Half Life Half Death and, as middle name, in Wikipedia:MacTutor archive/3

   and Tayloe (abt a half thousand in 1990 US census) with

   75 of about 107 from en.wiki.x.io for tayloe

   turn out to be a real surnames,

2. possibly bcz readers may look up here Lily Taylos at IMDb (even tho i suspect she is Lily Taylor at IMDb and maybe even Lily Taylor at IMDb; i also doubt she's notable), and
3. in any case bcz we're never going to be sure we know all the surnames that belong to at least one notable person.
   

_ _ I'm going to leave it moved (for different reasons than the ones i infer you had in mind) and install the established redirect-free apparatus for moving a page down in the LoPbN hierarchy (which is what you did), and the changes that will involve may be of interest to you. (One factor that may not be obvious is that a demonstrable amount of chaos results when editors (new or not) add names that don't yet have a proper page to include them, and we can only guess how many names just don't get added by editors who refuse to put them on a clearly wrong page.)
--Jerzy•t 20:35, 23 October 2006 (UTC)

Wu Ming

Hi Qwertyus. You recently contributed to the article Wu Ming. Wu Ming published Hatchets of War (with Vitaliano Ravagli, 2000) and Hatchets of War 2.0 (with Vitaliano Ravagli, 2005). On page 201 and 202 of Asce Di Guerra, there is an entry for Bologna, 13 May 2000, 6:30 p.m. to 7:45 p.m. relating to Millwall brick. I am writing an article on Millwall brick and it would be a great help if you would translate page 201 and 202 for me as I am in despriate need for information from legimiate references. If you look over the talk page on Millwall brick, you will see what I mean. If you would be so kind, please post the results on my talk page. Thank you. -- Jreferee 04:37, 10 November 2006 (UTC)

Hello!

Hi! Qwerty power! :) NIRVANA2764 20:07, 7 January 2007 (UTC)

Translations

Hello! I've seen that you added the new translation of Foucault's Madness & Civilization. I would be quite interested, if that doesn't bothers you and you add some time for it, if you could tell me which parts were not present in the precedent edition. I've never had imagined that the translation was not complete, and I wonder if some ommissions of it have influenced its reception in the US (this also goes with the order of translation of his books, which didn't respect their original chronological order of publication; hence, Americans had access to the latter stuff first, while lots of French have remained concentrated on the early stuff, and a lot quickly dismiss - wrongly, IMO - the latter stuff as some kind of "individualist hedonism"). Thanks for your time & info, cheers! Tazmaniacs

I'm sorry, I don't own the book. When I saw that the planned date of publication had passed, I just checked my university library catalogue and found out it had been published, so I updated the article. Qwertyus 01:40, 3 March 2007 (UTC)

ps: i see on your page that your Dutch, and that you edited a lot the 1995 strikes in France, thanks for that, it's a major turn in French politics as you known, IMO comparable to Seattle WTO conference on the international level... Tazmaniacs

You're welcome :) Also thanks for the contribution, though I would like a reference for this claim in the article. I didn't find the comparison in the l'Humanité article. Qwertyus 01:40, 3 March 2007 (UTC)

Thank you: Your edit at Levenshtein distance

Thank you for adding the reference to Levenshtein's paper and verifying the year he researched Levenshtein distance. You beat me to finding the same exact reference in my copy of Kruskall and Sangoff. It would be sad to have an article on Levenshtein distance without an attribution to Levenshtein's work! --Ashawley 13:08, 12 April 2007 (UTC)

Agreed. Good job finding the earlier reference. You wouldn't be able to find a copy, would you? The library's only got volumes 4-13 1968-1977. ralian 08:14, 13 April 2007 (UTC)

I'm sorry, but my library only offers the e-journal, starting from vol. 37, 2001. Qwertyus 12:23, 13 April 2007 (UTC)

Monotonic heuristics in A*

I see that you removed the section about monotonic heuristics at A* search algorithm long ago, calling it "inaccurate". There's some uncertainty on the talk page about what heuristic is required when, because it seems everyone either learns A* with monotonicity or without and doesn't learn the other version. Perhaps you can help resolve this. Do you know something about the difference? What was the inaccuracy? rspeer / ɹəədsɹ 03:10, 26 April 2007 (UTC)

Article about X/Open Transport Interface

Hi, would you like to have a look over this article and review. If not just delete this and thanks Alecssicius (talk) 19:56, 25 July 2009 (UTC) !

Fair use rationale for File:Imperiet.jpg

Thanks for uploading or contributing to File:Imperiet.jpg. I notice the file page specifies that the file is being used under fair use but there is not a suitable explanation or rationale as to why each specific use in Wikipedia constitutes fair use. Please go to the file description page and edit it to include a fair use rationale.

If you have uploaded other fair use media, consider checking that you have specified the fair use rationale on those pages too. You can find a list of 'file' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Kelly ^hi! 17:22, 25 December 2010 (UTC)

StepSqlite

Hi Qwertyus, This is about the edit: "{{ad}} (and is this notable?)" on StepSqlite page.

• I have added a reference to Official Oracle Berkeley DB FAQ that points to StepSqlite for running PL/SQL on BDB - hopefully, this should answer the notability question.

• Also added more information about the product by adding a section (Architecture) and external links.

• Made edits to the sentence structure to be less ad-like and more encyclopedic.

Waiting for your response before proceeding to remove the ad tag.

thanks. -- 24.147.45.213

Nomination of Alice (programming language) for deletion

The article Alice (programming language) is being discussed concerning whether it is suitable for inclusion as an article according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Wikipedia:Articles for deletion/Alice (programming language) until a consensus is reached, and anyone is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on good quality evidence, and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. Christopher Monsanto (talk) 18:56, 5 February 2011 (UTC)

Deletion discussion about Scikit-learn

Hello, Qwertyus, and thanks for contributing to Wikipedia!

I wanted to let you know that some editors are discussing at Wikipedia:Articles for deletion/Scikit-learn whether the article Scikit-learn should be in Wikipedia. I encourage you to comment there if you think the article should be kept in the encyclopedia.

The deletion discussion doesn't mean you did something wrong. In fact, other editors may have useful suggestions on how you can continue editing and improving Scikit-learn, which I encourage you to do. If you have any questions, feel free to ask at the Help Desk.

Thanks again for your contributions! Gaijin42 (talk) 16:00, 5 December 2011 (UTC)

Proposed deletion of Martin Porter

The article Martin Porter has been proposed for deletion because of the following concern:

Notability is not established whatsoever, only verifiability. Anyone can invent things and win awards. It comes down to third-party significant coverage to determine if this article stays.

While all contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the {{proposed deletion/dated}} notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing {{proposed deletion/dated}} will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. 98.28.12.216 (talk) 15:46, 8 February 2012 (UTC)

Hello, Qwertyus. You have new messages at 98.28.12.216's talk page.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

AfD and PROD notifications

Hi Qwertyus,

Back in December, you got either an AfD or PROD notification, which was part of the template testing project's experiments. If you could go here and leave us some feedback about what you think about the new versions of the templates we tested (there are links to the templates), that would be very useful. (You can also email me at mpinchukwikimedia.org if you want.) Thanks! Maryana (WMF) (talk) 22:08, 17 February 2012 (UTC)

talkback

Hello, Qwertyus. You have new messages at Pichpich's talk page.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

redirection of L-BFGS-B

Hi,

I saw that you implemented the redirect of L-BFGS-B: Optimization subject to simple bounds to L-BFGS (after an anonymous contributor suggested it). The L-BFGS-B page was not very good because it didn't describe the method, but I think that is something that should be fixed, rather than re-directing the method to L-BFGS. Despite the similarity in name between L-BFGS and L-BFGS-B, they are very different concepts.

I suggest removing the re-direct and adding a tag to the page requesting expansion. Or, at the very least, add a new section to L-BFGS on the active-set constrained version (i.e. L-BFGS-B) with links to the papers. Regards, Lavaka (talk) 09:34, 16 July 2012 (UTC)

The page about L-BFGS-B did not make the differences clear in any way; every property of the algorithm it discussed also applied to L-BFGS, except for the box constraints, and the howto instructions for users, which are off topic. If you think L-BFGS-B is sufficiently different that it deserves its own article, then you're free to write one that makes it clear why, but currently, I'm tempted to even merge my own stub about OWL-QN into L-BFGS and I think having a subsection about L-BFGS-B in the main article would be more valuable than a separate one (less duplication, less maintenance). Just my 2c. Qwertyus (talk) 21:21, 16 July 2012 (UTC)

I definitely agree that the old L-BFGS-B page was not up to wikipedia standards, and I am not willing to spend the time to fix it right now, so I think the redirect is OK. I'm familiar with OWL-QN, and it's also an active-set method which has seen some attention since 2007, but L-BFGS-B is definitely more "classic" and better known among active-set methods (it's also a little more general, since it handles box constraints; OWL-QN handles the l1 norm, but you can convert this to box-constraints by introducing a slack variable). So based on just popularity, I would think that OWL-QN should have its own page only if L-BFGS-B does. I think a good action for us is to add a section to the L-BFGS page that mentions that L-BFGS has been successfully incorporated into active set methods, and then give brief mention to both L-BFGS-B and OWL-QN (and delete or redirect the L-BFGS-B and OWL-QN pages). I think that gives them the right amount of importance, while still providing useful links for people who want to find their implementations. Lavaka (talk) 07:36, 17 July 2012 (UTC)

Ok. Shall we split the section ["Applications and variations" into "Applications" and "Variants", then put L-BFGS-B and OWL-QN both under Variants? (And btw., since you seem to be more knowledgeable in these matters than I am, is Limited-Memory Variable Metric a synonym for L-BFGS or a broader category of algorithms? I found that term in the literature in several places, but couldn't find it anywhere in the Wikipedia.) Qwertyus (talk) 12:08, 18 July 2012 (UTC)

Yes, that split sounds good. I haven't seen the term "Limited-Memory Variable Metric" in too many places, but I would say that it is a super-class of Limited-Memory Quasi Newton methods (since a quasi-Newton method is a variable metric method, with the additional property that the "metric" that is changing, which is defined by a matrix since this is finite dimensional, must satisfy the "secant equation"). BFGS is a type of quasi-Newton, so Limited-memory BFGS (L-BFGS) is a special type of Limited-Memory Variable Metric. So not quite synonymous. However, among limited-memory methods, L-BFGS is so popular that it is basically the only method widely used, so in that loose sense, it is practically synonymous with limited-memory variable metric. There is research in other variable metric algorithms, but none of it is used so much in practice except for the quasi-Newton and Newton methods, so I think wikipedia has enough info on it, since we have pages for L-BFGS, BFGS and SR1 (SR1 is the other (non-limited memory) quasi-Newton method that is used frequently). Lavaka (talk) 12:52, 18 July 2012 (UTC)

Andrei Markov

Hi Qwertyus. An editor has challenged your move of this article to Andrei Markov (ice hockey player) at the hockey project's talk page. I was hoping you'd come lend your thoughts on if there really is a need for this disambiguation. Thanks! Resolute 13:30, 29 August 2012 (UTC)

Disambiguation link notification for September 12

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Tf–idf, you added a link pointing to the disambiguation page Boolean (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 12:29, 12 September 2012 (UTC)

Partial sorting

Hi Qwertyus. I've posted a question with example on "Partial sorting" talk page. Could you, please, look at that? Thanks. — Preceding unsigned comment added by Mpoleg (talk • contribs) 09:40, 26 October 2012 (UTC)

A page you started has been reviewed!

Thanks for creating Polynomial kernel, Qwertyus!

Wikipedia editor Theopolisme just reviewed your page, and wrote this note for you:

Thanks for the new article, Qwertyus! Great as always. :) —Theopolisme 15:35, 12 November 2012 (UTC)

To reply, leave a comment on Theopolisme's talk page.

Learn more about page curation.

Disambiguation link notification for November 20

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Restricted Boltzmann machine, you added a link pointing to the disambiguation page Partition function (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:15, 20 November 2012 (UTC)

Talkback

Hello, Qwertyus. You have new messages at Walter Görlitz's talk page.
Message added 17:42, 22 November 2012 (UTC). You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

Walter Görlitz (talk) 17:42, 22 November 2012 (UTC)

Ways to improve Stochastic neural analog reinforcement calculator

Hi, I'm Andrewman327. Qwertyus, thanks for creating Stochastic neural analog reinforcement calculator!

I've just tagged the page, using our page curation tools, as having some issues to fix. I just marked Stochastic neural analog reinforcement calculator as reviewed, but I would like to see it expanded.

The tags can be removed by you or another editor once the issues they mention are addressed. If you have questions, you can leave a comment on my talk page. Or, for more editing help, talk to the volunteers at the Teahouse.

Disambiguation link notification for December 21

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Amoeba (operating system), you added links pointing to the disambiguation pages MIPS, Load balancing and Multithreading (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:55, 21 December 2012 (UTC)