text:
Cookbook:Feuerzangenbowle (German Wine Punch)

Feuerzangenbowle is a traditional German alcoholic drink, often part of a Christmas or New Year's tradition. The name translates literally as "fire-tongs punch". Pay attention to the preparation and don't let drunks light the rum—it can cause nasty burns and you don't want that. The flambéed and caramelised "Zuckerhut" adds the unique flavour to the "Feuerzangenbowle".

Ingredients

 * 2–3 bottles of dry red wine (e.g. Rioja)
 * 0.4 L rum (at least 54% alcohol; 80% would be better)
 * 2 oranges
 * 2 lemons (optional)
 * 1 cinnamon stick
 * 5 cloves
 * 1 pinch ground gingerbread spices (optional)
 * 1 zuckerhut (lump of white sugar)

Special equipment

 * Feuerzange (specialized grate to hold the sugar)
 * Feuerzangenbowle bowl and heater
 * Ladle

Procedure

 * 1) Put the wine into the feuerzangenbowle bowl, and heat it to about 70 °C.
 * 2) Wash the fruit with hot water.
 * 3) Peel the oranges and lemons into thin strips, and add the peel to the wine along with the spices.
 * 4) Place the feuerzange on the bowl and place the zuckerhut on it.
 * 5) Put the rum into a soup ladle and pour it over the zuckerhut. Then, carefully light it on fire.
 * 6) When the flame on the sugar has stopped burning, repeat the process with a fresh ladle of rum. Add the rum very slowly this time or you will burn your hand.
 * 7) When the sugar has completely dissolved, remove the feuerzange and add another ladle of unburnt rum to the bowl.
 * 8) Remove all solids (oranges, lemons, cloves, and cinnamon stick) from the bowl from the drink.

Notes, tips, and variations

 * The rum has to have at least 50% alcohol; otherwise the flambeing won't work. If the rum has a higher percentage of alcohol (>60%) the flame will be very big. Proceed with caution and add the rum slowly.
 * If you can't obtain a zuckerhut, substitute sugar cubes.
 * If you can't obtain a feuerzange, replace it with a grate.
 * Instead of the feuerzangenbowle bowl and heater, you can also use a big pot on a normal cooking plate. A very appealing solution for a feuerzangenbowle bowl is a large (5 L or so) lab glass beaker (not previously used for its original purpose). It combines heat resistance and transparency, adding to the effect.


text: Category:Book:University of Alberta Guide

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


text:
Category:Book:Urdu

ur:زمرہ:اردو

title: Category:Book:Urdu


text: Category:Book:Fujitsu Siemens Loox 720

title: Category:Book:Fujitsu Siemens Loox 720


text: Category:Book:Use the Source

title: Category:Book:Use the Source


text: Category:Book:Vedic Mathematics

title: Category:Book:Vedic Mathematics


text: Category:Book:Visual Language Interpreting


text: Category:Book:Van Dwelling

title: Category:Book:Van Dwelling


text:
Category:Book:Visual Basic .NET

fr:Catégorie:Visual Basic .NET (livre)

title: Category:Book:Visual Basic .NET


text:
Muggles' Guide to Harry Potter/Characters/Marcus Flint

Overview
Marcus Flint is an older boy in Slytherin house, who is Captain of the Slytherin Quidditch team.

Philosopher's Stone
Marcus Flint, here a sixth-year, plays as a chaser and captains the Slytherin Quidditch team in their game against Gryffindor house. He purposely blocks Harry in his first Quidditch Match to prevent him from getting the Golden Snitch and Gryffindor is given a penalty. He scores five goals for Slytherin when the whole crowd is transfixed on how Harry's broom is trying to throw him off.

Chamber of Secrets
Marcus Flint is the captain of the Slytherin Quidditch team. He first appears in "Mudbloods and Murmurs", when the Slytherins arrive to take over the Quidditch pitch from the Gryffindor team. He tells the Gryffindors that Severus Snape has given them permission to practice on the Quidditch Field due to the Slytherin Team having a new seeker, who turns out to be Draco Malfoy. When Malfoy calls Hermione Granger a mudblood, Fred and George Weasley attempt to jump on Malfoy, only to be stopped by Flint, who quickly dives in front of Malfoy.

Later on in the year, he plays in the Gryffindor vs. Slytherin Quidditch Match. Gryffindor wins and Flint, who is furious yells at Malfoy for having the snitch on top of his head and not noticing.

Prisoner of Azkaban
Somehow Marcus Flint is still at Hogwarts, because he is mentioned as being Captain of the Slytherin Quidditch team, and in the game against Gryffindor (in which Harry is flying his Firebolt) it is mentioned that Flint has chosen players for size rather than skill. We see him again when he, Draco, Crabbe, and Goyle disguise themselves as Dementors in a failed attempt to put Harry off his game in the Quidditch match against Ravenclaw. They are all caught by Minerva McGonagall after Harry performs the Patronus Charm. They are all sentenced to detention and McGonagall says she is taking fifty points from Slytherin House as well.

Later in the Gryffindor vs. Slytherin Quidditch Match, he plays in it. After Angelina Johnson scores a goal for Gryffindor, Flint rams into her and Fred Weasley throws him beater's bat at the back of Flint's head, making Flint's head smash into his broom, making it bleed. For this, Madam Hooch awards both teams fouls. He fails to score the foul because Wood blocks it. Flint manages to score one goal for Slytherin in the match. However, Harry catches the snitch before Malfoy, therefore making Gryffindor win the match and the Quidditch cup, as well. Flint is likely angry about this.

The author has said that, given a choice between her making a mistake and Flint having had to repeat a grade, she thinks it rather more likely that Flint has had to repeat a grade.

Relationships with Other Characters
It would appear that most of the members on the Slytherin Quidditch Team have a good relationship with Marcus, as he is the Quidditch Captain of the Slytherin Quidditch Team. However, it is unknown what his exact relationships are with them since he is such a minor character and it never goes into detail what his relationships are like with them. He has apparrantly a good relationship with Draco Malfoy, as he lets him onto the Slytherin Quidditch Team as seeker after Draco's father buys the entire Slytherin Quidditch Team Nimbus two thousand and ones and protects him after Ron tries to curse Malfoy after the latter called Hermione a mudblood. This is shown once again in the next book when Malfoy's arm is injured by Buckbeak and Flint tells Wood that they cannot play due to Malfoy's arm still being injured. Despite Flint's good relationship with Draco Malfoy, at least one time he is noted to yell at Malfoy after the snitch was a matter of inches above Malfoy and he didn't grab it. His rival is the Gryffindor Quidditch Team, Oliver Wood. This is shown quite a few times in the books and even in the movies. For example in the books, in Quidditch Matches where Flint plays against Wood, he often tries to break Wood's fingers when the referee asks the Quidditch Captains to shake hands and he even tries to injure or even knock some of Wood's teammates off their brooms when he cheats. In the films, he even went as far as to knock Wood off his broom by hitting a bludger right at him after Wood had constantly blocked the Slytherin chaser's goal attempts.

Analysis
Marcus Flint never appears except in his role as Captain of the Slytherin Quidditch team. In that role, he seems to be relatively unimaginative, and somewhat brutish — rather than using skill to win games, at least against Gryffindor, he seems to prefer to make as many fouls as possible, on and off the pitch, in the hopes that some of them at least will not be seen by the referee.

Outside the context of Quidditch, Flint does not seem to exist; he is never mentioned by other characters.

Like any extended series, the Potter books have a number of small internal consistency errors that purists pick up on and often complain about. With a very few exceptions, these errors do not affect the line or enjoyment of the story at all. The error that puts Marcus Flint at Hogwarts for an extra year was one of the earlier ones detected on the fan sites, and at least one fan site has chosen to call all such errors "flints" in commemoration of its discovery.

Questions
1) What do you think happened to Flint after he graduated Hogwarts in Prisoner of Azkaban?

2) Is Flint just a mean and ugly bully and cheater or a misunderstood character?

3) Do you think there's any reason to Flint's rivalry against Wood?


text:
Talk:UNIX Computing Security/Access authorization

Password formats
Documenting the old DES password is so 90's, is it better to tell people about MD5 and blowfish password formats as well? AbelCheung 20:39, 30 July 2006 (UTC)


text:
User:Mirza~enwikibooks

reduftyugyhfyjuj

title: User:Mirza~enwikibooks


text:
User:Mjbt

I'm an engineer who believes that the Wikimedia Project can create a lot of good in the world by providing a free information resource for learning.

The Wikibooks that I am interested in are:

es:Usuario:Mjbt
 * Technologies for Rural Development
 * Wikijunior How Things Work

title: User:Mjbt


text:
Reconstruction/Mold Treatment/Mold Treatment/Scrub and Spray

The two part process by which wood is treated in order to kill mold and treat wood against future mold growth.

Scrubbing
Materials:
 * Five Gallon Bucket
 * Water
 * Bleach
 * Original Pine-Sol
 * Large, Heavy-Duty Sponge (one per person)

Suggested PPE:
 * 3M Half-face respirator with p100 filters
 * Rubber or Latex Gloves

Procedure:
 * 1) Fill the 5 gallon bucket with approximately 4.5 gallons of water.
 * 2) Pour 3 ounces of Pine-Sol and 9 ounces of Bleach into the water. Stir well.
 * 3) Soak a sponge in the solution.
 * 4) Scrub sponge against wood areas, including walls, beams, and staircases. Apply generously so that solution has visibly soaked into the wood.
 * 5) Re-wet sponge as necessary to ensure that there is enough solution being applied.
 * 6) Repeat steps 4 and 5 until all areas are covered. If solution runs out, repeat steps 1 and 2 to create more.
 * 7) Let wood dry before beginning the following spray process.

Spraying
Materials:
 * Five Gallon Bucket
 * Water
 * Timbor Solution
 * 16oz. Scoop
 * Stirring Rod
 * Sprayers

Suggested PPE:
 * 3M Half-face respirator with p100 filters
 * Rubber or Latex Gloves

Procedure:
 * 1) Fill the 5 gallon bucket with approximately 4.5 gallons of water
 * 2) Slowly pour in a 16oz. scoop of Timbor, while continually mixing, assuring that all particles are dissolved
 * 3) Repeat for a total of ten scoops.
 * 4) Fill mixture into sprayers.
 * 5) Spray all wood areas so that they are coated in the Timbor solution.
 * 6) Refill sprayers and remix Timbor solution as necessary.
 * 7) Continue process until all wood areas are covered.


text:
Technologies for Rural Development/Complete

= License = = GNU Free Documentation License =


text:
Category:Icelandic recipes

Recipes from Iceland.

title: Category:Icelandic recipes


text:
Category:Rosehip recipes

Recipes involving rosehips.

title: Category:Rosehip recipes


text:
Category:Rum recipes

Recipes involving rum.

title: Category:Rum recipes


text:
Category:Cream cheese recipes

Recipes involving cream cheese.

title: Category:Cream cheese recipes


text:
Calculus/Building up to the Riemann-Darboux Definition

Note
These lectures aren't specifically designed to go for a day, hour, or week. If there's any subject within this you want to go into, I can. I'm giving you a guideline here, and occasional exercises to make sure you understand; but I want you to understand that ultimately the learning process is guided by you.

Ask more questions, or where you want to go more in depth freely. Fephisto 03:58, 31 July 2006 (UTC)

Reading
If you feel up to it, you can read Calculus/Definite integral's section on the definition of the integral, but we'll just steal their diagrams.

Background
The full most general definition of an integral isn't the Riemann-Darboux Definition. The full, most general definition of an integral would allow us to perform an integral on sets not necessarily numbers. The full definition would also include us moving from basic set theory to group theory to ring theory to field theory and defining the nooks, crannies, lemmas, and theorems along the way. Therefore, initially at least, there's going to be a bit of hand waving here, and occasionally we might need to backtrack to an important theorem.

Set theory wise, the key ideas needed are those of a supremum, its opposite (the infimum), and a partition.

The Supremum
The supremum is otherwise known as the least upper bound. Conceptually, we take the upper bound of a set to be the number that no other number in the set can be higher than (but can be equal to). In this way the upper bound of the set 1-5 can be 5, 5.1, 6, or a million. The least upper bound (which, by the way, is unique, but for our purposes we will not prove) is the number that is not only an upper bound, but the smallest upper bound. In this fashion we can state, at least heuristically, that of the set 1–5, its least upper bound is indeed 5.

If you're a visual learner (I apologize for my lack of artistic ability hereon):

Now the formal definition of a least upper bound.

For a field $$F$$, a number $$b \in F$$ is a l.u.b. of a set $$E \sube F$$ iff:

1)b is an upper bound of E, or:

if for all $$x \in E$$, $$x \leq b$$.

and

2)if c is any upper bound for E:

$$b \leq c$$

The infimum is similarly defined.

So then for the set A = {x | 1 $$\leq$$ x $$\leq$$ 5}, prove that 5 is the supremum.

The Partition
A partition is a 'cut-up' portion of a field, but doesn't necessarily need to have all elements of that field inside of itself. For example, in the set of real numbers I could have my {1,2,3,4,5} set, and this would be a partition of that set, similarly I could have {1,1.1,1.2,1.3,....,4.9,5}.

Put more formally:

A partition of [a,b] is a set of points P={x0,x1,...xn} with $$n \geq 1$$ and a=x0 < x1 < ... < xn=b. Furthermore, if P and Q are partitions of a field F and $$P \sube Q$$ then Q is a refinement of P.

Likewise in our two example partitions, {1,1.1,1.2,1.3,....,4.9,5} is a refinement of {1,2,3,4,5}.

The Supremum/infimum of a function
When building the definition, we need some strict notions of a subinterval (a subset of a partition), and what it does to a function. Now by the completeness axiom (actually, not an axiom, but we will take it as such, it states that every subset of the real number system has a least upper bound).

A Small Exercise
Now, prove that if $$\mathbf{R} \supe F$$ and $$F \supe E$$ then $$sup E \leq sup F$$.

By a similar proof $$inf E \geq inf F$$, and with these two lemmas we can take a subinterval [xi-1,xi] of partition P of [a,b], and if a function f: [a,b] $$\rightarrow \mathbf{R}$$ is bounded, then f is bounded on the subinterval, which allows us to define for each i=1,...,n:

Mi = sup f over [xi-1,xi]

and

mi = inf f over [xi-1,xi]

The Riemann Darboux Sums
We're getting one step closer here, and we can finally define the Riemann-Darboux Upper and Lower Sums. This is essentially the integral only it's missing a key property which will be disclosed in the next lecture.

As an example of the concept of what we're doing here, at least for the upper sum, before showing the jumble of symbols, is we take a partition's subinterval, and find the highest value of the function on that interval, multiply it by the subinterval's length, get the rectangle, and sum like crazy. The lower sum is similar only taking the lowest value of the function.

The idea of this is similar to figure 5 in the textbook:

But let's reformat the image a bit:

Now, the GENERAL definition of an integral, in case your curiosity peaks your interest, picks a RANDOM value of the function on the subinterval, which is what is shown in figure 5.

Either way, here it is in its glory:

U(P,f) = $$\sum_{i=1}^n M_i (x_i - x_{i-1})$$

L(P,f) = $$\sum_{i=1}^n m_i (x_i - x_{i-1})$$

For now I'll leave you a small exercise with the upper and lower sums, but this won't be the end of this lecture.

Summing Exercise
Let f: [0,1] $$ \rightarrow \mathbf{R}$$ be f(x) = x, and let $$n \in \mathbf{N}$$ to form a uniform partition P = {i/n | 0,...,n} for i from 1 to n. Find U(P,f) and L(P,f) explicitly.

Solution
1.(n+m)/2n.

More Details about the Partition: The point refinement
There is a very intimate connection that is made between the partition, it's refinement, and the upper and lower sums that will bring about the integral.

For now, let's examine some properties of the refinement of a partition and its upper and lower sums. Intuitively, it makes sense that the lower sum should be lower than the upper sum. Also, if we make the intervals smaller by creating a more refined partition, intuitively we should have a smaller upper sum than before (because we aren't overestimating the upper sums), and a higher lower sum than before.

So, say we have a partition P of [a,b] and a refined partition P with ONE extra point P'=P ∪ {z}, and if $$f: [a,b] \rightarrow \mathbf{R}$$ is any bounded function, then by our intuition we stated that $$L(P,f) \leq L(P',f) \leq U(P',f) \leq U(P,f)$$.

Exercise
The actual proof I'm going to leave up to you. The following might be helpful (but if you want to be entirely creative, that's fine too):

-Working with the subinterval containing the point z separately, comparing the sums around that point, and citing the rest by similarity.

-Noting that the proof that $$L(P,f) \leq L(P',f)$$ is similar to the proof of $$U(P,f) \leq U(P',f)$$.

-You may have to cite what you've proven before in The Supremum/infimum of a function_A Small Exercise

The main idea about partitions is just that they're an ordered set of a collection of intervals.

More about partition refinements: using point refinement
We're now going to generalize what was just proven, what was proven above could be said to be a 'weak statement' while this is a 'strong statement'. In fact, it is not just point-refinement that share this quality, but ANY refinement of a partition follows this!

So, if $$f: [a,b] \rightarrow \mathbf{R}$$ is a bounded function and P and Q are partitions of [a,b] where Q is a refinement of P then:

$$L(P,f) \leq L(Q,f) \leq U(Q,f) \leq U(P,f)$$

Proof. For $$r \in \mathbf{N}$$ let J(r) (in English for simplicity) be "if the Q - P has r elements,  then our statement above is satisfied." We will prove that J(r) is true for all $$r \in \mathbf{N}$$ by induction.

J(1), the base case, is the point-refinement proof exercise.

For the induction step assume J(r) for $$r \in \mathbf{N}$$. We prove J(r + 1). Assume Q - P has r + 1 element. Let Q' be the partition such that Q' - P has r elements. By the induction assumption:

$$L(P,f) \leq L(Q',f) \leq U(Q',f) \leq U(P,f)$$

And since Q is a one-point refinement of Q', by the exercise proof again:

$$L(Q',f) \leq L(Q,f) \leq U(Q,f) \leq U(Q',f)$$

And with these two inequalities we show:

$$L(P,f) \leq L(Q,f) \leq U(Q,f) \leq U(P,f)$$

Which is what we were trying to prove. Q. E. D..

Another property of the supremum
At least in my local area, we call this "the approxiamation property of the supremum." However, local lingo might be different elsewhere, and most of the time it isn't brought up, however, it's important for the integrability criterion later on.

If we have a subset of the real number system $$E \sub \mathbf{R}$$ and b = sup E, then we have the following theorem:

b = sup E iff for all ε > 0 there exists $$x \in E$$ such that x > b - ε.

It has properties similar to a limit definition.

I'll go ahead and prove the converse of the biconditional:

if for all ε > 0 there exists $$x \in E$$ such that x > b - ε then b=sup E.

We'll prove this by contradiction, so assume $$b \neq sup$$, and let c be an arbitrary upper bound of E and assume c < b and let ε = b - c then by some algebra x > c. However, this can't be, since c is an upper bound of E, therefore $$c \geq b$$ by trichotomy, which by the definition of the supremum shows that b = sup E.  Contradiction, reductio ad absurdum.

Approximation Property Proof exercise
You do the forward. It might help to do a proof by contrapositive, and just use the definition of the supremum.

A final quantity
With all this talk about partitions and refinement we can show a last little definition:

$$L(f) = sup_P L(P,f)$$

$$U(f) = inf_P U(P,f)$$

Intuitively we can think of this as (for the first) the partition that gives the highest lower sum value, and (for the second) the partition that gives the lowest upper sum value. What these actually are we'll leave as a mystery for now.

Return of the summing exercise
for our function f(x) = x and uniform partitions $$P_n$$ of [0,1], find U(f) and L(f) explicitly. Do you notice anything?

Extra
I've messed up the nomering a bit since the proof I'm about to show that fills in the spots in the proof on the Discussion has as its parts the Archimedean property. Either way, here we go:

Let $$a, b, x \in \mathbf{R}$$ with a 0, then we will prove that there exists a rational multiple of x (call it the element b suggested in the Discussion's proof) in the interval (a,b).

There's quite a bit to build up here, just so we don't have to go back too far, I hope you can take the following by intuition: that the set of natural numbers (1,2,3,...) is not bounded above in the set of real numbers, therefore for any element x of the set of real numbers, there is an element n of the natural numbers such that n > x.  As an exercise, you could prove this using the completeness axiom (if you try it, and want me to check it, go ahead and title it sub-archimedean proof). If you want to try, I suggest a reductio absurdum using the definition of an upper bound.

The Archimedean Property

For every real x>0 there exists a $$n \in \mathbf{N}$$ such that 1/n < x.

By the theorem I just had you take by intuition (or you proved) for all $$x \in \mathbf{R}$$ there exists $$n \in \mathbf{N}$$ such that:

n > 1/x (since 1/x is also a real number)

And by minimal algebra:

x > 1/n

Quod Erat Demonstratum.

Back to the Actual Proof

Let $$q \in \mathbf{N}$$ be sufficiently large so that by the Archimedean property the following holds:

1/q < (b-a)/x

Then because the set of natural numbers is not bounded above the following set S is not empty:

$$S = {n \in \mathbf{Z} | n \cdot \frac{X}{Q} \geq b}$$

And by the definition of a lower bound, bq/x is such a lower bound for S. Then by the well-ordering principle (That a set that has a lower bound has a lowest element)  there is a smallest integer in S, call it l and let p = l - 1. Then by how we set S, and because l is the lowest element of this set, it follows that $$p !\in S$$ so $$p \cdot \frac{x}{q} < b$$. Furthermore, by our original inequality for q:

x/q + a < b

$$b \leq l \cdot \frac{x}{q}$$

And by transitivity:

$$x/q + a < l \cdot \frac{x}{q}$$

$$a < l \cdot \frac{x}{q} - \frac{x}{q}$$

$$a < (l-1) \cdot \frac{x}{q} = p \cdot \frac{x}{q}$$

Therefore, a < (p/q) x < b, and since (p/q) x is a rational multiple of x, we have proved that a rational multiple of x lies in the interval (a,b), which is what we were trying to prove.

Comment

This fills in the spot sup E > sup F implies an element b such that.....


text:
Muggles' Guide to Harry Potter/Magic/Animagus

Overview
An Animagus is a witch or wizard with the rare ability to transform into a particular animal at will. The Animagus spell is very difficult and dangerous to perform, which is one reason that all Animagi are required to be registered by the Ministry of Magic. Another reason is so the Ministry can ensure that an Animagus does not use his or her power for any illegal purpose while in their animal forms.

Extended Description
While the term is only presented and defined in Harry Potter and the Prisoner of Azkaban, the ability of some witches or wizards to change into the shape of animals is seen in the very first chapter of Harry Potter and the Philosopher's Stone. Here, Professor Dumbledore addresses a tabby cat as Professor McGonagall, and finds a woman sitting there when he looks again. Animagi are extremely rare. It is revealed that Professor McGonagall is one of the only seven registered Animagi of the century.

However, we know of four unregistered Animagi: Peter Pettigrew (Wormtail), who can transform into a rat, Sirius Black, who can turn into a large, black dog, James Potter, who transformed into a stag, and Rita Skeeter, who becomes a beetle.

The Animagus transformation is one of a very few forms of magic that can be performed in a controlled manner without a Wand. Sirius and Wormtail have displayed the ability to transform into their Animagus shapes without wands.

There is no mention of anything that can prevent an Animagus from transforming, wandless or otherwise; however, there is apparently a spell, identified outside of canon as the Homorphus Charm, which can be used to force a transformed Animagus back into his human shape. We see this charm used by Sirius Black and Remus Lupin to reveal Peter Pettigrew to the Trio. We note that the spell was cast by Lupin and Black simultaneously; this may have been necessary to increase the strength of the spell. One wizard casting the spell might not be enough to force the conversion, unless the targeted wizard was magically significantly weaker than the casting wizard.

Analysis
James Potter, Sirius Black, and Peter Pettigrew all became Animagi after discovering that their friend Remus Lupin was a Werewolf. Because a werewolf is only a danger to humans, they decided that they could keep him company during his transformations by turning into animals. They used their power to wander around the Hogwarts grounds at night, while Lupin was in his wolf form.

Rita Skeeter, who is a reporter, became an Animagus perhaps so that she would be able to spy on people to get good stories for the papers she writes for, notably the Daily Prophet and Witch Weekly. Note that the witch or wizard performing the spell does not have control over the specific type of animal he will become; the form that the wizard's animal form takes will depend on his personality at the time he performs the spell. The fact that Rita became a beetle, so very close to the proverbial "fly on the wall", could only be providential – she could not have selected for it.

One must assume that the main purpose for a wizard to choose to become an Animagus is as a way of transforming into an innocuous beast, so as to avoid recognition while acting illegally. It is for this reason that the Ministry requires that all Animagi be registered, so that any Transformed wizard who chooses to act illegally may be identified.

As mentioned in The Tales of Beedle the Bard (in Dumbledore's notes on "Babbitty Rabbitty and her Cackling Stump"), the Animagus transformation is a form of Transfiguration. There is a difference, though; a wizard who is Transfigured into an animal is fully an animal, with the animal's brain, comprehension, and abilities, which means that he must perforce remain an animal until some other wizard Transfigures him back into his original self. Following the Animagus transformation, the wizard retains his own original intellect and abilities, undiminished, and so can transform himself back to human.

It should perhaps be mentioned that Professor McGonagall has never done anything unlawful while in her Animagus state. Her sole reason for becoming Animagus was as part of her studies of Transfiguration.

Questions

 * 1) If a wizard performs the Animagus spell twice, can he or she then change into two different types of animal? Or would it change the type of animal he or she could transfigure into? Why?
 * 2) Could a wizard's Animagus form be the same as their Patronus?
 * 3) Could a wizard's Animagus form change from emotional trauma, as a patronus can?
 * 4) To become an Animagus, would you be more likely to use a spell or a potion?
 * 5) Do you choose the animal you transform into?
 * 6) Could a metamorphmagus who became an Animagus change the way they looked when transformed?

Greater Picture
It should, perhaps, be mentioned that in fact there is one wizard we see who displays both Animagus and Patronus forms. In Harry Potter and the Deathly Hallows, Professor McGonagall sends off three Patronuses to summon the three other Heads of House. These Patronuses, it should be noted, take the same shape as her Animagus form — tabby cats. Thus, it is safe to assume that the Animagus shape and the Patronus shape would be the same, if the two spells were cast at the same time. However, the Animagus spell (as opposed to the transform) is apparently an enabling spell, that allows the transformation to be made at will. What little information we have leads us to believe that the Animagus form is fixed once the spell is cast, while the Patronus can change due to life changes; both the Patronus and the Animagus forms reflect the personality at the time the spell was cast, but the Patronus spell is cast repeatedly while the Animagus is generally performed only once.


text:
Talk:Calculus/Building up to the Riemann-Darboux Definition

Go ahead and ask any questions you may be having here, or if you want me to speed up, slow down, or skip sections of the course. Feedback is encouraged. Fephisto 00:11, 31 July 2006 (UTC)

Basically, tell me when you want the next part of the lecture installed. Fephisto 17:40, 2 August 2006 (UTC)

You can start writing it, as I think I have undestrood the previous part. --vitalij 07:56, 4 August 2006 (UTC)

Sorry it's taken me a little while, I'll try to see if I can write more to keep ahead of you. I may be gone for this weekend, if I am, there will be at least these few exercises to keep you company, if not, I'll be sure to catch up with how you're pacing along. If you want to work during the weekend go ahead, either way, have a nice weekend.Fephisto 01:19, 5 August 2006 (UTC)

It takes time to write something good, so don't worry about how long you take to write something. So don't worry about the time you take to write something. --vitalij 06:52, 8 August 2006 (UTC)

What is general an what is about numbers?
I like very much the style of this text, but one thing is not really clear: which definitions can in general be applied to any field and which can be applied only to real numbers? There is another question: how many upper/lower bounds does a set have? Why we cannot just take the maximum/minimum? - First of all, keep in mind that real numbers are an ordered field. The supremum can work for any ordered field (thus it works for the real numbers). And, whenever I say for a field F, it means that it can work for the real numbers.

Technically a set can have an infinite amout of upper and lower bounds. A set that includes the numbers from 1 to 5 can have the upper bounds 6, 7, 8, 9, 10, 9.872347823..., etc.. The only thing that makes the least upper bound special is that it's lower than any other upper bound.

The reason we can't take the maximum of a set is because of a very slight technicality. Imagine we had a set that went from 1-5 but did not include 5, it approaches 5 ever so slightly, 5 is not the maximum number of the set (because it isn't included in it), but it is the least upper bound /of/ the set.

In case you were asking how many least upper/greatest lower bounds a set has, there is a proof (that I can show, or guide you along), that shows that the least upper/greatest lower bound is unique, i.e., for each specific set, there is one least upper and greatest lower bound.Fephisto 17:37, 2 August 2006 (UTC)

A Small Exercise
Exercise Now, prove that if $$F \supe \mathbf{R}$$ and $$E \supe F$$ then sup E ≤ sup F. Execution I will try to prove that $$sup E > sup F$$ implies absurd. If $$sup E > sup F$$ then there exist an element $$e$$ in $$E$$ that is bigger than any other element in $$F$$. But this is impossible because any element of $$E$$ is also an element of $$F$$. Do you think it is a good proof? --vitalij 07:08, 3 August 2006 (UTC)

Feedback
I really apologize for all the typos that were made in that script. I usually make things in LaTeX, but I guess it didn't transfer over well, either way it looks like you got my meaning.

In Mathematics we tend to be very critical of absolute proofs, what's the reason for this? What's the reason for that? What definition is being used here? What theorem is being used here? But you don't have access to a large number of theorems or definitions yet, and the general idea is fine.

This is being really picky, and showing each step and why, in case you wanted to know, all I'm looking for is that you understand the gneral areas of the concept of supremum, and it looks like you do:

Let's see, every element x in E is less than sup E, and every element y in F is less than sup F:

sup E >= x by def of supremum

sup F >= y by def of supremum

sup E > sup F by assumption

By another theorem (an Archimedean Theorem, which if you want I can dig up) implies that there is an element b such that sup E >= b > sup F.

An Archimedean Theorem Yes it would be useful to see something about that.

b is not in F by the definition of supremum

b is an element in E and not F, which contradicts with our other assumption, reductio ad absurdum.

Summing Exercise
Exercise Let f: [0,1] $$ \rightarrow \mathbf{R}$$ be f(x) = x, and let $$n \in \mathbf{N}$$ to form a uniform partition P = {i/n | 0,...,n} for i from 1 to n. Find U(P,f) and L(P,f) explicitly. Execution(Not complete) The intervals are [i-1/n, i/n] so for each interval $$i$$ I have sup f=i/n and inf f=i-1/n. U(P,f) = $$\sum_{i=1}^n M_i (x_i - x_{i-1})$$= $$\sum_{i=1}^n (i/n)(1/n)$$= $$1/n^2 \sum_{i=1}^n i$$

L(P,f) = $$\sum_{i=1}^n m_i (x_i - x_{i-1})$$= $$\sum_{i=1}^n (i+1/n)(1/n)$$= $$1/n^2 \sum_{i=1}^n i+1$$ Maybe I did something wrong. :-) What I haven't understood about that? --vitalij 07:34, 3 August 2006 (UTC)

Feedback
The main part was evaluating Mi and mi, good! That and this will be used extensively later on.

$$\sum_{i=1}^n m_i (x_i - x_{i-1})= \sum_{i=1}^n (i-1/n)(1/n)= 1/n^2 \sum_{i=1}^n i-1$$

Because mi=inf f=i-1/n right?

Also, $$\sum_{i=1}^n i = (n/2)(n+1)$$ So you can simplify a little more, the two sums look really similar, and will get more similar to come!

An exercise on partitions and refinements
Could you please add an exercise on partitions and refinements? Because I think I should work more on this topic. --vitalij 07:45, 3 August 2006 (UTC)

Feedback
This is, ironically, the next part! I'll add the next part including some more stuff on partitions and refinements (mostly refinements), and see if I can find more exercises. (After this the definition of an integrable function can easily be slid in.) Fephisto 06:11, 4 August 2006 (UTC)

More Feedback
If you want to know more about partitions we can go ahead and do that. I mainly focused on refinements, which are essential; but I'm not sure if that's what you wanted to cover. Fephisto 01:19, 5 August 2006 (UTC)

It is exactly what I wanted. Thank you. --vitalij 08:34, 7 August 2006 (UTC)

The point refinement exercise
Exercise We have a partition P of [a,b] and a refined partition P with ONE extra point P'=P ∪ {z}, and if $$f: [a,b] \rightarrow \mathbf{R}$$ is any bounded function, then by our intuition we stated that $$L(P,f) \leq L(P',f) \leq U(P',f) \leq U(P,f)$$. Prove it. Execution I define $$A={a \in P | az}$$. Let $$a'=min A$$ and $$b'=min B$$. This way $$[a',b']$$ is the minimal interval that contains z. As $$a \neq z$$ and $$b \neq z$$, I know that both elements are in P. So it is an interval of the partition P, suppose it is the k-th interval. I define: $$S=\sum _{i=0}^{k-1}M_i(x_i-x_{i-1})+\sum _{i=k+1}^{n}M_i(x_i-x_{i-1})$$ So I can say: $$U(P,f)=S+(sup_{[a',b']} f)(b'-a')=S+(sup_{[a',b']} f)[(z-a')+(b'-z)]$$ $$S+(sup_{[a',b']} f)[(z-a')+(b'-z)]= S+ (sup_{[a',b']} f) (z-a')+(sup_{[a',b']} f)(b'-z)$$ While: $$U(P',f)=S+(sup_{[a',b']} f)(b'-a')= S+ (sup_{[a',z]} f) (z-a')+(sup_{[z,b']} f)(b'-z)$$ Now, seeing that [a',z] and [z,b'] are subintervals of [a',b']. Using the Small Exercise I can say: $$sup_{[a',z]} f\leq sup_{[a',b']}f$$ and $$sup_{[z,b']} f\leq sup_{[a',b']}f$$ From this follows the statement I wanted to prove. For the lower sums the proof is similar. Do you think I missed something? --vitalij 07:30, 8 August 2006 (UTC)

Feedback
Good! However, I think a'=minA is a typo, was a'=maxA what you were going for? Also, you can go straight from U(P',f) to $$=S+ (sup_{[a',z]} f) (z-a')+(sup_{[z,b']} f)(b'-z)$$ since that's technically how it works from the definition, either way, both ways work. But yeah, good. Fephisto 04:36, 10 August 2006 (UTC)


text:
Technologies for Rural Development/Using water resources

Using Water Resources

Water has always been the most necessary resource for life on earth and therefore human development. Once fire was discovered and used to heat food it became possible to use water to boil some food times to make them more edible. It is believed that water was used for cooking as early as - by the people who lived in-. Population density was always highest in river basins as they are very fertile lands. Ancient civilizations flourished near the great rivers such as the Nile and Indus. It is known that water was used to irrigate crops to improve yields as early as 5500BC in Mesopotamia now present day Iraq. These basic types of irrigation are still used in many parts of the world. Early civilizations also used channelled water as a levelling device for construction. This principle is still used by most builders today; by using a transparent pipe filled with water to compare levels.

The Water Cycle
Water is the most important resource for the success of any community or project. All water resources are linked together in a huge global cycle. Understanding this cycle is very important for making decisions about what technologies and processes should be used to utilise the available water resources.

The water cycle has four main storage phases. These are:

 * In the ocean
 * In the atmosphere
 * On land
 * Under the ground

The majority of the water in the world is stored in the ocean. This water is heated up by the sun and evaporates into the air. The water is then stored in vapour form in the clouds until it falls to the earth as rain, hail or snow. When the water falls to earth there are many different processes that can happen. It can be stored as snow and ice in cold areas of the world for great lengths of time; it can flow across the ground as runoff and enter into streams, rivers and lakes; it can be absorbed directly by plants; or it can filter its way under the ground.

The water that infiltrates into earth becomes part of the groundwater system. This water is a very important resource for development because the process of infiltration, which can take a long time with the water flowing over great distances, causes the water to be purified and have important minerals added.

Drinking Water
Drinkable or potable water is a resource that is scarce in many parts of the world; it is also affected very easily by many types of pollution. Before drinking any water from an unknown source it is important to test its quality.

Water quality testing
A good indication of the quality of a water resource can be taken from the odour, the colour, and the quantity of particles. These three concepts give a general indication, before drinking it is best to filter it or get it tested in a laboratory if available.

If water is not potable there are a range of filtering processing that can improve its quality.

Water filtering
In polluted or even unfiltered mountain water there are many parasitic organisms and inorganic chemicals that are dangerous to humans, because of this it is very important to filter water.

If no energy or technology is available the simplest way to filter water is using a cloth. Water taken from any source is put into a container and left to settle, and then the water is passed through a cloth folded over itself about 8 times. The best type of cloth to use is cotton. This basic filter is effective against simple organisms and to some extent against cholera. However it is not very effective against giardia or cryptosporidium.

Carbon Filters are more advanced filters that require manufacturing; they are most effective for filtering chlorine and volatile organic compounds.

Advanced filtrations systems that are used all over the world to clean drinking water typically have the following components:

 * A sediment filter to trap particles including rust and calcium carbonate.
 * A second sediment filter with smaller pores is sometimes included.
 * An activated carbon filter to trap organic chemicals and chlorination.
 * A reverse osmosis filter with a thin film composite membrane.
 * A second carbon filter to capture those chemicals not removed by the RO membrane is sometimes used.
 * An ultra-violet lamp can be used for disinfection of the remaining microbes.

The filters range in size and capacity for large industrial installations to supply water for cities, to small portable devices that use gravity to filter water.

How to make:
 * ClayPotFilter : make the lower part of the clay pot with a mix of sawdust and clay... during the baking process, the sawdust will transform into active coal and allow water to pass but retain the bacteria. Only use a limited diameter range of sawdust, not to big-not to dusty. Search for ClayPotFilter for more info
 * CocaColaWaterDisinfector : works with clear, transparent water. Lay the bottle on its side, paint half of the bottle black... the sun will kill micro-organisms, viruses and cycsts in various ways:
 * raise in temperature... it doesn't need to be boiling... boiling is a great visual feedback to know for sure you have reached far beyond survival temperature of micro-organisms, viruses and cysts. It's actually about getting above a minimum kill-off temperature, and how long you stay at a certain temperature above that minimum temperature. In a warm country, on a sunny day... 2 hours will do just fine.
 * a certain wavelength in the UV in the sunlight, will split oxygen molecules in its radicals, making oxygenated water... that way, you burn little holes in the organisms/organic material... it's a way of chemically burning.
 * A certain wavelength in the UV spectrum has the same length as the average bond distance of the molecules in the membrane... it can induce a self-resonance leading to rupture of the membrane, which kills the bacteria
 * Idem to the previous but on the DNA level... the bacteria won't be able to survive. Search for SODIS for more info.

Extraction from Groundwater
Ground water is generally the best quality water available for drinking and irrigation, during the years of natural filtration through the earth the water absorbs minerals which are important for life support, during this process contaminants are generally removed.

The water table is found at different depths in different regions of the earth, this depth also varies over time due to water extraction and the regeneration process that depends on rainfall and natural water storage in lakes and rivers. In areas where the water table is close to the surface small wells can be dug by hand or using machinery if available.

One option that has been used for centuries is the hand power percussion drill. It was first used by the Chinese around 3000 years ago.

If drilling machines are available they can be used to extract water from greater depths.

Water diversion
In many areas around the world rivers and streams are partially or fully diverted for irrigation purposes. This has the advantage of supplying water using gravity. However it is very important to consider the effects of reducing the flow in the river or stream. The flora and fauna may not be able to survive in a dry season without the normal flow; these changes can affect the lives of the people and animals living downstream.

Environmental concerns when dealing with Water
Water absorbs almost everything that it comes into contact with. However, only over long times and through specific processes does water returned to a clean state. When dealing with water it is important to consider that the water you are using is just in one of the phases of its continual cycle. Therefore, by keeping it as clean as possible at every stage of the water cycle, you can be sure that when the water comes back around it will be fit for use.

Useful Links

 * Water for Life Decade -- This website has information about water resources.
 * Hand powered percussion drill

Tecnologías para el Desarrollo Rural/Cómo Utilizar el Agua


text:
User talk:Matt~enwikibooks

Matt? Are you there? I am username222, the guy you told to stop doing the (he, he, he) type articles. are you a regular user or are you part of wikibooks organization? Why are you in chaarge of the whole thing? please reply in my talk. thanx

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 Matt. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Matt~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:28, 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:14, 19 April 2015 (UTC)

title: User talk:Matt~enwikibooks


text:
User:Skankage~enwikibooks

20. Female. Georgia citizen. College Student. Future attorney (hopefully). I guess that's about it. I don't think I did this right.

title: User:Skankage~enwikibooks


text:
Talk:High School Mathematics Extensions/Matrices/Linear Recurrence Relations Revisited

Computing powers quickly
eh, hi. I edited your first example in this section. You say:

or written completely in numeral form

\begin{pmatrix} 4 & -3\\ -2 & 3 \end{pmatrix} \begin{pmatrix} 2 & -1\\ -1 & 1 \end{pmatrix}

=

\begin{pmatrix} 2 & -1\\ -1 & 1 \end{pmatrix}

\begin{pmatrix} 2 & 0\\ 0 & 3 \end{pmatrix} $$

Which is wrong since it is not equal. It should be:

or written completely in numeral form

\begin{pmatrix} 1 & -2\\ 1 & 4 \end{pmatrix} \begin{pmatrix} 2 & -1\\ -1 & 1 \end{pmatrix}

=

\begin{pmatrix} 2 & -1\\ -1 & 1 \end{pmatrix}

\begin{pmatrix} 2 & 0\\ 0 & 3 \end{pmatrix} $$

And from this point, I edited the rest of the example. Good work though. Keep it up :) Dr_Darsh
 * thanks. Xiaodai 14:50, 1 August 2006 (UTC)


text:
Category:Tamarind recipes

Recipes involving tamarind.

title: Category:Tamarind recipes


text:
Category:Jackfruit recipes

Recipes involving jackfruit.

title: Category:Jackfruit recipes


text:
Category:Chayote recipes

Recipes involving chayote.

title: Category:Chayote recipes


text:
Template:Seafood

| Seafood

Usage
This template also takes an optional sort key for the category:

Effect

 * This template uses the ingredient template to specify that the article is about an ingredient
 * It adds " | Seafood" to the navigation field
 * Unless the parameter noincludecat is specified, the article is added to Category:Seafood
 * For example,  will not add the article to any categories

title: Template:Seafood


text:
Category:Sesame recipes

Recipes involving sesame seeds or sesame oil.

title: Category:Sesame recipes


text:
Category:Vodka recipes

Recipes involving vodka.

title: Category:Vodka recipes


text:
Muggles' Guide to Harry Potter/Magic/Thestral

Overview
Thestrals are skeletal creatures about the size of a horse, with a reptilian hide, white eyes, and leathery black wings. They are considered a breed of winged horse.

Extended Description
Thestrals are invisible except to those who have seen death; Harry can see them, but because his friends can't, he is initially afraid that they are a sign that he is going mad. It is Thestrals that pull the (apparently horseless) Hogwarts carriages to and from the train station at the beginning and end of the school year. They are carnivorous, and are attracted to the scent of blood. They are strong flyers and can carry you anywhere you want to go, and they have a good sense of direction. Because of the relationship with death, it is widely believed that seeing a Thestral is a bad omen.

It is not until Hagrid teaches a class on Thestrals that Harry is reassured that these are real creatures and he is not losing his mind. Only four students in Harry's Care of Magical Creatures class can see the thestrals: Harry himself, Neville Longbottom, a "tall, stringy Slytherin" who the author has identified as Theodore Nott and Luna Lovegood. Luna Lovegood (who saw her mother die) can see them as well; but she is in Ravenclaw, and a different year, so she attends a different class. Hagrid is proud of having the largest domesticated herd of Thestrals in the UK.

The ability of Thestrals to fly, and their navigation ability, will prove invaluable to Harry when he, Ron, Hermione, Neville, Ginny, and Luna need to get to the Ministry of Magic. We will see them again briefly in Harry Potter and the Deathly Hallows.

Analysis
One of the things we are beginning to perceive, by the time that Thestrals are introduced, is that Wizards in general are every bit as afraid of death as Muggles are. This is somewhat perplexing, as Wizardkind can create and perceive Ghosts, where Muggles cannot, and one would think that ghosts prove the existence of life after death. (For purposes of these discussions, we will ignore the matter of Shades and Horcruxes, as those are extremely rare in the Magical world, so the average Wizard will not have seen them.) In Harry Potter and the Prisoner of Azkaban, we are told that there is an entire book written about Death Omens, and from Ron we learn how seriously the Wizarding world takes them. The association with death that is caused by the Thestrals' selective visibility makes them undeservedly one such omen.

The author has commented that her mothers' death, midway through writing the series, may have caused something of an additional preoccupation with that transition in the books. However, the main story line, involving Horcruxes as a means of cheating death, and the Deathly Hallows, perforce will involve itself with death.

Questions

 * 1) Neville's parents have not died, they are alive still, if insane. Who did Neville see die?
 * 2) Hagrid must also be able to see them, but he didn't see his father die: Hagrid told Harry that his father had died during Hagrid's first year. Who would he have seen die?
 * 3) Generally, what do those who devote their lives to Magical Beast research when they cannot see Thestrals (yet)?
 * 4) How come the Thestrals drawing the carriages at the end of Harry Potter and the Goblet of Fire were still invisible to Harry? Does it take some time for the fact that you've seen a death to set in before you can see them? For that matter, why does he not see them from the very first story, as presumably he had seen his mother die?
 * 5) Are Thestrals dark creatures?

Greater Picture
The question has come up that Harry should have been able to see the Thestrals when he rode the horseless carriages down to the train at the end of Harry Potter and the Goblet of Fire; after all, he had just seen Cedric Diggory killed. There are actually two answers to why he could not, one in the context of the books, one in the context of the author's plans.

In the context of the books, then, while Harry has seen Cedric Diggory die, at that point he is still in shock and has not yet completely internalized it; Cedric's death is not entirely real to him, and it is only after he has been brooding over it all summer that he accepts that Cedric is dead. Only then, when he fully believes that he has seen death, is he able to see the Thestrals. Did he not see death earlier, when Lord Voldemort killed his parents? No, in fact he did not; he was not fully aware of it, being only a baby, and it happened beyond the sides of his cot so he could not see it. While it could be argued that Voldemort would have to see him in order to kill him, and the spell rebound killing Voldemort would have been visible to Harry at the time, Voldemort is not really dead, is he? Did he not see Professor Quirrell die at the end of Harry Potter and the Philosopher's Stone? No, he didn't; he had lost consciousness by the time Quirrell actually died.

The author has stated that she also had the idea that having the Thestrals visible to Harry just before the end of the book would have left another puzzle for the readers, a very uncomfortable one in fact: what are these creatures, are they Dark? So she made the conscious decision to leave them invisible to Harry until the next book.

The above is a paraphrase of the author's own comments on the matter.

It would, of course, also be possible that Harry did see the Thestrals at the end of Harry Potter and the Goblet of Fire, only failed to take notice of them having other thoughts on his mind, and consequently the reader is also not told about them. We strongly doubt this, however, as Harry would have had to remain completely withdrawn from the world throughout the entire process of getting to the train station from Hogwarts, and the "horseless carriages" are specifically mentioned as arriving at Hogwarts as students of the three schools are preparing to depart for the summer.

The author has also stated that the magical core of the Elder Wand is a tail hair from a Thestral, "a powerful and tricky substance that can be mastered only by a witch or wizard capable of facing death."


text:
Visual Basic .NET/Assignation and comparison operators

Assignment
The "=" operator is used for assignment. The operator also serves as a comparison operator (see Comparison).

 * To set values:

You can use variables in the equal operator, as well.

Comparison
The "=" operator is used for comparison. The operator also serves as a assignation operator (see Assignment).

 * To compare values:

You can use variables in the equal operator, as well.

Let's try a slightly more advanced operation.

You will get an error if you try to assign a constant or a literal a value, such as 7 = 2. You can compare 7 and 2, but the answer will always be False.

In the case of two equal operators appearing in a statement, such as

The second equal operator will be processed first, comparing 2 and 7, giving a False. Then the first equal operator will be processed, assigning False to x.

More Comparison Operators
(x less than y), (x more than y), (x not equal to y), (x less than or equal y) & (x greater than or equal to y)

Note the way round the operators are on the last two, putting them the other way round is not valid.

Visual Basic .NET/Assignation et comparaison


text:
Visual Basic .NET/Arithmetic operators

Arithmetic operators
Visual Basic .NET provides a basic set of operators to calculate simple arithmetic.

Let's look at a short example of arithmetic operations before we jump into the operators themselves.

In this example we will also be using some basic variables. The Dim operator creates the variable. First, we set the total sales to 3142.51.

The * operator calculates multiplication, so the last line is equivalent to $$Commission = 0.3 * Sales$$. This means that our second step is multiplying 0.3 and Sales. Sales is 3142.51, so our result should be the product of 0.3 and 3142.51.

Why the funny symbols?
With the exception of addition and subtraction, the symbols used are different to the ones used in real life. This is simply because the other symbols are not available on a standard keyboard.

A good reference for the operators in Visual Basic .NET is Windows's built-in Calculator. If you set Calculator on scientific mode, you have access to the same operators as in .NET.

Addition
This adds two numbers together, and is denoted by the "+" symbol. If strings are involved it may also do String concatenation. Examples:

By using funny symbol it will become easy to parse during execution. mostly that is the reason why they have used.

There is a second addition operator, "+=". It increments the variable on the left of the += by the amount indicated on the right.

It also works with Strings as a concatenation operator.

Subtraction
This subtracts two numbers, and is denoted by the "-" symbol. Examples:

Beware when subtracting an integer from a double. The above code, when printed, will result in an answer of .04499999999999999 instead of the obvious answer of .045. Using doubles to store decimal values can be highly inaccurate.

Multiplication
This multiplies two numbers, and is denoted by the "*" symbol. Examples:

Division
There are more types of division than the one denoted by the "/" symbol. There is also integer division and remainder division.
 * Division
 * This is the most commonly used form of division and is denoted by the "/" operator. Examples:

 * Integer division
 * This divides two numbers, and gives the result without the remainder if the quotient is a decimal. Examples:

 * Remainder Division
 * This divides two numbers, and gives the result's remainder if the quotient is a decimal. This is denoted by the operator " Mod ." Examples:

Exponentiation
This is raising a number to a power. For example $$7^2$$ in VB .Net code is:

This results in the number 49 being assigned to the variable x. It can also be used to calculate the square root of a number. The square root of a number is the number raised to the power of 0.5.

Note: It is necessary to ensure that the variables be correctly declared to get the desired results. The following example works, but will produce the wrong result. This is because the Integer class does not allow decimal places (just like mathematical integers).

Since x is declared as an Integer type, the value square root, a real number, is stored incorrectly.

Any nth root of number is the can be calculated by raising the number to the power of $$1/n$$:

This is because $$x ^ \frac{1}{n} = \sqrt[n]{x}$$.

Rounding

 * : round to the nearest integer.
 * : round to inferior.
 * : round to superior.
 * : truncate the decimal digits.

Comparisons

Visual Basic .NET/Arithmétique

title: Visual Basic .NET/Arithmetic operators


text:
Visual Basic .NET/String and character operators

String concatenation
The "&" operator joins two strings together. Example:

This will result in String3 being equal to "123456"

The "+" operator may be used in place of "&". However, it is not recommended.

Concat
You may concatenate a number of strings:

If you have defined a string array, such as:

then all the elements of this array may be concatenated in a simple way:

String manipulations functions

 * Lcase: converts in higher case.
 * Ucase: converts in lower case.

To create some substrings, the VB6 functions are still available:
 * Left: left part.
 * Right: right part.
 * Mid: middle part.
 * InStr: substring location into a string.
 * Replace: replace a substring by another one.

Visual Basic .NET/Chaines de caractères


text:
Category:Taro recipes

Recipes involving taro root.

title: Category:Taro recipes


text:
Muggles' Guide to Harry Potter/Magic/Remembrall

Overview
A Remembrall is a glass sphere filled with white smoke. If you hold the ball in your hand, the smoke will turn red to indicate you have forgotten something. The name is apparently a portmanteau of "remember", "all", and "ball".

Extended Description
Neville is sent a Remembrall by his grandmother in his second week at Hogwarts, and it immediately turns red when he holds it, to tell him that he has forgotten something. However, it cannot tell him what he has forgotten.

Analysis
As written, the Remembrall, while neat, is not particularly useful; everyone has always forgotten something, so the Remembrall would always indicate that something had been forgotten. Perhaps the shade of red would indicate how important the forgotten item is?

The main purpose of the Remembrall is to give Draco Malfoy something that he can steal, to show off his character, and to make it necessary for Harry to fly to recover it. Forcing Harry onto a broom, in a situation where he can show off his natural talent unfettered by organized lessons, is necessary to allow us to share Harry's joy at finding something he is good at in the Wizarding world.

After the byplay on the brooms, Neville's Remembrall plays no further significant part on the story, and no others are mentioned.

Questions

 * 1) How could a Remembrall be made more useful?


text:
Visual Basic .NET/Logical operators

Not
The Not operator returns True when the condition is False. Otherwise, it returns False. Example,

And
The And operator returns True when the conditions of the left and right are True. Otherwise, it returns False. Both conditions are evaluated before the result is returned. Example,

AndAlso
The AndAlso operator returns False when the condition on the left hand side is False. Else, it returns True when the conditions of the left and right are True. Otherwise, it returns False. The condition on the right hand side is never evaluated when that on the left hand side is False. This is called short-circuited logic.

Or
The Or operator returns True when the condition on either side is True. Otherwise, it returns False. Both conditions are evaluated before the result is returned.

OrElse
The OrElse operator returns True when the condition on the left hand side is True. Else, if the condition on the right hand side is True, it returns True. Otherwise, it returns False. The condition on the right hand side is never evaluated when that on the left hand side is True. This is called short-circuited logic.

Xor
The Xor operator returns True when the condition on the left hand side or right hand side is True, but not when both are True. Xor means "Exclusive OR ".

Visual Basic .NET/Logique

title: Visual Basic .NET/Logical operators


text:
Muggles' Guide to Harry Potter/Magic/Nox

Overview
Nox is the counter-spell to Lumos; it darkens a lit wand.

Extended Description
The Nox spell is used by Harry and Hermione in Harry Potter and the Prisoner of Azkaban, and in the depths of Gringotts in Harry Potter and the Deathly Hallows, to extinguish their wands, previously illuminated by means of the Lumos charm, when they no longer needed their light.

Analysis
An extinguishing spell is, in retrospect, necessary; otherwise, you have the equally ludicrous cases of a wand that, once illuminated, never goes out, or of a wand that, once lit, goes out eventually of its own accord, likely at the worst possible moment. It is surprising, perhaps, that we see the extinguishing charm used so very infrequently, given the number of times that wandlight is invoked. However, looking at the behavior of magic in the stories, this is something of a pattern; time-limited spells, such as the effects of Polyjuice Potion only wear off inconveniently when such is necessary to the story line, and otherwise remain in force as long as necessary for the action, but no longer.


text:
GCSE Science/Hormones

The menstrual cycle
The menstrual cycle is a cycle of events that occurs in the womb (uterus) and ovaries of female mammals. It is associated with the production of eggs and preparing the uterus for the implantation of fertilised eggs.

The menstrual cycle occurs over a period of about 28 days. The changes during the cycle are due to four hormones, progesterone, oestrogen, FSH (follicle stimulating hormone) and LH (luteinising hormone). Progesterone and oestrogen have wide ranging effects on the body but in the context of the menstrual cycle progesterone is mainly involved in maintaining the lining of the uterus and oestrogen is mainly concerned with building up the lining of the uterus. FSH stimulates the production of eggs and LH stimulates the release of the egg. FSH and LH are produced by the pituitary gland in the brain.

There are four stages in the menstrual cycle.

Stage 1. Days 1-4. Menstruation (bleeding) occurs. The lining of the uterus disintegrates and is shed. This is due to low levels of progesterone.

Stage 2. Days 4-14. The uterine lining grows back. This is due to high levels of oestrogen.

Stage 3. Day 14. The egg (called an ovum) is released. This is due to LH.

Stage 4. Days 14-28. The lining of the uterus is maintained in case the egg becomes fertilised and implanted in the uterus. Maintenance of the lining is due to high levels of progesterone.

The four hormones interact with each other. FSH causes Oestrogen release and oestrogen inhibits FSH. LH stimulates both oestrogen and progesterone production. Before ovulation LH release is stimulated by oestrogen but after ovulation it is inhibited by both oestrogen and progesterone.

In summary, the hormones have the following effects:

 * Oestrogen: causes growth of the uterine lining. Inhibits FSH. Stimulates release of LH and hence release of the egg. Inhibits LH after ovulation.

 * Progesterone: maintains the uterine lining. Inhibits LH after ovulation.

 * LH: Stimulates the release of the egg (called ovulation). Stimulates oestrogen and progesterone production.

 * FSH: Stimulates egg development and the release of oestrogen.

Birth control tablets contain high levels of progesterone and oestrogen. The oestrogen inhibits FSH production so that eggs cease to develop.

FSH is used to treat infertility because it stimulates the production of eggs.

Learning the menstrual cycle
The menstrual cycle is easy to learn. The best approach is probably to break it down into parts.

More advanced topics
This section deals with topics that are outside the GCSE syllabus.

At a more advanced level the menstrual cycle is divided into phases as shown in the diagram.

title: GCSE Science/Hormones


text:
Category:Wheat recipes

Recipes involving some form of wheat.

ko:분류:밀 요리

title: Category:Wheat recipes


text: Wikibooks:Book of the month/August 2006

title: Wikibooks:Book of the month/August 2006


text:
Guide to Unix/BSD/FreeBSD

Background
FreeBSD is a Unix-like free operating system descended from AT&T UNIX via the Berkeley Software Distribution (BSD) branch through the 386BSD and 4.4BSD operating systems. It runs on processors compatible with the Intel x86 family, as well as on the DEC Alpha, the UltraSPARC processors by Sun Microsystems, the Itanium (IA-64), AMD64 and PowerPC processors. It also runs on the PC-98 architecture. Support for the ARM and MIPS architectures is currently in development.

FreeBSD is developed as a complete operating system. The kernel, device drivers and all of the userland utilities, such as the shell, are held in the same source code revision tracking tree (CVS). This is in contrast to Linux, a similar but better-known operating system, in which the kernel is developed by one set of developers; userland utilities and applications by others, such as the GNU project; and all are packaged together by other groups and published as Linux distributions.

As an operating system, FreeBSD is generally regarded as quite reliable and robust, and of the operating systems that accurately report uptime remotely [1], FreeBSD is the most common free operating system listed in Netcraft's list [2] of the 50 web servers with the longest uptime (uptime on some operating systems such as some versions of Linux can't be calculated). A long uptime also indicates that no kernel updates have been deemed necessary, as installing a new kernel requires a reboot and resets the uptime counter of the system.

History and development
Initial development of FreeBSD started in 1993, taking its sources from 386BSD. However, due to concerns about the legality of all the sources used in 386BSD and a consequent lawsuit between Novell (then owner of the UNIX trademark) and Berkeley, FreeBSD ended up re-engineering much of the system with the FreeBSD 2.0 release in January of 1995 using the 4.4BSD-Lite release from the University of California, Berkeley. The FreeBSD Handbook includes more historical information about the genesis of FreeBSD.

Perhaps FreeBSD 2.0's most notable advance was the revamp of the original CMU's Mach Virtual Memory system, which was optimized for performance under high loads, and the creation of the ports system that made downloading, building and installing third party software very easy. FreeBSD powered extremely successful sites like cdrom.com (a huge repository of software that broke several throughput records on the net), Hotmail, and Yahoo!.

FreeBSD 3.0 brought many changes: it switched to the ELF binary format, initial support for SMP systems and also added support for a new 64 bit platform: the Alpha. At its time the 3.X branch was severely criticized as many changes were not evidently beneficial and affected performance, but it was a necessary step to develop what would become the very successful 4.X branch.

Initially, FreeBSD employed the BSD Daemon as its logo, but in 2005 a competition for a new logo was arranged. On October 8, 2005, the competition finished and the design by Anton K. Gural was chosen as the new FreeBSD logo. The BSD Daemon will remain as the FreeBSD Project mascot. [edit]

FreeBSD 5 development and changes
The latest and final FreeBSD release from the 5-STABLE branch is 5.5, and was released in May 2006. FreeBSD developers maintain (at least) two branches of simultaneous development. A -STABLE branch of FreeBSD is created for each major version number, from which releases are cut about once every 4-6 months. The latest 4-STABLE release of FreeBSD is 4.11, which is the last of the 4-STABLE branch releases. The first 5-STABLE release was 5.3 (5.0 through 5.2.1 were cut from -CURRENT). The first 6-STABLE release was 6.0. The development branch, -CURRENT, is now 7.0-CURRENT, which contains aggressive new kernel and userspace features. If a feature is sufficiently stable and mature, it is eventually backported ("MFC" - Merge from CURRENT in the FreeBSD developer slang) to the -STABLE branch. FreeBSD's development model is described in an in-depth article by Niklas Saers [3].

The big difference in FreeBSD 5 was a major change in the low-level kernel locking mechanisms to enable better symmetric multiprocessor (SMP) support, releasing much of the kernel from the MP lock, sometimes referred to as the Big Giant Lock. It is now possible for more than one process to execute in kernel mode at the same time.

Other major changes include an m:n threading solution called KSE which is now the default threading (pthreads) library, starting with 5.3 (the creation of the 5-STABLE branch). The terminology m:n, where m and n are small positive integers, implies that m userland threads correspond to n kernel threads. Many other new features are security related. The TrustedBSD project was formed by Robert Watson for the express purpose of adding trusted operating system functionality to the FreeBSD operating system. An extensible mandatory access control framework (the TrustedBSD MAC Framework), filesystem Access Control Lists (ACLs), and the new UFS2 filesystem all came from TrustedBSD. Some of the TrustedBSD functionality has been integrated into the NetBSD and OpenBSD operating systems as well.

FreeBSD 5 has also significantly changed the block I/O layer with the introduction of the GEOM modular disk I/O request transformation framework, contributed by Poul-Henning Kamp. GEOM enables the simple creation of many kinds of functionality, such as mirroring (gmirror) and encryption (gbde). The recent release of FreeBSD 5.4 has confirmed the FreeBSD 5.x branch as a highly stable and well-performing release, albeit one with a long gestation period due to the large feature set.

FreeBSD 6 and 7
FreeBSD 6.1 was released on May 8, 2006, and 7.0-CURRENT is under active development. These versions continue the work on SMP and threading optimization, as well as additional work in the area of advanced 802.11 functionality, and TrustedBSD security event auditing. The primary release accomplishments of this release include the removal of the Giant lock from VFS, replacement of the libthr library with a better performing implementation of 1:1 threading, and the addition of a BSM audit implementation, called OpenBSM, created by the TrustedBSD Project which is heavily based upon the BSM implementation found in Apple's Open Source Darwin which has been released under a BSD-style license.

Linux compatibility
FreeBSD provides binary compatibility with several other Unix-like operating systems, including Linux. The reasoning behind this is generally attributed to being able to run applications developed for Linux, often commercial, that are only distributed in binary form and thus cannot be ported to FreeBSD without the will of those who control the source code.

In a nutshell, it allows FreeBSD users to run a majority of the applications that are only distributed as Linux binaries. When compared to the vast number of native applications available for FreeBSD using the Ports Collection, these applications are in the minority. Applications used under the Linux compatibility layer include StarOffice, the Linux version of Netscape, Adobe Acrobat, RealPlayer, VMware, Oracle, WordPerfect, Skype, Doom 3, Quake 4, the Unreal Tournament series, SeaMonkey, and so on. Generally, there seems to be no noticeable performance penalty when running Linux binaries as opposed to native FreeBSD ones.

Though there are many applications that run flawlessly under the compatibility layer, it should be noted that the layer is not complete, thus rendering some Linux binaries unusable on FreeBSD or limiting their functionality, possibly because this compatibility layer only supports the system calls of Linux Kernel 2.4.2, a historic release. One example of this is Cedega, TransGaming's product to run Microsoft Windows games on Linux. Its usage is largely crippled at this time due to an incomplete compatibility layer. There has, however, been limited success in using it to run games on FreeBSD [4]. A 2006 Summer of Code project to update the compatibility layer and implement missing system calls has been accepted [5].

For most scientific applications, the Linux compatibility layer performs correctly; applications such as nmrpipe, ccp, Mathematica and Matlab perform as expected.

License
As with its sister operating systems, the code in FreeBSD is released under the terms of a variety of licenses. All of the kernel code and most newly created code is released under the terms of the two-clause BSD license, which allows everyone to use and redistribute FreeBSD as they wish. There are also parts under the GPL, LGPL, ISC, three-clause BSD license, and four-clause BSD license.

Also available are binary blobs for particular functionality, such as the Atheros HAL for wireless functionality and a binary only tool for Adaptec's AAC RAID.

Derivatives
A range of products are directly or indirectly based on FreeBSD. These range from embedded devices, such as Juniper routers and Nokia's firewall operating system, to portions of other operating systems including Linux and the RTOS VxWorks. Darwin, the core of Apple's Mac OS X, borrows heavily from FreeBSD, including its virtual file system, network stack and components of its userspace. Apple continues to integrate new code from and contribute changes back to FreeBSD. The open source OpenDarwin, originally derived from Apple's codebase but now a separate entity, also includes substantial FreeBSD code. In addition, there are a number of operating systems originally forked from or based on FreeBSD including PC-BSD and DesktopBSD, which include enhancements aimed at home users and workstations; the FreeSBIE and Frenzy live CD distributions; the m0n0wall and pfSense embedded firewalls; and DragonFly BSD, a notable fork from FreeBSD 4.8 aiming for a different multiprocessor synchronization strategy than that chosen for FreeBSD 5 and development of some microkernel features.

title: Guide to Unix/BSD/FreeBSD


text: Wikibooks:Collaboration of the Month/August 2006


text:
Talk:Chinese (Mandarin)/Lesson 1/Stroke Order

Untitled
I was going over the lesson and I noticed an inconsistency between the characters displayed for numbered words in the lesson's list and the number given for those characters on the stroke order page. This seems to start with number 10 on the stroke order page.

Jay

I think it would be helpfull if this page had the readings of every character. As a user of this wiki book I find it annoying to have to go back and look at the lesson to find out what each character is.Ulfrinn 22:28, 7 August 2006 (utc)

It would be very helpful if the seemingly random numbers on the left were replaced with the pingyin for each character. Jacob GNAA

I am using the Wikibook and find the Stroke Order section very useful. But there is a problem, the stroke order figures do not correspond to the numbered Vocabulary list in the Wikibook anymore, starting at number 11. After detailed analyisis of the symbols and the stroke order table, I realized the character for Word #11 (to be named) is missing from the table, and is instead replaced by characters called (in the stroke order table) 11a and 11b, which are actually the characters for the 12th Word in the vocabulary list. I will correct this and try to get the numbers in the Stroke Order table to match the ones in the vocabulary list again. Reverse if I'm wrong and please explain me why. Edit: I will also correct the numbers 1a and 1b, since they're actually 1 and 1f (the second one is the character for singular femenine "you"), and add a brief explanation on top explaining what the letters in the numbered column mean, so as to make this table clearer for future readers (it took my a while to figure it out, although it is quite obvious). Edit 2: I have fixed it and finally, the Stroke Order Table and the Vocabulary list match perfectly once again. It seems the character for Word #11 had been inserted as #10 in the table. This was causing all the following ranks in the table to shift and not to match the list. This is fixed, I hope it makes things clearer for new readers. To everyone who is doing the images and stroke orders, thanks a lot and keep up the great work! David Haas

Edit 3: Once again there is something I want to correct in the table, but this time I need the support of someone who is fluent in Chinese (since I'm just a beginner). My doubt is about the "1" and "1f" characters in the table. After reading Lesson 1 of the Wikibook again, I got the impression that this differentiation between genders is made only in Traditional Chinese (since it is indicated in parentheses in the WikiBook). Would someone please clear this for me, so that I know whether the second character should be referenced to as "1f" or, more correctly, "1tf"? Thanks again! David Haas

Description to signs.
Maybe some could write also the pinyin and meaning next to each sign. W


text:
User:Hjnie

Hans-Joachim Niemann

 * Dr. rer.nat., Scientist (physical chemistry) and philosophical freelance writer (critical rationalist).
 * Research and development on the field of laser spectroscopy and laser isotope separation with a subsidiary company of Siemens AG.
 * Lecturer in critical rationalism at University of Bamberg (1993-1999). Evening lectures, guest lecture (University Passau 1994), and courses about critical rationalism.
 * Co-founder of the Fränkischen Gesellschaft für Philosophie (Philosophical Society of Franconia), co-founder of the Gesellschaft für Kritik und Aufklärung in Nuremberg and co-founder of the philosophical journal Aufklärung und Kritik (Enlightenment and Criticism).
 * Translator of Popper's books Realism and the Aim of Science and Quantum Theory and the Schism in Physics into German. English: Routledge; German: Tübingen, Mohr Siebeck.
 * Author of the German books Die Strategie der Vernunft (The Strategy of Reason), Braunschweig, Vieweg 1993; and Lexikon des Kritischen Rationalismus (Encyclopedia of Critical Rationalism), Tübingen, Mohr Siebeck 2004. Up to 2006 some 85 publications in the fields of science and philosophy.

Web&Wiki Activities

 * New PS-WIKIs: problem solving wikis, developing ps-rules for solving political, social, and moral problems by world wide teamwork
 * WebSites about Critical Rationalism
 * Founder of the German/English/French WebSite of Hans Albert
 * Initiator of the German Wikibook Studienführer Hans Albert (Study Guide Hans Albert, to be translated into English)
 * Initiator of the German Wikibook 'Sei doch vernünftig!' ("Talk Sense!" - An introduction into critical-rational thinking and decision-making)
 * Originator of some Wikipedia entries; see e.g. Hans Albert and Munchhausen-Trilemma.

If it is important and I don't answer your edit talk or discussion contribution: please send an email to Hans-Joachim dot Niemann at t-online dot de

title: User:Hjnie


text:
Talk:Human Physiology/Homeostasis

Homeostasis may seem uninteresting, but it is the basis of all physiology. I am an anesthesia resident and the concepts of negative and positive feedback loops play into every medication and action I take during an operation. These concepts are the building blocks for everything else you will learn in your class. I think you've done a good job updating the chapter, keep it up for the others.

Goals for this chapter

 * Introduce physiology as a science and its relevance to those going into the medical profession
 * Introduce homeostasis and explain why it is an appropriate framework for the study of physiology
 * Provide several good examples of homeostasis
 * Provide illustrations that help understand homeostasis, control mechanisms, etc
 * Show how all body systems tie together and introduce subsequent chapters of the book

Provophys 14:19, 31 July 2006 (UTC)

Additional Information
I have found an old page from a dead book, that contains a large amount of information about homeostasis:

 * Physiology: Homeostasis

You are welcome to "harvest" any useful information from this orphaned page for your use here. Feel free to copy information, tables, or whatever if you need them. If this page is completely useless, let me know and I will delete it. --Whiteknight (talk) (projects) 22:36, 1 August 2006 (UTC)

Brent's Comments
I was doing some research on osteoporosis and cancer and found that apoptosis is suspected of playing a role in both of these disorders. I wrote a brief section on apoptosis in the development chapter, but it may be more appropriate for your chapter. I saw that it is in your further research section, but maybe it is important enough to warrant its own section in your chapter.Brentwaldrop 19:58, 7 August 2006 (UTC)

Principles to keep in mind
Some basic components of a system that tries to maintain a constant level: 1) some sort of sensor to detect changes in the variable of interest. So our body has baroreceptors to measure blood pressure, ways to measure glucose levels in the blood, oxygen & CO2 levels in the blood, body temperature, levels of various ions, etc. Your body cannot regulate something that it cannot detect and measure in some way. 2) a mechanism for changing the variable--if the body is too hot then there must be a mechanism for cooling it down; if blood pressure is low, then there is a mechanism to increase it. The control mechanisms are under nervous and/or endocrine control. When a change is made to offset any imbalance, that change must then be registered by the sensor. Otherwise it is possible to overcorrect.Provophys 21:26, 28 August 2006 (UTC)

Homeostasis throughout the body
That section still needs work. I fixed several spelling errors (there are more) and I removed broken links and added links to our chapters. However, the content still needs work too. This needs to be textbook quality, with a brief description of homeostatic mechanisms within each body system, emphasizing physiological parameters that systems work within, what control mechanisms exist to correct for deviances, and how multiple systems work together to maintain homeostasis of the whole body. We need to remove any first-person tenses (after all, there isn't a single author). We need to make sure that any statements made are in fact sound physiological principles and not just popular opinion. Provophys 17:31, 20 September 2006 (UTC)

2007 Revisions
This chapter was changed dramatically from time to time during the 2006 class, not always for the better. I deleted several sections that were more related to alternative views on health than homeostasis. This chapter needs to be thoroughly revised to serve as the foundation for the rest of the book. Provophys 18:01, 7 February 2007 (UTC)
 * The section "Pathways that alter homeostasis" worries me a bit. Some of those are rather vague statements. The lifestyle advice may be valid, but the connection to homeostasis is not well established for several of the statements. Provophys 04:10, 22 February 2007 (UTC)
 * Homeostasis throughout the body still needs to be revised. What should be in the section is a brief example of how each body system contributes to the well-being of the entire body; what should NOT be there is a description of lifestyle practices that will help maintain health of that system. Herbal medicines may indeed have an effect on the endocrine system, but that tells us nothing about what the endocrine system actually does and certainly nothing about how it is involved in homeostasis! Provophys 17:39, 2 March 2007 (UTC)

Degrees Fahrenheit?
I was browsing this book and was surprised to see an example using a non-international unit of temperature at the very beginning of the text, in Home Heating System Vs. Negative Feedback: Let's say today you set it at 70 degrees. (...) far below the 70 degree set point (...) Readers of wikibooks.org, especially of its English version, are obviously not restricted to the USA, which is the only country using such a non-standard unit (the international system of units has been officially adopted everywhere except in Burma (Myanmar), Liberia, and the United States). I suggest at least writing 70oF explicitly, at best giving an example in oC. Otherwise non-US readers will initially feel, like me, that the thermostat was set to an absurdly hot temperature: almost twice the natural body's heat! --Hornord (talk) 06:34, 23 September 2009 (UTC)

Blood pressure info under "Body Composition"
That seems out of place, not even a subsection of what it is under. --AVRS (discuss • contribs) 17:04, 10 April 2014 (UTC)

homeostasis
I think that the term homeostasis comes from homeo which significates human and not same, because homo is same not homeo

title: Talk:Human Physiology/Homeostasis


text:
Engineering Tables

This collection is a shared appendix with tables for use in books on engineering, math and science. It is used by various other books on the site. These pages should not be used "as is", but should be transcluded into other pages. Subpages should contain tables or shared resources, and do not require navigational or aesthetic improvements.

Integral Transforms

 * /Laplace Transform Table/
 * /Laplace Transform Table 2/
 * /Laplace Transform Properties/
 * /Fourier Transform Table/
 * /Fourier Transform Table 2/
 * /Fourier Transform Properties/
 * /DTFT Transform Table/
 * /DTFT Transform Properties/
 * /DFT Transform Table/
 * /DFT Transform Properties/
 * /Z Transform Table/
 * /Z Transform Properties/
 * /Star Transform Table/
 * /Star Transform Properties/
 * /Hilbert Transform Table/

Mathematical Tables

 * /Properties of Integrals/
 * /Table of Integrals/
 * /Properties of Derivatives/
 * /Table of Derivatives/
 * Table of Infinite Sums
 * /Trigonometric Identities/
 * Vector Operations

Statistical Tables

 * /Normal Distribution/
 * /Student's T-Distribution/
 * /Chi-Squared Distribution/
 * /F Distibution/

Mechanical Engineering

 * /Metric Threads/
 * International Tolerance (IT) grades

Electrical and Electronic Engineering

 * /Electronic colour codes/
 * /Device pinouts/
 * /Standard Wire Gauge/
 * /American Wire Gauge/
 * /Linear op-amp configurations/ (for future use in Electronics Handbook/Circuits/Operational Amplifier Configurations, Electronics/Op-Amps/Linear Configurations, etc.)
 * /Non-linear op-amp configurations/ (for future use in Electronics Handbook/Circuits/Operational Amplifier Configurations, Electronics/Op-Amps/Non Linear Configurations, etc.)

Computer Engineering

 * /ASCII Table - Control Characters/
 * /ASCII Table - Printable Characters/
 * /ASCII Table - Extended ASCII Characters/

Books That Use These Tables
This is a listing of books that make use of one or more of the resources here. Do not edit/remove the resources here without first checking for dependencies in the books below.

 * Circuit Theory
 * Control Systems
 * Digital Signal Processing
 * Engineering Analysis
 * Signals and Systems
 * Waves

title: Engineering Tables


text: Engineering Tables/Fourier Transform Table


text: Engineering Tables/Laplace Transform Table


text: Engineering Tables/Trigonometric Identities


text:
Engineering Tables/Z Transform Table

Here:
 * $$u[n]=1$$ for $$n>=0$$, $$u[n]=0$$ for $$n<0$$
 * $$\delta[n] = 1 $$ for $$n=0$$, $$\delta[n] = 0 $$ otherwise

title: Engineering Tables/Z Transform Table


text:
Engineering Tables/Z Transform Properties

 * Initial value theorem
 * $$x[0]=\lim_{z\rightarrow \infty}X(z) \ $$, If $$x[n]\,$$ causal

 * Final value theorem
 * $$x[\infty]=\lim_{z\rightarrow 1}(z-1)X(z) \ $$, Only if poles of $$(z-1)X(z) \ $$	 are inside unit circle


text:
User:Josen~enwikibooks/DiceFree/Skill Uses

=Skill Uses= Each skill has a variety of uses, and they will be explained here. Note that all the uses mentioned are not exact, and some have more uses. All you have to do is think of them.

Health
This is your HP. Health. As you take damage, your Health gets lower. The lower this stat is, the worse the condition of a PC is. At 0, that PC is dead.


text:
Ophthalmology

Contents

 * 1) /Introduction/
 * 2) /Professional Requirements/
 * 3) /Anatomy of the Eye/
 * 4) /Eye Examination/
 * 5) /Diseases of Conjunctiva/
 * 6) /Diseases of Cornea/
 * 7) /Diseases of Sclera/
 * 8) /Diseases of Uveal Tract/
 * 9) /Diseases of Lens/
 * 10) /Glaucoma/
 * 11) /Diseases of Vitreous/
 * 12) /Diseases of Retina/
 * 13) /Neuro-Ophthalmology/
 * 14) /Strabismus and Nystagmus/
 * 15) /Diseases of Eyelids/
 * 16) /Diseases of Lacrimal Apparatus/
 * 17) /Diseases of Orbit/
 * 18) /Ocular Injuries/
 * 19) /Systemic Ophthalmology/
 * 20) /Community Ophthalmology/
 * 21) /Eye Surgery/

Useful External Links

 * EyeMDLink.com - Cataract Surgery
 * EyeWiki of the American Academy of Ophthalmology
 * eMedicine.com - Glaucoma, Complications and Management of Glaucoma Filtering
 * American Board of Eye Surgeons
 * American Academy of Ophthalmology
 * American Society of Cataract & Refractive Surgery
 * European Society of Cataract & Refractive Surgery
 * Royal College of Ophthalmologists
 * American Board of Eye Surgeons
 * American Board of Ophthalmology
 * Indian Journal of Ophthalmology
 * All India Ophthalmological Society
 * Delhi Ophthalmological Society
 * Royal College of Surgeons in Edinburgh

title: Ophthalmology


text:
Computational Chemistry/Semiempirical quantum chemistry

 Previous chapter -  ../Molecular quantum mechanics/

Semi-empirical Philosophies
There is a difference in philosophy between the Pople and Dewar schools. Dewar's parameterisation aims to absorb all the missing parts of the model where SCF is inadequate, (Correlation, relativity, algebraic approximation), into the semi-empirical parameters, whereas Pople's initial idea was to produce cheap practical equivalents of minimal Slater orbital basis SCF calculations which would have all the mathematical niceties and limits of Hartree-Fock theory. In recent times Dewar's ideas and programs have prevailed because computing power has increased to make the real SCF wavefunction routinely computable for all but the largest molecules so MOPAC style programs are used for the largest molecules where Hartree-Fock is still uncomputable.

Programs for linear scaling SCF, where small approximations are made to make the effort scale linearly with the size of the molecule rather than scaling to the power of 4 dictated by the integrals evaluation, are hoping to make uncomputable Hartree-Fock problems a thing of the past.

A Brief Technical Description of Semi-Empirical Methods
The ZDO approximation, (Zero Differential Overlap). The first approximation is core-valence separation. The core electron MOs are independent of molecular environment and can be parameterised out. This is a good approximation, the all valence approximation - effective nuclear charges (Za) adjust for the missing inner electrons.

Basis functions belong to individual atoms in semi-empirical methods. In all methods For NDDO, (the most complete approximation i.e. nearest the full Hartree-Fock solution) i.e. all 3 and 4 centre integrals disappear. In CNDO the least complete method the Kroneka deltas are so only integrals like survive. In INDO 1-centre exchange integrals are added to the CNDO set

Remember 2J - K in Hartree-Fock theory.

The Invariance Problem
To insure the values of calculated properties do not change with rotated orientations of the molecule:

(sAsA|pxBpxB) =  (sAsA|pyBpyB)

and

(sAsA|pxBpxB) =  (sAsA|sBsB)

This is a considerable approximation.

 Next Chapter -  ../Geometry optimization/


text:
Talk:Computational Chemistry

I am not sure whether this book is needed because of all the material on Wikipedia.

Some unique need and angle might develop........

I think it is alright but it might need bits to move between here and wikipedia in both directions.

title: Talk:Computational Chemistry


text:
Template:Hayeren

 /Templates

title: Template:Hayeren


text:
Reconstruction/Reconstruction/Insulation

The process by which Thermal Insulation is installed.

Materials

 * Fiberglass Insulation
 * Vapor Barrier
 * Staples

Note: R-13 recommended for exterior walls. R-19 recommended for ceilings.

Suggested Tools

 * Tape Measure
 * Utility Knife
 * Dust Mask
 * Staple Gun
 * Ladder

Note: Only install insulation on exterior walls. Paper side facing the interior of the house.

Installation

 * 1) Measure height of wall or length of ceiling
 * 2) Measure and cut length of insulation equal measurement from step 1
 * 3) Place cut piece between studs
 * 4) Cut around outlets, light-switches, and other fixtures
 * 5) Repeat steps 2-4 for each gap between studs throughout house
 * 6) Staple all flaps to face of studs
 * 7) Staple vapor barrier to face of studs

Note: R-13 Wall insulation is typically produced as a continuous roll. R-19 ceiling insulation is typically produced in 7 ft sections. Multiple pieces may be used to fill a gap. Gaps are typically 15 inches wide.