text:
User:Yrseo~enwikibooks

Hi~ This is Yuran SEO, your assistant for ETC200.

If you have any question, please do not hesitate to contact me by email.

Please enjoy ETC200.

Yoroshiku.

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

title: User:Yrseo~enwikibooks


text:
User talk:Yrseo~enwikibooks

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally. -- Herby talk thyme 08:11, 18 September 2007 (UTC)

Additional page
The page you re-created (Yrseo) is not part of any Wikibooks and the same info is on your user page so it will be deleted again. Thanks -- Herby talk thyme 08:11, 18 September 2007 (UTC)
 * OK - please take a look around at the policies and guidelines. The page you have again re-created should not be standalone page within Wikibooks.  Place links to your page (which has the info on) but do not re-create it - thanks -- Herby  talk thyme 09:49, 18 September 2007 (UTC)

Your account will be renamed
Hello,

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

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

title: User talk:Yrseo~enwikibooks


text:
User:Touffy

David Junger, a.k.a. Touffy.

title: User:Touffy


text:
Horticulture/Echinacea

Echinacea commonly called the Purple coneflowers, is a genus of nine species of herbaceous plants in the Family Asteraceae. All are strictly native to eastern and central North America. The plants have large showy heads of composite flowers, blooming from early to late summer. Some species are used in herbal medicines.

The genus name is from the Greek echino, meaning "spiny", due to the spiny central disk.

Description
They are herbaceous, drought-tolerant perennial plants growing to 1 or 2 m in height. The leaves are lanceolate to elliptic, 10–20 cm long and 1.5–10 cm broad. Like all Asteraceae, the flowers are a composite inflorescence, with purple (rarely yellow or white) florets arranged in a prominent, somewhat cone-shaped head; "cone-shaped" because the petals of the outer ray florets tend to point downward (are reflexed) once the flower head opens, thus forming a cone.

Species
The species of Echinacea are:
 * ../Echinacea angustifolia/ - Narrow-leaf Coneflower
 * ../Echinacea atrorubens/ - Topeka Purple Coneflower
 * ../Echinacea laevigata/ - Smooth Coneflower, Smooth Purple Coneflower
 * ../Echinacea pallida/ - Pale Purple Coneflower
 * ../Echinacea paradoxa/ - Yellow Coneflower, Bush's Purple Coneflower
 * ../Echinacea purpurea/ - Purple Coneflower, Eastern Purple Coneflower
 * ../Echinacea sanguinea/ - Sanguine purple coneflower
 * ../Echinacea simulata/ - Wavyleaf Purple Coneflower
 * ../Echinacea tennesseensis/ - Tennessee Coneflower

Health effects
Echinacea is popularly believed to stiumlate the body's immune system and ward off infections, particularly the common cold. However, its clinical efficacy has not been established

History
Echinacea angustifolia rhizome was used by North American Plains Indians, perhaps more than most other plants, for various herbal remedies. Echinacea was one of the basic antimicrobial herbs of Eclectic medicine in the mid 1800s through the early 1900s and its use was documented for snakebite and anthrax. In the 1930s "Echinacea" became popular in both Europe and America as a herbal medicine.

Active substances
The full spectrum of echinacea's chemical components responsible for its health effects are not well understood. Like most crude drugs from plant or animal origin, the constituent base is complex and some parts may be directly antimicrobial while others work at stimulating or modulating different parts of the immune system. All species have chemical compounds called phenols, which are common to many other plants. Both the phenol compounds Cichoric and caftaric are present in E. purpurea, other phenols include echinacoside, which is found in greater levels within E. angustifolia and E. pallida roots than in other species. When making herbal remedies, these phenols can serve as markers to evaluate the quantity of echinacea in the product. Other chemical constituents that may be important in echinacea health effects include alcamides and polysaccharides.

Root or whole plant
A medical study (Taylor et al. 2003. ) found that when echinacea products made from the entire plant (not just the root) were taken after the second cold symptom appeared they provided no measurable beneficial effect for children in treating the severity or duration of symptoms caused by the common cold virus. Dosage however was about a third of what clinical herbalists routinely use, and the leaves and stems are not known to be clinically effective. Studies by the University of Virginia School of Medicine (Turner, 2005 ) confirmed these results, and added that Echinacea had no clinically significant effects on the common cold even if taken immediately upon infection, or as a prophylaxis starting a week prior to symptoms of infection. However, a University of Maryland review of available studies concluded that Echinacea, when taken at first sign of a cold, reduced cold symptoms or shortened their duration. This conclusion was based on 13 European studies. The University of Maryland study also found that three of four studies concluded that taking Echinacea to prevent a cold was ineffective, although including studies that use subclinical doses, the wrong part or unassayed material will bias such conclusions. Another scientific review, however, of 14 published studies found that the incidence of colds was reduced by 58% and the duration by a day and half.

Alcohol-based or dry
Leading herbalists claim that many studies do not distinguish between alcohol-based echinacea tinctures, which retain potency for up to seven years after production, and capsules containing the dried herb, which lose their efficacy over time. Capsules not only lose strength, but must be digested in the stomach while alcohol tinctures enter the lymphatic system through the tongue.

Frequency of administration
Proponents of echinacea assert that it is not a "one-dose" treatment, and that in order to work effectively, a dose should be taken at the very first sign of a cold symptom. Subsequent doses must be taken every two to four hours after the first dose, including every two to four hours during the overnight sleeping period, until the cold symptoms have disappeared (generally within 24 hours.) The scientific studies stated above appear to disagree with these claims as ad hoc rationalising; if the cold doesn't go away when expected, the patient can always be blamed for not following the strict regimen, and the product is never to blame. This is known as subjective validation.

Species
Not all species of Echinacea are equally effective. A Cochrane review of the published studies has found that there is some evidence of benefit in the treatment (but not prevention) of the common cold by the aerial parts of Echinacea purpura; other formulations of the plant did not show the same effect, and no formulation was effective for prevention.

Contraindications
Echinacea herbals should not be taken by persons with progressive systemic and auto-immune disorders such as tuberculosis, leicosis, connective tissue disorders, collagenosis, and related diseases such as lupus erythematosus, according to the German Kommission E. Its use in AIDS or against opportunistic infections in AIDS patients is controversial: the Kommission E recommend against it. It should not be used with other known hepatotoxic drugs such as anabolic steroids, amiodarone (Pacerone® or Cordarone®), methotrexate, or ketoconazole (Nizoral®).

Medical
Echinacea may, in addition to common cold, be useful when treating Athlete's foot with Econazole, or in cancer treatment.

Others
Some species of Echinacea, notably P. purpurea, E. angustifolia, and E. pallida, are grown as ornamental plants in gardens They tolerate a wide variety of conditions, maintain attractive foliage throughout the season, and multiply rapidly. Appropriate species are used in prairie restorations.

title: Horticulture/Echinacea


text:
User talk:207.73.252.250

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:04, 18 September 2007 (UTC)

title: User talk:207.73.252.250


text:
The World of Peer-to-Peer (P2P)/Networks and Protocols/Gnutella

Gnutella
Gnutella is an open file sharing Network originally created by Justin Frankel of Nullsoft. That means, unlike most other networks, everyone can write a client which can access the GNet, if it fulfills the publicly available specifications.

The specifications are discussed and created by the GDF (the gnutella development forum), an open Mailinglist for developers, with by this date over 1000 members. After that they are documented in the rfc-gnutella. In this way all programs share a common base, while the protocol also allows for client specific options. The developers are careful to ensure the greatest possible backwards compatibility.

Despite the name, Gnutella isn't GNU-Software, though some Gnutella clients are GPL-licensed. It is an open network, and the origin of its name may be found more easily by eating too much Nutella, than at GNU. (That means: Gnutella is not a project of the FSF or related to GNU software tools). And while Gnutella was initially stated as a fully-distributed information-sharing technology, later versions of the protocol are a mix of centralized and distributed networks with "Servers" ( Ultra or Super peers) and "Clients" ( Leafs or Nodes ).

A Gnutella client software is basically a mini search engine (offering an alternative to web search engines) and file serving system in one. Gnutella in new implementations also supports Tiger tree hashing (TTH) for for file transfers.

One sibling of Gnutella deserves special attention, even though some developers of current clients would deny it. It is called MP (Mikes Protocol) or the Shareaza Protocol by most Gnutella developers, while its developer called it Gnutella2, a name which gave his program (Shareaza) much media coverage and created and creates much controversy and aversion against it in the_gdf.

The result of a fork of the Gnutella protocol, due to the failing of the developers community to reach a consensus on the evolution of the protocol.
 * Gnutella2 ( Mike's Protocol,G2 )

Gnutella2 is also called Mike's Protocol since the first changes and implementation resulted from a single developer Michael Stokes. In November 2002, Michael Stokes formally and unilaterally announced the creation Gnutella2 protocol to the Gnutella Developers Forum, which caused a schism among the developers, and lead for the modifications no to be supported in several Gnutella applications since the original proposal did conflict with other vendors concepts (in specific LimeWire and Bearshare).

The now resulting implementation drops all of the old Gnutella protocol except for the connection handshake and adopts an entirely new search algorithm. Gnutella2 is often abbreviated as G2.

The Original: FoF
You can imagine the original model of the Gnutella network as friends phoning each other to get information. One asks five others, each of whom asks 5 others and so on. After the first step the number of people reached is 5, after the second it is 25, after the 5th 3125, after the 7th 78,125 and after the 14th about 6.1 billion. That would be enough to reach every human being on this planet. The original Gnutella used 7 steps (called HTL: Hops To Live).

The biggest problem with this model (among others) is that you have to be a part of the clique before you can use it.

Problems of the FoF-model
The Friend-of-a-Friend model has certain disadvantages, which have their source in the way searches are performed. If a search brings too many results, the nodes, through which you are connected (your nearest 5 friends) can get overloaded, because every answer has to go through them, for they don't give out your \"phone number\", but their own and hand the answer to you. If you ask for the name of the head of University in the campus, you'll get hundreds of answers in reality, and thousands to millions on the web. Also, if every question is passed to every one in a 75,000 to 600,000 computer-network, and every computer asks only once an hour, each of them has to answer about 130 to 1600 questions per second. And they have to pass them on. While computers are fast, and today's Internet connections can handle quite a lot when compared to the connections a few years ago, this is too much even for them. Just imagine your phone ringing endlessly the whole day for all kind of questions.

Getting in
To address the connection problem several ideas to solve have come about.

The first way: Pong-Caching
Pong Caching means that the node (aka you) asks its friends who their friends are. It means your friends introduce you to their friends, especially friends whom they value highly, and you write all new addresses in your phone-book, so you know whom to phone when your original friends are on holiday (Somehow like being at a continuous cocktail party). It is easy and has the advantage of giving you very reliable contacts, but there is no way of getting into the network without knowing at least one contact who is already in the net. That means you can always get back in, but won't be able to connect if you never did before.

The second way: Remember who answers
The second way is really simple. When one of your 5 friends calls back to say Smith (whom you didn't know before) knows something, you note her number. When you call him the next time as one of your five direct contacts, the chance is greater that you will get your information more quickly, because he will likely have friends who have similar interests to you (where else should he have gotten the information?), and those are more likely to have your information than randomly picked persons (at least when you ask about something similar to your last question). The drawback is that those contacts might not be at home often, so it might be that you find a contact with great knowledge, but whom you'll never be able to reach again. Still no way of getting in the first time. And now we get to one of the recent developments in Gnutella: GWebCaches. I will discuss them in the next part.

The third way: GWebCaches
To stay within the picture, a GWebCache is a contact who puts her phone number into the newspapers and keeps a record of those who call. When you've been away for some time and are no longer certain if your contacts still have the same mobile-phone numbers, you call the publicly known contact. Before giving you numbers, he/she will ask you: "Do you know other publicly known contacts? If yes, please tell me their numbers." That is done because they can't read all the newspapers, and you do it all the time without working too hard for it. That way, they keep track of each other. Then the contact gives you some numbers to call and notes your number (to give it to someone else) and the addresses of other public contacts he/she knows (GWebCaches).

This is roughly the way GWebCaches work. GwebCaches are essential only for the first connections. You use them when your local address-book is empty. They must not be preferred over your local address-book. As I stated, they are one of the new developments in Gnutella, and thus I will now get to some more of the recent changes within Gnutella and to future plans.

Ultrapeers and Leafs
You'll surely have friends who know very many other people, and whom you can ask, and be sure they'll know exactly the person who can give you the answer. These are called Ultrapeers in Gnutella. An Ultrapeer doesn't have to know much himself/herself, he/she just needs to know who knows it. In Gnutella that means that a good Ultrapeer doesn't need to have many files to benefit the network. If you're afraid to share much, you should become an Ultrapeer in Gnutella.
 * Change who calls whom

In the Computer World, as in the Real World, there are contacts who can cope with more calls, and those who can't phone often (or can't afford the bills). In the Real World this is because they have more free time. Whereas, in the Computer World, it is because they have faster connections (Like DSL, Cable, T1, T3 or similar broadband). Upon realizing this, the developers decided to change the topology, that means how the network looks from the outside when you draw it. Now you don't just call any of your friends, but only those whom you know have the time to take your call and to send it on to others. To save you from too many calls, they then ask you which kinds of informations you have or, to express it in a more human way, what your specialty is. In the Computer World that means your computer sends a list of all its files to the Ultrapeer, which is how we call these kinds of contacts. That list contains summaries (Hash-Strings) of all your shared files (those you decide to let others download) by which the downloader can verify that they are, indeed, the files he or she wants. Whenever a call reaches the Ultrapeer, it checks if you could know an answer and calls you only in that case.
 * In more detail

These Ultrapeers have many connections to others, which means they have a really big address book. Normally they stay in contact with 16 other Ultrapeers whom they have in their address book and to whom they send questions, and who send them to 16 more, each. Also they have about 16 leafs, who can't or don't want to phone that much, from which they accept calls, and whose files or, for the human world, specialties they know.

This may seem like a foul bargain for the Ultrapeers, who devote far more resources to keeping the network intact than leafs, but in fact it isn't. While the Ultrapeer (UP) uses much of her time for keeping the network running, the leafs specialize on gathering and delivering information. So, when anyone, Ultrapeer or Leaf, wants to know something, he or she simply starts a call and a leaf specialist can explain it to them. That way people specialize to get more for all.

Intra-ultrapeer QRP
While with Ultrapeers not everyone needs to participate in sending questions to others, and people can specialize in sharing their information instead, the Ultrapeers would still send every question to everyone, without ever taking into account if that UP even has leaves, who have the files. This sounds normal, for how can an Ultrapeer know which files the other Ultrapeers have? The answer comes, again, from real life. A normal person knows her friends, and knows who of them might know the answer to a specific question, and who most surely will not. In Real Life this is mostly done through friendly chatting.

Now, computers normally don't chat idly, so they don't exchange this information by the way. Thus the Query Routing Protocol was developed. There each Leaf tells its Ultrapeers which files it has, but instead of taking the names, which would consume too much space, each word which is part of the name of a file is saved as numbers (these are computers after all). You can imagine this process like a game of BattleShips (the numbers form the board with two coordinates). An Ultrapeer doesn't send all questions to a leaf, but only those which it might be able to answer (which hit a ship), and so Leafs get far less needless calls.

Now when this takes so much pressure off the leaves, why not extend it? Exactly that was done. Now all Ultrapeers send their boards to their direct neighbors. They send only those searches, which have one more step to go, to other Ultrapeers on whose board they score a hit. That means, the last two steps of a search will only be taken when there is a chance that they give results. You can see quite simply why this heavily reduces the bandwidth usage: imagine a tree, a normal tree, not one of those mathematical constructs. If you try to count the leaves, you have almost no chance. But if you take the leaves away and count only the branches, you have far less work to do. If you now take away all those tiny branches, you can really begin to count them. QRP doesn't take all leaves and all tiny branches away, but it removes those of them who couldn't give you an answer. Since every part through which a question has to travel consumes bandwidth, and there are far more leaves than branches, taking away, in many cases, many of the last two steps (that means many of the leaves and the tiny branches) reduces the number of questions the computers have to send on (there are far more leaves, than branches). The example doesn't work for all of Gnutella, but here it fits nicely.

Searching: Dynamic Querying
Now, while the Ultrapeer model and QRP partly solve the problem that you don't have the time to explain something properly to someone else, or to get it explained, because the phone rings endlessly for questions to which you know no answer (or in Tech-Speech: because the network-traffic exceeds your connection-speed), there is still another problem which might normally not even be visible, if you look at it. In the Real World, an Ultrapeer will ask for a specialist who can give you the info until he/she finds one, and then stops. In the Computer-World, the question is sent on and on, to as many contacts as possible, without looking if there already are answers.

With dynamic Querying that changes. Now the Ultrapeers ask one other Ultrapeer at a time, and wait a bit, to see if they get answers. When they have enough answers to be satisfied, they stop asking for more. It sounds pretty natural, but was quite a big step for Gnutella because it saves resources which were wasted on very popular questions. I'll take the example of the head of university again: now, if you ask for the head of university, your Ultrapeers will first see if they know someone directly who can answer your question. Then they will simply give you some numbers of people they know who live on the campus. You will still get more than one answer because they will give you more than one number, as they can't be sure that you'll reach every number they gave you. But you won't get thousands of phone-numbers (one from every student on the campus), first because the Ultrapeers would waste their time with that on something which doesn't give you additional benefit, second, because you couldn't ever call all those people, and third, because then you might not reach your Ultrapeers anymore, because they would be so busy getting return calls from others who tell them numbers, and sending your question to other Ultrapeers.

Finding sources without searching aka the Download-Mesh
Now you might say, "but I can't download from those three, because others already do. I want to get all addresses from which I can download," (and you are not alone with this. I feel the same). By looking at the Real World, we can find a solution to this problem too, without having to waste too many resources on it. There (in the Real World), if you ask a specialist to explain something to you, and that specialist is busy, he or she will know some other specialists (because they know each other) who might have more time at the moment.

Getting this into Gnutella is not as easy as the Ultrapeer-Leaf Model nor as the Dynamic-Query Model. But the programmers found a way. As I stated at the Dynamic-Query-Model, you will get more than one number where you can ask. Now, when you call someone who should know the answer, you also give him or her the other numbers you know about. That way, the specialists will get to know each other (the same way, as the GWebCaches, which I mentioned before, learn of others of their kind). As everyone who asks also brings her own set of numbers, the specialists know more and more additional addresses, and when you ask them to explain, and they don't have time at the moment, they give them to you (they do it even if they have time, just in case they could be interrupted, and because in Gnutella you can download from more than one source at once, just like you can in the overnet-network (which does this to the extreme, but is only really efficient for big files). Additionally, the specialists also add you to their number of alternate-contacts, as soon as you know enough to teach others.

This is why often many people download files from you which you just downloaded yourself.

Swarming and Partial File Sharing
Swarming is quickly explained (but hard to do in the friend-of-a-friend model, so I drop it for this part only). It works by simply getting one file from more than one person at once. The file is simply separated into several parts, as if you'd want to get a book from some friends and every one of them copied only a few pages of it. When you ask every one of them to copy a different part of the book, you'll get the complete book, and every one of them has only very little work to do (and if one doesn't have the time to do it, another one can).

Swarming works best with the Download Mesh and Partial File Sharing (PFS), which allows people to share files which they are downloading at the moment, because they can share those parts which they already have, while they still download from others. You can copy those pages which you have without having to have the whole book, since your pages are all numbered and friends can ask you for certain page numbers.

Downloading through Firewalls
Imagine there were people who couldn't be called, but could only call others (maybe because they only use public phones, or their number isn't displayed on your phone, and they don't like to give it out because they don't like being called by telemarketers, or by people terrorizing them over the phone). In Gnutella these are computers who are behind a firewall. They can call others and get information from them, but no one can call them.

The solution is to have the firewalled people call their Ultrapeers regularly and, when someone wants to call them, he or she simply calls the Ultrapeer who then holds two phones together, one to which the firewalled person (the one who can't be called) raised a call, and the one you called. That way you can talk to the firewalled person, but it takes two simultaneously running calls, which means, that it needs twice the bandwidth in the Computer-World. Firewalled persons always keep their connection to the Ultrapeers, who simply relay the information or data.

There are plans to save the Ultrapeers from this additional bandwidth usage by letting other people do the phone connecting. Then, when someone wanted to get information from a firewalled specialist, the Ultrapeer would tell the firewalled person and the asker to call a third person. That person would then hold the two phones together. In Gnutella most People have three to five phones, so this wouldn't be such a great problem. These phone-connectors will most likely be called routing-peers.

File-Magnets
File-Magnets stray from the Friend of a Friend model. They are links on Webpages, which you can simply click, and which will tell your file-sharing program to search Gnutella (in fact also other networks) for a specific file, and to download exactly this.

You can imagine it like an article in a newspaper which tells you information which gives your Ultrapeers the exact information that the specialist, from whom you want to learn, has to know. In the Real World you would most likely find one specialist and those who learned from him or her.

With a magnet-link you can avoid getting bad files because they use a hash-string, which is something like a summary of the information the specialist would give you. If he or she begins to tell you crap, you will see at once that it doesn't fit the summary. In Gnutella, the program asks for files to which the people who have them have assigned the same summary, aka Hash-string. After downloading, the program does its own summary and checks if they really match. If not, it tells you that the file is corrupt. The summaries from same files are always exactly the same because they are done via specific mathematic methods which always get to the same result when given the same data (aka information).

Different from Magnet-Links, KaZaA-Links and eDonkey-Links are not secure, because they use methods which can be betrayed with false files (for example a KaZaA-Link asks for a kind of summary which only checks the introduction and the first part of the information, but all the rest is ignored to make the summary quicker to create. Naturally it is very easy to give you false information, because they only have to tell the truth at the beginning, then they can lie or fantasize as much as they want). Further information on Magnet-Links can be found here: Magnet-Uri and on MagnetLink.org

There is now a new version of magnet-links: KaZaA magnets. Sadly those aren't secure, for they use the KaZaA hashing system (the incomplete summary) with some changes (they now add another smaller summary, which might tell you about the missing parts, but they didn't publish, how they create it). If KaZaA-Magnets provide information about a search term, they might work with Gnutella, but they won't ensure that you get what they offer to you. If you find the word \"kzhash\"in the link, it might not be secure (aside from having a somewhat misplaced name).

Lime Wire LLC
LimeWire a peer-to-peer file sharing client for the cross-platform Java Platform, Open Source (GPL), which uses the Gnutella network to locate and transfer files. It also encourages the user to pay a fee, which will then give the user access to LimeWire Pro. Support for BitTorrent protocol is also present by using the C++, Boost licensed, libtorrent library.

Software Implementations
To become part of the Gnutella Network, you can use one of the clients listed below :

 * Deepnet Explorer ( http://www.deepnetexplorer.com/ ) a browser with RSS news reader, P2P client integration (Gnutella) and phishing alarm, closed source, Windows only, freeware.
 * Phex cross-platform Java client.
 * XoloX
 * Gnucleus - Gnutella, Gnutella2 (G2) coded using C++ and Microsoft MFC libraries. The Core is LGPL and communicates to a GPL frontend using Windows COM-base.
 * Gtk-Gnutella, GPL, for GNU/Linux.
 * Hydranode ( multi-protocol, referenced on the eDonkey2000/eMule section )
 * ezpeer, a Chinese client.
 * pp365, a Chinese client.
 * POCO, a Chinese, using GnucDNA.
 * Bearshare, free closed source for Window.
 * CocoGnut, for RISC OS.
 * Swapper, free closed source for Windows utilizing .NET.
 * TrustyFiles, for Windows, supports FatTrack (KaZaA), Gnutella and G2.
 * Shareaza ( http://shareaza.sourceforge.net/ ), Open Source (GPL), coded in C++, MFC and ATL. Multi-network peer-to-peer file-sharing client supporting Gnutella2 (G2), Gnutella, eDonkey2000/eMule, BitTorrent, FTP and HTTP protocols.
 * FrostWire ( http://sourceforge.net/projects/frostwire/ ), a Peer to Peer (P2P) information sharing client for the Gnutella network. This project is not affiliated with LimeWire LLC. It is a fork of Limewire's Java implementation committed to never including content filters. FrostWires' source code (Java) is Licensed under the GNU GPL Open Source license. Newer version have moved to use the BitTorrent protocol.
 * Acquisition, a Mac OS X client based on the Limewire core, written in Cocoa, shareware.
 * XNap, a multi-network program in Java using the Limewire Core for Gnutella.


text:
Small and Medium Enterprises and ICT

Table of Contents

 * /List of Acronyms/
 * /Foreword/
 * /Overview/
 * /Concepts and Definitions/
 * /SME Adoption of ICT/
 * /General Policy Framework for ICT Adoption by SMEs/
 * /Specific Policy Recommendations for Governments/
 * /Suggestions for Further Reading/
 * /Works Cited/
 * /Notes/
 * /About the Author/

Information
This book is donated by UNDP Asia-Pacific Development Information Programme (UNDP-APDIP) to the community. The original publication is by:

Author: Vadim Kotelnikov (Foreword by Kim Hak-Su)

© UNDP-APDIP, APCICT, 2007, 27 pages

ISBN 978-974-8283-93-7

This wikibook is available under the terms of GNU Free Documentation License and Creative Commons Attribution License 2.5

title: Small and Medium Enterprises and ICT


text:
Java Persistence/OneToMany

=OneToMany=

A  relationship in Java is where the source object has an attribute that stores a collection of target objects and if those target objects had the inverse relationship back to the source object it would be a   relationship. All relationships in Java and JPA are unidirectional, in that if a source object references a target object there is no guarantee that the target object also has a relationship to the source object. This is different than a relational database, in which relationships are defined through foreign keys and querying such that the inverse query always exists.

JPA also defines a  relationship, which is similar to a   relationship except that the inverse relationship (if it were defined) is a   relationship. The main difference between a  and a   relationship in JPA is that a   always makes use of an intermediate relational join table to store the relationship, whereas a   can either use a join table, or a foreign key in target object's table referencing the source object table's primary key. If the  uses a foreign key in the target object's table JPA requires that the relationship be bi-directional (inverse   relationship must be defined in the target object), and the source object must use the   attribute to define the mapping.

In JPA a  relationship is defined through the   annotation or the   element.

Example of a OneToMany relationship database
EMPLOYEE (table)

PHONE (table)

Example of a OneToMany relationship and inverse ManyToOne XML
Note this  mapping requires an inverse   mapping to be complete, see ManyToOne.

Getters and Setters
The relationship is bi-directional so, as the application updates one side of the relationship, the other side should also get updated, and be in sync. In JPA, as in Java in general it is the responsibility of the application, or the object model to maintain relationships. If your application adds to one side of a relationship, then it must add to the other side.

This can be resolved through add or set methods in the object model that handle both sides of the relationships, so the application code does not need to worry about it. There are two ways to go about this, you can either only add the relationship maintenance code to one side of the relationship, and only use the setter from one side (such as making the other side protected), or add it to both sides and ensure you avoid an infinite loop.

For example:

Some expect the JPA provider to have magic that automatically maintains relationships. This was actually part of the EJB CMP 2 specification. However the issue is if the objects are detached or serialized to another VM, or new objects are related before being managed, or the object model is used outside the scope of JPA, then the magic is gone, and the application is left figuring things out, so in general it may be better to add the code to the object model. However some JPA providers do have support for automatically maintaining relationships.

In some cases it is undesirable to instantiate a large collection when adding a child object. One solution is to not map the bi-directional relationship, and instead query for it as required. Also some JPA providers optimize their lazy collection objects to handle this case, so you can still add to the collection without instantiating it.

Join Table
A common mismatch between objects and relational tables is that a  does not require a back reference in Java, but requires a back reference foreign key in the database. Normally it is best to define the  back reference in Java, if you cannot or don't want to do this, then you can use an intermediate join table to store the relationship. This is similar to a  relationship, but if you add a unique constraint to the target foreign key you can enforce that it is.

JPA defines a join table using the  annotation and   XML element. A  can be used on a   or   mappings.

See also, Undirectional OneToMany

Example of a OneToMany using a JoinTable database
EMPLOYEE (table)

EMP_PHONE (table)

PHONE (table)

Object not in collection after refresh.

 * See Object corruption.

=Advanced=

Unidirectional OneToMany, No Inverse ManyToOne, No Join Table (JPA 2.x ONLY)
JPA 1.0 does not support a unidirectional  relationship without a. Since JPA 2.0 there is a support for unidirectional. In JPA 2.x a  can be used on a   to define the foreign key, some JPA providers may support this already.

The main issue with an unidirectional  is that the foreign key is owned by the target object's table, so if the target object has no knowledge of this foreign key, inserting and updating the value is difficult. In a unidirectional  the source object take ownership of the foreign key field, and is responsible for updating its value.

The target object in a unidirectional  is an independent object, so it should not rely on the foreign key in any way, i.e. the foreign key cannot be part of its primary key, nor generally have a not null constraint on it. You can model a collection of objects where the target has no foreign key mapped, but uses it as its primary key, or has no primary key using a  collection mapping, see Embeddable Collections.

If your JPA provider does not support unidirectional  relationships, then you will need to either add a back reference   or a. In general it is best to use a  if you truly want to model a unidirectional   on the database.

There are some creative workarounds to defining a unidirectional. One is to map it using a, but make the target table the. This will cause an extra join, but work for the most part for reads, writes of course will not work correctly, so this is only a read-only solution and a hacky one at that.

Example of a JPA 2.x unidirectional OneToMany relationship database
EMPLOYEE (table)

PHONE (table)

Example for a non-null join column
In case your join column is non-null you need to specify

/Mapping

title: Java Persistence/OneToMany


text:
Small and Medium Enterprises and ICT/Foreword

In an ever-changing and dynamic world, the advent and adoption of Information and Communication Technologies (ICTs) across the globe has permanently altered the rules of the game and expectations of the new digital and inter-connected economies. Traditional notions of trans-boundary trade have in the past two decades changed dramatically to acknowledge and embrace, at times reluctantly, the increasing number of financial transactions and trade-related activities that take place purely via the Internet and technologically assisted tools.

The role of ICTs in advancing the growth of national economies through efficiency and productivity, and expanded market reach is both undisputed and irreversible. It is within this vein that adequate and strategic attention has to be placed so that these new opportunities provided by ICts are not purely limited and accessible only by the larger corporations within national economies. As numerous reports have indicated, small and medium enterprises (SMEs) constitute almost 95 percent of enterprises within the region and directly serve as both the backbone and driver of national economies.

The Asia-Pacific region itself is currently at a critical juncture in terms of ICT adoption, where it both hosts the fastest-growing ICT markets and ICT industries in the world and is also home to low adoption of ICTs and low penetration in some countries. The slow adoption has been due to numerous major constratins that range from lack of skilled technical capacities to issues related to inadequate connectivity and infrastructure. In addition, a weak understanding of the expectations and demands of the new digital economies has also placed many SMEs in an unenviable position of being unable to participate in the new digital knowledge economy.

The United Nations agencies in the region are continuously working in close collaboration with various international development partners and civil society organizations to assist national governments in leveraging on ICTs, thus enabling greater effective and equitable participation in the global and regional economy and benefit from enhanced global and regional trade and commerce.

The United Nations Economic and Social Commission for Asia and the Pacific (UNESCAP), for example, has worked towards a harmonized development of legal and regulatory systems for electronic commerce in Asia and the Pacific, as well as the development of enabling policies for trade and investment in the ICT Sector of the Greater Mekong Subregion. It has also assisted in trade and investment promotion through effective use of ICTs in Pacific island developing countries. In 2006, UNESCAP established the Asian and Pacific Training Centre for Information and Communication Technology for Development (APCICT) to build capacity of member countries in the area of ICT for social and economic development.

It is within this context that I welcome this publication by the UNDP Asia - Pacific Development Information Programme (UNDP-APDIP) and APCICT to provide a critically needed e-Primer that elaborates on the concepts and definitions of the knowledge economy, the regional challenges, and policy frameworks and recommendations for governments within the region.

UNESCAP and UNDP-APDIP have also collaborated extensively to help build the national capacities of policy makers to formulate strategic policies and the necessary enabling environments to encourage SMEs to take advantage of the Internet to create business opportunities in Asia and the Pacific.

This is premised on the fact that the appropriate adoption and utilization of ICTs within business processes and operations of SMEs, at the minimum, will significantly strengthen nationaleconomies and provide new opportunities for enhanced efficiency and integration and flow of regional trade and commerce. The risk of exclusion of economies from the global and regional economies would be daunting, should appropriate action to encourage the adoption of ICTs not be taken by governments within the region. As such, governments within the region have a critical role to ensure that adequate policies and initiatives are in place and enabling environments are created to encourage the adoption of ICTs within business processes of SMEs. The future and shape of the regional economic landscape is changing dramatically and it is imperative that all efforts undertaken for a more equitable and sustainable approach towards addressing these developments do not impede ICT adoption by SMEs in the region.


text:
User talk:68.224.164.106

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.– Mike.lifeguard  | talk 14:31, 18 September 2007 (UTC)

title: User talk:68.224.164.106


text:
Corps-Style Marching

Since the late 1970s, corps-style marching has replaced so-called "Big Ten-style" marching as the dominant technique classification among competitive high school marching bands. Its rise to pre-eminence among high schools, along with modern drum & bugle corps where it has always been dominant and a small but growing number of college bands, has raised the demand for instructors well-versed in all facets of technique, and familiar with all the variants of the general style. This book is geared towards:
 * The instructor who wishes to gain a greater understanding of the stylistic and physiological concepts behind corps-style marching, and to understand the variants which he may be asked to teach but was never exposed to in his own performing career
 * The performer who wishes to pursue an understanding of what he is doing beyond the instruction provided to him by his visual caption staff.

Authors & Contributors
This book has been written and edited by those listed on the Authors & Contributors page.

Part 1: Technique

 * 1) Principles
 * 2) Posture
 * 3) Body Carriage
 * 4) Horn Carriage
 * 5) Horn Movements
 * 6) Commands
 * 7) Mark Time
 * 8) Timing and Tempo
 * 9) High Mark Time
 * 10) Forward Step
 * 11) Backwards Step
 * 12) Crab Step
 * 13) Flanking
 * 14) Sliding
 * 15) Direction Change Technique
 * 16) Step Sizes

Part 2: Parade Marching

 * 1) The Block
 * 2) Dress and Cover
 * 3) Maintaining Spacing
 * 4) Turning Corners
 * 5) Timing

Part 3: Drill Marching

 * 1) Basic Formations
 * 2) Coordinates
 * 3) Form and Interval
 * 4) Dress, Cover, Set, and Guide
 * 5) Maintaining Forms
 * 6) Maintaining Tempo
 * 7) Odd Meters

Part 4: Appendices

 * 1) Construction and Use of a Foot Guide

title: Corps-Style Marching


text:
Famous Theorems of Mathematics/Algebra

Algebra is a branch of mathematics concerning the study of structure, relation and quantity. Elementary algebra is often part of the curriculum in secondary education and provides an introduction to the basic ideas of algebra, including effects of adding and multiplying numbers, the concept of variables, definition of polynomials, along with factorization and determining their roots.

Algebra is much broader than elementary algebra and can be generalized. In addition to working directly with numbers, algebra covers working with symbols, variables, and set elements. Addition and multiplication are viewed as general operations, and their precise definitions lead to structures such as groups, rings and fields.

Proofs are arranged in the following sections:

Linear Algebra
Linear algebra is the branch of mathematics concerned with the study of vectors, vector spaces (also called linear spaces), linear maps (also called linear transformations), and systems of linear equations. Linear algebra is also intimately connected with matrix theory. Proofs in linear algebra are also sub-divided into these portions:

 * /Matrix Theory/
 * /Vector Spaces/
 * /Linear Transformations/

title: Famous Theorems of Mathematics/Algebra


text:
User:Holon67~enwikibooks

OK, time to move on to places more secure.

title: User:Holon67~enwikibooks


text: Subject:Performing arts

title: Subject:Performing arts


text:
User talk:Deus Trombonae

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

title: User talk:Deus Trombonae


text:
Small and Medium Enterprises and ICT/Overview

It is commonplace for governments to have policies to encourage the growth of local small and medium enterprises (SMEs) as they can help to directly alleviate poverty by increasing income levels and creating jobs. However, as the global economy becomes increasingly reliant on information and communications technology (ICT) to receive, process, and send out information, the small businesses within the Asia-Pacific region - which form a significant portion of their developing economies - have yet to reap these benefits evenly. This is because obtaining such opportunities rests largely upon the ability of SMEs to engage in the regional and global economic business networks which, in turn, demand provision of a prerequisite level of access to and use of ICT. Unless these prerequisites are in place, these SMEs are set to lose out on opportunities to integrate into the global supply chain, bid for outsourcing businesses, and increase their internal productivity and efficiency.

SMEs can benefit either as producers of ICT or as users of ICT for purposes such as increased productivity, faster communications and reaching new clients. However, it must be noted at the outset that not all SMEs need to adopt ICT tools to the same degree of sophistication. The most basic ICT tool is having communication capabilities through fixed lines or mobile phones, whichever is more cost effective. SMEs may then use a personal computer (PC) with basic software for simple information processing needs such as producing text or keeping track of accounting items. Internet access enables SMEs to have advanced communication capabilities such as email, web browsing and launching a website. SMEs in manufacturing can benefit from more advanced ICT tools such as Enterprise Resource Planning (ERP) or inventory management.

While ICT can benefit SMEs in multiple ways, SMEs within the Asia-Pacific region have been slow to adopt ICT as they face major constraints such as poor telecommunications infrastructure, limited ICT literacy, inability to integrate ICT into business processes, high costs of ICT equipment, incomplete government regulations for e-commerce, and a poor understanding of the dynamics of the knowledge economy. To remove these constraints, governments need to do more than merely improving ICT national policy and promoting SMEs in the ICT sector. Instead, governments should embed ICT components into overall SME policy in a comprehensive and focused manner. However, this does not mean that SME policy should be the same for all industries. SMEs in different sectors use ICT differently and will adopt them at a different pace. Additionally, SMEs need help in translating the benefits of ICT to their core business. The willingness of SMEs to integrate e-business practices depends on how much it can directly improve their core business and how much the potential benefits outweigh the definite costs. For example, a tour operator may be more likely to purchase computers and Internet connectivity in order to service its clients than a grocery store owner will be willing to convert its cash register system into point-of-sale (POS) technology to better manage inventory. By recognizing these differences and focusing their efforts on removing the constraints, governments can play an important role in encouraging SMEs to become more effective users of ICT. This can have wider impact on national economies since SMEs are the engines of economic growth.

This e-Primer will show why SMEs should adopt ICT, explore the possible uses of ICT, survey past ICT policies and programmes for SMEs, and recommend possible policies for governments to consider.


text:
Corps-Style Marching/Technique/Principles

Corps-style marching technique aims to serve four basic purposes:
 * 1) Eliminate the disruptions to airflow and embouchre (for wind players) or rhythmic and dynamic accuracy (for percussionists) that can be caused by a non-fluid motion along the ground
 * 2) Ensure that the sound of all players is focused in generally the same direction, towards the audience on one side of the field
 * 3) Make all movements crisp, precise, and defined so as to make marching formations easier to read and more pleasant to watch
 * 4) Give the performer an air of assured confidence

A normal walking gait, as well as so-called "Big Ten"-style marching, involves the foot impacting the ground rather forcefully. For wind players especially, this can cause problems with maintaining a steady sound akin to the problems one experiences when talking while driving in a car down a rough gravel road. Corps-style marching aims to eliminate this by minimizing the force with which the foot impacts the ground. It does this in two ways: Specifically, the goal is to achieve a gliding or rolling motion in the foot that smooths out the natural jolts and bumps experienced, especially when performing on rough ground.
 * Minimizing the total amount of force the ground is impacted with
 * Minimizing the component of that force that is normal to the ground


text:
User talk:4.89.245.128

Please do not add inappropriate external links to Wikibooks. Wikibooks is intended to be read without the need for external reference and requires content rather than external links particularly those which are for advertising or promotion. Inappropriate links may include (but are not limited to) links to personal web sites, links to web sites with which you are affiliated, and links that exist to attract visitors to a web site or promote a product. If you feel the link should be added to the article, then please discuss it on the article's talk page rather than re-adding it. See the welcome page to learn more about Wikibooks. Thank you. Urbane  (Talk)   (Contributions)  18:35, 18 September 2007 (UTC)

title: User talk:4.89.245.128


text:
User talk:164.58.189.249

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. Urbane  (Talk)   (Contributions)  18:57, 18 September 2007 (UTC)

title: User talk:164.58.189.249


text:
Wikijunior:Colors/Pink

pl:Wikijunior:Kolory/Różowy nl:Wikijunior:Kleuren/Roze

title: Wikijunior:Colors/Pink


text:
Wikijunior:Colors/Brown

fr:Wikijunior:Les_couleurs/Marron pl:Wikijunior:Kolory/Brązowy nl:Wikijunior:Kleuren/Bruin

title: Wikijunior:Colors/Brown


text:
Cookbook:Tom Yum Gai

Ingredients

 * 400 grams (about 1 lb) boneless chicken meat, diced
 * 3 cups chicken stock
 * 100 grams (3.5 oz) straw mushrooms, halved
 * 6 cherry tomatoes
 * 1 fresh lemongrass stem, cut into short lengths
 * 2–3 kaffir lime leaves, torn
 * 3 tbsp Thai fish sauce
 * 4 tbsp fresh lime juice
 * ½ tsp sugar
 * 5–6 hot fresh Thai chilies, just broken with pestle

Procedure

 * 1) Place the stock in a pot, add the lemongrass and kaffir lime leaves, and bring to boil over medium heat.
 * 2) Add the chicken meat, mushroom, fish sauce, lime juice, and sugar; cook slowly and uncovered for 10 minutes. Do not stir.
 * 3) Add the tomatoes and chilies and cook for 5 more minutes. Remove from heat.
 * 4) Serve with steamed jasmine rice.

title: Cookbook:Tom Yum Gai


text:
Chess Opening Theory/1. e4/1...c5/2. a3

=Mengarini Variation= This opening is an interesting variation of the Wing Gambit. The idea is to prepare b4 with a3. The main continuation is /2...Nc6/ although many moves are possible.

Theory table
.

1.e4 c5 2.a3

title: Chess Opening Theory/1. e4/1...c5/2. a3


text:
User talk:74.121.186.230

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.

Xania talk 21:44, 18 September 2007 (UTC)

title: User talk:74.121.186.230


text:
User talk:66.241.89.9

You have been blocked from editing Wikibooks  as a result of your .  Please note that page blanking, addition of random text or spam, deliberate misinformation, privacy violations, personal attacks; and repeated, blatant violations of our neutral point of view policy are considered vandalism. If you wish to make useful contributions, you are welcome to come back after the block expires.

Your block will expire in 2 hours. If you continue vandalising Wikibooks then future blocks will be longer.

Xania talk 21:48, 18 September 2007 (UTC)

title: User talk:66.241.89.9


text:
User talk:138.23.204.157

Please stop introducing incorrect information into articles. It is considered vandalism. If you would like to experiment, use the sandbox. Thank you.

Xania talk 22:01, 18 September 2007 (UTC)

title: User talk:138.23.204.157


text:
User:Loiseaulybre

Retrouvez mon profil sur Wikipédia: Find out my profil on Wikipedia:

English Wikipedia ou French Wikipédia

title: User:Loiseaulybre


text:
User talk:83.31.155.195

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.

Xania talk 23:19, 18 September 2007 (UTC)

title: User talk:83.31.155.195


text:
User talk:70.48.238.143

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.

Xania talk 00:35, 19 September 2007 (UTC)

title: User talk:70.48.238.143


text:
User:Mcoxx007

meryl's page

title: User:Mcoxx007


text:
Chess Opening Theory/1. e4/1...c5/2. Nf3/2...Nc6/3. d4/3...cxd4/4. Nxd4/4...Nf6/5. Nc3

= Open Sicilian with 2...Nc6 = Moves:1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3

OK, so Black has a few choices here, and there's nothing wrong with d6 or e6.

Now let's talk about the move that has come from non-existence in the early 70's to a place in the repertoire of every super-GM and left a generation of chess writers wringing their hands in despair at the crazy stuff these kids are getting away with: the dramatic lunge e5!

To state the obvious, e5 kicks White's knight. Of course we know that not every such "tempo-gaining" pawn move is good; the acid test is whether the damage it does to the structure outweighs the inconvenience to the opponent. After ...e5 Black's d-pawn is backward on a half-open file (gasp!) and has no foreseeable prospect of advancing to d5, which means the king's bishop will be stuck behind a pawn on d6 and that d5, with a white knight already just one move away, will be a long-term White outpost.

So for a century or so that was the end of the matter, until everyone started playing the Najdorf: 1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 followed by, if possible, ...e5! The point being that, after the customary opposite sided castling, in a position in which mutual mating attacks were the order of the day, the stabilisation of the centre brought about by ...e5 was far more relevant than something some Danish chap had said about backward pawns forty years earlier. And while it's true that the king's bishop will never be the jewel of Black's position after d6 and e5, to quote Mihai Suba, "Bad bishops protect good pawns!"

Far from being a liability, the Najdorf structure was something players wanted to force onto the board, avoiding if possible any of the Bg5 or Bc4 nonsense seen in the Najdorf in which the e-pawn must meekly shuffle out to e6. So the idea of an immediate 5...e5 came up. In the 2...d6 line it didn't really work because of 6.Bb5+! exchanging Black's good bishop - this being the reason behind 5...a6 in the Najdorf. But why not try it with the check pre-blocked by 2...Nc6?

Why not indeed, thought Grandmaster Yevgeny Sveshnikov.

Theory table
1.e4 c5 2.Nf3 Nc6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3


text:
Chess Opening Theory/1. e4/1...e5/2. Nf3/2...Nc6/3. d4/3...exd4/4. Nxd4/4...Qh4

4...Qh4
5. Nf5 Qxe4+ 6. Ne3. White will follow with Nc3 to prepare a longer building development. (MasPur08)

The Main Line is:

5. Nc3 Bb4 White's pawn on e4 is almost overloaded 6. Be2 ... End of Main Line Scotch Game, Steinitz Variation.

6. Be2 appears to lose a pawn after 6 ... Qxe4 or 6...Bxc3 7. bxc3 Qxe4

But White can reply with a powerful attacking idea 8. Nb5, with slight edge. +-


text:
User talk:Ied

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.

This page appears to be a stub and a Wikibooks editor has added a query as to whether it was perhaps created in error. If developed further the tag should be removed. It will automatically be considered a candidate for speedy deletion in 7 days if not modified further. – Mike.lifeguard  | talk 02:11, 19 September 2007 (UTC)

title: User talk:Ied


text:
User talk:64.50.249.47

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.– Mike.lifeguard  | talk 02:11, 19 September 2007 (UTC)

title: User talk:64.50.249.47


text:
User talk:Mcoxx007

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 02:12, 19 September 2007 (UTC)

title: User talk:Mcoxx007


text:
User talk:Darth NormaN

Come introduce yourself at the new users page. If you have any questions, you can ask there or contact me personally.– Mike.lifeguard  | talk 02:12, 19 September 2007 (UTC)

title: User talk:Darth NormaN


text:
C++ Programming/Operators/Pointers

Pointers, Operator *
The * operator is used when declaring pointer types but it is also used to get the variable pointed to by a pointer.

Pointers are important data types due to special characteristics. They may be used to indicate a variable without actually creating a variable of that type. Because they can be a difficult concept to understand, some special effort should be spent on understanding the power they give to programmers.

Pointers have a very descriptive name. Pointers variables only store memory addresses, usually the addresses of other variables. Essentially, they point to another variable's memory location, a reserved location on the computer memory. You can use a pointer to pass the location of a variable to a function, this enables the function's pointer to use the variable space, so that it can retrieve or modify its data. You can even have pointers to pointers, and pointers to pointers to pointers and so on and so forth.

Declaring
Pointers are declared by adding a * before the variable name in the declaration, as in the following example:

Watch out, though, because the * associates to the following declaration only:

You can also have multiple pointers chained together, as in the following example:

Assigning values
Everyone gets confused about pointers as assigning values to pointers may be a bit tricky, but if you know the basics, you can proceed more easily. By carefully going through the examples rather than a simple description, try to understand the points as they are presented to you.

 * Assigning values to pointers (non-char type)

The second statement uses " " the reference operator and  to tell the compiler this is a pointer variable and assign   variable's address to it. In the last statement, it outputs the value from the  variable by de-referencing the pointer using the   operator.

 * Assigning values to pointers (char type)

So as mentioned early, a pointer is a variable which stores the address of another variable, as you need to initialize an array because you can not directly assign values to it. You will need to use pointers directly or a pointer to array in a mixed context, to use pointers alone, examine the next example.

Remember you can't leave the pointer alone or initialize it as nullptr cause it will case an error. The compiler thinks it is as a memory address holder variable since you didn't point to anything and will try to assign values to it, that will cause an error since it does not point to anywhere.

Dereferencing
This is the * operator. It is used to get the variable pointed to by a pointer. It is also used when declaring pointer types.

When you have a pointer, you need some way to access the memory that it points to. When it is put in front of a pointer, it gives the variable pointed to. This is an lvalue, so you can assign values to it, or even initialize a reference from it.

Since the result of an & operator is a pointer, *&i is valid, though it has absolutely no effect.

Now, when you combine the * operator with classes, you may notice a problem. It has lower precedence than .! See the example:

The error happens because the compiler looks at p.num first ("." has higher precedence than "*") and because p does not have a member named num the compiler gives you an error. Using grouping symbols to change the precedence gets around this problem.

It would be very time-consuming to have to write (*p).num a lot, especially when you have a lot of classes. Imagine writing (*(*(*(*MyPointer).Member).SubMember).Value).WhatIWant! As a result, a special operator, <tt>-></tt>, exists. Instead of <tt>(*p).num</tt>, you can write <tt>p->num</tt>, which is completely identical for all purposes. Now you can write <tt>MyPointer->Member->SubMember->Value->WhatIWant</tt>. It's a lot easier on the brain!

Null pointer
The null pointer is a special status of pointers. It means that the pointer points to absolutely nothing. It is an error to attempt to dereference (using the <tt>*</tt> or <tt>-></tt> operators) a null pointer. A null pointer can be referred to using the constant zero, as in the following example:

Note that you can't assign a pointer to an integer, even if it's zero. It has to be the constant. The following code is an error:

There is an old macro, defined in the standard library, derived from the C language that inconsistently has evolved into #define NULL ((void *)0), this makes <tt>NULL</tt>, always equal to a null pointer value (essentially, 0).

Since a null pointer is 0, it will always compare to 0. Like an integer, if you use it in a true/false expression, it will return false if it is the null pointer, and true if it's anything else:

This program will output that the pointer is NULL, then that it isn't NULL twice, then again that it is.

Pointers and multidimensional arrays

 * Pointers and Multidimensional non-Char Arrays

A working knowledge of how to initialize two dimensional arrays, assign values to arrays, and return values from arrays is necessary. In depth information about arrays can be found in section 1.4.10.1.1 Arrays. However, when relevant to the understanding of pointers, arrays will be mentioned here, as well.

 * The main objects are:
 * 1) Assign Values to Multidimensional Pointers
 * 2) How to use Pointers with Multidimensional Arrays
 * 3) Return Values
 * 4) Initialize Pointers and Arrays
 * 5) How to Arrange Values in them

In non-Char Type you need to involve arrays with Pointers since Pointers treat char* type to in special way and other type to another way like only refer the address or get the address and get the value by indirect method.
 * 1) Assign Values to Multidimensional Pointers.

If you declare it like this way:

It will probably generate an error! Because pointers used in non-Char type only directly, in char types refer the address of another variable by assigning a variable first then you can get its (that assigned variable) value indirectly! There is another way instead it is You can use one of them to assign value to Array through the pointer to return values you can use either the appropriate Array or Pointer.

This is bit hard and even hard to remember so I suggest keep practicing until you get the spirit of Pointers only! You cannot use Pointers + Multidimensional Arrays with Char Type. Only for non-char type.
 * Pointers and multidimensional char arrays

 * Multidimensional pointer with char type

here the 5 in the first statement is the number of rows (no columns need to be specified in pointer it is only in Arrays) the next statement assigns another string to position 0 which is the position of first place of first statement. finally return the answer

In your system memory each memory block got an address so whenever you compile the code at the beginning all variable reserve some space in the memory but in Dynamic Memory Allocation it only reserve when it needed it means at execution time of that statement this allocates memory in your free space area(unused space) so it means if there is no space or no contiguous blocks then the compiler will generate and error message
 * Dynamic memory allocation

This is same as assign non-char 1 dimensional Array to Pointer
 * Dynamic memory allocation and pointer non-char type

The first statement's Lside(left side) declares an variable and Rside request a space for double type variable and allocate it in free space area in your memory. So next and so fourth you can see it increases the integer value that means *(pVal+0) pVal -> if this uses alone it will return the address corresponding to first memory block. (that used to store the 10) and 0 means move 0 block ahead but its 0 means do not move stay in current memory block, and you use parenthesis because + < * <  consider the priority so you need to use parenthesis avoid to calculating the * first
 * is called INDIRECT Operator which DE-REFERENCE THE Pointer and return the value corresponding to the memory block.

(Memory Block Address+steps)
 * -> De-reference.

 * Dynamic memory allocation and pointer char type

You can see this is the same as static memory declaration, in static declaration it goes:

 * Dynamic memory allocation and pointer non-char array type

Indirection operator ->
This pointer indirection operator is used to access a member of a class pointer.

Member dereferencing operator .*
This pointer-to-member dereferencing operator is used to access the variable associated with a specific class instance, given an appropriate pointer.

Member indirection operator ->*
This pointer-to-member indirection operator is used to access the variable associated with a class instance pointed to by one pointer, given another pointer-to-member that's appropriate.

Pointers to functions
When used to point to functions, pointers can be exceptionally powerful. A call can be made to a function anywhere in the program, knowing only what kinds of parameters it takes. Pointers to functions are used several times in the standard library, and provide a powerful system for other libraries which need to adapt to any sort of user code. This case is examined more in depth in the Functions Section of this book.

title: C++ Programming/Operators/Pointers


text:
User talk:Bobbi ashley

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the 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 a good idea to add this page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! Any particular help you need just ask... --Panic 06:25, 19 September 2007 (UTC)

title: User talk:Bobbi ashley


text:
User talk:Freeworld~enwikibooks

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the 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 a good idea to add this page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 06:26, 19 September 2007 (UTC)

Your account will be renamed
Hello,

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

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

title: User talk:Freeworld~enwikibooks


text:
User talk:SamClayton~enwikibooks

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the 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 a good idea to add this page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 06:27, 19 September 2007 (UTC)

Your account will be renamed
Hello,

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

Unfortunately, your account clashes with another account also called SamClayton. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name SamClayton~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:SamClayton~enwikibooks


text:
User talk:Tprev

Welcome message
Hello, and welcome to Wikibooks!

Here are some tips to help you get started:
 * To learn the wiki-markup-language syntax, see Help:Editing.
 * You should sign your name on Talk and vote pages using four tildes, like this: ~~~~
 * There is a box at the top of the edit window that will insert this, too; it looks like part of a signature.
 * Remember to conduct any editing experiments in the sandbox.
 * You can tell the community something about yourself in your userpage.
 * You can get to this page by clicking the tab at the top of the page labeled with your registered username.
 * If you are a Wikipedian, see Wikibooks for Wikipedians for a primer on how things work here (it's a little different).
 * If you want to base your work here on materials from Wikipedia, please use WB:RFI (requests for importation) to bring the material over in compliance with the GFDL.
 * If you're an instructor and plan on using Wikibooks for a class project, see Guidelines for class projects
 * Please say hello at the 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 a good idea to add this page to your "watchlist" so that you can see when any new information is posted there. You can do that by clicking the tab labeled "watch" at the top of the page.

Good luck! --Panic 06:29, 19 September 2007 (UTC)

title: User talk:Tprev


text:
Cookbook:Homemade Corned Beef

Historically Irish Corned Beef has been world renowned for being served as the primary preserved meat on the Royal Navy ships of the 16th and 17th century, with no equal, even though unaffordable by the Irish peasants themselves. Realistically, it wasn't until the Irish in America became successful that they could once again afford to eat their national cuisine and their wonderful invention could be savoured in the average household giving the dish special meaning.

Ingredients

 * 1 ea. (6 lb / 2.75 kg) round/brisket of corned beef
 * 3 carrots, sliced diagonally
 * 3 medium onions, chopped
 * Mixed herbs
 * 1 teaspoon ground allspice
 * 1 teaspoon ground cloves
 * ½ pint Guinness beer

Procedure

 * 1) Put the brisket on a bed of the carrots and onions in a large saucepan.
 * 2) Just barely cover everything with room temperature water, add the allspice and cloves, and simmer lightly for 4 hours.
 * 3) Add the beer, and simmer for another hour.
 * 4) Serve it cold on Christmas. Since there is no need to slave in the kitchen this day, the brisket should be removed and pressed between 2 dishes with a weight on top, reserving the juice for hot topping gravy; other days you can serve hot.

title: Cookbook:Homemade Corned Beef


text:
Muggles' Guide to Harry Potter/Characters/Ariana Dumbledore

Overview
Ariana Dumbledore was the sister of Albus and Aberforth Dumbledore. She died quite young, at approximately 14 years of age.

Deathly Hallows
Ariana is first mentioned in Albus Dumbledore's obituary, penned by Elphias Doge, Albus' close friend. Elphias simply writes that she had died just after Albus finished school.

Rita Skeeter also writes about the Dumbledore clan in a tell-all book that is filled with innuendo and scurrilous rumour. Rita claims that Ariana was seldom seen outside the house, and suggests she might have been a Squib.

In conversation with Doge and Ron Weasley's Auntie Muriel, Harry learns that Rita's source, Bathilda Bagshot, had glimpsed but never actually met Ariana. Muriel believes Ariana was a Squib, an embarrassment to the family, though Doge protests she was merely sickly. Muriel retorts that she was never known to have been treated at St. Mungo's Hospital. Muriel also mentions that Aberforth broke Albus' nose in a fight at Ariana's funeral.

Aberforth Dumbledore later reveals the true story to Harry. Three Muggle boys had witnessed Ariana performing magic when she was still quite young. Aberforth says the boys "forced their way through the hedge and when she couldn't show them the trick, they got a bit carried away trying to stop the little freak doing it." What the boys did to her is not specified by Rowling, but the encounter left her emotionally unstable and unable to control magic. Her father, Percival, after attacking the boys in retaliation, was sentenced to Azkaban prison, where he died. The mother, Kendra, fearing Ariana's condition would force her into to being committed to St. Mungo's, kept her daughter hidden. Aberforth was the only one able to control her wild fits.

After Kendra's death, a conflict emerged between Gellert Grindelwald, who wanted wizards to enslave Muggles, and Albus, who believed Muggles should be ruled benignly and felt honour-bound to care for his family. When Aberforth uncovered the other two's Dark scheme a three-way fight erupted and quickly escalated; Ariana, thrown into a fit, was fatally struck by a stray curse. Grindelwald immediately fled to Europe. Neither Albus or Aberforth knew whose curse killed Ariana, though both were forever burdened by their guilt.

While Ariana is never seen, her portrait hangs Aberforth's living room. It acts as the messenger that summons Neville to open the passage which allows Harry, Ron, and Hermione, among others, to enter Hogwarts before the final battle.

Strengths
Given that her untrained magic is so powerful, we can safely guess that Ariana would have been a very powerful witch had she been allowed to develop normally.

Weaknesses
According to Aberforth (Harry Potter and the Deathly Hallows, UK / Canada first edition p455), when Ariana was attacked by the Muggle boys, "[i]t destroyed her, what they did: she was never right again. She wouldn't use magic, but she couldn't get rid of it: it turned inwards and drove her mad, it exploded out of her when she couldn't control it, and at times she was strange and dangerous. But mostly she was sweet, and scared, and harmless." From this description, particularly if we assume that magic is largely a mental function, it seems likely that Ariana was brain-damaged at an early age, and was never able to be trained to use her magic properly.

Relationships with Other Characters
Ariana had a particularly close relationship with her second eldest brother Aberforth. In Harry Potter and the Deathly Hallows, Aberforth says, "I could get her to eat when she wouldn't do it for my mother, I could get her to calm down when she was in one of her rages." This leads us to believe that Ariana liked Aberforth the best. Regarding Ariana's relationship with her famous eldest brother, Albus, Aberforth says he, "didn't want to be bothered with her." Albus apparently shut himself up in his room with his books and correspondence, and Ariana, his sister as much as Aberforth's, was his second concern. After their mother was killed in a tragic accident involving Ariana, Albus became slightly more responsible for his sister's care, though that only lasted until Gellert Grindelwald arrived. He was Albus' supposed "equal", and Ariana once again took a back seat. It is likely that Ariana's favorite was always Aberforth, up until her tragic death.

Analysis
There are, perhaps thankfully, no details of what was done to Ariana or what the resulting handicap was. From Aberforth's description, it is almost certain that she received brain damage; the description "sweet, and scared," with occasional unpredictable outbursts of uncontrollable rage, could be the description of any number of developmental disabilities in which higher brain centers don't develop, or develop incorrectly. Children with these sorts of disabilities can seem to have almost superhuman physical strength, requiring multiple adults to restrain them from hurting themselves or others. Couple this sort of behavior with the ability to do magic, as has happened with Ariana, and it seems almost inevitable that carers will be gravely injured.

We have heard a rumour, never fully confirmed, that Albus and Aberforth fought at Ariana's funeral, with Albus' nose being broken as a result. It seems more likely that Aberforth, affronted by Albus' grief, which he will have believed to be faked because of how Albus treated Ariana while she was alive, simply hauled off and slugged him, and that Albus neither resisted not retaliated. Albus, of course, felt that ultimately he was responsible for Ariana's death, and quite possibly felt that Aberforth's punch was something he deserved.

Questions

 * 1) Do you think Ariana Dumbledore liked Grindelwald?

Greater Picture
Albus Dumbledore, in the "Waystation", tells Harry that having seen what power once did to him, he never wanted it again, which is why he so steadfastly declined the Minister for Magic post when it was offered. Reviewing the episodes in question, including the duel in which Ariana died, we can see that it is not the possession of power that caused the problems Albus worries about. Rather, it was the seeking of power, by both himself and Grindelwald, that resulted in Ariana's death.


text:
User talk:202.63.252.5

Please stop adding nonsense to Wikibooks. It is considered vandalism. If you would like to experiment, use the sandbox. Thank you. --Jomegat 12:26, 19 September 2007 (UTC)

title: User talk:202.63.252.5


text:
German/Appendices/Vocabulary/Clothes

First this English word is shown, which phonetically comes closest to the German word.

title: German/Appendices/Vocabulary/Clothes


text:
Cyber Guide to ODU Career Management/Get Oriented/How we do it

On Campus Recruiting (OCR) Scheduling/Information Sessions Process
1) Contact received from Employer (either by Cynthia or Liaison/Senior Staff Member): Based on room availability, Cynthia will schedule a date for the OCR Info Sessions or Interviewing Sessions.

2) Cynthia will determine based on major or specific position posted, who will be the appropriate liaison to be assigned as POC for marketing and coordination of event.  If there is doubt as to what majors or who should be assigned, Cynthia will consult with me or one of the liaisons as available for guidance.

3) Cynthia will send an email memo to the assigned liaison letting them know of the employer/date scheduled and contact info.

4) The assigned liaison will then be responsible for the marketing and coordination of the event as appropriate and will respond to Cynthia's email within 3 working days that the process has started and who is the POC from their college/area.

5) Cynthia will then send a confirmation email to the employer to indicate the date and designated POC.

6) Cynthia will contact the designated POC 5 working days to ensure that all logistics and preparations for the event are set.

7) Cynthia will contact the employer 1-2 working days prior to the event to make sure they have parking passes, directions, etc.


text:
US Criminal Law/Defenses/Prosecutorial misconduct

Prosecutorial misconduct can come in various forms, but it most commonly arises in a few ways. First, a prosecutor's sidebar statements during trial can be prosecutorial misconduct. These may be comments about the defendant, his attorney, a witness, or the judge. These comments can result in a mistrial with Pre-Judice (barring reprosecution), assuming the trial court concludes that they were made for the purpose of inciting the motion for mistrial. Other times, they will just result in a mistrial without prejudice. Second, a prosecutor's failure to turn over material, exculpatory evidence to the defense, in dereliction of his duties under Brady v. Maryland, 373 U.S. 83 (1963). This is a type of prosecutorial misconduct which may be raised at virtually any time, even post-conviction, as it is a constitutional error of great magnitude. If the defendant can prove the prosecutor failed to turn over Brady material, he will typically receive a new trial. Third, a prosecutor's selective prosecution of a person or group of people may be misconduct. Also, if a prosecutor increases the punishment or charges based on the defendant's exercise of his rights (to jury trial, of appeal, etc.), this may (under certain circumstances) be misconduct.


text:
User talk:Songard

Information Technology and Technology - 2007 fall semester 資訊科技與教育

請親愛的組員們用自己的wiki帳號上來po，我已經把大家要po的地方都區分好了，千萬不要刪掉別人的，等大家都po好我們再來寫小組定義！關係圖部分，請大家提供link，因為wiki的功能我還不是很確定會用！ by Dawn Wu

Dawn Wu's Wikibook
to be continued...

網路學習
小組定義：

Dawn的定義： web-based learning，利用網際網路為媒介進行同步、非同步的學習活動.

PaulLee的定義： 個體以「網路」為媒介，所進行的「學習」活動.

noword的定義： 以網路為學習平台，幫助增進知識或資訊充實的學習方式.

網路輔助學習
小組定義：

Dawn的定義： 利用網際網路上的資源或是溝通工具（如E-mail、討論區等），輔助或擴充學習內容的深度與廣度.

PaulLee的定義： 等同「網路學習」.

noword的定義： 學習過程中利用網際網路來輔助增加學習的成效.

遠距教學
小組定義：

Dawn的定義： distance learning，教師與學生不需要直接面對面，透過網際網路及視訊媒體進行教學，多數為同步教學.

PaulLee的定義： 以「網路」為媒介所進行的「同步教學」活動.

noword的定義： 一種利用媒體，突破空間限制，將系統化設計的教材，傳遞給學習者的教學過程.

資訊科技融入教學
小組定義：

Dawn的定義： 將資訊科技融入教學活動或課程設計中，以提升教學品質與學習成效.

PaulLee的定義：

先定義「資訊科技」是用於管理和處理資訊所採用的各種技術的總稱. 它主要是應用電腦科學和通信技術來設計、開發安裝和實施資訊系統及應用軟體. 它也常被稱為「資訊及通訊科技」

以資訊科技為輔助工具，所進行的「教學」活動.

noword的定義： 將資訊科技應用於教學中，其為一輔助工具，使學習品質提升教育效果增進.

數位學習
小組定義：

Dawn的定義： 學習者透過數位媒介（如網際網路、數位教材、電子媒體等），進行同步、非同步或是混成式的學習活動.

PaulLee的定義： 在以數位形式的電子設備輔助下，所進行的「學習」活動

noword的定義： 學習者透過網路的學習方式，包含電腦化學習和網路技術的運用這兩個領域.

e-Learning
小組定義：

Dawn的定義： 同「數位學習」.

PaulLee的定義： 同「數位學習」.

noword的定義： 同「數位學習」.

關係圖
小組定義：

Dawn的定義： ←這是powerpoint檔案，開啟之後請記得點滑鼠

PaulLee的定義：

noword的定義：

Placeholder text
I noticed that you've left large amounts of placeholder text in some modules; please remove it. There's no need for placeholder text, except temporarily. Thanks; happy editing! – Mike.lifeguard  | talk 20:24, 9 December 2007 (UTC)

title: User talk:Songard


text:
US Criminal Law/Defenses/Denial of a speedy trial

Denial of a speedy trial can occur when the prosecution waits too long to try the defendant. This right is guaranteed by the Sixth Amendment to the United States Constitution and is applied to the states via the Fourteenth Amendment. Klopfer v. North Carolina, 385 U.S. 213 (1967). Barker v. Wingo set out some considerations analyzing speedy trial claims: (1) length of delay, (2) reason for delay, (3) assertion of the right, and (4) prejudice. 407 U.S. 514 (1972).

Factor One: Length of Delay

While there is no hard and fast rule on how long is too long, one rule of thumb is eight months. Courts will generally presume that the delay has been sufficient to satisfy a defendant's prima facie case of the denial of the right to a speedy trial when eight months have passed.

Factor Two: Reason for Delay

Court look to why the trial is delayed: common reasons are laboratory testing delays, overcrowded dockets, and witness unavailability. These will weigh for and against both sides and no hard and fast rule is apparent. The Court will also look at continuances and when and by whom they are requested. Also relevant is whether the continuances were opposed by either party.

Factor Three: Assertion of the Right

A defendant waiting two years to assert his right to a speedy trial will be in a worse position than the defendant who claims it after eight months. Also, a defendant who asks for dismissal instead of a speedily-held trial is not truly asserting his right, but rather is attempting to avoid criminal liability based on delay.

Factor Four: Prejudice

The Court will look to prejudice -- was the defendant harmed by a delay caused by the prosecution. For example, did witnesses die or move away or did their memories fade such that they could no longer be reliable.

Comparison of the Factors:

The Court will weigh the factors for and against a finding that speedy trial rights were violated and will act accordingly. If the Court finds speedy trial rights were violated, it will dismiss the prosecution with prejudice (barring reprosecution). If


text:
Home Remedies/Echinacea

Echinacea
Today, Echinacea is primarily used to reduce the symptoms and duration of the common cold and flu and to improve the symptoms of a cold, such as sore throat, cough, and fever. Echinacea has also been used throughout history to treat scarlet fever, syphilis, malaria, blood poisoning, and diphtheria. Herbalists also recommend Echinacea to help boost the activity of the immune system and to help the body fight infections. Many cultures can be directly associated with Echinacea. For example, Native Americans may have used Echinacea for over 400 years to treat infections and wounds and as a general "cure-all." Advancements in the research of Echinacea have been made in Germany to due to its increased popularity in The United States and Europe since the 1930s.

Echinacea is available in extracts, tinctures, tablets, capsules, and ointments or in a combination with other immune-boosting herbs, vitamins, and minerals, so because of the many different ways to use Echinacea, there are several ways to take it. One popular way that Echinacea is used is to try prevent a cold or flu by taking the herb throughout cold and flu season or just after exposure to an infection via a friend or loved one. This practice could be harmful though, as high doses of Echinacea over a substantial period of time (from six to eight weeks) can damage the liver.

Individuals with allergies to plants in the daisy family, tuberculosis, leukemia, diabetes, connective tissue disorders, multiple sclerosis, HIV or AIDS, any autoimmune diseases, or, possibly, liver disorders should not take Echinacea. There is some concern that Echinacea may reduce the effectiveness of medications that suppress the immune system.

Echinacea is one of the best selling herbal supplements today, and is designed to stimulate the immune system. It's made of show root and plant concentrate. There are things in it like calcium carbonate, cellulose, and Echinacea purpurea extract. Echinacea is made to strengthen the immune system, which would then result in a person being less susceptible to a type of illness such as the flu or cough.

Even though the recommended dosage has not been established, you can usually take one or two a day. It is also most commonly used during the winter months due to the susceptibility most people have to catch a cold during these months. Purportedly, if a dose is ingested immediately upon the onset of cold symptoms, and is taken every 2-4 hours, the immune system will successfully eliminate the infectious bacteria within one or two days.

title: Home Remedies/Echinacea