text:
Talk:Muggles' Guide to Harry Potter/Magic/Decoy Detonator

Response to the stub comment
Actually, this is legitimate. The Decoy Detonator is a Weasley's Wizard Wheezes product that has a cameo in book 6 and a small part in book 7. I believe we even link to it from those locations. I will be expanding it later today. Chazz (talk) 19:50, 17 December 2007 (UTC)


text:
Expert Systems/The Agenda

The Agenda
The agenda is a queue that contains all the rules whose conditions have been met and are capable of firing. The inference engine will examine the rules on the agenda, and determine which rules will be acted upon.

Conflict
When there are 2 or more rules on the agenda, that is when there are several rules whose conditions have been met and are prepared to be fired. In these cases, the inference engine needs to decide which rules to fire, and which order to follow them in.

Rule Order
There are many different ways that the inference engine can decide which rules to fire on the agenda, and in which order.

First In, First Out
First in, first out (FIFO) means that rules are added to the agenda in the order which they appear in the knowledge base, and the inference engine fires rules in the same order in which they appear in the agenda.

Precedence
In a precedence system, each rule is given a precedence value, and rules with the higher precedence are fired. The problem with these systems, is that there is a temptation for the programmer to assign precedence values in such a way as to duplicate a procedural program.

Manually scripting the exact order in which rules fire is generally a bad idea. Expert systems are far more robust when the knowledge engineer, instead, collects rules which are true no matter which order they are fired.

Number of Antecedents
Rules which have more antecedents, and therefore have more requirements, are likely to be more accurate, and more likely to lead to a goal quickly. This is the kind of logic that leads to systems which fire rules based on the number of antecedents.

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

title: Expert Systems/The Agenda


text:
Expert Systems/What is Knowledge?

Rules
Rules are structured as "if"/"then" rules as follows:

IF X THEN Y

Here, X is known as the antecedent and Y is known as the consequent. The antecedent represents a series of requirements, and if those requirements are satisfied, then the actions in the consequent are performed.

title: Expert Systems/What is Knowledge?


text:
Talk:Programming with Moose/Syntax/has

need to create and describe the schism when all of the changes happened to predicate/clearer and required. EvanCarroll (talk) 20:04, 17 December 2007 (UTC)

title: Talk:Programming with Moose/Syntax/has


text:
Expert Systems/Forward Chaining

Forward Chaining
In a forward chaining system, the inference engine is presented with some starting information, and works forwards through its rule base to reach some conclusion. ...

title: Expert Systems/Forward Chaining


text:
Expert Systems/Backward Chaining

Backward Chaining
In a backward chaining system, the inference engine selects a goal, and then attempts to find evidence to support or disprove that goal. If a goal is disproved, a new goal is selected and new evidence is searched for to support it.

title: Expert Systems/Backward Chaining


text:
A-level Mathematics/Edexcel/Core 1/Algebra

Mathematics revolves around Algebra, so sufficient knowledge of this is essential. You should recognise most of this from your GCSE course, but it's important to ensure you understand this.

= Pure Maths 1, Module 1, Algebra =

Collecting like terms
Several terms in the same unknown can be contracted, or collected together, making them much easier to work with, for example, $$6x + 2x = 8x$$, similarly, the same works with subtraction, $$5y - 3y$$ is the same as $$2y$$.

Laws of indices
1. $$x^a \times x^b = x^{a+b}$$.

For example, $$x^3 \times x^2$$. This is the same as $$(x \times x \times x) \times (x \times x)$$. Or $$x \times x \times x \times x \times x = x^5 = x^{3+2}$$

2. $$x^a \div x^b = x^{a-b}$$.

For example, $$x^5 \div x^3$$, expands to $$\frac{x \times x \times x \times x \times x}{x \times x \times x}$$. Three of the $$x$$'s on the top line cancel out, leaving us with $$x \times x = x^2 = x^{5-3}$$

3. $$(x^a)^b = x^{a \times b}$$

For example, $$(4^2)^3 = (4 \times 4) \times (4 \times 4) \times (4 \times 4)$$ or $$4^6$$

4. $$x^0=1$$ where $$x\ne0$$

For example, $$5^0 \times 6 = 1 \times 6 = 6$$

5. $$x^{\frac{a}{b}} = \sqrt[b]{x^a} = (\sqrt[b]{x})^a$$

For example, $$8^{\frac{2}{3}} = {\sqrt[3]{8}}^2 = 2^2 = 4.$$

Manipulation of surds
A surd is an irrational number, meaning it cannot be written exactly in decimal or fractional form, an example is $$\sqrt{2}$$, numbers are written in surd form because writing it any other way would reduce the accuracy, and in mathematics an exact value is needed. There are two rules of surd manipulation required for C1:

1. $$\sqrt{xy} = \sqrt{x} \times \sqrt{y}$$

For example, $$\sqrt{16 \times 25} = 20 = \sqrt{16} \times \sqrt{25}$$.

2. $$\sqrt{ \frac{x}{y}} = \frac{ \sqrt{x}}{ \sqrt{y}}$$

For example, $$\sqrt{ \frac{5}{4}} = \frac{ \sqrt{5}}{ \sqrt{4}} = \frac{ \sqrt{5}}{2}$$

Sometimes a surd may need to be expressed as $$x\sqrt{y}$$, this is done by finding a square number, like 4 or 9, that multiplies into the surd, which then can be taken outside the square root and put in front:

For example, $$ \sqrt{45} = \sqrt{ 9 \times 5} = \sqrt{9} \sqrt{5} = 3 \sqrt{5} $$

= Quadratic functions =

Graphs
The general form of a quadratic equation is $$\textstyle y = f(x) = ax^2 + bx + c, a \neq 0$$, where a, b, and c are constants.

A graph can be sketched by simply taking values of $$x$$ and calculating the values of $$y$$ using the equation of the graph given. These values can then be plotted onto the graph:

For example, $$\textstyle y = x^2 - 3x - 4$$, then taking x between -2 and +5 gives:

Sketching Graphs
= Equations and Inequalities =

Simultaneous Equations
Simultaneous equations are two or more equations where you have to find values for unknowns that satisfy both. There are two methods you need to know about for solving them.

Elimination
Elimination involves 'taking away' or 'adding' the two equations together to eliminate on of the two unknowns. Here's an example:

$$ \begin{array}{lcl} 5x + 4y & = & 33 \\ 6x - 4y & = & 22 \end{array} $$

In this case, adding the equations together will eliminate y:

$$ \begin{array}{lclc} & 5x + 4y & = & 33 \\ + & 6x - 4y & = & 22 \\ \Rightarrow & 11x + 0y & = & 55 \end{array} $$

We can then solve $$11x = 55$$ to get $$x = 5$$. This value of x can then be put back into one of the original equations to find the value of y:

$$ \begin{array}{l} 5x + 4y = 33 \\ 25 + 4y = 33 \\ 4y = 8 \\ y = 2 \end{array} $$

Sometimes, you may have to change one of the equations to be able to use elimination. Look at the following two:

$$ \begin{array}{lcl} 3x + 4y & = & 14 \\ 5x + 8y & = & 24 \end{array} $$

Neither of the unknowns can be eliminated at the moment but by multiplying the whole of the first equation by 2 it makes it possible to eliminate by taking one away from the other:

$$ \begin{array}{lclc} & 6x + 8y & = & 28 \\ - & 5x + 8y & = & 24 \\ \Rightarrow & 1x + 0y & = & 4 \end{array} $$

This can then be substituted back into one of the original equations to find y:

$$ \begin{array}{l} 5x + 8y = 24 \\ 20 + 8y = 24 \\ 8y = 4 \\ y = \frac{1}{2} \end{array} $$

Linear
Inequalities can be manipulated in the same way an equation can be with an extra rule: when multiplying or dividing by a negative value, the greater/less than must be switched to the other. For example: $$ \begin{align} -6x + 3 & > -9 \\ -6x & > -12 \\ x & < 2 \end{align} $$

Critical values
For the inequality $$ax^2 + bx + x < 0$$, consider the corresponding equation $$ax^2 + bx + c = 0$$. Solve the equation for x; the two values of x you obtain are known as the critical values, and represent the limits between which the solutions for the inequality lie. For example:

 * $$\displaystyle x^2 - 2x - 3 = 0$$
 * $$\displaystyle (x + 1)(x - 3) = 0$$
 * $$\displaystyle x = -1$$ or $$\displaystyle x = 3$$.

Therefore critical values are -1 and 3.

In the above example, the solution is either $$ -1 < x < 3$$ or $$x<-1;x>3$$. To determine which one it is, plug in any value, apart from the critical values, into the original inequality and see if the inequality is true, if it is the value you plugged in is in the solution set.

Continuing from the above example, let $$x=0$$.

 * $$0 - 0 - 3 < 0$$

This shows that 0 is a solution, and as it lies in $$-1<x<3$$, $$-1<x<3$$ is the solution


text:
User:Pyrospirit

I am w:User:Pyrospirit from the English Wikipedia.

title: User:Pyrospirit


text:
User:Jourdy288

I am a fishkeeper, and a photographer.

title: User:Jourdy288


text:
User talk:Jourdy288

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 22:26, 17 December 2007 (UTC)

Your account will be renamed
Hello,

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

Unfortunately, your account clashes with another account also called Jourdy288. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Jourdy288~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:18, 17 March 2015 (UTC)

title: User talk:Jourdy288


text:
User talk:Pyrospirit

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 22:28, 17 December 2007 (UTC)

title: User talk:Pyrospirit


text:
Arapaho

Lessons

 * Alphabet: Reading and Writing
 * Lesson 1: Simple Phrases

title: Arapaho


text:
User talk:66.118.190.50

--Solumeiras (talk) 23:22, 17 December 2007 (UTC)

--Solumeiras (talk) 23:22, 17 December 2007 (UTC)

title: User talk:66.118.190.50


text: Arapaho/Lesson 1

title: Arapaho/Lesson 1


text:
New Zealand History/Print version

= PART 1: EARLY HISTORY =

= PART 2: EUROPEAN EXPLORATION AND SETTLEMENT =

= PART 3: NEW ZEALAND IN THE TWENTIETH CENTURY =

= PART 4: NEW ZEALAND'S RECENT HISTORY =

= END NOTES =

= GNU Free Documentation License =

title: New Zealand History/Print version


text:
Combinatorics/Binomial Theorem

The Binomial Theorem
The Binomial Theorem determines the expansion for the powers of different sums; written out, it is:
 * $$(x+y)^n=\sum_{i=0}^n{n \choose i}x^{n-i}y^{i}$$

Here, $$\tbinom ni$$ is the binomial coefficient for n and i, which was defined in the previous chapter as a number counting the ways to choose i elements from a set of n and pronounced "n choose i", and whose value can be computed as
 * $$\binom ni=\frac{n!}{i!(n-i)!}$$

Thus, $$(x+2)^2=1x^2+2x^12^1+2^2=x^2+4x+4\,$$

and $$(x+y)^5=x^5+5x^4y+10x^3y^2+10x^2y^3+5xy^4+y^5\,$$

The coefficients in the expansion are entries in a row of Pascal's triangle. i.e. $$(x+y)^5$$ gives the coefficients for the fifth row of Pascal's triangle.

Combinatorial proof
There are many proofs possible for the binomial theorem. The combinatorial proof goes as follows:

Consider the coefficients of $$x^{n-k}y^k\,$$, for a fixed k, on both sides. The left hand side i.e. $$(x+y)^n=(x+y)(x+y)\cdots (x+y)$$ when expanded will have terms only of the type $$x^{n-i}y^i\,$$ where i ranges from 0 to n. The number of times $$x^{n-k}y^k\,$$ occurs will be precisely equal to the number of ways of choosing k numbers out of n. This is because from each of the factors (x+y), n in all, we will have to choose k of the y's (the remaining will be x's). Thus the coefficient of $$x^{n-k}y^k\,$$ on the left hand side will be $${n\choose k}$$. This matches the coefficient on the right hand side and the proof is complete. The proof should be logical .Not a stated sentence

Consequences
There are many consequences of the binomial theorem.

Firstly on putting x = y = 1 in the theorem we get $$2^n=\sum_{i=0}^n{n \choose i}$$. This means that the total number of subsets of a set having n elements (which is $$2^n$$, a result we have already obtained) equals the sum of the number of ways of choosing i order sets out of the n set, for all i.

Secondly, on putting x = 1 and y = -1 in the theorem we have $$0=\sum_{k=0}^n(-1)^k{n \choose k}$$. Equivalently this means,
 * $$\sum_{k\ odd}{n \choose k}=\sum_{k\ even}{n \choose k}$$,

which says that for any n order set, the number of its odd order subsets is equal to the number of its even order subsets.

Thirdly, we have the Vandermode's identity obtained by comparing the coefficient of $$x^k$$ in $$(1+x)^{m+n}$$
 * $$\begin{align}

\sum_{k=0}^{m+n} {m+n \choose k}x^k &= (1+x)^{m+n}\\ &= (1+x)^m (1+x)^n \\ &= \biggl(\sum_{k=0}^m {m\choose k}x^k\biggr) \biggl(\sum_{k=0}^n {n\choose k}x^k\biggr)\\ &=\sum_{k=0}^{m+n}\biggl(\sum_{i=0}^k {m\choose i} {n\choose k-i}\biggr) x^k, \end{align} $$

Note that here we use the definition of the product of two polynomials with degrees m and n, respectively, which is given by

 * $$\biggl(\sum_{i=0}^m a_ix^i\biggr) \biggl(\sum_{j=0}^n b_jx^j\biggr)

= \sum_{r=0}^{m+n}\biggl(\sum_{k=0}^r a_k b_{r-k}\biggr) x^r,$$

where we use the convention that as = 0 for all integers s > m and bt = 0 for all integers t > n.

On comparing the coefficient of $$x^k$$ we get Vandermonde's identity:
 * $${m+n \choose k}=\sum_{i=0}^k{m \choose i}{n \choose k-i},\qquad m,n,k\in\mathbb{N}$$

Note that putting m = 1 in Vandermonde's identity allows us to recover Pascal's relation discussed in the previous chapter albeit in a slightly different form:

 * $${n+1 \choose k}= {n \choose k}+{n \choose k-1}$$

Vandermonde's identity has a combinatorial proof too. The binomial coefficient $${m+n \choose k}$$ is the number of k subsets of the m + n set $$A\bigcup B$$ where $$A=\{1,2\cdots m\}$$ and $$B=\{m+1,m+2\cdots m+n\}$$. The number of such k-subsets which contain i elements of A would be $${m \choose i}{n \choose k-i}$$ (i elements from A and the rest k-i from B). The summation $$\sum_{i=0}^k{m \choose i}{n \choose k-i}$$ counts these subsets for all i.

Another useful result that arises from Vandermonde's is obtained by putting m = k = n in the Vandermonde's identity. That gives us:

 * $${2n \choose n}=\sum_{i=0}^n{n \choose i}^2$$

Let us look at another consequence, the fourth one. Consider $$(1+x)^{m+n+1}=(1+x)\cdots (1+x)$$ where there are $$m+n+1$$ terms of the type $$(1+x)$$ on the right hand side. The coefficient of $$x^{n+1}$$ on the left side is $${m+n+1\choose n+1}$$. On the right side the coefficient would be obtained by looking at the number of ways of picking up n+1 x's and remaining 1's from the m+n+1 terms of the type (1+x), similar to what we had done in the proof of the binomial theorem. Let the right most x be picked up from the n+i+1'th term where i clearly varies from 0 to m. This gives us the choice of picking up n x's from the remaining n+i terms which can be done in $${n+i\choose n}$$ number of ways. The total number of ways will be obviously obtained by summing over all possible i. So the coefficient of $$x^{n+1}$$ would be $$\sum_{i=0}^m{n+i\choose n}$$ and hence we have the relation

 * $${m+n+1\choose n+1}=\sum_{i=0}^m{n+i\choose n}$$

Like Vandermonde's identity this identity can also be proved combinatorically. The left side represents the number of ways of choosing n+1 order sets from an m+n+1 set, say $$\{1,2,\cdots m+n+1\}$$. Suppose for any given n+1 order set, the largest element in n+i+1 where i varies from 0 to m. Then the remaining n elements have to be chosen from n+i elements and the number of ways of doing that is exactly $${n+i\choose n}$$. Summing over all i gives us the total number of ways which has already been decided to be the left side. It only remains to equate the two terms.

Changing the variables in the above identity gives us,

 * $${n+1\choose k+1}=\sum_{i=k}^n{i\choose k}$$

Also this implies:

 * $${n+1\choose k+1}-{m+1\choose k+1}=\sum_{i=m+1}^n{i\choose k}$$

title: Combinatorics/Binomial Theorem


text:
User talk:Leocelis.startups

Welcome to Wikibooks! I hope you enjoy your time here. You might want to go here. Ask me for any help you need. Laleena (talk) 00:49, 18 December 2007 (UTC)

title: User talk:Leocelis.startups


text:
User talk:Portlandiaman

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 00:51, 18 December 2007 (UTC)

title: User talk:Portlandiaman


text:
User talk:Nicoleddss

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * Make sure to sign your posts and comments with four tildes, like this: ~~~~
 * There is a box at the top of the edit window (if javascript is enabled on your browser) that will insert it too (looks like part of a signature). This will let others know who left it, and make it easy to reply back to you.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic (talk) 02:37, 18 December 2007 (UTC)

title: User talk:Nicoleddss


text:
User talk:Drinckel

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * Make sure to sign your posts and comments with four tildes, like this: ~~~~
 * There is a box at the top of the edit window (if javascript is enabled on your browser) that will insert it too (looks like part of a signature). This will let others know who left it, and make it easy to reply back to you.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic (talk) 02:37, 18 December 2007 (UTC)

title: User talk:Drinckel


text:
User:1bookfan

Hi, I`m 1bookfan if you want to talk to me go to user_talk:1bookfan. also,if you are a wikipedia user please sign

OTHER WIKIMEDIA ACCOUNTS: (WIKIPEDIA) (wiktionary)

title: User:1bookfan


text:
Smalltalk Programming/Beginning

Smalltalk is an object-oriented programming language developed by Alan Kay, Dan Ingalls, Adel Goldberg, Ted Kaehler, Scott Wallace, and others during the 1970s, influenced by Lisp, Logo,Sketchpad and Simula. It has influenced the design of many languages especially Objective C, and Ruby.

There are many versions of Smalltalk available. For this book we are going to use Squeak. First download a version of Squeak appropriate for your platform.

title: Smalltalk Programming/Beginning


text:
Arapaho/Alphabet

Vowels

 * e, i, o, and u, are short vowels—they sound similar to the English bet, bit, got, and put, respectively.
 * ee, ii, oo, and uu are long vowels—they sound similar to the English, bat, beet, fought, and dude respectively.
 * eee, iii, ooo, and uuu are extra long vowels. They usually have extra stress in the end or the beginning. They are like putting the long vowel oo followed immediately by the short vowel o (for example).
 * ei, ou, oe, i.e., are short vowel combinations, they sound similar to the English weight, boat, and bite. The last combination is rare in Arapaho and is pronounced by saying the short vowels (above) e and i right after each other.
 * eii, oee, and ouu are long vowel combinations. ei is like a ei with an i added to the it, oee is like an oe held a bit longer, and ouu is like a ou with a u added to the end.

Consonants
Unless somebody writes up a intro to the consonants, look up an IPA tutorial and use that :)

Tones
Arapaho is a tonal language and tones are marked like this é, í, ó, ú (with an accent going from up to down) means it's a high tone. ê, î, ô, û, (like a cap) means a falling tone.

title: Arapaho/Alphabet


text:
User:AndrewBuck

Please see my main userpage on the English Wikipedia w:User:AndrewBuck.

title: User:AndrewBuck


text:
User talk:AndrewBuck

Please see my main talk page on the English Wikipedia w:User talk:AndrewBuck.

title: User talk:AndrewBuck


text:
Horticulture/Leucanthemum vulgare

The oxeye daisy (Leucanthemum vulgare, syn. Chrysanthemum leucanthemum) also known as the marguerite is a widespread flowering plant native to Europe and the temperate regions of Asia. It is one of a number of plants to be called by the common name daisy. It is also sometimes called moon daisy or dog daisy.

Description
It is a perennial prostrate herb with small flower head (not larger than 5 cm) that consists of about 20 white ray flowers and numerous yellow disc flowers, growing on the end of the stem. The stem is mostly unbranched and sprouts laterally from a creeping rootstock.

The leaves are darkgreen on both sides. The basal and middle leaves are petiolate, obovate to spoon-shaped, and serrate to dentate. The upper leaves are shorter, sessile and borne along the stem.

It produces an abundant number of flat seeds without pappus. It spreads also vegetatively by rooting underground stems.

Uses
The oxeye daisy is a typical meadow flower, growing in a variety of plant communities such as dry fields, meadows, but also under scrubs, open-canopy forests and waste places. It thrives in a wide range of conditions and prefers heavy and damp soils. It was introduced in parts of North America, Australia and New Zealand, where it is now a common weed displacing native plant species in some areas. It is difficult to control or eradicate, since a new plant can regenerate from rhizome fragments. However, in North Carolina it is planted on roadsides by the highway department.

The un-opened buds can be marinated and used in a similar way to capers. The game "He loves me, he loves me not" ("effeuiller la marguerite" (in French)) is associated with this flower.

title: Horticulture/Leucanthemum vulgare


text:
User talk:Boyton~enwikibooks

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 13:24, 18 December 2007 (UTC)

Your account will be renamed
Hello,

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

Unfortunately, your account clashes with another account also called Boyton. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Boyton~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 22:59, 17 March 2015 (UTC)

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

title: User talk:Boyton~enwikibooks


text:
User talk:69.74.139.211

-- Herby talk thyme 13:48, 18 December 2007 (UTC)

title: User talk:69.74.139.211


text:
Horticulture/Linaria vulgaris

Linaria vulgaris (Common Toadflax ) is a low growing plant native to most of Europe and northern Asia, from the United Kingdom south to Spain in the west, and east to eastern Siberia and western China.

Linaria acutiloba Fisch. ex Rchb. is a synonym. Because this plant grows as a weed, it has acquired a large number of local colloquial names, including brideweed, bridewort, butter and eggs (but see ../Lotus corniculatus/), butter haycocks, bread and butter, bunny haycocks, bunny mouths, calf's snout, Continental weed, dead men's bones, devil's flax, devil's flower, doggies, dragon bushes, eggs and bacon (but see ../Lotus corniculatus/), eggs and butter, false flax, flaxweed, fluellen (but see ../Kichxia/), gallweed, gallwort, imprudent lawyer, impudent lawyer, Jacob's ladder (but see ../Polemonium/), lion's mouth, monkey flower (but see ../Mimulus/), North American ramsted, rabbit flower, rancid, ransted, snapdragon (but see ../Antirrhinum/), wild flax, wild snapdragon, wild tobacco (but see Nicotiana), yellow rod, yellow toadflax.

The plant is widespread on ruderal spots, along roads, in dunes, and on disturbed and cultivated land. It has escaped from cultivation in North America where it is a common naturalised weed of roadsides and poor soils; it is listed as an invasive species in several U.S. states and Canadian provinces.

Description
It is a perennial plant with short spreading roots, erect to decumbent stems 15–90 cm high, with fine, threadlike, glaucous blue-green leaves 2–6 cm long and 1–5 mm broad. The flowers are similar to those of the snapdragon, 25–33 mm long, pale yellow except for the lower lip which is orange, borne in dense terminal racemes from mid summer to mid autumn. The fruit is a globose capsule 5–11 mm long and 5–7 mm broad, containing numerous small seeds.

Because the flower is largely closed by its underlip, pollination requires strong insects such as bees and bumblebees (../Bombus/ species).

Growing Conditions
The plant requires ample drainage, but is otherwise adaptable to a variety of conditions.

Uses
While most commonly found as a weed, toadflax is sometimes cultivated for cut flowers, which are long-lasting in the vase. Like snapdragons (../Antirrhinum/), they are often grown in children's gardens for the "snapping" flowers which can be made to "talk" be squeezing them at the base of the corolla.

Pests and Diseases
The plant is foodplant for a large number of insects such as the Sweet-Gale Moth (Acronicta euphorbiae), Mouse Moth (Amphipyra tragopoginis), Silver Y (Autographa gamma), Calophasia lunula, Gorgone Checkerspot (Charidryas gorgone carlota), Toadflax Pug (Eupithecia linariata), Satyr Pug (Eupithecia satyrata), Falseuncaria ruficiliana, Bog Fritillary (Proclossiana eunomia eunomia), Pyrrhia umbra, Brown Rustic (Rusina ferruginea), and Stenoptilia bipunctidactyla.

title: Horticulture/Linaria vulgaris


text: User talk:SB Johnny/print test

title: User talk:SB Johnny/print test


text:
MediaWiki:Gadgets-definition

browse-gadgets

 * wikidialog[ResourceLoader|default|targets=desktop,mobile|dependencies=mediawiki.util]|wikidialog.js
 * CommentsInLocalTime[ResourceLoader]|CommentsInLocalTime.js
 * sidebartranslate[ResourceLoader]|langcode2name.js|sidebartranslate.js
 * SpecialSearch[ResourceLoader]|SpecialSearch.js
 * rightsfilter[ResourceLoader]|rightsfilter.js
 * contribsrange[ResourceLoader]|contribsrange.js
 * background-awesomeness|background-awesomeness.css
 * subject-pages[ResourceLoader]|subjects.css|subjects.js
 * navpop[ResourceLoader]|navpop.js|navpop.css
 * commons-file[ResourceLoader|default|dependencies=mediawiki.util]|commons-file.js
 * UTCLiveClock[ResourceLoader]|UTCLiveClock.js

edit-gadgets

 * wiked[ResourceLoader]|wiked.js
 * DeluxeBar[ResourceLoader|dependencies=ext.gadget.mediawiki.toolbar|rights=edit]|DeluxeBar.js
 * searchbox[ResourceLoader]|lib-beau.js|searchbox.js
 * BookCat[ResourceLoader]|BookCat.js

tab-gadgets

 * purge[ResourceLoader|dependencies=mediawiki.util]|purge.js
 * bottomtabs[ResourceLoader]|bottomtabs.css|bottomtabs.js
 * sixtabs[ResourceLoader|skins=monobook|dependencies=mediawiki.util]|sixtabs.js

admin-gadgets

 * subpages[ResourceLoader|rights=delete|dependencies=mediawiki.util]|subpages.js
 * massblock[ResourceLoader|rights=block]|massblock.js|blockoptions.js
 * CleanDeleteReasons[ResourceLoader|rights=delete]|CleanDeleteReasons.js
 * markblocked[ResourceLoader|rights=block|dependencies=mediawiki.util]|markblocked.js
 * mediawiki.toolbar [ResourceLoader|hidden] | mediawiki.toolbar.js
 * markAdmins [ResourceLoader|dependencies=mediawiki.util]|markAdmins-data.js|markAdmins.js

broken-gadgets

 * Welcome[ResourceLoader|dependencies=site,mediawiki.util]|wknightcore.js|Welcome.js
 * Twinklerevert[ResourceLoader|dependencies=mediawiki.util,jquery.ui]|twinkle.js|twinkle.css|twinklefluff.js
 * twinklespeedy[ResourceLoader|dependencies=mediawiki.util,jquery.ui]|twinkle.js|twinkle.css|twinklespeedy.js
 * twinklewarn[ResourceLoader|dependencies=mediawiki.util,jquery.ui]|twinkle.js|twinkle.css|twinklewarn.js
 * Twinkleunlink[ResourceLoader|dependencies=mediawiki.util,jquery.ui]|twinkle.js|twinkle.css|twinkleunlink.js
 * toolboxcompat[ResourceLoader]|toolboxcompat.js
 * edittop[ResourceLoader|dependencies=mediawiki.util]|edittop.js
 * Special_characters[ResourceLoader]|Special_characters.js
 * colorcats|category-colorcode.css

 * wkBookCreator[ResourceLoader]|wknightcore.js|wkcategorize.js|wkeditinsert.js|wkdesigner.js|
 * GetCollection[ResourceLoader|dependencies=mediawiki.util]|collectionparser.js

 * modrollback[ResourceLoader|rights=rollback]|modrollback.js
 * autodel[ResourceLoader|rights=delete]|autodel.js
 * twinkledelimages[ResourceLoader|rights=delete]|twinkle.js|twinkle.css|twinkledelimages.js
 * extlinks[ResourceLoader|dependencies=mediawiki.util]|extlinks.js

title: MediaWiki:Gadgets-definition


text:
MediaWiki:Common.js/Perbook.js

/* Per-book JavaScript. * Maintained by User:Darklama * Use book-specific stylesheet and JavaScript. * You can ask an administrator to add or update a global book specific Stylesheet or JavaScript. */

(function( mw ) {	var	ns = mw.config.get( 'wgNameSpaceNumber' ),		user = mw.config.get( 'wgUserName', false ),		book = mw.config.get( 'wgBookName' );

if ( ns === 8 || mw.config.get( 'wgIsArticle' ) === false ) { return; 	/* Disable in MediaWiki space and when not viewing book material */ } else if ( ns === 2 ) { /* Find correct book name in User space */ book = mw.config.get( 'wgPageName' ).split( '/', 2 )[1];

if ( book === 'per_book' ) { return; /* Disable within reserved spaces */ }	}

/* global styling */ importStylesheet( 'MediaWiki:Perbook/' + book + '.css' ); importScript( 'MediaWiki:Perbook/' + book + '.js' );

/* user styling */ if ( user ) { importStylesheet( 'User:' + user + '/per_book/' + book + '.css' ); importScript( 'User:' + user + '/per_book/' + book + '.js' ); } })( mediaWiki );

title: MediaWiki:Common.js/Perbook.js


text: Template:Horticulture/Header

title: Template:Horticulture/Header


text:
User:Whiteknight/Perbook

This page is going to contain documentation for the Per-Book, and Personal Per-Book gadgets. You can install these gadgets by going to the Gadgets tab at Special:Preferences.

title: User:Whiteknight/Perbook


text:
Horticulture/Lonicera maackii

Lonicera maackii (Amur Honeysuckle or Bush Honeysuckle) is a species of honeysuckle in the family Caprifoliaceae, native to temperate Asia in northern and western China (south to Yunnan), Mongolia, Japan (central and northern Honshū, rare), Korea, and southeastern Russia (Primorsky Krai). It is listed as an endangered species in Japan. It has escaped from cultivation and become naturalised in New Zealand and the eastern United States; in the forests of the latter, it has become an important invasive species.

The common name Amur Honeysuckle comes from the Amur River which is the world's eighth longest river. This river forms the border between the Russian Far East and Manchuria in China. L. maackii is native to the area surrounding this river. The species name maackii is derived from Richard Maack, a 19th century Russian naturalist.

Description
It is a deciduous large shrub growing to 6 m tall with stems up to 10 cm diameter. The leaves are oppositely arranged, 5–9 cm long and 2–4 cm broad, with an entire margin, and with at least some rough hairs on them. The flowers are produced in pairs, commonly with several pairs grouped together in clusters; they are 2 cm long, two-lipped, white later turning yellow or light orange in colour; flowering is from mid spring to early summer. The fruit is a bright red to black semi-translucent berry 2–6 mm diameter containing numerous small seeds; they ripen in autumn, and are eaten by birds, which disperse the seeds in their droppings. It is fast growing and favours shady habitats such as the forest understory, neglected urban areas, and fence rows. It can form extremely dense thickets.

Uses
It is grown as an ornamental plant for its attractive flowers, and also as a hedge. A number of cultivars have been selected for garden use, including 'Erubescens' with pink flowers, and 'Rem Red' with erect habit.

The flowers are sometimes used by children, who remove the blossom by hand, and pull off the bottom to suck out the sweet nectar in the centre. The red berries are mildly poisonous to humans and should not be eaten.

Invasiveness
Spread of this plant is illegal or controlled in some areas of the United States due to its well documented invasive character. It is listed as a "invasive, banned" species in Connecticut, "prohibited" in Massachusetts, and a "Class B noxious weed" in Vermont. It is also officially listed as an invasive species by government agencies in Wisconsin and Tennessee.

This plant is adaptable and successful in a wide range of conditions. In the United States, Amur honeysuckle was once planted to control erosion, and as hedges. It spread quickly as birds dispersed the seeds, and was soon naturalised. Notably, in deciduous forest understories of the eastern United States it forms dense growths with thick canopies that shade out native shrubs, young trees, and wild flowers. Uncontrolled, these growths create a near monoculture of Amur Honeysuckle. This species poses a serious threat not only to the diversity of the ecosystems which they invade but also to forest regeneration itself.

Due to the invasive nature of this species and the ecological threat it possess it may be inadvisable to cultivate this plant in climates similar to those found where this species has become invasive (e.g. eastern United States). It has been suggested that existing specimens found outside of their native range in east Asia should be removed and replaced with alternative non-invasive species. Possible alternative fast growing, shade tolerant, deciduous shrubs include ../Calycanthus floridus/, ../Cornus mas/, ../Cornus sericea/, ../Forsythia/ hybrids, ../Hydrangea/ spp., ../Syringa vulgaris/, ../Viburnum cassinoides/, ../Viburnum dentatum/, ../Viburnum dilatatum/, ../Viburnum opulus/, ../Viburnum prunifolium/, ../Viburnum trilobum/, ../Weigela florida/.

Control
Honeysuckle can be controlled by cutting, flaming, or burning the plant to root level and repeating on two-week increments until nutrient reserves in the roots are depleted. To ensure eradication newly cut stumps should be treated with herbicide. Control through prescribed burning has been found to be most effective during the seed dispersal phase (late summer, early fall). Honeysuckle can also be controlled through annual applications of glyphosate which thoroughly soak the leaves, or through grubbing of the shallowly rooted young plants. Both of these methods are only practical if high labour costs and soil damage are not of concern.

title: Horticulture/Lonicera maackii


text:
MediaWiki:Gadget-extlinks.js

// Open external links in a new tab or window. $(document).ready( function($) {	var server = mw.config.get( 'wgServer' );	mw.util.$content.find('a').each( function { var $link = $(this); if ( !$link.hasClass( 'external' ) && !$link.hasClass( 'extiw' ) ) { return; }		// check hostname first where available as second test may not catch all links that it should if ( this.hostname === window.location.hostname || $link.attr('href').substr(0, server.length) === server ) { return; }		$link.attr( 'target', '_blank' ); }); });

title: MediaWiki:Gadget-extlinks.js


text:
MediaWiki:Gadget-extlinks

External links: Allows external links to be opened in a new tab or window

title: MediaWiki:Gadget-extlinks


text:
User talk:Nesnad/sandbox

''This is my sandbox, I'm just trying some stuff out. This isn't an article.''

title: User talk:Nesnad/sandbox


text:
User talk:Nesnad/sandbox/Introduction

So you want to learn Japanese in less time than it takes you to learn how to play a complex board game? Well, that might not be possible. However, if you dig in and try hard you might be able to learn the basics faster than you think.

What this is and what this is not
This is not a complete guide to the Japanese language. This is not every possible correct way of saying each and every word. Those kind of books are useful but take a lot of mental investment on the part of the reader. This book is simply a step above a phrase book. This book is for those who want to jump in quick and learn from that moment forward. This book will let you know the basic phrases and words in an intuitive "plug and play" kind of way that will let you learn even more on your own. Remember this is just a quick introduction to a very complex language. Don't sweat the grammar, just memorize the provided text. This book uses hiragana (a Japanese alphabet) to write the sounds of Japanese, it is easy to learn and you can do that next. And there is even a way for you to cheat and not learn, if you really don't want to. So even if you don't want to do learn a Japanese alphabet, click next and see if you change your mind. You should be up and communicating in no time! Goodluck!

'''Next: Learn to read, it's easy!

title: User talk:Nesnad/sandbox/Introduction


text:
User talk:Antonw

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 16:32, 18 December 2007 (UTC)

BTEC Applied Science
Hi Anton

Thanks for adding a bit to the book! I hope there's more to come!

Ewen (talk) 22:44, 4 January 2008 (UTC)

title: User talk:Antonw


text:
User talk:AnIm8Ed

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 16:33, 18 December 2007 (UTC)

title: User talk:AnIm8Ed


text:
User talk:Titocurt

Welcome!
Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.--Whiteknight (Page) (Talk) 16:34, 18 December 2007 (UTC)

title: User talk:Titocurt


text:
User talk:Nesnad/sandbox/Learn to read, it's easy!

OK. So you are thinking ''I want to communicate! I don't want to learn boring foreign letter-shape things!!'' Stop right there! Learning one of the basic Japanese alphabets is not that hard. You can pull out a note book and write each character over and over for about 20 minutes and you should have the basics. No? You want to get started faster than that? Well, leave this window open and read the other lessons in another browser window. Use this window to help you decode the phrases. That will help you start memorizing if you are in too much of a hurry to memorize these now. Why not provide the text in roman letters? Because it's not hard to learn a basic foreign alphabet and you'll soon realize that the key to "jumping in" so to speak, is to be thinking in the target language. Still haven't convinced you? OK. Heres the cheat button. Just hover your browser cursor over this icon and see what it is in English letters. You really should learn the Japanese letters though. So if you haven't already; learn hiragana it isn't that hard.

 * basic hiragana: あ (a), い (i) , う (u) , え (e) , お (o) , か (ka) , き (ki) , く (ku) , け (ke) , こ (ko) , さ (sa) , し (shi) , す (su) , せ (se) , そ (so) , た (ta) , ち (chi) , つ (tsu) , て (te) , と (to) , な (na) , に (ni) , ぬ (nu) , ね (ne) , の (no) , は (ha) , ひ (hi) , ふ (fu) , へ (he) , ほ (ho) , ま (ma) , み (mi) , む (mu) , め (me) , も (mo) , や (ya) , ゆ (yu) , よ (yo) , ら (ra) , り (ri) , る (ru) , れ (re) , ろ (ro) , わ (wa) , を (wo) , ん (n)

 * You should also know:

That if you add a ” to K row sounds (such as か) it becomes a G. か (ka) becomes が (ga)

If you add a ” to S row sounds (such as さ) it becomes a Z. さ (sa) becomes ざ (za)

In the same way, add a ” to T row sounds (such as た) it becomes a D. た (ta) becomes だ (da)

Also add a ” to H row sounds (such as は) it becomes a B. は (ha) becomes ば (ba)

Finally a new one! Add ° to H row sounds (such as は) it becomes a P. は (ha) becomes ぱ (pa)

じ (ji), ぢ (ji) and づ (zu)
 * Three small exceptions

That's it! Not too hard. There are other ways to tweak these letters and a whole other set of letters plus Chinese characters. Don't worry about those for now. Now it's on to learning to communicate!

Next: empty link


text:
User:Whiteknight/remotetalk2.js

var rt = { rt.span: "WKRTSpan", rt.iframe: null, rt.alias: new Array, };

rt.getIFrame = function { if(rt.iframe == null) rt.iframe = wk.makeElement("iframe", {width:"100%", height:"550px"}); return rt.iframe; }

rt.talkLinks = function { var frame = wk.makeElement("div"); for(i = 0; i < rt.alias.length; i++) { var link = rt.createLink(rt.alias[i][0], rt.alias[i][1], rt.alias[i][2], rt.alias[i][3]); frame.appendChild(link); frame.appendChild(document.createTextNode(" — ")); }  link = wk.makeElement("a", {href:"#" + rt.span}, "Remove"); link.onclick = rt.initFrame; frame.appendChild(link); return frame; }

rt.createLink = function(project, username, linkname) { if(username == "") username = wgUserName; if(project == "") project  = "wikibooks"; if(linkname == "") linkname = username + "@" + project; username = username.replace(" ", "_"); var link = wk.makeElement("a", {href:"#" + rt.span}, linkname); link.onclick = function{ rt.getTalkPage(lang, project, username)}; return link; }

rt.getTalkPage = function (lang, project, username) { var talkurl = "http://" + lang + "." + project + ".org" + "/w/index.php?title=User_talk:" + username + "&action=view&printable=yes"; var frame = wk.spanText(rt.span, ""); var iframe = rt.getIFrame; iframe.setAttribute("src", talkurl); frame.appendChild(rt.talkLinks); frame.appendChild(iframe); frame.appendChild(rt.talkLinks); }

rt.getAlias = function(frame) { var text = frame.innerHTML; var links = text.split(","); for(var i = 0; i < links.length; i++) { var junk = links[i].split("@"); var name = junk[0]; var project = junk[1]; rt.alias.push([project, name]) }

}

rt.initFrame = function { var frame = wk.spanText(rt.span, ""); if(frame != null) { rt.getAlias(frame); frame.appendChild(rt.talkLinks); } }

if(typeof wk == "object" && wk.testVersion(2.0)) { addOnloadHook(rt.initFrame); }

title: User:Whiteknight/remotetalk2.js


text:
User talk:Nesnad/sandbox/Greetings

Greeting people isn't that hard. It just depends on what time of day it is. In the morning Johnny would say:

Now lets time travel into the future a little bit. In the afternoon Mary would say...

Yawn... it's getting late, did we get in the time machine again? It's evening!

Nice. But what about if Johnny and Mary meet and they want to know how each other are doing? Pretty easy, let's listen in.

 * Next: empty link

title: User talk:Nesnad/sandbox/Greetings


text:
User talk:Nesnad/sandbox/Introductions

So what do you do first? You get to know people! Lets meet some of the characters who will study with us. This is Johnny and Mary, they are just meeting each other now.

That's nice. Now Mary wants to meet Johnny!

Great! So let's move on to greeting people at different times of the day.

 * Next:  empty link

title: User talk:Nesnad/sandbox/Introductions


text:
User talk:Nesnad/sandbox/Saying bye

There are many ways to say goodbye in any language. Both formal ways and friendly relaxed ways. Johnny seems like he is kind of rigid, but Mary wants to relax!

Mary disregards the polite speech of Johnny and throws out a casual:

Johnny can't shake his desire for formal language and before he goes away, he shares:

OK! Done with the first chunk. Now it's on to some real sentences.

 * Next: empty link

title: User talk:Nesnad/sandbox/Saying bye


text:
MediaWiki:Gadget-purge

Add purge tab: This will give you a Purge tab on content pages to purge the server cache. This is useful for refreshing pages which do not show recent changes due to caching.

title: MediaWiki:Gadget-purge


text:
User talk:Nesnad/sandbox/Basic questions

OK. So before we can have a conversation. We need to brake a sentence down.

 これ は  なん  です  か

''' What is  this  ? (polite) '''

Lets listen to Johnny and Mary talk about stuff. Notice how the sentences change when they are talking about different things. You'll be able to plug-in your own new words too! Johnny and Mary are at a restaurant, what will they talk about?

Can you figure out how to plug-in these words? Let's look at a few examples from when Johnny met Mary suddenly by accident.

Wow. That Johnny! He jumps right into the question right away. Well Mary?

Wow, is Johnny bringing beer with him into Tokyo station?

Oh! It's only water. But what if they want to ask about action? Easy!

What will Mary say?

Gross! No cups! You'll get cooties, Mary! Oh well. Time to move to the next part!

 * Next: empty link


text:
MediaWiki:Gadget-edittop

Edit top section: this will add a link in the top right corner to edit the top section (the section before the first section heading).

title: MediaWiki:Gadget-edittop


text:
MediaWiki:Gadget-bottomtabs

Bottom tabs: This adds tabs at the bottom identical to the ones at the top.

title: MediaWiki:Gadget-bottomtabs


text:
MediaWiki:Gadget-sixtabs

Six tabs: Adds edit and history tabs for the talk page: page edit hist talk edit hist Only works with the Monobook skin.

title: MediaWiki:Gadget-sixtabs


text:
MediaWiki:Gadget-autodel

Autodelete links: This script makes speedy deletion faster and easier. Once you install it, Special:Contributions, Special:Newpages, Special:Log and any viewed or preview will have an autodelete tab. By clicking that, you will be prompted for a summary. Once you click OK after the summary, all links will autodelete when clicked. If you leave the delete reason blank, the default is "per speedy deletion policy."

title: MediaWiki:Gadget-autodel


text:
User talk:Venkatakrishnan

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * Make sure to sign your posts and comments with four tildes, like this: ~~~~
 * There is a box at the top of the edit window (if javascript is enabled on your browser) that will insert it too (looks like part of a signature). This will let others know who left it, and make it easy to reply back to you.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * Wikibooks is a collection of open-source textbooks. (What is Wikibooks).
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the Reading Room with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Help us by participating in policy and guideline creation.
 * Please take a look at Naming policy before starting a new book.
 * Remember to maintain a Neutral point of view.
 * Explore, be bold in editing pages, and have fun!

You will find more resources in Community Portal. If you want to ask a question, visit the Study help desk, the Reading Room, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be a good idea to add that page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic (talk) 18:20, 18 December 2007 (UTC)

title: User talk:Venkatakrishnan