text:
Talk:Michael W. McConnell

Relationship to Mitch McConnell and religious faith
Does anyone know if this guy is Mitch McConnell's brother? They're both prominent Republicans from Louisville.

--Wwjdd 01:23, 4 October 2005 (UTC)

————

What is the religious faith of Judge Michael McConnell?

--SpeDIt 01:23, 28 October 2005 (UTC)

————

I don't think he's Mitch's brother, but I've not looked for a source. As for religious faith, his daughter is a Protestant, evengelical, I believe, but I'm not really sure. Definitely not Mormon, though, if that's what you were thinking.

--67.165.232.59 21:40, 23 December 2005 (UTC)

 * He is "no relation" to Mitch McConnell according to the Louisville Courier-Journal January 9, 2005. Salon.com, the New York Times, and other sources have characterized him as an evangelical Christian. Cool Hand  Luke  23:03, 5 November 2006 (UTC)

Additional biographical information
Can be found in Orrin Hatch's statement to the Judiciary Committee, which I have titled ref name="Hatch", for those interested in expanding this article. -- THF 02:06, 12 April 2007 (UTC)

Bot-created subpage
A temporary subpage at User:Polbot/fjc/Michael W. McConnell was automatically created by a perl script, based on this article at the Biographical Directory of Federal Judges. The subpage should either be merged into this article, or moved and disambiguated. Polbot (talk) 14:53, 5 March 2009 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Michael W. McConnell. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive http://web.archive.org/web/20110527113755/http://www.enotes.com/blogs/decision-blog/2007-05/tenth-blasts-minority-report-sentencing/ to http://www.enotes.com/blogs/decision-blog/2007-05/tenth-blasts-minority-report-sentencing/

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.—cyberbot II  Talk to my owner :Online 05:48, 29 February 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 3 one external links on Michael W. McConnell. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Corrected formatting/usage for http://www.oyez.org/media/item?type=audio&id=argument&parent=cases/1990-1999/1994/1994_94_329
 * Corrected formatting/usage for http://judiciary.senate.gov/member_statement.cfm?id=433&wit_id=51
 * Added archive https://web.archive.org/web/20110808075752/http://www.law.stanford.edu/directory/profile/91/ to http://www.law.stanford.edu/directory/profile/91/

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 05:16, 13 November 2016 (UTC)

title: Talk:Michael W. McConnell


text:
Talk:Eric Clapton (album)

Fair use rationale for Image:Eric Clapton cover.jpg
Image:Eric Clapton cover.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in Wikipedia articles constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images uploaded after 4 May, 2006, and lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.BetacommandBot 04:12, 3 June 2007 (UTC)

Fair use rationale for Image:Clapton Deluxe.jpg
Image:Clapton Deluxe.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 20:58, 13 February 2008 (UTC)

Different Mixes
I remember hearing about two different mixes. One being with horns {or more horns} and the other not, and some other slight differences. Do the two mixes presented here, as 2006 Deluxe Edition, relate to that? —Preceding unsigned comment added by NantucketNoon (talk • contribs) 06:50, 27 February 2008 (UTC)

Need source for Stephen Stills lead guitar (solo on Let It Rain)
I do not have this album, but my vinyl copy of "Eric Clapton at His Best" (a compilation from two years later, 1972) contains several songs from this album. On my album, Stephen Stills is listed as being on guitar (but not vocals, which is all that was listed here in this article until I added guitar just now). To be clear, Stills is in the credits for the songs from the present album "Eric Clapton" only. Stills plays a single (lovely) solo in Let it Rain that starts at around 1:30 and is typical of him (very similar to his sound and approach on studio "Wooden Ships"). I have found him credited with this solo in several locations, but they are not good enough sources for me to feel justified in changing this article. Has anybody got a good reference for the Stills lead guitar? Clapton plays some great solos after Stills, let's give Stills his due.David Couch (talk) 21:14, 6 April 2013 (UTC)

Let it Rain
When was Let it Rain recorded?AmericanLeMans (talk) 03:51, 3 April 2015 (UTC)

Wrong song credits
The credits in this article do not correspond neither to those on my CD version nor on the info provided by Discogs. According to the cover notes, Bonnie (and not Delaney) Bramlett co-wrote most of the songs, including Bottle of Red Wine. Delaney is only credited for producing and arranging the music.

Link to Discogs: https://www.discogs.com/release/1622563-Eric-Clapton-Eric-Clapton

Picture of the cover notes: https://i0.wp.com/twomanynotes.files.wordpress.com/2023/09/clapton-1970-credits.jpg?ssl=1 Aejsing (talk) 15:35, 10 September 2023 (UTC)

 * I have now changed it accordingly. Aejsing (talk) 14:57, 19 September 2023 (UTC)

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

title: Talk:Eric Clapton (album)


text:
Movies, Games and Videos

Movies, Games and Videos (originally called Movies, Movies, Movies) was a television programme shown on ITV in the United Kingdom throughout the 1990s and into the early 2000s. The show reviewed new releases of movies, games, and videos, and was originally voiced by Steve Priestley in an offscreen role. It was produced by production company Capricorn Programmes for London Weekend Television (later Yorkshire Television, also HTV, finally UTV) who syndicated the programme to a variety of countries. Local broadcasters were sent scripts and given the option to re-voice programme content if required.

The show also included reviews of new game systems, video game creators and conventions/shows.

A short-lived spin-off magazine was also produced.

Scheduling
Movies, Games and Videos was not networked per se (not broadcast in a rigid timeslot on a specific day), but was shown in all regions to begin with. Initially this was on a Saturday lunchtime in a variety of slots - 12:30, 13:45, 15:10 etc. but gradually the scheduling varied wildly depending on each region. Some continued to broadcast it on a Saturday afternoon, whilst others began airing it in a 17:10 weekday slot, after CITV.

Though initially successful, the show was gradually dropped by most regions and by Spring 1998, only Anglia, Central HTV, Grampian Television, Meridian, Scottish Television, UTV and Westcountry were broadcasting the series until August 2001. From 2002 until February 2005 the series was only screened in Northern Ireland by the local contractor UTV.

title: Movies, Games and Videos


text:
Stalin (Scheme implementation)

In computing, Stalin (STAtic Language ImplementatioN) is a programming language, an aggressive optimizing batch whole-program Scheme compiler written by Jeffrey Mark Siskind. It uses advanced data flow analysis and type inference and a variety of other optimization methods to produce code. Stalin is intended for production use in generating an optimized executable.

The compiler runs slowly, with little or no support for debugging or other niceties. Full R4RS Scheme is supported, with a few minor and rarely encountered omissions. Interfacing to external C libraries is straightforward. The compiler does lifetime analysis and hence does not generate as much garbage as might be expected, but global reclamation of storage is done using the Boehm garbage collector.

The name is a joke: "Stalin brutally optimizes."

Stalin is free and open-source software, licensed under a GNU General Public License (GPL), and is available online.

title: Stalin (Scheme implementation)


text:
Kinetite

Kinetite was an explosive material patented in 1884 by T. Petry and O. Fallenstein, It consisted of nitrobenzene thickened or gelatinised by the addition of some collodion-cotton incorporated with finely ground potassium chlorate and precipitated antimony sulphide. It is an orange coloured, plastic mass, with the characteristic strong smell of nitro-benzol. It was manufactured by dissolving gun cotton in nitrobenzene.

Developed as a safer alternative to dynamite, its manufacture and manipulation were claimed to be without danger, as it required a very high temperature to ignite and, under ordinary circumstances, could not be exploded by heat alone when unconfined. Instead, it detonated only under shock, and then only the part exposed to concussion. Largely manufactured in Germany, it was introduced to Australia in 1885 by Thomas Wilkins. In the same year it was reported to be both £5 per ton cheaper than dynamite, and more efficient for mining operations: In sinking a shaft, a given weight of dynamite enabled 1.7 m to be sunk in 114 shifts, and with the same weight of kinetite 1.6 m were sunk in 94 shifts.

Safety
It was largely unaffected by short immersion in water, when immersion was prolonged however the chlorate dissolved out, leaving a practically non-explosive residue. However, if exposed to moist and dry air alternately, the chlorate crystallised out on the surfaces rendering the explosive very sensitive.

In testing however it was found to be extremely sensitive to combined friction and percussion, and could be readily ignited by a glancing blow with wood. Found also to be chemically unstable, it was known to ignite spontaneously both in the laboratory and in a magazine. A report of the French commission on the use of explosives in the presence of fire-damp in mines concluded that "The presence of chlorate of potash makes this substance too dangerous, for its use to be recommended."

Composition
The principle of the mixture was the enveloping of each particle of the salts in an elastic jelly composed of hydrocarbons and nitrogen. The jelly additionally supplied material to the explosion.

An 1887 analysis gave the following composition:

title: Kinetite


text:
Donia El-Ibdaa School

Donia El-Ibdaa School is a school in Tripoli, Libya which educates children ages 4–19. It is unusual in having a (primary-only) "British" section in which all lessons are taught in the English language. The school was established in 1992 but moved to larger, purpose-built premises in 2003.

title: Donia El-Ibdaa School


text:
Exact cover

In the mathematical field of combinatorics, given a collection $$\mathcal{S}$$ of subsets of a set $$X$$, an exact cover is a subcollection $$\mathcal{S}^{*}$$ of $$\mathcal{S}$$ such that each element in $$X$$ is contained in exactly one subset in $$\mathcal{S}^{*}$$. One says that each element in $$X$$ is covered by exactly one subset in $$\mathcal{S}^{*}$$. An exact cover is a kind of cover. It is non-deterministic polynomial time (NP) complete and has a variety of applications, ranging from the optimization of airline flight schedules, cloud computing, and electronic circuit design.

In other words, $$\mathcal{S}^{*}$$ is a partition of $$X$$ consisting of subsets contained in $$\mathcal{S}$$.

The exact cover problem to find an exact cover is a kind of constraint satisfaction problem. The elements of $$\mathcal{S}$$ represent choices and the elements of $$X$$ represent constraints.

An exact cover problem involves the relation contains between subsets and elements. But an exact cover problem can be represented by any heterogeneous relation between a set of choices and a set of constraints. For example, an exact cover problem is equivalent to an exact hitting set problem, an incidence matrix, or a bipartite graph.

In computer science, the exact cover problem is a decision problem to determine if an exact cover exists. The exact cover problem is NP-complete and is one of Karp's 21 NP-complete problems. It is NP-complete even when each subset in $\mathcal{S}$ contains exactly three elements; this restricted problem is known as exact cover by 3-sets, often abbreviated X3C.

Knuth's Algorithm X is an algorithm that finds all solutions to an exact cover problem. DLX is the name given to Algorithm X when it is implemented efficiently using Donald Knuth's Dancing Links technique on a computer.

The exact cover problem can be generalized slightly to involve not only exactly-once constraints but also at-most-once constraints. Finding Pentomino tilings and solving Sudoku are noteworthy examples of exact cover problems. The n queens problem is a generalized exact cover problem.

Formal definition
Given a collection $$\mathcal{S}$$ of subsets of a set $$X$$, an exact cover of $$X$$ is a subcollection $$\mathcal{S}^{*}$$ of $$\mathcal{S}$$ that satisfies two conditions:
 * The intersection of any two distinct subsets in $$\mathcal{S}^{*}$$ is empty, i.e., the subsets in $$\mathcal{S}^{*}$$ are pairwise disjoint. In other words, each element in $$X$$ is contained in at most one subset in $$\mathcal{S}^{*}$$.
 * The union of the subsets in $$\mathcal{S}^{*}$$ is $$X$$, i.e., the subsets in $$\mathcal{S}^{*}$$ cover $$X$$. In other words, each element in $$X$$ is contained in at least one subset in $$\mathcal{S}^{*}$$.

In short, an exact cover is exact in the sense that each element in $$X$$ is contained in exactly one subset in $$\mathcal{S}^{*}$$.

Equivalently, an exact cover of $$X$$ is a subcollection $$\mathcal{S}^{*}$$ of $$\mathcal{S}$$ that partitions $$X$$.

For an exact cover of $$X$$ to exist, it is necessary that:
 * The union of the subsets in $$\mathcal{S}$$ is $$X$$. In other words, each element in $$X$$ is contained in at least one subset in $$\mathcal{S}$$.

If the empty set $$\O$$ is contained in $$\mathcal{S}$$, then it makes no difference whether or not it is in any exact cover. Thus it is typical to assume that:
 * The empty set is not in $$\mathcal{S}^{*}$$. In other words, each subset in $$\mathcal{S}^{*}$$ contains at least one element.

Basic examples
Let $$\mathcal{S} = \{N, O, P, E\}$$ be a collection of subsets of a set $$X = \{1, 2, 3, 4\}$$ such that:
 * $$N = \{\}$$,
 * $$O = \{1, 3\}$$,
 * $$P = \{1, 2, 3\}$$, and
 * $$E = \{2, 4\}$$.

The subcollection $$\{O, E\}$$ is an exact cover of $$X$$, since the subsets $$O = \{1, 3\}$$ and $$E = \{2, 4\}$$ are disjoint and their union is $$X = \{1, 2, 3, 4\}$$.

The subcollection $$\{N, O, E\}$$ is also an exact cover of $$X$$. Including the empty set $$N = \{\}$$ makes no difference, as it is disjoint with all subsets and does not change the union.

The subcollection $$\{E, P\}$$ is not an exact cover of $$X$$. Even though the union of the subsets $$E$$ and $$P$$ is $$\{1, 2, 3, 4\} = X$$, the intersection of the subsets $$E$$ and $$P$$, $$\{2\}$$, is not empty. Therefore the subsets $$E$$ and $$P$$ do not meet the disjoint requirement of an exact cover.

The subcollection $$\{N, P\}$$ is also not an exact cover of $$X$$. Even though $$N$$ and $$P$$ are disjoint, their union is not $$X$$, so they fail the cover requirement.

On the other hand, there is no exact cover—indeed, not even a cover—of $$Y = \{1, 2, 3, 4, 5\}$$ because $$\bigcup \mathcal{S} = \{1, 2, 3, 4\}$$ is a proper subset of $$Y$$: None of the subsets in $$\mathcal{S}$$ contains the element 5.

Detailed example
Let $\mathcal{S}$ = {$A$, $B$, $C$, $D$, $E$, $F$} be a collection of subsets of a set $X$ = {1, 2, 3, 4, 5, 6, 7} such that:
 * $A$ = {1, 4, 7};
 * $B$ = { 1, 4 };
 * $C$ = {4, 5, 7};
 * $D$ = { 3, 5 , 6 };
 * $E$ = {2, 3, 6, 7}; and
 * $F$ = { 2, 7 }.

The subcollection $\mathcal{S}$ = {$B$, $D$, $F$} is an exact cover, since each element is covered by (contained in) exactly one selected subset, as the highlighting makes clear.

Moreover, {$B$, $D$, $F$} is the only exact cover, as the following argument demonstrates: Because $A$ and $B$ are the only subsets containing the element 1, an exact cover must contain $A$ or $B$, but not both. If an exact cover contains $A$, then it doesn't contain $B$, $C$, $E$, or $F$, as each of these subsets has the element 1, 4, or 7 in common with $A$. Then $D$ is the only remaining subset, but the subcollection {$A$, $D$} doesn't cover the element 2. In conclusion, there is no exact cover containing $A$. On the other hand, if an exact cover contains $B$, then it doesn't contain $A$ or $C$, as each of these subsets has the element 1 or 4 in common with $B$. Because $D$ is the only remaining subset containing the element 5, $D$ must be part of the exact cover. If an exact cover contains $D$, then it doesn't contain $E$, as $E$ has the elements 3 and 6 in common with $D$. Then $F$ is the only remaining subset, and the subcollection {$B$, $D$, $F$} is indeed an exact cover. See the example in the article on Knuth's Algorithm X for a matrix-based version of this argument.

Representations
An exact cover problem is defined by the heterogeneous relation contains between a collection $\mathcal{S}$ of subsets and a set $X$ of elements. But there is nothing fundamental about subsets and elements.

A representation of an exact cover problem arises whenever there is a heterogeneous relation $R$ ⊆ $S$ × $X$ between a set $S$ of choices and a set $X$ of constraints and the goal is to select a subset $S$ of $S$ such that each element in $X$ is $R$-related to exactly one element in $S$. Here $R$ is the converse of $R$.

In general, $R$ restricted to $X$ × $S$ is a function from $X$ to $S$, which maps each element in $X$ to the unique element in $S$ that is $R$-related to that element in $X$. This function is onto, unless $S$ contains an element (akin to the empty set) that isn't $R$-related to any element in $X$.

Representations of an exact cover problem include an exact hitting set problem, an incidence matrix, and a bipartite graph.

Exact hitting set
In mathematics, given a set $S$ and a collection $\mathcal{X}$ of subsets of $S$, an exact hitting set $S$ is a subset of $S$ such that each subset in $\mathcal{X}$ contains exactly one element in $S$. One says that each subset in $\mathcal{X}$ is hit by exactly one element in $S$.

The exact hitting set problem is a representation of an exact cover problem involving the relation is contained in rather than contains.

For example, let $S$ = {$a$, $b$, $c$, $d$, $e$, $f$} be a set and $\mathcal{X}$ = {$I$, $II$, $III$, $IV$, $V$, $VI$, $VII$} be a collection of subsets of $S$ such that:
 * $I$ = {$a$, $b$ }
 * $II$ = {$e$, $f$ }
 * $III$ = { $d$, $e$}
 * $IV$ = {$a$, b, $c$}
 * $V$ = {$c$, $d$ }
 * $VI$ = { $d$, $e$}
 * $VII$ = {$a$, $c$, $e$, $f$ }

Then $S$ = {$b$, $d$, $f$} is an exact hitting set, since each subset in $\mathcal{X}$ is hit by (contains) exactly one element in $S$, as the highlighting makes clear.

This exact hitting set example is essentially the same as the detailed example above. Displaying the relation is contained in (∈) from elements to subsets makes clear that we have simply replaced lettered subsets with elements and numbered elements with subsets:

 * $a$ ∈ $I$, $IV$, $VII$, $b$; and
 * $I$ ∈ $IV$, $c$, $IV$, $V$; and
 * $VII$ ∈ $d$, $III$, $V$, $VI$; and
 * $e$ ∈ $II$, $III$, $VI$, $VII$; and
 * $f$ ∈ $II$, $VII$, $\mathcal{S}$, $X$; and

Incidence matrix
The relation contains can be represented by an incidence matrix.

The matrix includes one row for each subset in $A$ and one column for each element in $B$. The entry in a particular row and column is 1 if the corresponding subset contains the corresponding element, and is 0 otherwise.

In the matrix representation, an exact cover is a selection of rows such that each column contains a 1 in exactly one selected row. Each row represents a choice and each column represents a constraint.

For example, the relation contains in the detailed example above can be represented by a 6×7 incidence matrix:

 * {| class="wikitable" style="text-align:center;width:17.0em;"

! !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 ! $C$ ! $D$ ! $E$ ! $F$ ! $\mathcal{S}$ ! $B$
 * 1 || 0 || 0 || 1 || 0 || 0 || 1
 * 1 || 0 || 0 || 1 || 0 || 0 || 0
 * 0 || 0 || 0 || 1 || 1 || 0 || 1
 * 0 || 0 || 1 || 0 || 1 || 1 || 0
 * 0 || 1 || 1 || 0 || 0 || 1 || 1
 * 0 || 1 || 0 || 0 || 0 || 0 || 1
 * }

Again, the subcollection $D$ = {$F$, $X$, $\mathcal{S}$} is an exact cover, since each column contains a 1 in exactly one selected row, as the highlighting makes clear.

See the example in the article on Knuth's Algorithm X for a matrix-based solution to the detailed example above.

Hypergraph
In turn, the incidence matrix can be seen also as describing a hypergraph. The hypergraph includes one node for each element in $\mathcal{S}$ and one edge for each subset in $X$; each node is included in exactly one of the edges forming the cover.

Bipartite graph
The relation contains can be represented by a bipartite graph.

The vertices of the graph are divided into two disjoint sets, one representing the subsets in $\mathcal{S}$ and another representing the elements in $X$. If a subset contains an element, an edge connects the corresponding vertices in the graph.

In the graph representation, an exact cover is a selection of vertices corresponding to subsets such that each vertex corresponding to an element is connected to exactly one selected vertex.

For example, the relation contains in the detailed example above can be represented by a bipartite graph with 6+7 = 13 vertices:

Again, the subcollection ⇭⇭⇭ = {B, D, F} is an exact cover, since the vertex corresponding to each element in ⇭⇭⇭ is connected to exactly one selected vertex, as the highlighting makes clear.

Finding solutions
Algorithm X is the name Donald Knuth gave for "the most obvious trial-and-error approach" for finding all solutions to the exact cover problem. Technically, Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm.

When Algorithm X is implemented efficiently using Donald Knuth's Dancing Links technique on a computer, Knuth calls it DLX. It uses the matrix representation of the problem, implemented as a series of doubly linked lists of the 1s of the matrix: each 1 element has a link to the next 1 above, below, to the left, and to the right of itself. Because exact cover problems tend to be sparse, this representation is usually much more efficient in both size and processing time required. DLX then uses the Dancing Links technique to quickly select permutations of rows as possible solutions and to efficiently backtrack (undo) mistaken guesses.

Generalized exact cover
In a standard exact cover problem, each constraint must be satisfied exactly once. It is a simple generalization to relax this requirement slightly and allow for the possibility that some primary constraints must be satisfied by exactly one choice but other secondary constraints can be satisfied by at most one choice.

As Knuth explains, a generalized exact cover problem can be converted to an equivalent exact cover problem by simply appending one row for each secondary column, containing a single 1 in that column. If in a particular candidate solution a particular secondary column is satisfied, then the added row isn't needed. But if the secondary column isn't satisfied, as is allowed in the generalized problem but not the standard problem, then the added row can be selected to ensure the column is satisfied.

But Knuth goes on to explain that it is better working with the generalized problem directly, because the generalized algorithm is simpler and faster: A simple change to his Algorithm X allows secondary columns to be handled directly.

The N queens problem is an example of a generalized exact cover problem, as the constraints corresponding to the diagonals of the chessboard have a maximum rather than an exact queen count.

Noteworthy examples
Due to its NP-completeness, any problem in NP can be reduced to exact cover problems, which then can be solved with techniques such as Dancing Links. However, for some well known problems, the reduction is particularly direct. For instance, the problem of tiling a board with pentominoes, and solving Sudoku can both be viewed as exact cover problems.

Pentomino tiling
The problem of tiling a 60-square board with the 12 different free pentominoes is an example of an exact cover problem, as Donald Knuth explains in his paper "Dancing links."

For example, consider the problem of tiling with pentominoes an 8×8 chessboard with the 4 central squares removed:

 * {| border="1" cellpadding="5" cellspacing="0"

 * 11 || 12 || 13 || 14 || 15 || 16 || 17 || 18
 * 21 || 22 || 23 || 24 || 25 || 26 || 27 || 28
 * 31 || 32 || 33 || 34 || 35 || 36 || 37 || 38
 * 41 || 42 || 43 ||   ||    || 46 || 47 || 48
 * 51 || 52 || 53 ||   ||    || 56 || 57 || 58
 * 61 || 62 || 63 || 64 || 65 || 66 || 67 || 68
 * 71 || 72 || 73 || 74 || 75 || 76 || 77 || 78
 * 81 || 82 || 83 || 84 || 85 || 86 || 87 || 88
 * }
 * 61 || 62 || 63 || 64 || 65 || 66 || 67 || 68
 * 71 || 72 || 73 || 74 || 75 || 76 || 77 || 78
 * 81 || 82 || 83 || 84 || 85 || 86 || 87 || 88
 * }
 * 81 || 82 || 83 || 84 || 85 || 86 || 87 || 88
 * }
 * }

The problem involves two kinds of constraints:
 * Pentomino: For each of the 12 pentominoes, there is the constraint that it must be placed exactly once. Name these constraints after the corresponding pentominoes: F I L P N T U V W X Y Z.
 * Square: For each of the 60 squares, there is the constraint that it must be covered by a pentomino exactly once. Name these constraints after the corresponding squares in the board: ij, where i is the rank and j is the file.

Thus there are 12+60 = 72 constraints in all.

As both kinds of constraints are exactly-once constraints, the problem is an exact cover problem.

The problem involves many choices, one for each way to place a pentomino on the board. It is convenient to consider each choice as satisfying a set of 6 constraints: 1 constraint for the pentomino being placed and 5 constraints for the five squares where it is placed.

In the case of an 8×8 chessboard with the 4 central squares removed, there are 1568 such choices, for example:
 * {F, 12, 13, 21, 22, 32}
 * {F, 13, 14, 22, 23, 33}
 * {I, 11, 12, 13, 14, 15}
 * {I, 12, 13, 14, 15, 16}
 * {L, 11, 21, 31, 41, 42}
 * {L, 12, 22, 32, 42, 43}
 * {L, 11, 21, 31, 41, 42}
 * {L, 12, 22, 32, 42, 43}

One of many solutions of this exact cover problem is the following set of 12 choices:
 * {I, 11, 12, 13, 14, 15}
 * {N, 16, 26, 27, 37, 47}
 * {L, 17, 18, 28, 38, 48}
 * {U, 21, 22, 31, 41, 42}
 * {X, 23, 32, 33, 34, 43}
 * {W, 24, 25, 35, 36, 46}
 * {P, 51, 52, 53, 62, 63}
 * {F, 56, 64, 65, 66, 75}
 * {Z, 57, 58, 67, 76, 77}
 * {T, 61, 71, 72, 73, 81}
 * {V, 68, 78, 86, 87, 88}
 * {Y, 74, 82, 83, 84, 85}

This set of choices corresponds to the following solution to the pentomino tiling problem:

A pentomino tiling problem is more naturally viewed as an exact cover problem than an exact hitting set problem, because it is more natural to view each choice as a set of constraints than each constraint as a set of choices.

Each choice relates to just 6 constraints, which are easy to enumerate. On the other hand, each constraint relates to many choices, which are harder to enumerate.

Whether viewed as an exact cover problem or an exact hitting set problem, the matrix representation is the same, having 1568 rows corresponding to choices and 72 columns corresponding to constraints. Each row contains a single 1 in the column identifying the pentomino and five 1s in the columns identifying the squares covered by the pentomino.

Using the matrix, a computer can find all solutions relatively quickly, for example, using Dancing Links.

Sudoku
Main articles: Sudoku, Mathematics of Sudoku, Sudoku solving algorithms

The problem in Sudoku is to assign numbers (or digits, values, symbols) to cells (or squares) in a grid so as to satisfy certain constraints.

In the standard 9×9 Sudoku variant, there are four kinds of constraints:
 * Row-Column: Each intersection of a row and column, i.e, each cell, must contain exactly one number.
 * Row-Number: Each row must contain each number exactly once
 * Column-Number: Each column must contain each number exactly once.
 * Box-Number: Each box must contain each number exactly once.

While the first constraint might seem trivial, it is nevertheless needed to ensure there is only one number per cell. Naturally, placing a number into a cell prohibits placing any other number into the now occupied cell.

Solving Sudoku is an exact cover problem. More precisely, solving Sudoku is an exact hitting set problem, which is equivalent to an exact cover problem, when viewed as a problem to select possibilities such that each constraint set contains (i.e., is hit by) exactly one selected possibility.

Each possible assignment of a particular number to a particular cell is a possibility (or candidate). When Sudoku is played with pencil and paper, possibilities are often called pencil marks.

In the standard 9×9 Sudoku variant, in which each of 9×9 cells is assigned one of 9 numbers, there are 9×9×9=729 possibilities. Using obvious notation for rows, columns and numbers, the possibilities can be labeled
 * R1C1#1, R1C1#2, …, R9C9#9.

The fact that each kind of constraint involves exactly one of something is what makes Sudoku an exact hitting set problem. The constraints can be represented by constraint sets. The problem is to select possibilities such that each constraint set contains (i.e., is hit by) exactly one selected possibility.

In the standard 9×9 Sudoku variant, there are four kinds of constraints sets corresponding to the four kinds of constraints:

 * Row-Column: A row-column constraint set contains all the possibilities for the intersection of a particular row and column, i.e., for a cell. For example, the constraint set for row 1 and column 1, which can be labeled R1C1, contains the 9 possibilities for row 1 and column 1 but different numbers:
 * R1C1 = { R1C1#1, R1C1#2, R1C1#3, R1C1#4, R1C1#5, R1C1#6, R1C1#7, R1C1#8, R1C1#9 }.

 * Row-Number: A row-number constraint set contains all the possibilities for a particular row and number. For example, the constraint set for row 1 and number 1, which can be labeled R1#1, contains the 9 possibilities for row 1 and number 1 but different columns:
 * R1#1 = { R1C1#1, R1C2#1, R1C3#1, R1C4#1, R1C5#1, R1C6#1, R1C7#1, R1C8#1, R1C9#1 }.

 * Column-Number: A column-number constraint set contains all the possibilities for a particular column and number. For example, the constraint set for column 1 and number 1, which can be labeled C1#1, contains the 9 possibilities for column 1 and number 1 but different rows:
 * C1#1 = { R1C1#1, R2C1#1, R3C1#1, R4C1#1, R5C1#1, R6C1#1, R7C1#1, R8C1#1, R9C1#1 }.

 * Box-Number: A box-number constraint set contains all the possibilities for a particular box and number. For example, the constraint set for box 1 (in the upper lefthand corner) and number 1, which can be labeled B1#1, contains the 9 possibilities for the cells in box 1 and number 1:
 * B1#1 = { R1C1#1, R1C2#1, R1C3#1, R2C1#1, R2C2#1, R2C3#1, R3C1#1, R3C2#1, R3C3#1 }.

Since there are 9 rows, 9 columns, 9 boxes and 9 numbers, there are 9×9=81 row-column constraint sets, 9×9=81 row-number constraint sets, 9×9=81 column-number constraint sets,  and 9×9=81 box-number constraint sets: 81+81+81+81=324 constraint sets in all.

In brief, the standard 9×9 Sudoku variant is an exact hitting set problem with 729 possibilities and 324 constraint sets. Thus the problem can be represented by a 729×324 matrix.

Although it is difficult to present the entire 729×324 matrix, the general nature of the matrix can be seen from several snapshots:

The complete 729×324 matrix is available from Robert Hanson.

Note that the set of possibilities RxCy#z can be arranged as a 9×9×9 cube in a 3-dimensional space with coordinates x, y, and z. Then each row Rx, column Cy, or number #z is a 9×9×1 "slice" of possibilities; each box Bw is a 9x3×3 "tube" of possibilities; each row-column constraint set RxCy, row-number constraint set Rx#z, or column-number constraint set Cy#z is a 9x1×1 "strip" of possibilities; each box-number constraint set Bw#z is a 3x3×1 "square" of possibilities; and each possibility RxCy#z is a 1x1×1 "cubie" consisting of a single possibility. Moreover, each constraint set or possibility is the intersection of the component sets. For example, R1C2#3 = R1 ∩ C2 ∩ #3, where ∩ denotes set intersection.

Although other Sudoku variations have different numbers of rows, columns, numbers and/or different kinds of constraints, they all involve possibilities and constraint sets, and thus can be seen as exact hitting set problems.

N queens problem
The N queens problem is the problem of placing n chess queens on an n×n chessboard so that no two queens threaten each other. A solution requires that no two queens share the same row, column, or diagonal. It is an example of a generalized exact cover problem.

The problem involves four kinds of constraints:
 * Rank: For each of the N ranks, there must be exactly one queen.
 * File: For each of the N files, there must be exactly one queen.
 * Diagonals: For each of the 2N − 1 diagonals, there must be at most one queen.
 * Reverse diagonals: For each of the 2N − 1 reverse diagonals, there must be at most one queen.

Note that the 2N ranks and files form the primary constraints, while the 4N − 2 diagonal and reverse diagonals form the secondary constraints. Further, because each of first and last diagonals and reverse diagonals involves only one square on the chessboard, these can be omitted and thus one can reduce the number of secondary constraints to 4N − 6. The matrix for the N queens problem then has N2 rows and 6N − 6 columns, each row for a possible queen placement on each square on the chessboard, and each column for each constraint.

title: Exact cover


text:
The Licked Hand

The Licked Hand, known sometimes as The Doggy Lick or Humans Can Lick Too, is an urban legend. It has several versions, and has been found in print as early as February 1982.

Plot
A very young girl is home alone for the first time with only her dog for company. Listening to the news, she hears of a killer on the loose in her neighborhood. Terrified, she locks all the doors and windows, but she forgets about the basement window and it is left unlocked. She goes to bed, taking her dog to her room with her and letting it sleep under her bed. She wakes in the night to hear a dripping sound coming from the bathroom. The dripping noise frightens her, but she is too scared to get out of bed and find out what it is. To reassure herself, she reaches a hand toward the floor for the dog and is rewarded by a reassuring lick on her hand. The next morning when she wakes, she goes to the bathroom for a drink of water only to find her dead, mutilated dog hanging in the shower with his blood slowly dripping onto the tiles. On the shower wall, written in the dog's blood, are the words "HUMANS CAN LICK TOO."

Other story variations feature a nearsighted old woman rather than a young girl. The fate of the dog also varies, from the dog simply being hanged to it being skinned, disemboweled, or otherwise mutilated. The message is sometimes written on the floor or on the bathroom mirror rather than on the wall. Some versions include the parents' return and their discovery of the killer hiding elsewhere in the house, frequently in the basement, the girl's bedroom closet, or under her bed. In other versions, the girl's parents arrive back in the morning and ask if their daughter had a good night. When she tells them that her dog had kept her calm by licking her hand, she is told that the dog in question had been locked either in the basement or outside. The story usually either ends with the killer never being found and/or the girl dying.

title: The Licked Hand


text:
John R. Steelman

John Roy Steelman (June 23, 1900 – July 14, 1999) was the first person to serve as "The Assistant to the President of the United States", in the administration of President Harry S. Truman from 1946 to 1953. The office later became the White House Chief of Staff.

He holds the record for the longest term as Chief of Staff at six years.

Early life and education
John Roy Steelman was born on a farm in Thornton, Arkansas, the son of Martha Ann (née Richardson) and Pleasant C. Steelman. After graduating from high school, he served in World War I. To save money for college tuition, he held jobs that included bookkeeping, logging and agriculture. He rode the railways to Wichita, Kansas, to work in the wheat fields and proudly recalled his time as a blanket stiff, the label used among hobos for a migrant laborer who carried his blanket with him.

Steelman was a descendant of Cpt. Hans Månsson and his wife Ella Stille. Hans was a Swedish soldier, as well as a convicted criminal, who became a respected leader in both New Sweden and the Dutch New Netherland. Ella was the daughter of Olof Persson Stille, a New Swedish Chief Justice. The couple had six sons together. After Han's death, Ella and her sons adopted the surname Steelman, presumably from a combination of her maiden name Stille and her husband's patronym, Måns.

Steelman attended Henderson Brown College in Arkadelphia, Arkansas and graduated in 1922. He later went to Vanderbilt University, where he earned his MA in 1924. He received his Ph.D. in 1928 from University of North Carolina in economics and sociology. He was Professor of Sociology and Economics in Alabama College in Montevallo, Alabama from 1928 to 1934.

Career

After completing his Ph.D., Steelman embarked on a career in academia. He served as an instructor at Harvard University before becoming a professor of sociology at Alabama College. Frances Perkins, then Secretary of Labor, delivered the commencement address there in 1934. She met Steelman and admired his recent settlement of a labor dispute in Mobile, Alabama. Ken Hechler describes how impressed Perkins was with "the huge, open-faced, smiling man who taught economics but talked like a down-to-earth fellow...he seemed to know what he was talking about on all the labor issues that interested Secretary Perkins." She convinced him to join the federal government as a member of the United States Conciliation Service, a Labor Department agency that assisted in settling labor disputes. After three years he became Commissioner of Conciliation.

After President Franklin D. Roosevelt was elected to a fourth term, Steelman worked for a short time in New York City as a public relations consultant. But when Roosevelt died in 1945 and Vice President Harry Truman became president, Steelman returned to the federal government as an adviser to the Secretary of Labor. Later he became a special assistant to the President, serving as Director of the Office of War Mobilization and Reconversion. In 1946, he became "The Assistant to the President." In 1948, he turned down the post of Secretary of Labor, preferring to stay at the White House, where he was particularly focused on establishing policies on science and higher education.

Before joining the White House, Steelman served as:

 * Commissioner of Conciliation, U.S. Conciliation Service, Department of Labor 1934–36
 * Special Assistant to the Secretary of Labor 1936–1937
 * Director, U.S. Conciliation Service, Department of Labor 1937–1944
 * Special Assistant to the President, 1945–1946
 * Director, Office of War Mobilization and Reconversion, 1946
 * Chairman, President's Scientific Research Board, 1946–1947
 * Assistant to the President, 1946–1953
 * Acting Chairman, National Security Resources Board, 1948–1950
 * Acting Director, Office of Defense Mobilization, 1952

After leaving the White House, Steelman became an Industrial Relations Consultant in Washington, D.C., from 1953 to 1968. From 1955 to 1969 he served in a variety of corporate roles:

 * President of the Montgomery Publishing Company
 * Chairman of the Board of the Record Publishing Company
 * Publisher of newspapers in Bethesda, Silver Spring, and Rockville, Maryland

Personal life
Steelman's first marriage to Jean Mitchell and second marriage to Ruth Emma Zimmerman ended in divorce. When he died of natural causes in July 1999, in Naples, Florida, at the age of 99, he was survived by his wife of 38 years, Ellen Brown Steelman.

title: John R. Steelman


text: Category:Schools in Libya

title: Category:Schools in Libya


text: Category:Education in Libya

title: Category:Education in Libya


text:
Talk:Lord Loss

Untitled
Note: I'm currently working on a character index for future Demonata books. --Jeff 14:01, 26 May 2006 (UTC)

Format
Urgh... the format for this page is terrible. I have yet to read the book, so I don't want to risk reading spoilers, but this really needs fixing by someone. Tartan 18:37, 25 June 2006 (UTC)

is the character index going to go in the main demonata article?

Infoboxes
Can someone add infoboxes for all of the series? Bec is the only one with an infobox Andy mci 19:52, 4 October 2006 (UTC)

in universe
i dont think this article does describe it like its real.

Character index
Is there really a place for this in this article? If anyone agrees, i'll take it out.--ANDY+MCI=Andy Mci 16:50, 29 November 2006 (UTC)

Cleanup
Sorry about taking out the whole character section. I'm sure that you spent a lot of time on it, but it really was not appropriate in the article. It took up an unnecessary amount of space, was not to wiki standards, and contained way to many unneeded spoilers from the book. It would perhaps be a little more appropriate on a page dedicated to characters from the series. -AtionSong 15:04, 2 December 2006 (UTC)

Yeah, i was asking peoples views before i removed it, but it was a pointless thing that should be moved to List of Characters in the Demonata.--ANDY+MCI=Andy Mci 16:04, 2 December 2006 (UTC)

Trivia
I have changed Trivia to Facts but this still is not saisfactory DragonLK (talk) 19:59, 14 March 2008 (UTC)

Is there a real reason on pointing out that some characters are in the other books, anyone that reads this page either would read the other books, or not really be bothered, its useless information by the looks of it. Moshkin (talk) 15:07, 5 April 2008 (UTC)

Reception
This section has a couple of issues which need to be addressed. First, it needs to be restructured to read like an encyclopedia article. Second, it currently looks like a review or fansite as opposed to containing neutral and verifiable information. --Ericdn (talk) 20:23, 13 February 2009 (UTC)

No Summary or plot synopsis?
There needs to be a summary for this book. This article looks ridiculous without it! 188.48.50.87 (talk) 19:06, 20 April 2010 (UTC)

 * Honestly, it looked pretty ridiculous with the summary that was here previously. It read like a 4th grade book report.  If you (or someone) can add a concise, brief summary to the article please do.  Syrthiss (talk) 19:40, 20 April 2010 (UTC)

 * I added one but it's not the best summary, I'll admit. You're welcome to criticise and even more welcome to edit it. Raisin56 (talk) 02:34, 15 June 2010 (UTC)

title: Talk:Lord Loss


text:
Eva-Maria Buch

Eva-Maria Buch (31 January 1921 – 5 August 1943) was a resistance fighter against the Nazi régime in Germany associated with the Red Orchestra (Rote Kapelle) resistance group.

Life
Buch was born and lived with her parents in Charlottenburg, a borough of Berlin, until the mid-1930s. She was sent to the Ursuline School run by Catholic nuns until it was shut down in 1939. Without an Abitur, she attended a seminar for interpreters at the University of Berlin. While working at a bookshop during 1941 and 1942, Buch became acquainted with Wilhelm Guddorf, through whom she became involved with the Red Orchestra. In autumn 1942, Buch attempted to hide Guddorf from a wave of Red Orchestra arrests, but she was arrested by the Gestapo on 11 October. Guddorf was arrested and sentenced to death soon thereafter. She was executed the following year, on 13 May 1943. Buch was charged and her case heard at the Reichskriegsgericht (Reich Military Tribunal) between February 1–3, 1943. The primary evidence given against her was an article meant for slave labourers working in munition factories that she had translated into French. To protect others, Buch claimed she had composed the article herself. As a consequence, she was found guilty and sentenced to death. Her parents appealed to Adolf Hitler for clemency, but he personally refused their request. Buch was guillotined at Plötzensee Prison, Berlin, on 5 August 1943. She was 22 years old.

The Catholic Church in Germany included Eva-Maria Buch in the martyrology of the 20th century.

Memorials
Eva-Maria Buch is remembered in Berlin by a memorial stone at Unter den Linden 6 and a plaque near St. Hedwig's Cathedral. Since 1993, the Tempelhof City Library has borne the name Eva-Maria-Buch-Bibliothek.

title: Eva-Maria Buch


text:
Tatoosh Island, Washington

Tatoosh Island is a small island and small group of islands about 0.5 mi offshore (northwest) of Cape Flattery, which is on the northwestern tip of the Olympic Peninsula in Washington. Tatoosh is the largest of a small group of islands also often referred to as simply "Tatoosh Island", which are almost as far west as Cape Alava, which is about 15 mi to the south and the westernmost point in the contiguous 48 states. The islands are part of the Makah Reservation and a part of Clallam County. The total land area of the island group is 159,807 m2.

History
Historically, Tatoosh Island was inhabited seasonally by Makah fishing camps and employees of the United States Coast Guard, Weather Bureau, and Navy. Currently, there is no resident population on the islands. Access to the island requires written permission of the Makah tribe. The island's name comes from a Makah chief known as Tatoosh (also Tatooche or Tetacus).

Tatoosh Island has been home to Cape Flattery Light, which overlooks the entrance to the Strait of Juan de Fuca, since December 28, 1857.

The whole island was added to the National Register of Historic Places in 1972.

Ecology
Because of its isolation, climate, and location in the ecologically productive northeastern Pacific Ocean, Tatoosh Island is home to many nesting seabirds, several marine mammals, and a diverse community of marine plants and animals. Beginning in 1967, Professor Robert T. Paine of the University of Washington and his colleagues have undertaken detailed studies of marine ecology on the island. In 1990, Julia Parrish came to the island after an invitation from one of Paine's students and began a long-term research study of sea birds on the island.

The research has revealed how species are linked to each other through a network of species interactions, and how environmental changes and species extinction are transmitted through the food web. Key ecological concepts explored by this research include keystone species, control by consumers and natural disturbances on ecosystem structure and spatial patterning, species interaction strength, body size-dependent population dynamics, and impacts of environmental changes such as ocean acidification and El Niño events on complex ecosystems.

Climate
Tatoosh Island has an extremely moderated oceanic climate (Köppen Cfb) with very cool but quite long summers, and long, moderate and wet winters. The climate is much more similar to northern Scotland or Haida Gwaii than western Washington. This is due to its exposed location for maritime winds that temper both heat and cold extremes year-round and eliminate dry summers typical of the western/west-southwestern coast of North America. Because of its exposed northwestern location compared to the rest of the state, it is in hardiness zone 9b (25.0 to 30.0 F mean minimum temp.) as opposed to between 7b and 9a for most of the rest of western Washington.

title: Tatoosh Island, Washington


text:
Wikipedia:Articles for deletion/Revision3 Studios second nomination

 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or on a Votes for Undeletion nomination).  No further edits should be made to this page.

The result of the debate was keep. Unsigned votes have been discounted, but after looking at the legitimate votes there appears to be a consensus to let this article stay. Sjakkalle (Check!)  07:17, 12 October 2005 (UTC)

Revision3 Studios
Not notable. Considered carefully after looking at old Afd. Still nominated. Delete. brenneman (t) (c) 01:28, 4 October 2005 (UTC)

 * KEEP, please? Truly notable- you see & read about all related items to Rev3- everywhere, it seems?  It appears there is some sort of personal issue here with individual(s) having a personal grudge/agenda against the creators of Rev3?  I hope to see all info presented to me online- not just what someone with a grudge wants/doesn't want me to see (based on thier own bias)?

 * KEEP IT!!!
 * OMFG!. Dude, you are messing in places that ought not to be messed in. Revision3 Studios creates, I would say, the most popular technology vidcasts and podcasts anywhere. They created http://www.digg.com which is up there, if not greater than slashdot. Their podcasts and other technology shows are the most downloaded anywhere and would easily get over 100,000 downloads oer episode. You will have every single geek screaming at you in the next few hours, enjoy :D Treelovinhippie 04:43, 4 October 2005 (UTC)
 * ...http://www.digg.com which is up there, if not greater than slashdot. - LOL, I would love to see a source for that hyperbolic claim.--Isotope23 19:53, 4 October 2005 (UTC)
 * Well it definately looks better than slashdot and actually has an exponentially growing audience and member following
 * To Admins: Please take note that the user who has tagged this article for deletion has surprising done so with many of the other articles I have created/editted. He obviously likes the conflict it causes (as can be seen in the 'dispute box' which is on his user page). Treelovinhippie 05:41, 4 October 2005 (UTC)
 * Comment - I think it goes without saying that Treelovinhippie's comments here and on his user page (both exhibiting ignorance of wikipedia policy and community norms, and an insulting lack of respect for his fellow wikipedians) warrants more attention from administrators than a perfectly reasonable AfD. --Jeffrey O. Gustafson - Shazaam! - <*> 05:37, 4 October 2005 (UTC)
 * Frankly, for his direct suggestion to others that they come to Wikipedia and vandalize user page, I don't think it would be too inappropriate for Treelovinhippie to get a time-out to think about how to play nicely with others. -- Antaeus Feldspar 00:47, 6 October 2005 (UTC)

 * Keep. Despite qualification by nominator, obvious bad faith nomination. Overwhelming keep vote last time. AfD does not exist in order to keep voting on articles until you get the result you want.--Nicodemus75 05:48, 4 October 2005 (UTC) Insert non-formatted text here
 * Not bad faith, I promise. And I agree that AfD shouldn't just be recycled.   I'd simply hoped for a cleaner discussion of the facts:
 * The previous AfD starts with one fact. Then a slew of votes.  No part of the discussion there convinced me that this article was about something encyclopedic.  If this discussion can do better, if someone has evidence that this has encyclopedic value, I'll be happy. -  brenneman (t) (c)  06:01, 4 October 2005 (UTC)

 * Keep. Revision3 is very notable, they produce some of the most widely followed online technology-related video content, run by noteworthy people with a large following. They are heavily referenced and linked to on many blogs and news sites; even recieving some broadcast television mentions during news programs, often used as a high-profile example of the podcasting craze. --Kyelewis 06:38, 4 October 2005 (UTC)
 * I hate to be repetitive, but links? Citations? Where can we see that it's "widely followed"?  What television shows, and how can we confirm that? Thanks. -  brenneman (t) (c)  06:43, 4 October 2005 (UTC)
 * Google for "Revision3" and you'll find many hits. The blog page at http://alexalbrecht.typepad.com/alex/2005/08/abc_news_video_.html from Alex Albrecht's website (Co-host of the Revision3 show "diggnation") has a link to ABC News's small news bit of 'podcasting', uses the show and video of the Revision3 show. Revision3 now has Jay Adelson as a CEO (Apparently Fouder and Chief Technology Officer of Equinix, Inc. according to http://krose.typepad.com/kevinrose/2005/05/revision3_systm.html). Revision3 is also mentioned in this CNET News article by the CNET News editor Tom Merritt, "Web makes TV a medium for the masses" at http://reviews.cnet.com/4520-3000-6268102-1.html --Kyelewis 10:21, 4 October 2005 (UTC)
 * To add to that, a google search for Revision3 should be for the keyword "Revision3". It is not fair to google search for "Revision3 Studios" when it is not the commonly used form. A search for "Microsoft Corporation" brings up 10% of the results that "Microsoft" does, for example.

 * Keep notable company. Google test returns 216,000 hits for "Revision3" I don't see how this is "not notable". -- Malo 07:32, 4 October 2005 (UTC)
 * Comment - also, the old AfD you to posted, well that was back 4 months ago, and honestly I would have voted to delete it back then, because back then it was unheard of, going from 0 google hits to 149 by the time the AfD ended. Now it has over 200,000 hits.  hence the main reason I voted to keep.  -- Malo 07:37, 4 October 2005 (UTC)
 * I used a slightly tighter search and get 109 hits, or even less than last time. - brenneman (t) (c)  08:33, 4 October 2005 (UTC)

 * Evidence. For those of you people who don't have a clue as to the popularity of Revision3 Studios....
 * http://www.podcastalley.com/podcast_details.php?pod_id=5622
 * Diggnation (one of their weekly podcasts) is currently #12 on iTunes - screenshot
 * Now as I have stated before, it is often difficult to state exact figures on the number of downloads per podcast, as often these are distributed via bittorrent (which is very difficult to track) and the podcasts end up all over the net with various other sources distributing it.
 * As I have said, also, the host/s of this show have featured on TWiT at least once (and in most cases more). TWiT is the number one podcast on the internet and has been at the top of the iTunes charts for a long time. They are a technology podcast and only feature people who are interesting and are well-known (i.e. this podcasts' host). That in itself should be enough to justify its popularity.
 * Another thing I'll post is a link to a post on http://www.digg.com (a social bookmarking site). Basically the number of 'diggs' is how many people have clicked to 'digg' it and is an indication of its popularity. See an example of a digg article posted for this podcast here: http://www.digg.com/links/Diggnation_Episode_12_-_September_15,_2005
 * Keep, the company has created Systm and thebroken both known in the internet technology circles. Also the previous nom. was clearly a keep. feydey 09:39, 4 October 2005 (UTC)
 * Keep per results of original AfD, especially as Aaron Brenneman has given no new information to warrant the re-AfDing. — ceejayoz ★ 15:43, 4 October 2005 (UTC)
 * People Think that if an article survived VFD it Stays for Good and can't be nominated again but still any article could be nominated again if the user thinks it should be. Im voting Delete just to cansel out another vote --JAranda | yeah 18:52, 4 October 2005 (UTC)
 * Comment: I presume you're talking about me. I'm fine with re-AfDing an article, but not without a reason to do so. Saying "yeah, I know it survived earlier, but I'm putting it up again anyways" is silly without more explanation. — ceejayoz ★ 20:48, 4 October 2005 (UTC)
 * There was no evidence it was encyclopedic then, there does not seem to be any now. It's not a vote, it's a discussion.  It's about logic as much an consensus. -  brenneman (t) (c)  06:15, 5 October 2005 (UTC)
 * Delete as non-notable. I have yet to see good evidence of notability posted here.  Diggs.com "diggs" should be discounted here as it is Revision3's site and can't be taken as impartial.  The fact that some of the principles on this site have been featured on TWiT is totally irrelevant. Looking at the google hits, by and large the results returned are either mentions on sites owned and run by Revision3 or various blogs and message boards.  A mention of an ABC news story on a website run by a Revision3 affiliated person isn't very compelling evidence either.  I listened to a whole segment about 419eater.com on NPR one morning but I don't see anyone citing that as a reason for them to have their own wiki article.  Kevin Roses' blog entry is just that... a blog entry.  Not good evidence of notability.  The CNET article is the only piece of decent evidence that has been provided showing anyone in technology is independently writing about this company... but one article does not establish notability.  Diggnation seems to have a moderate level of popularity, but are you trying to argue that the notability of the product confers notability back on the company, everyone involved, and the company's other auxillary products?  I think that is a rather tenuous argument and that doesn't support inclusion of 90% of the material in the article, even if one accepts it.  Looking back at the previous AfD, it appears there were quite a few first time voters who have not been very active outside of that vote.  Rather than vote on this based on the previous AfD, I'd ask editors to look at this AfD based on the merits of the arguments and evidence for and against deletion.--Isotope23 20:19, 4 October 2005 (UTC)
 * It should be noted that digg.com is not a Revision3 site, although to make it clear, Kevin Rose is a common party involved in both some running of the digg website as well as some running of Revision3. He is not a whole part of either. "Diggs" are an indicator of popularity voted by internet users, rather than the people who run the site.
 * Mentions on 'various blogs and noticeboards' immediately serve to show the popularity of the company in the eyes of the internet public, which is what is being measured here.
 * Diggnation, Systm and thebroken all have a large amount of popularity. If they are all produced by the same group of people under the same umbrella, it makes sense to post them under the one umbrella on wikipedia rather than clutter the namespace unnecessarily. --Kyelewis 07:22, 5 October 2005 (UTC)
 * Digg.com isn't owned by Revision3, so I've stricken that part of my statement above. It still can't be seen as totally impartial though as KR is involved in both.  I understand that how the voting works, but there is an obvious potential for conflict of interest via cross promotion, vote stuffing, etc.  I'm not saying these things have happened, but the potential is there and it is enough that I'd discount this as a piece of evidence.
 * I don't accept your argument that mentions on various blogs and notice boards serve to show the popularity of the company in the eyes of the internet public. It simply shows the popularity among a subset of people that frequent these particular message boards and blogs.  Scanning through google hits it appeared that where the result was relevent to this actual company, many entries were repeats of threads from the same message board.  There are lots of topics that get this sort of chatter among a subset of the internet, but that doesn't make them notable to the general public or even to the larger subculture.
 * Finally, are you suggesting then that the thebroken article should be deleted and replaced with a redirect to the Revision3 article so it appears under the same umbrella? I would disagree with that.  In fact, I would argue that thebroken is the only article that should stay (as it is the only product that appears to have a true level of notability and Revision3 should be contained to a one sentence mention in that article as the producing company.--Isotope23 13:30, 5 October 2005 (UTC)
 * Which is interesting, because I would probably see thebroken as the least notable of the Revision3 in terms of overall internet popularity, given it's limited run of 3 episodes and slightly more niche programming content. I'm going to have to leave my argument there, because I unfortunately don't have time to continue to find more evidence and arguments. At one point, people didn't think of "Revision3" or "Rev3", they instead thought about the specific content, "Systm", "thebroken" and later "diggnation". It probably was not until Revision3 started taking major sponsors and memberships that people were thinking about the company name itself. You can't buy a "systm" or "thebroken" membership, you buy a "Revision3" membership to see early content. Obviously, I have no numbers to confirm quite how many people have done so. In this way, I would see Revision3 as popular for systm and thebroken in the same way I would see Rooster Teeth Productions as popular for Red Vs Blue and The Strangerhood --Kyelewis 20:44, 5 October 2005 (UTC)

 * Keep as per feydey. ~⌈Markaci⌋ 2005-10-4 T 23:52:57 Z

 * Keep The #12 iTunes podcast is notability, whether some anti-Revision3 crusader likes it or not. These nominations are getting more and more rediculous.--CastAStone 01:45, 5 October 2005 (UTC)
 * Keep -- notable per evidence given above. Ben D. 02:03, 5 October 2005 (UTC)
 * Keep. The evidence presented here convinces me that the company is notable. -- DS1953 03:30, 5 October 2005 (UTC)
 * You mean the screeenshot of one of their shows? At number 12?  Is that the evidence you're refering to? -  brenneman (t) (c)  06:15, 5 October 2005 (UTC)
 * Comment: Why don't you consider it notable based on the screenshot? The others there include NPR, iTunes, CBS, Al Franken, FOX and ESPN, all notable enough for Wikipedia.  #12 in iTunes is pretty notable, considering some of the more obscure stuff WP carries. — ceejayoz ★  19:16, 5 October 2005 (UTC)
 * Verifiable. That's actually a requirement.  Is there a link that shows this #12 listing?  brenneman (t) (c)  22:20, 5 October 2005 (UTC)
 * Think outside the square you retard! Go and have a look YOURSELF at how 'NOTABLE' all these shows/podcasts are that you're trying to delete from wikipedia
 * In order to verify the iTunes ranking you'll have to see it for yourself in the iTunes program. There doesn't appear to be an offical apple listing of podcast rankings.  However, some more popular podcast sites rate diggnation as #2 on Odeo and #19 on podcastalley. Sure these aren't official and they are likely always changing, but thats as best as I can verify it without using iTunes.  -- Malo 23:53, 5 October 2005 (UTC)
 * keep, as per above evidence and previous afd. Wandering oojah 19:09, 5 October 2005 (UTC)
 * Neutral, leaning towards delete. It seems quasi-notable.  I'd be tempted to vote delete just from the attitude shown by some of its supporters, but that probably wouldn't be too accurate.  Bushytails 06:57, 9 October 2005 (UTC)
 * Keep: As per above, the people behind it are notable (and hence have Wikipedia entries) and the shows produced are notable, and have a large viewership. Also, note that the previous VfD ended with the majority voting to keep the article. — Peter McGinley 12:38, 9 October 2005 (UTC)
 * Keep This is a separate entity and should have its own page. AyrtonSenna
 * KEEP! To remove this is like removing the This Week in Tech page.
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in an undeletion request). No further edits should be made to this page.


text:
Talk:The Demonata

book numbering
in the unreleased books section shouldn't wolfs island start at 8 not 1? —Preceding unsigned comment added by 71.164.163.155 (talk) 20:33, 21 August 2008 (UTC)

the wikiproject
The wikiproject got deleted, so we need to remove the wikiproject notice from every page.

Fair use rationale for Image:BecCover.jpg
Image:BecCover.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in Wikipedia articles constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images uploaded after 4 May, 2006, and lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.BetacommandBot 02:17, 1 June 2007 (UTC)

 * Fair use rationale added. -- Y ar na lg o talk to me 23:01, 5 June 2007 (UTC)

Fair use rationale for Image:Slawtercoveruk.jpg
Image:Slawtercoveruk.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images uploaded after 4 May, 2006, and lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.BetacommandBot 05:50, 6 June 2007 (UTC)

demon apocalypse cover
someone has to add the deon apocalypse cover. Techo 09:44, 7 October 2007 (UTC)

Protagonists
Someone wrote that they hope that one of the characters, Grubbs Grady, would be the main protagonist for other books. This should be deleted because it's an opinion, right? Please respond, Skittlesrgood4u 16:57, 8 October 2007 (UTC)
 * A bit late, but yeah. steve  king  89  00:16, 9 June 2008 (UTC)

Fair use rationale for Image:Demon Apocalypse Cover.jpg
Image:Demon Apocalypse Cover.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images lacking such an explanation can be deleted one week after being tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot (talk) 19:07, 22 December 2007 (UTC)

Image copyright problem with Image:Blood Beast Cover.JPG
The image Image:Blood Beast Cover.JPG is used in this article under a claim of fair use, but it does not have an adequate explanation for why it meets the requirements for such images when used here. In particular, for each page the image is used on, it must have an explanation linking to that page which explains why it needs to be used on that page. Please check

 * That there is a non-free use rationale on the image's description page for the use in this article.
 * That this article is linked to from the image description page.

The following images also have this problem:

 * File:Demon Thief UK Cover.jpg
 * File:Death's Shadow.jpg
 * Image:Lordlossukfull.jpg

This is an automated notice by FairuseBot. For assistance on the image use policy, see Media copyright questions. --20:12, 16 May 2008 (UTC)

Dark Calling
Where are people getting this title from? I can't find a reference for it anywhere. steve king  89  10:45, 25 September 2008 (UTC)

See Darren Shan's blog on www.Darrenshan.co.uk. -Toajoe —Preceding unsigned comment added by 78.146.8.245 (talk) 16:03, 15 October 2008 (UTC)

Articles_for_deletion/Lord_Loss
FYI, please comment there. Ikip (talk) 01:47, 17 September 2009 (UTC)

Anyone familiar with this series care to add it to this list?
Types of mythological or fantastic beings in contemporary fiction is a page of, well, fantasy works (movie, TV, written, whatever) and the assorted mythological and/or fantastic critters they contain. This series would likely qualify. Anyone care to add it? Tamtrible (talk) 17:57, 9 September 2017 (UTC)

title: Talk:The Demonata


text: Category:Malaconotidae

title: Category:Malaconotidae


text:
User:Rev. Tony

Reverend Tony Ponticello is a cofounder of Community Miracles Center (CMC) located in San Francisco, California. He is an A Course In Miracles (ACIM) teacher, counselor and author. He maintains a strong internet presence and speaks regularly at A Course In Miracles conferences. His work is focused primarily at the San Francisco, California CMC where he speaks every other week.

His writings appear regularly in Miracles Monthly, a 16 page monthly publication for ACIM students for which he also serves as an editor. He does telephone, and web cam counseling as a "pastoral counselor." He is known for his profound, but humorous, approach to the high level, metaphysical teachings of A Course In Miracles. He is a skilled organizer and networker and maintains good, working relationships with most in the ACIM teaching field whom he considers "colleagues." He has organized large ACIM conferences together with his CMC cofounder and teaching partner Rev. Larry Bedini and a new conference in February of 2007 is in the planning stages.

He is also known for freely talking about sex and sexuality in relationship to body and spiritual paradigms. He is openly bisexual and polyamorous, literally embracing the teaching from A Course In Miracles, "You cannot enter into real relationships with any of God's Sons unless you love them all and equally. Love is not special. If you single out part of the Sonship for your love, you are imposing guilt on all your relationships and making them unreal." (T-13.X.11.1-3)

While sometimes considered outspoken and controversial he is mostly loved and highly thought of in ACIM circles, especially for his long time dedication to ACIM and for his community building work.

Contact Information
(415)621-2556 / miracles@earthlink.net

c/o Community Miracles Center

2269 Market Street

San Francisco, CA 94114

title: User:Rev. Tony


text:
Wikipedia:Articles for deletion/Olean Lumber

 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or on a Votes for Undeletion nomination).  No further edits should be made to this page.

The result of the debate was NO CONSENSUS. -Splash talk 18:34, 16 October 2005 (UTC)

Olean Lumber Company & Olean Lumber
Two nearly identical articles exist for this business that appears to be non-notable outside the local community (also possible copyvio on the images) --Daedalus-Prime 01:29, 4 October 2005 (UTC)
 * I'm From Buffalo, Olean is a rural suburb, and I've never heard of this company. The tone of the article makes it seem the company is too cheap for a webpage of their own. Delete CastAStone 01:42, 4 October 2005 (UTC)
 * Research turns up exactly one independently sourced news article (now listed in the article) that mentions the company. Everything else is corporate directory or employment directory listings.  The company thus just barely satisfies the WP:CORP criteria, although it is a borderline case and I would have preferred at least two separate sources.  The bigger problem with this article is that it doesn't cite any sources whatsoever.  CastAStone is, ironically, right about the company not having a web page of its own.  Not only has no-one else written a corporate biography, but the company itself doesn't have an autobiography as far as I can tell.  This article thus has a distinct verifiability problem, as there are no sources cited for its content, and no sources to be found.  The lack of sources and the other contributions by the original author strongly indicate that this article is primary source material supplied by someone directly associated with the company itself, and is in fact not stuff that humans already know, but original research, a corporate history being first published on Wikipedia.  However, because there are (a scant few) sources to be had, and becase the WP:CORP criteria are (just barely) satisfied, this is a matter for cleanup, to cite sources and to excise the unverifiable content leaving the (far smaller amount of) content that is verifiable.  Weak Keep. Uncle G 02:20, 4 October 2005 (UTC)
 * Keep per Uncle G and thanks for the research. Kappa 02:44, 4 October 2005 (UTC)
 * Delete I think that this should just be struck down as not notable and unverifiable. Also, I was reading WP:CORP criteria, and I don't see how this could be said to be even close to allowable for entry.  I was under the understanding that original research is not allowed on here.  So if this is a primary source based on someone who is directly involved with the company, then it would not be allowed because it violates the first WP:CORP guideline.  As for the newly added source, it does prove the company exists, but it states little else, and none of the other information in the article is cited.  The guidelines call for "multiple" independent sources.  One source is hardly "multiple."  It obviously does not meet any of the other guildlines, so I call for deletion. will381796 02:47, 4 October 2005 (UTC)
 * Multiple sources is good journalism. It is good encyclopaedism, too.  I'm currently at "weak keep" because I'm allowing for the remote possibility that this content might not be original research, but simply sourced from a source that my research didn't turn up.  It's unlikely, but it might have been sourced from a printed book written about the history of the company, for example.  If the original author comes along and cites such a book, then the article isn't original research. On the other hand: In the (more probable) event that no such source is cited, we don't have to delete the article to fix the problem that the sources that we can find don't cover the article content as it currently stands.  We can (and should) heavily modify the article, in the way that I outlined above, getting rid of the original research whilst keeping the article. On the gripping hand: I don't predict there being much more than two sentences that can be sourced about this company, though.  That, and the lack of multiple sources, are other reasons that I'm at "weak keep".  It could be argued that this article, in verifiable form, would be a perpetual {{corp-stub}} with no possibility for expansion, given the paucity of the sources.  A perpetual stub with no possibility for expansion is deletable.  As I said, this is a borderline case.  Uncle G 23:24, 4 October 2005 (UTC)
 * Delete. Multiple published works in WP:CORP is just too amorphous for me, and is otherwise NN. IIRC there is a new CSD criteron for NN companies under consideration.--inks T 02:53, 4 October 2005 (UTC)
 * It's the very same criterion that we use for people, for bands, and for web sites, simply phrased more generally. WP:BIO talks about newspaper coverage and independent biographies.  WP:MUSIC talks about coverage in music magazines.  WP:WEB talks about media attention.  The WP:CORP criterion for companies is simply the same idea in generalized form.  The fact that it is amorphous is a good thing.  The WP:CORP criterion doesn't restrict itself to specific, explicitly denoted, forms of published works as the other criteria do.  The WP:CORP criterion includes newspapers, magazines, and books, under a single umbrella of "published works".  (There's a case to be made that WP:BIO, WP:MUSIC, and WP:WEB should in fact be this general, too.) Uncle G 23:24, 4 October 2005 (UTC)
 * It was more of a problem with the word multiple...which can be interpreted to mean "more than 1".--inks T 01:00, 5 October 2005 (UTC)
 * Delete. This looks like unverifiable original research. Gamaliel 11:18, 4 October 2005 (UTC)
 * Delete as per nomination. utcursch | talk 11:27, 4 October 2005 (UTC)
 * Weak keep for the reasons stated by Uncle G. An 80 year old company, a reasonably written article and a type of large local business that in this age of Home Depot and Lowes that is becoming less common, all tip the scale for me to vote keep. -- DS1953 03:22, 5 October 2005 (UTC)
 * Weak keep per Uncle G. Also, may I suggest a merge of the first article into the second, which does have a bit of reference at the end, thank goodness. --Jacquelyn Marie 15:37, 5 October 2005 (UTC)
 * Keep per Uncle G. Denni ☯ 00:04, 6 October 2005 (UTC)
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in an undeletion request). No further edits should be made to this page.


text: Category:Platysteiridae

title: Category:Platysteiridae


text: Category:Cisticolidae

title: Category:Cisticolidae


text:
Talk:Easter (Patti Smith Group album)

Image copyright problem with Image:Because the Night - Patti Smith.ogg
The image Image:Because the Night - Patti Smith.ogg is used in this article under a claim of fair use, but it does not have an adequate explanation for why it meets the requirements for such images when used here. In particular, for each page the image is used on, it must have an explanation linking to that page which explains why it needs to be used on that page. Please check

 * That there is a non-free use rationale on the image's description page for the use in this article.
 * That this article is linked to from the image description page.

The following images also have this problem:

 * Image:Rock N Roll Nigger - Patti Smith Group.ogg

This is an automated notice by FairuseBot. For assistance on the image use policy, see Media copyright questions. --09:42, 15 May 2008 (UTC)

 * 1) The .ogg extension, in Microsoft Windows usage, represents a file format of audio composition, and not that of an image file; therefore, what this warning means escapes my comprehension. Fantailfan (talk) 20:44, 18 August 2008 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Easter (Patti Smith Group album). Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive http://web.archive.org/web/20110521161004/http://bpi.co.uk/platinum/platinumright.asp?rq=search_plat&r_id=25038 to http://bpi.co.uk/platinum/platinumright.asp?rq=search_plat&r_id=25038

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.—cyberbot II  Talk to my owner :Online 08:36, 29 February 2016 (UTC)

Assessment comment
Substituted at 14:01, 29 April 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Easter (Patti Smith Group album). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20111018005836/http://www.infodisc.fr/CDCertif_O.php?debut=400 to http://www.infodisc.fr/CDCertif_O.php?debut=400

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 06:23, 6 January 2018 (UTC)

title: Talk:Easter (Patti Smith Group album)


text:
Acacia rostellifera

Acacia rostellifera, commonly known as summer-scented wattle or skunk tree, is a coastal tree or small tree in the family Fabaceae. Endemic to Western Australia, it occurs along the west coast as far north as Kalbarri in the Southwest Australia savanna ecoregion, and along the south coast as far east as Israelite Bay.

The summer-scented wattle generally reproduces by suckers from underground stems. Because of this suckering, the species often forms thickets that exclude all other species. The tallest Acacia of its area, it can grow to 10 metres. Specimens above 3 metres are not often seen, however, as bushfires occur often in its area. Fire burns the plants right to the ground, but the underground stem resprouts vigorously.

title: Acacia rostellifera


text:
Narayan Gopal

Narayan Gopal Gurubacharya (नारायणगोपाल गुरबाचार्य) (4 October 1939 – 5 December 1990), known professionally as Narayan Gopal and N. Gopal was a prominent popular singer and composer of Nepali music. Regarded as one of the most significant cultural icons in Nepal, he is referred to as "Swar Samrat" (Nepali: स्वर सम्राट, meaning: Emperor of Voice) in Nepal. He also sang in Nepal Bhasa.

Owing to his vocal range he was capable of singing songs of every Nepalese genre. Often, his songs were accompanied by the sitar, harmonium and flute. He was also a music director from the 1950s to the 70s and belongs to the first generation of professional Nepali singers. His songs have been showcased in several movies and dramas across the country.

Narayan Gopal released 137 songs during his lifetime, his first songs were composed by his friends Prem Dhoj Pradhan and Manik Ratna.

Gopal was one of the most celebrated and influential musicians of the 20th century and received many awards during his lifetime.

Early life
Narayan Gopal Guruacharya was born on 18 Ashoj 1996 B.S. in Kilagal Tole, Kathmandu, Nepal to Asha Gopal Guruacharya and Ram Devi Guruacharya. He was born into a traditional Newar family and had five brothers and three sisters. He completed the School Leaving Certificate (SLC) in 2016 B.S. and obtained a Bachelor of Arts degree in humanities from Tri-Chandra College. He also went to the Maharaja Sayajirao University of Baroda in India to study Indian classical music but returned to Nepal without completing his studies. He married Pemala Lama in 1971.

Later he joined the Rashtriya Naach Ghar (National Dance Theater) and rose to the post of manager (hakim). He also worked as the editor of the musical journal Bageena for its first three issues. He became the managing director of 'Sanskritik Sansthan (Cultural Center)' and adviser to the Ministry of Communication and he was an associate professor at Lalit Kala Campus. He wrote a musical drama titled Kanchi Masyang (कान्छी मस्याङ)'.

Early career
The potential of his vocal talent was first recognized by his friend "Manik Ratna Sthapit", who lived in the neighboring Pyukha Tole, and Prem Dhoj Pradhan, who lived in Bheda Singh Tole. The three friends would practice singing Hindi songs together at Manik Ratna's house, which had become a de facto music school since his uncle, Siddhi Ratna Sthapit, was an accomplished instrumentalist. After Gopal completed his SLC exams, Prem Dhoj Pradhan took him to Radio Nepal for a voice test. There, Gopal sang "Panchi ko pankha ma dharti ko diyo," a song written by Dr. Ram Man Trishit and composed by Prem Dhoj Pradhan himself. Gopal passed the voice test on his first attempt. His first public musical performance was during the 40th anniversary celebration of Tri Chandra College, where he played the role of a tabla player.

First successes
By that time Prem-Manik duo had started to sing their own compositions. Following suit, Narayan Gopal composed six original songs written by the contemporary poet Ratna Shumsher Thapa. In that collection four of the songs were for solo vocal ('स्वर्गकी रानी', 'आँखाको भाखा आँखैले', 'भो भो मलाई नछेक', 'मधुमासमा यो दिल') and two were for duet ('बिछोडको पीडा' र 'ए कान्छा ठट्टैमा यो बैंश जानलाग्यो'). All these songs were eventually recorded in Kolkata, India, while he was in that country for his studies. These songs started to attract attention within Nepal and India.

Nepal at the time had recently been liberated from Rana rule. Midst this wave of social and political changes, Narayan Gopal was able to lend his voice to songs related to love, life, hope, and patriotism. While the east–west highway was under construction, he recorded ‘जाग, जाग चम्क हे नौजवान हो,' whereas in the fervor of patriotism ‘आमा ! तिमीलाई जलभरिका औंलाहरुले चुम्न'. Such songs made him popular among the youths of Nepal. His songs further evolved as he became more selective of songs with the right combination of words, music, and emotions. Along with his contemporaries such as Pushpa Nepali, Bacchu Kailash, Tara Devi, Amber Gurung, Prem Dhoj Pradhan, Nati Kaji, Shiva Shankar, Kiran Pradhan he added a new dimension to modern Nepali music. To broaden his style, he started to hold discussions with his admirers, his competitors, and his critics. It was in this process of development that he visited Darjeeling, India, in March 1965. The visit was fruitful for two reasons: there he met his long-time fan and future wife, Pemala Lama. He also met another young musician Gopal Yonzon, with whom he formed a close friendship as mitjyus, in part because both had Gopal as their names.

Association with Gopal Yonzon
With the partnership of a famous composer and lyricist Gopal Yonzon during the later sixties, Narayan Gopal's music entered a new phase in which he began to sing about love, loss, and tragedy. In the words of Ishwar Bhallav, Narayan Gopal became the singer of the hearts of the Nepali people. Rafi's association with Gopal Yonzon helped Narayan Gopal establish himself as one of the most prominent singers in Nepali music history. It was also at this time that new sounds from the West, such as by the Beatles and Bob Dylan, were entering and influencing the music of Nepal. To confront the influence of Western pop music, a new consciousness and a new style of music were necessary. To meet these challenges, Narayan Gopal in partnership with Gopal Yonjan created songs that continue to be popular in Nepal songs such as बिर्सेर फेरि मलाई नहेर, चिनारी हाम्रो धेरै पुरानो, तिम्रो जस्तो मुटु मेरो पनि, लौ सुन म भन्छु मेरो रामकहानी carved a special niche for Narayan Gopal among the listeners of Nepali music.

Association with Dibya Khaling
Narayan Gopal in partnership with composer and lyricist Dibya Khaling created some harmonious songs like "Sadhain Nai Ma Hasen Timilai Ruwai", "Bipana Nabhai Banchidine Ma Bhitraka Mera Sapana", "Mayako Aadharma Samjhauta Nai Hunchha", "Jata Hindyo UHeren" Tai Tanne Baimani yo Maya", " Mero Sano Sansar Timilai Atena", " Yo Bhagyale Kasto Khel Manisako Jiwanma Her Kheleko", "Jati Samma Bato Hindisake M Bhanchhu Merai Prayas Ho", "Priyasiko Yaadharu Koriyeko Mutu,Ekantma Aaj Yahan Phookayer Heren", "Timilai Bhulda Ma Eklo Parechhu,Timilai Samjhen Timi Yaad Aayau", and " Ma Ta Laliguraans Bhayechhu".

Association with Famous Poet Bhupi Sherchan
Narayan Gopal and famous poet Bhupi Sherchan were close friends. When Narayan Gopal moved to Pokhara for a stay, Bhupi Sherchan invited Narayan Gopal to stay at his house, and Narayan Gopal stayed there for some months. Narayan Gopal sang some of Bhupi Sherchan's lyrics like "Aljhechha Kyare Pachauri, Timro Chiyako Buttama", "Sanai Hurima Bainsako Sapana Shimalko Phool Jhain Jhari Gayo" and " Maile Gayeko Geetma Timrai Hansilo Muhar Chha" and become hit number songs.

Association with Famous Poet Ishwor Ballav
Narayan Gopal's partnership with Ishwor Ballav gave hit number songs like "Duita Phool Deuralima, Sathai Rakhyaun jasto Lagchha", "Mero Behoshi Aaaj, Mero Lagi Parda Bho", "Sara Din Arulai Baden, Sayad Yi Raat Mera", "Bihan Nabhai Batasle, Sheet Kina Sukaidinchha", "Malai Jindagi Yo Lagdachha, Timi Bhandachhau, Pyar Ho", and "Yo Kasto Byatha Ho". Poet I.B. wrote a lyrical poem for Narayan Gopal and those songs gave Narayan Gopal new heights in his career.

During this time, he collaborated with established Nepali composers like Nati Kaji, Shiva Sankar, Amber Gurung, and Dharmaraj Thapa. He was starting to be known as the singer of intellect.

During the beginning of the seventies, he married his long-time fan Pemala at the age of thirty-one. After their marriage his residence shifted for some time to Pokhara and later for some time to Hetauda. In Pokhara, he became acquainted with the poet Bhupi Sherchan, while in Hetauda he became acquainted with fellow songwriters and composers Bhim Birag. As a result of the interactions, he composed and sang Bhupi Sherchan's सानै हुरीमा बैँसको सपना and अल्झेछ क्यारे पछ्यौरी तिम्रो चियाको बुट्टामा; and he sang Bhim Birag's तिमीले पनि मजस्तै माया दिएर हेर.

Later career
After his short stay in Hetauda, Narayan Gopal returned to Kathmandu and managed to find a job in Rashtriya Naach Ghar (National Dance Theater) with the help of his friends Manik Ratna and Janardan Sama. He had entered Naach Ghar as a mere instrumentalist, but he slowly rose to the post of a hakim (rector).

At this stage of his life, he found himself confronting a new generation of Nepali youths. Among the young musical talents of that time, his partnership with Dibya Khaling took off; and he started lending his voice to Khalings compositions, thus initiating another phase of his singing career. Songs like सँधै नै म हाँसे तिमीलाई रुवाई, मायाको आधारमा सम्झौता नै हुन्छ, बिपना नभइ helped to revive his popularity. During this stage, he started to collaborate with a new breed of songwriters such as "Khyetra Pratap Adhikari", "Kali Prasad Rijal", "Norden Rumba", "Dinesh Adhikari", and "Bishwambhar Pyaukurel", while his relationship with his old collaborators was neglected. Among the composers of the new generation, he collaborated with the likes of Sambhujit Baskota, "Bhupendra Rayamajhi", and "Shubha Bahadur". In his late stage of his career, he lent his considerable prestige to launch the career of many upcoming musicians. As such, he was willing to compromise his artistry and sing weak songs by new composers and songwriters. He also sang in film songs.

In total his career spanned twenty-eight years, during which he sang in eighteen movies and recorded more than one hundred and fifty-seven songs.

Death
Gopal was urged by friends to quit smoking and drinking in the interests of his health. He quit drinking a few months before he died but was unable to quit cigarettes.

Narayan Gopal died from complications of diabetes on 5 December 1990 (19 Mangsir, 2047 B.S.) in Bir Hospital, at 9 p.m. in Kathmandu, at the age of 51. He had no children. After the death of Gopal, there were a number of music festivals that were dedicated to Gopal.

Legacy
To honor the king of Nepalese music, there are celebrations held on the day of his death annually in Nepal. The government has built many statues for Gopal, such as one in Chakrapath, Kathmandu which has flowers that were planted on the 21st death anniversary event of Narayan Gopal held on 5 December 2011. After death of Gopal other artists have said about Gopal's habits,for example famous musician and composer of National anthem of Nepal, Amber Gurung said, "Narayan Gopal used to drink a lot, sing with an open heart and made us laugh. This statue constantly looks in a direction. Doesn't sing, There is no value in this statue of Narayan Gopal. That is why I don't walk this way these days."

Musical style
To Narayan Gopal, the most important part of the art of modern songs were: melody, lyrics, and the singer. This did not rule out other aspects, however. Chords, he said, are required to put life in the music, but the chord progression is part of the arrangement, not something to base the composition of the melody on. When the melody is composed, the arranger will make the progression from the melody. Without a good arrangement, Narayan Gopal said, a song will be like a vegetable dish without salt or other spices.

The aspects of this recipe at work included non-repetitive melodies moving over the accompaniment, in short, repeated rhythmic figures; heterophony, countermelodies, chords, and harmonic progressions; one melody for the refrain, another for the verse, and then—as part of the arrangement—melodies for the instrumental interludes marking off the sung sections.

"While recording song for Dakshina, Gopal was talking and joking with the music director when the director said 'Why don't we order some ice cream' then he said to another musician, another musician declined the offer since it would mess up their voice than director came to Gopal and said why don't we order 1 kg ice cream than Gopal said yes that's a good idea. After ordering the ice cream he gave to Gopal than Gopal started eating another person in the studio said 'Is he crazy, if he eats the ice cream it will mess up his voice' then Gopal came into the studio he sang a song without any retakes, after singing he had gotten cold from the ice cream. Later the director asked to play the song, which sounded amazing."

Awards and recognitions
Narayan Gopal was awarded several national honours which include (all dates in Bikram Sambat):

 * Best Composition (Radio Nepal) – 2023 B.S.
 * Best Singer (Radio Nepal) – 2024 B.S.
 * Ratna Record Award – 2039 B.S.
 * Gorkha Dakshin Bahu, Fourth – 2033 B.S.
 * Indra Rajya Laxmi Award – 2040 B.S.
 * Chhinalata Award – 2044 B.S.
 * Jagadamba Shree – 2045 B.S.
 * Urbashi Rang Award – 2047 B.S.
 * Trishakti Patta, Third – 2048 B.S. (posthumously)
 * Narayan gopal singing award-1969
 * Maha Ujwaol Rastradeep awards from the President of Nepal on 2021 (posthumously)

Filmography
Narayan Gopal would hardly sing in films but when he did the film would be a blockbuster.

 * Hijo Aaja Bholi (1968)
 * Parivartan (1971)
 * Man Ko Bandh (1974)
 * Sindoor (1980)
 * Badlido Aakash	(1983)
 * Lahure (1998)

 * Chot (1990)
 * Kosheli (1990)
 * Chino (1991)
 * Maya (1991)
 * Kanchhi (1991)
 * Dakshina (1994)

Discography

 * Geeti Sradhanjali Vol 1–4 (2049-03-02)
 * Swarneem Sandhya Vol 1–2
 * Preyasi Ka Yaad Haru (2054-02-16)
 * Prem Ko Mala
 * Manche Ko Maya
 * Malai Nasodha
 * Parkhi Base

 * Lali Gurash Bhayechu
 * Aljhe Cha Kyare
 * Timro Mann Ma
 * Geeti Yatra Vol 1 (2044-10-10)
 * Narayan Gopal Ka Adhunik Geet Haru Vol 1–9
 * Malati Mangale (a musical drama)

title: Narayan Gopal