User talk:Doctorcherokee

Welcome to the Wikipedia[edit]

Good edit, here are some links I find useful

Feel free to ask me anything the links and talk pages don't answer. You can sign your name by typing 4 tildes, likes this: ~~~~.

Cheers, Sam [Spade] 04:42, 21 May 2004 (UTC)[reply]

Deletion warning[edit]

I've listed Image:Consanguinity chart.jpg for deletion as the png version is much better. Zeimusu | (Talk page) 10:54, 2 Jun 2005 (UTC) A question I asked on May 9, 2006 [1]

TV series -- Reliving High School[edit]

I'm trying to remember the name of a TV series but I cannot. Its premise is the main character (or characters) having the chance to travel back in time and relive high school or something to that effect. I believe it was cancelled soon after it premiered, and it had an interesting title. It aired in the past few years. And it's not Freaks and Geeks or How I Met Your Mother! :) --Doctorcherokee 01:06, 9 May 2006 (UTC)

There were two shows like that in 2002: That Was Then IMDb and Do Over IMDb. --Metropolitan90 02:32, 9 May 2006 (UTC)

Super Greg[edit]

I asked a question on the Ref Desk about a weird 80's European video. You were correct...the character was one of Sacha Baron Cohen's. I finally found it..."Super Greg." Not on Wikipedia currently. Anyway, just wanted to let you know you were right! --Doctorcherokee 12:46, 6 March 2007 (UTC)[reply]

Eh, thanks sorry I wasn't more specific at the time. I just thought that he had a whole bunch of "pseudo-characters" he'd done from time to time, so when you said it looked like him, I figured maybe... --Cody.Pope 00:18, 7 March 2007 (UTC)[reply]

Image:Dennis_Miller.png[edit]

Thanks for uploading Image:Dennis_Miller.png. I notice the 'image' page specifies that the image is being used under fair use, but its use in Wikipedia articles fails our first fair use criterion in that it illustrates a subject for which a freely licensed image could reasonably be found or created that provides substantially the same information. If you believe this image is not replaceable, please:

Go to the image description page and edit it to add {{Replaceable fair use disputed}}, without deleting the original Replaceable fair use template.
On the image discussion page, write the reason why this image is not replaceable at all.

Alternatively, you can also choose to replace the fair use image by finding a freely licensed image of its subject, requesting that the copyright holder release this (or a similar) image under a free license, or by taking a picture of it yourself.

If you have uploaded other fair use media, consider checking that you have specified how these images fully satisfy our fair use criteria. You can find a list of 'image' pages you have edited by clicking on this link. Note that any fair use images which are replaceable by free-licensed alternatives will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. ˉˉ^anetode╦╩ 09:51, 12 March 2007 (UTC)[reply]

Fair use rationale for Image:Baron_samedi.png[edit]

Thanks for uploading or contributing to Image:Baron_samedi.png. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in Wikipedia articles constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use. Suggestions on how to do so can be found here.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Wikipedia:Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

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 'image' 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 "Image" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. MER-C 08:59, 22 July 2007 (UTC)[reply]

United States Carriers' Angled Flight Decks[edit]

A question I asked on October 27, 2007

Does anyone know the first United States Carrier to have an INITIAL built-in angled flight deck? A lot of them were fitted later but I can't seem to find which was the first one to have an angled deck from the beginning.

--Doctorcherokee 01:57, 27 October 2007 (UTC)[reply]

The article Flight deck states that the angled flight deck "was tested on the American aircraft carrier USS Antietam (CVA-36), and subsequently adapted as the SCB-125 upgrade for the Essex class and SCB-110/110A for the Midway class. The design of the Forrestal class was modified immediately upon the success of the Antietam configuration, with Forrestal and Saratoga modified while under construction to incorporate the angled deck." So it looks like USS Forrestal (CV-59), while initially laid down with an axial deck, was the first carrier to be built with an angled deck. USS Ranger (CV-61) was the first built with an angled deck from the keel up. - Eron ^Talk 02:46, 27 October 2007 (UTC)[reply]

Donald Duck "Hair Tonic Get Rich Scheme Comic"[edit]

Hello, there's an old Carl Barks Donald Duck comic (likely 50's or 60's) that involves a get-rich scheme by Donald to buy hair tonic, claim it doesn't work, and then return it for double his money. I think it involves, at one point, someone rubbing it in and he growing hair all over his body. I can't seem to get much info on it. Does anyone know the comic # and year & month? --Doctorcherokee 21:05, 2 December 2007 (UTC)[reply]

I don't know, but the plot sounds almost identical to an I Love Lucy episode where she bought cans of beans with a guarantee "if these aren't the best beans ever, get double your money back". She then returned them, bought twice as many cans with the money, returned them, bought twice as many, etc. I wonder who ripped off whose idea. StuRat 21:57, 2 December 2007 (UTC)[reply]

The story you're referring to was first published in Donald Duck #35 (1954) and was republished in Donald Duck #147 (1973)--SeizureDog 00:03, 3 December 2007 (UTC)[reply]

On a side note, the bean episode StuRat is referring to is "Lucy the Bean Queen" from The Lucy Show, not I Love Lucy, and aired on September 26, 1966. So Donald did the joke over 10 years earlier, though I doubt he was the first.--SeizureDog 00:11, 3 December 2007 (UTC)[reply]

No problem. It wasn't too hard to find out; I just searched for "Donald Duck hair tonic comic" in Yahoo and it came right up.--SeizureDog 10:40, 4 December 2007 (UTC)[reply]

The hair tonic story was untitled originally published inDonald Duck #35 in May of 1954 is not by Carl Barks, it was by the "Other Good Duck Artist" possibly Walt Kelly?-- —Preceding unsigned comment added by 74.197.89.72 (talk) 17:03, 25 December 2007 (UTC)[reply]

Fair use rationale for Image:Vulcannervepinch.jpg[edit]

Thanks for uploading or contributing to Image:Vulcannervepinch.jpg. I notice the image page specifies that the image 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 image 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 'image' 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 "Image" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Ejfetters (talk) 06:34, 16 December 2007 (UTC)[reply]

Join Us[edit]

You are being recruited by the WikiProject Political Parties, Emphasizing consistency, global perspective, and neutrality, the WikiProject aims to create good articles about political parties worldwide. Join us!

--Megapen (talk) 15:09, 19 May 2008 (UTC)[reply]

Care for a gander at global cooling[edit]

I've got a frustrating situation over at global cooling where the global warming crowd are denying that there's anybody currently holding that we're in the lead in for a bout of global cooling. Whether we are or not is beyond me but it's rather obvious from even a cursory google search that some people do believe it so. They don't want to talk about it. They don't want to give any reason for challenging. It's the same old run around of asking for sources for everything including where the sun rises and challenging the sourcing until one gives up. Global Cooling is interesting because it's not structured as entirely a science article but rather a combination science and popular press article. They're denying that the popular press has any articles on it. TMLutas (talk) 01:13, 12 October 2008 (UTC)[reply]

Orphaned non-free image File:Matt Foley, Saturday Night Live.jpg[edit]

⚠

Thanks for uploading File:Matt Foley, Saturday Night Live.jpg. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. 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 images not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. Skier Dude (talk) 02:21, 13 December 2009 (UTC)[reply]

When do you raise the rate on a certificate of deposit if there are unpredictable increases in interest rates?[edit]

A certain online bank has a 4-Year CD that allows you to increase your interest rate if rates go up. Over a CD's term of 4 years, this bank (if the interest rates go up) allows you to raise the rate up to the current rate TWICE over the four year period. For instance, if the rate is locked in at 2% for three years and the bank's 4-year CD rates rise to 2.5% at the end of the third year you can raise your CD's rate to 2.5% for the remainder of the term. You aren't required to raise your rate.

Let's say I get a CD at the interest rate right now. I'm not really expecting interest rates to rise anytime soon, but if they started to rise, what would be a good mathematical way of deciding when was the best time to use those TWO instances that I'm allowed?

I know there's probably not a simple solution, as it depends on many variables (much like the stock market), but is there some sort of mathematical reasoning that would take some of this into account and give me a nonrandom strategy of when to raise the rate? Perhaps a formula that assumes that rates will continue to rise? How about a formula that assumes nothing?

I'm just kind of confused as to the best time to raise the rate if rates start to rise. Sooner rather than later is my thought, but I don't know. Thanks for any help you can give.

173.247.7.89 (talk) 03:41, 23 October 2011 (UTC)[reply]

You need to have some sort of assumptions (there's work on how to minimize the so-called "weak regret" in multi-armed bandit problems with essentially no assumptions at all, but I don't think that applies here). Once you figure out the assumptions you want to make, describing the solution mathematically is straightforward, though actually finding the optimal solution could be very difficult.

Let's get warmed up with a simple case. The problem is continuous; you can change the rate at any time; the bank's interest rate is deterministic, and is known to increase linearly from

r_{0}

at the start to

r_{e}

after n years. I will use the continuous interest rate; the annual rate is

(\exp(r)-1)\cdot 100\%

. If you switch at

n_{1}

and

n_{2}

, then at the end you'll multiply your investment by

\exp \left(n_{1}r_{0}+(n_{2}-n_{1})(r_{0}+(r_{e}-r_{0})n_{1}/n)+(n_{e}-n_{2})(r_{0}+(r_{e}-r_{0})n_{2}/n)\right)

. The exponentiation is monotonic and can be ignored when optimizing (it will be important in the stochastic case); differentiating and equating to 0 gives the solution

n_{1}=n_{e}/3,\ n_{2}=2n_{3}/3

, so you'll want to update after 1y4m and 2y8m.

Now let's assume there's a discrete number n of terms, and the rate changes only after each term. I'll use the per-term interest; if the term is a month (or anything else) but you're given the annual rate you'll need to translate it. Even if the rate is really updated more frequently, you may want to use a small n to simplify the solution.

This time we will not assume the interest rate is known, rather that it follows some stochastic process. This still requires specification of the process; we'll assume Gaussian random walk which is very reasonable, which means that the interest rate each term changes by a normal variable with mean 0 and known variance

\sigma ^{2}

(which can be estimated from historic data). We want to maximize our expected savings at the end of n terms. We'll denote by

f(n,o,r,u)

our expected eventual savings, as a multiple of the current savings, given that we have n terms left, our current rate is o, the bank's current rate is r, and we have u switches left. Then f is given by some recurrence relations:

f(0,o,r,u)=1\,\!

f(n,o,r,0)=(1+o)^{n}\,\!

f(n,o,r,u)=\max \left((1+o)\int _{-\infty }^{\infty }{\frac {\exp(-x^{2}/(2\sigma ^{2}))}{{\sqrt {2\pi }}{\sigma }}}f(n-1,o,r+x,u),(1+r)\int _{-\infty }^{\infty }{\frac {\exp(-x^{2}/(2\sigma ^{2}))}{{\sqrt {2\pi }}{\sigma }}}f(n-1,r,r+x,u-1)\right)

Solving this exactly is probably impossible, but with a variety of techniques an approximation can be found for any given parameters.

I've run a simulation for

n=4,\ r_{0}=0.025,\ \sigma =0.002

. The approximate optimal strategy is:

After 1 year: Switch if $r>0.0251668$ .
After 2 years: If you haven't switched yet, switch if $r>0.025$ . If you have, switch if $r>o+0.0005329$ .
After 3 years: If you have a switch left, switch if $r>o$ .

We can also consider the continuous case where

n\to \infty

. Then the stochastic process becomes Brownian motion, and the recurrence relations become differential equations. I don't think it would be realistic to solve these, but we can approximate with a large but finite n. -- Meni Rosenfeld (talk) 12:02, 23 October 2011 (UTC)[reply]

File:Consanguinity chart.png listed for deletion[edit]

A file that you uploaded or altered, File:Consanguinity chart.png, has been listed at Wikipedia:Files for deletion. Please see the discussion to see why this is (you may have to search for the title of the image to find its entry), if you are interested in it not being deleted. Thank you. Kelly ^hi! 03:47, 8 March 2013 (UTC)[reply]

Fuel efficiency[edit]

[–]zonination 2 points 1 day ago (2|0) Hey there. Sorry to leave you in the dark. I appreciate your asking. It's really just a simple question of unit analysis. First, how much is your price per mile? You can find that by dividing your price per gallon by your miles per gallon. In effect, you get:

($ / gal) / (mi / gal) = ($ / mi)

(Mkt Price) / (Fuel Efficiency) = Cost Efficiency

Or, in simpler terms, the market price divided by the fuel efficiency is equal to the cost efficiency of the car (per mile). This will change if you're using a highway to get to the station, but that's generally not the case. Average city mileage for a car in the United States is 20 MPG, while the market price is currently $3.50 in Ohio. (You'll have to change the price almost daily if you want to get an accurate mileage).

The next thing we need to determine is, what's the net amount you're saving when you fill your tank with gas. Essentially, your nominal savings are:

(gal) * ($/gal - $/gal) = $/Tank

(Volume to fill) * (Price Difference) = (Savings)

In other words, you multiply the gas missing from your tank by the difference in price from using one gas station as opposed to another. This gives you the price difference between gas stations (i.e., the difference in the total on your receipt). I used a standard 12 gallon tank for a Honda Civic, which I currently drive, as well as a theoretical 10 cent difference in price between stations.

So now that we've covered that, we need to determine... how many miles will it take, in fuel efficiency, to balance out the cost of driving to the other station vs. what you save when you fill there?

Well, we set up the equation:

Savings = Cost Efficiency * Distance

So isolating distance from the equation, it turns out that:

Distance = Savings / (Cost Efficiency)

Or:

Distance = (Fuel Efficiency / Mkt Price) * (Volume to Fill) * (Price Difference)

And if you check my units, you'll find that everything cancels out except miles. In turn, I got 6.8 miles as the breakeven point, which I rounded down to be safe. You can tweak the settings to your specific region and your gas tank volume and your MPG. I'd recommend a spreadsheet.

As it currently stands, your MPG is probably one of the most variable factors in this equation, which is more incentive to either get a bigger volume tank, or to get something that's fuel efficient to drive. Happy math-ing!

Disambiguation link notification for January 4[edit]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Dust devil, you added a link pointing to the disambiguation page Rose Bowl. 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) 08:59, 4 January 2015 (UTC)[reply]

ArbCom elections are now open![edit]

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 22:13, 30 November 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open![edit]

Hello, Doctorcherokee. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page.

ArbCom Elections 2016: Voting now open![edit]

Hello, Doctorcherokee. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)[reply]

ArbCom 2017 election voter message[edit]

Hello, Doctorcherokee. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

July 2020[edit]

Please stop your disruptive editing. If you continue to blank out or remove portions of page content, templates, or other materials from Wikipedia without adequate explanation, as you did at Age of Discovery, you may be blocked from editing. Don't go around removing what appears to be relevant and properly sourced content without a. a decent explanation or b., if you are reverted, explaining on the talk page. Thank you. Drmies (talk) 17:19, 5 July 2020 (UTC)[reply]

You may be blocked from editing without further warning the next time you remove or blank page content or templates from Wikipedia, as you did at Age of Discovery. Again, unexplained removal of verified content. Drmies (talk) 19:00, 5 July 2020 (UTC)[reply]