text:
Talk:Algorithm Implementation/Sorting/Shell sort

Transwiki from Wikipedia
This page was created with content from the English Wikipedia article Shell sort.

Edit history
* (cur) (last) 18:51, 17 August 2006 Booyabazooka (Talk | contribs) (transwiki code to wikibooks) * (cur) (last) 07:59, 17 August 2006 Bluebot (Talk | contribs) (not a stub) * (cur) (last) 08:06, 21 July 2006 MCiura (Talk | contribs) m (→The Gap sequence) * (cur) (last) 09:43, 7 July 2006 65.93.16.184 (Talk) (→Shell sort in Haskell) * (cur) (last) 09:42, 7 July 2006 65.93.16.184 (Talk) (→Shell sort in Haskell) * (cur) (last) 16:44, 2 July 2006 Booyabazooka (Talk | contribs) (→The Gap sequence - swap table png with svg) * (cur) (last) 11:07, 19 June 2006 Deco (Talk | contribs) (Unlink gap insertion sort (see talk page), remove redundant sentence) * (cur) (last) 20:26, 18 June 2006 Deco (Talk | contribs) (→The Gap sequence - Prettier big O)   * (cur) (last) 20:23, 18 June 2006 Deco (Talk | contribs) (Fix inconsistency) * (cur) (last) 09:38, 12 June 2006 128.112.139.194 (Talk) (→The Gap sequence) * (cur) (last) 05:48, 12 June 2006 A5b (Talk | contribs) m (link to ru:~) * (cur) (last) 18:41, 31 May 2006 Deco (Talk | contribs) (My mistake, it was right) * (cur) (last) 18:09, 31 May 2006 Deco (Talk | contribs) (→Shell sort in C - Fix bug in C impl (pretty sure this is what was intended)) * (cur) (last) 17:20, 31 May 2006 Deco (Talk | contribs) m (→The Gap sequence - Image is tiny and illegible) * (cur) (last) 17:19, 31 May 2006 Deco (Talk | contribs) (Add reference) * (cur) (last) 17:16, 31 May 2006 Deco (Talk | contribs) (Shell sort is better in the worst case, not just the average case) * (cur) (last) 15:06, 28 May 2006 24.10.235.160 (Talk) (→The Gap sequence) * (cur) (last) 15:05, 28 May 2006 24.10.235.160 (Talk) (→The Gap sequence) * (cur) (last) 14:04, 26 May 2006 69.156.155.124 (Talk) (→Shell sort in Haskell - add spaces to join blocks) * (cur) (last) 12:59, 26 May 2006 200.17.202.52 (Talk) (→Shell sort in C)   * (cur) (last) 12:58, 26 May 2006 200.17.202.52 (Talk) (→Shell sort in C)    * (cur) (last) 16:16, 25 May 2006 200.82.48.6 (Talk) (→Shell sort in C)    * (cur) (last) 16:14, 25 May 2006 200.82.48.6 (Talk) (→Shell sort in C)    * (cur) (last) 16:13, 25 May 2006 200.82.48.6 (Talk) (→Shell sort in C)    * (cur) (last) 09:44, 23 May 2006 Bluebot (Talk | contribs) (Unicodifying using AWB) * (cur) (last) 04:37, 13 May 2006 83.154.85.211 (Talk) * (cur) (last) 19:03, 11 May 2006 Booyabazooka (Talk | contribs) (Category:Comparison sorts) * (cur) (last) 22:46, 10 May 2006 69.156.155.124 (Talk) (→Example Implementations) * (cur) (last) 17:53, 10 May 2006 69.156.155.124 (Talk) (→Shell sort in Haskell) * (cur) (last) 17:51, 10 May 2006 69.156.155.124 (Talk) (→Shell sort in Haskell) * (cur) (last) 17:50, 10 May 2006 69.156.155.124 (Talk) * (cur) (last) 01:44, 24 April 2006 68.169.41.238 (Talk) (mistake by previous editor) * (cur) (last) 00:50, 24 April 2006 128.211.201.44 (Talk) (→fixed swap in the for(j=i-gap..) loop) * (cur) (last) 00:40, 11 April 2006 203.167.156.163 (Talk) (→Example implementation in C)   * (cur) (last) 00:39, 11 April 2006 203.167.156.163 (Talk) (→Example implementation in C)    * (cur) (last) 16:01, 27 March 2006 MacsBug (Talk | contribs) m (Fixed typo) * (cur) (last) 21:21, 22 March 2006 Jwlee (Talk | contribs) (→External links - Last link is the same as the third one) * (cur) (last) 16:44, 11 March 2006 Sigmalmtd (Talk | contribs) (Added Gap sequence, References) * (cur) (last) 18:56, 8 March 2006 129.174.185.10 (Talk) (→External links) * (cur) (last) 17:26, 6 March 2006 Udo.bellack (Talk | contribs) m (links to bubble_sort, array) * (cur) (last) 18:00, 2 March 2006 138.86.177.203 (Talk) * (cur) (last) 05:44, 2 March 2006 MCiura (Talk | contribs) m (→Example implementation in C)   * (cur) (last) 22:05, 1 March 2006 71.114.239.187 (Talk) (→External links) * (cur) (last) 22:02, 1 March 2006 71.114.239.187 (Talk) * (cur) (last) 02:09, 14 February 2006 Damian Yerrick (Talk | contribs) (→Example implementation in C - The number of elements is NOT sizeof(gaps); it's sizeof(gaps)/sizeof(gaps[0]). Also fix the --j problem in shellSortPhase) * (cur) (last) 19:52, 13 February 2006 Donhalcon (Talk | contribs) m (→External links - (stub-sort)) * (cur) (last) 17:04, 11 February 2006 Sf222 (Talk | contribs) (→Example implementation in C - code correction (but check it please)) * (cur) (last) 00:37, 6 February 2006 Damian Yerrick (Talk | contribs) (→Example implementation in C - correct the for loop) * (cur) (last) 23:16, 5 February 2006 Damian Yerrick (Talk | contribs) (1. it's an insertion sort, not a bubble sort; 2. add a sample implementation; 3. cleanup text) * (cur) (last) 14:01, 2 February 2006 198.182.56.5 (Talk) * (cur) (last) 11:30, 31 December 2005 71.111.219.4 (Talk) * (cur) (last) 15:42, 23 December 2005 Deco (Talk | contribs) (Stub in wrong place) * (cur) (last) 14:52, 23 December 2005 CesarB (Talk | contribs) (restore external links/categories/interwiki) * (cur) (last) 14:50, 23 December 2005 CesarB (Talk | contribs) (Add copyvio source as external link) * (cur) (last) 14:28, 23 December 2005 CesarB (Talk | contribs) (reverting the copyvio turned the article into a stub; tagging as ) * (cur) (last) 14:28, 23 December 2005 CesarB (Talk | contribs) (clearing copyvio; copyvio was introduced via merge from shellsort on 2003-05-02; reverting to version of 2002-12-30) * (cur) (last) 13:57, 15 December 2005 Smack (Talk | contribs) * (cur) (last) 10:21, 9 December 2005 71.51.8.39 (Talk) (Add a reference to a sequence of Pratt and Hibbard) * (cur) (last) 09:10, 29 November 2005 210.176.196.210 (Talk) (→Analysis) * (cur) (last) 22:23, 28 November 2005 Deco (Talk | contribs) (Link comparison sort) * (cur) (last) 11:20, 15 November 2005 FlaBot (Talk | contribs) m (robot Adding: pl) * (cur) (last) 17:05, 2 October 2005 Fawcett5 (Talk | contribs) (→Analysis - dab Robert Sedgewick (computer scientist)) * (cur) (last) 18:31, 26 September 2005 Clemmy (Talk | contribs) (rv vandalism) * (cur) (last) 18:25, 26 September 2005 129.123.104.8 (Talk) (→Using Fibonacci numbers) * (cur) (last) 12:18, 31 August 2005 Bubba73 (Talk | contribs) (→Analysis - usually not...) * (cur) (last) 12:29, 30 August 2005 Paranoid (Talk | contribs) m (→Analysis) * (cur) (last) 12:28, 30 August 2005 Paranoid (Talk | contribs) (→Analysis - evolution) * (cur) (last) 19:03, 13 August 2005 M7bot (Talk | contribs) m (robot Adding: pt) * (cur) (last) 22:34, 15 July 2005 Bubba73 (Talk | contribs) (→Analysis - add Tokuda sequence of gaps) * (cur) (last) 13:50, 14 July 2005 RobotE (Talk | contribs) m (robot Modifying: lt) * (cur) (last) 23:00, 12 July 2005 Mathbot (Talk | contribs) (Robot-assisted spelling. See User:Mathbot/Logged misspellings for changes.) * (cur) (last) 01:59, 12 July 2005 Bubba73 (Talk | contribs) (→Analysis - links to sequences) * (cur) (last) 19:23, 11 July 2005 Bubba73 (Talk | contribs) (→Analysis - average cases for two sequences) * (cur) (last) 19:06, 11 July 2005 Bubba73 (Talk | contribs) m (→References - updated Knuth ref to 2nd edition, which has much more recent analysis, etc) * (cur) (last) 16:30, 25 June 2005 Mathbot (Talk | contribs) (Robot-assisted spelling. See User:Mathbot/Logged misspellings for changes.) * (cur) (last) 05:01, 25 June 2005 Pne (Talk | contribs) m (→Analysis - See also this entry in OEIS's sequences index for a list of sequences used in shell sorting.) * (cur) (last) 05:00, 25 June 2005 Pne (Talk | contribs) m (→Analysis - OEIS sequence number) * (cur) (last) 22:44, 13 June 2005 Enochlau (Talk | contribs) m (→Using fibonacci numbers) * (cur) (last) 05:29, 13 June 2005 Enochlau (Talk | contribs) m (→Using a list of shell sizes - readability of code) * (cur) (last) 08:03, 11 May 2005 Clemmy (Talk | contribs) (Revert to Revision as of 15:36, 9 May 2005; please use the sandbox or your user page to try out formatting.) * (cur) (last) 06:19, 11 May 2005 61.246.96.88 (Talk) (→Example) * (cur) (last) 10:36, 9 May 2005 80.178.225.28 (Talk) (→Using fibonacci numbers - deleted some smartarse comment left by a previous writer) * (cur) (last) 06:51, 9 May 2005 MCiura (Talk | contribs) m (→Analysis) * (cur) (last) 14:58, 2 May 2005 P3d0 (Talk | contribs) m (→Example - copy edit and wikify) * (cur) (last) 14:53, 2 May 2005 P3d0 (Talk | contribs) m (Link Marlene Metzner) * (cur) (last) 22:39, 30 April 2005 FlaBot (Talk | contribs) m (warnfile Modifying:es) * (cur) (last) 20:41, 13 April 2005 143.107.183.232 (Talk) (→Example) * (cur) (last) 13:22, 12 April 2005 221.124.106.12 (Talk) (→Example) * (cur) (last) 16:46, 11 April 2005 Dinoen (Talk | contribs) m (+it Interlink) * (cur) (last) 10:46, 1 April 2005 62.134.117.1 (Talk) (minor correction) * (cur) (last) 10:24, 1 April 2005 62.134.112.128 (Talk) (1. Optimized the Java code. 2. Recommended squares of Fibonacci numbers. 3. Deleted the slow, obscure C code. (Better port the Java code to C! 2 trivial changes in line 1 and 3 only: move the [].)) * (cur) (last) 21:37, 29 March 2005 Clemmy (Talk | contribs) m (grammar, style) * (cur) (last) 06:48, 21 March 2005 Knutux (Talk | contribs) m (interwiki: +lt) * (cur) (last) 00:59, 8 March 2005 Daniel Quinlan (Talk | contribs) m (don't link Creative Computing) * (cur) (last) 00:59, 8 March 2005 Daniel Quinlan (Talk | contribs) m (don't link Creative Computing) * (cur) (last) 23:37, 7 March 2005 Daniel Quinlan (Talk | contribs) * (cur) (last) 17:16, 1 January 2005 LiDaobing (Talk | contribs) m   * (cur) (last) 18:35, 31 December 2004 Kevin Mulligan (Talk | contribs) (Reverted blanking by anon user) * (cur) (last) 18:33, 31 December 2004 130.113.219.244 (Talk) * (cur) (last) 10:41, 17 December 2004 193.0.83.59 (Talk) (Added reference/bibitem to D.E. Knuth 'Sorting and Searching'. Should references be in alphabetical order?) * (cur) (last) 10:21, 17 December 2004 193.0.83.59 (Talk) (→Analysis) * (cur) (last) 05:35, 15 December 2004 80.58.22.44 (Talk) (→Using a list of shell sizes in C Edit By Z80user) * (cur) (last) 03:42, 15 December 2004 80.58.22.42 (Talk) (→Using a list of shell sizes in C Edit By Z80user) * (cur) (last) 04:56, 14 December 2004 Jdforrester (Talk | contribs) m (Reverted edits by 213.139.47.29 to last version by 80.58.22.42) * (cur) (last) 04:54, 14 December 2004 213.139.47.29 (Talk) (→Implementations) * (cur) (last) 17:02, 4 December 2004 80.58.22.42 (Talk) * (cur) (last) 20:04, 26 November 2004 217.251.190.24 (Talk) (added V. Pratt as inventor of the first h-sequence) * (cur) (last) 17:39, 24 November 2004 Oberiko (Talk | contribs) m (Reverted edits by 204.62.200.25 to last version by Damian Yerrick) * (cur) (last) 17:38, 24 November 2004 204.62.200.25 (Talk) (→Implementations) * (cur) (last) 17:36, 24 November 2004 204.62.200.25 (Talk) (→Using fibonacci numbers) * (cur) (last) 23:41, 20 November 2004 Damian Yerrick (Talk | contribs) (→Analysis - Clarify what is the worst case; does anybody have the Big O value for Knuth's sequence?) * (cur) (last) 09:48, 30 October 2004 145.254.166.2 (Talk) (linkified intra-page reference) * (cur) (last) 09:15, 21 October 2004 Robbot (Talk | contribs) m (robot Adding:es) * (cur) (last) 02:27, 5 October 2004 Mark T (Talk | contribs) (Sedgewick sequence; rewording of Fibonacci sequence) * (cur) (last) 02:20, 5 October 2004 Mark T (Talk | contribs) (Sedgewick sequence; rewording of Fibonacci sequence) * (cur) (last) 16:10, 3 August 2004 66.203.175.179 (Talk) (Removed "penis" from article text. (Very funny.)) * (cur) (last) 10:40, 3 August 2004 140.247.244.244 (Talk) (→Basic concept) * (cur) (last) 13:21, 31 July 2004 Carribeiro (Talk | contribs) m (→My Favourite - Fixed a link to the golden ratio entry) * (cur) (last) 22:43, 1 July 2004 Maximus Rex (Talk | contribs) m   * (cur) (last) 10:24, 30 June 2004 137.18.255.35 (Talk) (→Analysis) * (cur) (last) 11:36, 15 June 2004 82.116.73.17 (Talk) (added link to "Fibonacci number") * (cur) (last) 11:26, 15 June 2004 82.116.73.17 (Talk) (Changed consistent misspelling 'fibbonachi' to 'fibonacci) * (cur) (last) 23:09, 10 June 2004 203.10.231.231 (Talk) (→Implementations) * (cur) (last) 23:08, 10 June 2004 203.10.231.231 (Talk) (→Implementations) * (cur) (last) 23:03, 10 June 2004 203.10.231.231 (Talk) (Golden Ratio) * (cur) (last) 10:11, 30 May 2004 Timwi (Talk | contribs) (Category:Sort algorithms) * (cur) (last) 10:52, 15 May 2004 Puckly (Talk | contribs) m (whoops) * (cur) (last) 10:51, 15 May 2004 Puckly (Talk | contribs) m (+nl:) * (cur) (last) 00:05, 8 May 2004 Jaredwf (Talk | contribs) m   * (cur) (last) 23:02, 11 April 2004 Dysprosia (Talk | contribs) m (fix [[o)    * (cur) (last) 23:01, 11 April 2004 Dysprosia (Talk | contribs) m (whoops, fix pip)    * (cur) (last) 23:01, 11 April 2004 Dysprosia (Talk | contribs) (no, that's Java. C does not say int[] a, it says int a[])    * (cur) (last) 22:57, 11 April 2004 Dmercer (Talk | contribs) m (=Implementations= Sample sort is written in C, not Java.)    * (cur) (last) 16:33, 29 February 2004 Deco (Talk | contribs) m (Fixed external links)    * (cur) (last) 16:33, 29 February 2004 Deco (Talk | contribs) (Oops, removed duplicated sections)    * (cur) (last) 16:32, 29 February 2004 Deco (Talk | contribs) (Sectioned, made code less tall, minor editing, added link)    * (cur) (last) 17:51, 20 February 2004 213.157.5.169 (Talk) (de)    * (cur) (last) 14:01, 15 February 2004 Timwi (Talk | contribs) m    * (cur) (last) 18:00, 21 January 2004 AlexPlank (Talk | contribs) (of the oldest sorting algorithms. It was invented in 1959 by Donald L. Shell [Sh].)    * (cur) (last) 08:23, 31 October 2003 Dysprosia (Talk | contribs) m (no, this is java, arrays are declared like that in java)    * (cur) (last) 08:21, 31 October 2003 Dysprosia (Talk | contribs) m (fix fmt)    * (cur) (last) 08:18, 31 October 2003 203.200.40.199 (Talk) (The person who submitted failed to compile the program, it is full of compile errors, array declarations of []a and []cols is changed, added semicolon at the end of cols initialization - Manik Raina)    * (cur) (last) 09:02, 9 August 2003 219.98.152.107 (Talk) (+ja)    * (cur) (last) 04:35, 24 July 2003 68.100.96.143 (Talk)    * (cur) (last) 03:03, 9 May 2003 Hephaestos (Talk | contribs) m    * (cur) (last) 13:12, 2 May 2003 Hephaestos (Talk | contribs) (moved info from old Shellsort)    * (cur) (last) 03:14, 2 May 2003 217.1.45.137 (Talk)    * (cur) (last) 03:13, 2 May 2003 217.1.45.137 (Talk)    * (cur) (last) 13:43, 30 December 2002 24.112.162.82 (Talk) m (Its/it's typo)    * (cur) (last) 05:37, 21 December 2002 Maveric149 (Talk | contribs) m (bold and wiki)    * (cur) (last) 19:38, 18 December 2002 Graue (Talk | contribs) m (Helpful links added, exponent fixed)    * (cur) (last) 16:22, 3 November 2002 128.8.80.69 (Talk)    * (cur) (last) 16:22, 3 November 2002 128.8.80.69 (Talk)    * (cur) (last) 01:59, 29 August 2002 211.28.96.44 (Talk)

Algorithm question
First of all i think that instead of: for (j = i - gap; j >= 0 && a[j] > value; --j) there should be for (j = i - gap; j >= 0 && a[j] > value; j-=gap)

The code still yelds the correct result beacause in the final step gap=1 and the alg does an insert sort.... But in terms of complexity it won't act well

Secondly i think the algorithm should also be explained in words, most of the time this helps a lot... A similar explanation like the one in the first link of the external links section would be great. I will insert it if you guys don't mind.
 * I agree with your second point. However, your first point is incorrect; if we were to move j by gap, we would only sort one column of the matrix containing the list rearranged into gap columns, so the sort would not be effective. This is crucial. Deco 00:34, 19 June 2006 (UTC)


text:
User:Taida

Hello

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User:Taida


text:
User talk:Ptkfgs~enwikibooks

Backgammon
Hi,

no big, just leave a link to the history page... preferably to the historical version you used. -- SB_Johnny | talk 00:22, 18 August 2006 (UTC)

 * wow... went back to see, and already done!-- SB_Johnny | talk 00:31, 18 August 2006 (UTC)

 * Nope, that kind of duplication is exactly what's in order... in this case it's a how-to fork, which isn't allowed on WP, but no problem on wikibooks. -- SB_Johnny | talk 09:01, 18 August 2006 (UTC)

Image copyright problem with Image:Bg sg w1.png
Thanks for uploading Image:Bg sg w1.png. The Wikimedia Foundation is very careful about the images included in Wikibooks because of copyright law, and requires that we maintain a strict copyright policy. The image that may soon be deleted unless we can determine the copyright holder and status.

The copyright holder is usually the creator, the creator's employer, or the last person who was transferred ownership rights. Copyright information on images is signified using copyright templates. The three basic license types on Wikibooks are open content, public domain, and fair use. Find the appropriate template in Image copyright tags and place it on the image page like this:.

Please signify the copyright information on any other images you have uploaded or will upload. Remember that images without this important information or giving false information can be deleted by an administrator. If you have any questions, feel free to contact me, or ask another Wikibookian at the help desk. Thank you. (BTW, the image copyright status is unclear because it is not clear what game the screenshot comes from. If that could be provided, then the GPL-status could be double-checked. )  Cheers, Iamunknown 08:52, 15 June 2007 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Ptkfgs. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Ptkfgs~enwikibooks that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:36, 17 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 05:23, 19 April 2015 (UTC)

title: User talk:Ptkfgs~enwikibooks


text:
Talk:Backgammon/History

This section is adapted from the article backgammon from the English Wikipedia. It is based on this revision from August 17, 2006. Ptkfgs 00:27, 18 August 2006 (UTC)

I can't find the jurnal from the article
The wiki page links to a broken link (iranian.ws [3]) and i cant find any other sources for backgammon being ~5000 years old. Can anyone more skilled and knowledgeable than me pleas look into the topic?

title: Talk:Backgammon/History


text:
Talk:Backgammon/Play

This module has been adapted from the article backgammon at the English Wikipedia. It is based on this revision from August 11, 2006. Ptkfgs 00:29, 18 August 2006 (UTC)

title: Talk:Backgammon/Play


text:
Talk:Backgammon/Openings

This module has been adapted from the article backgammon opening theory at the English Wikipedia. It is based on this revision from August 7, 2006. Ptkfgs 00:33, 18 August 2006 (UTC)

title: Talk:Backgammon/Openings


text:
Talk:Backgammon/Glossary

This module has been adapted from the article backgammon glossary at the English Wikipedia. It is based on this revision from August 8, 2006. Ptkfgs 00:34, 18 August 2006 (UTC)

title: Talk:Backgammon/Glossary


text:
User:Emc2

Please see my page on English Wikipedia.

title: User:Emc2


text:
Talk:Adventist Youth Honors Answer Book/Health and Science/Brain and Behavior

If you're going to use the svg version of the human eye diagram, please add a key indicating what each letter represents. Otherwise, use the diagram with the annotations in English.


text:
Statics/Moment of Inertia (contents)

The moment of inertia can be defined as the second moment about an axis and is usually designated the symbol I. The moment of inertia is very useful in solving a number of problems in mechanics. For example, the moment of inertia can be used to calculate angular momentum, and angular energy. Moment of inertia is also important in beam design.

Shape moment of inertia for flat shapes
The area moment of inertia takes only shape into account, not mass.

 * It can be used to calculate the moment of inertia of a flat shape about the x or y axis when I is only important at one cross-section.

$$ I_x=\int y^2\,dA$$

$$ I_y=\int x^2\,dA$$

$$ I_z =\int r^2\,dA$$

Because, for flat shapes, $$ r^2=x^2 + y^2$$ the following is true $$ I_z = I_x + I_y $$

The shape moment of inertia of the cross-section of a beam is used in Structural Engineering in order to find the stress and deflection of the beam.

Shape moment of inertia for 3D shapes

For more shapes see Mass Moments Of Inertia Of Common Geometric Shapes.

Mass moment of inertia
The mass moment of inertia takes mass into account. The mass moment of inertia of a point mass about a reference axis is equal to mass multiplied by the square of the distance from that point mass to the reference axis:

$$ I_{point mass} = r^2 m \,$$

The metric units are kg*m^2.

The mass moment of inertia of any body of mass rotating around any axis is equal to the sum of the mass moment of inertia of each of the particles of that body:

$$ I_m = \sum r_i^2 m_i$$

Rather than adding up each particle individually, sometimes we can take a mathematical shortcut by integrating over all the particles:

$$ I_m = \int r^2 \,dm$$

Radius of gyration
The radius of gyration is the radius at which you could concentrate the entire mass to make the moment of inertia equal to the actual moment of inertia. If the mass of an object was 2kg, and the moment of inertia was $$18kg*m^2$$, then the radius of gyration would be 3m. In other words, if all of the mass was concentrated at a distance of 2m from the axis, then the moment of inertia would still be $$18kg*m^2$$. Radius of gyration is represented with a k.

$$k=\sqrt{I/m}\,$$

The formula for the area radius of gyration replaces the mass with area.

$$k=\sqrt{I/A}\,$$

Parallel axis theorem
If the moment of inertia is known about an axis that runs through the center of mass, then the moment of inertia about any parallel axis is given by,

$$I_{parallel-axis}=I_{center\,of\,mass}+md^2$$

where d is the distance between the two axis of rotation.

title: Statics/Moment of Inertia (contents)


text:
User:Homer (usurped)~enwikibooks

Masterhomer on en.wikipedia

title: User:Homer (usurped)~enwikibooks


text:
Kinyarwanda/Nouns

Noun Classes
Kinyarwanda has a number of different noun classes.

Sing./Pl.

u-mu-/a-ba-

u-mu-/i-mi-

i-(ri)-/a-ma-

i-ki- (i-gi-)/i-bi-

i-n-/i-n-

u-ru-/i-bi-

a-ka-/u-tu-

u-bu-/u-bu-

u-ku-/a-ma-

a-ha-/a-ha-

When proceeded by a demonstrative, a the first vowel prefix is dropped. (e.g. umu --> mu) The u-mu-/a-ba- group is used for words representing humans.

title: Kinyarwanda/Nouns


text:
Kinyarwanda/Verbs

Verbs
All Kinyarwanda verb infinitives begin with 'gu-' or 'ku-' (morphed into 'gw-' or 'kw-' before vowels). To conjugate, the infinitive prefix is removed and a prefix agreeing with the subject takes its place. Then a tense infix can be inserted.

Noun Prefix | Subject Prefix

Sing./Pl. | Sing./Pl.

u-mu-/a-ba- | a-/ba-

u-mu-/i-mi- | u-/i-

i-(ri)-/a-ma- | ri-/a-

i-ki- (i-gi-)/i-bi- | ki- (morphs to cy- before vowels)/bi-

i-n-/i-n- | i-/zi-

u-ru-/i-bi- | ru-/bi-

a-ka-/u-tu- | ka-/tu-

u-bu-/u-bu- | bu-/bu-

u-ku-/a-ma- | ku-/a-

a-ha-/a-ha- | ha-/ha-

The prefixes for pronouns are as follows.

I = n-

you (sing.) = mu-

he = y-/a-

she = y-/a-

we = tu-

you (pl.) = u-

they (human) = ba-

Tense markers include the following.

-Ø- | Present

-ra- (morphs to -da- when preceded by 'n' | Present Progressive - to be doing

-za- | Future - will do

-racya- | to still be doing

The past tense can be formed by using the present and present progressive infixes and modifying the aspect marker suffix.

title: Kinyarwanda/Verbs


text:
Java Programming/Unchecked Exceptions

Unchecked, uncaught or runtime exceptions are exceptions that can be thrown without being caught or declared:

...however, you can still declare and catch such exceptions. Runtime exceptions are not business exceptions. They are usually related to hard-coded issues like data errors, arithmetic overflow, divide by zero etc. In other words, errors that can't be worked around nor anticipated. The most famous (and feared) runtime exception is the.

A runtime exception must be or inherit from the  class or the   class.

Sometime it is desirable to catch all exceptions for logging purposes, then throw them back in. For example, in servlet programming when an application server calls the server, we want to monitor that no exceptions happened during the serving of the request. The application has its own logging separate from the server logging so the runtime exceptions would just go through without being detected by the application. The following code checks all exceptions, logs them and throws them back again.

In the above code, all business logic exception are handled in the  method. Runtime exceptions are caught for logging purposes, and then thrown back to the server to be handled.

title: Java Programming/Unchecked Exceptions


text:
Java Programming/Checked Exceptions

A checked exception is a type of exception that must be either caught or declared in the method in which it is thrown. For example, the  is a checked exception. To understand what a checked exception is, consider the following code:

This code won't compile because it can throw a checked exception. The compilation error can be resolved in either of two ways: By catching the exception and handling it, or by declaring that the exception can be thrown using the keyword.

In the Java class hierarchy, an exception is a checked exception if it inherits from, but not from   or. All the application or business logic exceptions should be checked exceptions.

It is possible that a method declares that it can throw an exception, but actually it does not. Still, the caller has to deal with it. The checked exception declaration has a domino effect. Any methods that will use the previous method will also have to handle the checked exception, and so on.

So the compiler for the Java programming language checks, at compile time, that a program contains handlers for all application exceptions, by analyzing each method body. If, by executing the method body, an exception can be thrown to the caller, that exception must be declared. How does the compiler know whether a method body can throw an exception? That is easy. Inside the method body, there are calls to other methods; the compiler looks at each of their method signature, what exceptions they declared to throw.

Why Force Exception Handling?
This may look boring to the developer but it forces them to think about all the checked exceptions and increase the code quality. This compile-time checking for the presence of exception handlers is designed to make the application developer life easier. To debug whether a particular thrown exception has a matching catch would be a long process. In conventional languages like C, and C++, a separate error handling debugging were needed. In Java we can be sure that when an application exception is thrown, that exception somewhere in the program is handled. In C, and C++, that has to be tested. In Java that does not need to be tested, so the freed up time can be used for more meaningful testing, testing the business features.

What Exceptions can be Declared when Overriding a Method?
The checked exception classes specified after the keyword are part of the contract between the implementer and user. An overriding method can declare the same exceptions, subclasses or no exceptions.

What Exceptions can be Declared when Implementing an Interface?
JAVA 1.8 onwards: When interfaces are involved, the implementation declaration may skip a throws-clause but if one wish to have then should be compatible with the interface declarations. In other words, the implementation should throw the declared exception or it's sub-type or no exception.

Prior to Java 1.8: The implementer must declare same exception or its subclass.

title: Java Programming/Checked Exceptions


text:
Java Programming/Overloading Methods and Constructors

Method overloading
In a class, there can be several methods with the same name. However they must have a different signature. The signature of a method is comprised of its name, its parameter types and the order of its parameters. The signature of a method is not comprised of its return type nor its visibility nor the exceptions it may throw. The practice of defining two or more methods within the same class that share the same name but have different parameters is called overloading methods.

Methods with the same name in a class are called overloaded methods. Overloading methods offers no specific benefit to the JVM but it is useful to the programmer to have several methods do the same things but with different parameters. For example, we may have the operation  represented as two methods with the same name, but different input parameter types:

One type can be the subclass of the other:

Although both methods would be fit to call the method with the  parameter, it is the method with the nearest type that will be called instead. To be more accurate, it will call the method whose parameter type is a subclass of the parameter type of the other method. So,  will output. Beware! The parameter type is defined by the declared type of an object, not its instantiated type!

The following two method definitions are valid

because the type order is different. If both input parameters were type String, that would be a problem since the compiler would not be able to distinguish between the two:

The compiler would give an error for the following method definitions as well:

Note, the return type is not part of the unique signature. Why not? The reason is that a method can be called without assigning its return value to a variable. This feature came from C and C++. So for the call:

the compiler would not know which method to call. It is also the case for the thrown exceptions.

Question 4.6: Which methods of the  class will cause compile errors?

The,   and   methods will cause compile errors. The  methods cannot co-exist because they have the same signature (remember, return type is not part of the signature). The  methods cannot co-exist because the names of the parameters are not part of the signature. The  methods cannot co-exist because the visibility of the methods are not part of the signature. The  methods can co-exist, because they have different method signatures.

Variable Argument
Instead of overloading, you can use a dynamic number of arguments. After the last parameter, you can pass optional unlimited parameters of the same type. These parameters are defined by adding a last parameter and adding  after its type. The dynamic arguments will be received as an array:

The above method can be called with a dynamic number of arguments, for example:

This feature was not available before Java 1.5.

Constructor overloading
The constructor can be overloaded. You can define more than one constructor with different parameters. For example:

In the code listing 4.12, we defined two constructors, one with no input parameter, and one with one input parameter. You may ask which constructor will be called. Its depends how the object is created with the keyword. See below:

In the code section 4.29, we created two objects from the same class, or we can also say that  and   both have the same type. The difference between the two is that in the first one the  field is not initialized, in the second one that is initialized to. A constructor may also be called from another constructor, see below:

In the code listing 4.13, the constructor with no input parameter calls the other constructor with the default initial value. This call must be the first instruction of a constructor or else a compiler error will occur. The code gives an option to the user, to create the object with the default value or create the object with a specified value. The first constructor could have been written using the keyword as well:

Such a call reduces the code repetition.

Method overriding
To easily remember what can be done in method overriding, keep in mind that all you can do in an object of a class, you can also do in an object of a subclass, only the behavior can change. A subclass should be covariant.

Although a method signature has to be unique inside a class, the same method signature can be defined in different classes. If we define a method that exists in the super class then we override the super class method. It is called method overriding. This is different from method overloading. Method overloading happens with methods with the same name but different signature. Method overriding happens with methods with the same name and same signature between inherited classes.

The return type can cause the same problem we saw above. When we override a super class method the return type also must be the same. If that is not the same, the compiler will give you an error.

Beware! If a class declares two public methods with the same name, and a subclass overrides one of them, the subclass still inherits the other method. In this respect, the Java programming language differs from C++.

Method overriding is related to dynamic linking, or runtime binding. In order for the Method Overriding to work, the method call that is going to be called can not be determined at compilation time. It will be decided at runtime, and will be looked up in a table.

In the code section 4.31, the expression at line 3 is true if it is executed during a morning and false if it is executed during an afternoon. Thus, the instance of  will be a   or a   depending on the execution time. So it is impossible to determine the method address at compile time. Because the  reference can point to an object and all its sub objects, and that will be known only at runtime, a table is kept with all the possible method addresses to be called. Do not confuse:

The implementation of this method is searched using the instantiated type of the called object and the declared type of the parameter object.

Also another rule is that when you do an override, the visibility of the new method that overrides the super class method can not be reduced. The visibility can be increased, however. So if the super class method visibility is, the override method can not be , or. An override method must throw the same exceptions as the super class, or their subexceptions.

references to the parent class (i.e. ). It can be used in a subclass to access inherited methods that the subclass has overridden or inherited fields that the subclass has hidden.


text:
Kinyarwanda/Orthography

Normally, the official orthography of Kinyarwanda has five vowels with both long vowels and short vowels as well as high tones or no tones on syllables in pronunciation, but the official orthography does not mark vowel length and melody. Only the context can tell the reader which word was meant.

Most of the time written texts are thus ambiguous even to native speakers. Thus the written words umusambi can stand either for [umusaambi] 'mat' or [umusaámbi] 'crane', gutaka for either [gutaka] 'to scream' or [gutaaka] 'to decorate'. ino can stand for either [ino] 'toe' or [inó] 'here' etc.

Even though the sound p has been lost and is found only in onomatopeic words and loan-words, the aspirated voiceless velar fricative h is spelled as p after the bilabial nasal m as shown in the examples impuha [imhuuha] 'rumors', impamvu [imhaâmvu] 'cause/reason'. The allophones, the voiced bilabial stop b which appears only after the homorganic nasal m and the voiced bilabial fricative ß realized intervocalically are also written the same way, using the voiced bilabial stop symbol b. Although, the language has only one liquid, both r and l are used in the orthography. The liquid r is used in all texts and l is used only in loan-words which have l in their spelling such as Libiya 'Libya', Alijeriya 'Algeria', idolari 'dollar'.

title: Kinyarwanda/Orthography


text:
Kinyarwanda/Pronunciation

Kinyarwanda has five vowels which are either long or short, high-toned and no tones. The high tone can appear either on first mora or the second mora. These vowels are the two high vowels i and u, the midvowels e and o and the center low vowel a. The midvowels e and o are not allowed in both the (pre)prefix and suffix positions. In verbs, however, these midvowels can appear in the suffix position as a result of vowel harmony if the vowel of the verb stem is a midvowel. ex. gukosa 'to make mistakes' gukosoora 'to correct' /ku-kos-uur-a/; kumenya 'to know' kumenyeesha /ku-meny-iish-a/. The majority of word stems have the same identical vowel in all syllables: u-mu-biri 'body', u-bu-riri 'bed, i-ki-reenge 'leg', i-béere 'breast', u-mu-góongo 'back', u-mu-hoondo 'yellow', u-ku-guru 'leg', u-ru-túgu 'shoulder', igihaánga 'skull', i-ki-gaanza 'hand palm'. This observation raises the question as to whether the stem is assigned only one vowel which is copied or spreads to other syllables. Since kinyarwanda has open syllables only, loan-words with cluster consonants copy the vowel of the syllable on the right or a default vowel u with bilabial consonants and i with others. As the following work loan-word porogaramu 'program' shows, both vowels o and a are copied on the preceding vowelless consonants and the vowel u is inserted after the final consonant m.

title: Kinyarwanda/Pronunciation


text:
Wikijunior talk:Languages/Catalan

I've finnished the article but my poor English must be corrected. I don't use the template stage short because of I don't know how to use it exactly. Llull 10:09, 18 August 2006 (UTC)

It would be a good idea to remove the word "shit," as it is considered a somewhat strong vulgarity in English, especially for the target audience.
 * El Caganer is very popular in Catalan speaking areas, but I don't think non Catalan-speaking kids will really like the 'shit' translation (or anything about feces). On the other hand, forget about Caganer and find something else more appealing. --Member 23:02, 21 December 2006 (UTC)

title: Wikijunior talk:Languages/Catalan


text:
Kinyarwanda/Adjectives

Kinyarwanda language has less than twenty adjectives. This means that in some cases, Kinyarwanda lacks adjectives to qualify nouns. At this time, it makes them from other nouns. In translating a text expreesed by adjectives in other languages is rendered, for example, by either the possessive construction (X of Y) or by the relative clause construction.

e.g. 'a stupid boy' : umuhungu w'igicucu

title: Kinyarwanda/Adjectives


text: Category:Book:Statics

title: Category:Book:Statics


text:
Ada Programming/Platform/Windows/Visual C++ - GNAT interface

This is a guide for interfacing from Ada to C++ in Windows, using GNAT and MS Visual C++.

Before starting, you should check your environment. This was the environment used while writing this guide.

 * 1) Ada GPL 2006 and GPS.
 * 2) Microsoft Visual Studio 2005

These are the steps we will follow:
 * 1) write your Ada code and build dynamic library
 * 2) make a .lib file (for static linking)
 * 3) work together
 * 4) run your code

Step 1. Write Ada source code
- t.ads interfacesc t      C  interfacesc testabzdecint export stdcall test "test" t

t.adb adatext_io tth t      testabzdecint myd integer  0 tthtgetToken myd adatext_ioput_linemydimg " and e value is"  cinte t

th.ads tth T         getToken t   integer d integer  0 tth

-th.adb adatext_io tth T         adatext_io getToken t  integer t d               getToken d d  1 tth

And most important thing is your project file. It make you more easy.

project Testdll is   for Library_Name use "Te"; for Library_Dir use "dll"; for Library_Ali_Dir use "ali"; for Library_Kind use "dynamic"; for Languages use ("Ada"); for Object_Dir use "obj"; for Library_Interface use ("t"); for Library_Auto_Init use "False"; for Library_Src_Dir use "dll"; end Testdll;

You can configure almost all settings in your GPS IDE. But note that GPS cannot do Library_Interface setting correctly. After configuring it, you should check the project file and modify it accordingly. Library_Interface means which package contains export functions in DLL.

Library_Auto_Init is interesting and you must choose a correct setting in your project.

If you choose True, it will call adaInit when library load (which means elaboration appears in loading time automatically) if choose False, it will export init and finalize functions in DLL and you must call them by yourself.

If you export functions like C/C++ "normal" functions without any elaboration parts, you may set library_auto_init to True.

If your Ada code does not only work like C/C++ but also needs Ada elaboration function, you should initialize/finalize by yourself.

"DANGEROUS" DANGEROUS" DANGEROUS"DANGEROUS"DANGEROUS"

For example, if you have a library level task needing elaboration in load time and use implied linking and loading it will "deadlock WAITING" when DllMain calls init code. It's unexpected behaviour that you don't want to.

DANGEROUS"DANGEROUS"DANGEROUS"DANGEROUS"DANGEROUS"

In some case, you may use LoadLibrary / GetProcAddress to work (Explicit loading). But it is not easy to manage your code, especially if you export many functions.

Step 2. Make a .lib file (for static linking)
You can use utilities dumpbin and lib to generate .lib file (2.A)

dumpbin/exports Te.dll > te.def,

the file content is

Microsoft (R) COFF/PE Dumper Version 8.00.50727.42 Copyright (C) Microsoft Corporation. All rights reserved. Dump of file te.dll

File Type: DLL

Section contains the following exports for Te.dll

00000000 characteristics 44E2ABD2 time date stamp Wed Aug 16 13:23:30 2006 0.00 version 1 ordinal base 19 number of functions 19 number of names ordinal hint RVA     name 1   0 00001461 Tefinal 2   1 000011A0 Teinit 3   2 00005130 _CRT_MT 4   3 000050E0 t_E 5   4 000050D0 t__th_E 6   5 0000155F t__th__P2sIP 7   6 00007040 t__th___chain 8   7 00001745 t__th___elabb 9   8 0000156E t__th___elabs 10   9 00007044 t__th___master 11   A 000050D8 t__th__d 12   B 00007048 t__th__t 13   C 00006010 t__th__tT1 14   D 000016B9 t__th__tTKB 15   E 000050D1 t__th__tTKE 16   F 00001490 t__th__tTKVIP 17  10 000050D4 t__th__tTKZ 18  11 00005000 temain_E 19  12 0000178F test@20 Summary 1000 .bss 1000 .data 1000 .edata 2000 .idata 1000 .rdata 1000 .reloc 2E000 .stab E3000 .stabstr 4000 .text

(2.b) remove all in Te.def but leave ...

EXPORTS Tefinal Teinit _CRT_MT t_E t___elabb t__th_E t__th__P2sIP t__th___elabb t__th__d t__th__tB t__th__tE t__th__tVIP t__th__tZ temain_E test@20

The Teinit and Tefinal is used to elaborate and terminate the Ada elaboration part after Te.dll loaded. (the name does not call adainit/adafinalize but still the same function as adainit/adafinalize)

Step 3. Work together in MS VC++
Start Visual Studio C++ project and add Te.lib to your linker setting.

Writing a Te.h header for Ada DLL (GPS should generate .lib and .h for you).

And write a C/C++ test code to generate a .exe file

Step 4. Run your code
Put .exe and .dll in the same directory and run the test

The loader will find dll following in this order:
 * 1) current directory
 * 2) path variable
 * 3) Windows directory

Put the dll and exe in the same directory, it is the best option.

|


text:
Talk:Blender 3D: Noob to Pro/Advanced Tutorials/Advanced Animation/example/bird/Build rig

Hi,

there's no prod template (yet... will make one), so I've tagged it for speedy for the time being. If content is added, please remove the template. (I decided to tag in part because this is the IP address's only contrib, and there has been "querty" vandalism on other pages recently). -- SB_Johnny | talk 11:29, 18 August 2006 (UTC)


text:
Talk:Japanese/Lessons/Basic

TraNSLATING Hiranga into romaji
Example: Discourse topic marker は (romaji - wa, literally ha) (The bold is the add-on) Wikisquared 13:24, 18 August 2006 (UTC)

 * This may seem unimportant, but many native speakers when writing in romagi, will write は as ha for the topic marker. They still pronounce it wa however. Ken 13:01, 26 November 2006 (UTC)

Is this page to advanced??
At a basic stage, wouldn't it be nice to just introduce greetings, and the main part of basic learning, the Hiragana, Katakana and some (very) basic Kanji.

I think this would be more important at this stage than imperative verbs etc...

Ed -- 04:49, 22 September 2007 (UTC)

 * That stuff is included in the introduction section, but I think the introduction section should just include kana lessons and really basic stuff, while greetings etc. should go here. I think the way the kana is supposed to be taught now is ok. Ikarsik 00:43, 4 November 2007 (UTC)

 * There's only so much that can be learned from hiragana, katakana and basic kanji. I think the 'Starter Less' should be good for people who are just curious.  I've already started a Lesson that needs at least hiragana.  I didn't see this page until I made the lesson, but it can be easily revised with things added to it. --Retropunk (talk) 22:27, 2 March 2008 (UTC)

content
I think that the basic section of the book should be able to be used as a learning resource for the Japanese Language Proficiency Test level 4. This way we can use a set list of vocabulary, kanji and grammar. The suggested structure of the section now is good in that the kanji and vocabulary can be introduced in each section, and there are already grammar parts listed under the headings.

A good resource for JLPT : http://www.jlptstudy.com/

also if we structure the book on the JLPT then the other sections, intermediate, advanced, and expert, can be used for JLPT levels 3, 2, 1 respectively. Ikarsik 00:52, 4 November 2007 (UTC)

I also agree with this. I think that we should however include auxiliary vocabulary and other knowledge freely while emphasizing the information necessary for the Japanese proficiency test. This would accomplish the two goals of providing the knowledge needed to pass the exam while including enough information to keep the studious user interested. WongFei (talk) 2:26AM, 10 May 2008 (UTC)

練習
I think every lesson should include relevent drills at the end to get people thinking and speaking in Japanese and practicing the new techniques. WongFei (talk) 10:39, 5 April 2008 (UTC)

title: Talk:Japanese/Lessons/Basic


text:
User:SBJohnny/sandbox2

Looking for a css hack (for monobook js or global) to make Book and Chapter titles appear differently on the page, so that :

Book/Chapter

...would now look like:

Book  Chapter

...and:

Book/Chapter/Subchapter

...would look like:

Book  Chapter/Subchapter

title: User:SBJohnny/sandbox2


text:
Ada Programming/Libraries/Ada.Assertions

is a unit of the Predefined Language Environment since Ada 2005.

Specification
Pure Assertions Assertion_Error Assert Check  Boolean Assert Check  Boolean Message   String AdaAssertions

Wikibook

 * Ada Programming/Libraries/Ada


text:
User talk:207.105.30.44

Spanish Wikibook
Thanks for your interest in the Spanish Wikibook! I see that you completed the exercise concerning articles. I'm glad you're making use of this Wikibook and hope you find it helpful. If you have any suggestions for this Wikibook you can list them here. ¡Buena suerte! --Think Fast 21:59, 18 August 2006 (UTC)

title: User talk:207.105.30.44


text: User:Xhienne

title: User:Xhienne


text:
Cookbook talk:Cozido à Portuguesa

This page was originally at Cozido à Portuguesa. Here is a copy of the page history:

01:09, 23 April 2006. . Page Up (Talk | contribs | block) 01:08, 23 April 2006. . Page Up (Talk | contribs | block) 01:08, 23 April 2006. . Page Up (Talk | contribs | block) 01:08, 23 April 2006. . Page Up (Talk | contribs | block) 17:01, 26 March 2006. . Page Up (Talk | contribs | block) (remove the tag and the recipe list as User:W.marsh said to me in my talk page.) 16:04, 26 March 2006. . W.marsh (Talk | contribs | block) (Wikipedia:Articles for deletion/Cozido à Portuguesa) 15:44, 26 March 2006. . Page Up (Talk | contribs | block) 15:37, 26 March 2006. . Page Up (Talk | contribs | block) (More edits. (Sorry, but you can't delete this kind of articles...see why it must be considered a wikipedia article, and then remove de AfD note. Thank you.)) 12:40, 25 March 2006. . Page Up (Talk | contribs | block) (national dish) 19:50, 20 March 2006. . Icarus3 (Talk | contribs | block) (afd) 19:14, 20 March 2006. . Page Up (Talk | contribs | block) 19:12, 20 March 2006. . Page Up (Talk | contribs | block) --Added by --Ezeu 02:32, 19 August 2006 (UTC)

title: Cookbook talk:Cozido à Portuguesa


text:
Cookbook talk:Candied Almonds (Brända mandlar)

This page was originally at Brända mandlar. Here is a copy of the page history:

16:17, 17 June 2006. . Deathphoenix (Talk | contribs | block) (AfD done: Transwiki) 01:50, 21 May 2006. . That Guy, From That Show! (Talk | contribs | block) (typo/grammar fixes ( WP:Typo and WP:Grammar you can help!)) 21:59, 11 May 2006. . Denni (Talk | contribs | block) (afd tag) 18:22, 26 April 2006. . JoeBot (Talk | contribs | block) (typo fix: the word "actually" using AWB) 19:00, 21 February 2006. . Liftarn (Talk | contribs | block)

--Added by Ezeu 02:35, 19 August 2006 (UTC)


text:
User talk:Pandamel

Thanks for the help in the guitar article, I'm not stupid but it's hard for me to start articles from scratch. Are you sure that they don't also mean brands of guitars, such as strats and les pauls? Meemo 06:38, 19 August 2006 (UTC)

title: User talk:Pandamel


text:
Category:Book:Dental Case Files

ja:カテゴリ:歯学

title: Category:Book:Dental Case Files


text: Category:Book:Food Service

title: Category:Book:Food Service


text: Category:Book:LPI Linux Certification

title: Category:Book:LPI Linux Certification


text:
User talk:Lbartels

Gruss vom Papst! Wie gehts dir?

--Aschoeke 12:13, 19 August 2006 (UTC)

Ich habe gerade auf der Frontpage euer Chap auf 100% beim Development Image gesetzt. Sieht wirklich gut aus! :D

--Aschoeke 20:02, 19 August 2006 (UTC)

title: User talk:Lbartels


text:
Gas Grill Parts

Three out of four American households own a grill, also known as a barbecue. Many grill components can be replaced with new parts, adding to the useful life of the grill. Though charcoal grills can sometimes require new cooking grids and charcoal grates, gas grills are much more complex, and require additional components such as burners, valves, and heat shields.

Burners

A gas grill's burner is the central source of heat for cooking food. Gas grill burners are typically constructed of

 * stainless steel
 * aluminized steel
 * cast iron (occasionally porcelain-coated)

Burners are hollow with gas inlet holes and outlet 'ports'. For each inlet is a separate control on the control panel of the grill. Many grills have just one burner. Common configurations are referred to as dual burners, with two gas inlets and two corresponding control knobs - right and left, and single burners, having only one inlet and control. The most common type of gas grill burners are called 'H' burners and resemble the capital letter 'H' turned on its side. Another popular shape is Oval. There are also 'Figure 8', 'Bowtie' and 'Bar' burners.

Other grills (typically more expensive models) have a separate burner for each control, usually featuring three or four individual burners. These burners can be referred to as 'Pipe', 'Tube', or 'Rail' burners. They are mostly straight since they are only required to heat one portion of the grill. For example a gas grill may have 3 pipe burners which run from the front to the back of the grill - a left burner, center burner, and right burner. This allows the user the flexibility to use any combination of the three depending on the amount of food being cooked and the desired temperature.

Burners are situated at the bottom of the grill. They can have 'legs' or rest directly on the grill casting. Gas is supplied through venturi tubes or simply 'venturis'. Venturis can be permanently attached to the burner or removable. At the other end of the venturi is the gas valve, which is connected to the control knob on the front of the grill. When the user turns the knob, the valve opens, allowing gas to flow through the venturi tube and into the burner. Some burners (usually pipe style) do not require venturis and connect directly to the valve.

Because burners operate at such high temperatures (typically 300 to 650 degrees fahrenheit) and are subject to drippings from cooking meat (corrosive due to their moisture content and acidity), these crucial components are usually the first to wear out. A gas grill burner can typically operate effectively for 1 to 5 years with average usage. When the burner becomes significantly corroded, or 'rusted out', gas escapes through the corroded areas, creating 'hot spots' and making it difficult or impossible to properly cook food.

When a new burner is required, there are several possible sources. Usually the original manufacturer of the grill offers a replacement which is identical or nearly identical to the original part. This is known as an OEM part. This is a desirable option for many because the burner is known to work with their grill. However, sometimes grill manufacturers may go out of business, may not have the original replacement available (especially for older grills), or may charge a price which is deemed too high by the consumer.

Several companies manufacture 'after-market' burners which can be a suitable replacement. Though they may not be exactly like the original, they have been tested and shown to work with the grill models for which they are sold. When choosing an after-market replacement burner, there are 3 main criteria which must be met for optimal operation:

 * 1) The burner physically fits in the grill and rests evenly at the bottom of the grill
 * 2) The burner is relatively close in size to the original
 * 3) Gas can be supplied to the burner

Because of the wide variety of burner/venturi configurations, after-market parts manufacturers typically offer 'universal' venturis, which can be bent and extended to reach from the burner to the valve in order to meet the 3rd requirement above.

Cooking Grids
Cooking grids, also known as cooking grates, are the surface on which the food is cooked in a grill. They are typically made of:

 * Stainless steel (Usually the most expensive and durable, may also carry a lifetime warranty)
 * Porcelain-coated cast iron (The next most durable after stainless, usually thick and good for searing meat)
 * Porcelain-coated steel (Will typically last as long as porcelain-coated cast iron, but not as good for searing)
 * Cast Iron (More commonly used for charcoal grills, cast iron must be constantly covered with oil to protect it from rusting)
 * Chrome-plated steel (Usually the least expensive and shortest-lasting material)

Unless the grid is stainless steel, the protective coating will eventually wear off and the underlying metal will begin to rust. At this time it is time for a new grid. As with burners, replacement cooking grids can be obtained from the original grill manufacturer or an after-market parts dealer.

Though some refer to a cooking grid's front to back dimension as 'width' and the side to side dimension as 'length', proper terminology defines the 'depth' of a cooking grid as measured from to front back and the 'width' as measured from side to side. When looking for a replacement cooking grid, the grid's depth is the most crucial dimension. A typical rule of thumb is that the depth must be within 3/8" of the depth of the original grid to fit properly. The width is less critical, and can be shorter that the original, simply reducing the amount of cooking area.

Rock Grates
Rock grates are placed directly above the burner and are designed to hold lava rock or ceramic briquettes. These materials serve a dual purpose - they protect the burner from drippings which can accelerate the deterioration of the burner, and they disperse the heat from the burner more evenly throughout the grill.

Rock grates are one of the least expensive replacement parts for a grill. Because they do not hold food, they do not need to be protected from rust like cooking grids. Therefore, they are typically constructed of carbon steel which will start to rust almost immediately. A rock grate is useful until it rusts completely through and no longer holds rock.

Heat Shields
Heat shields are also known as burner shields, heat plates, heat tents, radiation shields, heat angles, or flavor grids. They serve the same purpose as a rock grate + rock, protecting the burner from corrosive meat drippings and dispersing heat. They are more common in newer grills.

Some advantages of heat shields over rock:

 * They do not harbor bacteria
 * They are not as heavy
 * They are easier to replace

It is also claimed by some that they vaporize the drippings and 'infuse' the meat with more flavor, though it is debatable if there is any difference in this regard to rock. Many users still prefer rock over heat shields.

Valves
Valves can wear out or become rusted and too difficult to operate, thus requiring replacement. A valve is unlike a burner in that a replacement usually must match exactly to the original in order to fit properly. Therefore, many grills are disposed of when valves fail, due to a lack of available replacements.

If a valve seems to be moving properly, but no gas is getting to the burner, the most common cause for this is spider webs or other debris in the venturi. This impediment can be cleared by using a long flexible object.

Posts
With the exception of cast aluminum, all grill posts will eventually rust through and need to be replaced. If an exact replacement cannot be obtained, holes can sometimes be drilled in a post with the same diameter as the original where required to mount the grill head.

Other Parts
Grills contain many other less essential parts, such as handles, heat gauges, warming racks, condiment trays, and more. As a general rule, the less critical the part, the more likely that it will only be available from the original grill manufacturer.

How to Decide When to Replace a Grill
Each user will need to determine the most cost effective option for his or her situation. If the total of the replacement parts required is more than a new grill, by all means buying a new grill is the best option. If the casting (the actual body of the grill) is corroded or significantly warped, buy a new grill. Almost all other parts can be replaced on most grills.

Grill Manufacturers
There are dozens of grill manufacturers. Some build grills designed to be kept for many years, and as such provide replacement parts and make the grills compatible with industry standards. Usually manufacturing their grills in the United States, some examples of these manufacturers are Modern Home Products and Broilmaster. These grills are typically more expensive and not available at large home improvement warehouse stores or discount chains. However, they tend to last a very long time, sometimes as much as 30 years or more.

Other grill companies sell models which may have many of the parts manufactured at low costs in Asia. This allows the grills to be sold for less, but can also mean that original replacement parts will be hard to find or not available at all. Examples of these manufacturers are Char-Broil and Vermont Castings.

After-Market Parts
There are currently two U.S. companies manufacturing after-market grill parts for a wide variety of grill models:

 * Music City Metals
 * Modern Home Products

These manufacturers do not sell directly to the public, and customers must go through a dealer in order to obtain parts. Local retail shops can sometimes provide these products. There are also many websites selling gas grill parts. A few examples are:

 * GrillPartsSearch.com
 * CLA Grills
 * Appliance Factory Parts

title: Gas Grill Parts


text:
Talk:MATLAB Programming/Advanced Topics/Toolboxes and Extensions/Symbolic Toolbox

The most important thing about the symbolic math toolbox is that (as far as I can tell), unlike MATLAB, Maple is a symbolic kernel, not a numeric one. So, for example, you can manipulate fractions exactly by storing them as symbolic variables, rather than dealing with roundoff errors... I also use it to determine expressions for functions that would be a pain in the butt to find by hand, and then just copy them and paste into the program I want to use them in. Maple also lets you use variable-precision arithmetic, not sure how accurate or useful that is but it is there.

The downside is that it often will give you really complicated stuff that you can't really do much with. I haven't figured out how to make it output indecies, which means I manually have to go in and put them in after the toolbox is done running. Mattb112885 15:26, 19 August 2006 (UTC)

 * I have added prettymuch everything I know about the toolbox, I'm not sure how to use the linear algebra or VPA stuff so if someone knows better than me please add it! Mattb112885 23:08, 8 September 2006 (UTC)

What is intended by the "syms a(1)" command at the end of the Symbolic Variables? I don't think that should be there since it doesn't make sense (or at least I can't figure out what you mean). Are the parens for indexing or function evaluation? (edit: aha from later examples I think you mean for parens to be indexing). Also the example that results in "a=[a a2]" looks confusing since I can't imagine why people would want to have the MATLAB variable "a" represent "[a a2]" - it's too confusing.

Also later on in the Symbolic Function section you can see how sym('a(1)') and sym('a(2)') is not useful. Just stick with "syms a" or perhaps if you really want to say that a is a 2 element symbolic variable then "syms a1 a2" and "a = [a1 a2];".

Also for the section about solving and symbolic functions the example confuses assignment = with equality ==. I recommend adding a discussion about what = means.

 * Thank you for your comments. I agree, it is kind of unnecessary to use that kind of syntax, I removed it in favor of just the array. The second point, yeah that was weird, I don't know why I did that.. the third, equality is addressed in the "logic" section but don't think assignment is addressed anywhere, so that's something to do later, any suggestions where to put it? And where did I mistake assignment with equality, or did you fix that already? Mattb112885 05:22, 29 November 2006 (UTC)

"There is no function to directly change a symbolic variable into a function handle, unfortunately." - I they have added one recently: matlabFunction. Sheepe2004 (discuss • contribs) 12:34, 29 July 2011 (UTC)


text:
User:Rotemliss

I signed up to Wikibooks on 19 August 2006.

User map in Wikimedia Foundation
he:משתמש:Rotemliss

title: User:Rotemliss


text:
User talk:Rotemliss

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You can sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * Check out our help page if you need additional help.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Take a look at Naming policy
 * See list of templates which can save your time
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Staff lounge, IRC channel or ask me personally on my talk page.

Good luck! – rotemliss – Talk 15:49, 19 August 2006 (UTC)

title: User talk:Rotemliss


text:
User talk:Maebert

100% :D Glückwunsch

--Aschoeke 16:49, 19 August 2006 (UTC)

title: User talk:Maebert


text:
Modern Greek/Lesson 5x

This is the fifth lesson and second-to-last lesson teaching you how to read, write and pronounce Greek.

The first new letter you'll learn is Phi:

Φ φ

Neither of the letters has any resemblance to English letters. The pronunciation is familiar though: it's just like an English F (IPA [f]). If English derived a word containing Phi from Greek, it is typically spelled with ph instead of simply f - just like in the letter name "Phi" itself. Practise using the following Greek words:

φιλοσοφία φιλμ φεμινισμός φαρμακείο ελέφαντας Φίλιπ Αφρική Σαν Φρανσίσκο

The next letter is easier again. This is Zeta:

Ζ ζ

The capital Zeta looks like a Z and the small Zeta looks like a more curvy version of it. It's pronounced as an English Z (IPA [z]), too. Easy, isn't it? Example words:

ντίζελ Βραζιλία Τερέζα Βενεζουέλα Ζάμπια Ζιμπάμπουε Καζακστάν Νέα Ζηλανδία

An interesting combination in Greek is Tau-Zeta:

Τζ τζ

This is pronounced as a combination of the sounds of Tau and Zeta (IPA [dz]). Although "j" is a letter in the English alphabet, there is no such letter in Greek. Instead, we use τζ, whose combined sounds make the "j" sound. τζ is not a letter in the Greek alphabet. It is what the previous statement says, just a sound coming from a combination of letters. In words derived from English, this combination is sometimes used to replace the j sound as in "journalist" or the g sound as in "general", because there is no sound [dʒ] in Greek. Practise reading the following words:

ατζέντα έιτζ Φίτζι Τζορτζ Μπους Αζερμπαϊτζάν Ρίο ντε Τζανέιρο Τζακάρτα Καμπότζη

Now you're going to learn another very important Greek letter: Gamma.

Γ γ

This is equivalent of G in Greek, except that it isn't pronounced as a regular English G. When Gamma is followed by a 'light' vowel sound such as E or I, it is pronounced like the English Y in "year" (IPA [ʝ]). When it is followed by a 'dark' vowel sound such as A, O or U, it is pronounced in a way that doesn't exist in English, kind of like the ch in "Bach" or the lake "Loch Ness" in Scotland, with the difference that vocal chords should be vibrated when pronouncing it (IPA ). (Listen to a [[media:voiced velar fricative.ogg|sound sample]].) This letter comes up very often in Greek, so you'll have lots of opportunities to practise.

Πορτογαλία φιγούρα Γερμανία Βουλγαρία βιολογία Βέλγιο γεωλογία πρόγραμμα γραφικά Αργεντινή Πράγα Νορβηγία Αλγερία Αφγανιστάν Γεωργία Γουατεμάλα Γουινέα Γρενάδα Μαδαγασκάρη

A variation occurs when there are two Gammas in a row:

γγ

This combination is pronounced like the ng in the English word "ring" (IPA: [ŋg]). Examples:

Ουγγαρία Αγγλία Μογγολία άγγελος

Finally, how to spell the actual [g] sound as in "garden"? For that, you need two letters again: Gamma and Kappa.

Γκ γκ

Sometimes when this combination is at the middle of words then it represents the sound ng in the English word "ring" (like γγ), but when the word is a foreign loanword and the intention is to have a [g] sound, then it is pronounced as [g]. Though, this detail is not very significant for the pronunciation and it is not wrong to always pronounce γκ as a [g] sound. Greek words you already know that include this combination are:

γκαράζ γκέτο Γκάνα Αγκόλα γκάλοπ γκαλερί Σανγκάη Κογκό Μπανγκλαντές

That's it for this lesson! If you didn't have trouble reading the example words, you're ready to continue with lesson 6!

Solutions

title: Modern Greek/Lesson 5x


text:
Decision Theory

DECISION THEORY
Decision theory studies rational choices. It is used both to predict and explain actual choices and to improve actual decision making. The first purpose is called positive theory and the second is called normative theory. While our primary aim is to predict and explain actual choices (positive theory), understanding how to improve actual decision making (normative theory) helps us to better understand decision theory for our applications, as well.

Decision theory may also be used to predict equilibria achieved by some evolutionary process. In particular, this evolutionary process may be the biological evolutionary process or a cultural evolutionary process. We consider applications to each.

/Smart Choices and Models Based Upon Them/
We first start with a review of material in _Smart Choices_, a book written by John Hammond, Ralph Keeney, and Howard Raiffa, experts from the Harvard Business School in the field of decision theory and its application in business. (An MBA program is largely the study of how to improve decisions important to business, and decision theory is a key component of this study.) These chapters introduce you to the basics of decision theory and how it can be applied to improve your decisions. The chapter continues with a discussion of our goals for models intended to help us predict and explain social behavior. We see that our modeling focuses only upon the most important factors necessary to predict and explain, even if we must sacrifice a complete or accurate description of the individual’s actual decision making process.

/Optimization in Markets/
We then introduce the basics of microeconomic theory, since economists were the first to use models based upon self-interested individuals and these models are now the foundation for the discipline. We introduce these models based upon decision theory because they have been so successful in economics. As the political scientists Shepsle and Bonchek explain, considering these models are important for our general goals of predicting and explaining all types of social behavior:

_The modern theory of economics is a grand intellectual edifice precisely because it has succeeded, as no other social science has, in constructing explanations logically, rigorously, and in empirically meaningful ways. At the foundation of this edifice is a scientific commitment to explanation, not description._ (Shepsle-Bonchek, 21)

The models developed here introduce the reader to most of the basic tools and concepts of decision theory, at least in a world without uncertainty. We first consider profit-maximizing decisions that firms make in perfectly competitive markets, show how the model describes supply and demand choices, and how it describes the “market” determining price to reach a competitive equilibrium. We then extend this model to consumers, whose preferences can take a more general structure, which leads us to develop “utility” functions, an important tool throughout decision theory and game theory. We also introduce the concept of efficiency, which can be used to evaluate the outcomes that our models predict. We find, in particular, that competitive markets, driven by self-interested individuals, are efficient, and compare that conclusion to monopoly markets that are not.

/Sincere Voters/
We then apply decision theory models to political science with the intent of creating a positive theory of politics. We use of models of self-interested individuals to consider various voting mechanisms used to generate group decisions. We start with rational individuals, just as in the economics models, and analyze decisions they would make with these voting mechanisms. We show that some voting mechanisms, and majority voting in particular, can lead to irrational group decision making, even if all individuals are rational. For another application, we also consider the incentives for lobbying for rules, regulations, or laws that would benefit everyone within a group and find an explanation for special interests.

/Natural Selection/
We not use models based upon the mathematics of decision theory, not to predict and explain rational decisions, but in evolutionary biology. Here, “decisions” are not made consciously by any individual, but an evolutionary mechanism rewards the most fit individuals that pass along more of their genes to the next generation. The population of individuals then tends to eventually evolve to one with individuals who virtually all have characteristics that maximize fitness. After examining the process of natural selection, we consider its application in choices involving food and shelter, and the determination of sex ratios.

/Cooperation with Kin Selection/
This materials continues the study of evolutionary biology, but it considers decision theory models from a different perspective. We consider the perspective of the gene rather than the individual with that gene. This offers a theory of kin selection, which may lead to behavior towards family members that appears altruistic from the viewpoint of an individual in the population, but not from the viewpoint of an individual gene. We consider some applications of kin selection in amoebae, social insects, ground squirrels, and humans. Finally, after we have considered evolutionary arguments that predict and explain tendencies in animal behavior, we apply the same evolutionary arguments to determine behavioral tendencies in people, an approach that has formed the field of evolutionary psychology.

/Cultural Evolution and Social Norms/
Here we apply decision theory in models of evolution outside of biology. We consider an analogous process to biological evolution in the evolution of cultural behavior. In this model, people tend to adopt more ideas that tend to lead to more successful behavior, so that more fit ideas become more prevalent in a later population and less fit ones become less prevalent. This evolutionary process eventually leads to the most "fit" ideas being adopted within the cultural. We discuss implications of such a process to draw out predictions that can then be tested against actual behavior.

/Decision Theory with Uncertainty/
Here we re-open the decision theory toolbox to consider the additional tools necessary to deal with a world with uncertainty. We consider, in some detail, basic rules that an individual should follow if he were rational in the face of uncertainty.

/Investments, Insurance, and Search/
Now we introduce several important applications of decision theory with uncertainty, applying decision theory to investments, insurance, and search.

/Anomalies and Responses to Them/
Here we consider apparent anomalies that have been observed when trying to apply these models of self-interested individuals to actual social behavior. We find some situations, especially when uncertainty is involved, where individual choices do not seem consistent with all the rules that a rational decision maker must follow. Given these differences, we must consider two questions. First, are there any predictable biases in these differences between actual choices and rational choices? Second, under what circumstances is some social behavior of interest likely to be consistent with rational choices? In addressing these questions, we reconsider when a model based upon individuals’ rational choices is likely to be appropriate for a positive theory that intends to predict and explain some social behavior of interest.

title: Decision Theory


text:
Self Interest and Social Behavior/Decision Theory

Decision theory studies rational choices. It is used both to predict and explain actual choices and to improve actual decision making. The first purpose is called positive theory and the second is called normative theory. While our primary aim is to predict and explain actual choices (positive theory), understanding how to improve actual decision making (normative theory) helps us to better understand decision theory for our applications, as well.

Decision theory may also be used to predict equilibria achieved by some evolutionary process. In particular, this evolutionary process may be the biological evolutionary process or a cultural evolutionary process. We consider applications to each.

Smart Choices and Models Based Upon Them
We first start with a review of material in Smart Choices, a book written by John Hammond, Ralph Keeney, and Howard Raiffa, experts from the Harvard Business School in the field of decision theory and its application in business. (An MBA program is largely the study of how to improve decisions important to business, and decision theory is a key component of this study.) These chapters introduce you to the basics of decision theory and how it can be applied to improve your decisions. The chapter continues with a discussion of our goals for models intended to help us predict and explain social behavior. We see that our modeling focuses only upon the most important factors necessary to predict and explain, even if we must sacrifice a complete or accurate description of the individual’s actual decision making process.

Optimization in Markets
We then introduce the basics of microeconomic theory, since economists were the first to use models based upon self-interested individuals and these models are now the foundation for the discipline. We introduce these models based upon decision theory because they have been so successful in economics. As the political scientists Shepsle and Bonchek explain, considering these models are important for our general goals of predicting and explaining all types of social behavior:

''The modern theory of economics is a grand intellectual edifice precisely because it has succeeded, as no other social science has, in constructing explanations logically, rigorously, and in empirically meaningful ways. At the foundation of this edifice is a scientific commitment to explanation, not description.'' (Shepsle-Bonchek, 1997, 21)

The models developed here introduce the reader to most of the basic tools and concepts of decision theory, at least in a world without uncertainty. We first consider profit-maximizing decisions that firms make in perfectly competitive markets, show how the model describes supply and demand choices, and how it describes the “market” determining price to reach a competitive equilibrium. We then extend this model to consumers, whose preferences can take a more general structure, which leads us to develop “utility” functions, an important tool throughout decision theory and game theory. We also introduce the concept of efficiency, which can be used to evaluate the outcomes that our models predict. We find, in particular, that competitive markets, driven by self-interested individuals, are efficient, and compare that conclusion to monopoly markets that are not.

Sincere Voters
We then apply decision theory models to political science with the intent of creating a positive theory of politics. We use of models of self-interested individuals to consider various voting mechanisms used to generate group decisions. We start with rational individuals, just as in the economics models, and analyze decisions they would make with these voting mechanisms. We show that some voting mechanisms, and majority voting in particular, can lead to irrational group decision making, even if all individuals are rational. For another application, we also consider the incentives for lobbying for rules, regulations, or laws that would benefit everyone within a group and find an explanation for special interests.

Natural Selection
We not use models based upon the mathematics of decision theory, not to predict and explain rational decisions, but in evolutionary biology. Here, “decisions” are not made consciously by any individual, but an evolutionary mechanism rewards the most fit individuals that pass along more of their genes to the next generation. The population of individuals then tends to eventually evolve to one with individuals who virtually all have characteristics that maximize fitness. After examining the process of natural selection, we consider its application in choices involving food and shelter, and the determination of sex ratios.

Cooperation with Kin Selection
This materials continues the study of evolutionary biology, but it considers decision theory models from a different perspective. We consider the perspective of the gene rather than the individual with that gene. This offers a theory of kin selection, which may lead to behavior towards family members that appears altruistic from the viewpoint of an individual in the population, but not from the viewpoint of an individual gene. We consider some applications of kin selection in amoebae, social insects, ground squirrels, and humans. Finally, after we have considered evolutionary arguments that predict and explain tendencies in animal behavior, we apply the same evolutionary arguments to determine behavioral tendencies in people, an approach that has formed the field of evolutionary psychology.

Cultural Evolution and Social Norms
Here we apply decision theory in models of evolution outside of biology. We consider an analogous process to biological evolution in the evolution of cultural behavior. In this model, people tend to adopt more ideas that tend to lead to more successful behavior, so that more fit ideas become more prevalent in a later population and less fit ones become less prevalent. This evolutionary process eventually leads to the most "fit" ideas being adopted within the cultural. We discuss implications of such a process to draw out predictions that can then be tested against actual behavior.

Decision Theory with Uncertainty
Here we re-open the decision theory toolbox to consider the additional tools necessary to deal with a world with uncertainty. We consider, in some detail, basic rules that an individual should follow if he were rational in the face of uncertainty.

Investments, Insurance, and Search
Now we introduce several important applications of decision theory with uncertainty, applying decision theory to investments, insurance, and search.

Anomalies and Responses to Them
Here we consider apparent anomalies that have been observed when trying to apply these models of self-interested individuals to actual social behavior. We find some situations, especially when uncertainty is involved, where individual choices do not seem consistent with all the rules that a rational decision maker must follow. Given these differences, we must consider two questions. First, are there any predictable biases in these differences between actual choices and rational choices? Second, under what circumstances is some social behavior of interest likely to be consistent with rational choices? In addressing these questions, we reconsider when a model based upon individuals’ rational choices is likely to be appropriate for a positive theory that intends to predict and explain some social behavior of interest.


text:
User talk:85.16.84.232

Soll ich euch auf der Hauptpage mal auf 100% schalten? Find ich toll, dass heute noch soviel gekommen ist :)

--Aschoeke 18:03, 19 August 2006 (UTC)

Mach mal, ich sehe das projekt jetzt auch als abgeschlossen an :)

Philipp

title: User talk:85.16.84.232


text:
User talk:Alayabbas

Hi!

Is Why Computational Physics? a book name, or a chapter of a book called "Computational Physics?" -- SB_Johnny | talk 20:31, 19 August 2006 (UTC)

Why computational physics? is an introductory note on the importance and philosophy of computational physics. it is aime at giving the reader an idead about the scope and aims of the book. Threrfore it becomes a section or part of the introduction. Waiting for feedback Alay -e-abbas

 * OK, I'll move it to a chapter then ( Computational Physics/Why Computational Physics? ). -- SB_Johnny | talk 09:38, 21 August 2006 (UTC)

Have you read the euler method section? please suggest where shpould it be placed. Alayabbas 1:11 PM 22 August 2006 (PST) I have added trapezoidal rule also waiting for feed back. Alayabbas 1:35 PM, 22 Aug 2006 (PST)
 * Haven't read it... do you have a link? -- SB_Johnny | talk 10:46, 23 August 2006 (UTC)

i have added it in the spreedsheet section also the trapezoidal rule. Alayabbas 10:10 PM, 24 Aug 2006 (PST)

title: User talk:Alayabbas


text:
User:KevinBaker~enwikibooks

Personal Information
Name: Kevin Baker

Location: Atlanta, Georgia

Education:4th year History/Political Science student

Religion: Atheist

Books I'm Working On
Utopia -- Cleaning up existing content and (possibly overhauling the stucture)

title: User:KevinBaker~enwikibooks


text:
User:Orarch~enwikibooks

Orarch.

title: User:Orarch~enwikibooks


text:
User:Complexica

Biography
Roger D. Jones is the Chairman and Chief Scientific Officer for CommodiCast, Inc. His biography and publications list can be found on his personal website
 * Roger D. Jones, PhD.

title: User:Complexica


text:
Computer Programming/Standards and Best Practices

What are "Best Practices"
Standards in computer programming are methods of programming that have been declared acceptable and thereafter are recommended as the approach that should be used. Much like what GAAP is to Accounting, programming standards allow programmers to use a common ground when writing code. Closely tied with programming standards, best practices are simply recommended methods of writing code.

Goal of this section
The goal of this section is to give beginners a checklist that allows them to write decent code and to tell beginners that those things exist, so that they can do further reading on these things and figure out if they want to use it or not.

Language-independent best practices

 * Use a version control system. . Most common: git
 * Create a License.txt file
 * Use a proper build system like Meson, CMake, Makefile, Apache Ant, Gradle, Buildr...
 * Use a code-formatter. Consider configuring your editor to run the formatter everytime you save the file.
 * Use a
 * Enable compiler warnings.
 * Fix all compiler warnings.
 * If there are good linters available for your language, run them and fix all warnings.
 * Have an appropriate amount of unit test.
 * Use a 404 link checker to make sure you do not have any 404 links in your documentation.
 * If you are working with memory-unsafe languages - Run your tests with ubsan.
 * If a part of your code can be fuzzed, fuzz it.

It is important, that you don't just run the unit tests, fuzzers, linters, code-formatters and 404 link checkers once, instead you should run them everytime you change something. The purpose of of unit tests isn't to check whether it works, it is to make sure it keeps working when you change something. Maybe add those things to your pre-commit hooks. Most projects have their servers configured to run those tools everytime someone creates a pull requests.

Disputed Language-independent best practices
The following are practices that some developers think are best practices, while others think that they are bad practices.

 * Use Test-driven Development


text:
Talk:Muggles' Guide to Harry Potter/Books/Half-Blood Prince/Chapter 11

I don't believe Hermione actually admits to interfering with the keeper trials, she simply doesn't deny involvement. I'd have to look at the book again to be sure, and I don't have it with me. Gentgeen 23:01, 19 August 2006 (UTC)

 * Just to confirm: Hermione does admit to Confunding McLaggen, after they leave Hagrid's, but says it was under extreme provocation. UK / Canadian edtion p. 219. Chazz (talk) 08:02, 26 August 2007 (UTC)


text: Template:Qr-em

title: Template:Qr-em


text:
User talk:Kingturtle

Since you moved the original pages for Atlas Shrugged Annotated Notes from Wikipedia, would you happen to have the original logs of user contributions? Yosofun 23:22, 19 August 2006 (UTC)

title: User talk:Kingturtle


text:
File talk:Three level.jpg

The right holder is asked. Please do not delete, until we get an answer.

This picture is used in a psychological publication and is likely to be licensed under fair use or a free license!

title: File talk:Three level.jpg


text:
File talk:Two level.jpg

The right holder is asked. Please do not delete, until we get an answer.

This picture is used in a psychological publication and is likely to be licensed under fair use or a free license!

--Aschoeke 01:56, 20 August 2006 (UTC)

title: File talk:Two level.jpg


text:
Radiation Oncology/Breast/DCIS/Van Nuys

Van Nuys Prognostic Classification:

 * Group 1 	Non-high nuclear grade without necrosis
 * Group 2 	Non-high nuclear grade with necrosis
 * Group 3 	High nuclear grade with or without necrosis

References:

 * 2003 Updated USC/VNPI PMID 14553846 Full text -- "The University of Southern California/Van Nuys prognostic index for ductal carcinoma in situ of the breast." (Silverstein MJ, Am J Surg. 2003 Oct;186(4):337-43.)
 * Added age
 * Score 4-6 : no statistical difference in 12-yr local RFS for pts treated with vs without RT
 * Score 7-9 : 12-15% improvement with RT
 * Score 10-12 : benefit with RT, but very high risk of recurrence despite RT
 * Conclusion: Recommend excision alone for scores 4-6. RT for scores 7-9. Consider mastectomy for scores 10-12

 * 1999 Subsequent report on margins: PMID 10320383 Full text, 1999 (1979-1998) — "The influence of margin width on local control of ductal carcinoma in situ of the breast." Silverstein MJ et al. N Engl J Med. 1999 May 13;340(19):1455-61.
 * Retrospective. 469 pts. Pts treated until 1989 received post-op RT and those treated after 1989 did not. RT was 40-50 Gy to whole breast + 16-20 Gy boost. Tumors were assessed for histologic subtype, nuclear grade, comedonecrosis, maximal diameter, and margin width. Margins were classified as close or involved (<1 mm), intermediate (1 to <10 mm), or wide.
 * RT decreased the recurrence rate for close or involved margins; for intermediate or wide margins, was not statistically different.
 * Conclusion: RT is not necessary for margins > 10 mm.

 * 1996 First report PMID 8635094 — "A prognostic index for ductal carcinoma in situ of the breast." Silverstein MJ et al (and Lewinsky BS). Cancer. 1996 Jun 1;77(11):2267-74.
 * Came up with Van Nuys Prognostic Index (VNPI). Combines tumor size, margin width, histologic classification. Score 1-3 for each to arrive at a total score of 3-9.
 * Evaluated 333 pts treated with excision alone or excision + RT.
 * For pts with VNPI score of 3-4, excellent recurrence free survival (100% vs 97%) whether or not RT was used. For VNPI scores of 5-7, there was a 17% decrease (85% vs 68%) in RFS when RT was used. For score of 8-9, recurrence rate > 60% despite RT.
 * Conclusion: recommend excision alone for score of 3-4, excision + RT for score of 5-7, and mastectomy for 8-9.

Alternative
 * PMID 16750316 -- "Rationalization and regionalization of treatment for ductal carcinoma in situ of the breast." (Smith GL, Int J Radiat Oncol Biol Phys. 2006 Aug 1;65(5):1397-403.) Used classification below for cohort study:

 * Low risk: 0
 * Intermediate risk: 1-2
 * High risk: 3-6

title: Radiation Oncology/Breast/DCIS/Van Nuys