text:
User talk:Sam86~enwikibooks

Wikijunior Bugs
Sam86,

I would like to propose an alternate layout for the wikijunior bugs page. As you are one of the named authors, i have come to you directly to see what you think of the idea. I have made a mock-up of the proposed layout on my personal sandbox which can be accessed by clicking this link or through my user page. All of the existing articles and other pages will remain unaltered by this as the only page that will change will be the main bugs page, if it is accepted that is.

I have proposed this new design to increase efficiency and reduce the amount of time that is spent moving articles from the stub list into the developing articles list and so on...

Please take a look and tell me what you think.

Regards, Urbane User

Invitation of a Wikibook study
Hello Sam86,

I read the Wikijunior Bug. I'm very impressed and interested to know more about your experience related to this particular book project (Wikijunior Bug) I'm current a doctoral student at Indiana University (US). My advisor and I, we are starting a Wikibook study regarding to online authors' beliefs and perceptions (motivation to write a Wikibook, beliefs about the knowledge of the topic, previous experience and success in writing a Wikibook, and ability to help coordinate the Wikibook project and interact with other authors).

We would love to invite you to participate in this study. If you agree to participate, please leave me a message or send me an email. (My email is cl17@indiana.edu.) We'll send 14 open-ended questions by email (email interview). Your input to this study will be greatly appreciated. Thank you so much again. Inkeys

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

title: User talk:Sam86~enwikibooks


text:
Sanskrit/Everyday Phrases/Day to Day Conversation in Sanskrit

Sambhashanani
 * 1) /Somvasare Karyalaye/: in Office on Monday
 * 2) /Bhojan Kaal/: at lunch hours
 * 3) /Mudrak Yantram/: printer

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


text:
User talk:59.144.65.174

Welcome!
Welcome to Wikibooks, a collection of open-content textbooks! You don't have to log in to read or edit articles on Wikibooks, but creating an account is quick, free and non-intrusive, requires no personal information, and gives you many benefits, including:
 * The use of a username of your choice
 * The ability to view all your contributions via a "My contributions" link
 * Your own user page
 * Your own talk page which, if you choose, also allows users to send you messages without knowing your e-mail address
 * The use of your own personal watchlist to which you can add articles that interest you
 * The ability to rename pages.
 * The ability to upload images
 * The ability to customize the appearance and behavior of the website
 * The eligibility to become an administrator
 * The right to be heard in votes and elections
 * Your IP address will no longer be visible to other users.

We hope that you choose to become a Wikibookian and create an account. Feel free to ask me any questions you may have on my talk page. By the way, make sure to sign your posts and comments with four tildes (~~~~), which will let others know who left it.

-- Herby talk thyme 11:33, 14 January 2007 (UTC)

title: User talk:59.144.65.174


text:
Sanskrit/Everyday Phrases/Day to Day Conversation in Sanskrit/Somvasare Karyalaye

Kim Krutam Saptahante ? = Krutam Kim Saptahante ? = Saptahante kim krutam = what was done on week end ?

 * 1) Giristhanakam gatosmi vishramaartham == Gatosmi ( Gatah Asmi = I went ) Giristhankam Vishrmaartham == Vishraamartham Giristhankam Gaosmi == went to hill station for rest
 * 2) Swalpam Gruh Karaym akarom ==Akarom Swalpam GruhKarayam == did small home work
 * 3) Ratham Karyshale Neetam DvaiMaasikSevaarthm (mayaa = by me )== ( I ) took (my )car for bimonthly service to workshop

courtsey ask back

 * 1) Bhavaan ? == you ?  ( to gent with respect )
 * 2) Bhavaanee vaa( = complementary )= Bhavaanee ? = you? ( to lady with respect)
 * 3) Youyam ? == You ? (plural)
 * 4) kim krutam tvayaa = tvayaa kim krutam ? = what was done by you ?


text:
Animal Behavior/Ch1

<< Contents page | Chapter 1 | Chapter 2 >>|

Chapter 1. History, Aims and Approaches of Animal Behavior
This chapter introduces the main topics that are covered by this field of research. A historical account discusses how we have tried to explore the behavior of humans and animals, to understand the biological constraints that impact our cognitive potential, and to make sense of the nature of human and animal personalities. As a scientific discipline Animal Behavior conforms to the rigors of the Scientific Method.
 * Definition of Animal Behavior
 * Scope of Animal Behavior
 * History of Animal Behavior
 * Scientific Method in Animal Behavior

<< Contents page | Chapter 1 | Chapter 2 >>|

title: Animal Behavior/Ch1


text:
Animal Behavior/Ch2

<< Contents page | |<< Chapter 1 | Chapter 2 | Chapter 3 >>|

Chapter 2. Development, Learning and Genetics
This chapter explores how behavior develops and changes during the lifespan of a single individual. It primarily considers the role that learned components, genetic influences, and their interactions play in the emergence of behavior.
 * Nature v Nurture
 * Development/Maturation
 * Human Cognitive Development
 * Learning and Memory
 * Behavioral Genetics

<< Contents page | |<< Chapter 1 | Chapter 2 | Chapter 3 >>|

title: Animal Behavior/Ch2


text:
Taxation in the United Kingdom/Legislation/Section 36 of the Income and Corporation Taxes Act 1988

Subsection (1) states that if an estate or an interest in land is sold subject to the right of reconveyance to the vendor, or someone connected with the vendor, then the following rule applies.

The vendor is deemed to have received as rental income the amount by which the price at which the estate or interest is sold exceeds the price at which it is to be reconveyed. If, however, the earliest date for the reconveyence is two or more years after the sale, this amount is reduced by one-fiftieth for each complete year, other than the first, in the period between the sale and the date of earliest reconveyance.

Subsection (2) deals with the situation where the date of reconveyance is not fixed. If the price of reconveyance changes depending on the date, it is taken to be the lowest price possible under the terms of the sale. If this rule leads to more corporation tax arising to the vendor than would have been the case had the actual date of reconveyance been fixed, the vendor has six years in which to make a claim for repayment of the additional tax.

Subsection (3) introduces a rule where the terms of the sale provide for the grant of a lease directly or indirectly out of the estate or interest of land to the vendor or a person connected with the vendor.

The rule is that the grant of the lease is treated as a reconvenyance of the estate or interest at a price equal to the premium for the lease and the value at the date of the sale of the right to receive a conveyance of the reversion immediately after the lease begins to run.

Subsection (4) disapplies subsection (3) where the lease is granted and begins to run within one month after the sale.

Subsection (4A) provides that an amount deemed to be the vendor's rental income under this section is treated as received on the date of the sale, and is taken into account when computing taxable rental income in the accounting period on which that date falls.

Subsection (4B) provides that, for these purposes, the sale happens when any of the following happen:

 * an unconditional contract for the sale is entered into;
 * a conditional contract for the sale becomes unconditional;
 * an option or right of pre-emption is exercised requiring the vendor to enter into an unconditional contract for the sale.

Subsection (5) provides that "connected with" in this section is construed in accordance with section 839 ICTA.


text:
Animal Behavior/Ch3

<< Contents page | |<< Chapter 2 | Chapter 3 | Chapter 4 >>|

Chapter 3. Proximate Mechanisms of Behavior
This chapter explores the most immediate biological functions that are responsible for producing a particular observation. The material aims to provide an understanding of how a behavior is elicited and coordinated. It includes a search for the impact of genetic components, physiological mechanisms, environmental conditions needed, and hormones on behavior.

 * Neuroscience
 * Sensory Biology
 * Pheromones
 * Neural Orchestration of Motor Responses
 * Behavioral Endocrinology
 * Biological Rhythms

<< Contents page | |<< Chapter 2 | Chapter 3 | Chapter 4 >>|

title: Animal Behavior/Ch3


text:
Cookbook:Fava Bean

Fava beans, also faba beans, ful, horse beans, are strong flavoured beans with tough hulls. Large fava beans are often called broad beans in English-speaking countries.

Fava beans are much used in Mediterranean, Middle Eastern, and Asian cuisines, and also feature in other cuisines.

Fava beans can be bought in the following forms:
 * Green, in the pod
 * Green, shelled and frozen
 * Dried, shelled
 * Dried, shelled and hulled, often also split

Recipes with fava beans

 * Hummus
 * Falafel

Broad beans are large fava beans, common in English, Chinese, Mediterranean, and Middle Eastern cuisines. They are eaten green in England and either green or dried elsewhere.

Seasonality
Broad bean plants started under glass or over-wintered in a protected location are ready for harvest in mid-spring. For normal crops the season starts at the end of spring and lasts through the summer. As the season progresses the beans grow larger and tougher and become encased in a thick outer skin, which is usually removed before cooking.

Out of season, green broad beans are usually available jarred, canned, or frozen.

Recipes

 * Fresh Broadbeans Salad
 * Habas con Jamon

title: Cookbook:Fava Bean


text:
Category:User la

de:Kategorie:User la eo:kategorio:uzanto la it:Categoria:Utenti la ja:カテゴリ:User la pt:Categoria:Usuário la ru:Категория:User la tr:Kategori:Kullanıcı la

title: Category:User la


text:
Haskell/Graph reduction

Notes and TODOs

 * TODO: Pour lazy evaluation explanation from ../Laziness/ into this mold.
 * TODO: better section names.
 * TODO: ponder the graphical representation of graphs.
 * No grapical representation, do it with . Pro: Reduction are easiest to perform in that way anyway. Cons: no graphic.
 * ASCII art / line art similar to the one in Bird&Wadler? Pro: displays only the relevant parts truly as graph, easy to perform on paper. Cons: Ugly, no large graphs with that.
 * Full blown graphs with @-nodes? Pro: look graphy. Cons: nobody needs to know @-nodes in order to understand graph reduction. Can be explained in the implementation section.
 * Graphs without @-nodes. Pro: easy to understand. Cons: what about currying?
 * ! Keep this chapter short. The sooner the reader knows how to evaluate Haskell programs by hand, the better.
 * First sections closely follow Bird&Wadler

Introduction
Programming is not only about writing correct programs, answered by denotational semantics, but also about writing fast ones that require little memory. For that, we need to know how they're executed on a machine, commonly given by operational semantics. This chapter explains how Haskell programs are commonly executed on a real computer and thus serves as foundation for analyzing time and space usage. Note that the Haskell standard deliberately does not give operational semantics, implementations are free to choose their own. But so far, every implementation of Haskell more or less closely follows the execution model of lazy evaluation.

In the following, we will detail lazy evaluation and subsequently use this execution model to explain and exemplify the reasoning about time and memory complexity of Haskell programs.

Reductions
Executing a functional program, i.e. evaluating an expression, means to repeatedly apply function definitions until all function applications have been expanded. Take for example the expression  together with the definitions

One possible sequence of such reductions is

pythagoras 3 4 ⇒ square 3 + square 4  (pythagoras) ⇒   (3*3) + square 4   (square) ⇒       9 + square 4   (*) ⇒       9 + (4*4)      (square) ⇒       9 + 16         (*) ⇒         25

Every reduction replaces a subexpression, called reducible expression or redex for short, with an equivalent one, either by appealing to a function definition like for  or by using a built-in function like. An expression without redexes is said to be in normal form. Of course, execution stops once reaching a normal form which thus is the result of the computation.

Clearly, the fewer reductions that have to be performed, the faster the program runs. We cannot expect each reduction step to take the same amount of time because its implementation on real hardware looks very different, but in terms of asymptotic complexity, this number of reductions is an accurate measure.

Reduction Strategies
There are many possible reduction sequences and the number of reductions may depend on the order in which reductions are performed. Take for example the expression. One systematic possibility is to evaluate all function arguments before applying the function definition

fst (square 3, square 4) ⇒ fst (3*3, square 4)  (square) ⇒ fst ( 9, square 4)  (*) ⇒ fst ( 9, 4*4)       (square) ⇒ fst ( 9, 16 )       (*) ⇒ 9                    (fst)

This is called an innermost reduction strategy and an innermost redex is a redex that has no other redex as subexpression inside.

Another systematic possibility is to apply all function definitions first and only then evaluate arguments:

fst (square 3, square 4) ⇒ square 3             (fst) ⇒ 3*3                  (square) ⇒ 9                    (*)

which is named outermost reduction and always reduces outermost redexes that are not inside another redex. Here, the outermost reduction uses fewer reduction steps than the innermost reduction. Why? Because the function  doesn't need the second component of the pair and the reduction of   was superfluous.

Termination
For some expressions like

no reduction sequence may terminate and program execution enters a neverending loop, those expressions do not have a normal form. But there are also expressions where some reduction sequences terminate and some do not, an example being

fst (42, loop) ⇒ 42                   (fst) fst (42, loop) ⇒ fst (42,1+loop)      (loop) ⇒ fst (42,1+(1+loop))  (loop) ⇒ ...

The first reduction sequence is outermost reduction and the second is innermost reduction which tries in vain to evaluate the  even though it is ignored by   anyway. The ability to evaluate function arguments only when needed is what makes outermost optimal when it comes to termination:

 * Theorem (Church Rosser II): If there is one terminating reduction, then outermost reduction will terminate, too.

Graph Reduction (Reduction + Sharing)
Despite the ability to discard arguments, outermost reduction doesn't always take fewer reduction steps than innermost reduction:

square (1+2) ⇒ (1+2)*(1+2)          (square) ⇒ (1+2)*3              (+) ⇒     3*3              (+) ⇒      9               (*)

Here, the argument  is duplicated and subsequently reduced twice. But because it is one and the same argument, the solution is to share the reduction  with all other incarnations of this argument. This can be achieved by representing expressions as graphs. For example,

__________ |  |     ↓ ◊ * ◊    (1+2)

represents the expression. Now, the outermost graph reduction of  proceeds as follows

square (1+2) ⇒ __________           (square) |  |     ↓ ◊ * ◊    (1+2) ⇒ __________           (+) |  |     ↓ ◊ * ◊     3 ⇒ 9                    (*)

and the work has been shared. In other words, outermost graph reduction now reduces every argument at most once. For this reason, it always takes fewer reduction steps than the innermost reduction, a fact we will prove when reasoning about time.

Sharing of expressions is also introduced with  and   constructs. For instance, consider Heron's formula for the area of a triangle with sides,  and  :

Instantiating this to an equilateral triangle will reduce as

area 1 1 1 ⇒       _____________________             (area) | |    |     |      ↓ sqrt (◊*(◊-a)*(◊-b)*(◊-c)) ((1+1+1)/2) ⇒       _____________________             (+),(+),(/) | |    |     |      ↓ sqrt (◊*(◊-a)*(◊-b)*(◊-c)) 1.5 ⇒ ... ⇒ 0.433012702

which is $$\sqrt3/4$$. Put differently, -bindings simply give names to nodes in the graph. In fact, one can dispense entirely with a graphical notation and solely rely on  to mark sharing and express a graph structure.

Any implementation of Haskell is in some form based on outermost graph reduction which thus provides a good model for reasoning about the asymptotic complexity of time and memory allocation. The number of reduction steps to reach normal form corresponds to the execution time and the size of the terms in the graph corresponds to the memory used.

Pattern Matching
So far, our description of outermost graph reduction is still underspecified when it comes to pattern matching and data constructors. Explaining these points will enable the reader to trace most cases of the reduction strategy that is commonly the base for implementing non-strict functional languages like Haskell. It is called call-by-need or lazy evaluation in allusion to the fact that it "lazily" postpones the reduction of function arguments to the last possible moment. Of course, the remaining details are covered in subsequent chapters.

To see how pattern matching needs specification, consider for example the boolean disjunction

and the expression with a non-terminating. The following reduction sequence or (1==1) loop ⇒ or (1==1) (not loop)       (loop) ⇒ or (1==1) (not (not loop)) (loop) ⇒ ...

only reduces outermost redexes and therefore is an outermost reduction. But

or (1==1) loop ⇒ or True  loop              (or) ⇒ True

makes much more sense. Of course, we just want to apply the definition of  and are only reducing arguments to decide which equation to choose. This intention is captured by the following rules for pattern matching in Haskell: Thus, for our example, we have to reduce the first argument to either   or  , then evaluate the second to match a variable   pattern and then expand the matching function definition. As the match against a variable always succeeds, the second argument will not be reduced at all. It is the second reduction section above that reproduces this behavior.
 * Left hand sides are matched from top to bottom
 * When matching a left hand side, arguments are matched from left to right
 * Evaluate arguments only as much as needed to decide whether they match or not.

With these preparations, the reader should now be able to evaluate most Haskell expressions. Here are some random encounters to test this ability:

Higher Order Functions
The remaining point to clarify is the reduction of higher order functions and currying. For instance, consider the definitions where both  and   are only defined with one argument. The solution is to see multiple arguments as subsequent applications to one argument, this is called currying To reduce an arbitrary application, call-by-need first reduce expression1 until this becomes a function whose definition can be unfolded with the argument. Hence, the reduction sequences are

a ⇒ (id (+1)) 41          (a) ⇒ (+1) 41              (id) ⇒ 42                   (+) b ⇒ (twice (+1)) (13*3)   (b) ⇒ ((+1).(+1) ) (13*3)  (twice) ⇒ (+1) ((+1) (13*3))   (.) ⇒ (+1) ((+1) 39)       (*) ⇒ (+1) 40              (+) ⇒ 41                   (+)

Admittedly, the description is a bit vague and the next section will detail a way to state it clearly.

While it may seem that pattern matching is the workhorse of time intensive computations and higher order functions are only for capturing the essence of an algorithm, functions are indeed useful as data structures. One example are difference lists that permit concatenation in $$O(1)$$ time, another is the representation of a stream by a fold. In fact, all data structures are represented as functions in the pure lambda calculus, the root of all functional programming languages.

''Exercises! Or not? Diff-Lists Best done with  but this requires knowledge of the fold example. Oh, where do we introduce the foldl VS. foldr example at all? Hm, Bird&Wadler sneak in an extra section "Meet again with fold" for the (++) example at the end of "Controlling reduction order and space requirements" :-/ The complexity of (++) is explained when arguing about .''

Weak Head Normal Form
To formulate precisely how lazy evaluation chooses its reduction sequence, it is best to abandon equational function definitions and replace them with an expression-oriented approach. In other words, our goal is to translate function definitions like  into the form. This can be done with two primitives, namely case-expressions and lambda abstractions.

In their primitive form, case-expressions only allow the discrimination of the outermost constructor. For instance, the primitive case-expression for lists has the form

case expression of  []   -> ...   x:xs -> ...

Lambda abstractions are functions of one parameter, so that the following two definitions are equivalent

f x = expression f  = \x -> expression

Here is a translation of the definition of to case-expressions and lambda-abstractions: Assuming that all definitions have been translated to those primitives, every redex now has the form of either
 * a function application
 * or a case-expression

lazy evaluation.

 * Weak Head Normal Form:An expression is in weak head normal form, iff it is either
 * a constructor (possibly applied to arguments) like,   or
 * a built-in function applied to too few arguments (perhaps none) like  or.
 * or a lambda abstraction.

functions types cannot be pattern matched anyway, but the devious seq can evaluate them to WHNF nonetheless. "weak" = no reduction under lambdas. "head" = first the function application, then the arguments.

Strict and Non-strict Functions
''A non-strict function doesn't need its argument. A strict function needs its argument in WHNF, as long as we do not distinguish between different forms of non-termination ( doesn't need its argument, for example).''

Controlling Space
"Space" here may be better visualized as traversal of a graph. Either a data structure, or an induced dependencies graph. For instance : Fibonacci(N) depends on : Nothing if N = 0 or N = 1 ; Fibonacci(N-1) and Fibonacci(N-2) else. As Fibonacci(N-1) depends on Fibonacci(N-2), the induced graph is not a tree. Therefore, there is a correspondence between implementation technique and data structure traversal :

The classical : Is a tree traversal applied to a directed acyclic graph for the worse. The optimized version : Uses a DAG traversal. Luckily, the frontier size is constant, so it's a tail recursive algorithm.

NOTE: The chapter ../Strictness is intended to elaborate on the stuff here.

NOTE: The notion of strict function is to be introduced before this section.

Now's the time for the space-eating fold example:

Introduce  and   that can force an expression to WHNF. =>.

Tricky space leak example:

Since order of evaluation in Haskell is only defined by data dependencies and neither  depends on   nor vice versa, either may be performed first. This means that depending on the compiler one version runs on O(1) space while the other in O(n) (perhaps a sufficiently smart compiler could optimize both versions to O(1) but GHC 9.8.2 doesn't do that on my machine—only the second one runs in O(1) space).

Sharing and CSE
''NOTE: overlaps with section about time. Hm, make an extra memoization section?''

How to share "Lambda-lifting", "Full laziness". The compiler should not do full laziness.

A classic and important example for the trade between space and time: That's why the compiler should not do common subexpression elimination as optimization. (Does GHC?).

Tail recursion
''NOTE: Does this belong to the space section? I think so, it's about stack space.''

Tail recursion in Haskell looks different.

Reasoning about Time
Note: introducing strictness before the upper time bound saves some hassle with explanation?

Lazy eval < Eager eval
When reasoning about execution time, naively performing graph reduction by hand to get a clue on what's going on is most often infeasible. In fact, the order of evaluation taken by lazy evaluation is difficult to predict by humans, it is much easier to trace the path of eager evaluation where arguments are reduced to normal form before being supplied to a function. But knowing that lazy evaluation always performs fewer reduction steps than eager evaluation (present the proof!), we can easily get an upper bound for the number of reductions by pretending that our function is evaluated eagerly.

Example:

=> eager evaluation always takes n steps, lazy won't take more than that. But it will actually take fewer.

Throwing away arguments
Time bound exact for functions that examine their argument to normal form anyway. The property that a function needs its argument can concisely be captured by denotational semantics:

f ⊥ = ⊥

Argument in WHNF only, though. Operationally: non-termination -> non-termination. (this is an approximation only, though because f anything = ⊥ doesn't "need" its argument). Non-strict functions don't need their argument and eager time bound is not sharp. But the information whether a function is strict or not can already be used to great benefit in the analysis.

It's enough to know.

Other examples:
 * vs.  with ⊥.
 * Can  be analyzed only with ⊥? In any case, this example is too involved and belongs to ../Laziness.

Persistence & Amortization
NOTE: this section is better left to a data structures chapter because the subsections above cover most of the cases a programmer not focusing on data structures / amortization will encounter.

Persistence = no updates in place, older versions are still there. Amortization = distribute unequal running times across a sequence of operations. Both don't go well together in a strict setting. Lazy evaluation can reconcile them. Debit invariants. Example: incrementing numbers in binary representation.

Implementation of Graph reduction
Small talk about G-machines and such. Main definition:

closure = thunk = code/data pair on the heap. What do they do? Consider $$(\lambda x.\lambda y.x+y) 2$$. This is a function that returns a function, namely $$\lambda y.2+y$$ in this case. But when you want to compile code, it's prohibitive to actually perform the substitution in memory and replace all occurrences of $$x$$ by 2. So, you return a closure that consists of the function code $$\lambda y.x+y$$ and an environment $$\{x=2\}$$ that assigns values to the free variables appearing in there.

GHC (?, most Haskell implementations?) avoid free variables completely and use supercombinators. In other words, they're supplied as extra-parameters and the observation that lambda-expressions with too few parameters don't need to be reduced since their WHNF is not very different.

Note that these terms are technical terms for implementation stuff, lazy evaluation happily lives without them. Don't use them in any of the sections above.

title: Haskell/Graph reduction


text: Template:Cite conference

title: Template:Cite conference


text:
Horticulture/Dianthus

Dianthus is a genus of about 300 species of flowering plants in the family Caryophyllaceae, native mainly to Europe and Asia, with a few species extending south to north Africa, and one species (D. repens) in arctic North America. Common names include carnation (D. caryophyllus), pink (D. plumarius and related species) and sweet william (D. barbatus). The name Dianthus is from the Greek words dios ("god") and anthos ("flower"), and was cited by the Greek botanist Theophrastus.

The color pink may actually be named after the flower. The origin of the flower name 'pink' is unknown.

Description
The species are mostly perennial herbs, a few are annual or biennial, and some are low subshrubs with woody basal stems. Stems are swollen at the nodes, and contain a clear sap.

The leaves are opposite and simple with entire margins and petioles that wrap around the stem, mostly linear and often strongly glaucous grey-green to blue-green.

The flowers are solitary or in panicles, with leafy bracts beneath and five petals, typically with a frilled or notched margin. In almost all species they are pale to dark pink, but at least one species (D. knappii) has yellow flowers with a purple centre.

Growing conditions
Moist, well-drained, not overly rich soils, full sun.

Species

 * ../Dianthus alpinus/
 * ../Dianthus amurensis/
 * ../Dianthus anatolicus/
 * ../Dianthus arenarius/
 * ../Dianthus armeria/ - Deptford Pink
 * ../Dianthus barbatus/ - Sweet William
 * ../Dianthus biflorus/
 * ../Dianthus brevicaulis/
 * ../Dianthus callizonus/
 * ../Dianthus campestris/
 * ../Dianthus capitatus/
 * ../Dianthus carthusianorum/ - Carthusian Pink
 * ../Dianthus caryophyllus/ - Carnation or Clove Pink
 * ../Dianthus chinensis/ - China pink
 * ../Dianthus cruentus/
 * ../Dianthus deltoides/ - Maiden Pink
 * ../Dianthus erinaceus/
 * ../Dianthus freynii/
 * ../Dianthus fruticosus/
 * ../Dianthus furcatus/
 * ../Dianthus gallicus/ - French Pink or Jersey Pink
 * ../Dianthus giganteus/
 * ../Dianthus glacialis/
 * ../Dianthus gracilis/
 * ../Dianthus graniticus/
 * ../Dianthus gratianopolitanus/ - Cheddar Pink
 * ../Dianthus haematocalyx/
 * ../Dianthus knappii/
 * ../Dianthus lusitanus/
 * ../Dianthus microlepsis/
 * ../Dianthus monspessulanus/
 * ../Dianthus myrtinervius/
 * ../Dianthus nardiformis/
 * ../Dianthus nitidus/
 * ../Dianthus pavonius/
 * ../Dianthus petraeus/
 * ../Dianthus pinifolius/
 * ../Dianthus plumarius/ - Wild Pink
 * ../Dianthus pungens/
 * ../Dianthus repens/ - Boreal Carnation
 * ../Dianthus scardicus/
 * ../Dianthus seguieri/
 * ../Dianthus simulans/
 * ../Dianthus spiculifolius/
 * ../Dianthus squarrosus/
 * ../Dianthus subacaulis/
 * ../Dianthus superbus/ - Large Pink
 * ../Dianthus sylvestris/
 * ../Dianthus zonatus/

Uses
Some species are grown for cut flowers, but most as ground covers or border plants.

Pests and diseases
Bacterial ../Wilts/ Bacterial ../Leaf Spots/ ../Fasciation/ ../Crown Galls/ ../Leaf Spots/ ../Leaf Blotch/ ../Blight/ ../Bud Rot/ ../Wilts/ ../Stem Rots/ ../Crown Rot/
 * Pseudomonas caryophylli
 * Pseudomonas woodsii
 * Xanthomonas oryxae var. dianthi
 * Corynebacterium fascians
 * ../Agrobacterium tumeifasciens/
 * Septoria dianthi
 * Zygophiala jamaicensis
 * ../Botrytis cinerea/
 * Fusarium poae
 * ../Armillaria mellea/
 * Fusarium oxysporum var. barbari
 * Fusarium oxysporum var. dianthi
 * Fusarium roseum var. cerealis
 * Phialophora cinerescens
 * Alternaria dianthi
 * ../Pellicularia filamentosa/

../Rust/ ../Smut/ ../Viri/ Leaf Streak Mosaic Mottle Ringspot ../Nematodes/ ../Aphids/ ../Grasshoppers/
 * Puccinia arenariae
 * Uromyces dianthi
 * Ustilago violacea
 * Carnation Streak Virus
 * Carnation Mosaic Virus (vectored by ../Myzus persicae/)
 * Carnation Mottle Virus
 * Carnation Ringspot Virus
 * ../Meliodgyne incognita/
 * Foxglove Aphid: ../Acyrthosiphon solani/
 * Bean Aphid: ../Aphis fabae/
 * Green Peach Aphid: ../Myzus persicae/

../Thrips/ ../Caterpillars/ ../Mites/ ../Sowbugs/
 * Western Flower Thrips: ../Frankliniella occidentalis/
 * Onion Thrips: ../Thrips tabaci/
 * Obliquebanded Leafroller: ../Choristoneura rosaceana/
 * Corn Earworm: ../Heliothis zea/
 * Variegated Cutworm: ../Peridroma saucia/
 * Cabbage Looper: ../Trichoplusia ni/
 * Greenhouse Leaftier: ../Udea rubigalis/
 * Cabbage Moth, Double-striped Pug, Large Yellow Underwing and The Lychnis Also three species of Coleophora case-bearers feed exclusively on Dianthus: C. dianthi, C. dianthivora and C. musculella (which feeds exclusively on D. suberbus).
 * Twospotted Spider Mite: ../Tetranychus urticae/

../Slugs and Snails/

title: Horticulture/Dianthus


text:
Horticulture/Galium

Galium is a large genus of annual and perennial herbaceous plants in the family Rubiaceae, with about 400 species occurring in the temperate zones of both the Northern and Southern Hemispheres. The species are variously known as bedstraw (most species), goosegrass (G. aparine), cleavers (G. tricornutum, G. aparine) and woodruff (G. odoratum).

Species

 * ../Galium aetnicum/
 * ../Galium album/ - Upright Bedstraw
 * ../Galium aparine/ - Goosegrass, Cleavers, or Stickywilly
 * ../Galium arenarium/ - Sand Bedstraw
 * ../Galium aristatum/ - False Baby's Breath
 * ../Galium baldense/
 * ../Galium boreale/ - Northern Bedstraw
 * ../Galium corrudaefolium/
 * ../Galium debile/ - Slender Marsh Bedstraw
 * ../Galium elongatum/ - Great Marsh Bedstraw
 * ../Galium firmum/
 * ../Galium fleurotii/
 * ../Galium glaucum/ - Glaucous Bedstraw
 * ../Galium humifusum/
 * ../Galium hypocarpium/
 * ../Galium longifolium/
 * ../Galium lucidum/
 * ../Galium mollugo/ - Hedge Bedstraw
 * ../Galium nigroramosum/
 * ../Galium normanii/
 * ../Galium obliquum/
 * ../Galium odoratum/ - Woodruff
 * ../Galium oelandicum/
 * ../Galium olympicum/
 * ../Galium palustre/ - Common Marsh Bedstraw
 * ../Galium parisiense/ - Wall Bedstraw
 * ../Galium pumilum/ - Slender Bedstraw
 * ../Galium rotundifolium/
 * ../Galium rubrum/
 * ../Galium saxatile/ - Heath Bedstraw
 * ../Galium schultesii/
 * ../Galium spurium/ - False Cleavers
 * ../Galium sterneri/ - Limestone Bedstraw
 * ../Galium suecicum/ - Swedish Bedstraw
 * ../Galium sylvaticum/ - Wood Bedstraw
 * ../Galium tricornutum/ - Corn Cleavers
 * ../Galium trifidum/
 * ../Galium triflorum/ - Conifer Bedstraw
 * ../Galium uliginosum/ - Fen Bedstraw
 * ../Galium valdepilosum/
 * ../Galium verum/ - Lady's Bedstraw

Pests and diseases

 * List of Lepidoptera which feed on Galium.

title: Horticulture/Galium


text:
Taxation in the United Kingdom/Legislation/Section 38 of the Income and Corporation Taxes Act 1988

Subsection (5) provides that in relation to Scotland, the word "term" in relation to the duration of a lease

Subsection (7) notes that the section is subject to transitional rules and savings on Paragraphs 2 and 3 of Schedule 30 to ICTA.


text:
OpenGL Programming/Installation/Mac

OpenGL was deprecated in macOS 10.14, but at least in macOS 10.15, OpenGL and GLUT are still available

Use GLUT and OpenGL from within Xcode:

 * Open Xcode located in "/Developer/Applications/"
 * Choose "New Project" from the file menu
 * Choose "Command Line Tool" under the Application template for Mac OS X
 * Choose type "C++"
 * Enter your desired project name and directory and click create
 * In the "Linked Frameworks and Libraries" area click the "+" button, and select "OpenGL.framework"
 * Repeat for "GLUT.framework"

When #including OpenGL & GLUT header files (but not the regular ones like iostream) within Xcode, make sure to do so like this:

#include  #include   #include

in other words:

#include

OpenGL 프로그래밍/설치/맥

title: OpenGL Programming/Installation/Mac


text:
User:Herraotic/Community Portal

{| cellspacing=3 width="100%"
 * colspan=2 bgcolor="#fffffc" style="border:1px solid #cfcfcf;padding:1em;padding-top:0.5em;padding-bottom:0em;"|

=

 * - valign="top"
 * width="50%" bgcolor="#f0f0ff" style="border:1px solid #c6c9ff;padding:1em;padding-top:0.5em;"|

=

 * width="50%" bgcolor="#ffffec" style="border:1px solid #faf9b2;padding:1em;padding-top:0.5em;"|

=

 * - valign="top"
 * width="50%" bgcolor="#eeffee" style="border:1px solid #99ff99;padding:1em;padding-top:0.5em;"|

=

 * width="50%" bgcolor="#ffeeee" style="border:1px solid #ffcccc;padding:1em;padding-top:0.5em;"|

=

 * colspan=2 bgcolor="#fffffc" style="border:1px solid #cfcfcf;padding:1em;padding-top:0.5em;padding-bottom:0em;"|
 * }
 * }

title: User:Herraotic/Community Portal


text:
User talk:Thunderhead

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * If you're 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 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 Staff Lounge with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * 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 Staff lounge, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be an idea if you add this page to your "watchlist" so that you can see when any new information is posted there.

Good luck! -- Herby talk thyme 19:10, 14 January 2007 (UTC)

title: User talk:Thunderhead


text:
User talk:220.226.25.133

Thanks for experimenting with Wikibooks. Your test worked, and has now been removed. Please use Sandbox for any other tests you want to do, since testing material in modules will normally be removed quickly. Please see the welcome page if you would like to learn more about contributing to our project. Thanks. -- Herby talk thyme 19:23, 14 January 2007 (UTC)

title: User talk:220.226.25.133


text:
User:Herraotic/Intermediate Mathematics

Welcome to Intermediate Mathematics
The objective of this book is to provide a thorough explanation of intermediate mathematics also referred to as GCSE Higher Mathematics, though it could also be used for any other course with similar requirements.

This book is currently not based on a specification as we are attempting to cover all topics, from all perspectives.

title: User:Herraotic/Intermediate Mathematics


text:
Talk:Nanotechnology/Perspective

=possible additions=

Hot physics

 * The M-index measuring the 'hottest' areas in physics shows its all nano.

title: Talk:Nanotechnology/Perspective


text:
Dutch/Lesson 14

The -ing problem
In English the -ing form is used extensively for a number of rather different functions. Although Dutch also has an ending -ing it does not correspond to the English one in most situations:

 * 1) he is singing
 * hij is aan het zingen
 * 1) he walked out of the room singing
 * hij liep zingend de kamer uit
 * 1) singing is her profession
 * zang is haar beroep

In the above examples singing is used as:

 * 1) part of the present continuous tense
 * 2) as a participle
 * 3) as a verbal noun (gerund).

In Dutch different nouns are used in these three cases none of which ends in -ing

Properly rendering -ing forms in Dutch may therefore present a bit of a problem for an English speaker.

Continuous tenses
In the strict sense Dutch does not have continuous times and in many cases where English uses them Dutch will use a simple present or past.

 * he was walking to school when he saw the UFO
 * hij liep naar school toen hij de vliegende schotel zag
 * hij was onderweg naar school toen hij de vliegende schotel zag

To emphasize continuity Dutch can use the infinitive as a neutral noun preceded by the preposition aan:

 * hij was aan het wandelen
 * he was going for a walk
 * zij waren aan het verhuizen
 * they were busy moving

Another common construction is to use an auxiliary verb like zitten,staan,liggen, lopen

 * de voetballer liep op de scheidsrechter te schelden.
 * the soccer player walked around fuming at the umpire.
 * ik zat te denken
 * I was just thinking (on my chair)

The "on my chair" or "on my feet" distinction is often of negligible importance and the verbs zitten, liggen etc. are used more or less interchangeably as auxiliaries of the continuous aspect.

Present participles
The present participle in Dutch is formed by adding -d(e) (not: -ing) to the infinitive:

 * lopen – lopend(e)
 * staan – staand

As in English it can be used as adjective:

 * flying saucer
 * vliegende schotel

But it is rarely used as a (static) predicate:

 * kinine is koortswerend
 * quinine has the property of abating fever

Using it in a continuous tense construction as in English sounds odd and rather ironic.

 * ach, was jij schrijvende?
 * roughly: Wow, did I catch you in writing mode?

Present participles are seldom used to initiate a clause as is common in English:

 * The second car moving at greater speed could not stop
 * De tweede auto die sneller reed kon niet stoppen
 * De tweede, sneller rijdende auto kon niet stoppen

Either the participle rijdend is used as a preceding adjective or it is avoided by paraphrase.

Gerunds
The term gerund is seldom used in Dutch grammar. One could argue that Dutch does not have one in the English sense of the word, despite the presence of a rich variety of verbal nouns.

First of all, in many cases Dutch uses the infinitive as a neutral noun where English uses a gerund in -ing and one could argue that this is the Dutch gerund:

 * addition and subtraction are the basis of arithmetic
 * optellen en aftrekken vormen de grondslag van het rekenen

There are subtle differences associated with the use or omission of the neutral article het, but the same holds in English:

 * singing is healthy – zingen is gezond
 * the singing finally ended – het zingen hield eindelijk op

There is typically no plural. In times past the word did get inflected -as Latin gerunds do-, e.g.:

 * Tot ziens! - See you!
 * Willens en wetens - Deliberately.
 * Een uur gaans - an hour on foot

This -s ending is an old genitive.

The genitive of the gerund actually enjoys a modicum of productivity is expressions with ''tot ... toe'':

 * tot vervelens toe - until boredom resulted, ad nauseam
 * tot bloedens toe - until bleeding resulted
 * Mijn ziel is zeer bedroefd, tot stervens toe (Matthew 26:38) - until death.

Suffix -ing
Many Dutch verbs do form a (feminine) verbal noun in -ing, but it usually corresponds more to an English noun with (latinate) ending -ion than to a gerund with -ing:

 * deze aftrekking is niet juist
 * this subtraction is incorrect

Note that de aftrekking denotes a particular case of subtraction, where het aftrekken denotes the general process of subtracting

The formation of a verbal noun is -ing is quite common, particularly for verbs with prefixes like ver-, be-, af- etc. It is also a productive suffix, which means that newly formed verbs tend to form their verbal noun this way. It has a plural in -en:

 * zegening – zegeningen
 * blessing – blessings

However, the -ing form is certainly not as ubiquitous as in English where only a few verbs like can or must do not possess one. Not all Dutch verbs have an -ing form as there is a number of older ways to form verbal nouns, although most of them are no longer productive.

The -ing verbal noun is feminine and occurs frequently with "ter" (te + the old feminine dative der), which translates roughly into "in order to".
 * Hij besprak maatregelen ter verbetering daarvan - He discussed methods that could be used to improve that.

This process is still productive:
 * ter wikifiëring -- to be wikified

Interestingly, this means that even north of the Great Rivers feminine gender is not quite dead yet...

Verbal stems
Many strong verbs have a verbal noun based on the stem of the verb with ablaut (vowel change) and lack an -ing form:

 * helpen – de hulp
 * na drie dagen kwam er eindelijk hulp
 * after three days help finally arrived

 * wreken – de wraak:
 * wraak is zoet
 * revenge is sweet

 * zingen – de zang
 * hij studeert zang
 * he is studying voice

Notice that in these cases forms in -ing like *helping, *zinging do not exist in Dutch.

Sometimes the vowel does not change:

 * lopen – de loop
 * in de loop van het proces
 * in the course of the process

These nouns are typically common gender and often lack a plural, but this does not always hold. For example a weak verb like werken has het werk and a plural de werken

Other endings
Some verbs add -t or -st to the stem, a process not entirely unfamiliar in English:

 * vliegen – de vlucht – plural: de vluchten
 * to fly – the flight

 * telen – teelt (no plural)
 * cultivate – cultivation

At times, there is more than one verbal noun:

 * graven – graf – gracht (<graft 1600s)
 * to dig – grave – canal

Plurals:
 * graf – graven
 * gracht – grachten

After nasals -st is more common:

 * dienen – de dienst – plural: de diensten
 * to serve – service

 * komen – de komst – no plural
 * come – advent, arrival

 * vangen – de vangst
 * catch – catch
 * de vangst van kabeljauw bij de Canadese kust is gestaakt
 * cod fishing has been suspended off the coast of Canada

A few verbs have -te:

 * behoeven – de behoefte
 * need – need
 * baren – geboorte
 * give birth – birth

Plurals have -s: behoeftes, geboortes, sometimes also -n:

 * denken – gedachten, gedachtes
 * think – thought(s)

Other verbs have -nis, -enis or -tenis

 * kennen – kennis
 * to know – knowledge / acquaintance
 * gebeuren – gebeurtenis
 * to happen – event
 * bekennen – bekentenis
 * to confess – confession
 * hinderen – hindernis
 * to obstruct / bother – hindrance

Plurals get -sen:
 * kennissen (acquaintances), bekentenissen

In English this ending is more common after adjectives like bald(ness), good(ness). In Dutch this is rare:

 * sad – sadness
 * droef – droefenis

Usually Dutch has -heid in such cases: droefheid

Dutch also has latinate endings—as English does—that sometimes compete with the Germanic ones:

The Latin -tio(n) ending is -tie in Dutch and usually pronounced as [tsi] or [si] ('see')

 * communiceren – communicatie
 * communicate – communication

but:

 * archiveren – archivering
 * to archive – archiving

Prefix ge-
Another way to form a verbal noun is to add ge- to a stem. It forms a neuter noun from verbs without prefixes.

 * vallen – het geval – de gevallen
 * to fall – the case
 * missen – het gemis - (no plural)
 * to miss – the lack, missing
 * spreken – het gesprek – de gesprekken
 * to speak – the conversation
 * voelen – het gevoel – de gevoelens
 * to feel – the feeling

This type is still productive, at least for verbs that do not carry prefixes. Newly formed nouns carry the connotation of annoying repetition and they usually have no plural:

 * dat onophoudelijk geblaf moet afgelopen zijn!
 * enough of that incessant barking!
 * hij viel op het toneel: gelach en boegeroep in het publiek...
 * he fell on stage: laughter and boos in the audience...

 * wat een gedoe!
 * what a hassle!

Notice the difference with the past participle:

 * gelach – gelachen
 * laughing,laughter – laughed

Verbal nouns with ge- tend to have a dysphemic connotation and some are better avoided by a non-native speaker:

 * gezeur, geëtter, gezeik, gezwam (all ~ bull s#$t)

 * zeuren – to nag
 * etter – puss
 * zeik – urine (four letters..)
 * zwam – fungus

Subjects and objects
As in English the -er suffix denotes the subject of the verb:

 * geven – gever
 * to give – giver

As in English the plural is in -s: gevers.

There usually is a feminine version in -ster as well, although under feminist influence it is under considerable pressure especially for functions in society:

 * voorzitten – voorzitter – voorzitster
 * to chair a meeting – chairman – chairwoman

Voorzitter is increasingly used, regardless the gender of the chairperson.

There are other feminine endings, e.g. -eres: (plural -eressen)

 * zingen – zanger – zangeres
 * to sing – singer (m) – singer (f)

There is also an infrequent -sel suffix indicating an object, e.g.:

 * scheppen – schepping - schepper - schepsel
 * to create – creation - creator – creature

Note that in this case English has completely shifted to Latin roots and endings where Dutch has remained faithful to its Germanic roots altogether, at least in religious context. Otherwise creation is often creatie.

The number and type of available verbal nouns differs from verb to verb.

Verbal adjectives
Apart from the two participles the verb can form various adjectives as it can in English. One suffix that corresponds to the English latinate ending -able is -baar:

 * verstaan – verstaanbaar
 * understand – understandable

Another suffix -heid (cf. English -hood) can be added to turn the adjective into a (feminine) noun:

 * danken – dankbaar – dankbaarheid
 * to thank – grateful – gratitude

The -heid suffix (plural -heden) can also be used behind participles.

 * bergen - geborgen – geborgenheid
 * to secure – secured, safe – feeling at ease
 * opletten – oplettend – oplettendheid
 * to wacht out – attentive – attention

There is also a suffix -elijk, cognate with -ly. (The 'ij' is usually pronounced as a schwa.)

 * bewerken – bewerkelijk
 * to process -requiring much work
 * sterven – sterfelijk - sterfelijkheid
 * to die – mortal - mortality

title: Dutch/Lesson 14


text:
Cookbook:Victoria Sandwich

| Dessert | Cuisine of the United Kingdom

The Victoria sandwich (also known as the Victoria sponge) is a Victorian cake that is popular in the UK.

Ingredients

 * 170 g (⅔ cup or 6 oz) self-raising flour
 * 170 g (⅔ cup or 6 oz) unsalted butter or margarine
 * 170 g (⅔ cup or 6 oz) caster sugar
 * 3 eggs (170 g without shell)
 * 1 tsp vanilla essence
 * Fruit jam
 * Whipped cream or buttercream

Equipment

 * 1 mixing bowl
 * 1 wooden spoon
 * 1 table knife
 * 1 palette knife
 * 2 ea. 18 cm (7 in) circular cake pans
 * 1 cooling rack

Procedure

 * 1) Preheat the oven to 200°C (400°F or Gas Mark 6).
 * 2) Cream the butter and sugar into a bowl and mix with a wooden spoon until softened.
 * 3) Add the 3 eggs, the vanilla essence, and the flour and mix until smooth.
 * 4) Divide the mixture between the two greased cake pans.
 * 5) Bake in the oven for 20–30 minutes (10–15 in a fan-assisted oven) until firm to the touch.
 * 6) Leave to cool completely on a cooling rack.
 * 7) Turn one cake upside down and spread jam and whipped cream over it. Then, place the second cake on top.
 * 8) Cut into wedges, and serve.

title: Cookbook:Victoria Sandwich


text: Template:Support

title: Template:Support


text: Template:Oppose

title: Template:Oppose


text:
Template:Neutral

Neutral

title: Template:Neutral


text:
Template:Comment

Comment

title: Template:Comment


text:
Template:Question

Question:

title: Template:Question


text: Template:Keep

title: Template:Keep


text:
User talk:152.1.193.141

No problem. Btw, perhaps you'll create an account? It would allow you to track pages you edit easier and don't show your IP to everyone. --Derbeth talk 22:05, 14 January 2007 (UTC)

title: User talk:152.1.193.141


text: Template:Del

title: Template:Del


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

Overview
The Quietus charm is cast by a wizard, usually upon himself, to restore his voice to its normal volume after the use of the Sonorus charm.

Extended Description
The Quietus charm is first seen used by Ludo Bagman when he is called upon to commentate the Quidditch World Cup; when the game is finished, Ludo ends his earlier Sonorus charm by invoking Quietus.

Ludo uses this spell again after commentating the events in the Triwizard Tournament.


text:
Template:B3D:N2P/VTT1/DRAWBOX

 VTT1/DRAWBOX

title: Template:B3D:N2P/VTT1/DRAWBOX


text:
User talk:64.59.144.24

Blocked

 * You have been temporarily blocked from editing for vandalism of Wikibooks. If you wish to make useful contributions, you are welcome to come back after the block expires. Az1568(Talk) 02:27, 15 January 2007 (UTC)

I have been bloked for vandel? Mistake
I am new to wiki in this way, i have never had to left a message. I have receved some thing saying: "Your username or IP address (64.59.144.24) has been blocked from editing Wikibooks by Az1568 with the following reason: Vandalism."

I dont vandellize, and i use wiki for the blender 3d tutorials, wich are very helpfull. If i could get some help, my email is old_man_enger@hotmail.com It would be helpfull, I plan on posting some very helpfull tutorils.

PS: my inernet propertys says that my IP is: 70.69.139.54 —The preceding unsigned comment was added by 64.59.144.24 (talk • contribs) 11:13, 15 Jan 2007  (UTC)

 * The IP you just edited from is indeed blocked as there has been some vandalism from someone using this IP to accesss Wikibooks. The IP address you quote above is not blocks but is not the one you used.  There is no history of editing blender 3d tutorials from this IP.  The best thing you can do is sign up with a username - you won't get blocked then (unless you vandalise - thanks -- Herby  talk thyme 11:57, 15 January 2007 (UTC)

Please stop. If you continue to vandalize pages, you will be blocked from editing Wikibooks. --Iamunknown 01:37, 28 March 2007 (UTC)

Creation of nonsense pages
If you are continuing to get messages which you feel don't apply to you then you should get a Wikibooks account so edits are attributed to you and your IP address is hiden.

Xania talk 23:10, 27 May 2007 (UTC)

title: User talk:64.59.144.24


text:
Template:B3D:N2P/VTT1/TYPESWITCH

VTT1/TYPESWITCH

title: Template:B3D:N2P/VTT1/TYPESWITCH


text: Category:Book:Indonesian/Introductory Lessons


text: Category:Book:Indonesian/Level One Lessons


text:
Category:Internal link templates

ru:Категория:Шаблоны:Внутренние ссылки sl:Category:Predloge za notranje povezave

title: Category:Internal link templates


text: Category:Book:Social Psychology

title: Category:Book:Social Psychology


text: Category:Book:Developing Genealogy Web-Pages


text: Category:Subject:Automobiles

title: Category:Subject:Automobiles


text:
User:Fgerid

Fatih's weblog

title: User:Fgerid


text:
User talk:Opadit

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * If you're 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 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 Staff Lounge with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * 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 Staff lounge, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be an idea if you add this page to your "watchlist" so that you can see when any new information is posted there.

Good luck! -- Herby talk thyme 08:05, 15 January 2007 (UTC)

Cookbook:Butter tart
Hi - I noticed your comment on this recipe. If it is actually your copyright material then we would not be able to keep the page on Wikibooks unless you were to license it to be freely available. Please take a look at Copyrights which should explain this. Feel free to ask if you need help or clarification. Regards -- Herby talk thyme 08:05, 15 January 2007 (UTC)

 * You can't copyright a recipe. What you can copyright is all the extra descriptive text and flourishes around the recipe. In this case, none of these have been replicated from the linked page (if that is indeed the original source), so no copyright issue applies. Kellen T 09:51, 21 January 2007 (UTC)

title: User talk:Opadit


text:
Talk:Technologies for Rural Development/Building houses

I have translated this page from the Spanish version that was more advanced.

It would be great to get some diagrams included. --MJBT 11:56, 15 January 2007 (UTC)


text:
ERP5 Handbook

Table of Contents

 * /Introduction/

Part I: First shock
After this part the reader should be able to install and use an ERP5 system with some business templates and hack a little bit on it. Understanding of genericity of ERP5 system should be sufficient to explore it - every installed module, creation and update of objects, setting of relations.

 * /Getting Started/
 * Let's go...
 * /User Interface/
 * /Business Templates/

Part II: Behind the User Interface
This part will introduce some important internal concepts of ERP5 - accessors, simulations, relations, used types, taken decisions in ERP5, and so on. It shall be more descriptive to ERP5 wiki - after reading this part reader shall be able to resolve simple problems, hack ERP5 with some understanding what's going on and ask good questions on ERP5 related mailing lists.

 * /From form to API/

Part III: The magic of ERP5

 * Simulations
 * Security
 * Accessors

Part IV: Become good developer

 * /Comprehensive example of simple ERP5 implementation/
 * /Indirect interactions between system components/
 * /Understanding, testing and analysing impact of your changes/
 * /Python debugger/
 * /Deep view into unit tests/

Part V: Become a happy user

 * /Understanding listboxes/

Appendixes
Appendixes shall be generated from code (low level) and installed ERP5 system (high level).

Reference documentation

 * /ERP5 Specific Zope tools/
 * /ERP5 Products/

About book

 * /Rationale/
 * /Authors/
 * Information for book authors and contributors

title: ERP5 Handbook


text:
User talk:Kpengboy

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * If you're 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 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 Staff Lounge with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * 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 Staff lounge, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be an idea if you add this page to your "watchlist" so that you can see when any new information is posted there.

Good luck! -- Herby talk thyme 12:20, 15 January 2007 (UTC)

title: User talk:Kpengboy


text:
User talk:Jackwood

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * If you're 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 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 Staff Lounge with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * 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 Staff lounge, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be an idea if you add this page to your "watchlist" so that you can see when any new information is posted there.

Good luck! -- Herby talk thyme 12:20, 15 January 2007 (UTC)

title: User talk:Jackwood


text:
Haskell/Syntactic sugar

Syntactic sugar refers to any redundant type of syntax in a programming language that is redundant to the main syntax but which (hopefully) makes the code easier to understand or write.

Functions and constructors

 * For more information, see the chapter ../More on functions/

Function Bindings

 * For more information, see the chapter ../Variables_and_functions

Lists

 * For more information, see the chapters ../Lists and tuples/, ../Lists II/, ../Lists III/, ../Understanding monads/List/ and ../MonadPlus/

Do notation

 * For more information, see the chapters ../Understanding monads/ and ../do Notation/.

Literals
A number (such as 5) in Haskell code is interpreted as, where the   is an. This allows the literal to be interpreted as,  ,   etc. Same goes with floating point numbers such as  , which are interpreted as  , where   is a. GHC has  extension, which enables the same behaviour for string types such as   and   varieties from the   modules.

Type level
The type  is equivalent to. This makes it obvious it is an application of  type constructor (kind  ) to   (kind  ).

Analogously,  is equivalent to , and the same goes with larger tuples.

Function types have the same type of sugar:  can also be written as.

Layout

 * For more information on layout, see the chapter on ../Indentation/

title: Haskell/Syntactic sugar


text:
ERP5 Handbook/Authors

 * Łukasz Nowak - Team Leader, Editor, Coordinator
 * Bartłomiej Górny - DMS, ERP5OOo, erp5_web
 * Mikołaj Antoszkiewicz - Language editorship, random sections update/commit :)

title: ERP5 Handbook/Authors


text:
User:Shufla

lukasz.nowak@ventis.com.pl

I'm Software Engineer in Ventis, where I'm implementing ERP5 based system. Privately I'm supporting Linux-based community with various media (mail, IRC, IM).

title: User:Shufla


text:
Template:C

undefined This template creates tooltips, i. e. small texts that show up when the mouse cursor hovers over a piece of text. It serves to show vocabulary translations in the language projects Freistil and Dutch. This template takes two or three parameters, making it flexible in dealing with word-by-word translations as well as more general translations that also provide the basic form of the translated term.

In the case of two parameters, the syntax is as follows: yielding the following output:

"Wörter" is the text the reader will see. The tooltip provides the text "Wörter = words".

In the case of three parameters, the syntax is as follows: yielding the output:

Here, the tooltip provides the text "das Wort = words", that is it does not repeat the original text but shows a different one. /Templates /Templates

title: Template:C


text:
User talk:Bitbert~enwikibooks

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

title: User talk:Bitbert~enwikibooks


text: Freistil

title: Freistil


text:
Non-Programmer's Tutorial for Python 2.6/Advanced Functions Example

Some people find this section useful, and some find it confusing. If you find it confusing you can skip it (or just look at the examples.) Now we will do a walk through for the following program:

Basically this program creates a positive integer multiplication function (that is far slower than the built in multiplication function) and then demonstrates this function with a use of the function. This program demonstrates the use of recursion, that is a form of iteration (repetition) in which there is a function that repeatedly calls itself until an exit condition is satisfied. It uses repeated additions to give the same result as mutiplication: e.g. 3 + 3 (addition) gives the same result as 3 * 2 (multiplication).

RUN 1
 * Question: What is the first thing the program does?
 * Answer: The first thing done is the function mult is defined with all the lines except the last one.

 * This creates a function that takes two parameters and returns a value when it is done. Later this function can be run.

 * What happens next?
 * The next line after the function,  is run.

 * What does this line do?
 * This line will assign the return value of  to the variable.

 * And what does  return?
 * We need to do a walkthrough of the  function to find out.

RUN 2
 * What happens next?
 * The variable  gets the value 3 assigned to it and the variable   gets the value 2 assigned to it.

 * And then?
 * The line  is run.  Since   has the value 2 this is false so the line   is skipped.

 * And what then?
 * The line  is run.  This line sets the local variable   to the value of  .  The value of   is 3 and the value of   is 2 so the function call is

 * So what is the value of  ?
 * We will need to run the function  with the parameters 3 and 1.

RUN 3
 * So what happens next?
 * The local variables in the  new run of the function are set so that  has the value 3 and   has the value 1. Since these are local values these do not affect the previous values of   and.

 * And then?
 * Since  has the value 1 the if statement is false, so the next line becomes.

 * What does this line do?
 * This line will assign the value of  to rest.

 * So what is that value?
 * We will have to run the function one more time to find that out. This time  has the value 3 and   has the value 0.

 * So what happens next?
 * The first line in the function to run is .   has the value 0 so the next line to run is

 * And what does the line  do?
 * This line returns the value 0 out of the function.

 * So?
 * So now we know that  has the value 0.  Now we know what the line   did since we have run the function   with the parameters 3 and 0.  We have finished running   and are now back to running  . The variable   gets assigned the value 0.

 * What line is run next?
 * The line  is run next. In this run of the function,   and   so now.

 * What happens next?
 * The line  is run.  This returns 3 from the function. This also exits from the run of the function  .  After   is called, we go back to running.

 * Where were we in ?
 * We had the variables  and   and were examining the line.

 * So what happens now?
 * The variable  get 3 assigned to it.  The next line   sets   to   or 6.

 * So now what happens?
 * The next line runs, this returns 6 from the function. We are now back to running the line  . Now the return value can be assigned to the variable.

 * What happens next?
 * The next line after the function,  is run.

 * And what does this do?
 * It prints  and the value of   which is 6. The complete line printed is

 * What is happening overall?
 * Basically we used two facts to calculate the multiple of the two numbers. The first is that any number times 0 is 0 .  The second is that a number times another number is equal to the first number plus the first number times one less than the second number .  So what happens is   is first converted into  .  Then   is converted into  .  Then we know that any number times 0 is 0 so   is 0.  Then we can calculate that   is   which is  .  Now we know what   is so we can calculate that   is   which is.

This is how the whole thing works:

mult(3, 2) 3 + mult(3, 1) 3 + 3 + mult(3, 0) 3 + 3 + 0 3 + 3 6

Should you still have problems with this example, look at the process backwards. What is the last step that happens? We can easily make out that the result of  is . Since   is , the function will return  and stop.

So what does the previous step do? does not return because  is not. So the next lines are executed: , which is , which is  as we just worked out. So now the variable  is set to.

The next line adds the value of  to , and since   is   and is, the result is.

Now we know that the function  returns. But we want to know the result of. Therefore, we need to jump back to the start of the program and execute it one more round: sets  to the result of. We know from the last round that this result is. Then  calculates as  , i. e. . Then the result of 3 * 2 is printed as 6.

The point of this example is that the function  starts itself inside itself. It does this until  reaches   and then calculates the result as explained above.

Recursion
Programming constructs of this kind are called recursive and probably the most intuitive definition of recursion is:

 * Recursion
 * If you still don't get it, see recursion.

These last two sections were recently written. If you have any comments, found any errors or think I need more/clearer explanations please email. I have been known in the past to make simple things incomprehensible. If the rest of the tutorial has made sense, but this section didn't, it is probably my fault and I would like to know. Thanks.

Examples
factorial.py

Output: 2! = 2 3! = 6 4! = 24 5! = 120

countdown.py

Output: 5 4 3 2 1 0

Commented_mult.py

Commented_factorial.py

Commented_countdown.py


text:
Freistil/How to use

'Freistil. Actual annotated German texts.' is a loose collection of German texts for foreign language learners. The texts, dealing with actual topics, are annotated with translations and spiced up with explanations and activities, so that you do not only learn new words but also how to use common phrases and typical grammatical structures.

You will find the following features:
 * In-text annotations pop up when the mouse cursor hovers over a . Here, you find an in-context translation of the given vocabulary, saving you the time to consider an external dictionary.
 * What's worth learning? boxes next to the text give you an idea of which vocabulary shows up frequently in daily language and thus is worth learning.
 * In detail boxes give you background information and cultural knowledge that help you understand what's going on.
 * Text levels at the beginning of the articles hint at the difficulty of the texts.

Before long, all texts will be separately available as PDF documents optimized for printing. In time, there will also be a compilation containing all articles as a complete book. Hopefully, there will be audio recordings of the texts as well.

title: Freistil/How to use


text:
Freistil/Participate

You are more than welcome to participate in this project! And you do not have to ask for permission to do so. Things you might want to do include:

 * Markup articles. You feel that the annotations given are not sufficient to understand a text? Well, add some more. Annotations are inserted using Template:C. works out to,  to.
 * Evaluate articles. Articles are marked with either of the three templates,   or  . You're free to change a text's markup if you feel it is more difficult or easier than the given hint.
 * Review articles. Force out typos, improve grammar and make translations more precisely.
 * Answer questions. Readers may ask questions on the talk pages of the articles. If you feel at home with the matter, try and answer them.
 * Make it printable. You're proud owner of a PDF converting tool? Use it! Grab an article per page, activities —if provided— on a second page. Upload the document to Wiki Commons and link it. A pretty table for linking will be available soon.
 * Vocalize articles. You're a native speaker of German? Record yourself reading one of the articles aloud, upload the recording as OGG Vorbis to Wiki Commons and link it. It doesn't matter if your voice sounds badly or you're a lover of dialect; people here need authentic day-by-day language, not vocal art. Pretty templates for the links will come up soon.
 * Write an article. Look out for an up-to-date topic (Wikinews is a good source) and copy-paste or compile a new text. Copy the formatting stuff from one of the existing articles. Use Template:Freistil/Header for the headline and text intro, Template:Freistil/Footer for the text outtro. Helpful tools to simplify creating a new article from scratch may be developed in the near future.

If you want to cooperate on a regular basis, no matter if you're a native speaker of English or German, just add your name to this list:
 * Bitbert, German, founder
 * Nowotoj, German, create, comment and record texts

title: Freistil/Participate


text:
Horticulture/Horticultural Oil

Horticultural Oil is a pesticide used primarily for controlling insects and mites. The oils are manufactured either from petroleum or vegetable oils, and are very lightweight. Until the late 20th Century, heavier "dormant oils" were used for the dame purpose, but they could only be used in winter as they were too heavy to be used in warmer conditions.

Action
Horticultural oils work by smothering the target pests, either clogging their stomatae or in the case of eggs simply preventing oxygen from moving through the oily film. Oils need to be applied directly to the pest, they have no residual effect and do not harm arthropods if ingested.

Application
Horticultural oils are mixed with water, and sprayed directly onto the pest organisms.

title: Horticulture/Horticultural Oil


text:
Freistil/Mediocre

Mittelstufe

title: Freistil/Mediocre


text:
Freistil/Advanced

Fortgeschrittene

title: Freistil/Advanced


text:
User talk:Jacek

Hello and welcome to Wikibooks!

Here are some tips to help you get started:
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~.
 * Remember to conduct any editing experiments in the sandbox.
 * If you're 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 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 Staff Lounge with any questions or ideas.
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * 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 Staff lounge, IRC channel or ask me personally on my talk page. For site news, see the Bulletin board. It might be an idea if you add this page to your "watchlist" so that you can see when any new information is posted there.

Good luck! -- Herby talk thyme 15:56, 15 January 2007 (UTC)

title: User talk:Jacek