text:
Talk:R Programming

Book Title
I love this idea of "R programming language", and can contribute some things .. however, shouldn't the title/naming structure be more in-line with other WikiBooks? Take for instance "Python Programming", "Programming:Perl", "Programming:Ruby", "MATLAB Programming". Could I suggest moving this to: I realize I'm not really creative with these titles, but they are in-line with the other programming series. My vote goes to #2 so far .. do I hear any other votes/suggestions? I will move this WikiBook this in the next week if I do not hear any talk here. This move should be done before any significant portions are added. mwtoews 05:41, 24 July 2006 (UTC)
 * 1) "Programming:R"
 * 2) "R Programming"

 * My vote goes for alternative 2 - "R Programming". --Orderud 21:15, 24 July 2006 (UTC)

 * Great, I'll move it now. — mwtoews 04:37, 17 August 2006 (UTC)

Syntax Highlighting
Would it be possible to color in red lines beginning with the ">" symbol in the "pre" environment and in blue the other ones ? PAC (talk) 14:44, 1 July 2009 (UTC)
 * Not sure other than around everyhing. Try asking at Reading room/Technical Assistance. - Taxman (talk) 18:03, 9 July 2009 (UTC)

I have seen that for some the Csharp programming language or the LaTeX language have syntaxe highlighting with HTML command Talgalili (discuss • contribs) 12:08, 18 June 2011 (UTC)

 * That's great ! I'll try it. PAC2 (discuss • contribs) 09:39, 20 June 2011 (UTC)

Converting from pre to source tags
A lot of the code is in pre tags instead of source tags. I'm using sed to convert the pre to source. pagesource is a file containing the page's wiki markup.

Thomas Levine (discuss • contribs) 17:03, 20 June 2011 (UTC)

 * Great ! Just be careful. Sometimes there is a space before the "80", sometimes there is no space, etc :

,, , PAC2 (discuss • contribs) 23:22, 20 June 2011 (UTC)

 * Good catch! This will take care of the spaces.

 * And actually this one will work for any pre tag.

Thomas Levine (discuss • contribs) 01:07, 21 June 2011 (UTC)

Is there a width argument for the source tag? Any examples near the page currently go underneath the contents box on the right hand side. Other than that I think they might all be done now.

Timcdlucas (discuss • contribs) 06:15, 22 July 2011 (UTC)

Book name
By the way, when I saw this book title I thought of it as a book on programming new methods for R, not a book on how to use R. Programming R can have two conflicting meanings, and it might be better to pick a title such as Using and Programming R or Introduction to R, or something like that. That would more clearly reflect that you don't have to program R at all to use it to do lots of analysis. - Taxman (talk) 18:03, 9 July 2009 (UTC)

Orphaned page
R Programming/Matrix is not linked to by the book. Please link to it, merge it and mark it with, or if it is unneeded mark it with. -- Adrignola talk contribs 16:58, 7 August 2009 (UTC)

copy paste
Dear W'Bookers! It is a pleasure to see that somebody reads and uses the texts also from a smaller projects (comared to WP), like Wikibooks and Wikiversity. Especially these two projects are bound from historical perspective as well as common goal of teaching. Now why I am writing this here: I just found out that the text from How to use R/Installation was copy pasted to R Programming/Settings, which is nice and entirely OK, even if this is a collaborative project with free content, please indicate the source, or add a (crosswiki) link to indicate its origin. Thank you! --Gbaor (talk) 15:09, 2 October 2009 (UTC)

You're right. That's done PAC2 (talk) 14:42, 7 October 2009 (UTC)

Index ?
Is there any wikimedia function which allow to create an index page including all the R functions used in the book ? --PAC2 (talk) 11:35, 13 July 2010 (UTC)
 * I don't think so. I asked someone this (maybe User:Whiteknight?) in IRC a while ago when I was trying to build the index for Linear Algebra, but the end result was I had to do it by hand, which was really a pain.  You might want to bring the idea up in the projects reading room though, there are technically much more savvy people then me running around, maybe they have some idea. Thenub314 (talk) 11:45, 13 July 2010 (UTC)

Style
If you want to contribute, here are some rules :
 * The name of packages should be in bold : Hmisc
 * Name of functions should be included in the code environment :.
 * Examples are included in the pre environment : Example.

PAC2 (discuss • contribs) 14:20, 30 March 2011 (UTC)

See above but examples are included in the "source" environment for automatic syntax highlighting.

Timcdlucas (discuss • contribs) 09:18, 22 July 2011 (UTC)

Good points. I summarized them at R_Programming/Introduction. --DavidCary (discuss • contribs) 19:12, 13 February 2013 (UTC)

Wikipedia links
I don't know what other people think about these things for example:

I personally think they look horrible. On a more objective note they don't float properly and often end up underneath other text and in illogical places. I don't know if they are an important part of the wikibooks style, but I think just blue text links would be better.

Timcdlucas (discuss • contribs) 09:22, 22 July 2011 (UTC)

Ok, you can remove them if you want and add some standard blue text links. -- PAC2 (discuss • contribs) 13:28, 25 July 2011 (UTC)

Consistency
I've spent some time this evening going through and fixing some links to bypass redirects (I know, not really necessary, but I like to do it sometimes) and moving some obviously badly-named pages. In the process, I've noticed some glaring inconsistencies in page titles and navigational links between pages. In particular, we should pick title case or sentence case (only first letter capitalized) and stick with it. We currently have titles like Manage your workspace mixed in with things like Publication Quality Ouput and even Tobit And Selection Models. Also, Template:R Programming/Navbar should probably be "automated" (using parser functions), so we don't have to "hardcode" page titles for "next" and "previous" links at the bottom of pages (if this template is even necessary — it might be considered redundant since we already have Template:R Programming/Navigation on every [?] page). If the template were automated (so it "knows" the sequence of pages), we would only have to keep that one template consistent with the other one, not a bunch of separate template calls on the individual pages. I might start to do some of this soon, but I wanted to give others the chance to beat me to it... - dcljr (discuss • contribs) 00:23, 18 November 2011 (UTC)
 * I agree with your remarks. I really appreciate your work. I don't have enough time to work on this project alone. I don't how to automatically generate a navbar. Cheers,

--PAC2 (discuss • contribs) 11:43, 18 November 2011 (UTC)

Good points. I summarized them in a local manual of style (WB:LMOS) at R_Programming/Introduction, as suggested by Manual of Style. --DavidCary (discuss • contribs) 19:12, 13 February 2013 (UTC)

title: Talk:R Programming


text: Category:Book:Animal Care

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

title: Category:Book:Animal Care


text: Category:Book:Nature

title: Category:Book:Nature


text:
User talk:Elwikipedista~enwikibooks

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally. Kellen T 09:14, 24 July 2006 (UTC)
 * Please also check out the Cookbook policy page and the Cookbook talk pages. In particular, please read the part of Cookbook:Policy about our templates and categorization, as you seem to be interested in those, but are doing nonstandard things with them.

Code
Linux Guide/Software Linux Guide/Booting

Your account will be renamed
Hello,

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

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

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

Sorry for the inconvenience.

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

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

title: User talk:Elwikipedista~enwikibooks


text:
Category:Goose recipes

Recipes involving goose.

title: Category:Goose recipes


text:
User:Thatnerdyguy

Undergraduate physics student at the University of Oregon.

title: User:Thatnerdyguy


text:
User:Rozzychan

I was working on the wikibook The Organ Systems with my Spring 2023 college class.

In the Year 2024, I plan to add content to the textbook:

Biology, Answering the Big Questions of Life - An introductory biology book based on Questions and levels of understanding

My other works include: The Organ Systems - A book about the human organ systems and their animal analogues

Understanding Scientific Terms, An introduction to Greek and Latin word roots for Science and Engineering students.

Historical comments: Comments about the Biology book can be found in the discussion page of the foreword. I made significant content to a wikibook on the simplified English website. Biology (simple English book)

But this book was discontinued. I like to think out loud, but this page is not about that, so I'm going to put my notes on my sandbox.

Jan08 I'm going to make a new book Understanding Scientific Terms, Greek and Latin word roots for Scientists. COMPLETE

I am using it to teach this Wikiversity course.

-- New project: Making the Ktorrent manual into a wikibook

School Teacher
I have gone back to school to become a High school teacher. I tried to list the things that were required to pass the educators exam here but it was erased for being copyrighted. Can you believe that? A list of subjects to study for can be copyrighted? What is this world coming to?

It was a daunting task to study for a science test which required me to review all the science that I have had, and it is a lot.

It's hard to fit into your head things that you know you've had but may not slip off the tongue as quickly as they used to.

I wanted to make study aids in the hope that they would eventually make a new Wikibook, but the best laid plans of mice and men gang oft aglay.

=BOOKS= I'm thinking of starting a series.

=Chemistry= They've given me chemistry to teach this year. I've taught biology, botany, biology and molecular biology labs, but never chemistry. Here is my chemistry online ideas links list:

The Merlot Chemistry portal
MERLOT stands for "Multimedia and Educational Resource for Learning and Online Teaching". This site has numerous online teaching resources, as well as examples of other's chemistry tutorials.

http://chemistry.merlot.org/teach.html

Chem 1
Chem1 is a website by a guy named Steve Lower. He has educational resources for chemistry including online textbooks.

Main site

http://www.chem1.com/

Chem textbooks

http://www.chem1.com/acad/webtext/virtualtextbook.html

Educational resource lists - very comprehensive
 * [|For teachers]
 * [|For students]

General Chemistry online
http://antoine.frostburg.edu/chem/senese/101/index.shtml

Has links to software and chemistry programs.

Their headline service is a compound library that gives information on a compound if you type in the name. To get an example of what it can do, type in "phenol", "iron" and "copper sulfide". It gives different information for different chemicals, and may include melting point in C Fand K, molecular weight, Ksp, density, appearance and formula.

This could be a good resource for students trying to get a hang of formulae.

Their Exam survival guide has tips on test taking as well as sample chemistry exams.

Demonstrations and labs
I found a technique for turning water into wine

http://antoine.frostburg.edu/chem/senese/101/features/water2wine.shtml

Here is an online demonstration of the Millikan oil drop experiment that showed the charge of the atom

http://www.montereymotiongraphics.com/example1.html

This comes from the site of an educational educator called Charles Hamper. He also has illustrations for the speed of an orbit, a pH meter, atoms, and many more on his website. Check out the atom module under "more" on his menu.

http://www.montereymotiongraphics.com/

The NSF supports a Kennesaw university set of chemistry case studies which go into the politics, safety, and decision making processes involved in approving new chemicals for public release. These include nutrisweet, olestra, gatorade, and others.

http://www.chemcases.com/

Dec 2023 Update
In 2024 I plan to teach an intro Biology course, and I am considering turning my notes into a book. I refused to do it on this site before because, as a wikibook, I was afraid that I would lose a primary voice and the ability to guide the shape of my work, but considering it has been here for over a decade without overwhelming change, I think that now is the time to update it to meet current needs, and to document the changes in Biology that have been made in the last few decades.

I will probably add some new images and updates I remember searching and finding images long ago. Don't know where they are now, but I will be trying to make the book a more accurate and up to date reference with info on climate change, biotechnology and anatomy.

Wish me luck!

Feb 2024 Update
Changes in how my course is implemented have me looking for open and free educational resources to found courses with. I want to make a list of sites I found online, and grade their quality and coverage. Will make a new Page for that. Rozzychan (discuss •

Rozzychan (discuss • contribs) 03:08, 22 December 2023 (UTC) Rozzychan (discuss • contribs) 13:07, 23 February 2024 (UTC)

2024
Books to consider.

https://en.wikibooks.org/wiki/Peacebuilding_Manual

https://en.wikibooks.org/wiki/Public_International_Law/Law_of_Armed_Conflict

https://en.wikibooks.org/wiki/Guide_to_Social_Activity

https://ocw.mit.edu/courses/res-3-006-micro-mentoring-resources-and-materials-science-curriculum-spring-2021/mitres3_006sp21_section_3_worksheet2.pdf =updating= Updated scientific terms book by adding an index of all words. I think it is done now. I am pretty happy with the book and am ready to let it go. Started Jan 2008 - 2024. Accept for minor formatting problems, It's done. Rozzychan (discuss • contribs) 16:42, 7 June 2024 (UTC)

title: User:Rozzychan


text:
Biology, Answering the Big Questions of Life/Photosynthesis/Photosynthesis2

 Previous < Up > Next : Index

Equation
The overall equation for Photosynthesis is

6 CO2+ 12 H2O + light-->C6H12O6 + 6 O2+ 6 H2O The equation can then be simplified down to: 6 CO2+ 6 H2O + light-->C6H12O6 + 6 O2 after balancing the chemical reaction.

The equation in words says that six molecules of carbon Dioxide plus twelve molecules of water in the presence of light will make one molecule of glucose, six molecules of oxygen gas, and six molecules of water.

Photosynthesis is actually divided into two parts. The Light reactions which convert light into chemical energy, and the Dark reactions (also called the Light-independent reactions) which capture CO2 from the air and use it to make sugar.

The Light Dependent Reactions of Photosynthesis

The light dependent reactions occur primarily in the thylakoid membrane of the chloroplast. They take the energy of light and use it to make the high energy molecules NADPH and ATP.

Chlorophyll absorbs light, which then causes it to lose an electron. The electron is taken by the primary electron acceptor, which distributes it into a complex of proteins that pass it from molecule to molecule like a game of hot potato. This is called the electron transport chain. As the molecules pass the electron, they pump hydrogen ions from one side of the membrane to the other. The high concentration of hydrogen ions pumped into the inner thylakoid space (the thylakoid lumen) can then be used to make ATP by a process called chemiosmosis. The electron finally gets dumped on the molecule NADP (Nicotinamide adenine dinucleotide phosphate) changing that molecule into NADPH. The chlorophyll molecule left without an electron can take that electron from water splitting the water into Hydrogen ions and oxygen gas. This is why photosynthesis releases oxygen into the air.

The point of the Light reactions is to make large quantities of NADPH and ATP. These molecules store chemical energy that is used to power the dark reactions. The cell needs this energy because making sugar is hard work.

READING

 * Light_dependent_reaction

The Light Independent Reactions of Photosynthesis
Light Independent reactions take Carbon Dioxide (CO2) and water and use the energy to create sugar.

CO2 is a gas. It has a low energy. Only one enzyme can grab CO2 and stick it to a large molecule to make sugar. This enzyme is Ribulose Bis phosphate carboxylase, but most people just call it Rubisco.

This amazing enzyme takes CO2 out of the air and sticks it on to the five-carbon molecule Ribulose bis-phosphate. This makes a six-carbon molecule that breaks apart immediately into the two three-carbon molecules (PGA and 3-phosphoglycerate).

If that sounds complicated, be assured that it gets worse. This process is called the Calvin cycle and it is a pretty complex process. Because one molecule of CO2 enters at each turn of the wheel, this pathway takes six cycles to make one new glucose molecule.

The Calvin cycle occurs in the stroma of the chloroplast, and the 3PGA molecules made are transported out of the chloroplast and into the cytoplasm where they can be used to build glucose.

READING

 * Light-independent_reaction

Accessory Pigments
"In every wood, in every spring, there is a different green." J.R.R. Tolkien

Plants contain other pigments besides chlorophylls including carotenoids (yellow orange) and anthocyanins (mostly red). These other accessory pigments sit in the leaf along with the chlorophyll and they are the reason that leaves are different colors in the fall is when chlorophyll can no longer be created.

Many of them actually assist in photosynthesis by absorbing light in wavelengths that chlorophyll cannot and reemitting the light at a lower wavelength so it can be absorbed again by chlorophyll. The process of absorbing and then releasing particles of light is called photosynthesis.

Detail Level
Easy

 * Why are plants green?
 * Why do leaves change color in the fall?

Advanced
 * Excited states
 * Photosystems
 * C4 plants

 Previous < Up > Next : Index


text:
Biology, Answering the Big Questions of Life/Photosynthesis/Photosynthesis3

 Previous < Up > Next : Index

Atoms, Orbitals and Light
An Atom is made of protons, neutrons, and electrons. The electrons circle the nucleus staying within Atomic Orbitals, descrete regions where the electron is most likely to be. Under normal conditions the electrons stay as close to the atom as possible. At this configuration, electrons are at their the lowest energy level. This low energy level is called the Ground State.

Atoms can absorb light energy and jump to a higher energy level. When they do so, they are said to be in an Excited state To do this the light must be of exactly the right wavelength to allow it to jump to a higher orbital. These higher orbitals are further from the nucleus of the atom.

That is why water is so important. H2O is not at habitable temperature it is actually a complex molecule comprising OH- & H+. Add common salt and you get NaCl + H2O which solution is OH-/Na+ (Sodium Hyroxide [alkaline bleach]) plus Cl-/H+ (Hydrochoric Acid) a nice balance.

The electron will later fall back down to the ground state. When they do, they will reemit a lower energy wavelength of light. This is called fluorescence. Chlorophyll fluoresces in the far red.

Reading
 * Electron_shell
 * Absorption (electromagnetic radiation)
 * Energy_level
 * Fluorescence

Photosystems
When an atom in a chlorophyll molecule, absorbs light and jumps to a higher energy level, the electron gets far enough from the atom that it can be stolen away by nearby molecules carrying the electron down an electron transport chain. The chlorophyll that loses the electron is situated in a particular location called the photosynthetic reaction center. It is in the center of a sort of inverted umbrella of molecules in the thylakoid membrane. The tip of that umbrella is very near the first molecule in the photosynthetic electron transport chain. Once the electron is stolen, the chlorophyll gets a new electron from nearby chlorophylls and other accessory pigments. These pigments all group together in a structure called a photosystem.

The photosystem works together as a group. Electrons flow across the photosystem getting discharged into the reaction center, while elsewhere electrons are taken from water, or from other membrane proteins in the electron transport chain. The thylakoid membrane is simply coursing with electricity.

The Z scheme

 * 1) A chlorophyll molecule has a heme containing a mg+ (magnesium) atom in the center. It also has a long tail.
 * 2) When light is absorbed by chlorophyll, an electron in the magnesium atom jumps from the ground state to an excited state. This electron is farther away from the center of the atom.
 * 3) The chlorophyll molecule is right next to another molecule which grabs electrons. When the electron gets far enough away from the center of the atom, this molecule steals the electrons and passes it from molecule to molecule.
 * 4) The energy of the electron transfer is used to pump hydrogen atoms across the thylakoid membrane. A high H+ concentration is made in the inner thylakoid space. This high H+ concentration is used to make ATP using the proton channel ATP synthase.
 * 5) There are two chlorophyll reactive centers that absorb chlorophyll at different wavelengths. One reactive center dumps the electrons on the other, and the second one finally dumps the electrons on the high energy molecule NADP which forms NADPH+H
 * 6) NADP is the final electron acceptor in photosynthesis.
 * 7) The magnesium ion that lost the electron in the chlorophyll atom at the beginning is now a very unhappy ion. It steals an electron from water to get back to a normal state. Water breaks apart into hydrogen ions and oxygen gas. This is why plants release oxygen.
 * 8) Water is the initial electron donor in photosynthesis

Reading
 * Photosystem
 * Photophosphorylation
 * Photosynthetic reaction center
 * Light_harvesting_complex
 * Photosynthetic_pigment
 * Chemiosmosis

C3 and C4 Plants
The steps of the Calvin cycle were discovered by Melvin_Calvin using a radioactive isotope of Carbon. An isotope is an atom that has a different number of neutrons in the nucleus. Carbon normally has 6 protons and 6 neutrons and is called carbon 12, but when it has 8 neutrons it is called carbon 14 and it will emit radiation that can expose a piece of film.

Calvin and his associates added radioactive carbon dioxide to a green algae, Chlorella pyrenoidosa and then dropped them into boiling ethanol to immediately kill the cells. They did 2D paper chromatography on the chloroplasts, and placed a piece of film over it. As the Calvin cycle incorporated the radioactive carbon dioxide, new molecules containing C14 appeared. These molecules exposed the film directly over their location on the piece of paper. The exposed film is called an autoradiograph. Calvin and his associates later used various techniques to identify the chemicals.

They showed that carbon dioxide first appeared in a 3-carbon compound called 3-PGA. And by watching which chemicals appeared they were able to determine the order of the steps in the Calvin cycle.

The first step in the Calvin cycle is the one catalyzed by Rubisco. Where the 5-carbon compound Ribulose Bis-Phosphate is added to CO2 to make a six carbon intermediate. The six carbon intermediate is very unstable and breaks apart into two 3-PGA molecules which is why it wasn't seen on the audoradiograph.

The Calvin cycle was thus considered solved, until in 1965 when some researchers in Hawaii (Kortshak, Hartt, and Burr) redid the experiment in sugarcane and got a different result. Their first intermediates were the four-carbon molecules malic and aspartic acid. They found that many tropical plants gave this same result including: Maize (corn), oats, and bamboo.

They called these plants C4 plants whereas other plants were called C3 plants.

Most plants including algaes, trees, and shrubs are C3 plants. Only about 0.4% of species studied have C4 metabolism, but they include some of the most important food crops. That is why this mechanism is considered significant.

What is the metabolism of C4 plants?
C4 plants contain a molecule called PEP carboxylase that can capture CO2 from the air and place it on a molecule of Phosphoenolpyruvate(PEP - 3C) to make Oxaloacetate (4C). This is a reversible reaction and the CO2 can be released if the concentration of CO2 in the leaf drops.

This is used to solve a major problem with the enzyme Rubisco which forms the first step of the Calvin cycle. Rubisco was thought to have evolved when atmospheric levels of O2 were low. Because of this, Rubisco cannot tell the difference between a molecule of CO2 and a molecule of O2. If it adds O2 to RUBP, it does not make a six carbon molecule. This is a wasteful process called photorespiration.

This means if O2 levels are high in the cell, then the cell will waste energy NOT making sugar. Cells are constantly making oxygen in the light reactions of photosynthesis and this O2 diffuses out of the cells through pores in the bottom of the leaf called stomata.

However, when the weather is dry, leaves close their stomata to conserve water. This causes a buildup of O2 in the leaves that can cause photorespiration.

C4 plants capture CO2 (mostly at night when the stomata are open) and store it in the stable four-carbon sugar oxaloacetate until needed. When the stomata are closed, and O2 levels begin to build up, they release the CO2 into the leaf so that photosynthesis can continue.

For this reason, if a C4 plant and a C3 plant (such as wheat and corn) are placed side by side in a dry environment, the C4 plant (corn) can stay healthy and green even when the C3 plant begins to wilt and brown. It is able to take harsher conditions. C4 plants are known to have enlarged bundle sheathe cells, and this is where C4 metabolism occurs.

CAM metabolism (crassulacean acid metabolism)
Cactus and succulents such as lillies and orchids can also capture and store CO2 with PEPcarboxylase. They store them in the leaves as malic acid (4C) and release it when needed. Unlike C4 plant, however, all of the leaf cells can do this metabolism, not just the bundle sheathe cells.

CAM and C4 are thought to be later adaptations which developed to repair defects in the original carbon fixation process.

Reading
 * RuBisCO
 * Calvin-Benson_cycle
 * Carbon_fixation
 * C4_carbon_fixation
 * Melvin_Calvin
 * Carbon-14
 * Paper_chromatography

Detail level
Easy
 * Why are plants green?
 * Why do leaves change color in the fall?

Intermediate
 * Light and Dark reactions,
 * Accessory pigments

 Previous < Up > Next : Index


text:
Accordion/Technique

As with any instrument, technique varies between those who play the accordion. Technique is what makes accordionists stand out between one another. Bad technique will logically create a bad player. Though there are no rules "set in stone" on what should and shouldn't be done, the following techniques and positions are accepted by the general public of accordionists. Consider it "accordion common-sense".

title: Accordion/Technique


text:
Circuit Theory/Laplace Circuit Solution

Laplace Circuit Solution
One of the most important uses of the Laplace transform is to solve linear differential equations, just like the type of equations that represent our first- and second-order circuits. This page will discuss the use of the Laplace Transform to find the complete response of a circuit.

Steps
Here are the general steps for solving a circuit using the Laplace Transform:

 * 1) Determine the differential equation for the circuit.
 * 2) Use the Laplace Transform on the differential equation.
 * 3) Solve for the unknown variable in the laplace domain.
 * 4) Use the inverse laplace transform to find the time domain solution.

Another method that we can use is:

 * 1) Transform the individual circuit components into impedance values using the Laplace Transform.
 * 2) Find the Transfer function that describes the circuit
 * 3) Solve for the unknown variable in the laplace domain.
 * 4) Use the inverse laplace transform to find the time domain solution.

title: Circuit Theory/Laplace Circuit Solution


text:
Category:Quinoa recipes

Recipes involving quinoa.

title: Category:Quinoa recipes


text:
Circuit Theory/Phasor Theorems

Circuit Theorems
Phasors would be absolutely useless if they didn't make the analysis of a circuit easier. Luckily for us, all our old circuit analysis tools work with values in the phasor domain. Here is a quick list of tools that we have already discussed, that continue to work with phasors:

 * Ohm's Law
 * Kirchoff's Laws
 * Superposition
 * Thevenin and Norton Sources
 * Maximum Power Transfer

This page will describe how to use some of the tools we discussed for DC circuits in an AC circuit using phasors.

Ohm's Law
Ohm's law, as we have already seen, becomes the following equation when in the phasor domain:

 * $$\mathbb{V} = \mathbb{Z} \mathbb{I}$$

Separating this out, we get:

 * $$M_V \angle \phi_V = (M_Z \times M_I) \angle (\phi_Z + \phi_I)$$

Where we can clearly see the magnitude and phase relationships between the current, the impedance, and the voltage phasors.

Kirchoff's Laws
Kirchoff's laws still hold true in phasors, with no alterations.

Kirchoff's Current Law
Kirchoff's current law states that the amount of current entering a particular node must equal the amount of current leaving that node. Notice that KCL never specifies what form the current must be in: any type of current works, and KCL always holds true.

 * $$\sum_n \mathbb{I}_n = 0$$

Kirchoff's Voltage Law
KVL states: The sum of the voltages around a closed loop must always equal zero. Again, the form of the voltage forcing function is never considered: KVL holds true for any input function.

 * $$\sum_n \mathbb{V}_n = 0$$

Superposition
Superposition may be applied to a circuit if all the sources have the same frequency. However, superposition must be used as the only possible method to solve a circuit with sources that have different frequencies. The important part to remember is that impedance values in a circuit are based on the frequency. Different reactive elements react to different frequencies differently. Therefore, the circuit must be solved once for every source frequency. This can be a long process, but it is the only good method to solve these circuits.

Thevenin and Norton Circuits
Thevenin Circuits and Norton Circuits can be manipulated in a similar manner to their DC counterparts: Using the phasor-domain implementation of Ohm's Law.

 * $$\mathbb{V} = \mathbb{Z}\mathbb{I}$$

It is important to remember that the $$\mathbb{Z}$$ does not change in the calculations, although the phase and the magnitude of both the current and the voltage sources might change as a result of the calculation.

Maximum Power Transfer
The maximum power transfer theorem in phasors is slightly different then the theorem for DC circuits. To obtain maximum power transfer from a thevenin source to a load, the internal thevenin impedance ($$\mathbb{Z}_t$$) must be the complex conjugate of the load impedance ($$\mathbb{Z}_l$$):

 * $$\mathbb{Z}_l = R_t - jX_t$$

title: Circuit Theory/Phasor Theorems


text:
Water Resources Directory/USA/Assistance/NGOs

 * Southeast Watershed Assistance Network is an "online resource for transferring innovative technical tools for watershed protection, restoration, and management: sharing model watershed programs, land use ordinances, training tools and reports, and linking Southeast models to the nation".


text:
Circuit Theory/First Order Circuits

First Order Circuits
First order circuits are circuits that contain only one energy storage element (capacitor or inductor), and that can, therefore, be described using only a first order differential equation. The two possible types of first-order circuits are:

 * 1) RC (resistor and capacitor)
 * 2) RL (resistor and inductor)

RL and RC circuits is a term we will be using to describe a circuit that has either a) resistors and inductors (RL), or b) resistors and capacitors (RC).

RL Circuits

An RL Circuit has at least one resistor (R) and one inductor (L). These can be arranged in parallel, or in series. Inductors are best solved by considering the current flowing through the inductor. Therefore, we will combine the resistive element and the source into a Norton Source Circuit. The Inductor then, will be the external load to the circuit. We remember the equation for the inductor:

 * $$v(t) = L\frac{di}{dt}$$

If we apply KCL on the node that forms the positive terminal of the voltage source, we can solve to get the following differential equation:

 * $$i_{source}(t) = \frac{L}{R_n}\frac{di_{inductor}(t)}{dt} + i_{inductor}(t)$$

We will show how to solve differential equations in a later chapter.

RC Circuits

An RC circuit is a circuit that has both a resistor (R) and a capacitor (C). Like the RL Circuit, we will combine the resistor and the source on one side of the circuit, and combine them into a thevenin source. Then if we apply KVL around the resulting loop, we get the following equation:

 * $$v_{source} = RC\frac{dv_{capacitor}(t)}{dt} + v_{capacitor}(t)$$

Series RL
The differential equation of the series RL circuit
 * $$L \frac{dI}{dt} + I R = 0$$
 * $$\frac{dI}{dt} = - I \frac{R}{L}$$
 * $$\frac{1}{I} dI = - \frac{R}{L} dt$$
 * $$\int \frac{1}{I} dI = - \frac{R}{L} \int dt$$
 * $$ln I = - \frac{R}{L} t + C$$
 * $$I = e^{- \frac{R}{L} t + C }$$
 * $$I = A e^{- \frac{R}{L} t }   \quad A = e^C$$

Series RC
The differential equation of the series RC circuit
 * $$C \frac{dV}{dt} + \frac{V}{R} = 0$$
 * $$\frac{dV}{dt} = - V \frac{1}{RC}$$
 * $$\frac{1}{V} dV = - \frac{1}{RC} dt$$
 * $$\int \frac{1}{V} dV = - \frac{1}{RC} \int dt$$
 * $$ln V = - \frac{1}{RC} t + C$$
 * $$V = e^{- \frac{1}{RC} t + C }$$
 * $$V = A e^{- \frac{1}{RC} t } \quad A = e^C $$

Time Constant
The series RL and RC has a Time Constant
 * $$T = \frac{L}{R}$$
 * $$T = \frac{RC}{1}$$

In general, from an engineering standpoint, we say that the system is at steady state ( Voltage or Current is almost at Ground Level ) after a time period of five Time Constants.

title: Circuit Theory/First Order Circuits


text:
User:Gronau~enwikibooks

w:de:Benutzer:Gronau

title: User:Gronau~enwikibooks


text:
Water Resources Directory/USA/Organizations

International Organizations

 * See list for international level at: Water Resources Directory/Organizations.

Federal Agencies

 * See list of federal agencies.


text:
Circuit Theory/State Variables

New techniques are needed to solve 2nd order and higher circuits: A change in strategy is needed if circuit analysis is going to: The solution is "State Variables." After a state variable analysis, the exercise of creating symbolic solution can be simplified by eliminating terms that don't have a significant impact on the output.
 * Symbolic solutions are so complicated, merely comparing answers is an exercise
 * Analytical solution techniques are more fragmented
 * The relationship between constants, initial conditions and circuit layout are becoming complicated
 * Move beyond the ideal
 * Consider more complicated circuits
 * Understand limitations/approximations of circuit modeling software

State Space
The State Space approach to circuit theory abandons the symbolic/analytical approach to circuit analysis. The state variable model involves describing a circuit in matrix form and then solving it numerically using tools like series expansions, Simpson's rule, and Cramer's Rule. This was the original starting point of matlab.

State
"State" means "condition" or "status" of the energy storage elements of a circuit. Since resistors don't change (ideally) and don't store energy, they don't change the circuit's state. A state is a snap shot in time of the currents and voltages. The goal of "State Space" analysis is to create a notation that describes all possible states.

State Variables
The notation used to describe all states should be as simple as possible. Instead of trying to find a complex, high order differential equation, go back to something like Kirchhoff analysis and just write terminal equations.

State variables are voltages across capacitors and currents through inductors. This means that purely resistive circuit cut sets are collapsed into single resistors that end up in series with an inductor or parallel to capacitor. Rather than using the symbols v and i to represent these unknowns, they are both called x. Kirchhoff's equations are used instead of node or loop equations. Terminal equations are substituted into the Kirchhoff's equations so that remaining resistor's currents and voltages are shared with inductors and capacitors.

State Space Model

This State Space Model describes the inputs (step function μ(t), initial conditions X(0)), the output Y(t) and A,B,C and D. A-B-C-D are transfer functions that combine as follows:

 * $$\frac{\mathbb{Y}}{\mathbb{\mu}} = B(s)\left(\frac{1}{s - A(s)}\right)C(s) + D(s)$$

A control systems class teaches how to build these block diagrams from a desired transfer function. Integrals "remember" or accumulate a history of past states. Derivatives predict future state and both, in addition to the current state can be separately scaled. "A" represents feedback. "D" represents feed forward. There is lots to learn.

Don't try to figure out how a negative sign appeared in the denominator and where the addition term came from. How does the above help us predict voltages and currents in a circuit? Let's start by defining terms and do some examples:
 * A is a square matrix representing the circuit components (from Kirchhoff's equations.
 * B is a column matrix or vector representing how the source impacts the circuit (from Kirchhoff's equations).
 * C is a row matrix or vector representing how the output is computed (could be voltage or current)
 * D is a single number that indicates a multiplier of the source .. is usually zero unless the source is directly connected to the output through a resistor.

A and B describe the circuit in general. If X is a column matrix (vector) representing all unknown voltages and currents, then:
 * $$\boldsymbol{\dot{X}} = \boldsymbol{A}\boldsymbol{X} + \boldsymbol{B}\boldsymbol{\mu}$$

At this point, X is known and represents a column of functions of time. The output can be derived from the known X's and the original step function μ using C and D:
 * $$y = \boldsymbol{C}\boldsymbol{X} + D*\boldsymbol{\mu}$$

MatLab Implementation
This would not be a step forward without tools such as MatLab. These are the relevant MatLab control system toolbox commands: In addition, there is a simulink block called "State Space" that can be used the same way.
 * step(A,B,C,D) assumes the initial conditions are zero
 * initial(A,B,C,D,X(0)) just like step but takes into account the initial conditions X(0)

Video Introduction

 * 41 minute introduction from digilent corp
 * 5 minute application to a circuit

title: Circuit Theory/State Variables


text:
Water Resources Directory/USA/Organizations/Federal

Listed below are selected federal organizations having any water related responsibilities or activities.
 * A complete list of federal organizations is online.

Executive Departments

 * Department of Agriculture (USDA)
 * Forest Service
 * Natural Resources Conservation Service (NRCS)
 * Department of Commerce (DOC)
 * National Oceanic and Atmospheric Administration (NOAA)
 * Department of Defense (DOD)
 * U.S. Army Corps of Engineers (USACE)
 * Institute for Water Resources (Alexandria, VA)
 * Hydrologic Engineering Center (Davis, CA)
 * Waterways Experiment Station (Vicksburg, MS)
 * Construction Engineering Research Center (Champaign, IL)
 * Army Environmental Policy Institute
 * Department of Education (ED)
 * Department of Energy (DOE)
 * Department of Health and Human Services (HHS)
 * Department of Housing and Urban Development (HUD)
 * Department of Justice (DOJ)
 * Department of Labor (DOL)
 * Department of Interior (DOI)
 * U.S. Geological Survey (USGS) ]
 * National Park Service
 * Department of Transportation (DOT)

Independent Agencies

 * Environmental Protection Agency (EPA)
 * Tennessee Valley Authority
 * Federal Maritime Commission
 * National Science Foundation

 * Office of Government Ethics
 * U.S. Office of Special Council (FOIA)
 * Small Business Administration
 * Securities and Exchange Commission
 * U.S. National Archives and Records Administration
 * Institute of Museum and Library Services
 * Corporation for National and Community Service (Vista Volunteers)

Boards, Commissions and Committees

 * Appalachian Regional Commission
 * Delaware River Basin Commission
 * Interstate Commission on the Potomac River Basin
 * Mississippi River Commission
 * Susquehanna River Basin Commission

 * Committee on Foreign Investments in the US
 * Endangered Species Committee
 * Federal Advisory Committees
 * Federal Executive Boards
 * Federal Laboratory Consortium for Technology Transfer
 * Federal Library and Information Center Committee
 * Illinois and Michigan Canal National Heritage Corridor Commission
 * Interagency Alternative Dispute Resolution Working Group
 * Marine Mammal Commission
 * Migratory Bird Conservation Commission
 * Millennium Challenge Corporation. (Natural Resources Management Indicator Search)
 * Morris K. Udall Foundation: Scholarship and Excellence in National Environmental Policy
 * National Park Foundation
 * Northwest Power Planning Council
 * Nuclear Regulatory Commission
 * President's Council on Integrity and Efficiency (Inspector General)
 * Regulatory Information Service Center (B/C of rulemaking)


text:
Operating System Design/Scheduling Processes/Round Robin

Round Robin scheduling is an older method of CPU time sharing.

Each process is given a certain amount of CPU time (a time slice), and if it is not finished by the end of the time slice, the process is moved to the back of the process queue, and the next process in line is moved to the CPU.

A common variant on Round Robin allows a process to give up the remainder of its time slice if it doesn't need it. This might be because it is waiting for a particular event, or because it is completed.

Unlike Shortest Process Next and Shortest Remaining Time, this method does not exhibit live lock nor is it impacted much by the halting problem (a process that never ends will not end, but other processes will still run).

Analogy
At a mall, the cashier offers each customer a certain amount of time to checkout their items, and if they aren't done with their items by the time set by the cashier, the customer must go to the back of the line and wait. This repeats until all items are checked out.

Advantages and Disadvantages
If the set time is too short, then too much process switching will take place and the design will become slow. If the set time is too long, then the system may become unresponsive, time wasting and would emulate First Come First Served.


text:
Operating System Design/Scheduling Processes/SRT

The Shortest Remaining Time (SRT) scheduling system is a more intelligent version of SPN that allows shorter processes to skip ahead as they appear, instead of only processing the shortest process at the time that CPU time becomes available.

This method also falls prey to the halting problem, and is also susceptible to live lock.

There is no way to determine which process is going to run in the least amount of time unless you allow all processes to run and record their execution times or take input from the user.

Analogy
The individual with the least amount of items is allowed to skip to the front of the line regardless of how long everyone else has been waiting..

Advantages and Disadvantages
SRT tends to be the most optimal scheduling system if we are hoping to run as many processes as possible in a given time, but requires exact knowledge of how long a process will take. This is usually input by the user or calculated from previous runs of the process.


text:
Operating System Design/Scheduling Processes/SPN

Shortest Process Next (SPN) scheduling, also called Shortest Job First (SJF) scheduling, assigns the process estimated to complete fastest to the CPU as soon as CPU time is available.

This method falls prey to the halting problem. The halting problem is unsolvable, but basically states that given a program and a particular input, can we determine if it will ever finish? With a simple program we could try to run it, and if it completes then we know it will finish, but if it doesn't complete in a given time, perhaps we just didn't wait long enough.

There is no way to determine which process is going to run in the least amount of time unless you allow all processes to run and record their execution times or take input from the user.

This method also allows for live lock with many short processes locking a longer process out from the CPU.

Analogy
The cashier in a store finds the person with the fewest items, and checks out their items first.

Implementation
it can be implemented by choosing the shortest job before the higher job.

Advantages and Disadvantages
SPN tends to be the most optimal scheduling system for total number of jobs completed short of SRT, but requires exact knowledge of how long a process will take. This is usually input by the user. If the mechanism to determine what is the shortest job is faulty then this might significantly reduce the throughput. Given a system with a lot of short jobs and one long job then the long job might never be run.


text:
Cookbook:Shortcrust Pastry

| Pastry

Shortcrust pastry or shortcrust dough is a buttery, crumbly pastry dough which is often used as a base for tarts. This is an eggless version.

Ingredients

 * 150 g (½ cup) unsalted butter, softened
 * 100 g (½ cup) caster sugar
 * 1 tsp grated lemon rind
 * 120 g (1 cup) plain flour, plus extra for dusting
 * 120 g (¾ cup) potato flour

Procedure

 * 1) Cream together butter, sugar, and lemon rind in a bowl.
 * 2) Sift together the plain and potato flours into a mound.
 * 3) Make a well in the center of the mound and add the creamed mixture.
 * 4) Knead lightly until the dough is consistent.
 * 5) Wrap the dough in plastic wrap and chill for 1 hour before use.

title: Cookbook:Shortcrust Pastry


text:
User:Cleanupman~enwikibooks

I help clean up spam and hidden links to commercial sites.

title: User:Cleanupman~enwikibooks


text:
Talk:Special Relativity/Mathematical transformations

This needs tidying up, in particular 4 vectors should be introduced after transformations. RobinH 16:08, 24 July 2006 (UTC)

The derivation of proper acceleration as a function of coordinate acceleration needs work. Look at the sentence:

"The proper acceleration, $$\alpha \!$$ is defined as the acceleration of an object in its rest frame. It is the instantaneous change in velocity for an observer for whom $$u^'=0 \!$$ and $$\alpha = du^'/dt^' \!$$. "

If $$u^'=0 \!$$ it follows immediately that $$ du^'/dt^'=0 !!! \!$$.Moriconne (talk) 04:00, 2 August 2008 (UTC)

 * Yes, the section is not good at all. In fact the whole page needs a re-write, being a series of jottings in its present form.  (Some of the jottings are excellent starting material.) Acceleration should have its own page and be properly explained. I have put a warning on the page to say "Under development"! RobinH (talk) 09:21, 4 August 2008 (UTC)

 * The rest of the page is excellent, I would only take out the section "Acceleration transformation". It isn't even about the transformation, it is about the relationship between proper and coordinate acceleration. Moriconne (talk) 14:33, 6 August 2008 (UTC)

 * OK. RobinH (talk) 11:11, 7 August 2008 (UTC)

Doppler Effect vs Time Dilatation ?
Is there any conceptual difference between the Doppler experiment and the experimental pattern described under “Time Dilatation” in the Special Relativity theory? In both cases a frequency generator is in inertial motion in respect to an observer. In both cases one computes the perception of the frequency by the distant observer… But contrary to the Doppler Effect where a red-shift or a blue-shift in frequency may be observed, Special Relativity only concludes to time dilatation in all cases. This does not look very consistent.

This immediately triggers a second question: is it legitimate for Special Relativity to invoke the Lorentz Transform in this particular context? If I understand correctly this transformation applies to the gaps in position and time between two events in a given inertial frame, and it delivers the corresponding gaps between the same events in another inertial frame. However, Special Relativity uses the Lorentz Transform to compute gaps between two events related to the observer’s life on the basis of gaps between two events relevant to the clock’s history. Moreover both pairs of events belong to the same "frame"; here I mean the same "convention" for representing the relative motion of the clock and the observer.Sugdub (talk) 21:55, 14 December 2009 (UTC)

 * It is a shame that the section on the Doppler Effect is not more complete in this book. The relativistic doppler effect has components due to time dilation and movement towards or away from a source. There is a purely relativistic "transverse doppler effect" due to time dilation and I only wish I had time to improve the text. RobinH (talk) 10:33, 15 December 2009 (UTC)

Well, your answer seems to confirm my doubts. The discussion about Time Dilatation in the framework of Special Relativity leads to a formula fairly different from the conclusions of the Relativistic Doppler Effect. In particular it is unable to properly predict the sign of the shift in frequency. So my initial questions remain unanswered: Sugdub (talk) 21:31, 15 December 2009 (UTC)
 * unless both experimental patterns are conceptually different (in which way?), the Time Dilatation theorem under Special Relativity contradicts the Relativistic Doppler Effect;
 * there is a doubt about the way the Lorentz Transform is invoked when deriving the Time Dilatation theorem.

Demonstration of the Lorentz transform
"Einstein's assumption that the speed of light is a constant can now be introduced so that x = ct and also x' = ct'."

One must keep in mind that in this case x and t represent the difference in coordinates between two events which respectively mark the emission and the reception of a light ray. However the above formulas are injected into equations where x and t represent the coordinates of an unspecified event in the space-time.

So the reasoning is invalid. On the one hand it mixes equations where x (resp. t) represents different quantities (coordinates vs delta-coordinates). On the other hand it claims being conclusive for any event in the space-time whereas it relies on a property which validity is restricted to light-related events.

One could reach the same conclusion without entering the details of the demonstration: since the law about the speed of light does not constrain the coordinates of light-related events and neither the coordinates of any other event, it is in principle unable to contribute to the determination of a transformation of coordinates of space-time events, neither the Lorentz's transform nor any other one. Sugdub (talk) 21:28, 27 January 2010 (UTC)

 * Your critique of using the "speed of light" as a foundation for relativity was spotted within about 3 years of Einstein's first publication on SR in 1905. It was rapidly understood that electrodynamics alone could not be used as the basis for such a generalised theory.  This is why the modern approach to Special Relativity does not actually depend on Einstein's original postulates.

 * In the modern approach the postulate that is to be tested is that the universe is a four dimensional manifold with a metric given by:

 * $$ ds^2 = dx^2 + dy^2 + dz^2 - cdt^2$$

 * In this type of metric the spacetime interval ds is constant for all observers.

 * According to this geometrical approach the constant "c" is simply a term that converts measurements in seconds to measurements in metres - in the same way as in the formula (centimetres = c times inches) where c ~ 2.5 centimetres per inch. So x = ct and c ~300,000,000 metres per second.

 * The derivation of the constancy of the speed of light from the metric is fully explained in the text. Please take a look at the section: Special_Relativity/Spacetime. The fact that the constancy of the speed of light is a consequence of the properties of the metric means that it can indeed be applied to sets of coordinates.  After all, what is the metric of the manifold but the relationship between the coordinates of events? The constant "c" is a geometrical entity like "pi" that arises in the Minkowski metric, not some arbitrary property of photons.

 * To be pedantic the line: "Einstein's assumption that the speed of light is a constant can now be introduced so that x = ct and also x' = ct'." should really read "Given that in a 4D manifold of this type c is a constant for all observers, no matter what their state of relative motion, x = ct and also x' = ct'."

 * I am wholly against the use of Einstein's original electrodynamic approach in the teaching of Special Relativity. It always results in students separating "light" from "geometry" and wondering what causes light to go slower or speed up! It is much better to use the geometrical approach to relativity where it can be seen that a universally constant velocity for all observers is a consequence of the metric.  The electrodynamic approach was only current between 1905 and 1908 but almost all popular physics books confuse their readers with it. In contrast nearly all advanced texts start with the bald statement "assume that the universe is a four dimensional spacetime with the metric:  $$ ds^2 = dx^2 + dy^2 + dz^2 - cdt^2$$"RobinH (talk) 10:30, 4 February 2010 (UTC)

I must admit being sceptical about your answer. I certainly can agree that soon after the inception of Einstein’s Special Relativity theory physicists recognised the need to ground it on a less peculiar feature than the law of propagation of light (at least by enlarging this law to other interactions). Certainly the initial version of the theory looked suboptimal. But I can’t imagine that physicists have consciously and deliberately masked, in all their presentations and academic works until now, the fact that it is logically flawed.

You might have misinterpreted my critic: it is logically impossible to derive a transformation applicable to any vector (x, ct) in the space-time manifold from a law which applies only to those vectors for which x = ct (eg because they actually relate to a light-ray). However, the Special Relativity theory by Einstein claims the opposite, as can be seen from the “demonstration” of the Lorentz transformation.

The change you propose to the sentence I highlighted does not make it. The issue is not about changing the rationale for injecting x = ct, it is actually about the need to address any vector, and especially those for which x is NOT equal to ct. For those, there is no way to decide how the transformation should behave.

We could also debate on the drawbacks of the “modern presentation” of the theory but this was not my point.Sugdub (talk) 18:35, 11 February 2010 (UTC)

 * At some stage all of my advanced textbooks on Relativity make the blatant statement that it will be assumed that the universe has the metric: $$ ds^2 = dx^2 + dy^2 + dz^2 - cdt^2$$ ie: that $$ ds^2 $$ is an invariant for all observers in a pseudo-Riemannian geometrical manifold. On the basis of this assumption it is then indeed possible to deal with four vectors that have a mixed spatio-temporal direction. The rest of Relativity is a set of derivations that suggest experiments and observations that test the assumption that the metric is a true description of events. This is how science works: scientific theories use the minimal set of assumptions and are tested using relations that are predicted using a mathematical formalism. It is scandalous that so many popular physics books and elementary textbooks take the electrodynamic approach. RobinH (talk) 10:32, 21 July 2010 (UTC)

No event horizon in Minkowski spacetime
The section "Accelerated Frames and Event Horizons" which describes Rindler acceleration uses the term "event horizon" which is incorrect. Yes, the line $t = r$, for $r \ge 0$ forms a sort of "horizon" between "events" in a general sense. However it is not an event horizon which has a technical meaning, as the boundary of events which can send a signal to future null infinity. Minkowski spacetime has no event horizons, nor most other types of horizon. For the present context, it is probably best called the "Rindler horizon". You might call it a particle horizon for the accelerating observers, maybe. Also it is a Killing horizon I think, because the boost Killing vector field is null there. Colin MacLaurin (discuss • contribs) 09:34, 30 May 2019 (UTC)


text:
Business Basic

Programming in Business Basic

This is a place holder for the new Business Basic manual. Our goal is to create a replacement for Scott Bruce Ryan's out of date (1988) "What do you do after it says: READY>" for BBx/BBj, ProvideX and Thoroughbred.

Overview

 * An excerpt from the Wikipedia article on Business Basic.:

Business Basic is an interactive high-level programming language developed for minicomputer systems in the early 1970s. Derived from the original Dartmouth BASIC, Business Basic extended the language concepts by introducing file indexing methods which evolved into true keyed access technology similar to those methods available to COBOL programmers.

Because of its interactive nature, Business Basic affords runtime event trapping capabilities, though the character-based systems did not permit the wide range of events that modern graphical environments do. Business Basic interpreters also offer extensive diagnostic capabilities, permitting developers to resolve live problems through telephone support without constantly having to ship updates. The interpretive nature of Business Basic also enhances development efforts through permitting quick testing and debugging of code.

There are two primary "groups" or "families" of the Business Basic programming language: Other Business Basics have risen from the Point 4 systems running under IRIS.
 * The MAI Basic Four Business Basic family is the oldest version of the language, and there have been numerous competitors over the years who have duplicated and enhanced the rich MAI language.
 * The Data General Business Basic family is the second most well-known Business Basic. Originally very similar to the MAI language, DG Business Basic and its competitors' derivatives have evolved into a very different style of Business Basic.

In the 1980s, Business Basic was ported from proprietary environments to Unix, Xenix, VMS, and MS-DOS by many vendors, including Thoroughbred, BASIS International, Microshare, Sybex/BBIcon(Canada), and Transoft (UK), to name just a few.

title: Business Basic


text:
Talk:Business Basic

Folks, this is where discussion about format and details needs to take place.

Structure
I propose the following structure:

 * 1) History of Business Basic
 * 2) Tutorials
 * 3) Basic syntax
 * 4) Hello World! example
 * 5) Real World example (in training I usually use the concept of a Rolodex)
 * 6) Real World GUI example (we could show the process of moving to GUI from character for the various target environments)
 * 7) Commands
 * 8) Verbs
 * 9) Functions
 * 10) System Variables
 * 11) Mnemonics
 * 12) Configuration
 * 13) BBx
 * 14) ProvideX
 * 15) Thoroughbred

We should come up with a symbol for each version of BB and use them to indicate the variations of the language. John Spikowski 02:22, 11 October 2006 (UTC)

title: Talk:Business Basic


text:
Talk:Haskell/Type basics

DavidHouse and Kowey Chat transcript
I had a chat with Kowey about where this was going. Here are my notes from the discussion. DavidHouse 19:46, 24 July 2006 (UTC)

On 24th July 2006, I chatted with kowey about my new 'Type basics' module. He had some comments, which I enumerate here, along with proposed actions. The original conversation is included for reference.

Kowey liked it :)
 * Step-by-step guide for building the type of a function

Probably not so great, because: - They're not too useful right away - They involve a bit too much low-level explanation (ASCII etc.)
 * chr and ord used as examples
 * TODO: Use unlines/unwords instead.

They need to be integrated before the Type chapter.
 * Tuples
 * TODO: Place them in the Lists chapter (and do a rename).

- Could be confusing from a mathematical perspective. - Would be nice to compare the two approaches somewhere, pointing out that currying gives you partial application. - A footnote in the 'Higher-order functions and Currying' module would be good.
 * Currying versus tuples for functions in more than one argument
 * TODO : add said footnote.

We seem to have a focus on subtyping. This is probably not entirely intended and not the idea. We want to get four things across: 1. Everything in Haskell has a type. 2. Everything in Haskell has only one type, apart from polymorphic things. - Should we give up on this completely? - It's important to note that, for example, nothing can have both type Int and String. 3. Types help you categorise things. 4. Types help you avoid errors.
 * The greengrocer metaphor

The introduction is a bit long. Basically, we want to give the user enough feet to stand on, then plunge them into something more practical. Be wary that starting with exercises before the theory is sufficiently developed is scary and confusing and definitely something to avoid. However, it's probably better to teach them *how* something is before we teach them *why* it is. Once they have a grasp on the structure they can grasp the motivation.
 * Teaching style

Or perhaps a slightly different architecture, which looks like this? 1. _Brief_ motivation. 2. Explanation of *what* types are. 3. More full explanation of *how* types are useful.

This seems to be a fairly common approach in textbooks, etc.

17:41 -!- Irssi: Starting query in freenode with kowey 17:41 still there? 17:41 Yup. 17:42 i have some comments on type basics, if you want them now 17:42 Sure. 17:42 first of all, i really liked the fact that you gave practical step-by-step on how to write the type of a function 17:43 that's the kind of stuff that helps the 1st year undergrad type crowd a lot (not that this is neccesarily our target audience) 17:43 let's see... 17:43 note number 2 17:44 i wouldn't use chr and ord for examples, because (1) they aren't going to be immediately useful (2) they introduce a lot of underlying how-computers-work stuff 17:45 now (2) might be a strong point if you take a holistic view of things, but i'm somewhat afraid of confusing the reader 17:45 True. 17:45 perhaps stuff like unlines and unwords would work 17:45 There aren't many monomorphic functions in a single argument floating around, though :) 17:45 since we've already introduced lists 17:46 yeah, i was thinking that might have been why you chose them, so i glanced through the Prelude to find suggestions 17:46 That's true. 17:46 note number 3 17:46 we ought to remember to actually introduce tuples some point before this 17:46 before or after lists, i'm not too sure 17:46 note number 4 17:47 Yeah. 17:47 Perhaps add them to the Lists chapter. Lists -> Lists and Tuples 17:47 i recall when teaching that some of my students got confused between functions that take tuples as arguments 17:47 (YAHT introduces them together) 17:47 Right, if you're into mathematics then that's likely to be confusing. 17:47 (we probably should do that, introduce them together, it's easy to get them confused) 17:48 well, it's funny, it's one of my slow students that did that :-) 17:48 Hehe, okay. 17:48 like you know, when somebody who just doesn't grasp it stumbles on to something immensely profound 17:48 and of course, it'd just confuse the living daylights out of him to tell him he's almost right... 17:49 Currying and tuples are two ways of doing the functions-in-more-than-one-argument stuff, maths and LC just go their different ways. 17:49 but yeah, i'm not sure if it'll be something we want to head off, or if doing so will just confuse users even more 17:49 i guess we'll get to them during the currying chapter 17:49 Yeah. 17:49 note number 5 17:50 there's a danger in the greengrocer metaphor... 17:50 Perhaps we could do an appendix? We could go into some detail. "This is how maths does it. It'd work, but you don't get partial application.". Or perhaps a footnote in currying saying "Look how cool partial application is! That's why we don't use tuples." 17:51 well, there's many places to talk about this 17:51 e.g. 17:51 1) just after introducing tuples (as a footnote) 17:51 2) a footnote in the types stuff 17:52 3) a chapter on partial application and the cool stuff like returning a function (higher order functions) 17:52 I like 3. 17:52 ok, i think i could be happy with that 17:52 Note number 5? 17:52 right, the greengrocer metaphor 17:53 you seem to be getting into some notion of a type hierarchy, like first fruit and vegetables, and then shapes under that 17:53 is that on purpose? 17:53 Somewhat. 17:53 I'm keen to introduce the fact that types give you information. 17:54 But perhaps explicit subtyping is the wrong way of doing it, as Haskell doesn't have it :) 17:54 well, what i'd tend to feel is that yeah, 17:54 our highest priority is to introduce the notion that everything in haskell has a type 17:54 and only one type 17:54 (uh... though it could be a polymorphic type, but we do cover that) 17:54 True. That might be a confusing point. 17:55 yeah, that was gnawing at me during my conference :-) 17:55 i guess this blends in with note number 6 17:55 Hehe. Did you not have internet access? 17:55 i did, but not much time to be looking at it... i was on a mail and wikibooks watchlist diet 17:56 have lost much time since doing internet bulimia 17:57 anyway, note number 6 is likely just a matter of taste... my outlook on pedagogical stuff -- and i caution you that i'm a pretty horrible teacher, so my pedagogical views should be taken with a good shakerful of salt - 17:57 uh... my outlook tends to be "first manipulate, THEN motivate" 17:58 that is, i tend to like a hands-on approach... first the student should be able to do something with the stuff, try examples out himself, do exercises, etc 17:58 and only when s/he has some concrete grasp of it should we try to delve into why this is useful 17:59 Agreed. 17:59 so, sort of the chop-wood-and-carry-water school of thought 17:59 in other words, i think the introduction is a bit long, and i'd rather we hit the ground running 17:59 Okay. 17:59 i guess the 3 things we want to convey are 17:59 1) everything in Haskell has a type 18:00 We still need some notion of what types *are*. 18:00 2) everything has onely one type 18:00 3) types let you categorise stuff 18:00 4) types let you avoid errors 18:00 I've been in situations before where the tutorials haven't given enough before they started with the examples and exercises, and you're left thinking "What am I meant to be doing?" 18:00 that is the other excess 18:01 in fact, i have a friend who dislikes yaht precisely for this reason (IO) 18:01 i tried to apologise for YAHT by saying that Hal didn't really have much of a choice, because explaining monads before IO... eh... good luck 18:01 so i guess the order i'd have in mind is something like 18:02 what - how - why 18:02 (how being the examples and exercises stuff) 18:02 and that being said 18:02 although i do agree that examples are the best way to learn (learn by doing, etc) 18:03 Yeah. 18:03 it really do irks me when people insist on teaching-by-example (as opposed to actually teaching) 18:04 students who tend to insist you don't give them any text but for examples also annoy me 18:05 If you want to hack around, please do. 18:06 thanks... i confess that i'll have to commit the easier-said-than-done sins, i.e. complaining about other people's stuff without actually taking the effort to do better 18:06 Not at all. 18:06 Getting peer-review was harder than I anticipated. 18:06 i'm probably not going to be hacking around, (have to get back to real life/work sometime), but i hope the comments are useful by themselves 18:07 Yep. 18:07 I'll see what I can come up with. 18:07 people on #haskell and the lists aren't saying much, are they? 18:07 on the book, that is 18:07 I convinced shapr to have a look around. 18:08 I think once a few more modules are done we should do an ANNC on the lists. 18:08 yeah, i was pleased with that... having you in the project is very nice because i personally am too shy to plug the book 18:08 but you've been doing a good job keeping it somewhere in the awareness-meter of #haskell 18:09 the yaht import might be our turning point... i'm going to do the same thing as in the scheme 48 one... make yaht a subtutorial under Haskell 18:09 and then hope we cannibalise from it 18:09 Awesome. 18:10 *assuming* hal actually responds to my mail... but the fact that we had face to face contact increases the probability that he does 18:10 * kowey hopes intensely 18:10 right... anyway, i ought to get back to work... catch you later! 18:11 Thanks!
 * Original conversation log

Comments on comments
One thought I had forgotten to mention. and  look like they would be useful for making a little ciphering exercise, like a rot13 thingy or something more amusing. -- Kowey 20:12, 24 July 2006 (UTC)

There's a section that says numeric types are "deferred until later". Where is this??!? Link please.

Functions in more than one argument
"Functions in more than one argument" were already introduced in a previous chapter: http://en.wikibooks.org/wiki/Haskell/Variables_and_functions#Multiple_parameters

I'd just remove it from here.

Subtyping

 * I'm moving the subtyping stuff here. I think it could be useful in the advanced chapters maybe, or maybe re-written to be more Haskell-newbie oriented -- Kowey 13:37, 28 November 2006 (UTC)

Categorising bits of data
Let's imagine we're a greengrocer. We had our daily delivery of fresh, juicy and healthy fruit and vegetables this morning, but unfortunately, the delivery van went round a corner a little too fast and all our produce is mixed up! Of course, we're only greengrocers by day. We love to program and as such our methods as a greengrocer are meticulous and organised.

Presented with this mess, we're going to sort out our food by category. First, we split the foodstuffs into two piles, fruit and vegetables. Next, let's go a bit further and subcategorise each pile by shape (why not?). The melons go next to the grapefruit, but they're a long way away from the bananas. And although the lettuce and the pomegranate are a similar shape, they're not placed next to each other, because the former is a vegetable and the latter a fruit: they're already been split up. We could go further along this process, splitting things up by colour, taste, price, etc, but we're suddenly interrupted by a pressing business engagement and so have to leave it there.

What's this got to do with types? The important thing to realise about types is that they're one level removed from values. In the same way that every piece of fruit on our floor belongs to one of these groups, so does every value in Haskell belong to a certain type. Types are 'groups of values'; a label which describes certain properties of the value. In our greengrocer analogy, if we knew a certain piece of food lay in the 'Fruit' category, then we know that it's a ripened ovary -- together with seeds -- of a flowering plant. Knowing a value has some type, say, Number, will tell you certain things about that value (in the case of some data having type Number, we know, for example, it can be represented by a sequence of digits and added and subtracted to and from other numbers).

Ugly
I am finding this module, at least the beginning to be cluttered and generally bad layout. Does anyone agree here?

Jptdrake 06:01, 20 March 2007 (UTC)

isL
The "l" in "isL" looks a lot like the number 1. Perhaps a different letter would be a better choice? There was also an "l" variable in one of the previous chapters that was hard to read. 65.201.194.91 18:31, 22 June 2007 (UTC)

Example: not
remember, people reading this are newbies. I saw

not True = False not False = True

and wondered if that was something I was supposed to type in:

Prelude> not True = False :1:9: parse error on input `='

Then I thought, "oh, that's the way 'not' is defined in a file", and did that in a file, tried to run it and got

*Main> not True

It could refer to either `not', defined at test.hs:1:0 or `not', imported from Prelude

If you've been doing haskell for a long time, I expect when you see this you're just thinking "he's showing how 'not' is defined in the Prelude" or whatever--I think it should say "here is now 'not' is defined in the Prelude" before it puts those lines there, to help us newbies along. -- Msouth 13:21, 15 July 2007 (UTC)

Note 1 is unclear
Note 1 says "in fact, these are one and the same concept in Haskell"--meaning what are one and the same? values and functions? typing values and typing functions?

I suspect (but I'm a newbie, so I don't know, otherwise I would just change the note) that it means "function is merely a particular variety of value, so just like a value has a type, a function has a type".

-- Msouth 13:28, 15 July 2007 (UTC)

Functions in more than one argument
Is there anything that can be done about the fact that if you actually define f as shown, then try looking at the type with :t you get:

*Main> :t testf testf :: (Num a) => a -> a -> a

I see the a -> a -> a part that corresponds to your Int -> Int -> Int, but I don't know what the (Num a) => is about, and I don't know how to define a function that really requires ints so I can't tell if it's because this function accepts all Num things that it has that at the beginning or do all functions? And what is => for?

-- Msouth 13:53, 15 July 2007 (UTC)

Agreed; this is terrible.

207.172.223.249 (discuss) 17:38, 31 December 2011 (UTC)

consider dropping the ord and chr part now
I don't see what they add now that the other example is there. The other example turned out to need digression to explain the \n's. The ord/chr things needs to digress to explain ASCII. It ends up being way too much digression, leaving me wondering what new thing I learned (other than how to load a module). I think it would work fine with ord/chr stuff just deleted. Msouth 13:56, 15 July 2007 (UTC)

module for openWindow?
It talks about openWindow function, but doesn't tell me what module I need to load to look at the type myself with :t. Msouth 14:01, 15 July 2007 (UTC)

Loading Data.Char in WinHugs
:l Data.Char works, however -- I got this fix from http://www.cs.nott.ac.uk/~gmh/errata.html

confusing wording
"So far, what we've done just seems like categorizing things -- hardly a feature which would cause every modern programming language designer to incorporate into their language!" That last clause is a bit incorrect in a way that makes the meaning unclear. It's probably not important, though.
 * Destynova (talk) 20:33, 10 February 2008 (UTC)

Module without type signatures
I found these two example in section of "Type signatures in code" has a lot of things that does not metioned in previous chapter, for example, the map and (x:xs).

This make me feel distraction to think about what heck the code is, and the most important thing, the syntax of how to declare function type, has became unobvious.

Could we just use something we worte in chapter "Next step" and add type signatures to them as a example?

For example: mySignum x :: Int -> Int mySignum x = if x < 0 then -1 else if x > 0 then 1 else 0

I think it is much more clear then current examples.

 * BrianHsu 07:27, 24 Sep 2008 (UTC)

Type signatures in code example uses point-free style
You said you didn't want to introduce something new without explaining, but here's a glaring example of just such an inclusion. These should be rewritten in a style new readers are already accustomed to. It's mentioned for the first time in http://en.wikibooks.org/wiki/Haskell/List_processing.

Very good. It would be helpful to know which type signature checks require a module import before describing them. 91.135.3.166 (talk) 16:16, 31 August 2010 (UTC)

I agree that this section has some problems. It introduces code in modules (not yet discussed) that uses partial application (not yet discussed) with the map function (not yet discussed) for list processing using the cons operator (both of which are not yet discussed)... Hopefully it is obvious now that it violates the principle of not using anything that has not yet been taught (or even mentioned, sometimes) to the reader. Digichoron (discuss • contribs) 16:15, 4 April 2011 (UTC)

 * The unexplained features are intentional: the point is that type signatures can provide useful information even if you don't understand the implementation. I agree that such a strategy can be distracting, and that the text doesn't make its intent as clear as it could be. I will try to think of a way to improve this section... --Duplode (discuss • contribs) 01:34, 2 April 2012 (UTC)

Is it really that type signatures are needed ONLY for documentation and debugging or are there situations where the compiler cannot infer a type?
In the section that talks about type inference, below the phrase "So if type signatures are optional why bother with them at all? Here are a few reasons: ..." only 2 reasons are stated. One is saying that it helps documenting the code and the other one for debugging. I am myself newly learning Haskell and I am wondering if these are the ONLY 2 reasons for having type signatures or if there are situations where the compiler cannot infer the types. If it is true that there are only these 2 reasons, then maybe it should be made clear that there are no other reasons, otherwise it might be better to hint that there are some rare situations where the compiler cannot infer (and maybe link to the section where it is described).

 * Good point. There are situations in which type inference is not enough to make all signatures optional, but I think it would be difficult to talk about such situations at this point. In any case, the text needs to be made clearer. --Duplode (discuss • contribs) 01:39, 2 April 2012 (UTC)

Types overview and signatures?
Since in the ongoing chapters the Types are used, I would find it quite helpful to have a summary of

- what types are in Haskell available? - how do the transform into each other?

e.g. in https://en.wikibooks.org/wiki/Haskell/Type_basics_II you explain quite well fromIntegral, use the type Integral and explain that Fractional is a subtype of Num. So, I would be happy to have an overview what types are available and for which types I need a tranformation and for which none.

Additionally I would prefer as well a more clear hint reg. How to read the type-signatures? namely that the very right is the type of the return argument. But how to read the rest, e.g. what's the meaning of ? Or perhaps there are better (?) samples to illustrate how the signatures should work.

AND an explanation about  would be also beneficial, or even better that   is an explicit conversion and again: What is the meaning of the :: ?

At least these three items I would find beneficial for a beginner.

 * "what types are in Haskell available"? Lots of them? :) The richness of the type system, combined with the effective lack of a boundary between primitive types and user/library defined ones means there would be a lot of ground to cover. We might attack some parts of it with cheat sheets for subsets of the type system (e.g. number types). Somewhat related is something that the book is in dire need of: a concise overview of key data structures (key-value maps, popular array implementations,,   and so forth).
 * can be read as "A function which takes two arguments of some type  and produces a value of type , with   being an instance of (the class)  ". Or, adopting the view that all Haskell functions have just one argument, "A function which takes an argument of some type   and produces a value of type  , with   being an instance of  ". I will try to sneak a brief note to that effect into the text, either in Type Basics II or in Haskell/Classes and types.
 * is, to use the nomenclature of the Report, an expression type-signature - an inline signature, in this case with scope limited by the parentheses. It occasionally is needed to resolve types when neither the regular signatures you wrote nor the type inference are enough. One traditional example is, which will only work in e.g. GHCi if you use an expression signature, as in   or  . I agree it would be good to mention it in the book; I'm just not sure about where.
 * It should be mentioned that I find this first Type Basics chapter a little messy. I intend at some point to reorganize and streamline it a bit.
 * Duplode (discuss • contribs) 04:09, 13 April 2014 (UTC)

title: Talk:Haskell/Type basics


text:
User talk:A3392

EE Books
There are a good number of books on EE topics that i've started already. You can see a list of books I'm associated with HERE on my user page, and you can see the entire engineering book collection at Engineering bookshelf.

I've included alot of information from EE230 in the Signals and Systems book. If you want to write about probability stuff that is specific to EE, i would suggest writing it in there. If you want to start a whole new book on the subject, that's fine too, and I would love to help out. Let me know if you need anything in particular. --Whiteknight (talk) (projects) 21:59, 25 July 2006 (UTC)

MATLAB Programming
There already is a book about programming matlab: MATLAB Programming. I have wanted to do alot of work to this book myself, because it is in terrible shape. If you want to "adopt it", and make it awesome, I would love to help out. I keep hoping that somebody will write alot about matlab, because i do reference it in alot of my books, and I want people to have a good background in it. --Whiteknight (talk) (projects) 22:26, 27 July 2006 (UTC)

Did you just try to leave me a message?
Did you just leave me a message? I see you've been doing some good work on that matlab book, and the DSP book as well. I fixed some of your work in the DSP book, but overall it's good. --Whiteknight (talk) (projects) 19:32, 3 August 2006 (UTC)

Navigation
First off, the Matlab book is already on a bookshelf: Programming languages bookshelf. There are a lot of books there, but they are listed alphabetically, so you should be able to find your link.

Second, you want to include inter-page navigation in your book? you could use the nav or nav2 templates. Here are some examples:

Produces:

and

Produces:

You could also create your own template to go at the top of every page, that would include some automatic navigation for you. For an example of a template (and it's one that I personally made), you can look at Human Physiology/Senses. The grey box at the top of the page is automatically included on every page, and it shows all the main chapters of the book, as well as the "previous" and "next" chapters in the book. I can help you make one of those for the MatLab book, if you want something that fancy. --Whiteknight (talk) (projects) 19:41, 3 August 2006 (UTC)

Communication Systems
I already started a book called Communication Systems, which essentially covers alot of information from EE300, EE310, and EE320. That book already has a bunch of pages and a good basic framework, so you can edit that if you want. I have also been planning a new book that will specifically talk about computer networking, and I have prepared a basic outline for the book HERE on my user page. If you are interested in that book, let me know, and we can work on getting it started. In fact, I have alot of projects in the works, and more projects being planned. Look around On my user page at some of the things I have listed, and see if anything catches your interest. --Whiteknight (talk) (projects) 19:44, 3 August 2006 (UTC)

*Basic Reading and Writing data from a file
I'm not sure what book this new page is part of. Plus it is an orphan (ie no page links to it) meaning that in practice it will not be read. Could you move it to Book title/Basic Reading and Writing data from a file (see WB:NP for why) and link in the page to the book it belongs to. Thanks, Jguk 15:18, 7 August 2006 (UTC)
 * I'll take care of it. I know where this page is supposed to go. --Whiteknight (talk) (projects) 15:29, 7 August 2006 (UTC)

MATLAB page naming
Hey tony, I'm going to go through and rename the pages in the matlab book, because they currently don't follow the correct convention. All pages should be listed as "MATLAB Programming/Page Name", not just "Page Name". I'll move everything now. If you have any questions, let me know. --Whiteknight (talk) (projects) 15:32, 7 August 2006 (UTC)

 * Yeah, naming convention things can be a big pain in the ass, but lucky for you, I have alot of experiance fixing them. If you have alot of questions, you can check out the Wikibooks help pages HERE to see how to do all sorts of formatting, links, images, etc. You can always feel free to ask me anything, cause I've been around the block here a few times, and can probably help you out. By the way, If you have some time and don't mind it, how about you stop by the Votes for Adminship, and cast a vote for me. --Whiteknight (talk) (projects) 15:38, 7 August 2006 (UTC)

Here is a helpful note for you, that will make all your pages formatted correctly: When you create a new link in your book, use "forward slashes" before and after your link:
 * /Strings/

This will automatically make a link that points to "MATLAB Programming/Strings". I'm changing over all the old links now in your book, it should take me about 5 minutes. --Whiteknight (talk) (projects) 15:42, 7 August 2006 (UTC)

Navigation Templates
There already is a template for use with this book. If you write, it will produce the template you see on the right. You are free to use this template if you would like, but you dont have to. Also, I can create a navigation template that can go at the top of every page in the book, if you want. Just tell me how yuo want it to look, and what links you want it to have, and I will get to work on it. --Whiteknight (talk) (projects) 15:58, 7 August 2006 (UTC)

Thanks!
Thanks for all the contributions you've made to MATLAB Programming.

title: User talk:A3392


text:
Cookbook:Stuffed Zucchini

Stuffed zucchini can be served as an appetizer or as a side dish.

Ingredients

 * 6 zucchini (courgettes)
 * 3 tbsp olive oil
 * 10 oz (280 g) chopped frozen spinach, thawed and drained
 * 2 onions, finely chopped
 * 8–10 oz (220–280 g) button mushrooms (canned or fresh), finely chopped
 * 2 eggs, lightly beaten
 * Salt
 * Pepper
 * Paprika
 * 4 cloves garlic, minced

Procedure

 * 1) Preheat oven to 350°F (180°C).
 * 2) Trim ends of zucchini and boil, covered, for 5 minutes. Drain and cover.
 * 3) Cut in half lengthwise.
 * 4) Scoop out pulp, leaving a ¼ inch (0.75 cm) shell. Chop the removed pulp.
 * 5) Heat olive oil in sauté pan.
 * 6) Sauté zucchini pulp, spinach, onions, and garlic for 5 minutes.
 * 7) Add mushrooms and sauté another 3 minutes.
 * 8) Remove from heat, add eggs, salt, and pepper, and mix well.
 * 9) Spoon filling into shells.
 * 10) Sprinkle with paprika.
 * 11) Bake for 30 minutes.

title: Cookbook:Stuffed Zucchini


text:
User talk:Bone Spencer

Mr. Bone Spencer:

I am currious to see what you mean when you say that a group of "leading astrophysicists estimate the universe to be 151 light years wide?" Perhaps the word billion and a deimal after the number 5 is in order? Anyway, I am just currious as what what is meant by that on your introductory astronomy page. If that is indeed the case, however, then it might be in order to begin explaining how it is that a 13.8 billion year old universe could possibly be 15.1 billion years across. (Of course, this deals with relativity etc... but there is certainly a lot left to explain even on an introductory page.)

Best wishes, Jordan Montgomery

title: User talk:Bone Spencer


text:
User:Qwertyus

Qwertyus sometimes writes some things about programming.

title: User:Qwertyus


text:
User:PatrickD

see Wikipedia

title: User:PatrickD


text:
User:Melroch/monobook.css

body {

font-family: DejaVu Serif, DejaVu Sans, Arial Unicode MS, Doulos SIL, Thryomanes, Gentium, GentiumAlt, Code2000, serif; font-size: 8pt ! important; /* text-align: justify; */

}

h1, h2, h3, h4, h5, h6, h7 {

font-family: DejaVu Sans, Arial Unicode MS, Microsoft Sans Serif, sans-serif;

}

sup { vertical-align: 50% }

sub { vertical-align: -25% }

a:link, a:visited, a:active, a:hover {

text-decoration: underline ! important;

}

a:visited { color: #a00 }

a.new, #p-personal a.new { color: #FF9900; } a.new:visited, #p-personal a.new:visited { color: #FF33FF; }

span.graphemic:before { content: "⟨"}

span.graphemic:after { content: "⟩"}

th {

font-family: DejaVu Sans, Arial Unicode MS, Microsoft Sans Serif, sans-serif;

text-align: left; font-size: 8pt ! important; }

caption {

font-family: DejaVu Sans, Arial Unicode MS, Microsoft Sans Serif, sans-serif;

font-weight: bold; font-size: 10pt ! important; }

div.editsection { font-size: smaller; }

.IPA {

font-family: DejaVu Serif, DejaVu Sans, Arial Unicode MS, Doulos SIL, Thryomanes, Gentium, GentiumAlt, Code2000;

}

.sans {

font-family: DejaVu Sans, Arial Unicode MS, Microsoft Sans Serif, sans-serif;

}

.red {color: #a00;}

.smallcaps {font-variant: small-caps;}

/* save ink and paper with very small fonts */ @media print {

#footer, #content, body { font-size: 8pt !important; margin 1in; }  h1 { font-size: 16pt; page-break-after: avoid; }  h2 { font-size: 14pt; page-break-after: avoid; }  h3 { font-size: 12pt; page-break-after: avoid; }  h4 { font-size: 10pt; page-break-after: avoid; }  h5 { font-size: 8pt; page-break-after: avoid; }  h6 { font-size: 8pt; font-weight: normal; page-break-after: avoid; } .toc {display: none} a:link, a:visited, a:active, a:hover { text-decoration: underline ! important; }

}

title: User:Melroch/monobook.css


text:
Talk:UNIX Computing Security/Log files and auditing

Hi,

I want to know how can I find the machine Id on which someone has logged as Root in any of the Unix boxes.

Thanks.


text:
User:Rmbyoung~enwikibooks

My Wikipedia page is at http://en.wikipedia.org/wiki/User:Rmbyoung

title: User:Rmbyoung~enwikibooks


text:
User talk:Maddie~enwikibooks

New here/chapter one:cool

Today i joined the site it was realy cool and i still think it is this is a draft so if you read this it will sound bad becauce this is the last sentence.

i love du site it rocks * waves hands in air*

Your account will be renamed
Hello,

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

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

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

Sorry for the inconvenience.

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

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

title: User talk:Maddie~enwikibooks


text:
J2ME Programming/Introduction

Introduction
J2ME - Java 2 Micro Edition

This book is intended to give a simple introduction to programming in J2ME and is intended for readers with some previous programming experience.

Java is very similar to C++ so if you have any C++ experience you will probably find it very easy to pick up.

title: J2ME Programming/Introduction


text:
Cookbook:Long Island Roast Duckling

 * Duck | Poultry

Long Island roast duckling is part of the regional cuisine of eastern Long Island, New York stemming from Long Island's thriving duck-farming industry which began in the late 19th century.

According to Alton Brown, host of the Food Network's Good Eats, duck farming got its start on Long Island after an American businessman touring China in 1873 bought 25 white pekin ducks and shipped them to Long Island. Only nine survived the trip but those nine reproduced quickly and their descendants eventually found themselves on Long Island's numerous duck farms.

White pekins (also called Long Island pekins) now represent 95% of the ducks sold and consumed in the US and are raised on farms in many parts of that country.

According to Brown, many people shy away from cooking whole ducks because of their high fat content. Fortunately, there are cooking methods for removing the excess fat.

White pekin meat has a mild flavor and, if served skinless, is lower in fat and calories than skinless chicken breast. Farmers slaughter these birds after six to eight weeks of growth when the meat is at its most tender.

This recipe utilizes a vertical roasting method to drain the fat away from the duck.

Ingredients

 * 1 whole pekin duckling (3–6 lbs, 1.5–3 kg)
 * Salt
 * Pepper
 * Butter-flavored nonstick spray

Preparation

 * 1) Preheat oven to 450 °F.
 * 2) Rinse and wipe duckling, removing giblets.
 * 3) Set bird aside in an airy place to allow the skin to dry.
 * 4) Rub inside cavity with salt and pepper.
 * 5) Insert vertical oven roaster (used for "beer can chicken") into bird, and prop it upright.
 * 6) Coat bird on all sides with butter-flavored spray and sprinkle salt and pepper lightly over the skin.
 * 7) Place bird and vertical roaster into a large roasting pan (use a wire rack insert if you have one) and add ½ cup water to the bottom of the pan.
 * 8) Leave bird in oven for 30 minutes, then reduce heat to 325 °F until done. No need to prick skin or baste bird, as the fat slowly renders off leaving a wonderful crispy skin. Keep the bottom of the roasting pan covered with water to prevent smoking.
 * 9) Pour off fat and save, reserving drippings and liquid from the roasting pan.

Notes, tips, and variations

 * Serve with brown rice, rice pilaf or baked sweet potatoes.
 * Use the duck fat to cook sliced potatoes or to make duck confit.
 * The fat and liver can be cooked together to make a very tasty paté so don't throw any of it out.

title: Cookbook:Long Island Roast Duckling


text:
Cookbook:Duck Stock

Ingredients

 * Leftover bones from roast duck
 * Pan drippings
 * Duck giblets (gizzard, heart, neck, skinned/peeled duck feet)
 * 1 tsp salt (or to taste)
 * 6 cups (1200 ml) water
 * ½ tsp vinegar

Procedure

 * 1) Cook everything in a tightly covered heavy stock pot over medium heat until it reaches a full rolling boil, then reduce heat and allow to simmer for 1 ½ hours.
 * 2) Drain and reserve liquid, discarding bones and reserving any meat.

Notes, tips, and variations

 * Don't worry about the vinegar spoiling the flavor of the stock; it cooks out and helps leach nutrients such as calcium from the bones, leaving no vinegary odor/flavor behind.

title: Cookbook:Duck Stock


text:
Category:Broth and stock recipes

Recipes for broth and stock.

title: Category:Broth and stock recipes


text:
Cookbook:Cream of Duck and Mushroom Soup

This recipe first appeared in a Collection of Recipes by Chef Taylor Piercefield. Chef Piercefield also made variations of this soup with Morel Mushrooms.

Ingredients

 * 4 cups (950 ml) duck stock
 * 3 duck egg yolks (chicken egg yolks will work too)
 * 2 cups (480 ml) milk or half and half
 * ½ cup (120 ml) chopped duck meat
 * 8 oz (225 g) sliced mushrooms
 * ½ tsp thyme
 * nutmeg to taste (optional)

Procedure

 * 1) Heat duck stock in a heavy, covered saucepan over medium heat.
 * 2) Add thyme, chopped duck meat, and mushrooms, and cook until mushrooms are tender.
 * 3) In a mixing bowl, whisk egg yolks and milk until well-blended, then slowly add to soup.
 * 4) Stir continually until soup mixture begins to thicken.
 * 5) Sprinkle in nutmeg and serve.


text:
J2ME Programming/Statements

In J2ME (or JavaME), all methods and statements are wrapped in classes. As it is written in Java, unlike C++, only one pointer operator is used. So, all references are written as follows:

title: J2ME Programming/Statements