text:
User talk:Dlohcierekim/2008mar

Talk page archive for March and April 2008

Messages

Size of Contributions

Hello Dlohcierekim, quick question. How do you check the contributions of a user based on size? Example 30,000 bytes versus 1000 edits. It has been driving me nuts where to find the tool. Appreciate your help. 15:21, 1 March 2008 (UTC)

My reply. Dlohcierekim 15:39, 1 March 2008 (UTC)
Thanks - I was looking for quick and easy way. But I guess it is like a lot of things in life, just have to roll-up your sleeves and get your hands dirty. Your comments do make me rethink my deletion of my trophy wall with Articles I created section. But hey, I’ll save that for when and if I ever get involved at the administration level. And thanks again. 15:42, 1 March 2008 (UTC)

a troll

Me thinks Black Knight takes White Queen is trolling in Wikipedia:Requests for adminship/shoeofdeath 2. Kingturtle (talk) 15:21, 2 March 2008 (UTC)

Reply. Dlohcierekim 15:46, 2 March 2008 (UTC)

Hi there. In case you didn't know, when you add content to talk pages and Wikipedia pages that have open discussion, you should sign your posts by typing four tildes ( ~~~~ ) at the end of your comment. If you can't type the tilde character, you should click on the signature button located above the edit window. This will automatically insert a signature with your name and the time you posted the comment. This information is useful because other editors will be able to tell who said what, and when. Thank you! --SineBot (talk) 15:55, 2 March 2008 (UTC)

I went ahead and used your RfA pointers to guide Shapiros10, because I saw you weren't online, and I didn't want to see a good faith editor snowed under (and feel humiliated) before you had a chance to use them. Regards, EJF (talk) 16:12, 2 March 2008 (UTC)

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

Ckatz's RfA

I just wanted to say "thanks" for the support at my recent RfA. It is always somewhat unnerving to put yourself up for review in front of your peers... Thanks again, and please let me know if I can help out at any time. Cheers! --Ckatzchatspy 04:32, 3 March 2008 (UTC)

Re: Editor Review

Yeah, I have been reverting vandalism lately, so its lost. On my userpage, I have a list of created ones, but my best contributions are probably to Boston Celtics, (so close to FA) Rickey Henderson, (so close to GA) House of Hohenstaufen, Earl Johnson (baseball). I also helped get Heuschrecke 10 to GA. - Milk's Favorite Cookie 20:47, 3 March 2008 (UTC)

Thanks for the review. I will take your suggestions into mind! And, that AIV report was a mistake (whoops!). Sorry. But about delaying the RFA. I already did delay it, and I'm not sure delaying it again is a good idea. It's about 10 days away from April. I will of course delay it, if you really think I should, (but I will have to notify the co-noms again) which would bring up again Majorly's point. What do you think? - Milk's Favorite Cookie 21:31, 3 March 2008 (UTC)
Lol. - Milk's Favorite Cookie 21:43, 3 March 2008 (UTC)
It gets you too.... :) - Milk's Favorite Cookie 21:16, 4 March 2008 (UTC)

Closing my RfA

Thanks for closing it. I know what to improve before next time now. Just thought I'd thank you, George D. Watson (Dendodge).TalkHelp 00:45, 4 March 2008 (UTC)

RE:Eunice

Hello! Nice save on the Eunice (genus)! It looked like it could be notable, but the page seemed to be db-nonsense and the author's name seemed a bit vandalish (Robyn123456789). I should probably take more time in the newpage patrolling. Anyway, here's a barnstar for saving the article!--Sallicio${\displaystyle \color {Red}\oplus }$ 05:00, 4 March 2008 (UTC)

 The Barnstar of Recovery For taking the time to save a newpage article from a speedy demise! Sallicio${\displaystyle \color {Red}\oplus }$ 05:00, 4 March 2008 (UTC)

LOL! I sorta thought the same thing! That would be a pretty clever db-attack page to make, though!--Sallicio${\displaystyle \color {Red}\oplus }$ 05:16, 4 March 2008 (UTC)

Re:Mail

I read through the editor review. You've got mail.   jj137 (talk) 21:39, 4 March 2008 (UTC)

Ding.   jj137 (talk) 21:50, 4 March 2008 (UTC)

Oops...

My bad. It is the kid's user page. Sorry about that. On the other hand, I'm pretty certain that the report I made earlier may very well be the return of the Cartoon Network Vandal. I've seen this guy's modus operandi enough times to know. --PMDrive1061 (talk) 01:29, 5 March 2008 (UTC)

Thought I was signed in!

Sorry about that. It was a clear-cut speedy with no defense made on the talk page and I thought I was signed in when I made the change. PMDrive1061 via --76.79.100.242 (talk) 03:00, 5 March 2008 (UTC)

Here I am.  :) --PMDrive1061 (talk) 03:00, 5 March 2008 (UTC)

You got it. Will do. Thanks! --PMDrive1061 (talk) 03:06, 5 March 2008 (UTC)

Tatao

Aye it is indeed notable as you quite rightly say, having looked again.♦Tangerines♦·Talk 06:01, 5 March 2008 (UTC)

re: Weber

Haha! Yeah, Weber. I stopped trying to make sense of it some time ago, and I recommend the same to you. There have been threads at ANI, BN (1, 2), WT:RFA, and two RfCs (1,2), all without result. Some say he's entitled to his opinion, others say it's harmless, still others think it's disruptive. In my own opinion, it's plain point voting, because he does it instead of starting a centralised debate. What I personally think is a bit disruptive about it, or at least carries some danger, is that I've actually seen others oppose "per Kmweber". Dorftrottel (criticise) 09:14, March 5, 2008

My RfA

 100px My RFA Thank you muchly for your support in my recent request for adminship, which was successfully closed on 76%, finishing at 73 supports, 23 opposes and 1 neutral. The supports were wonderful, and I will keep in mind the points made in the useful opposes and try to suppress the Larry David in me! Now I'm off to issue some cool down blocks, just to get my money's worth! Kidding btw. All the best, Deacon of Pndapetzim (Talk) 11:30, 5 March 2008 (UTC)

abbie gale's deletion

hi Dlohcierekim, Abbie Gale are a band with two albums. their latest single called "Lovesong" -a duet with the singer of Raining Pleasure, the most succeessfull English singing band in Greece, with two albums being certified gold- has received a nationwide airplay.

They play live concerts all over Greece and are one of the 5-6 most critically acclaimed bands here and wide known as well.

I am not that patient and don't have too much time to write a fully detailed article. I suggest we keep the article i wrote and then someone else that build on it.

Anyway, as a more experienced user, you must know better... :( —Preceding unsigned comment added by Potis1980 (talkcontribs) 14:00, 6 March 2008 (UTC)

reply. Dlohcierekim 18:17, 6 March 2008 (UTC)

RFA

Thanks. And apologies for the profane edit summary before, I should have added :P onto the end. :D Rudget (?) 20:05, 6 March 2008 (UTC)

Invite

 As a current or past contributor to a related article, I thought I'd let you know about WikiProject University of Florida, a collaborative effort to improve Wikipedia's coverage of University of Florida. If you would like to participate, you can visit the project page, where you can join the project and see a list of open tasks and related articles. Thanks!
```Jccort (talk) 23:07, 6 March 2008 (UTC)
```

Trout Slapping

All I can say is THANK YOU! for the laugh tonight; “…Isn't responding to Kurt, like standing up in a boat, now an offense punishable by trout slapping? LOL. Thank you again. 02:30, 7 March 2008 (UTC)

this user page is huge!!! —Preceding unsigned comment added by Chris 1,000,001 (talkcontribs) 21:31, 7 March 2008 (UTC)

RfB thanks spam?

You accept this also?! Just here to say "CHEERS" for your support at my recent RfB which passed successfully with (133/4/3). Awesome. I'm thrilled! Cheers again. The Rambling Man (talk) 21:59, 10 March 2008 (UTC)

Zedla RfA

Hello, just a quick thank you for the support in my RfA. It passed and I hope to continue earning the trust bestowed upon me as an admin. Regards – Zedla (talk) 09:03, 11 March 2008 (UTC)

problem with repeating references

Dear Dlohcierekim

thanks for your offer of help, I have one problem, not urgent

I am reasonably happy with "testicular immunology", its all been written by me so far. I would welcome any suggestions on how to improve it.

The only major problem I have is that some references which are repeated at different places during the article, have been repeated in the reference list, instead of gaining letters in front to link the one reference to different parts of the text. Currently ref 20 is repeated as 23; 44 as 46, 60, 87; and 36 as 84, 89, 90, 91. This has happened despite using the same word as the title of the citation in text.

Any suggestions?

thanks

--Wendywinnall (talk) 06:14, 12 March 2008 (UTC)

Gloria M. Sabater Elementary School

I noticed you deleted my page for being obviously untrue. Just so you know, that was the idea. I'm trying to conduct a lesson for elementary school students about how not everything they see on the Internet is necessarily true, and I created that page to show a "real" web page that contains information that is, to them, obviously wrong. It had to be obvious because of the young age of my students, and I would ask that you please return the page to the way it was. After the lesson is over, I had planned on inserting real information and showing the students again, but I can't do that if the page is deleted. Thank you. —Preceding unsigned comment added by T3ach3r (talkcontribs) 13:10, 12 March 2008 (UTC)

Note from editor whose "article got deleted

Je suis une Admin Rouge Dlohcierekim 19:22, 12 March 2008 (UTC)

I read the article writing policy and I now understand that my articles where completely inappropriate and I feel like absolute idiot. I think that maybe people should be required to read the policy before they write or edit an article to keep them from doing totally stupid things like myself. —Preceding unsigned comment added by No.where.man.1000 (talkcontribs) 19:29, 12 March 2008 (UTC)

My first article got speedily deleted, too. Cheers Dlohcierekim 20:29, 12 March 2008 (UTC)

My RfA

Thanks for your support. - J Greb (talk) 22:46, 12 March 2008 (UTC)

Repeating References pt2

Hi Dlohcierekim

ref 1 in testicular immunology is repeated 6 times, and letters "a" to "f" came up automatically just before the citation in the reference list. This oen worked well but the others, eg 36 which is repeated at 84, 89, 90, 91 didn't. Its happened with references starting with a name used for numerous references, (O'Bryan and Pollanen). If we can't sort it out, its no big deal.

thanks, --Wendywinnall (talk) 02:03, 13 March 2008 (UTC)

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

Speedying hoaxes

According to the G3 criteria, blatant hoaxes are considered in the same vein as vandalism, and can be speedied as such. I don't know when this change was made, but I am glad that it was. I've found more than my fair share of hoax articles that could've been G3'd instead of AfD'd. it's just going to take time to get word out to everyone that we don't have to give these articles any more days of life that they don't deserve. DarkAudit (talk) 18:39, 13 March 2008 (UTC)

Seán P. O'Connor

The article is about the person who wrote it, they are not notable at all and . Check out the contributions of the author. There is no one of that name even remotely associated with the Newcastle Jets Jared Wiltshire (talk) 23:16, 13 March 2008 (UTC)

Ach, so! Danke. Dlohcierekim 23:51, 13 March 2008 (UTC)

RfA - Discospinster

Thank you so much for your support in my RfA, which was successful with a final count of 70/1/1! ... discospinster talk 23:23, 13 March 2008 (UTC)

Thank-you

 Hi Dlohcierekim! Thank-you for your support in my RfA (91/1/1). I take all the comments to heart and hope I can fulfil the role of being an admin to the high standard that the community deserves. Seraphim♥ Whipp 17:19, 14 March 2008 (UTC)

Hello, and thanks for your support in my recent RFA! The final result was 61/0/3, so I've been issued the mop! I'm extremely grateful for your confidence in me and will strive to live up to it. Thanks again! —Scott5114 [EXACT CHANGE ONLY] 07:17, 15 March 2008 (UTC)

source material for news stories salveagable

I assume that patent nonsense does not apply, this was sp delete under (1) no content; (2) testing; (3) other. Please let me know more details on why you applied speedy delete Cinnamon colbert (talk) 14:31, 16 March 2008 (UTC)

Deleted articles?

I'm asking for advice in a possibly controversial situation here. At WR, a user blocked for sockpuppetry is asking for copies of deleted articles, and I'm unsure if I should provide them. He seems to have legitimate reasons for wanting them, and I think it's not breaking any policy nor guideline, but MyWikiBiz is practically an expletive at Wikipedia, so I'm ambivalent. If a user asks for deleted copies of and article, should he get them? I think the fact that he's blocked should be irrelevant here, since sockpuppetry isn't really related to this. Nousernamesleftcopper, not wood 23:06, 16 March 2008 (UTC)

I'm running it by ANI. Thanks for the advice. Nousernamesleftcopper, not wood 21:30, 17 March 2008 (UTC)

Thanks...

..for the revert on my talk page : ). I didn't expect that deleting a one sentence stub about a web forum would inspire such anger. And an attack page too! Such is Wikipedia, I suppose. Thanks again, shoeofdeath 16:45, 17 March 2008 (UTC)

RFA thanks

 Thanks for the support Thanks for your support on my request for adminship, which passed 92/2/2. Yea, you got me, I suppose I don't need the tools, but with the support of the community behind me, I'll be wielding that mop of justice from time to time. ♬♩ Hurricanehink (talk) 03:00, 18 March 2008 (UTC)

Hello

I am here to talk about the page Nathan Comnick. I made that page for me about me. My name is Nathan Comnick. —Preceding unsigned comment added by Bulb2 (talkcontribs) 14:26, 18 March 2008 (UTC)

ten-string guitar edit war

Hello,

I do apologise for drawing you into what you have described as an "edit war".

As I see it, the matter is simple. We have on the one hand two instruments of historical significance, something called the Decacorde, and the so-called Romantic (or 19th century) 10-string guitar. I have repeatedly welcomed authors to expand entries dealing with these instruments, which are of historical significance - certainly in the case of the Romantic 10-string guitar - and should be represented on wikipedia.

On the other hand, we have a modern instrument that happens to have the same number of strings, but for a different reason, one founded in physics, not opinions. This modern instrument IS, in fact, its tuning and the particular, singular, properties of this tuning; it cannot be divorced from it. Information on both the above is in print.

Information about the latter has come under fire from person who feel threatened by it. (Let me make it clear, this information is no threat and no propaganda, just the facts that are in print and that can be proven by physics.) Some people don't like this. Some people have a different opinion about how a guitar with 10 strings should be tuned. That is fine. I have no interest in "converting" them. I simply want the full truth, the academic knowledge (rather than opinions) available to readers. (I am rather adamant about it since this information has for a long time deliberately been misrepresented in print and on various internet pages.)

Considering that wikipedia is an encyclopaedia, and that by definition an encyclopaedia should contain information that is factual and of historical significance, not the propaganda of living persons who are not historical figures or established authorities, it is inappropriate for this medium to be used to promote popular opinions that have not proven themselves through empirical scrutiny, in academic literature. (And we must consider that certain opinions are popular precicely because of the amount of misleading information available on the internet, and the dearth of academic information on this particular subject.)

Also, (I believe) since the entry on Ten-string guitar has recently been listed among the top pages on a Google search of the topic, this has troubled some individuals with a vested interest in the obfuscation of its information. Hence the acquisition of this page for themselves and their own agendas and the creation of a new, more obscure page for information about the Modern ten-string guitar.

I suggest this is resolved by keeping it to one page, as is, and fleshing out the information on the historically significant Romantic 10-string guitar, so there is a greater balance between the presentation of the two concepts. As for personal opinions expressed by amateur musicians in online discussion groups, these have no place in an encyclopaedia. The same goes for self-promotion of living persons, their instruments and opinions, which have not established themselves as historically significant.

As such, I will continue to delete information that is not verified in print, self-promotional, obfuscatory, or propagandistic. This may not be popular, but let's try to maintain some minimum academic standard?

Viktor van Niekerk (talk) 15:27, 18 March 2008 (UTC)

Thanks

Thanks for your 2 cents [1]. It made me feel better! Have a great day! Archeoix (talk) 20:41, 18 March 2008 (UTC)

Cleared up some misconceptions

I cleared up some misconceptions you had about Wikipedia deletion policy for user subpages here. ScienceApologist (talk) 21:00, 18 March 2008 (UTC)

Part of the problem was that until today, CSD4 read very confusingly like "never delete a user subpage". Please tell everyone you know to read the modification that was made for clarity. Cheers. Also, you might check out Wikipedia:Miscellany for deletion/Tlogmer subpages if you are interested in weighing in on this particular topic. ScienceApologist (talk) 22:11, 18 March 2008 (UTC)
While it's nice when administrators who delete articles are nice-enough to userify: when eight days go by without any attempt for improvement by the requesting user, and this has happened for nine separate articles, I think is safe to say that we've given the user enough of a chance and we should only continue to restore deleted content to this user's subpages on a single case-by-case basis. If and when this user actually improves some content of a userfied deleted article for restoration, then we can begin to give this user some more leeway. I haven't seen any evidence that this user is actually intending to improve the content. ScienceApologist (talk) 22:23, 18 March 2008 (UTC)

Ryan William Cook

My article on Ryan William Cook was unfinished and i just put the ending so it didnt look incomplete while i went to my orchestra concert. Anyways, ryan cook was a notorious gangster in a suburban town however he was rehabbed and is now very notable in our area as well as other surrounding areas. If you will please reinstate my article i will finish the article and put why it is important, Thank you and good day —Preceding unsigned comment added by Foxtrot19 (talkcontribs) 01:28, 19 March 2008 (UTC)

My reply Dlohcierekim 02:19, 19 March 2008 (UTC)
Ok, i apologize for my article on someone not important to you but in my community he is very well know so i was hoping i could have my work back for local use. In no way do I intend to repost or remake the article because i wish to be a helpful part of the wikipedia community. If it is possible to get the original text back that would be great. Thanks<<moved message to preserve thread>>

"Otter have the mop!"

Where did you come up with that? I like it -- if otter gets the mop, that's going on my user page. Ten Pound Hammer and his otters(Broken clamshellsOtter chirps) 03:21, 19 March 2008 (UTC)

Boooooo!

[2] Lol. Hella boo! :) Jmlk17 04:08, 19 March 2008 (UTC)

Butterfly watching

I instead posted it for deletion by mistake and forget to revert it. I thought someone just created that. Thanks. Well, back to my RC Patrol.--RyRy5 (talk) 05:04, 19 March 2008 (UTC)

Thanks. I'm kinda new to the revert, deletion thing. I've been at wikipedia for only 1 month and I already have 1450+ edits. Talk to you later.:)--RyRy5 (talk) 05:08, 19 March 2008 (UTC)

yaya

and my old lady is asleep on me. bot aint got nothin on me. --InvisibleDiplomat666 05:23, 19 March 2008 (UTC)

Recent RFAs

 The Random Acts of Kindness Barnstar For being the only user to take the time to alert new users about their malformed RFAs at their talk pages. 15:52, 19 March 2008 (UTC)

Late entry to the hoax AfD

I added Santa And The Giant Elves to the AfD you just closed. Probably just before you closed and deleted the other two entries. DarkAudit (talk) 22:06, 20 March 2008 (UTC)

RfA

Hey Dlohcierekim (mike, I assume). Thanks for your support on my recent unsuccessful RfA. I'll be back in a few months with more experience and more coaching; I hope to have your support then. Thanks again - Tanthalas39 (talk) 18:36, 21 March 2008 (UTC)

my RFA

 Thank you! Thank you for your support in my RFA. The final vote count was (73/3/1), so I am now an administrator. Please let me know if at any stage you need help, or if you have comments on how I am doing as an admin. Have a nice day! :) Aleta Sing 17:05, 22 March 2008 (UTC)

Since you asked to let you know when "it's up" it is: right here... - Milk's Favorite Cookie 01:06, 24 March 2008 (UTC)

http://en.wikipedia.org/w/index.php?title=User_talk:Cameron&diff=201043732&oldid=201042109 My reply.] Dlohcierekim 12:43, 26 March 2008 (UTC)

Sock's Rfa

Hence my oppose...With respect...I still think it rather mean to make fun of the newcomers...--Cameron (t/c) 12:35, 26 March 2008 (UTC)

I have been around Rfa longer than you think...under the name Camaeron... = ) Big difference, I know...--Cameron (t/c) 12:44, 26 March 2008 (UTC)
Hello, Dlohcierekim. You have new messages at Toddst1's talk page.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

Deletionism vs. Inclusionism. Wrong question.

I saw a comment of yours on User talk:Kim Bruning that suggested to me something that might be a solution to the essentially unresolvable, under the status quo, inclusionist/deletionist debate. It seems to me that we have set up the system so that the wrong question is being asked. You mentioned user space as a place where non-notable articles might exist, at least for a time. The infamous Sarsaparilla, and others, have promoted WP:PWD, which would avoid actual deletion of anything except where legal issues are involved. My own concern is efficiency. Notability is essentially an arbitrary standard, as it is, for notability depends on the subculture involved. If we have an encyclopedia that is the "sum of all human knowledge," and we advertise it as "the encyclopedia that anyone can edit," we have set up and invited all human beings to contribute what they know. Now, have we considered what happens if they take us up on the offer? We are seeing it happen, increasingly, creating more and more burden for those with a "deletionist" perspective. "Inclusionists" consider "deletionists" the problem, not the users who dare to imagine that their favorite topics aren't "notable," a standard which they, quite understandably, have never heard of, and, should they spend hours working on an article that gets deleted, and they do investigate, upsets them and seems to be biased against their kind of knowledge. The vast majority of them simply go away, with a bad taste in their mouth. And this includes experts, professionals, and, from what I'm being told, librarians.

But the controversy is based on an assumption that notability is a characteristic of facts and topics. It isn't. It is a relationship, an attitude, a response to facts. We are inundated, every moment, with a vast flow of information developed by our senses. We only notice a tiny portion of this. However, when it is needed, we can focus our attention and become exquisitely aware of some small segment of this flow, which is then being "noticed" and is thus, obviously, for us, "notable." When someone studies a subject, there may exist a whole library of materials related to that subject. The person will start, often, with some summary, some high-level abstraction from the material, ideally being a matter of broad consensus among those knowledgeable. But, if they have access to a true library, as they learn the subject they may drill down to ever-finer levels of detail, until they are reading primary sources, which might even be the undigested and previously not noticed papers of a single individual. When one person has "noticed" the report of another, considering it worthy of attention, it has been noticed and it is therefore notable. By the most basic definition, not by other, higher-level and more abstract definitions.

By deleting submitted articles, it is analogous to applying an anesthetic to a section of our nervous system. Yes, through some special process, we might be able to re-awaken that section, but it has been inhibited.

On the other hand, if we have a flat encyclopedia, with many, many unverified articles, perhaps not even noticed by anyone before, it becomes unreliable (or, more accurately, remains so). Being flat, if it is purely flat, there is no hierarchy of notability, no beaten path to knowledge, beginning with what is well-known, reliable (i.e., verified by consensus), and NPOV.

The encyclopedic task is not, as we have thought, what to include. It is how to categorize what is submitted. It is an editorial task, purely NPOV, and, while debates will continue, they will continue on another level, one which NPOV was actually designed to resolve. Notability is, aside from the very basic definition I give above, dependent upon POV. It is inherently subjective; we may develop, as we have, some consensus about the boundaries of notability, but this is then only the consensus of a particular subculture, the subculture of active Wikipedia editors, not the masses of editors, the "everyone who can edit this," but a particular core with particular motivations and interests. And then we will have, it can be predicted, massive and sometimes bitter debates, which amount to "What subculture has the correct view of notability?"

And none of this debate actually addresses the real problem: the editorial task of verifying and categorizing information.

Your comment about user space suggests one solution: routinely, unverified articles are left in user space until verified, or, if placed in article space, are moved to user space by any registered editor. At the same time, these articles would be tagged as unverified.

The unverified tag would show, clearly, that the information in the article has not been checked, and none of it should be considered anything but the unverified report of a single editor.

This, then, raises another issue: the use of Wikipedia space for what really belongs on a personal web site. There is a classic solution used by free space providers: the space is limited, and material exceed that limit is subject to deletion. The limits are set by the technical capacity of the host, to some degree.

Whatever is done, it must be *easy* to administer. And to figure all this out will take discussion on a level that does not normally take place on Wikipedia, because the community has been damaged by years of dysfunctional debate. Positions have hardened, and each camp will see any proposal that is actually integrative as moving things toward one side or the other, and therefore to be bitterly opposed, even before it can be fully formulated.

There are many other possible ways to address the problem of categorization and efficiency; but we won't find them unless we begin to develop means of discovering true consensus, which, outside Wikipedia, usually means universal or almost-universal agreement. Sarsaparilla came across one of these, and promoted it, which was the real cause of the intense attention he attracted, until he ended up being effectively banned for minor offenses, common with developmentally delayed geniuses, which ordinarily would have resulted in warnings only. This is actually to be expected, see User:Abd/Rule 0.

If you are interested in becoming part of the solution, please let me know, on my Talk or by email. Otherwise, I apologize for this intrusion on your Talk space, you may, of course, freely delete it, not that you needed to be told that.... --Abd (talk) 15:56, 28 March 2008 (UTC)

Speedies

Regarding that short discussion that took place on the WP:CSD talk page, I didn't realize there was a pertinent issue regarding the time in which editors were tagging articles to be deleted. I just hope you understand that tag (which is now broadcasted there) was an honest error and nothing more. However, I don't feel as though it warranted the admonishment I received on that page. I thought it was kinda rude. Anyway, that's not really the point. Just wanted to let you know that, personally, I will be giving articles more time to develop per the comments on the page. I certainly agree that editors are too hasty to mark a page for deletion - not necessarily erroneously, but, in a manner which doesn't afford the author ample time to rectify the problem. Although, most of my tagging is quite accurate methinks, bringing me to my next question. Any feedback from you on this issue would be great. I don't want this to crop up during my next RfA, so in addition to Pedro's coaching, perhaps you could give me a series of practice questions at User:Pedro/Admin Coaching since this is an area I would plan to work in if given the tools. If you're too busy, I understand. At the very least, could you take a look through my special contributions and comment? I've come to highly trust your judgment on the wiki. Cheers! Wisdom89 (T / C) 18:57, 28 March 2008 (UTC)

citations

Hi When I include information from the internet I always include the URL and sometimes the date. Is this sufficient for a talk page?

Notpayingthepsychiatrist (talk) 20:07, 29 March 2008 (UTC)

MrFish RfA

No problem, but mine was somewhat serious :) Cheers, EJF (talk) 20:09, 1 April 2008 (UTC)

O'Finky Factor

Did you follow the link to BlogFlux? No mention of the supposed popularity of this blog. If you go to it, the total lifetime visitor count is around 3,000! --Orange Mike | Talk 21:07, 1 April 2008 (UTC)

Page move

I must confess that I am mystified by your comment on the proposed deletion of Tropical Storm Rita. As I'm sure you read the whole deletion notice and not just the first few words, you know that the proposal was to delete the page to allow moving the existing disambiguation page from Tropical Storm Rita (disambiguation) to Tropical Storm Rita, in keeping with the naming conventions described on WP:MDP. From your edit comment, I cannot discern what your objection to this might be. --Russ (talk) 00:25, 2 April 2008 (UTC)

why

why have you chosen my page on road seals for deletion. it is as mentioned on the page a creature which is mythical but has not actually be proven to exist. please revise your thoughts on deletion ASAP. —Preceding unsigned comment added by D of words (talkcontribs) 17:31, 2 April 2008 (UTC)

sorry

for speeding deletion on that welsh place. Looked weird. Won't do that again. Me what do u want? Your Hancock Please —Preceding comment was added at 00:04, 3 April 2008 (UTC)

User:Moosato Cowabata

Yeah, but then someone added nasty things to it and the user placed a speedy tag on it. I probably should have deleted it under U1 but since the tag was for an attack page I went with that. ... discospinster talk 19:58, 3 April 2008 (UTC)

Mathamatics

Should I have tagged that under CSD G3 (vandalism)? It is vandalism, but the page did not meet description given on the speedy deletion tag. J.delanoygabsadds 18:07, 7 April 2008 (UTC)

Sorry

I didn't realize that was a attack nomination thing, I thought that reffered to all speedy deletions. Yojimbo501 (talk) 16:31, 9 April 2008 (UTC)

Wikipedia:Articles for deletion/Cristina De Lorenzo

I have opened a suspected sockpuppet case regarding edits to the deleted articles and to the related AfD at Wikipedia:Suspected sock puppets/Mcchow89. Sincerely, --Le Grand Roi des CitrouillesTally-ho! 19:20, 9 April 2008 (UTC)

Jeunesses Musicales Россия

Just a small note that I was not nominating this article for speedy delete because it wasn't in English but because the text, even translated, does not contain enough substance to allow anyone to create an article based on it. -Yupik (talk) 20:31, 10 April 2008 (UTC)

deletion of page

sorry about the incoherent page, was just fiddling with editing tools, thanks for the message and the help --Brunusmcchunky (talk) 21:06, 10 April 2008 (UTC)

Re

oops, I guess I wasn't paying attention.. Sorry. J.delanoygabsadds 00:33, 11 April 2008 (UTC)

re:User Talk:Max938

What do you mean user page gone astray?

Appreciation

I just noticed the good recommendation you gave about my willingness to help people rescue articles, make 2 months ago at [3]. I hope we will continue to work together in this manner. . Thanks!!!DGG (talk) 20:08, 12 April 2008 (UTC)

RFA Thanks

Thank you for your comments on my RFA. Even though it failed with 28 supports, 42 opposes, and 15 neutrals, I am grateful for the suggestions and advice I have received and I do hope to improve as a Wikipedian. If you ever need my help in any endeavor, feel free to drop me a line. --Sharkface217 19:37, 13 April 2008 (UTC)

Supermarchophobia

I finally had enough and protected the talk page. Call it trollophobia if you wish! Regards, BencherliteTalk 21:00, 13 April 2008 (UTC)

Re: September 11, 2000Fun!

I couldn't find any reference to it on Google (outside of the Wikipedia article on the episode), so I assumed it was a hoax of some sort. If it's not a hoax, I don't think it's notable enough to deserve its own article anyway, since it should simply be part of the episode article. nneonneotalk 02:24, 14 April 2008 (UTC) Reply Dlohcierekim 02:27, 14 April 2008 (UTC)

Alright, that works. I'll try to be a little more careful next time... nneonneotalk 02:28, 14 April 2008 (UTC)

Re: User:Destry11

I have replied to your query on my talk page. Any more questions, just ask away... ;) --Kurt Shaped Box (talk) 09:29, 14 April 2008 (UTC)

You might also like to take a look at Wikipedia:Administrators'_noticeboard/Incidents#So.2C_I_just_received_my_very_first_death_threat_via_WP.27s_email_system.... Your input may very well be useful there. Thanks. --Kurt Shaped Box (talk) 17:13, 14 April 2008 (UTC)

Just a quick thanks

Thanks for doing the warning for me for Wangchung777's edits. Much appreciated. Winston365 (talk) 04:38, 15 April 2008 (UTC)

I caught you...

Rats to you too...! The Rambling Man (talk) 15:13, 15 April 2008 (UTC)

No problem

Keep up the good work!--Urban Rose 17:49, 15 April 2008 (UTC)

No prob.  :)

Thanks for letting me know. Here's hoping he got the message. --PMDrive1061 (talk) 18:46, 15 April 2008 (UTC)

• Whoa...neither did I. What is it with these kids and this horrid gangsta slang? Sad. --PMDrive1061 (talk) 18:48, 15 April 2008 (UTC)

Good. Doggone it, I knew it was too good to be true.  :( Thanks for the update. --PMDrive1061 (talk) 18:50, 15 April 2008 (UTC)

LOL! Good one! You deserve a cookie. Eat up! --PMDrive1061 (talk) 18:54, 15 April 2008 (UTC)

GMILF

I missed your reply somehow: go ahead and re-create. I'll turn 50 this year so it's going to be a matter of increasing interest/concern anyway! Acroterion (talk) 23:14, 15 April 2008 (UTC)

User:Chickenpies22

Aaah, I feel like such an idiot! The user had just created a non-user page Chickenpies22 that I requested a speedy for. I saw him make another, and didn't realize it was a user page. Sorry for any inconvenience it might've caused. Mastrchf91 (t/c) 02:58, 16 April 2008 (UTC)

please send deleted article to my email

please send to noothergodbesidegod@gmail.com thanks —Preceding unsigned comment added by JamesMartinJM (talkcontribs) 04:02, 16 April 2008 (UTC)

Stevie Hoang

No probs. Was only reverting vandal edits!Thanks.Prashanthns (talk) 06:42, 16 April 2008 (UTC)

re:100

Thanks very much! And I didn't mean to snub your monty python joke, I love python quotations. VanTucky 21:39, 17 April 2008 (UTC)

thankyou!!!

thanks, I got the email! --JamesMartinJM (talk) 01:43, 18 April 2008 (UTC)

Thanks...

...for the barnstar! GBT/C 12:41, 22 April 2008 (UTC)

RE: Speedy

Hi there,

Sorry about that - it appeared to be nonsense!

--The Helpful One (Review) 19:32, 22 April 2008 (UTC)

thank spam

 Thank you for voting in my RfA, which passed with 194 supporting, 9 opposing, and 4 neutral. Your kindness and constructive criticism is very much appreciated. I look forward to using the tools you have granted me to aid the project. I would like to give special thanks to Tim Vickers, Anthony and Acalamari for their nominations. Thank you again, VanTucky }

Ghost Feet

Hi, An article on Ghost Feet was 'speedily deleted' due to there being 'no verifiable sources' the reason for this is that due to the folklore nature of Ghost Feet, there is very little, apart from stories known to many midland locals. i think it is important that people who dont know about these tales, though have heard the name around should have the chance to find out about it. wikipedia being the first port of call for an awful lot of people searching for information on a subject, I believe there should be reference to Ghost Feet on this site.

```many thanks  —Preceding unsigned comment added by As554184 (talk • contribs) 12:38, 24 April 2008 (UTC)
```

Thank you for your research time, which I appreciate. Sincerely, David Hayes. Davidmhayes (talk) 21:20, 24 April 2008 (UTC)davidmhayes.

Question about orphaned image you created....

I am considering nominating Image:Peppermint_candy_cane_04.jpg for deletion as an orphaned image for cleanup purposes. It is already on Commons and is not used at all in articles; it only appears on userpages here of users that are likely sleeper socks on unused accounts (meaning no contribs whatsoever save adding the image to the userpage). What do you think? MSJapan (talk) 17:00, 28 April 2008 (UTC)

Hello

How can I redirect special articles? Volkov talk 20:09, 28 April 2008 (UTC)

thanks!

just a quick thanks for deleting the hoax article about the Jesus and Mary Chain. I really dont think people say thank you enough for other editors actions; its not like editing is something you HAVE to do, so i just thought i'd pop in to show my appreciation. Ironholds (talk) 16:08, 29 April 2008 (UTC)

RFA

just wanted to ask; a user has nominated himself for adminship and the thing should've been closed a month ago. its got 1 support from an inexperienced user and one oppose (from me, another inexperienced user). Its obviously going nowhere; who should i talk to to get it removed/closed (probably under WP:SNOW, although i dont know if that counts for stalled nominations, just heavily opposed ones). thanks. Ironholds (talk) 23:17, 29 April 2008 (UTC)

AJ00200, but i see you've found it.
No problem, and thanks for getting on it so quickly. I'm considering RFA myself (i've only been here for a month, but was previously here for almost 2 years on another account); i dont suppose you'd know anyone who does some kind of tuition? Ironholds (talk) 00:46, 30 April 2008 (UTC)

Meegrob?

By any chance do you remember what this article was about? You deleted it, but I was just curious. I am probably going to redirect it to Mee krob (a Thai noodle dish), but was just curious. Mahalo, Dlohcierekim. --Ali'i 15:52, 30 April 2008 (UTC)

Go for it. The redirect will be far better than what was deleted. Dlohcierekim 18:25, 30 April 2008 (UTC)


text:
# NCERT Class 12-Mathematics: Exemplar Chapter – 4 Determinants Part 1 (For CBSE, ICSE, IAS, NET, NRA 2022)

Doorsteptutor material for CBSE/Class-12 is prepared by world's top subject experts: get questions, notes, tests, video lectures and more- for all subjects of CBSE/Class-12.

4.1 Overview

To every square matrix of order n, we can associate a number (real or complex) called determinant of the matrix A, written as det A, where is the element of A.

If A , then determinant of A, denoted by (or det A) , is given by

Remarks

(i) Only square matrices have determinants.

(ii) For a matrix A, A is read as determinant of A and not, as modulus of A.

4.1. 1 Determinant of a matrix of order one

Let be the matrix of order 1, then determinant of A is defined to be equal to .

4.1. 2 Determinant of a matrix of order two

Let be a matrix of order . Then the determinant of A is defined as: det .

4.1. 3 Determinant of a matrix of order three

The determinant of a matrix of order three can be determined by expressing it in terms of second order determinants which is known as expansion of a determinant along a row (or a column) . There are six ways of expanding a determinant of order corresponding to each of three rows and three columns and each way gives the same value.

Consider the determinant of a square matrix , i.e.. ,

Expanding along , we get

Remark In general, if , where A and B are square matrices of order , then .

4.1. 4 Properties of Determinants

For any square matrix satisfies the following properties.

(i) , where transpose of matrix .

(ii) If we interchange any two rows (or columns) , then sign of the determinant changes.

(iii) If any two rows or any two columns in a determinant are identical (or proportional) , then the value of the determinant is zero.

(iv) Multiplying a determinant by k means multiplying the elements of only one row (or one column) by k.

(v) If we multiply each element of a row (or a column) of a determinant by constant , then value of the determinant is multiplied by .

(vi) If elements of a row (or a column) in a determinant can be expressed as the sum of two or more elements, then the given determinant can be expressed as the sum of two or more determinants.

(vii) If to each element of a row (or a column) of a determinant the equimultiples of corresponding elements of other rows (columns) are added, then value of determinant remains same.

Notes:

(i) If all the elements of a row (or column) are zeros, then the value of the determinant is zero.

(ii) If value of determinant ‘’ becomes zero by substituting , then is a factor of ‘’ .

(iii) If all the elements of a determinant above or below the main diagonal consists of zeros, then the value of the determinant is equal to the product of diagonal elements.

4.1. 5 Area of a triangle

Area of a triangle with vertices and is given by

4.1. 6 Minors and co-factors

(i) Minor of an element of the determinant of matrix A is the determinant obtained by deleting row and column, and it is denoted by .

(ii) Co-factor of an element is given by .

(iii) Value of determinant of a matrix A is obtained by the sum of products of elements of a row (or a column) with corresponding co-factors. For example

(iv) If elements of a row (or column) are multiplied with co-factors of elements of any other row (or column) , then their sum is zero. For example,

.

Developed by:

format: plain


text:
# R/convertCdf.R In affxparser: Affymetrix File Parsing SDK

#### Documented in convertCdf

#########################################################################/**
# @RdocFunction convertCdf
#
# @title "Converts a CDF into the same CDF but with another format"
#
# @synopsis
#
# \description{
#   @get "title".
#   Currently only CDF files in version 4 (binary/XDA) can be written.
#   However, any input format is recognized.
# }
#
# \arguments{
#   \item{filename}{The pathname of the original CDF file.}
#   \item{outFilename}{The pathname of the destination CDF file.
#     If the same as the source file, an exception is thrown.}
#   \item{version}{The version of the output file format.}
#   \item{force}{If @FALSE, and the version of the original CDF is the
#     same as the output version, the new CDF will not be generated,
#     otherwise it will.}
#   \item{...}{Not used.}
#   \item{.validate}{If @TRUE, a consistency test between the generated
#     and the original CDF is performed.  Note that the memory overhead
#     for this can be quite large, because two complete CDF structures
#     are kept in memory at the same time.}
#   \item{verbose}{If @TRUE, extra details are written while processing.}
# }
#
# \value{
#   Returns (invisibly) @TRUE if a new CDF was generated, otherwise @FALSE.
# }
#
# \section{Benchmarking of ASCII and binary CDFs}{
#   Binary CDFs are much faster to read than ASCII CDFs.  Here are some
#   example for reading complete CDFs (the difference is even larger when
#   \itemize{
#     \item HG-U133A (22283 units): ASCII 11.7s (9.3x), binary 1.20s (1x).
#     \item Hu6800 (7129 units): ASCII 3.5s (6.1x), binary 0.57s (1x).
#   }
# }
#
# \section{Confirmed conversions to binary (XDA) CDFs}{
#   The following chip types have been converted using \code{convertCdf()}
#   and then verified for correctness using \code{compareCdfs()}:
#   ASCII-to-binary: HG-U133A, Hu6800.
#   Binary-to-binary: Test3.
# }
#
# @examples "../incl/convertCdf.Rex"
#
# @author "HB"
#
# \seealso{
#   See @see "compareCdfs" to compare two CDF files.
#   @see "writeCdf".
# }
#
# @keyword "file"
# @keyword "IO"
#*/#########################################################################
convertCdf <- function(filename, outFilename, version="4", force=FALSE, ..., .validate=TRUE, verbose=FALSE) {
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# Validate arguments
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# Argument 'filename':
# Expand any '~' in the pathname.
filename <- file.path(dirname(filename), basename(filename));
if (!file.exists(filename)) {
stop("Cannot open CDF file. File does not exist: ", filename);
}

# Argument 'outFilename':
# Expand any '~' in the pathname.
outFilename <- file.path(dirname(outFilename), basename(outFilename));
if (identical(outFilename, filename)) {
stop("Cannot convert CDF file. Destination is identical the the source pathname: ", filename);
}

# Argument 'version':
version <- as.character(version);
if (version == "4") {
} else {
stop("Cannot convert CDF. Currently only version 4 (binary/XDA) can be written: ", version);
}

# Argument 'force':
force <- as.logical(force);

# Argument '.validate':
.validate <- as.logical(.validate);

# Argument 'verbose':
verbose <- as.integer(verbose);

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
if (verbose)
#  if (version == cdfHeader\$version) {
#    if (!force) {
#      warning("The original CDF file is already in file-format version ",
#                                                  version, ": ", filename);
#      if (verbose)
#      return(invisible(FALSE));
#    }
#  }
if (verbose)

if (verbose)
if (verbose)

if (verbose)
if (verbose)

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# Write new CDF file
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
if (verbose)
cat("Writing CDF structure...\n");
verbose2 <- verbose-1;
if (verbose2 < 0) verbose2 <- 0;
t <- system.time({
cdfqc=cdfQcUnits, overwrite=TRUE, verbose=verbose2);
});
if (verbose) {
cat("Timing for writeCdf():\n");
print(t);
}
if (verbose)
cat("Writing CDF structure...done\n");

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# Validate?
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
if (.validate) {
if (verbose)
cat("Comparing CDFs...\n");
res <- compareCdfs(filename, outFilename, verbose=verbose);
if (!res) {
stop("An inconsistency between source and destination CDF was detected. Reason: ", attr(res, "reason"));
}
if (verbose)
cat("Comparing CDFs...done\n");
} # if (.validate)

invisible(TRUE);
} # convertCdf()

############################################################################
# HISTORY:
# 2007-07-26
# o Removed debug assignment 'res2 <<- res' before validation error message.
# 2006-09-09
# o More benchmarking: A binary-to-binary convertion of Mapping50K_Hind240
#   (56.0Mb; 57299 units) takes in total 25 mins.  It is the writing of
#   units that is slow.
# o Simple benchmarking: On Thinkpad A31 1Gb RAM; HG-U133A.CDF (22283 units)
#   ASCII (40.3Mb) -> XDA (10.8Mb): ~15s to read ASCII, ~270s to write XDA,
#   and ~420s to validate.
# o Now validate is making use of compareCdfs().
# 2006-09-08
# o Added protection against overwriting the source file.
# 2006-09-07 /HB
# o Ken Simpson at WEHI just tried to convert an ASCII Exon CDF to a binary
#   CDF using convertCdf().  The ASCII CDF is ???MB, and the binary one
#   became 321MB.  He did this on a 4-core with 16GB RAM Linux system, and
#   it took 45 minutes, which probably includes the validation tests,
#   which eventually made R run out of memory.  I've updated the code a bit
#   to make the validation a little bit more memory efficient.  It is
#   probably better to compare chunks of units and not all of them at the
#   same time.  The writeCdf() function can be made faster if writing to
#   a raw vector internally which is the dumped to file.  This should be
#   done in chunks to also optimize memory usage.
# o Created.
############################################################################

## Try the affxparser package in your browser

Any scripts or data that you put into this service are public.

affxparser documentation built on Nov. 8, 2020, 7:26 p.m.


text:
# Quark Matter 2019 - the XXVIIIth International Conference on Ultra-relativistic Nucleus-Nucleus Collisions

3-9 November 2019
Wanda Reign Wuhan Hotel
Asia/Shanghai timezone

## Effects of hydrodynamic fluctuations on azimuthal flow in ultra-central heavy-ion collisions

4 Nov 2019, 17:40
20m
Wanda Han Show Theatre & Wanda Reign Wuhan Hotel

#### Wanda Han Show Theatre & Wanda Reign Wuhan Hotel

Poster Presentation Collective dynamics and final state interaction

### Speaker

KENSHI KUROKI (Sophia University)

### Description

It is reported recently that an intriguing behavior of the anisotropic flow coefficients in ultra-central Pb-Pb collisions at the LHC. Elliptic flow in ultra-central collisions is driven mainly by fluctuations rather than collision geometry. Therefore, magnitudes of elliptic flow and triangular flow coefficients are almost identical. Some hydrodynamic models, which have been successful in describing non-central data, fail to reproduce elliptic flow and triangular flow coefficients simultaneously in ultra-central collisions. We try to resolve the issue by investigating effects of hydrodynamic fluctuations on anisotropic flow coefficients in ultra-central collisions.
We employ an integrated dynamical model [1] to describe the dynamics of heavy-ion collisions at the LHC energy. Here, we introduce hydrodynamic fluctuations into relativistic hydrodynamic model through the fluctuation-dissipation theorem [2]. Hydrodynamic fluctuations are thermal fluctuations during hydrodynamic evolution. Since anisotropic flow is driven mainly by fluctuations in ultra-central collisions, hydrodynamic fluctuations play an important role in understanding their coefficients. The gap between magnitudes of elliptic flow and triangular flow is expected to decrease because hydrodynamic fluctuations enhance higher order flow coefficients more effectively. Setting impact parameter to be vanished to remove geometric effects, we first compare the results with hydrodynamic fluctuations and without them. Next, we analyze the effect of hydrodynamic fluctuations on azimuthal flow in ultra-central collisions. We also analyze the correlation between initial transverse eccentricity $\varepsilon_n$ and final anisotropic flow $v_n$ in ultra-central collisions.

[1] T. Hirano et al., Prog. Part. Nucl. Phys. 70 (2013) 108.
[2] K. Murase, Ph. D thesis, The University of Tokyo (2015)

### Primary author

KENSHI KUROKI (Sophia University)

### Co-authors

Koichi Murase (Sophia University) Tetsufumi Hirano (Sophia Univ)


text:
Windows: The tree command

The tree command graphically displays the directory structure of a drive or path on the command line prompt — nice gimmick; haven’t used this in ages and completely forgot about it, but came in handy recently.

`TREE \[drive:\]\[path\] \[/F\] \[/A\]`

Parameter Description
`/F` Displays the names of the files in each directory.
`/A` Uses ASCII instead of extended characters.
``````C:\xyz>tree /f /a
C:.
|   plugin.php
|
+---feeditem
|       atom.php
|       common.php


text:
Tag Info

{loops} is about looping constructs which allow a programmer to apply the same operation multiple times, each time with possibly different parameters.

is about looping constructs which allow a programmer to apply the same operation multiple times, each time with possibly different parameters.

In plain TeX and in LaTeX, one can implement this using counters and `\ifnum` checks or `\loop\unless`. Some LaTeX packages even provide their own looping constructs, e.g. TikZ/PGF provides `\foreach`, `pstricks` provides `\psforeach`, `multido` provides `\multido`, etc. If your question specifically involves or , add that tag to your question along with this one.


text:
• # question_answer In a cyclic process change in internal energy of a system over one complete cycle is A)  Positive            B)  ZeroC)  Negative           D)  Cannot say

Solution :

in cyclic process $\Delta U=0$ because internal Energy depend on final and initial state

You need to login to perform this action.
You will be redirected in 3 sec


text:
×

# Speed and Time

If you had read my problem, Sheep Speed, you would have read my formula $$S=\frac {v_1 + v_2}{1 + \frac {v_1 * v_2}{c^2}}$$. This is the actual formula to find the combined speed, rather than just $$S=v_1 + v_2$$ because of the fact that the faster you go, the slower time passes. This was proven by Albert Einstein through his theory of relativity. To give you an example, say there are two lasers pointed towards each other. According to $$S=v_1 + v_2$$, these lasers would be coming towards each other at twice the speed of light, which is currently impossible. But, if you use the equation $$S=\frac {v_1 + v_2}{1 + \frac {v_1 * v_2}{c^2}}$$, you would get an answer of the speed of light.

The reason people don't use this formula is because the difference is so minute that it hardly changes the answer. Also, people can be too lazy to learn about this. A physics misconception cleared up.

Note by Sharky Kesa
3 years, 9 months ago

Sort by:


text:
# 数学代写|微积分代写Calculus代写|MATH141

## 数学代写|微积分代写Calculus代写|Instantaneous rate of change

Instead of asking how fast an object is moving, we can ask how fast a quantity is changing.

Example 8 The price of a gallon of ChemForm $B$ this year is given by $f(t)=0.005 t^2+0.01 t+7.924$, where $t$ is in days and $f(t)$ is in dollars. How fast is the price changing when $t=60$ ?

Before we can find the solution, we need to develop the solution method. To begin, what does it mean by “how fast is the price changing?” Think about the price of gasoline (example 8 uses ChemForm $B$ instead of gasoline, but it’s the same idea). If the price of gas goes up $\$ 0.21$this week, this is a rate of change of$\$0.03 /$ day. “How fast the price is changing” means the rate at which the price changes over time. The units are units of price (dollars) divided by units of time (days).

How do we calculate the rate of change of the price of gasoline, $\$ 0.03 /$day? We first find the change in price of$\$0.21$ for the week as price at end of week – price at beginning of week.

To find the rate of change, we then divide by the amount of time. If the week in question was noon July 3 to noon July 10, we calculate the number of days by $10-3=7$, or
day at end of week – day at beginning of week.
Using $a=$ noon July 3 and $b=$ noon July 10 , and by calling the price of gasoline $f(t)$, then $f(a)$ is the price of gasoline at noon on July 3 and $f(b)$ is the price of gasoline at noon on July 10. The average rate of change of the price of gasoline over the time period is then
$$\frac{f(b)-f(a)}{b-a} .$$
It is the same formula as for average velocity. In fact, velocity can be considered the rate of change of position over time (how fast the position of the object is changing).

## 数学代写|微积分代写Calculus代写|The definition of derivative

The derivative is defined in a similar manner as limit and continuity.
Definition 1 THE DERIVATIVE Let $f$ be a function and let $k$ be a real number in the domain of $f$. If
$$\frac{f(k+\alpha)-f(k)}{\alpha}$$
is defined and renders the same real result $L$ for every infinitesimal $\alpha$, then we write $f^{\prime}(k)=L$ and call $f^{\prime}(k)$ the derivative of $f$ at $k$. When $L$ is a real number (not $\infty$ or $-\infty$ ), then we say that $f$ is differentiable at $k$.
For the purpose of calculations we write
$$f^{\prime}(k)=\frac{f(k+\alpha)-f(k)}{\alpha},$$
with the understanding that $\alpha$ is an arbitrary infinitesimal that can be either positive or negative and that we must render the same real result for every $\alpha$.
Example 1 Let $f(x)=x^2$. Find $f^{\prime}(5)$.

Solution We use the derivative formula with $k=5$ :
\begin{aligned} f^{\prime}(5) &=\frac{f(5+\alpha)-f(5)}{\alpha}=\frac{(5+\alpha)^2-5^2}{\alpha} \ &=\frac{25+10 \alpha+\alpha^2-25}{\alpha}=\frac{10 \alpha+\alpha^2}{\alpha} \ & \approx \frac{10 \alpha}{\alpha}=10 . \end{aligned}
The value of the derivative is 10 , and we write $f^{\prime}(5)=10$.

# 微积分代考

## 数学代写|微积分代写Calculus代写|Instantaneous rate of change

$$\frac{f(b)-f(a)}{b-a} .$$

## 数学代写|微积分代写Calculus代写|The definition of derivative

$$\frac{f(k+\alpha)-f(k)}{\alpha}$$

$$f^{\prime}(k)=\frac{f(k+\alpha)-f(k)}{\alpha},$$

$$f^{\prime}(5)=\frac{f(5+\alpha)-f(5)}{\alpha}=\frac{(5+\alpha)^2-5^2}{\alpha}=\frac{25+10 \alpha+\alpha^2-25}{\alpha}=\frac{10 \alpha+\alpha^2}{\alpha} \approx \frac{10 \alpha}{\alpha}=10 \text {. }$$

myassignments-help数学代考价格说明

1、客户需提供物理代考的网址，相关账户，以及课程名称，Textbook等相关资料~客服会根据作业数量和持续时间给您定价~使收费透明，让您清楚的知道您的钱花在什么地方。

2、数学代写一般每篇报价约为600—1000rmb，费用根据持续时间、周作业量、成绩要求有所浮动(持续时间越长约便宜、周作业量越多约贵、成绩要求越高越贵)，报价后价格觉得合适，可以先付一周的款，我们帮你试做，满意后再继续，遇到Fail全额退款。

3、myassignments-help公司所有MATH作业代写服务支持付半款，全款，周付款，周付款一方面方便大家查阅自己的分数，一方面也方便大家资金周转，注意:每周固定周一时先预付下周的定金，不付定金不予继续做。物理代写一次性付清打9.5折。

Math作业代写、数学代写常见问题

myassignments-help擅长领域包含但不是全部:


text:
Moments and Centers of Mass

This section shows how to calculate the masses and moments of two- and three- dimensional objects in Cartesian (x,y,z) coordinates.

Mass

We saw before that the double integral over a region of the constant function 1 measures the area of the region.  If the region has uniform density 1, then the mass is the density times the area which equals the area.  What if the density is not constant.  Suppose that the density is given by the continuous function

Density  =  r(x,y)

In this case we can cut the region into tiny rectangles where the density is approximately constant.  The area of mass rectangle is given by

Mass  =  (Density)(Area)  =  r(x,y) Dx Dy

You probably know where this is going.  If we add all to masses together and take the limit as the rectangle size goes to zero, we get a double integral.

 Mass Let r(x,y) be the density of a lamina (flat sheet) R at the point (x,y).  Then the total mass of the lamina is the double integral

For three-dimensional solid

We define δ(x,y,z) to be the density (mass per unit volume) of an object occupying a region D in space. The integral over D gives us the mass of the object. To see why, imagine partitioning the object into n mass elements. And when summing these mass elements up, it is the total mass.

$M= \lim_{n\rightarrow\infty}\sum_{k=1}^n \Delta m_k =\lim_{n\rightarrow\infty}\sum_{k=1}^n \delta (x_k,y_k,z_k)\Delta V_k=\iiint_{a}^{b}\delta (x, y,z) dV$

The integral of δ(x,y,z) gives us the mass of the object.
$M=\iiint_{a}^{b}\delta dV$

where δ(x,y,z)=Density at point (x,y,z)

For two-dimensional plate

$M=\iint_{a}^{b}\delta dA$

Example

A rectangular metal sheet with 2  <  x  < 5  and 0  <  y  <  3 has density function

r(x,y)  =  x + y

Set up the double integral that gives the mass of the metal sheet.

Solution

We just have the integral

Moments and Center of Mass

We have seen in first year calculus that the moments about an axis are defined by the product of the mass times the distance from the axis.

Mx  =  (Mass)(y)        My  =  (Mass)(x)

If we have a region R with density function r(x,y), then we do the usual thing. We cut the region into small rectangles for which the density is constant and add up the moments of each of these rectangles. Then take the limit as the rectangle size approaches zero. This will give us the total moment.

 Definition of Moments of Mass and Center of Mass Suppose that r(x,y) is a continuous density function on a lamina R. Then the moments of mass are                                and if M is the mass of the lamina, then the center of mass is

Example

Set up the integrals that give the center of mass of the rectangle with vertices (0,0), (1,0),(1,1), and (0,1) and density function proportional to the square of the distance from the origin. Use a calculator or computer to evaluate these integrals.

Solution

The mass is given by

The moments are given by

These evaluate to

Mx  =  5k/12        and      My  =  5k/12

It should not be a surprise that the moments are equal since there is complete symmetry with respect to x and y. Finally, we divide to get

(x,y)  =  (5/8,5/8)

This tells us that the metal plate will balance perfectly if we place a pin at (5/8,5/8)

Moments of Inertia

We often call Mx and My the first moments. They have first powers of y and x in their definitions and help find the center of mass. We define the moments of inertia (or second moments) by introducing squares ofy and x in their definitions. The moments of inertia help us find the kinetic energy in rotational motion. Below is the definition

 Moments of Inertia Suppose that r(x,y) is a continuous density function on a lamina R. Then the moments of inertiaare

Exercise

Find the moments of inertia for the previous square metal plate.

First moment

The first moment of a 3-D solid region D about a coordinate plane is defined as the triple integral over D of the distance from a point(x,yz) in D to the plane multiplied by the density of the solid at that point.

First moments about the coordinate planes:

$M(yz)=\iiint_{a}^{b}\delta x\, dV$
$M(xz)=\iiint_{a}^{b}\delta y\,dV$
$M(xy)=\iiint_{a}^{b}\delta z \,dV$

The first moment about the y-axis is the double integral over the region R forming the 2-D plate of the distance from the axis multiplied by the density.

$M(y)=\iint_{a}^{b}\delta x\; dV$
$M(x)=\iint_{a}^{b}\delta y\; dV$

Center of mass

We defined center of mass located in x bar, y bar, z bar. Then it is found from the first moments:

$\bar{x} =\frac{M(y)}{M}$
$\bar{y} =\frac{M(x)}{M}$

Example

Find the center of mass of a solid of constant density Bbmmded below by the disk R: Xl +y2 :s 4 in the plane z = 0 and above by the paraboloid z=4- x2- y2.

$\text{Total Mass} = \int_0^1 \int_{x^2}^x 1 \ dy \ dx$

$= \int_0^1 \left. y \right |_{y=x^2}^{y=x} \ dx$

$= \int_0^1 (x-x^2) \ dx$

$= \left(\frac{x^2}{2}-\frac{x^3}{3} \right) |_0^1$

$= \frac{1}{6}$

1. ref 1
2. ref2
3. ref3

Contributors

• Shengqiao Luo (UCD)


text:
vogiathinh909
33

# A ball of mass 0.5 kg is released from rest at a height of 30 m. How fast is it going when it hits the ground? Acceleration due to gravity is g = 9.8 m/s2.

(2) Answers
Aleeah67

Assume you don't consider air friction. Then mgh = 1/2 mv^2 v = sqrt(2gh) = sqrt(2*9.8 * 30) = 24.25 m/s

WinzeeWoo

$Given:\\m=0.5kg\\h=30m\\g=9.8 \frac{m}{s^2} \\\\Find:\\v=?\\\\Solution:\\\\E_p=E_k\\\\mgh= \frac{mv^2}{2} \\\\2gh=v^2\Rightarrow v= \sqrt{2gh}\\\\v= \sqrt{2\cdot 9.8 \frac{m}{s^2} \cdot 30m} \approx24.25 \frac{m}{s}$

Add answer


text:
Problem 14.1b

A First Course in String Theory

14.1 Counting bosonic states

~~~

Let $N(n, k) = {n + k - 1 \choose k - 1}$, the number of ways to put $n$ indistinguishable balls into $k$ boxes.

p.318 “For open bosonic strings $\alpha' M^2 = N^\perp - 1$, …”

When $\alpha' M^2 = 3$, $N^\perp = 4$, the cases are:

1. four $a_1^\dagger$‘s:

$N(4,24) = 17550$

2. one $a_2^\dagger$ and two $a_1^\dagger$‘s:

$24 \times N(2,24) = 24 \times 300$

3. two $a_2^\dagger$‘s:

$N(2,24) = 300$

4. one $a_3^\dagger$ and one $a_1^\dagger$:

$24 \times 24 = 576$

5. one $a_4^\dagger$:

$24$

Total number of possible states for $N^\perp = 4$ is 25650.

— Me@2015-08-13 12:05:57 PM


text:
# Matching polynomial of a complete bipartite graph is a generalized Laguerre polynomial.

Consider a graph $G$ with $n$ vertices. Let $m_k$ be the number of $k$-edge matchings. (A matching in a graph is a set of edges without common vertices.) Several different types of matching polynomials have been defined, but consider the following definition.

\begin{equation*} M_G(x) = \sum_{0\leq k}(-1)^k m_k x^{n-2k} \end{equation*}

According to the wikipedia article, the matching polynomial for $G=K_{m,n}$ (a complete bipartite graph) is related to the generalized Laguerre polynomial $L_n^{\alpha}(x)$:

\begin{equation*} M_{K_{m,n}} = n! L_n^{(m-n)}(x^2) \end{equation*}

How can I prove it? Is there any reference (paper or textbook) so that I can derive this relation myself?


text:
# Is the function distance continuous?

And if not, what are the most common hypotheses (on open sets it induces, for example) under which distance is a continuous function?

-
@Renato: Are you talking about the distance function? – anonymous Oct 27 '10 at 16:27
@Renato: Please make your question clear! – anonymous Oct 27 '10 at 16:27
If you are asking whether the distance function $d:X\times X\to\mathbb R$ is continuous when $(X,d)$ is a metric space, then aswer is yes. You should try to prove it yourself; first do it for $\mathbb R$ with its usual metric, and then generalize. – Mariano Suárez-Alvarez Oct 27 '10 at 16:32
@Chandru1 yes, I'm talking about the distance function, sorry for the mistake. – Renato Oct 27 '10 at 16:33
@MarianoSuárez-Alvarez I was also trying the same question. But how to prove it using $\epsilon - \delta$ notation.Let $(x,y) \in X$ and $(x',y') \in X$ then whenever $||(x,y)-(x',y')|| \lt \delta$ then we have $|d(x,y)-d(x',y')| \lt \epsilon$.. right?? How to go ahead with this proof – Mathy Jun 25 '13 at 11:33

As Qiaochu points out $d(x,y)$ is continuous for fixed $x$. You may like to see this as well, as this is a familiar result in Topology.

• If $A$ is a non empty closed subset of a metric space $(X,d)$ then show that the function f on X given by $f(x)=d(x,A)$ is continuous.

Because $$| f(x) - f(y) | = | d(x,A) - d(y,A) | \leq d(x,y)$$.

This means that $f$ is uniformly continuous (use $\delta = \epsilon$ in any point)

Let $x$ and $y$ be points in $X$, and $p$ any point of $A$.

Then $d(x,p) \leq d(x,y) + d(y,p)$ (triangle inequality) and so $d(x,A) \leq d(x,y) + d(y,p)$ (as $d(x,A)$ is the infimum). But then $d(y,p) \geq d(x,A) - d(x,y)$ (for all $p$, obtained by subtracting from the previous ןinequality) so that $d(y,A) \geq d(x,A) - d(x,y)$ (as $d(y,A)$ is the infimum). So : $d(x,A) - d(y,A) \leq d(x,y)$.

Now reverse the roles of $x$ and $y$ to get $d(y,A) - d(x,A) \leq d(x,y)$.

-
where did you use the fact that A is closed? – GAJO Jan 28 '14 at 19:11
Why are we assuming that the metric on $\mathbb{R}$ is the standard one? – The Substitute Aug 31 '14 at 0:19
@GAJO I think $d(x,E)$ is continuous in $x$ for any nonempty subset $E$. – Fang Jing Oct 14 '14 at 20:29

Yes. The standard definition of the topology induced by a metric ensures this; in fact it's not hard to see that it's the coarsest topology such that $d(x, y)$ is continuous for fixed $x$.

-
Isn't it also the coarsest one for which $d$ itself is continuous? – Mariano Suárez-Alvarez Oct 27 '10 at 16:36


text:
# Toward Discourse Representation Via Pregroup Grammars

Abstract : Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is independent of the order of the associated logic. Lexical entries are read as expressions in a two sorted predicate logic with $\in$ and functional symbols. The parsing of a sentence defines a substitution that combines the expressions associated to the individual words. The resulting variable free formula is the translation of the sentence. It can be computed in time proportional to the parsing structure. Non-logical axioms are associated to certain words (relative pronouns, indefinite article, comparative determiners). Sample sentences are used to derive the characterizing formula of the DRS corresponding to the translation.
keyword :
Document type :
Journal articles

Cited literature [9 references]

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00137673
Contributor : Anne Preller <>
Submitted on : Wednesday, March 21, 2007 - 10:52:05 AM
Last modification on : Thursday, May 24, 2018 - 3:59:20 PM
Long-term archiving on: : Wednesday, April 7, 2010 - 12:06:52 AM

### Citation

Anne Preller. Toward Discourse Representation Via Pregroup Grammars. Journal of Logic, Language and Information, Springer Verlag, 2007, 16 (2 - 10849), pp.173-194. ⟨10.1007/s10849-006-°033-y⟩. ⟨lirmm-00137673⟩

Record views


text:
## POM (Princeton Ocean Model)

A simple-to-run yet powerful ocean modeling code to simulate a wide-range of problems, from small-scale coastal processes to global ocean climate change. POM is a sigma coordinate (terrain-following), free surface ocean model with embedded turbulence and wave sub-models, and wet-dry capability.

ocean modelingcoastal processessigma coordinatefree surfaceturbulencewave
414

#### Authorship

Affiliation:
Princeton University
Homepage:
View
Affiliation:
Princeton University
Homepage:
View
Is authorship not correct? Feed back

#### Classification(s)

Application-focused categoriesNatural-perspectiveOcean regions

#### Model Description

English {{currentDetailLanguage}} English

The Princeton Ocean Model[8] (POM) is a community general circulation numerical ocean model, that can be used to simulate and predict oceanic currents, temperatures, salinity and other water properties. The model code was originally developed in late 1970’s at Princeton University[4] and Analysis of Princeton[7] by Alan Blumberg and George Mellor with later contributions from other people. The model incorporates the Mellor-Yamada turbulence scheme developed in the early 1970’s by George Mellor and Ted Yamada; this turbulence sub–model is widely used by oceanic and atmospheric models. In the past, early computer ocean models such as the Bryan-Cox model (developed in the late 1960’s at the Geophysical Fluid Dynamics Laboratory, GFDL, later became the Modular Ocean Model1 , MOM)), which aimed mostly at coarse–resolution simulations of the large–scale ocean circulation, so there was still a need for a numerical model, that can handle high–resolution calculation of coastal ocean. The BlumbergMellor[8] model, which later became known as POM, thus included new features, such as free surface to handle tides, sigma vertical coordinates (i.e., terrain-following) to handle complex topographies and shallow regions, a curvilinear grid, to better handle coastlines and a turbulence scheme to handle vertical mixing. At the early 1980’s, the model was used primarily to simulate estuaries, such as the Hudson-Raritan Estuary (by Leo Oey) and the Delaware Bay (Boris Galperin), but also first attempts to use a sigma coordinate model, for basin-scale problems which were simulated with the coarse resolution model of the Gulf of Mexico (Blumberg and Mellor) and models of the Arctic Ocean (with the inclusion of ice-ocean coupling by Lakshmi Kantha and Sirpa Hakkinen). The principal attributes of the POM model are as follows: • It contains an embedded second moment turbulence closure sub-model to provide vertical mixing coefficients. • It is a sigma coordinate model in that the vertical coordinate is scaled on the water column depth. • The horizontal curvilinear orthogonal coordinates and an Arakava C differencing scheme. • The horizontal time differencing is explicit whereas the vertical differencing is implicit. This later eliminates time constraints for the vertical coordinate and permits the use of fine vertical resolution in the surface and bottom boundary layers. • The model is able to use free surface and a split time step. The external model portion of the model is two–dimensional and uses a short time step based on the CFL2 condition and the external wave speed. The internal mode is three–dimensional and uses a long time step based on the CFL condition and the internal wave speed.• Complete thermodynamics have been implemented. The turbulence closure sub-model is one that was introduced my George Mellor, 1973 and was significantly advanced in collaboration with Tetsuji Yamada (Mellor and Yamada, 1974; Mellor and Yamada, 1982). It is often cited in the literature as the Mellor and Yamada turbulence closure model. There are other versions of model in existence such as a non-Boussinesq3 version and a more general vertical coordinate version of which the sigma coordinate is a special case.

Model Domain
{{domain}}

Principles
{{principle}}
Incorporated Models
{{incorporatedModel}}
Model part of larger framework: {{metadata.design.framework}}
Incorporated Models
{{process}}

Inputs
{{input}}
Outputs
{{output}}

#### How to Cite

George Mellor, Alan Blumberg (2019). POM (Princeton Ocean Model), Model Item, OpenGMS, https://geomodeling.njnu.edu.cn/modelItem/4a741123-ef39-4149-87b9-225e7ff9d4a7

#### History

Last modifier :
zhangshuo
Last modify time :
2021-01-11
Modify times :
View History

#### Comment(s)

{{comment.date}}
{{comment.content}}
{{subComm.date}}
{{subComm.content}}

#### Authorship

Affiliation:
Princeton University
Homepage:
View
Affiliation:
Princeton University
Homepage:
View
Is authorship not correct? Feedback

#### History

Last modifier :
zhangshuo
Last modify time :
2021-01-11
Modify times :
View History

#### QR Code

• {{curRelation.name}}
{{curRelation.name}}

{{curRelation.overview}}
{{curRelation.author.join('; ')}}
{{curRelation.journal}}

You can link related {{typeName}} from repository to this model item, or you can create a new {{typeName.toLowerCase()}}.

Related Items
{{ props.row.description }}
{{ props.row.description }}
Related Items
{{props.row.name}}

You can link resource from repository to this model item, or you can create a new {{typeName.toLowerCase()}}.

{{ props.row.description }}
{{ props.row.description }}
Drop the file here, orclick to upload.
File size should not exceed 10m.
Select From My Space

These authorship information will be submitted to the contributor to review.

Cancel Submit
Model Classifications
Cancel Submit
{{ item.label }} {{ item.value }}
{{props.row.localName}}
Model Name :
Cancel Submit
Name:
Version:
Model Type:
Model Domain:
Scale:
Purpose:
Principles:
Incorporated models:

Model part of

larger framework

Process:
Information:
Initialization:
Hardware Requirements:
Software Requirements:
Inputs:
Outputs:
Cancel Submit
Title Author Date Journal Volume(Issue) Pages Links Doi Operation
Cancel Submit

Yes, this is it Cancel

OK
Cancel Confirm
Model Classifications 1
Model Classifications 2
Title Author Date Journal Volume(Issue) Pages Links Doi Operation

#### NEW

Name:
Affiliation:
Email:
Homepage:

Yes, this is it Cancel

Confirm
path
:
/{{path.label}}
search results of '{{searchContentShown}}'

#### No content to show

{{item.label}}

.

{{item.suffix}}

.{{item.suffix}}

{{item.fileName}}.{{item.suffix}}

Copy
Delete
Rename
/{{path.label}}
Change
/{{path.label}}
Select File
Cancel Confirm
path
:
/{{path.label}}
/..
Cancel Confirm
{{ node.label }}
##### You have select  {{multipleSelection.length+multipleSelectionMyData.length}} data .
• Output Data
• {{item.computableName}}@{{formatDate(item.runTime)}}
{{scope.row.type}}
{{ scope.row.tag }}