text:
Cookbook:Onigiri

| Cuisines | Cuisine of Japan

Onigiri (also called omusubi) is a ball or triangle of hot or cold rice, often with a filling, frequently wrapped in nori making it easier to eat. It is a popular snack food, and is also common as part of a packed lunch. Depending on your location, some convenience store chains have shelves with a large selection of fresh onigiri for sale.

The most common form of onigiri has a filling in the center. This is often something sour or salty, as it helps preserve the rice for longer periods of time. Common fillings include umeboshi (Japanese pickled plum); katsuobushi (dried bonito flakes, often called "okaka" in this case) moistened in soy sauce; cooked, salted salmon ("sake"); cod roe ("tarako"); kombu; and canned tuna ("sea-chicken") with mayonnaise. Less common is onigiri with the filling mixed in with the rice, making it spread throughout the rice.

A related dish is yaki-onigiri, which is a plain onigiri without fillings that has been brushed with soy sauce or barbecue sauce and grilled. This is a common side dish in pubs. A creative variation is a yaki-onigiri in a bowl of dashi garnished with chopped leek and katsuobushi.

Ingredients

 * 100 ml (½ cup) uncooked Japanese-style short grain rice
 * Filling of choice, such as any of the following:
 * Umeboshi (pickled plums), stones removed
 * Canned tuna, mixed with mayonnaise and seasoned to taste with chopped leeks, soy sauce, or chilies; sour or salty flavours work well.
 * Cooked salmon
 * Cooked egg
 * Katsuobushi, moistened with a small amount of soy sauce
 * Nori sheets

Procedure

 * 1) Cook the rice according to package or rice cooker directions. Let cool just enough to handle with your hands.
 * 2) While the rice is cooking, prepare your fillings.
 * 3) Fill a bowl with salt water to rinse your fingers and season the onigiri. You can fill and shape the onigiri using two different methods:
 * 4) * Method 1: Wet your hands in the salt water. Take two large spoonfuls of rice into one hand (carefully; the rice is hot), and gently squeeze and flatten it with the other. Make an indentation in the middle, and put some of the filling into the center. Be a little careful to get the filling only in the center and not all over the ball; that can make the rice less sticky, and stickiness is good. "Fold" the rice over the filling so it becomes covered. Squeeze gently, and mold it into a triangular shape by folding both your hands along the palms while keeping the fingers straight. Squeeze like that, rotating the ball a few times, and you will soon have a very neat triangle—this really is much harder to explain than to do. Once the ball is done, put it down on a clean surface to cool down. Rinse your hands in the salt water and repeat.
 * 5) * Method 2: Use a bowl and some plastic film. Place about ⅔ of the mixture into the centre of the cling wrap that has been draped into the bowl loosely. Then, add approximately 2 teaspoons of filling (this is working off of about 3–4 portions per cup of rice. Then, place the last ⅓ of the rice to the top. Then, mould the onigiri within the cling wrap. This drastically reduces mess and also is slightly more 'kid friendly'.
 * 6) Once the balls are reasonably cool, you need to protect them from drying out. The easiest way is to wrap them in cling wrap, or put them into an airtight plastic food container. When it is time to eat, take one rice ball, wrap it in a piece of nori, and eat away. If you don't mind soggy nori, you can wrap the balls in nori beforehand.

Notes, tips, and variations

 * You must use Japanese-style short grain rice; if the rice isn't sticky, the onigiri won't hold together.
 * A rice cooker is recommended since it will be far more 'hands-off' and will also free up more time to prepare the fillings.
 * There is wide latitude on what you can use as a filling. Try experimenting!
 * It is a good idea to have a moderately large, clear workspace that is easy to clean afterwards. The rice is sticky, and you will end up getting it everywhere in the area.
 * Do not use refrigerated, cold rice. Do not refrigerate the onigiri after assembling. Store in lunch cooler or thermos—otherwise the rice gets hard and doesn’t taste good. You can freeze onigiri, then microwave them to defrost.
 * Fillings for onigiri are only limited to your imagination. One point to remember is to choose fillings that are not overly hard/crunchy. If they are reasonably hard they become quite difficult to eat. Western fillings that can be quite delicious include such things as corned meats, avocado, even olives or semidried tomatoes. A recommendation is to use fillings with a lot of flavour and cut into small pieces.

title: Cookbook:Onigiri


text:
User:Diderot~enwikibooks

I respond faster to messages on my English Wikipedia account.

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

title: User:Diderot~enwikibooks


text:
Plato/Apology

Whether or not to abide by the laws and decrees of one's own country is the question addressed by Plato's "Apology." Socrates was accused and found guilty of "corrupting the youth." For this he was sentenced to death. With hindsight, and based on what we have remaining written by Socrates' friends and supporters, it appears that Socrates was unjustly accused, tried, and condemned.

Socrates points out that he voluntarily remained in his country. He participated in government appropriately. For these reasons (and others) he felt he was rationally obliged to abide by the laws and decrees.

Was Socrates right? How does this message apply to us today?

For people living in a free and open society, Socrates' argument may well be every bit as applicable today as it was 2500 years ago in Athens.

One should note that Socrates might well have saved his own life had he tempered his thoughts with a more remorseful tone. Socrates refused to compromise his principles -- i.e., that he should say precisely what he thought -- and thus he forfeited his life. In this, Socrates poses an enduring example of authenticity and integrity.

We should also note that Socrates never failed to challenge the worldview of his listeners. The Apologia, in which he suggests that, rather than killing him, the State should sustain him as a pensioner, is an example of his bold but internally-consistent style of argument. For this alone, even if his logical and philosophical contributions are ignored, Socrates' greatness should be recognized and respected.

title: Plato/Apology


text:
User:JMDent~enwikibooks

I love books. Particularly classics.

title: User:JMDent~enwikibooks


text:
Talk:Rueda de Casino

Because editing is restricted on the Rueda de Casino WikiBook, I don't know who to contact to let them know that three links in the Resources section are no longer valid! --Thanks! Casinera. Casinera (discuss • contribs) 19:04, 8 September 2013 (UTC)

Can anybody tell me about where to get a pictorial guide to learn salsa. If its on net and for free it would be great...Thanx Vipul

If anybody wants to edit this page, take careful note of the templates used, they're fairly fragile. There are some planned changes to mediawiki that will make the markup used here simpler. When I hear that they're implemented, I'll change this book so that it is easier for people to edit. Ricky Clarkson 09:37, 27 March 2006 (UTC)

maybe a place for alternative names - multiple names for one move and multiple moves for one name is common. for example i've encountered at least 3 variants of Dedo, there is confusion as to which move is setenta y seis and which is setenta complicado, and even more confusion about prima, prima con la hermana vs adios, adios con la prima vs adios (2 turns no partner shift) vs avión (same)

also, i propose this book is expanded to not just quick incoherent notes about moves but an attempt to a more systematical description. introduction could contain list of terms such as outside/inside turn, cross-handed, right to right, guapea, etc. Saur43 23:21, 14 February 2007 (UTC)

Video Links to the Wiki
I am trying to figure out where to find the info for the codecs used in the .avi links provided in wikibook index. If someone can direct me there, it would be most helpful.

Application for visualisation
Just a heads up if you want to add some pictures of the steps to this book. There is a nice free Java application, that can be used for illustrating dancing steps that already has the basic moves for all dances built in. Have a look here: http://www.sebastianbauer.info/index.php?page=simpledance If you create new moves, don't forget to write a mail to the author, so he can make them available to everyone. --84.178.123.44 (talk) 16:14, 27 April 2009 (UTC)

title: Talk:Rueda de Casino


text:
Aros/APL

What follows is a copy of the APL (the original is retained in the AROS Subversion Repository, and here for tamper reasons) for your convenience only.

AROS PUBLIC LICENSE (APL) Version 1.1 (based on the MPL)

1. Definitions.
1.0.1. "Commercial Use" means distribution or otherwise making the Covered Code available to a third party.

1.1. "Contributor" means each entity that creates or contributes to the creation of Modifications.

1.2. "Contributor Version" means the combination of the Original Code, prior Modifications used by a Contributor, and the Modifications made by that particular Contributor.

1.3. "Covered Code" means the Original Code or Modifications or the combination of the Original Code and Modifications, in each case including portions thereof.

1.4. "Electronic Distribution Mechanism" means a mechanism generally accepted in the software development community for the electronic transfer of data.

1.5. "Executable" means Covered Code in any form other than Source Code.

1.6. "Initial Developer" means the individual or entity identified as the Initial Developer in the Source Code notice required by Exhibit A.

1.7. "Larger Work" means a work which combines Covered Code or portions thereof with code not governed by the terms of this License.

1.8. "License" means this document.

1.8.1. "Licensable" means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or          subsequently acquired, any and all of the rights conveyed herein.

1.9. "Modifications" means any addition to or deletion from the substance or structure of either the Original Code or any previous Modifications. When Covered Code is released as a series of files, a Modification is:

A. Any addition to or deletion from the contents of a file containing Original Code or previous Modifications.

B. Any new file that contains any part of the Original Code or           previous Modifications.

1.10. "Original Code" means Source Code of computer software code which is         described in the Source Code notice required by Exhibit A as Original Code, and which, at the time of its release under this License is not already Covered Code governed by this License.

1.10.1. "Patent Claims" means any patent claim(s), now owned or hereafter acquired, including without limitation, method, process, and apparatus claims, in any patent Licensable by grantor.

1.11. "Source Code" means the preferred form of the Covered Code for making modifications to it, including all modules it contains, plus any associated interface definition files, scripts used to control compilation and installation of an Executable, or source code differential comparisons against either the Original Code or another well known, available Covered Code of the Contributor's choice. The Source Code can be in a compressed or archival form, provided the appropriate decompression or de-archiving software is widely available for no charge.

1.11.1 "Source Tree" means the whole Source Code or parts of the Source Code which are contained in a single directory or in a hierarchy of          directories.

1.12. "You" (or "Your") means an individual or a legal entity exercising rights under, and complying with all of the terms of, this License or a future version of this License issued under Section 6.1. For legal entities, "You" includes any entity which controls, is         controlled by, or is under common control with You. For purposes of         this definition, "control" means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by         contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity.

2. Source Code License.
2.1. The Initial Developer Grant.

The Initial Developer hereby grants You a world-wide, royalty-free, non-exclusive license, subject to third party intellectual property claims:

(a) under intellectual property rights (other than patent or trademark) Licensable by Initial Developer to use, reproduce, modify, display, perform, sublicense and distribute the Original Code (or portions            thereof) with or without Modifications, and/or as part of a Larger Work; and

(b) under Patents Claims infringed by the making, using or selling of            Original Code, to make, have made, use, practice, sell, and offer for sale, and/or otherwise dispose of the Original Code (or            portions thereof).

(c) the licenses granted in this Section 2.1(a) and (b) are effective on the date Initial Developer first distributes Original Code under the terms of this License.

(d) Notwithstanding Section 2.1(b) above, no patent license is            granted: 1) for code that You delete from the Original Code;             2) separate from the Original Code or 3) for infringements caused             by: i) the modification of the Original Code or ii) the combination             of the Original Code with other software or devices.

2.2. Contributor Grant.

Subject to third party intellectual property claims, each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license

(a) under intellectual property rights (other than patent or trademark) Licensable by Contributor, to use, reproduce, modify, display, perform, sublicense and distribute the Modifications created by            such Contributor (or portions thereof) either on an unmodified basis, with other Modifications, as Covered Code and/or as part of            a Larger Work; and

(b) under Patent Claims infringed by the making, using, or selling of            Modifications made by that Contributor either alone and/or in             combination with its Contributor Version (or portions of such             combination), to make, use, sell, offer for sale, have made, and/or otherwise dispose of: 1) Modifications made by that            Contributor (or portions thereof); and 2) the combination of             Modifications made by that Contributor with its Contributor Version (or portions of such combination).

(c) the licenses granted in Sections 2.2(a) and 2.2(b) are effective on the date Contributor first makes Commercial Use of the Covered Code.

(d) Notwithstanding Section 2.2(b) above, no patent license is            granted: 1) for any code that Contributor has deleted from the             Contributor Version; 2) separate from the Contributor Version; 3) for infringements caused by: i) third party modifications of            Contributor Version or ii) the combination of Modifications made             by that Contributor with other software (except as part of the Contributor Version) or other devices; or 4) under Patent Claims infringed by Covered Code in the absence of Modifications made by            that Contributor.

3. Distribution Obligations.
3.1. Application of License.

The Modifications which You create or to which You contribute are governed by the terms of this License, including without limitation Section 2.2.

The Source Code version of Covered Code may be distributed only under the terms of this License or a future version of this License released under Section 6.1, and You must include a copy of this License with every copy of the Source Code You distribute. You may not offer or        impose any terms on any Source Code version that alters or restricts the applicable version of this License or the recipients' rights hereunder. However, You may include an additional document offering the additional rights described in Section 3.5.

3.2. Availability of Source Code.

Any Modification which You create or to which You contribute must be        made available in Source Code form under the terms of this License either on the same media as an Executable version or via an accepted Electronic Distribution Mechanism to anyone to whom you made an        Executable version available; and if made available via Electronic Distribution Mechanism, must remain available for at least twelve (12) months after the date it initially became available, or at least six (6) months after a subsequent version of that particular Modification has been made available to such recipients. You are responsible for ensuring that the Source Code version remains available even if the Electronic Distribution Mechanism is maintained by a third party.

3.3. Description of Modifications.

You must cause all Covered Code to which You contribute to contain a        file documenting the changes You made to create that Covered Code and the date of any change. You must include a prominent statement that the Modification is derived, directly or indirectly, from Original Code provided by the Initial Developer and including the name of the Initial Developer in (a) the Source Code, and (b) in any notice in an        Executable version or related documentation in which You describe the origin or ownership of the Covered Code.

3.4. Intellectual Property Matters.

(a) Third Party Claims.

If Contributor has knowledge that a license under a third party's            intellectual property rights is required to exercise the rights granted by such Contributor under Sections 2.1 or 2.2, Contributor must include a text file with the Source Code distribution titled "LEGAL" which describes the claim and the party making the claim in sufficient detail that a recipient will know whom to contact. If Contributor obtains such knowledge after the Modification is            made available as described in Section 3.2, Contributor shall promptly modify the LEGAL file in all copies Contributor makes available thereafter and shall take other steps (such as notifying            appropriate mailing lists or newsgroups) reasonably calculated to             inform those who received the Covered Code that new knowledge has been obtained.

(b) Contributor APIs.

If Contributor's Modifications include an application programming interface and Contributor has knowledge of patent licenses which are reasonably necessary to implement that API, Contributor must also include this information in the LEGAL file.

(c) Representations.

Contributor represents that, except as disclosed pursuant to            Section 3.4(a) above, Contributor believes that Contributor's             Modifications are Contributor's original creation(s) and/or Contributor has sufficient rights to grant the rights conveyed by            this License.

3.5. Required Notices.

You must duplicate the notice in Exhibit A in each file of the Source Code. If it is not possible to put such notice in a particular Source Code file due to its structure, then You must include such notice in        a location (such as a relevant directory) where a user would be likely to look for such a notice. If You created one or more Modification(s) You may add your name as a Contributor to the notice described in        Exhibit A. You must also duplicate this License in any documentation for the Source Code where You describe recipients' rights or ownership rights relating to Covered Code. You may choose to offer, and to        charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Code. However, You may do so only on Your own behalf, and not on behalf of the Initial Developer or any Contributor. You must make it absolutely clear than any such warranty, support, indemnity or liability obligation is        offered by You alone, and You hereby agree to indemnify the Initial Developer and every Contributor for any liability incurred by the Initial Developer or such Contributor as a result of warranty, support, indemnity or liability terms You offer.

3.6. Distribution of Executable Versions.

You may distribute Covered Code in Executable form only if the requirements of Section 3.1-3.5 have been met for that Covered Code, and if You include a notice stating that the Source Code version of        the Covered Code is available under the terms of this License, including a description of how and where You have fulfilled the obligations of Section 3.2. The notice must be conspicuously included in any notice in an Executable version, related documentation or        collateral in which You describe recipients' rights relating to the Covered Code. You may distribute the Executable version of Covered Code or ownership rights under a license of Your choice, which may contain terms different from this License, provided that You are in        compliance with the terms of this License and that the license for the Executable version does not attempt to limit or alter the recipient's        rights in the Source Code version from the rights set forth in this License. If You distribute the Executable version under a different license You must make it absolutely clear that any terms which differ from this License are offered by You alone, not by the Initial Developer or any Contributor. You hereby agree to indemnify the Initial Developer and every Contributor for any liability incurred by        the Initial Developer or such Contributor as a result of any such terms You offer.

3.7. Larger Works.

You may create a Larger Work by combining Covered Code with other code not governed by the terms of this License and distribute the Larger Work as a single product. In such a case, You must make sure the requirements of this License are fulfilled for the Covered Code.

4. Inability to Comply Due to Statute or Regulation.
If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Code due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be included in the LEGAL file described in Section 3.4 and must be included with all distributions of the Source Code. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it.

5. Application of this License.
5.1. Attached license.

This License applies to code to which the Initial Developer has attached the notice in Exhibit A and to related Covered Code.

5.2. Detached license.

This License applies to code which is part of a Source Tree containing this license in a file named LICENSE or license.html at the top of its hierarchy and which is not explicitly covered by a        different license.

6. Versions of the License.
6.1. New Versions.

The AROS development team may publish revised and/or new versions of        the License from time to time. Each version will be given a        distinguishing version number.

6.2. Effect of New Versions.

Once Covered Code has been published under a particular version of        the License, You may always continue to use it under the terms of that version. You may also choose to use such Covered Code under the terms of any subsequent version of the License. No one other than the AROS development team has the right to modify the terms applicable to        Covered Code created under this License.

7. DISCLAIMER OF WARRANTY.
COVERED CODE IS PROVIDED UNDER THIS LICENSE ON AN "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES THAT THE COVERED CODE IS FREE OF DEFECTS, MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE OR NON-INFRINGING. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE COVERED CODE IS WITH YOU. SHOULD ANY COVERED CODE PROVE DEFECTIVE IN ANY RESPECT, YOU (NOT THE   INITIAL DEVELOPER OR ANY OTHER CONTRIBUTOR) ASSUME THE COST OF ANY NECESSARY SERVICING, REPAIR OR CORRECTION. THIS DISCLAIMER OF WARRANTY CONSTITUTES AN ESSENTIAL PART OF THIS LICENSE. NO USE OF ANY COVERED CODE IS AUTHORIZED HEREUNDER EXCEPT UNDER THIS DISCLAIMER.

8. TERMINATION.
8.1. This License and the rights granted hereunder will terminate automatically if You fail to comply with terms herein and fail to cure such breach within 30 days of becoming aware of the breach. All sublicenses to the Covered Code which are properly granted shall survive any termination of this License. Provisions which, by their nature, must remain in effect beyond the termination of this License shall survive.

8.2. If You initiate litigation by asserting a patent infringement claim (excluding declatory judgment actions) against Initial Developer or a        Contributor (the Initial Developer or Contributor against whom You         file such action is referred to as "Participant") alleging that:

(a) such Participant's Contributor Version directly or indirectly infringes any patent, then any and all rights granted by such Participant to You under Sections 2.1 and/or 2.2 of this License shall, upon 60 days notice from Participant terminate prospectively, unless if within 60 days after receipt of notice You either: (i) agree in writing to pay Participant a mutually agreeable reasonable royalty for Your past and future use of            Modifications made by such Participant, or (ii) withdraw Your litigation claim with respect to the Contributor Version against such Participant. If within 60 days of notice, a reasonable royalty and payment arrangement are not mutually agreed upon in            writing by the parties or the litigation claim is not withdrawn, the rights granted by Participant to You under Sections 2.1 and/or 2.2 automatically terminate at the expiration of the 60 day notice period specified above.

(b) any software, hardware, or device, other than such Participant's            Contributor Version, directly or indirectly infringes any patent, then any rights granted to You by such Participant under Sections 2.1(b) and 2.2(b) are revoked effective as of the date You first made, used, sold, distributed, or had made, Modifications made by            that Participant.

8.3. If You assert a patent infringement claim against Participant alleging that such Participant's Contributor Version directly or indirectly infringes any patent where such claim is resolved (such as by license        or settlement) prior to the initiation of patent infringement litigation, then the reasonable value of the licenses granted by such Participant under Sections 2.1 or 2.2 shall be taken into account in        determining the amount or value of any payment or license.

8.4. In the event of termination under Sections 8.1 or 8.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or any distributor hereunder prior to        termination shall survive termination.

9. LIMITATION OF LIABILITY.
UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, WHETHER TORT (INCLUDING   NEGLIGENCE), CONTRACT, OR OTHERWISE, SHALL YOU, THE INITIAL DEVELOPER, ANY OTHER CONTRIBUTOR, OR ANY DISTRIBUTOR OF COVERED CODE, OR ANY SUPPLIER OF   ANY OF SUCH PARTIES, BE LIABLE TO ANY PERSON FOR ANY INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES OF ANY CHARACTER INCLUDING, WITHOUT LIMITATION, DAMAGES FOR LOSS OF GOODWILL, WORK STOPPAGE, COMPUTER FAILURE OR MALFUNCTION, OR ANY AND ALL OTHER COMMERCIAL DAMAGES OR LOSSES, EVEN IF   SUCH PARTY SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF SUCH DAMAGES. THIS LIMITATION OF LIABILITY SHALL NOT APPLY TO LIABILITY FOR DEATH OR   PERSONAL INJURY RESULTING FROM SUCH PARTY'S NEGLIGENCE TO THE EXTENT APPLICABLE LAW PROHIBITS SUCH LIMITATION. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION OR LIMITATION OF INCIDENTAL OR CONSEQUENTIAL DAMAGES, SO THIS EXCLUSION AND LIMITATION MAY NOT APPLY TO YOU.

10. U.S. GOVERNMENT END USERS.
The Covered Code is a "commercial item", as that term is defined in 48 C.F.R. 2.101 (Oct. 1995), consisting of "commercial computer software" and "commercial computer software documentation", as such terms are used in 48 C.F.R. 12.212 (Sept. 1995). Consistent with 48 C.F.R. 12.212 and 48 C.F.R. 227.7202-1 through 227.7202-4 (June 1995), all U.S. Government End Users acquire Covered Code with only those rights set forth herein.

11. MISCELLANEOUS.
This License represents the complete agreement concerning subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it   enforceable.

12. RESPONSIBILITY FOR CLAIMS.
As between Initial Developer and the Contributors, each party is   responsible for claims and damages arising, directly or indirectly, out of    its utilization of rights under this License and You agree to work with Initial Developer and Contributors to distribute such responsibility on an   equitable basis. Nothing herein is intended or shall be deemed to   constitute any admission of liability.

13. MULTIPLE-LICENSED CODE.
Initial Developer may designate portions of the Covered Code as   "Multiple-Licensed". "Multiple-Licensed" means that the Initial Developer permits you to utilize portions of the Covered Code under alternative licenses specified by the Initial Developer in the file described in   Exhibit A.

EXHIBIT A - AROS Public License.
"The contents of this file are subject to the AROS Public License Version 1.1 (the "License"); you may not use this file except in compliance with the  License. You may obtain a copy of the License at  http://www.aros.org/license.html  Software distributed under the License is distributed on an "AS IS" basis,  WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for  the specific language governing rights and limitations under the License.  The Original Code is ______________________________________.  The Initial Developer of the Original Code is ________________________.  Portions created by  ______________________ are Copyright (C) ______ _______________________.  All Rights Reserved.  Contributor(s): ______________________________________.  Alternatively, the contents of this file may be used under the terms of the  _____ license (the [___] License), in which case the provisions of [______] License are applicable instead of those above. If you wish to allow use of your version of this file only under the terms of the [____] License and not to allow others to use your version of this file under the APL, indicate your decision by deleting the provisions above and replace them with the notice and other provisions required by the [___] License. If you do not delete the provisions above, a recipient may use your version of this file under either the APL or the [___] License."

title: Aros/APL


text:
Cookbook:Pasta Marinata

| Cuisine of Italy

Pasta marinata (Italian for "marinaded dough") is a batter used when frying food. It is good for battering meat, fish, vegetables, or sweets which are to be fried in the Italian manner. The recipe is sourced from The Cook's Decameron: A Study In Taste, Containing Over Two Hundred Recipes For Italian Dishes from a project that puts out-of-copyright texts into the public domain. This is from a very old source and reflects the cooking at the turn of the 20th century. Update as necessary.

Ingredients

 * 2 ounces semolina flour
 * 2 eggs, separated
 * Salt to taste
 * 2 ounces melted butter (or olive oil)
 * About 8 ounces water

Procedure

 * 1) Mix the semolina flour, egg yolks, a little salt, and melted butter.
 * 2) Add the water so as to form a liquid substance.
 * 3) Whip the egg whites to soft peaks, and fold into the batter.

Notes, tips, and variations

 * If for meat or vegetables add a few drops of vinegar or a little lemon juice.

title: Cookbook:Pasta Marinata


text:
Cookbook talk:Pasta Marinata

This module, or a earlier version of it, was previously published in the Wikipedia article Pasta marinata. The page history at the time the page was moved is listed below.

 * (cur) (last) 13:19, 30 Jun 2004 Gtrmp
 * (cur) (last) 13:37, 5 Jan 2003 Renata
 * (cur) (last) 08:51, 25 Feb 2002 Conversion script m (Automated conversion)

title: Cookbook talk:Pasta Marinata


text: User:Icairns

title: User:Icairns


text:
User talk:24.155.128.4

You should respect the work of others. Please stop vandalizing Wikibooks, or you might be banned. Gentgeen 23:52, 10 Sep 2004 (UTC)

title: User talk:24.155.128.4


text:
Wikibooks talk:Physics bookshelf

A question
Would it be true that lines of a (dimension) forces don’t occupy the same space (except where the are distorted by the influence of another  (crossed))?? laubesb@nex.net.au steven
 * I am not really sure that this is the best place to put such a question. This is the talk page for of the contents article, and is supposedly for discussing the contents of the Physics section, specifically whether something should or shouldnt be in the Physics section, whether it has an appropriate name, whether it ought to be placed in a different position, etc.--81.157.101.101 19:34, 25 Oct 2004 (UTC)

NPOV

 * A lot of the subjects covered in Quantum Field Theory (Postgraduate) are considered Undergraduate subjects in the UK. Is there a way to remove this US bias? --81.157.101.101 19:30, 25 Oct 2004 (UTC)

 * But quantum field theory is not an undergraduate topic in the UK. Theresa knott 14:39, 28 Oct 2004 (UTC)

Radiation Physics
This is s large subject with many practical applications for example in medicine and nuclear power generation. Should it not be included as a sub-topic?

Consolidation
This links to a huge number of works. When I first found this page, I didn't think it was a list of textbooks on Wikibooks but more of a... hodgepodge thrown together hapharzardly. All of these works need to be consolidated, somehow... Perhaps there could be several levels of physics textbooks - Middle School, High School, College, Graduate? And then this page could link to other Wikibooks on Electromagnetism, Optics, Electronics and other topics that are more on the fringe - when I think of physics, I think objects in motion, touching on waves, touching on gravity, but mostly forces, work, some energy, collisions, velocity, acceleration, etc.

I would be willing to head a WikiProject on the Physics textbooks. It's very important to me to have a focused, comprehensive, and overall well put-together text here. I'll do what I can, if anyone else is with me. LockeShocke 03:57, 22 Nov 2004 (UTC)

Physics experiments: household items / low budget schools
Noticing that schools (and populations which are curious but can't afford the tools) are increasingly having lower budgets to conduct physics experiements, i propose that we make some kind of project that takes common household items and uses them to create experiments.

if your interested in collaborating with me to create such experiments, than contact me on my discussion page at compatta

(ex) measuring resistance qualitatively using a wheatstone bridge, qualitatively conclude the resistance of the object that is inserted. (multimeters are pretty expensive)

Free physics textbook
Can someone check this out?

http://www.motionmountain.net/

Apparently, someone has put a FREE, 1200 page physics textbook on the web. It's copyrighted, so we can't just move the whole thing onto Wikibooks, but maybe someone wants to contact the author and inform him that Wikibooks exists, he might grant special permission or something...

If somebody helps me, I am ready to put a test chapter on wikibooks. Christoph Schiller

 * I would be more then happy to help you. What can I do to help? --Whiteknight (talk) (projects) 16:58, 7 August 2006 (UTC)

Needs improvement
This page blows, I think that a lot of the information is there, and just badly organized, so I am going to start a comprehensive "cleaned up" version under everything else. I am not really sure if this is the best way of doing this, but I don't want to wipe the page first, nor do I think starting a new one on top of the several other pages is a good idea. Anyone wants to help me, send me a message, and I will be very happy that day. Sameer Kale 23:15, 4 May 2007 (UTC)

SklogWiki
Would it be possible to add a link to the fledgling statistical mechanics and thermodynamics wiki SklogWiki (http://www.sklogwiki.org) in the "Other online resources" section? --SklogWiki 13:25, 3 July 2007 (UTC)

 * Done. --DavidCary (talk) 00:34, 13 May 2008 (UTC)

Orphaned Modules
While traversing the orphaned pages list, I came across this module which should probably be placed on the shelf, but I'm not sure where it would go. I'll probably come across a few more as I go through, so consider this the start of a list. Xerol Oplan (talk) 09:13, 16 July 2008 (UTC)
 * A New Model of the Atom

Broken Link
The first link under offsite physics books is broken. The URL should be http://www.lightandmatter.com/books.html

I'd fix it if I could....but I can't.

 * ✅ You might want to create an account to edit pages such as this one, among other things.

 * S Pat   talk 11:29, 21 September 2008 (UTC)

title: Wikibooks talk:Physics bookshelf


text:
Talk:Robotics/Components/Actuation Devices/Air muscle

 * Robo:Muscles is unformatted and, in its present state, garbage. I tried to format it, but I can't make heads or tails of it. Even if someone can understand (and format) this, it doesn't belong here. It's an essay, and it's not even specifically about muscles.-Anon
 * Um it's about robotics. I don't think it needs deleting Theresa knott 13:13, 1 Jul 2004 (UTC)

Several sections of this module appear to be word-for-word identical to "A Cockroach Inspired Robot with Artificial Muscles" by Kingsley, Quinn, and Ritzmann.

What is the right thing to do? --DavidCary (talk) 21:56, 10 November 2008 (UTC)


text:
Talk:Physics Study Guide/Momentum

the specific density of the mass the object is moving through is not a concern for the sake of the exercise???? true or false

The table of contents seems to imply that this section talks about collisions, but there is no mention of collisions. 74.62.164.117 (talk) 03:58, 21 October 2010 (UTC)

title: Talk:Physics Study Guide/Momentum


text:
Cookbook:Easy Scrambled Eggs

| Eggs

This is a simple recipe for scrambled eggs.

Ingredients

 * Eggs
 * Butter, margarine, oil or cooking spray (enough to coat pan)
 * Salt to taste
 * Pepper to taste

Method 1

 * 1) Heat frying pan (non-stick or well-seasoned cast iron is preferable) to medium, and add enough butter, oil, or cooking spray to coat bottom.
 * 2) Crack desired number of eggs into a bowl.
 * 3) Add milk or water to eggs, if desired. Season with salt and pepper to taste (other herbs and spices may be used as well).
 * 4) Beat eggs gently with fork or whisk for 15–20 seconds. It is not necessary to make a completely uniform mixture.
 * 5) Add egg mixture to heated, greased pan.
 * 6) With a spatula or spoon (avoid metal tools if using teflon pan), continuously and gently scrape cooked egg from pan. The length of time and the frequency with which you scrape will determine the consistency of the eggs and is a matter of personal preference. The time will vary from 30 seconds to 3 or more minutes depending on number and type of eggs, size and heat of pan, and personal preference.

Method 2 – Microwave

 * 1) Grease bowl before cracking one to two eggs into bowl. Mix gently.
 * 2) Microwave on high for 40 seconds to 2 minutes. Actual cooking time will vary. A rule of thumb is to watch eggs for entire time and stop microwave when entire mixture has risen somewhat. If it explodes, you waited too long. Egg(s) will come out in shape of the bowl; depending on the size of the bowl, this method is very useful for making an appropriate size egg patty for a sandwich.

Method 3

 * 1) Heat a non-stick frying pan with the bottom covered in butter, margarine, oil or cooking spray over medium heat.
 * 2) Crack eggs directly into pan.
 * 3) Immediately begin mixing while lightly sprinkling with salt for 5 seconds.
 * 4) Continue mixing until eggs are thoroughly scrambled and mixed.
 * 5) Turn off heat, and wait 1 minute for eggs to cool.

Notes, tips, and variations

 * Southwestern Scramble and the various Omelet Recipes are variations of scrambled eggs.
 * The additional ingredient possibilities are virtually limitless. It is common to add a small amount of cream, milk or water (about ½ teaspoon per egg) to the egg mixture before cooking (will make eggs fluffier). Cheese is also popular, and should be added near the end of cooking. Other ingredients to try include: ham, mushrooms, onions, peppers, sausage, tomatoes, olives, bacon, shaved truffles, smoked turkey, spinach, broccoli, tarragon, chives, parsley and asparagus. Dijon mustard is also good mixed into the egg mixture prior to cooking.

title: Cookbook:Easy Scrambled Eggs


text:
XBasic

Components

 * Editor (writing computer code)
 * Compiler (creating code)
 * Debugger (checking for errors)
 * Libraries (ready made 'internal' code to call on)
 * GuiDesigner (creates the 'look and feel' of the program)
 * Signed and unsigned 8-bit, 16-bit and 32-bit and signed 64-bit integers
 * 32- and 64-bit floating point values. The string datatype is only for 8-bit characters.
 * Generates an assembly language file.
 * XBasic has a Windows only version called XBLite
 * SourceForge development

Chat using the java chat
[click here to join forum]

senior XBasic developers will be there to take your praise and questions (have them ready)

Attending: (senior Developers) Vic, Eddie, Steve

just click on edit to add your name to say you will be attending

Time: Starting Sunday at Sept 19 2004 at 1600 GMT

Then every 3rd Sunday of the month

Next meeting Sunday November 21 2004

History
XBasic is a variant of the BASIC programming language. Xbasic was developed in the late 1980s for the Motorola 88000 CPU and Unix. In the early 1990s XBasic was ported to Windows and Linux. Since 1999 it has been available as Open Source software.

Making a Standalone Executable
XBasic programs can be compiled to create an executable just by double-clicking the program's MAK file. The following method works for XBasic V6.2.0 and above, in Windows 95; it should also work with later Windows versions.

The setup needs to be done only once. In all of the following, replace '\XBasic with the path to your XBasic directory.

1. Using a text editor (Notepad will do), put the following lines in your AUTOEXEC.BAT. Do not put any spaces or tabs around the "=".

SET XBDIR=\XBasic

SET PATH=%XBDIR%\bin;%PATH%

SET INCLUDE=%XBDIR%\include;%INCLUDE%

SET LIB=%XBDIR%\lib;%LIB%

If the path to your XBasic directory contains spaces (eg., \Program Files\xb), then it may be necessary to use quotes around the paths, as for example

SET PATH="%XBDIR%\bin";%PATH%

These lines should be placed after any existing definitions of the PATH, INCLUDE, or LIB variables. Save the edited AUTOEXEC.BAT, and re-boot.

2. Make sure the following files are in the appropriate XBasic directories:

\XBasic\bin spasm.exe    nmake.exe     link.exe

\XBasic\include xbasic.mak

\XBasic\lib xstart.o, and all RESOURCES, STDLIBS, and LIBS listed in xbasic.mak and in your own .mak file:

advapi32.lib comdlg32.lib gdi32.lib kernel32.lib msvcrt.lib user32.lib winspool.lib xb.lib xb.rbj

(There will be more if your program IMPORTs anything other than these libraries or the standard XBasic libraries.)

3. Create the text file NMAKE.BAT, containing the following line

"%XBDIR%\bin\nmake.exe" %1

and save it - for example, in the \XBasic\bin directory. The quotes are only necessary if your XBasic directory path contains spaces (eg., \Program Files\xb). The purpose of this BAT is just to keep the DOS window open when nmake.exe has finished, so you can see results of the compilation.

4. From Explorer's View menu, select Options, then File Types to associate MAK files with NMAKE.BAT. Make this the Default association for this file type.

If you aren't familiar with this procedure, then an alternative is to double-click any .mak file. An "Open With" dialog will appear, asking you which program you want to use to open .mak files. Click "Other", then go to the folder containing nmake.bat, and select it. Also, make sure the checkbox 'Always use this program to open this file' is checked.

This completes the setup. Now whenever you want to create an EXE, just select 'assembly' from the 'run' menu in the PDE - which creates the .s and .mak files - then double-click the .mak file. Or, run XBasic from the command line, using the command xb myprogram.x. Create a DLL the same way, but select 'library' from the 'run' menu instead (or run xb myprogram.x -lib). (For more information on making a DLL, see Multiple Module Programs.)

One hint: Save the .x source before creating the .s and .mak files, not after. If the source is saved after the assembly (.s) file is created, then nmake will see the .s file as being older than the .x file, and will invoke xb.exe to re-compile the .x.

When running your EXE, remember that you should have copied xbrun.dll into your \Windows folder, and re-named it xb.dll. Also, you can run the EXE from any folder except the XBasic\bin folder; if you run it in this folder, it will link to the wrong xb.dll, and start up the PDE instead of running your program.

Collaborative Project
please add your contributions

Here is how : Help:Editing

Is Opensource the best place for collaborative projects? I am sure there must be simpler tools?

Idea 1
Xbasic on a USB stick (and/or self booting CD)

I recently put Puppy Linux on a 64 meg USB stick

Maybe a dual booting CD (Linux and Windows)

ReactOS that is developing an Open Source

Windows NT)

Idea 2
XBasic Wizards

One of the things we hear on the forum again and again

is I have just started etc

How do I etc

Well how about a list of questions

and paremeters set and then the required functions are added

This would mean that nay code we are familiar with could be added

Idea 3
. . . Your idea here. ..

Code examples

Look here to see some screenshots of projects completed using XBasic. These are programmes developed for airlines in Iceland by Stefan Saemundsson:

XBasic Program screenshot

XBasic another program screenshot

add your links here

Future Developments
A regularly updated XBLite is a Windows only version which aims to use the API of Windows to reduce the code size.

A new update of Xbasic is expected before the end of 2004

A new version XBasic 2 that generates C code rather than assembler is also being created.

title: XBasic


text:
User:Quite/monobook.css

/* some adjustments to the uuggllyy monobook style */

/*** change background for non-article pages ***/

/* .ns-3 { background: Red; } */

/******************************************************************/ /* Standard fonts with serifs on light grayish background        */ /*                                                               */ /* v 0.11 - 01.06.2004                           User:Tillwe  */ /******************************************************************/   color:#000000; background: #fefefc; font: x-small Times,"Times New Roman",serif; font-size:123%; margin: 2.3em 1.0em 0 10.5em; /* top right bottom left */ border-right: 1px solid #aaaaaa; }
 * 1) content {

h1, h2, h3, h4, h5, h6 { color: Black; font-family: Helvetica, Arial, sans-serif; font-weight: bold; margin: 0 6.5em 0 0; padding-top: 0.5em; padding-bottom: 0.17em; border-bottom: 1px solid #aaaaaa; } h1 { font-size: 160%; } h2 { font-size: 132%; } h3, h4, h5, h6 { border-bottom: none; } h3 { font-size: 116%; } h4 { font-size: 100%; } h5 { font-size: 80%; } h6 { font-size: 60%; }

hr { height: 1px; color: #aaaaaa; background-color: #aaaaaa; border: 0; margin: 0.2em 8.5em 0.2em 0; }

p { margin: 0.4em 8.5em 0.7em 0em; line-height: 1.25em; font-size:110%; }

ol, ul { margin: 0.3em 8.5em 0 1.5em; }

td, td p { margin: 0.1em 0.1em 0.1em 0.1em; }

td ol, td ul { margin: 0.1em 0.1em 0.1em 1.5em; }

dd { line-height: 1.25em; font-size:110%; margin: 0.4em 8.5em 0.7em 2em; }

dl { font-size:91% }

dd dl dd { line-height: 1.25em; margin: 0.4em 0em 0.7em 2em; }

pre { font-size:90%; margin: 0.4em 8.5em 0.7em 0em; }

margin-bottom:0.0em; } .firstHeading { margin-bottom:0.1em; }
 * 1) bodyContent h1,
 * 2) bodyContent h2,
 * 3) bodyContent h3,
 * 4) bodyContent h4,
 * 5) bodyContent h5 {

font-family: Helvetica, Arial, sans-serif; }
 * 1) toc {
 * 1) toc .tocline { margin-bottom: 0.2em; }
 * 2) toc .tocindent{ font-size:90% }

/* correcting problems with nav and toolbox */

width: 10.8em; border: none; margin: 0 0 0.5em 0em; float: none; overflow: hidden; font-size: 95%; background: White; border-collapse: collapse; border: 1px solid #aaaaaa; padding: 0 0.8em 0.3em .5em; }   line-height: 1.5em; list-style-type: square; list-style-image: url("/style/monobook/bullet.gif");
 * 1) p-nav .pBody {
 * 1) p-nav ul {

font-size:95%; margin: 0.3em 0 0 1.5em; padding:0; text-align:left; text-transform: none; }

width: 10.8em; border: none; margin: 0 0 0.5em 0em; float: none; overflow: hidden; font-size: 95%; background: White; border-collapse: collapse; border: 1px solid #aaaaaa; padding: 0 0.8em 0.3em .5em; }   line-height: 1.5em; list-style-type: square; list-style-image: url("/style/monobook/bullet.gif");
 * 1) p-tb .pBody {
 * 1) p-tb ul {

font-size:95%; margin: 0.3em 0 0 1.5em; padding:0; text-align:left; text-transform: none; }

width: 10.8em; border: none; margin: 0 0 0.5em 0em; float: none; overflow: hidden; font-size: 95%; background: White; border-collapse: collapse; border: 1px solid #aaaaaa; padding: 0 0.8em 0.3em .5em; }   line-height: 1.5em; list-style-type: square; list-style-image: url("/style/monobook/bullet.gif");
 * 1) p-lang .pBody {
 * 1) p-lang ul {

font-size:95%; margin: 0.3em 0 0 1.5em; padding:0; text-align:left; text-transform: none; }

title: User:Quite/monobook.css


text:
Pro Engineer/Getting the best from support

When contacting PTC's support people, it is important to bear in mind a number of suggestions in order to help them help you.

 * First, remember that even if it is an emergency for you, they can't know that without you telling them. They will frequently ask, but if this is a situation where you need an answer on the same day, or the next day, politely let them know, and explain to them why; the more they know about your situation, the more they can tailor the answer to it.  At the same time, keep in mind that if you're calling them at the 11th hour, the time remaining before your deadline might not be enough for them to give you the most meaningful answer.  In most cases, they will try, however.

 * To avoid the unhappy situation of calling Support in an emergency, try to envision possible trouble spots in a project beforehand. Ask them about possible pitfalls of one approach versus another, and chances are they will be able to enumerate the pros and cons.  If nothing else, you can at least use this to obtain a call number that will get you right through if you're running into trouble at a later stage.

 * Use the Web utilities to open calls. If you don't like waiting on the phone, just don't wait; they really do make it very easy to avoid, and while sometimes there will be a wait for a callback, at least your neck and shoulder aren't stiff from cradling the phone, and you've gotten some work done.

 * When exchanging voicemail with them, always give the call number, even if you just gave it to the operator. When returning a call in the initial stages of discussing an issue, give them information to start off with.  If the initial call description didn't have much, let them know what they should be looking at; the more you tell them, the more, and the sooner they can help you.

 * When you upload data, always zip up the files. It doesn't matter if they're small, they're just more likely to get through intact if they're zipped up.  Always be sure to follow their directions when sending data, to avoid wasting your time with multiple emails.

 * If you're planning on sending a screenshot, but there's no problem with sending a model, just send the model. A screenshot is only useful if you think they don't believe you, and really, they've no reason not to.  The model is far more useful to troubleshoot a problem, and, in many cases, not much bigger than the screenshot.

 * In most cases, if they figure out what needs to be done with a model, they won't be able to send it back, for a variety of reasons. If you don't think you'll be able to do it on your own, have them walk you through it using WebEx, or request a detailed writeup over email (which is useful to refer back to as well).

 * For an issue where Pro/ENGINEER exits, try the same thing multiple times. If it is not repeatable, make a note of it, but hold off on contacting Technical Support, as there probably won't be much they can do.  If it is repeatable, try it with the config.pro option GRAPHICS set to WIN32_GDI (on Windows), and restart Pro/ENGINEER.  If it ceases to happen at that point, it's a graphics card-related issue, and you might want to upgrade your graphics drivers.  If it still happens, then you can save a lot of time in their investigation of the issue.  If you send PTC a trail file, make it as simple as possible, with all files in the working directory, and no special configs or mapkeys.


text:
User talk:24.170.62.206

Hello, and welcome to Wikibooks. I noticed that you created Cookbook:Easy Scrambled Eggs, and then you blanked it, so I thought I should note that your contributions are very welcome, and we're grateful for them. Why don't you create an account and stay at Wikibooks? It's quick and doesn't require any information beyond a username and password. Guanaco 17:44, 11 Sep 2004 (UTC)

title: User talk:24.170.62.206


text:
Category:American recipes

Recipes from the United States.

ko:분류:미국 요리 nl:Categorie:Amerikaanse keuken

title: Category:American recipes


text:
Introduction to Psychology/Scientific method

Scientific Method is a misleading term because there is no single method of science.

A more accurate term would be Scientific Best Practices.

Science is a search for truth about the natural world.

In the past, Science was called Natural Philosophy.

Philosophy is a discipline that humans use to discover truth.

Natural is a word we use to describe anything not made by humans.

So then, Science is the search for truth about nature.

Different scientists use different methods depending on what they study.

The field of science that studies stars and galaxies is called Astronomy. It is not possible for humans to perform experiments on stars and galaxies. Chemistry studies how atoms and molecules react to form different molecules. Chemists can experiment directly with the atoms and molecules that they study. Both Astronomy and Chemistry are sciences. But each science uses very different methods to discover the truth about nature.

In general all sciences use two kinds of information to study nature. Observations of natural phenomenon are recorded and are called Data. Ideas that explain observations are called a Hypotheses. Scientists share data, the steps used to collect the data, and their ideas that explain the data. When many people have reproduced a set of observations and think that a particular hypotheses is true, the hypothese may become a Theory.

The open sharing of information has been part of science for hundreds of years. In recent years, some sharing of information has become controlled by greed. Corporations attempt to own scientific discoveries that their employees make.


text:
User:Bodyjar89

Josh Harmon is a sophomore who wants to contribute to Wikibooks as both a study aid for himself and as a public service to those who need assistance with their courses. He believes that knowledge should not be a purchase, it should be a donation, and therefore finds the prices of textbooks ludicrously high.

So far he has contributed to the European History text and plans to make this his first major project.

Josh can be reached at webhed89@pacbell.net

title: User:Bodyjar89


text:
Japanese/Grammar/Politeness

_: See also:
 * Japanese/Lessons/Introduction/Konnichiwa/Formality
 * Japanese/Grammar/Honorifics
 * Japanese/Lesson Giving and Receiving and Japanese/Grammar/Giving
 * Japanese/Lessons/Personal pronouns

Politeness in Japanese language is important when speaking to anyone; being punched in the face or getting fired by your employer are prime examples of what can happen when being impolite by simply speaking!

The Japanese society can be thought of like a ladder: at the top rungs are those of the highest social standing (royalty, company CEOs, high-ranking government officials, high-ranking religious figures, and so on), and then below them are the common people, and then the scum of the earth even farther below. These distinctions are quite evident in how people act around others and how they act towards them. While all cultures reflect this on some level, Japanese culture revolves around it.

From the bottom of the social ladder upwards, the Japanese language changes in sometimes subtle, sometimes noticeable ways. Let's start in the middle, with Standard Polite language. This is comprised of ていねい (teinei, or polite) verbs, grammar, and nouns. (As a side note, all foreigners should begin learning Japanese with Standard Polite forms, then move around from there.) One would use verbs ending in -ma + the ending, standard honorifics when required, and state the subject every few times once understood until the subject changes. Even further upwards, at the top, highly irregular verbs replace the more common ones, one would speak in a way to make the listener or object more honored and the speaker lower and humbler.

Going down the social ladder, the language becomes simpler, rougher, and even rude to some. The subject, once understood, can be dropped altogether at first. It would become highly repetitive to constantly say the subject over and over once understood by the listener. While this facet of informality is seen in all levels of Japanese language formality, it becomes more and more prominent in informal speech. One can replace the polite copula "desu" with the simple copula "da," or drop it altogether. Simple forms of verbs and adjectives are used more often. Vulgar or taboo words appear more frequently. Honorifics are rarely seen, if at all. Talking in this way to higher ranking people than yourself is comparable to obliviating your social life and your chances to advance in rank.

An example chart of comparitive polite forms is below.

title: Japanese/Grammar/Politeness


text:
Japanese/Grammar/Honorifics

In Japanese society people are "ranked" based on their age, job or grade level, and other criteria. The Japanese language reflects this: there is a sophisticated grammatical system in place as well as a specialized vocabulary able to express ample nuances of politeness. This is called the honorifics system.

Verbs (動詞 - Doushi)
Japanese has three different ways to express formality in verbs: the plain form (くだけた, kudaketa, "chatty" or "impolite"), the simple polite form (ていねい, teinei, "polite") and the advanced polite form (敬語, keigo, "honorific language"). Kudaketa verbs build off the dictionary form of a verb. Teinei verbs build off the stem of a verb + ma + the tense endings. Keigo is usually formed by archaic or highly irregular verbs that can be divided into two further groups: 尊敬語, sonkeigo, or honorific, and 謙譲語, kenjougo, or humble language. Sonkeigo" is an honorific way of speaking in which you elevate the rank of the person you're speaking to or about way above your own. Kenjougo is a humble way of speaking in which you humble yourself or lower your rank below the person you're speaking to.

Below is a chart comparing kudaketa verbs to teinei verbs.

* These forms are not used commonly. Usually, the plain forms of the conjunctive and conditional tenses would be used.

On the conjunctive, also known as the "-te form:" This is used as a variety of tenses but mainly when several verbs come in succession of each other (私はピザを食べて、眠りました. - Watashi wa piza wo tabete, nemurimashita. - I ate pizza, then slept.)

Regular Keigo Verb Forms

Irregular Keigo Verb Forms

The おいでになります oideninarimasu comes from the regular forms above applied to the old verb いづ izu (= modern 出る deru).

Honorifics (敬語 - Keigo)
A variety of ways can be employed to make words polite or impolite. One way that can be used is simply choosing a certain word (i.e., instead of using あなた (anata) to refer to the second person, one can use their name) or employ the usage of special affixes. Notably one of the most common is -さん (-san), used to denote something like Mr./Mrs./Ms. onto a name. A list of affixes is below.

* -こうはい (kohai) is rarely used as an affix. Most people in a senpai position would use -くん (kun) instead.

Note that -くん (kun) is a somehow (not strictly, just more often) preferred affix speaking to or between boys (although boyfriends are sometimes addressed with -ちゃん). Girls tend to use -ちゃん (chan) in a similar manner, although -くん (kun) is also used sometimes. Unlike -さん (san) which is commonly used with a family name, these two affixes can also be used with given names (moreover, the name used may be shortened in front of these two affixes).

-さま (sama) is also commonly used when addressing customers

title: Japanese/Grammar/Honorifics


text:
User:Bdesham/monobook.css

/* */ /* bdesham's monobook.css version 2007-07-07

/* general */

body { font-family: "Palatino", "Palatino Linotype", "urw palladio l", "URW Palldio L", "Palladio", "Zapf Calligraphic", serif; /* if there's palatino, I'm gonna use it */ line-height: 1.1em; }

h1 { text-shadow: 2px 2px 3px #cccccc; }

textarea { font-size: 10pt; font-family: /* "DejaVu Sans", "Bitstream Vera Sans", */ "Lucida Grande", "Helvetica", sans-serif; background-color: #eeeeee; color: #000030; }

blockquote { border-left: 2px solid #dddddd; padding-left: 1.5em; margin-left: 1.5em; font-size: 12pt; }

div#bodyContent { font-size: 14px; }

/* sans-serif fonts are more readable at these sizes */ div.portlet, div#footer { font-family: "Lucida Grande", "DejaVu Sans", "Bitstream Vera Sans", "Helvetica", sans-serif; }

/* use a decent IPA-supporting font if one's available */ span.IPA { font-family: "DejaVu Serif", "Gentium", "HiraKakuPro-W3"; }

/* keep variables in running text the same font as the surrounding text */ span.texhtml { font-family: "Palatino", "Palatino Linotype", "urw palladio l", "URW Palldio L", "Palladio", "Zapf Calligraphic", serif; }

/* I know the deal with copyright at this point */ .copyrightwarning { display: none; }

/* links */

a:link { text-decoration: none; } a:visited { text-decoration: none; } a:hover { text-decoration: underline; } a:visited:hover { text-decoration: underline; }

{	background: transparent; padding-right: 0px; }
 * 1) bodyContent a[href ^="http://"],
 * 2) bodyContent a[href ^="gopher://"],
 * 3) bodyContent a[href ^="https://"],
 * 4) bodyContent a[href ^="mailto:"],
 * 5) bodyContent a[href ^="news://"]
 * 1) bodyContent a { padding-right: 0px; }

/* DEATH TO LIGHT BLUE!!!!11 */

{	background-color: white; }
 * 1) content, #content div.thumb,
 * 2) mytabs li, #mytabs li a,
 * 3) p-cactions li a

/* personal toolbar */

div#p-personal ul a:hover, div#p-personal ul a:visited:hover {	background-color: transparent; text-decoration: underline; }

li#pt-userpage, li#pt-anonuserpage, li#pt-login {	background: transparent; } li#pt-userpage { text-transform: lowercase; font-weight: bold; }

/* */

title: User:Bdesham/monobook.css


text:
User:Bdesham

See w:en:User:Bdesham.

title: User:Bdesham


text:
Radiation Oncology/Authors

Author List
 * There are 34 registered users who have contributed to this wiki textbook as of August 1, 2007, and have contributed ~95% of content
 * Those below have chosen to declare their personal information here
 * Please feel free to add yourself to the author list, when you contribute
 * Edit counts are as of July 1, 2010

Brian Cook, M.D. - Brim Tomas Dvorak, M.D. - Tdvorak Michael Chan, M.D. - MDChanderson Andrew J. Hope, M.D. - Hope Andrew Miller, B.Med., B.Sc., Grad.Dip.Ed., FRANZCR - AAM Cliff Robinson, M.D. - cgrobinson Dillip Kumar Muduly, M.S. - User:Drdillipmuduly Christopher Watson, M.D. - cwatson5040
 * Sampson Radiation Oncology, Clinton, NC
 * First authorship: September 8, 2004
 * Contributions: Original concept (4478 edits, 630 pages)
 * MD Anderson Cancer Center Orlando, Orlando, FL
 * First Authorship: June 4, 2005
 * Contributions: Various (8323 edits, 729 pages)
 * Assistant Professor of Radiation Oncology, Wake Forest University, Winston-Salem, NC
 * First Authorship: July 25, 2005
 * Contributions: (821 edits, 51 pages)
 * First authorship: February 14, 2005
 * Contributions: Various (81 edits, 29 pages)
 * Clinical Associate Professor, Illawarra Cancer Care Centre, Wollongong, Australia
 * First authorship: January 2, 2005
 * Contributions: Various (4 edits, 2 pages)
 * Resident, Dept. of Radiation Oncology, Cleveland Clinic Foundation, Cleveland, OH
 * First Authorship: December 4, 2005
 * Contributions: (3 edits, 2 pages)
 * Resident, Dept. of Surgical Oncology, All India Institute of Medical Sciences, New Delhi, India
 * First Authorship: December 4, 2012
 * Contributions: (50 edits, 2 pages)
 * Radiation Oncologist, Richard L. Roudebush VA Medical Center, Indianapolis, IN
 * First Authorship: September 3, 2013
 * Contributions: (35 edits)

Christopher Ho, M.D.（何懷德醫師）
 * Taiwan Society for Therapeutic Radiology and Oncology (TASTRO，台灣放射腫瘤學會)
 * First Authorship: October 4, 2019
 * Contributions: (168 edits)

title: Radiation Oncology/Authors


text:
Talk:Object Oriented Programming

I'm the primary author so far, although some others have contributed too. I hope you get the idea of where I'm headed by looking at the TOC and reading what's there. If you have thoughts, post 'em here. Feel free to fill in some blank topics. Note that I will edit for tone etc so it reads like one author. Augustus.saunders 13:30, 12 Sep 2004 (UTC)

Wow, looks really really good so far. Like the fact that you didn't forget the classless (prototype-based) oop, which normally happens. I personally don't feel that C++ or Java are at the same level at smalltalk, many things are not objects in both Java and C (e.g.: Classes are not objects and methodes neither). But so far a very good job. Gmlk 15:30, 12 Sep 2004 (UTC)

Well, I'm just adding a couple of paragraphs here and there every once in a while. Already spent too much time tonight, for just a few measly words. Augustus.saunders 09:04, 25 Jan 2005 (UTC)

I'm attempting to learn object-oriented programming from scratch. The beginning of this book has been quite informative. I look forward to its completion. Thanks for writing it. Evan Chaney 03:17, 17 Jun 2005 (UTC)

I think it would, at least for a while, be more beneficial to link to Wikipedia pages rather than Wikibook pages on certain items, like CLOS or C++ STL. --Snaxe920 05:51, 15 March 2006 (UTC)

Re: tone and inheritence. I think an editor that selected more academic vocabulary would be better suited for a work that desires 'textbook quality'. Granted, I didn't read the whole article, I just skimmed it as I evaluated its suitibility as an introduction to object-oritented programming for non-programmers. I stopped reading and dismissed the content as worthless when I came across the "is-a vs has-a moley baloney" topic under "Inheritence"; if one does not recognize the importance of these two fundamental relations then it is impossible to build quality software using object-oriented techniques or otherwise.

For example, while colloquially understandable, I feel the term 'moley baloney' is completely inappropriate. I feel The entire "Inheritence" section is poorly structured and contains little information of value. I completely agree that inheritence is an often misunderstood concept for many programmers new to object-oritented techniques. The muddling of "interface" and "implementation" in popular class-based object-oriented language inevitably leads to misunderstandings. This section would do well to cite sources that examine inheritence from an object- or functional-based perspective as it is impossible to understand inheritence before the conflicts between the notions of 'type', 'class', and 'interface' are resolved. Which brings me back to where I started as it is my belief that such understanding can only achieved if one understands the is-a and has-a relations.

 * Obviously, you didn't look very closely. This text is specifically not aimed at non-programmers.  It is not an academic treatise.  However, many, many texts trot out the old is-a vs has-a discussion when itroducing inheritance.  This confuses type, class, interface, and implementation.  Because this confusion is so common, I feel it is necessary explain it's failings.  Going into a long winded discussion of type theory and systems before before tackling this confusion is premature, in my opinion. --Augustus.saunders 00:55, 7 September 2006 (UTC)

What is OOP? What is OOP? What is OOP?
This text is a horror. It is a horrible read. Demotivating. There is so much incoherent babbling about nonrelevant stuff... or about somehow juicy stuff we are not supposed to know yet, but get a taste of nevertheless, but should remember not get into too deep yet, but is nice to get a feeling of already, but we'll explain it later really, and now we will not, but it is nice to... AAAARGh! I'll never understand what Object Oriented Programming is! Please, authors, '''get to the point! What the hell is OOP?'''

Why the long introduction about "classical OOP" and a "modern OOP" without telling us first what is OOP. And add in REAL Python code, instead of having us read a warning paragraphs about pseudocodes. The thing I have learned after reading six A4 pages is: encapsulation is important, encapsulation, encapsulation, encapsulation, encapsulation, encapsulation... I ask myself: what the hell is encapsulation? oh, dear reader, haven't we explained that? No! you haven't!

Are you writing a book on the different ways of writing a book?
 * ''In most books, this chapter would be the heart of the book. But this isn't "How to Program Language-of-the-week Without Even Trying," and we're not syntax obsessed, assuming you can look in the manual or one of those other books. We want to blaze through here focusing on the concepts and the why's and what-fors so we can get on to the programming! Like we said before, this isn't an academic treatise.
 * ''"There are some books on OOP that will tell you that the cornerstones of object oriented programming are encapsulation, inheritance, and polymorphism, or something along those lines. This is fairly typical of the classic OOP view, and there's nothing wrong with it per se, it's just that we've generalised some ideas and decoupled things here and there since then. But they are still important concepts, so let's dive in!

Who cares that there are different ways of writing books! We come here to know: What is OOP? I don't know. And this way I will never know. Why don't you get to the point? Why do you need to talk about other books? We don't want to know! We want to know about OOP, not about different ways of writing books. Aaargh! (from unknown)

 * I would have thought Wikipedia could tell you what OOP was. This book seems to be focused on what the features of OOP are, how they are used, and what is good or bad about each of those features. I don't really see your problem with this text, at least the author is giving an attempt to be entertaining and "personal" to alleviate text boredom. 222.158.163.9 13:57, 3 August 2006 (UTC)

I think that you are looking for a different book. "OOP" and "Object Oriented Programming" means many things to many people. Providing a dictionary definition early in the discussion would confuse things more than help. One of the aims of this text is to counteract much misinformation that has spread over time. There is a lot of wrong-headed advice given in other texts available, especially those focusing on one particular language, that I feel that it is necessary to address this misinformation. This derives from a long legacy of ideas superseding each other. Any text on C++ today that ignores template and generic programming and the STL would be completely remiss. Similarly, any text hoping to describe modern OOP programming must address the influence of functional programming. Ruby, Python, and the Boost libraries pretty much define modern OOP practice (by which I mean being used in the real world, not some fancy-pants academia thing). Nobody would accuse Java or .Net of being on the forefront of programming technique. But people think of them as being "object oriented." Basically, the programming techniques vary significantly depending upon which abstractions a language supports. Thankfully, they can be loosely divided into 2 categories, which I choose to call "classic" and "modern." I think the terms are appropriate. Trying to define OOP independant of these is, IMO, a mistake. OOP is used as such a catch-all term it's necessary to lay out a map.

Finally, many random people contribute little bits and pieces, and obviously everything is a work in progress. You may be used to 3 page articles on "exxxxpert-programmer.com" or some such, but books tend to have introductions that establish the basics and set the stage. Books tend to go more in-depth and go a little slower. A book of this type should be in the 300-500 page range to have any hope of adequately covering the material. Currently, there is a fair word count on design patterns that would more properly belong in an appendix. Aside from that, the total page count here is less than 20. So of course it never delivers. --Augustus.saunders 00:42, 7 September 2006 (UTC)

I agree with unknown user, the language used is kinda chatty and really doesn't get the point across to some of us...(Uh...tide, tide...something. Why don't they have a button for it here?)

Simple Objects vs Behavioral Entities
Quote from the section:

"Writing good simple objects, combined with good collection libraries provided by your language of choice, can easily reduce the complexity of basic operations by as much as 80%."

How was "complexity" measured? By who and when? Pretty bold and interesting statement. Definitely requires a reference. I would be very interested in knowing what the source of this claim is for one.

is a Vs has a
The main reason for this concept--a very good one--is that inheritance can be a bad idea, it binds classes too tightly and makes both reuse and debugging more difficult.

I'm not saying there aren't many perfect cases for inheritance, but misusing it is much worse than not using it at all.

When teaching someone new to the subject when to inherit and when to encapsulate, "Has a" or "Is a" makes a good test. You will find very few instances of "is a", and that's exactly how often you should subclass.

The single case for inheritance is where multiple children inherit from a single parent, override methods of that parent, and have those methods called through an object of the type of the parent (IE: you are using polymorphism).

The first Java GUI framework (AWT) was extend-based. It was a horrid model that didn't scale. Notice that in Swing you are never required to extend?

For a another viewpoint, you might google "Extends is evil", there is a java world article that does a great job of examining why you should limit instances where you subclass.

Note that implementing an interface is a COMPLETELY different discussion--It has nothing to do with subclassing and should not be avoided--in fact, should be used as often as possible.

(I'd like to move the meat of this rant into the main module, but I'll wait for comments first since it may be more controversial than I would have suspected)

--Bill 00:18, 7 December 2006 (UTC)

Object oriented programming is said to be one of the most influential developments in modern computer programming, gaining acceptance and praise for it’s’ ability to facilitate complexities in a field of growing software systems. Object oriented programming as a concept is a programming language which uses some object oriented construct or programming which in term is supported by some object oriented principle. Object oriented programming is noted to be a mindset which respects programming as a problem solving method which requires precise application of abstractions which ultimately divides complex problems into manageable pieces or tasks. Idealistically object oriented code can be broken down into a vast number of smaller tasks with each task being simplistically verifiable. Ultimately the goal of object oriented programming is to facilitate the combination of several different programming functions and techniques for the purpose of easier maintenance and more widespread reuse, with the future hope of standardization of functional techniques within the object oriented programming

Functional Programming
Why on earth would there be a functional programming section in an OO book? Not debating the usability of Functions, just the placement. If I don't see comments in a few days, I'll delete that and fix the "is a vs has a" stuff.

I wanted to write my own book, but in completely different manner. I want to start from Functional Programming first. Can I begin my own book? I am new in wikibook... alexsmail 15:55, 14 April 2007 (UTC)

 * If you don't intent into duplicate content creating a new book with a new approach and directed to a different audience is possible, but it will split the number of possible contributors Try to see if no one objects first to the changes (I've checked the history log for contributors and it seems the only registered users contributing content are User:Augustus.saunders and User:BillKress try posting a note on their talk page or directly contact them by email if available), give it a week if no one objects you can reshape the book, try to find another place/context to any content you will be removing if possible. See Be bold, and thanks for asking first... --Panic 19:53, 14 April 2007 (UTC)

 * I have post note to their talk page. Why not to create another book on the same issue? I want to include Procedural Programming too as the basis. Every chapter will be look like: breaf description of the concept, real world example, sample example on Java, lengthly discussion with more sophisticated examples using C++ example to clearify two diffirent implementation of the same concept (and highlight diffirence between concept and interface) and lengthly theoretical part. alexsmail 17:49, 15 April 2007 (UTC)

 * If you avoid a direct "collision" with a pre existing book, I don't think anyone will cause problems. You should also take a look into Forking policy, this is a draft of a policy, in there you may get a feeling on how some of the community feel about this type (if not exactly the same) situation, or take a look on the multiple books on C++.  --Panic 18:17, 15 April 2007 (UTC)

 * I read about forking. In this case, it is ok. Because I want to introduce different approach. So, we can co-exist. alexsmail
 * I didn't get the answer from your contributors. alexsmail 11:01, 21 April 2007 (UTC)

 * reset

Ok if no one is working on it then you may decide to reshape the book or start a new one, you have given every chance to anyone to object to it, it is now up to you. --Panic 16:08, 21 April 2007 (UTC)

"State" is Evil!
On "State" is Evil! section, the examples were supposed to be in Ruby? They don't look like Ruby to me
 * Agreed. I have no idea what that language is! Tom Morris (discuss • contribs) 20:23, 19 May 2011 (UTC)

Subpages
An object-oriented programming class will be working on splitting this book up into subpages and other improvements between August 19 and December 13, 2019. Your patience is appreciated. -- Dave Braunschweig (discuss • contribs) 14:48, 24 August 2019 (UTC)

title: Talk:Object Oriented Programming


text:
Abstract Algebra/Fields

Definition
Essentially, a field is a commutative division ring.

Examples
  $$\mathbb{Q}, \mathbb{R}, \mathbb{C}$$ (rational, real and complex numbers) with standard $$+$$ and $$\cdot$$ operations have field structure. These are examples with infinite cardinality.

 $$\mathbb{Z}_p$$, the integers modulo $$p$$ where $$p$$ is a prime, and $$+$$ and $$\cdot$$ are mod $$p,$$ is a family of finite fields.

 If $$F$$ is a field, then $$F(x)$$, the set of rational functions (i.e. quotients of polynomials), with coefficients in $$F$$ also forms a field.

 A non-example is $$\mathbb{Z}_n$$ where $$n$$ is not prime. For example, 2 in $$\mathbb{Z}_4$$ has no multiplicative inverse, hence $$\mathbb{Z}_4$$ is not a field.

Homomorphisms
Therefore a field homomorphism is exactly a unital ring homomorphism.

Proof. This is a simple consequence of the ideal structure of fields. Suppose $$f: E \to F$$ is a field homomorphism. In particular it is a ring homomorphism so we know that $${\rm ker}(f)$$ is a an ideal of $$E$$. Since $$E$$ is a field, it only has trivial ideals so $${\rm ker}(f) = \{0\}$$ or $${\rm ker}(f) = E$$. We can eliminate the second case since $$f(1_E) = 1_F$$ so the map cannot be trivial. Therefore we are in the first case which means exactly that $$f$$ is injective. $$\blacksquare$$

The above lemma means that every field homomorphism can also be thought of as an embedding of fields.

As happens so often in mathematics, a map between objects induces further maps between related objects. For example, a continuous map between topological spaces induces a map between the set of closed curves on the spaces and a linear map between vector spaces induces a linear map between the dual spaces (albeit in the opposite direction). In this case, a homomorphism between fields induces a homomorphism between the corresponding ring of polynomials. To be precise, suppose $$\varphi: E \to F$$ is a field homomorphism. This induces a map $$\varphi_*: E[x] \to F[x]$$ given by$$\varphi_*(a_0 + a_1x + \dots a_n x^n) = \varphi(a_0) + \varphi(a_1)x + \dots \varphi(a_n)x^n$$

It is easy to see that $$\varphi_*$$ is a (unital) ring homomorphism. Moreover if $$\varphi$$ is an isomorphism then so is $$\varphi_*$$.

Characteristic of Fields
An important property of fields is their characteristic. We first need to consider the canonical homomorphism $$\varphi$$ from $$\mathbb{Z}$$ into a field $$F$$. Of course this is defined by mapping the unit to the unit. Since $$\mathbb{Z}$$ is generated by $$1$$, this is sufficient to define the entire homomorphism. From the First Isomorphism Theorem, we know that $$\mathbb{Z}/\textrm{ker}(\varphi) \cong \varphi(\mathbb{Z})\subseteq F $$. In particular, this means that $$\varphi(\mathbb{Z})$$ is a subring and even a subfield of $$F$$ so is an integral domain. Hence $$\textrm{ker}(\varphi)$$ is a prime ideal of $$\mathbb{Z}$$. There is a unique non-negative integer generating this ideal. We call this integer the characteristic of $$F$$. Notice by the above argument that the characteristic must be prime if it is non-zero.

Intuitively, the characteristic of a field $$F$$ is the smallest positive integer $$p$$, if one exists, such that $$\underbrace{1 + \dots + 1}_{p \text{ times}} = 0$$If no such positive integer exists, then $$F$$ has characteristic 0. So for example, $$\mathbb{Z}_p$$ all have characteristic $$p$$ while $$\mathbb{Q}, \mathbb{R}$$ and $$\mathbb{C}$$ have characteristic 0.

Sometimes, one calls the image of $$\Z$$ under the above canonical homomorphism above the prime subfield of $$F$$. Hence the prime subfield of a finite field is (isomorphic to) $$\mathbb{Z}_p$$ (where $$p$$ is the characteristic of $$F$$) and the prime subfield of a field of characteristic 0 is (isomorphic to) $$\Q$$.

Examples

 * The complex numbers $$\mathbb{C}$$ are a field extension of the real numbers $$\mathbb{R}$$. The extension is of degree 2.
 * Similarly, one can add the imaginary number $$i$$ to the field of rational numbers $$ \mathbb{Q} $$ to form $$\mathbb{Q}(i)$$ the field of Gaussian rationals. This is also a degree 2 extension.
 * The real numbers $$\mathbb{R}$$ form a field extension over $$\mathbb{Q}$$ but this is not a finite extension since the real numbers do not form a finite dimensional (or even a countably infinite dimensional) vector space over $$\mathbb{Q}$$.

Algebraic Extensions
For example, $$\mathbb{Q}(\sqrt{2})$$ is an algebraic extension over $$\mathbb{Q}$$ (if $$a + b\sqrt{2}$$ is any element of $$\mathbb{Q}(\sqrt{2})$$then it is a root of $$f(x) = (x - a)^2 - 2b^2$$) but $$\mathbb{R}$$ is not algebraic over $$\mathbb{Q}$$ because for example $$\pi$$ is not the root of any rational polynomial (this is a very difficult statement to prove).

For example, the minimal polynomial of $$i$$ is $$ x^2 + 1$$ and the minimal polynomial of $$\sqrt[3]{2}$$ is $$x^3 - 2$$, both over $$\mathbb{Q}$$. Note the minimal polynomial is heavily reliant on the field it is being viewed over. The minimal polynomial of $$\sqrt[3]{2}$$ over $$\mathbb{R}$$ is simply $$x - \sqrt[3]{2}$$.

Splitting Fields
Our primary goal in this study is to find the roots of a given polynomial. The brilliant insight of Galois and Galois theory is to (try to) answer this question by looking at field extensions. The following two lemmas might help motivate this reasoning.Proof. Suppose first that $$f(x)$$ is irreducible. Then we can take $$E = F[x]/(f(x))$$. We know that $$E$$ is indeed a field because $$f(x)$$ is irreducible. Moreover it contains an isomorphic copy of $$F$$ as the (equivalence classes of) the constant polynomials. Finally $$[x]$$, the equivalence class of the linear polynomial $$x$$, is a root of $$f(x)$$ since $$f([x]) = [f(x)] = 0 \in F[x]/(f(x))$$Finally the degree of $$E$$ over $$F$$ is exactly the degree of the polynomial $$f(x)$$ (which hopefully motivates the terminology). This is due to the division algorithm. Suppose $$g(x)$$ is any polynomial in $$F[x]$$. Then we know by the division algorithm that there exist unique polynomials $$q(x)$$ and $$r(x)$$ such that $$g(x) = q(x)f(x) + r(x)$$where $$\deg(r(x)) < \deg(f(x))$$. In particular, this means every equivalence class $$[g(x)]$$ contains a unique representative whose degree is less than $$\deg(f(x))$$. Therefore $$E$$ is spanned by $$\{1, [x], [x^2], \dots, [x^{n - 1}]\}$$ where $$n = \deg(f(x))$$. If $$f(x)$$ is not irreducible then it can be written as a product of irreducibles and applying the above process to any of these produces an extension which contains a root of at least one of these irreducible polynomials and hence contains a root of $$f(x)$$. $$\blacksquare$$

We know $$x^2 + 1$$ is irreducible over $$\mathbb{R}$$, therefore $$\mathbb{R}[x]/(x^2 + 1)$$ is a field and one can verify that this field is isomorphic to $$\mathbb{C}$$. In fact, sometimes one defines the complex numbers as this quotient $$\mathbb{R}[x]/(x^2 + 1)$$.

Proof. By the smallest subfield containing $$F$$ and $$\alpha$$, we mean the intersection of all subfields of $$E$$ that contain them. This collection of fields is non-empty since it contains $$E$$ for instance and it is easy to see that the intersection of subfields is again a subfield.

If $$f(x)$$ is of degree 1, then we are done since that would mean that $$\alpha \in F$$ so $$F(\alpha) = F$$ and by the argument towards the end of Lemma 4.1.1, we have $$F[x]/(f(x)) \cong F$$. Then we can assume that $$\deg(f(x)) \geq 2$$.

In order to show the isomorphism, we define a ring homomorphism $$\begin{align} \varphi: F[x] &\to F(\alpha)\\ g(x) &\mapsto g(\alpha) \end{align}$$In other words, $$\varphi$$ acts on polynomials by simply evaluating them at $$\alpha$$. By definition, we know that $$f(x) \in \textrm{ker}(\varphi)$$ since $$f(\alpha) = 0$$. Since $$f(x)$$ is irreducible by assumption, it must also then generate the kernel (otherwise it would be a non-trivial multiple of the the generator of the kernel). Then by the First Isomorphism Theorem, we know that $$F[x]/(f(x))$$ is isomorphic to a subfield of $$F(\alpha)$$. Notice that $$F[x]/(f(x))$$ contains $$F$$ as the image of the constant polynomials and it contains $$\alpha$$ as the image of $$x$$. By assumption, $$F(\alpha)$$ was the smallest subfield containing these two things so we must have $$F[x]/(f(x)) \cong F(\alpha)$$. $$\blacksquare$$

The first lemma above tells us that we can always find a field extension containing the root of an irreducible polynomial by modding out by the polynomial. The second lemma tells us that any field extension containing a solution is of this form (up to isomorphism). Thus we will spend considerable time looking at the ring of polynomials over a field and studying its quotient spaces.

One often thinks of $$F(\alpha)$$ as 'adjoining' the root $$\alpha$$ to the field $$F$$. Roughly speaking, we add $$\alpha$$ to the field and then we close it under the field operations by also adding in all the possible sums, products, inverses, etc. and the further condition that $$\alpha$$ satisfies the given polynomial. In fact, this is precisely what the construction in the previous lemma does.

An important consequence of Lemma 4.1.3 is that the roots of an irreducible polynomial are algebraically indistinguishable (this is made precise in Theorem 4.1.4 and in particular by its Corollary 4.1.5). For example, we know that $$\sqrt{2}$$ and $$-\sqrt{2}$$ are both solutions of $$x^2 - 2$$. There is no algebraic distinction between the two roots; to differentiate them we need topological information like the fact that $$-\sqrt{2} < 0$$ and $$\sqrt{2} > 0$$. Similarly, $$i$$ and $$-i$$ are both solutions to $$x^2 + 1$$. Interchanging these roots is exactly what leads to complex conjugation. The fact that roots of (irreducible) polynomials are all equivalent to one another is one of the key ideas of Galois Theory. Proof. Since $$\varphi$$ is an isomorphism and $$f(x)$$ is irreducible, we must have $$\widetilde{f}(x)$$ is also irreducible (since if we had $$\widetilde{f}(x) = g_1(x) g_2(x)$$ then $$f(x) = (\varphi^{-1})_*(g_1(x)) \cdot (\varphi^{-1})_*(g_2(x))$$ which would contradict irreducibility of $$f(x)$$). Then $$f(x)$$ and $$\widetilde{f}(x)$$ generate maximal ideals in their respective rings and the ring isomorphism $$\varphi_*$$ descends to an isomorphism (of fields) of the quotients$$F[x]/(f(x)) \to \widetilde{F}[x]/(\widetilde{f}(x))$$We know by the previous theorem that the domain is isomorphic to $$F(\alpha)$$ and the codomain is isomorphic to $$\widetilde{F}(\beta)$$ and this map agrees with $$\varphi$$ on $$F$$ by construction. $$\blacksquare$$Proof. Apply the previous theorem to case with $$F = \widetilde{F}$$ and $$\varphi$$ as the identity map.

Existence and Uniqueness of Splitting Fields
We will see that rather than looking at arbitrary field extension, splitting fields will be the things to consider. First we need to know that they always exist.Proof. This is a largely uninteresting case of proof by induction. We will induct on the degree of $$f(x)$$. If $$f(x)$$ is linear, then clearly its roots (in fact just the one root) is contained in $$F$$ so $$F$$ itself is a splitting field. Suppose $$\deg(f(x)) > 1$$. If $$f(x)$$ splits into the product of linear terms, then again all the roots are contained in $$F$$, so we already have a splitting field. So suppose $$f(x)$$ has an irreducible factor of degree at least 2. Then there exists a field extension $$E_1$$ containing a root $$\alpha$$ of $$f(x)$$. Then in $$E_1$$, we can factorise the polynomial into $$f(x) = (x - \alpha)f_1(x)$$ where $$f_1(x)$$ is a polynomial of degree $$\deg(f(x)) - 1$$. Then by induction there exists $$E_2$$ a field extension of $$E_1$$ that is a splitting field of $$f_1(x)$$. Therefore $$E_2$$ is a field extension of $$F$$ that contains all the roots of $$f(x)$$. Taking the intersection of all subfields of $$E_2$$ containing $$F$$ and the roots of $$f(x)$$ gives us $$E$$, a splitting field of $$f(x)$$. $$\blacksquare$$

Above we were careful to say a splitting field of $$f(x)$$. In fact, this was an unnecessary precaution since the splitting field of a polynomial is unique up to isomorphism. This follows from a generalisation of Theorem 4.1.4, where we claim the statement of the theorem holds even if we adjoin all the roots of the polynomial, instead of just one.Proof. This is once again a proof by induction on the degree of $$f(x)$$. If $$f(x)$$ is of degree 1 or indeed splits into factors of degree 1 then the splitting field of $$f(x)$$ is $$F$$ so we can take $$\sigma = \varphi$$. Thus suppose $$f(x)$$ has an irreducible factor $$p(x)$$ of degree at least 2 so $$\widetilde{p}(x) = \varphi_*(p(x))$$is an irreducible factor of $$\widetilde{f}(x)$$. Then by the previous theorem we know $$\varphi$$ extends to an isomorphism $$\psi: F(\alpha) \to \widetilde{F}(\beta)$$ where $$\alpha$$ is a root of $$p(x)$$ and $$\beta$$ is a root of $$\widetilde{p}(x)$$. Therefore over $$F(\alpha)$$ and $$\widetilde{F}(\beta)$$ respectively we can write $$f(x) = (x - \alpha) f_1(x)$$ and $$\widetilde{f}(x) = (x - \beta)\widetilde{f}_1(x)$$.

Notice that $$E$$ is a splitting field of $$f_1(x)$$ over $$F(\alpha)$$. Indeed if a splitting field was strictly contained within $$E$$, then it would contain all the roots of $$f_1(x)$$ and $$\alpha$$ and hence would contain all the roots of $$f(x)$$. But this would contradict $$E$$ being a splitting field of $$f(x)$$. Of course the same holds true for $$\widetilde{f}_1(x)$$ over $$\widetilde{F}(\beta)$$. Since $$f_1(x)$$ and $$\widetilde{f}_1(x)$$ have degree strictly less than $$\deg(f(x))$$, by induction we can assume that the statement of theorem holds for them. In particular, $$\psi$$ extends to an isomorphism $$\sigma: E \to \widetilde{E}$$. But since $$\psi$$ was an extension of $$\varphi$$, $$\sigma$$ must also be an extension of $$\varphi$$ concluding the proof. $$\blacksquare$$Proof. Apply Theorem 4.1.7 to the case with $$F = \widetilde{F}$$ and $$\varphi$$ as the identity map. $$\blacksquare$$

Classification of Finite Fields
Proof. Since $$F$$ is a finite field and we know its prime subfield is $$\Z_p$$ for some prime $$p$$. The prime subfield is in particular a subfield of $$F$$ and hence $$F$$ forms a vector space over $$\Z_p$$. Since $$F$$ is finite, it must be a finite dimensional vector space and in particular we must have have $$F \cong (\Z_p)^n$$ for some $$n$$ (as vector spaces) so $$\mid F\mid = p^n$$. $$\blacksquare$$

Theorem (every member of F is a root of $$x^{p^n}-x$$)
let $$F$$ be a field such that $$\left\vert F \right\vert = p^n $$, then every member is a root of the polynomial $$x^{p^n}-x$$.

proof: Consider $$F^*=F/{0}$$ as a the multiplicative group. Then by la grange's theorem $$\forall x \in F^*, x^{p^n-1}=1$$. So multiplying by $$x$$ gives $$x^{p^n}=x$$, which is true for all $$x \in F$$, including $$0$$.

Theorem (roots of $$x^p-x$$ are distinct)
Let $$x^p-x$$ be a polynomial in a splitting field $$E$$ over $$\mathbb{Z} _p$$ then the roots $$a_1,...a_n$$ are distinct.

title: Abstract Algebra/Fields


text:
Computer Programming/Event driven programming

In this type of programming, a section of code is written to respond to each event. Events can be user events such as button clicks or mouse moves. Events can also be generated within the computer, for example timer events. Finally, the programmer can generate events.

Responding to an event is sometimes termed handling an event.

The program simply consists of sections that respond to events. These may, in turn use other sections (procedures, methods).

Example
This simple GTK+ program makes a GUI, with a button, that responds to the click event, after we enter a main-loop given by the gtk_main function. When ever events occur, like "clicked" event, we lookup event-handlers connected to it via g_signal_connect function, and delegate functions by invoking them. In this case the handler, btn_clicked is invoked.


text:
Programming Languages/Procedural Languages

In procedural programming, the program is written as a collection of actions (a procedure) that are carried out in sequence, one after the other. The order is important.

A procedure is sometimes termed an algorithm.

An ingredient of procedural programming is the idea of state. The actions in a program change the value of data items, usually termed variables. As the program executes, the values of variables change. At any point in time the variables have a set of values, which is their state.