text:
Horticulture/Agrotis segetum

The Turnip Moth (Agrotis segetum) is a moth of the family Noctuidae. It is a common European species, but is also present in other parts of the world as a root-feeding pest of both vegetable and cereal crops. The insect is not believed to be present in the United States, where the government has been making efforts to prevent its introduction on imported food crops.

Description
This is a very variable species with the forewings ranging from pale buff through to almost black. The paler forms have three dark-bordered stigmata on each forewing. The main distinguishing feature from other Agrotis species is the very pale hindwings, pure white in the males, pearly grey in the females. The wingspan is 32–42 mm. The grey larva, sometimes tinged with purple, feeds on the roots and lower stems of a huge range of plants (see list below).

Ecology
Two broods are produced each year, with the adults flying in May and June and again in August and September (in Britain). The species flies at night and is attracted to light and nectar-rich flowers. The species overwinters as a caterpillar.

Host plants

 * ../Acacia/
 * ../Allium/ - Onions, Garlic, Chives, etc.
 * ../Apium/ - Celery
 * ../Arachis/ - Peanut
 * ../Asparagus/
 * ../Beta/ - Beet
 * ../Brassica/
 * ../Camellia/
 * Casuarina
 * ../Cedrus/ - Cedar
 * ../Chrysanthemum/
 * ../Cichorium/ - Chicory, Endive
 * ../Coffea/ - Coffee
 * ../Cucurbita/
 * ../Eucalyptus/
 * ../Fragaria/ - Strawberry
 * ../Glycine/ - Soybean
 * ../Gossypium/ - Cotton plant
 * ../Hagenia/
 * ../Helianthus/ - Sunflower
 * ../Hibiscus/
 * ../Indigofera/
 * ../Lactuca/
 * Lycopersicon - ../Tomato/
 * ../Malus/ - Apple
 * ../Medicago/ - Alfalfa
 * ../Nicotiana/ - Tobacco
 * ../Picea/ - Spruce
 * ../Pinus/ - Pine
 * ../Pisum/ - Pea
 * ../Pseudotsuga/ - Douglas-fir
 * ../Rheum/ - Rhubarb
 * ../Rumex/
 * ../Saccharum/ - Sugar cane
 * ../Secale/ - Rye
 * ../Sesamum/ - Sesame
 * ../Solanum/ - Potato
 * ../Sorghum/
 * ../Spinacia/ - Spinach
 * ../Tectona/ - Teak
 * ../Trifolium/ - Clover
 * ../Triticum/ - Wheat
 * ../Vigna/ - Urad bean
 * ../Vitis/ - Grape
 * ../Zea/ - Maize

title: Horticulture/Agrotis segetum


text:
User talk:213.219.220.254

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 12:58, 13 December 2006 (UTC)

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

title: User talk:213.219.220.254


text:
User talk:71.197.24.185

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 13:06, 13 December 2006 (UTC)

title: User talk:71.197.24.185


text:
Talk:Tablature/Drums

Musical theory relation
Isn't good to show how it's read time figures in tablature? It's not something to neglect in drums!

Khullah 05:01, 3 July 2007 (UTC)

title: Talk:Tablature/Drums


text:
Horticulture/Hemipteran Pests

Hemiptera is an order of insects which includes ../Aphids/, ../Scales/, ../Hoppers/, ../Bugs/, ../Whiteflies/, and ../Mealybugs/, as well as ../Fleas/.

Description
These insects all feed using a piercing-sucking mouthpart.

title: Horticulture/Hemipteran Pests


text:
Wikibooks:Requests for deletion/StarCraft:Terran Units

StarCraft:Terran Units
I've nominated this page for deletion as it seems to be yet another game guide. It's not a new page so maybe it's been a candidate for deletion before. Xania 00:26, 11 November 2006 (UTC)
 * Comment - It's part of the StarCraft book. -- Prod-You 02:47, 11 November 2006 (UTC)
 * Comment - Hello, I've come back after a long vacation, so I'm not sure if policy has changed yet. IIRC, last time I was here, there was no real policy to be applied to Video Games, either for deletion or for keeping. The Starcraft book also seems to have some recent activity, and I would like to see at least the policy and a decent argument against the book before it gets transwikied or deleted, so we can explain it to the authors before they move. I understand that I may have missed the policy discussion (seems kinda de facto now to traswiki to StrategyWiki), but given the work on the Starcraft book on behalf of the authors looks good. The last thing I want here are anonymous users wondering where or why the Starcraft book gone. When a book is deleted, it doesn't save any space on the server anyway, admins can easily restore all the edits and such. So we aren't "wasting" wikibook resources at all. There is no rush, and we should not rush or overshadow the fact that a transwiki may effectivly kill a project if the authors don't want to move to the next site, relearn all the policies, and in some cases, deal with a license change. --Dragontamer 05:41, 11 November 2006 (UTC)

 * Just as a note, I've changed my vote to  Keep . --Dragontamer 18:00, 24 November 2006 (UTC)

 * Hmm, I'll just copy/paste my responce to Rakuten06 here, under his post for my reasoning. --Dragontamer 18:06, 24 November 2006 (UTC)

 * Delete and Move I know that it's part of StarCraft book but why not move to StrategyWiki like other strategy guide books, but you can come talk to me on my talk page to discuss this argument. Rakuten06 22:52, 23 November 2006 (UTC)
 * I think it is much more appropriate to discuss votes for deletion here — the VfD page.
 * Also, I think your approach is wrong. Rather than "why not move" I'd propose "why move". Surely the default isn't to move books, but to let them grow where they are. --Swift 12:43, 2 December 2006 (UTC)

 * Transwiki then delete - Right now the StarCraft guide is somewhat sparse, and adding this book would definitely benefit strategywiki. These pages will probably be transwiki'd irrespective of the delete here or not, it's just a matter of when. However, depending on the policy, if there is nothing against having the guide here, then I see no reason to delete it.  -- Prod-You 03:41, 24 November 2006 (UTC)

 * Well, if StrategyWiki had similar policies or was part of the Wikimedia project, I would agree with you. But it isn't. To edit anything on StrategyWiki, it requires people to register. Additionally, you are asking the authors to not only move the entire book, but to relearn the policies of a different wiki. I'm not saying that StrategyWiki is a bad thing, but it is a different place.

 * Ultimately, I feel that leaving Video game guides here is an excellent opportunity for Wikibooks in general. It allows contributors to edit their own projects, learning how to utilize the tools of Mediawiki markup, templates, and the such. Starcraft as a guide is also reasonably complete, not as good as some sites, but better than many of the wikibooks. It gives a reasonably deep view of strategy in Starcraft, going down to even build orders and cloning. The book is easy to follow as well.

 * Also, no official policy on wikibooks has been set against video game guides in general. Arguably, they are software manuals, which is allowed in policy.

 * Finally, Starcraft itself is one of those rare exceptional games that even if Video Games were removed from this site, I'd argue that Starcraft should stay. Starcraft does have a reasonably large following, and supposedly is very popular in Korea. (at least, this video would imply that). I'm not sure how old that video is, but it does show that Starcraft is pretty popular and can be an exception. And according to wikipedia, it is also reasonably popular, with 2 television channels in Korea dedicated to professional gameplay of Starcraft. --Dragontamer 18:06, 24 November 2006 (UTC)

 * Keep I find Dragontamer's arguments valid. If the wikibook is educational and interesting it should stay. --Swift 12:43, 2 December 2006 (UTC)

 * Keep. There is no formal policy to be invoked when it comes to videogame guides. The guides that we have deleted so far are those guides which have transwikied to other hosts under their own power, and the forks here were no longer needed. As a general comment, the general concensus among the community now is that videogame guides are generally not wanted here, which explains why the guides that have been transwikied have been so readily deleted here. With that in mind, even if this guide is not deleted as a result of this particular discussion, discussions and policy in the future could easily jeopardize this book again (next time without the possibility of keeping it, regardless of the arguments in favor). I would recommend that this book find a better, more permanent home, but I won't vote to delete it now. --Whiteknight (talk) (projects) 02:19, 11 December 2006 (UTC)


text:
User talk:221.134.40.146

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks. -- Herby talk thyme 13:40, 13 December 2006 (UTC)

title: User talk:221.134.40.146


text:
User talk:168.11.212.2

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 14:36, 13 December 2006 (UTC)

title: User talk:168.11.212.2


text:
User talk:Mikeypitt7

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:13, 13 December 2006 (UTC)

title: User talk:Mikeypitt7


text:
Horticulture/Scale Insects

The scale insects are small insects of the order ../Hemiptera/, generally classified as the superfamily Coccoidea. There are over 7,000 species of scale insects, all of which are parasites of plants, feeding on sap drawn directly from the plant's vascular system.

Description
Scale insects vary dramatically in their appearance from very small organisms (1-2 mm) that occur under wax covers (some look like oyster shells), to shiny pearl-like objects (about 5 mm), to creatures covered with mealy wax. Adult female scales are immobile and permanently attached to the plant they have parasitized. They secrete a waxy coating for defense; this coating causes them to resemble reptilian scales, hence the name.

Ecology
Scale insects feed on a wide variety of plants, and many scale species are considered pests. Some types are economically valuable, such as the cochineal and lac scales. Scale insects' waxy covering makes them quite resistant to pesticides, which are only effective against the juvenile crawler stage. However, scale can be controlled with horticultural oil, which suffocates them, or through biological controls. Soapy water is also reported to be effective against infestations on houseplants. Female scale insects, unusually for Hemiptera, retain their larval form at sexual maturity (neoteny). Adult males have wings but never feed and die within a day or two. The specifics of their reproductive systems vary considerably within the group, including hermaphroditism and seven forms of parthenogenesis.

Host plants
Scales feed on a very wide variety of plants, though most of the particular species have fairly narrow host ranges. If the particular scale can be identified, part of the control strategy is to inspect the area for other host plants, since the scale insects do not travel very far.

title: Horticulture/Scale Insects


text:
CCNA Certification/Routing Protocols

Routing and Routed Protocols
Confusion often arises between "routed protocols" and "routing protocols".

Routed protocols
A routed protocol is any network layer protocol that provides enough information in its network layer address to allow a packet to be forwarded from one host to another host based on the addressing scheme, without knowing the entire path from source to destination. Routed protocols define the format and use of the fields within a packet. Packets generally are conveyed from end system to end system. Almost all network layer protocols and those that are layered over them are routable, with IP being an example.

Data Link protocols such as Ethernet are necessarily non-routable protocols, since they contain only a link-layer address, which is insufficient for routing: some higher-level protocols based directly on these without the addition of a network layer address, such as 'NetBIOS', are also non-routable.

Routing protocols
Routing protocols are used in the implementation of routing algorithms to facilitate the exchange of routing information between networks, allowing routers to build routing tables dynamically. In some cases, routing protocols can themselves run over routed protocols: for example, BGP runs over TCP: care is taken in the implementation of such systems not to create a circular dependency between the routing and routed protocols.

A list of routing protocols can be found in the list of routing protocols.

Routing metrics
A routing metric consists of any value used by routing algorithms to determine to choose one route over another. Metrics can take into account such information as bandwidth, delay, hop count, load, MTU, reliability, and cost. The routing table stores only the best possible routes, while link-state or topological databases may store all other information as well.

Routers use the feature known as administrative distance to select the best path when they "know" of two or more different routes to the same destination from two different routing protocols. Administrative distance defines the reliability of a routing protocol. Each routing protocol gets prioritized in order of most to least reliable using an administrative-distance value. A static route has a lower (better) administrative-distance than a route by OSPF, which is better than RIP.

Distance vector algorithms
Distance vector algorithms use the Bellman-Ford algorithm. This approach assigns a number, the cost, to each of the links between each node in the network. Nodes will send information from point A to point B via the path that results in the lowest total cost (i.e. the sum of the costs of the links between the nodes used).

The algorithm operates in a very simple manner. When a node first starts, it only knows of its immediate neighbors, and the direct cost involved in reaching them. (This information, the list of destinations, the total cost to each, and the next hop to send data to get there, makes up the routing table, or distance table.) Each node, on a regular basis, sends to each neighbour its own current idea of the total cost to get to all the destinations it knows of. The neighbouring node(s) examine this information, and compare it to what they already 'know'; anything which represents an improvement on what they already have, they insert in their own routing table(s). Over time, all the nodes in the network will discover the best next hop for all destinations, and the best total cost.

When one of the nodes involved goes down, those nodes which used it as their next hop for certain destinations discard those entries, and create new routing-table information. They then pass this information to all adjacent nodes, which then repeat the process. Eventually all the nodes in the network receive the updated information, and will then discover new paths to all the destinations which they can still "reach".

Link-state algorithms
When applying link-state algorithms, each node uses as its fundamental data a map of the network in the form of a graph. To produce this, each node floods the entire network with information about what other nodes it can connect to, and each node then independently assembles this information into a map. Using this map, each router then independently determines the best route from itself to every other node.

The algorithm used to do this, Dijkstra's algorithm, does this by building another data structure, a tree, with the current node itself as the root, and containing every other node in the network. It starts with a tree containing only itself. Then, one at a time, from the set of nodes which it has not yet added to the tree, it adds the node which has the lowest cost to reach an adjacent node which already appears in the tree. This continues until every node appears in the tree.

This tree then serves to construct the routing table, giving the best next hop, etc., to get from the node itself to any other network.

Comparison of routing algorithms
Distance-vector routing protocols are simple and efficient in small networks, and require little, if any management. However, they do not scale well, and have poor convergence properties, which has led to the development of more complex but more scalable link-state routing protocols for use in large networks. Distance-vector protocols suffer from the count-to-infinity problem.

The primary advantage of link-state routing is that it reacts more quickly, and in a bounded amount of time, to connectivity changes. Also, the link-state packets that are sent over the network are smaller than the packets used in distance-vector routing. Distance-vector routing requires a node's entire routing table to be transmitted, while in link-state routing only information about the node's immediate neighbours are transmitted. Therefore, these packets are small enough that they do not use network resources to any significant degree. The primary disadvantage of link-state routing is that it requires more storage and more computing to run than distance-vector routing.

Routing Protocols
Routers talk to one another about the state of the network and of nearby devices. The protocols they use for to talk to each other, routing protocols, should not be confused with ROUTED protocols like IP and IPX that carry data on the network.

Common routing protocols include RIP, RIPv2, IGRP, EIGRP, IS-IS and BGP. For the CCNA exam you will need to be well versed in RIP, RIPv2, IGRP and EIGRP. You should be aware of IS-IS and BGP, and be able to configure basic OSPF.

Two main types of routing protocols exist - distance vector and link state. A third type known as balanced hybrid (Known now as "Advanced Distance Vector") combines features of both link state and distance vector protocols.

Examples of Distance Vector routing protocols

 * RIP-(Routing Internet Protocol)
 * RIPv2

Examples of Link State routing protocols

 * OSPF (Open Shortest Path First)
 * IS-IS

Examples of Advanced Distance Vector routing protocols

 * EIGRP "Enhance inter Gateway Routing Protocol"

Routers may be configured with static routes, i.e. the network administrator configures the router with information about routes on a network, OR routers may be learn routes dynamically by using a routing protocol.

title: CCNA Certification/Routing Protocols


text:
User talk:165.155.128.133

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks. -- Herby talk thyme 15:59, 13 December 2006 (UTC)

title: User talk:165.155.128.133


text:
User talk:209.68.66.1

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks. -- Herby talk thyme 17:04, 13 December 2006 (UTC)

title: User talk:209.68.66.1


text:
User talk:203.200.73.173

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 17:16, 13 December 2006 (UTC)

title: User talk:203.200.73.173


text: User talk:86.57.52.101

title: User talk:86.57.52.101


text:
Talk:C++ Programming/Exercises/Standard IO

More in-depth guide required?
When I was trying to follow that guide, it was easy to follow, I used Dev-C++, and the .exe from my finished compiled code would display "Hello, what is your name?" and then crash. I think we need to put in a bit more content. 68.146.235.206 18:13, 13 December 2006 (UTC)


text: User talk:138.89.108.161

title: User talk:138.89.108.161


text:
User talk:84.194.253.83

Please do not replace Wikibooks pages with blank content. Blank pages are harmful to Wikibooks because they have a tendency to confuse readers. If it is a duplicate article, please redirect it to an appropriate existing page. If the page has been vandalised, please revert it to the last legitimate version. If you feel that the content of a page is inappropriate, please edit the page and replace it with appropriate content. If you believe there is no hope for the page, please see the deletion policy for how to proceed. If page is no longer useful, insert delete to its top. Thanks for contributing to Wikibooks! -- Herby talk thyme 19:03, 13 December 2006 (UTC)

title: User talk:84.194.253.83


text:
User talk:Uly

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:05, 13 December 2006 (UTC)

title: User talk:Uly


text:
User talk:Esprit15d

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:06, 13 December 2006 (UTC)

title: User talk:Esprit15d


text:
User talk:165.138.192.9

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks. -- Herby talk thyme 19:20, 13 December 2006 (UTC)

Once more and you are blocked -- Herby talk thyme 19:26, 13 December 2006 (UTC)

title: User talk:165.138.192.9


text:
User talk:150.108.104.225

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:27, 13 December 2006 (UTC)

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 20:27, 13 December 2006 (UTC)

title: User talk:150.108.104.225


text:
User talk:195.229.241.181

Please stop adding book request in this way -- Herby talk thyme 19:30, 13 December 2006 (UTC)

title: User talk:195.229.241.181


text: Category:Book:Elements of Art

title: Category:Book:Elements of Art


text:
Elements of Art/Navline

Cover • Intro • Line • Shape • 2D & 3D

title: Elements of Art/Navline


text:
Puzzles/Set theory puzzles/Infinite Hotel/Solution

Let us imagine a hotel with a finite number of rooms, and let us assume that all the rooms are occupied. When a new guest arrives and requests a room, the proprietor apologises, 'Sorry--all the rooms are full.' Now let us imagine a hotel with an infinite number of rooms, and let us assume that again all the rooms are occupied. But this time, when a new guest arrives and asks for a room, the proprietor exclaims, 'But of course!' and shifts the person in room 1 to room 2, the person in room 2 to room 3, the person in room 3 to room 4, and so on... The new guest then moves into room 1, which has now become vacant as a result of these transpositions. But now let us suppose an infinite number of new guests arrive, asking for rooms. 'Certainly, certainly!' says the proprietor, and he proceeds to move the person in room 1 into room 2, the person in room 2 into room 4, the person in room 3 into room 6, the person in room 4 into 8, and so on... . In this way, all the odd-numbered rooms become free, and the infinity of new guests can easily be accommodated in them.


text:
User talk:Markets

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 20:29, 13 December 2006 (UTC)

Marketing Wikibook Nomination
I saw your nomination to feature Marketing. Not less then a month ago the book was nominated, and nobody voted for it. You can see the old discussion HERE. If you think you have made improvements to the book you can certainly go forward with the new nomination, otherwise you might want to read some of the criticisms and work to improve the book.

If you need any help with that, please let me know on my user talk page. I am happy to assist people who want to write new books, or improve old books. Welcome to wikibooks! --Whiteknight (talk) 02:21, 2 May 2007 (UTC)

Image:Markets.jpg is missing a fair use rationale

 * This image has been tagged for deletion because it can be replaced by a freely-licensed image which would have the same effect. If you'd like to freely license it, please do so (or leave me a note if it's deleted already). – Mike.lifeguard  | talk 23:22, 12 April 2008 (UTC)

title: User talk:Markets


text:
User:Matt489/monobook.css

@import "http://en.wikipedia.org/w/index.php?title=User:Matt489/monobook.css&action=raw&ctype=text/css";

title: User:Matt489/monobook.css


text:
Radiation Oncology/Supportive care/Pain

General

 * Opioids (strong):
 * Morphine
 * Methadone
 * Oxycodone
 * Fentanyl
 * Hydromorphone (Dilaudid, Palladone)
 * Levorphanol (Levo dromoran)
 * Oxymorphone (Numorphan)
 * Oral (5 mg IR q6h, 20 mg SR bid), Parenteral, Suppository (5 mg)

Neuropathic pain
Medications:
 * Opioids:
 * Buprenorphine
 * Fentanyl
 * Levorphanol
 * Methadone
 * Morphine
 * Oxycodone
 * Tramadol - usual: 250 mg/d. Max: 400 mg/d.
 * Antidepressants:
 * Block Ca-channel, Na-channel, presynaptic reuptake inhibition of monoamines, NMDA receptor blockade
 * Tricyclic antidepressants (TCA)
 * Selective noradrenaline serotonin reuptake inhibitors (SNRI)
 * Venlafaxine (Effexor) and duloxetine (Cymbalta)
 * Gabapentin (Neurontin)
 * Pregabalin (Lyrica)

title: Radiation Oncology/Supportive care/Pain


text:
User talk:12.227.128.119

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally. Xania 21:32, 13 December 2006 (UTC)

Also thanks for correcting mistakes and vandalism in the Monopoly article. Xania 21:32, 13 December 2006 (UTC)

title: User talk:12.227.128.119


text:
User talk:68.60.85.252

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks. Xania 21:43, 13 December 2006 (UTC)

Welcome to Wikibooks. We invite everyone to contribute constructively to our collection. Take a look at the welcome page if you would like to learn more about contributing. However, unconstructive edits are considered vandalism, and if you continue in this manner you may be blocked from editing without further warning. Please stop, and consider improving rather than damaging the hard work of others. Thanks.

You have been banned from editing for 2 hours. If you continue to vandalise Wikibook pages your IP address will be blocked for a longer period.

Xania 00:43, 17 December 2006 (UTC)

title: User talk:68.60.85.252