text:
2012 Salt Lake County mayoral election

The 2012 Salt Lake County mayoral election was held to elect the Mayor of Salt Lake County, Utah on November 6, 2012, alongside the presidential, House of Representatives, Senate, and gubernatorial elections. This marked the fourth election to the office since the post was created in 2000.

Incumbent two-term Democratic County Mayor Peter Corroon honored his two-term pledge and did not run for a third term.

During the election, despite the county voting for Republicans Mitt Romney in the presidential election, Gary Herbert in the gubernatorial and Orrin Hatch in the Senate election, Democratic State Senator Ben McAdams managed to keep the mayor's office Democratic, defeating Republican candidate, former county councilman Mark Crockett.

Democratic Party

 * Ross Romero, Utah Senate Minority Leader
 * Ben McAdams, Utah Senate 2nd District Senator since 2009

In the first round of delegates, McAdams won 57.4% of the vote against Romero's 42.6%. Under the party constitution, a candidate would have to get 60% of delegates' vote to win the party's nomination, otherwise they would have to face their challenger in a primary election. However, due to a newly-adopted rule, if a candidate received 57% of the vote, instead of a primary, the top two candidates would face off in a second round of balloting.

McAdams ran on working with Republicans, namely to allow Salt Lake City Mayor Ralph Becker pass an ordinance prohibiting workplace and housing discrimination against LGBT residents of the city. Romero preferred voters "being energized by Democrats and go to the polls to vote for Democrats".

McAdams defeated Romero in the second round, winning 62% of the vote against Romero's 38%.

Eliminated at convention

 * Gary Ott, county recorder
 * Richard Snelgrove, county councilman at-large, chairman of Salt Lake County GOP and Utah GOP
 * Merrill Cook, Utah's 2nd congressional district representative 1997-2001, 2004 candidate
 * Larry Decker, county auditor's office internal auditor

Advanced to runoff

 * Mike Winder, Mayor of West Valley City, Utah
 * Mark Crockett, former Salt Lake County councilman (2005-2008)

Republican runoff election
The runoff election was held on June 26, 2012.

General election
Debates were held on September 14, 2012 and September 26, 2012.

title: 2012 Salt Lake County mayoral election


text:
Wikipedia:Articles for deletion/Tine Velvet

The result was redirect to X Factor (Denmark season 3). Consensus to redirect per the discussion. (non-admin closure) --  Dane talk  23:16, 26 September 2017 (UTC)

Tine Velvet

 * – ( View AfD View log  Stats )

Minor celebrity, has done nothing since runner-up in a talent quest, fails WP:MUSICBIO, contested prod WWGB (talk) 06:16, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Bands and musicians-related deletion discussions.  M assiveYR   ♠  10:35, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Music-related deletion discussions.  M assiveYR   ♠  10:35, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Denmark-related deletion discussions.  M assiveYR   ♠  10:35, 19 September 2017 (UTC)

Redirect to X Factor (Denmark season 3). I was unsuccessful in my attempt to verify notability for this singer, but she is still likely to be searched for on Wikipedia, and the X Factor article is the most appropriate place to direct readers to. MartinJones (talk) 18:31, 19 September 2017 (UTC)
 * Redirect as per above; plausible search term. I can't find the necessary coverage to warrant a standalone article.  gongshow  talk  23:54, 19 September 2017 (UTC)

source: wikimedia

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


text:
Wulwulam

The Wulwulam, also known as the Woolwonga, were an indigenous Australian people of the Northern Territory. They are reputed to have been almost completely exterminated in the 1880s in reprisal for an incident in which some members of the tribe speared 4 miners.

Country
Wulwulam land extended over some 1,900 mi2 from the headwaters of the Mary River westwards as far as Pine Creek, and southwards almost to Katherine. On their eastern flank, their boundary lay at the source of the South Alligator River. They were also reported in the Mount Bundy area.

People
According to Norman Tindale, the Norwegian ethnographer Knut Dahl was referring to the Wulwulam in those passages where he wrote of the Agigondin, a central tableland tribe and a horde called the Agoguila.

History of contact
The Wulwulam's numbers grew as a result of the rapid reduction of members of two tribes to their south and west as European colonization developed, namely the Agikwala, Awinmul and Awarai. Remnants of the two were absorbed into the Wulwulam as subtribal hordes.

History
Copper mining discovered near Mt. Haywood in 1882 led to the development of a settlement on tribal lands along the Daly River soon afterwards, and members of the Wulwulam tribe were drawn to the site and employed there. Starting on 3 September 1884, several Wulwulam murdered four European settlers and in a reprisal known as the Coppermine massacres. Francis Herbert Sachse who ran a cattle station and also managed the mine, led the massacre at Blackfellow Creek, where an estimated 150 natives were shot, leading to their effective extermination. The Norwegian ethnographer Knut Dahl, who lived in the area for over a year a decade later, wrote as follows: The sequel, which in the Australian bush has always followed such murders, occurred in due course... Another gathering of white men, friends and fellows of the victims, also embarked upon a campaign of vengeance against the Wolwanga tribe, which had been responsible for the deed. The reports on this campaign vary, but participants have told me that after a long search they finally found a great portion of the tribe gathered at the abandoned mine. They surrounded them, drove them into a lagoon, and shot them all, men, women and children.

The pogrom continued for some years, enfeebling what had been the most powerful Daly river tribe, and also decimating the Mulluk-Mulluk tribe.

Four Wulwulam men, Tommy, Jimmy, Daly, and Ajibbingwagne, were put on trial for the killings of 4 settlers, Johannes Lubrecht Noltenius, Jack Landers (known as Hellfire Jack), Henry Houschildt and Schollert. The Jesuit mission diary records Sachse as still waging his campaign against the Wulwulam 4 years later, in 1888.

Charlie Yingi, known as Long Legged Charlie, one of the four Aboriginal men charged for the killings, was cleared eventually and settled at the Jesuit Mission on the Daly River. He was later sentenced to death for the Coppermine killing.

In 2014 there came to light a document indicating that one child of Wulwulam/Woolwonga parentage had been registered in the census undertaken in 1889, and that by virtue of this fact, her descendants moved to assert native title rights to the old Wulwulam hunting grounds.

Alternative names

 * Agigondin (eastern horde)
 * Agikwala, Agiqwolla, Agoguila, Aquguila
 * Agiwallem
 * Agrikondi, Aggraakúndi
 * Oolwunga Oolawunga
 * Wolwongga, Wulwanga, Wolwanga, Wulwonga, Woolwonga

Source:

title: Wulwulam


text:
Talk:Calculus/Introduction to multivariable calculus

Green's theorem
Yo, I added in Green's Theorem and order of integration into Multivariable Calculus, and Projection/derivatives/limits/integral/vector-valued functions/position, velocity, acceleration, tangent, normal, binormal, vectors/curvature into Vector Calculus. However, I'm not sure how much of this scope from Vector Calculus spills into this Multivariable Calculus, what else should be added (as I don't really want to edit for grammatical errors and ordering nicety, just adding articles, since I suck at ordering and English), and where I can put independence of path or if you have that in here, at one point it looks like you do, but to be honest I can't decipher what you're trying to teach; but then again I just randomly put stuff in here also. Anyways, what's going on/where can I read about, thanks, feedback? Fephisto 05:52, 14 January 2006 (UTC)

Comment
Starting with the topology of Rn feels like an higher level approach than the the other chapters in this section of this book - more suited for the fully formal third section.

I put the div, grad, hyperbolic, parabolic, etc subheadings in to indicate the expected scope of this chapter, and to allow people to fill it in from the middle. Was there any particular objection to doing this?

Does anyone have any comments on the scope of this chapter, and the rest of this book? As I understand it, it's to cover calculus from 16-19, A' Level and 1st year undergrad, mostly without full rigor. At that level, I'd expect a course on multivariable calculus to cover most or all the headings I listed, and nothing beyond. Carandol 04:48, 13 Apr 2004 (UTC)

 * You're on the wrong page. Try Talk:Calculus:Multivariable calculus. The reason why I'm doing it this way is that I'm trying to be complete, but not especially dryly rigorous. It's not that bad, is it? Anyway, I'll be getting to divs and grads etc later. Dysprosia 04:52, 13 Apr 2004 (UTC)

I hadn't noticed the redirect, left from moving the simple vector stuff to an earlier chapter.

I'd have just relied on intuitive definitions at this level, and maybe a couple of illustrations. Everyone knows what the edge of a surface or volume is, even if that intuitive notion is incomplete. That was the general approach followed by the textbooks I read at this level.

And why not leave the div, grad, etc headings in? Then people can drop stuff in the middle of the chapter, if that happens to be what they feel like writing, and it gives a better idea of the general level expected. Carandol 05:09, 13 Apr 2004 (UTC)

 * I'll put in illustrations later. I want to get most of the text out of the way first.
 * I also think certain pages should go a bit more "above and beyond the call of duty". My aesthetic for these sorts of pages is to be complete, rigorous but not formal, or to the point of excessive dryness, and to have gentler language. Maybe it's a bit too much now, so I wouldn't know where else to take it. It's not formal enough to deserve being under the "formal" section on the Calculus intro page.
 * As to the headers, I probably won't be using them exactly, so I don't know how useful it would be. Are you thinking of contributing too? Maybe we can work something out, so you can pitch in at the middle if you so choose. Dysprosia 05:29, 13 Apr 2004 (UTC)

You could start with the intuitive notion of boundaries first, then say this is how we talk about them rigorously.

I am thinking of contributing. That's another reason I put the headers in, as markers of what I intended when I was ready. I've put a section on grad in now, which belongs perhaps a third of the way down the chapter, which should also indicate the lines I was thinking along. Carandol 06:11, 13 Apr 2004 (UTC)

Your last edit is better for boundaries, Dysprosia. The problem wasn't precisely excessive rigor, more lack of motivation. We should try and say why we're making these definitions, make it clear we're going somewhere with them and where we;ve plucked them from, or some readers will get lost at this point.

Along the same lines, perhaps you could say something about why the difference between open and closed sets matters in calculus, or why it's interesting in its own right: you, because I'm reluctant to edit a subsection you're currently active in. Carandol 07:32, 13 Apr 2004 (UTC)

 * Okay, I've tried to add more motivation to these points, but feel free to pitch in at any time, however. I'll probably continue to add more later on tonight, so you can add some stuff if you want :) Dysprosia 08:04, 13 Apr 2004 (UTC)

How common is the notation ∂x h? I've seen extensive use of hx, but not the former... Dysprosia 08:22, 13 Apr 2004 (UTC)

I've seen ∂x used, (e.g PDE: Erich Zauderer ex 2.1.2), but it isn't that common. Using numbers as subscripts is more common, especially with tensors. The letters are only seem to be used that way where space is short, the names of the axes matter, and hx wouldn't work, e.g (∂x-c∂t)(∂x+c∂t)h=0, which compactly exhibits the factorisation. Carandol 12:56, 13 Apr 2004 (UTC)~

 * That reminds me of the operator form... If so, maybe use the Heaviside "big-D"? I've been using that form in other pages... what do you think? Dysprosia 13:56, 13 Apr 2004 (UTC)

That's more common than ∂x, and needs less typing. I'd use it preferentially, except in fluid dynamics (where the total derivative D/Dt is too similiar). The meaning of ∂x is obvious, there's just no call for it. Carandol 14:21, 13 Apr 2004 (UTC)

How does a set being open/closed matter for doing multi-variable calculus at this level? Which theorems will we be quoting that require the distinction? Similarly for the formal defintions of neighbourhoods etc. On reflection, I feel these details are too much of a digression from the main topic of this chapter. They might fit better in the vector chapter, which is more about the structure of Rn. Either that, or a chapter specifically about such topics.

In 1-D, direction of tangent is arctan(f'), the extension to df(t)/dt is not immediately obvious - principally because the 1-D csae isn't being thought of as parametric.

Lower case L looks too similar to 1, especially when editing, best avoided Better to premultiply ∇ by constants, not postmultiply, to avoid ambiguity

∇ as vector should be mentioned at first opportunity Carandol 20:39, 19 Apr 2004 (UTC)

 * There was something that uses open/closed sets, but I can't quite remember it now...I might remember it later, though ;)...Oh, remember now. It may be useful to mention neighbourhoods in discussing the implicit function theorem later, but certainly isn't necessary to.
 * The change in l/L is fine. There is that funky loopy l but I don't know how to generate that in TeX...Dysprosia 22:26, 19 Apr 2004 (UTC)

I'd then mention these things just before using them, putting them in the right context. It may slightly out of place, logically, but it should improve readability.Carandol 23:17, 19 Apr 2004 (UTC)

layout
I'm assuming that this wikibook isn't very active? If I'm mistaken, I would like to propose this general layout, if agreed by other editors:

Ch. 1:

Ch. 2:
 * Mostly general vectors. Discuss addition, subtraction, dot product and applications, cross product and applications.

Discuss Vector Valued functions in planes first (xy plane to be specific). Introduce projectile motion perhaps. Then move on to 3d VVF's. Here we can discuss Unit Tangent, Unit Normals, curvature etc.
 * Vector Valued Functions.

Ch. 3:
 * Partial Derivatives and Applications.

What partial derivatives are, what they're used for. Fairly self-explanatory. Then of course we need to discuss optimization and LaGrange Multipliers.

Ch. 4:
 * Integration with multiple variables.
 * Double/Triple Integrals; area/volume.

Ch. 5: damneinstien 00:32, 17 Dec 2005 (UTC)
 * Vector Fields.

Ch. 6:
 * line and surface integrals
 * Green's

Ch. 7: --Cronholm144 09:05, 18 June 2007 (UTC)
 * Curl and Div
 * Stoke's and Div theorem

Topology
Is topology really the best way to start a chapter on multi-variable? (assuming that this is supposed to be equivalent to a CAL III course) (answering my own question) I would say no, the more traditional place to start is partial derivation and the implications thereof. --Cronholm144 12:10, 19 June 2007 (UTC)

Boundary points
As someone who recently understood what a boundary point is (I amn studying calculus on my own as prepartion for next year math) I confess that definition you guys used is very hard to understand. Consider definition from the following site, both precise and not:

http://www.economics.utoronto.ca/osborne/MathTutorial/CLNF.HTM

Definitions from this site made me understand what a boundary points are much easier, even easier than it is written in the book I am using (Spivak's Calculus on manifolds). Tank you.

Errata in the Jacobian Matrix section
if you define $$\left(J_\mathbf{p} \mathbf{f}\right)_{ij} = \left.{\partial f_i \over \partial x_j}\right|_\mathbf{p}$$ then $$J \in R^{nxm}$$, i think this should be corrected. I will do this if no there aren't any objections. --Drunken sapo (talk) 14:24, 29 September 2009 (UTC)

Approach using vectors
I don't like how this page approaches it initially dealing with vectors rather than multi-variable scalar functions. It also fails to discuss how limits and continuity work in multivariate functions.--Jasper Deng (talk|meta) 02:41, 19 April 2013 (UTC)

Inverting differentials
With respect to the inverting differentials subsection of the section "Line integrals", the latter two assertions

 * If div u = V
 * $$\mathbf{u}(\mathbf{p}) =\int_{\mathbf{p}_0}^{\mathbf{p}} V \, d\mathbf{r} + \mathbf{w}(\mathbf{p})$$
 * where w is any function of zero divergence.

 * If curl u = v
 * $$\mathbf{u}(\mathbf{p}) =

\frac{1}{2}\int_{\mathbf{p}_0}^{\mathbf{p}} \mathbf{v} \times d\mathbf{r} + \mathbf{w}(\mathbf{p})$$
 * where w is any function of zero curl.

I do not believe are accurate. Let me start with the proposed formula for inverting the divergence:

It should be noted that vector field $$\mathbf{u}$$ exists no matter the scalar field $$V$$. The path integral $$\int_{\mathbf{p}_0}^{\mathbf{p}} V \, d\mathbf{r}$$ is dependent on the specific path used, which is not specified in this integral.

Now consider the spherically symmetric vector field: $$\mathbf{u}(\mathbf{p}) = |\mathbf{p}|^\alpha\frac{\mathbf{p}}{|\mathbf{p}|}$$ where $$\alpha \geq 1$$ is arbitrary. The divergence of this vector field is: $$V(\mathbf{p}) = (\nabla \bullet \mathbf{u})(\mathbf{p}) = (\alpha+2)|\mathbf{p}|^{\alpha-1}$$.

A line integral that starts at the origin gives $$\int_{0}^{\mathbf{p}} V(\mathbf{r}) \, d\mathbf{r} = \frac{\alpha+2}{\alpha}|\mathbf{p}|^\alpha\frac{\mathbf{p}}{|\mathbf{p}|} = \frac{\alpha+2}{\alpha}\mathbf{u}(\mathbf{p}) \neq \mathbf{u}(\mathbf{p})$$. The difference is not a vector field with 0 divergence. This contradicts the proposed formula.

I am certain that a similar argument can be made for the proposed formula for inverting the curl.

Math buff (discuss • contribs) 20:30, 9 February 2017 (UTC)

With respect to the proposed formula for inverting the curl, consider the cylindrical symmetric vector field: $$\mathbf{u}(\mathbf{p}) = (\rho(\mathbf{p}))^\alpha\hat{\phi}(\mathbf{p})$$ where $$\rho(\mathbf{p}) = |\mathbf{p} - (\mathbf{p} \cdot \mathbf{k})\mathbf{k}| = |\mathbf{k} \times \mathbf{p}|$$ is the distance of position $$\mathbf{p}$$ to the z-axis; $$\hat{\phi}(\mathbf{p}) = \frac{\mathbf{k} \times \mathbf{p}}{|\mathbf{k} \times \mathbf{p}|}$$ is the unit vector at position $$\mathbf{p}$$ that points in a counterclockwise direction around the z-axis; and $$\alpha \geq 1$$ is an arbitrary constant.

The curl of this vector field is $$\mathbf{v}(\mathbf{p}) = (\nabla \times \mathbf{u})(\mathbf{p}) = (\alpha + 1)(\rho(\mathbf{p}))^{\alpha-1}\mathbf{k}$$.

Let $$\mathbf{p}$$ be arbitrary. Integrating along a line from the origin to $$\mathbf{p}$$ gives:

$$\frac{1}{2}\int_{\mathbf{r} = \mathbf{0}}^{\mathbf{p}} \mathbf{v}(\mathbf{r}) \times d\mathbf{r} = \frac{1}{2}\int_{\rho = 0}^{\rho(\mathbf{p})} (\alpha + 1)\rho^{\alpha-1}\hat{\phi}(\mathbf{p})d\rho = \frac{\alpha+1}{2\alpha}(\rho(\mathbf{p}))^\alpha\hat{\phi}(\mathbf{p}) = \frac{\alpha+1}{2\alpha}\mathbf{u}(\mathbf{p})$$

For $$\alpha > 1$$, the formula $$\frac{1}{2}\int_{\mathbf{r} = \mathbf{0}}^{\mathbf{p}} \mathbf{v}(\mathbf{r}) \times d\mathbf{r}$$ fails to return $$\mathbf{u}(\mathbf{p})$$, and the difference is not a vector field with 0 curl. This contradicts the proposed formula.

Math buff (discuss • contribs) 21:30, 31 March 2017 (UTC)

I've now removed the inaccurate formulas. Math buff (discuss • contribs) 00:13, 1 April 2017 (UTC)

Splitting the page
I am currently working on this book and I stumbled upon this page that a Wikibookian suggested splitting it into multiple smaller pages. I think it contains too much information in an over-condensed way. I believe I do not have the ability to split the page on my own, so the following is my thoughts on how the page should be split if technically possible and someone actually can help split the page. I will try to complete each separated page with more content and simpler explanations so that other readers can understand multivariable calculus easier in the following year. Sorry if I caused too much trouble. I will probably ask for help in the reading room if other editors also agree with this page being too long or this discussion is left unattended for a period of time.CalciumTetraoxide (discuss • contribs) 03:30, 27 January 2021 (UTC)
 * Make Section 2 Curves and parameterizations into a separate page and rename it into "Calculus/Vector Functions"
 * Make Section 3 Limits and continuity into a separate page and name it "Calculus/Limits and Continuity"
 * Make Section 4.1 Properties into a separate page and rename it into "Calculus/Partial Derivatives"
 * Make Section 4.2 Rules of taking Jacobians into a separate page and rename it into "Calculus/Multivariable Chain Rule"
 * Make Section 4.4 Directional derivatives and 4.5 Gradient vectors into a separate page and rename it into "Calculus/Directional Derivatives and the Gradient Vector"
 * Make Sections 5.1 Riemann sums and 5.2 Iterated integrals into a separate page and rename it into "Calculus/Riemann sums and Iterated Integrals"
 * Delete Sections 4.3 Alternate notations, 4.6 Divergence, 4.7 Curl, 4.9 Second order differentials, 5.4 Parametric integrals, 5.5 Line integrals, 5.6 Surface and Volume Integrals, 5.7 Gauss's divergence theorem, and 5.8 Stokes' curl theorem because I found another page dedicated to or containing the same information.
 * Create pages with names "Calculus/Double Integrals", "Calculus/Triple Integrals", and "Calculus/Applications of Multiple Integrals".
 * The remaining content in the original page can be deleted.
 * I don't see why you can't split the page on your own. You can just copy-paste and create pages as appropriate. And for the record, I agree with you. However, all of these topics fall under multivariate calculus, so my suggestion would be to put them all under the Multivariate Calculus group. So, instead of "Calculus/Partial Derivatives", we'll have "Calculus/Multivariable calculus/Partial Derivatives". Leaderboard (discuss • contribs) 09:27, 27 January 2021 (UTC)
 * I thought that there is a special "split" action only accessible to administrators because I thought that if I just copy, paste, and delete huge chunks of content within a page in a short time, I might get misidentified as a troll. I'll start splitting the page. Thanks! CalciumTetraoxide (discuss • contribs) 17:06, 27 January 2021 (UTC)
 * I've already split the pages into several smaller pages as listed above. I intend to just delete this page because most of its content is preserved and will be expanded significantly to completion in the smaller pages. And after the splitting, the remaining content in this page cannot stand alone as a page. However, I am afraid that after deleting the page, the discussion page will be deleted as well. Is there any way to relocate the information in this discussion page to one of the smaller pages created or a simple copy and paste will suffice? CalciumTetraoxide (discuss • contribs) 18:07, 27 January 2021 (UTC)
 * I personally do not think the core Calculus/Multivariable calculus page should be deleted, because it can serve as the landing pages to the rest of the content (which are just subpages). We can just link the other pages that you've just split to instead. Leaderboard (discuss • contribs) 19:18, 27 January 2021 (UTC)


text:
Lorenzo Latham

Lorenzo L. Latham (February 10, 1812 – December 27, 1860) was an American newspaper editor and publisher. He was a founder of Alpha Delta Phi fraternity.

Early life
Latham was born in Massachusetts on February 10, 1812.

He attended Hamilton College in Clinton, New York. During his senior year, he became a founding member of the literary fraternity, Alpha Delta Phi, along with Samuel Eells, John Curtiss Underwood, Oliver Andrew Morse, and Henry Lemuel Storrs. Eells and Latham were in charge of drafting the fraternity's constitution and designing its badge.

Latham graduated from Hamilton College in 1832, as his class salutatorian.

Career
Latham became a teacher in Natchez, Mississippi. He was an editor of The Creole in Charleston, South Carolina. As an editor, he advocated on behalf of the American Party of South Carolina.

In March 1851, Lathem and Henry E. Johnson started the Louisiana State Republican in Lafayette, Jeffeson Parish. Lathem and Johnson co-edited and co-published the newspaper. Its political slant was toward the Whig Party.

In October 1851, Latham was an applicant for the position of superintendent of the New Orleans Schools. He was an associate editor of the Picayune in New Orleans from 1853 to 1860.

Personal life
Latham married Mary Barfield of Natchez, Mississippi on May 11, 1841. They had two children, H. J. Latham and James Lathem.

On December 27, 1860, Latham died from pneumonia at his home in Jefferson, Louisiana at the age of 48. He was buried in the Natchez City Cemetery in Natchez.

Legacy
Alpha Delta Phi expanded into an international social and literary fraternity with more than 53,000 members.

title: Lorenzo Latham


text:
Talk:Albion (Warhammer)

Questions
Where did this Anglon and Scarthland thing come from? I've never heard of them? Thefuguestate 21:14, 20 March 2006 (UTC)

Did the Dark Elves really have the strongest hold on the island? http://us.games-workshop.com/games/warhammer/highelves/gaming/albion/default.htm This seems to say otherwise. —Preceding unsigned comment added by Grailknighthero (talk • contribs) 01:04, 9 April 2008 (UTC)

Residents of Albion
It seems to me that the human residents of Albion are based somewhat on the picts, somewhat on saxons. It would be good in an illustrative sense to mention this in the article, but we would need a site to cite. If anyone can help, feel free. --Ifrit (talk) 19:33, 18 September 2008 (UTC)

title: Talk:Albion (Warhammer)


text:
Wiki

A wiki is a type of website that allows users to easily add, remove, or otherwise edit and change the content of the webpages. The openness and ease of editing page content makes a wiki an effective tool for collaborative authoring.

Welcome to the Wiki learning project.

If you are new to wikis, take a look at the introductory tutorial.

Project description
This Wikiversity learning project is devoted to learning how to use wiki technology to facilitate online learning. It is amazing. You can edit and learn how to make Wikipedia better. When you edit or make any page you can feel proud that you are one of the members of the best site and you will also feel proud that you are a wiki editor. You will have fun by editing and making your own pages. Wikipedia is one of the stages on which you can show your talent and can give your knowledge to millions of people.

Learning materials
Wikiversity has adopted the "learning by doing" model for education. Lessons should center on learning activities for Wikiversity participants. Learning materials can be used by multiple departments. Cooperate with other departments that use the same learning resource.

 * Introduction — New to Wikiversity? Start here!
 * Introduction to Wiki — Introduction to wiki editing and wiki communities which aims to function as a service project for the Wikiversity community and provide learning resources that will aid new Wikiversity editors.
 * Wiki 101 — A supplement to the MediaWiki Handbook geared toward Wiki editing at Wikiversity. This lesson goes into detail about Namespaces, Templates, Lists, Tables and other tools for advancing Wikiversity editors.
 * Named Colors — An alternative way to add color to pages rather than dealing with Hex, octal, RGB codes and other cryptic forms.
 * Learn to learn a wiki way — using wiki technology to support learning.
 * Nature of wikis — a cultural introspective of wiki communities and their workspaces.

Learning materials are located in the main Wikiversity namespace. Simply make a link to the name of the lesson (lessons are independent pages in the main namespace) and start writing!

Wikipedia

 * wiki

Wikibooks
Works in progress - these texts are currently at __Department Name___:
 * __Textbook Name___

Active participants
The histories of Wikiversity pages indicate who the active participants are. If you are an active participant in this project, you can list your name here (this can help small projects grow and the participants communicate better; for large projects a list of active participants is not needed).
 * User:MarkMayhew - working on learning business applications of wikis.
 * User:Rayc --working on creating tests
 * User:JWSchmidt - I am currently interested in starting some exciting community-wide projects for Wikiversity
 * Dionysios (talk), a Participant in the Wikiversity School of Advanced General Studies, Date: 2007-07-18 (July 18, 2007) Time: 1331 UTC

title: Wiki


text:
User:CIB2008 OEF

but also is proficient Spanish and limited proficiency with the German language.

Hi,

I'm about 90% active with US cold war era tanks doing editing/correcting content, some of my work has been extensive (M60 Patton). Here and there I have also contributed to other articles, mostly military in nature.

title: User:CIB2008 OEF


text:
1987 Columbia Lions football team

The 1987 Columbia Lions football team was an American football team that represented Columbia University during the 1987 NCAA Division I-AA football season. Amid a record-setting loss streak, Columbia finished last in the Ivy League.

In their second season under head coach Larry McElreavy, the Lions compiled an 0–10 record and were outscored 311 to 104. Mike Bissinger was the team captain.

The Lions' winless (0–7) conference record was the worst in the Ivy League standings. Columbia was outscored 185 to 67 by Ivy opponents.

By losing all of their games in 1987, the Lions extended a winless streak and a losing streak that began in 1983. The team would later set a Division I record for consecutive games without a win, 47. It would not win or tie another game until October 9, 1988, a win. At the end of 1987, the streak stood at 44 games without a win, and 41 straight losses.

Columbia played its homes games at Lawrence A. Wien Stadium in Upper Manhattan, in New York City.

title: 1987 Columbia Lions football team


text:
C Programming/Beginning exercises

Naming

 * 1) Can a variable name start with a number?
 * 2) Can a variable name start with a typographical symbol(e.g. #, *, _)?
 * 3) Give an example of a C variable name that would not work.  Why doesn't it work?

Data Types

 * 1) List at least three data types in C
 * 2) On your computer, how much memory does each require?
 * 3) Which ones can be used in place of another?  Why?
 * 4) Are there any limitations on these uses?
 * 5) If so, what are they?
 * 6) Is it necessary to do anything special to use the alternative?
 * 7) Can the name we use for a data type (e.g. 'int', 'float') be used as a variable?

Assignment

 * 1) How would you assign the value 3.14 to a variable called pi?
 * 2) Is it possible to assign an int to a double?
 * 3) Is the reverse possible?

Referencing

 * 1) A common mistake for new students is reversing the assignment statement.  Suppose you want to assign the value stored in the variable "pi" to another variable, say "pi2":
 * 2) What is the correct statement?
 * 3) What is the reverse?  Is this a valid C statement (even if it gives incorrect results)?
 * 4) What if you wanted to assign a constant value (like 3.1415) to "pi2":
 * a. What would the correct statement look like?
 * b. Would the reverse be a valid or invalid C statement?

String manipulation
1. Write a program that prompts the user for a string (pick a maximum length), and prints its reverse.

2. Write a program that prompts the user for a sentence (again, pick a maximum length), and prints each word on its own line.

Loops
1. Write a function that outputs a right isosceles triangle of height and width n, so n = 3 would look like

2. Write a function that outputs a sideways triangle of height 2n-1 and width n, so the output for n = 4 would be:

3. Write a function that outputs a right-side-up triangle of height n and width 2n-1; the output for n = 6 would be: *   ***   *****  ******* *********

Program Flow
1. Build a program where control passes from main to four different functions with 4 calls.

2. Now make a while loop in main with the function calls inside it. Ask for input at the beginning of the loop. End the while loop if the user hits Q

3. Next add conditionals to call the functions when the user enters numbers, so 1 goes to function1, 2 goes to function 2, etc.

4. Have function 1 call function a, which calls function b, which calls function c

5. Draw out a diagram of program flow, with arrows to indicate where control goes

Functions
1. Write a function to check if an integer is negative; the declaration should look like bool is_positive(int i);

2. Write a function to raise a floating point number to an integer power, so for example to when you use it

Math
1. Write a function to calculate if a number is prime. Return 1 if it is prime and 0 if it is not a prime.

2. Write a function to determine the number of prime numbers below n.

3. Write a function to find the square root by using Newton's method.

4. Write functions to evaluate the trigonometric functions.

5. Try to write a random number generator.

6. Write a function to determine the prime number(s) between 2 and 100.

Merge sort
1. Write a C program to generate a random integer array with a given length n,  and sort it recursively using the Merge sort algorithm.
 * The merge sort algorithm is a recursive algorithm.

- sorting a one element array is easy.

- sorting two one-element arrays,  requires the merge operation. The merge operation looks at two sorted arrays as lists, and compares the head of the list, and which ever head is smaller, this element is put on the sorted list and the head of that list is ticked off, so the next element becomes the head of that list. This is done until one of the lists is exhausted, and the other list is then copied onto the end of the sorted list.

- the recursion occurs, because merging two one-element arrays produces one two-element sorted array, which can be merged with another two-element sorted array produced the same way. This produces a sorted 4 element array, and the same applies for another 4 element sorted array.

- so the basic merge sort, is to check the size of list to be sorted, and if it is greater than one, divide the array into two, and call merge sort again on the two halves. After wards, merge the two halves in a temporary space of equal size, and then copy back the final sorted array onto the original array.

Binary heaps
2. Binary heaps :
 * A binary max-heap or min-heap, is an ordered structure where some nodes are guaranteed greater than other nodes, e.g. the parent vs two children. A binary heap can be stored in an array, where ,

- given a position i (the parent), i*2 is the left child, and i*2+1 is the right child.

- ( C arrays begin at position 0, but 0 * 2 = 0, and 0 *2 + 1= 1, which is incorrect, so start the heap at position 1, or add 1 for parent-to-child calculations, and subtract 1 for child-to-parent calculations ).

 * try to model this using with a pencil and paper, using 10 random unsorted numbers, and inserting each of them into a  "heapsort" array of 10 elements.

 * To insert into a heap, end-add and swap-parent if higher, until parent higher.

 * To delete the top of a heap,  move   end-to-top,  and  defer-higher-child or sift-down, until no child is higher.

 * try it on a pen and paper the numbers 10, 4, 6 ,3 ,5, 11.

 * the answer was 11, 5, 10, 3, 4, 6.

in descending order.
 * EXERCISE: Now try removing each top element of 11, 5, 10, 3, 4, 6 , using  end-to-top and sift-down ( or swap-higher-child) to get the numbers

 * a priority queue allows elements to be inserted with a priority, and extracted according to priority. ( This can happen usefully, if the element has a paired structure, one part is the key, and the other part the data. Otherwise, it is just a mechanism for sorting ).

 * EXERCISE: Using the above technique of insert-back/challenge-parent, and delete-front/last-to-front/defer-higher-child, implement either heap sort or a priority queue.

Dijkstra's algorithm
Dijkstra's algorithm is a searching algorithm using a priority queue. It begins with inserting the start node with a priority value of 0. All other nodes are inserted with priority values of large N. Each node has an adjacency list of other nodes, a current distance to start node, and previous pointer to previous node used to calculate current node. Alternative to an adjacency list, is an adjacency matrix, which needs n x n boolean adjacencies.

The algorithm basically iterates over the priority queue, removing the front node, examining the adjacent nodes, and updating with a distance equal to the sum of the front nodes distance for each adjacent node, and the distance given by the adjacency information for an adjacent node.

After each node's update, the extra operation "update priority" is used on that node :

while the node's distance is less than it's parents node ( for this priority queue, parents have lesser distances than the children), the node is swapped with the parent.

After this, while the node is greater distance than one or more of its children, it is swapped with the least distant child, so the least distant child becomes parent of its greater distant sibling, and parent to the greater distant current node.

With updating the priority, the adjacent node to the current node has a back pointer changed to the current node.

The algorithm ends when the target node becomes the current node removed, and the path to the start node can be recorded in an array by following back pointers, and then doing something like a quick sort partition to reverse the order of the array, to give the shortest path to target node from the start node.

Quick sort
3. Write a C program to recursively sort using the Quick sort partition exchange algorithm. - an advantage of reuse is less writing time, debugging time, testing time. classes : those elements less than the partition value, the partition element, and everything above (and equal to ) the partition element. and one at the element next to the partition element, and repeatedly scanning the left pointer right, and the right pointer left. and these are swapped, which uses the temporary extra space. should occur before swapping, otherwise the right pointer may be swapping a less-than-partition element previously scanned by the left pointer. element just before the last element. This happens when all the elements are less than the partition.
 * you can use the "driver", or the random number test data from Q1. on mergesort. This is "re-use", which is encouraged in general.
 * the concept of partition exchange is that a partition element is (randomly) selected, and every thing that needs sorted is put into 3 equivalence
 * this can be done without allocating more space than one temporary element space for swapping two elements. e.g a temporary integer for integer data.
 * However, where the partition element should be using the original array space is not known.
 * This is usually implemented with putting the partition on the end of the array to be sorted, and then putting two pointers, one at the start of the array,
 * the left scan stops when an element equal to or greater than the partition is found, and the right scan stops for a smaller element than the partition value,
 * the left scan will always stop if it reaches the partition element, which is the last element; this means the entire array is less than partition value.
 * the right scan could reach the first element, if the entire array is greater than the partition, and this needs to be tested for, else the scan doesn't stop.
 * the outer loop exits when then left and right pointers cross. Testing for pointer crossing and outer loop exit
 * finally, the partition element needs to be put between the left and right partitions, once the pointers cross.
 * At pointer crossing, the left pointer may be stopped at the partition element's last position in the array, and the right pointer not progressed past the

- if the right pointer is chosen to swap with the partition, then an incorrect state results where the last element of the left array becomes less than the partition element value.

- if the left pointer is chosen to swap with the partition, then the left array will be less than the partition, and partition will have swapped with an element with value greater than the partition or the partition itself.

 * The corner case of quicksorting a 2 element out-of-order array has to be examined.

- The left pointer stops on the first out of order element. The right pointer begins on the first out-of-order element, but the outer loop exits because this is the leftmost element. The partition element is then swapped with the left pointer's first element, and the two elements are now in order.

- In the case of a 2 element in order array, the leftmost pointer skips the first element which is less than the partition, and stops on the partition. The right pointer begins on the first element and exits because it is the first position. The pointers have crossed so the outer loop exits. The partition swaps with itself, so the in-ordering is preserved.

the plus one the intended initial scan positions, and use the pre-increment and pre-decrement operators e.g. ( ++i, --i).
 * After doing a swap, the left pointer should be incremented and right pointer decremented, so the same positions aren't scanned again, because an endless loop can result ( possibly when the left pointer exits when the element is equal to or greater than the partition, and the right element is equal to the partition value).  One implementation, Sedgewick,  starts the pointers with the left pointer minus one and right pointer

Exercices en langage C Programmeerimiskeel C/Harjutused C/Ćwiczenia dla początkujących

title: C Programming/Beginning exercises


text:
User:Vuara/The Phoenician Alphabet

The Phoenician Alphabet

 * http://www.phoenicia.org/alphabet.html
 * http://www.phoenicia.org/tblalpha.html
 * http://www.phoenicia.org/semlang.html
 * http://www.phoenicia.org/cadmus.html
 * http://www.phoenicia.org/imgs/alphatree.jpg
 * http://www.phoenicia.org/imgs/evolchar.gif
 * http://www.phoenicia.org/imgs/siniatic.jpg
 * http://www.phoenicia.org/imgs/akkadian-sinai.gif

Phoenician Alphabet, Mother of Modern Writing Evolution of Phoenician into Latin/Western scripts and Arabic/Eastern scripts Analytical developmental table of Phoenician Alphabet, Names of Letters, Phonetics, Derivatives and Modern Equivalents Phoenician Font for Mac or Windows (Download) Phoenician Alphabet, Adopted by the Greeks Herodotus on the origins of the Greek Alphabet

Phoenician Alphabet, Mother of Modern Writing

Alphabetic writing was already well established in the Late Bronze Age at Ugarit where a cuneiform script was used. The Phoenician alphabetic script was borrowed to write well before the first millennium BC.

The Phoenicians were not mere passive peddlers in art or commerce. Their achievement in history was a positive contribution, even if it was only that of an intermediary. For example, the extent of the debt of Greece alone to Phoenicia may be fully measured by its adoption, probably in the 8th century BC, of the Phoenician alphabet with very little variation (along with Semitic loan words); by "orientalizing" decorative motifs on pottery and by architectural paradigms; and by the universal use in Greece of the Phoenician standards of weights and measures. Having mentioned this, the influence on or from Linear A and B scripts is unknown.

Phoenician words are found in Greek and Latin classical literature as well as in Egyptian, Akkadian, Arabic, Aramaic and Hebrew writings. The language is written with a 22-character alphabet that does not indicate vowels.

Although the Phoenicians used cuneiform (Mesopotamian writing) in what we call Ugaritic, they also produced a script of their own. The Phoenician alphabetic script of 22 letters was used at Byblos as early as the 15th century B.C. This method of writing, later adopted by the Greeks, is the ancestor of the modern Roman alphabet. It was the Phoenicians' most remarkable and distinctive contribution to civilization.

The Roman naturalist Pliny the Elder was a great admirer of the Phoenicians, he credited them with many discoveries, including the invention of trade. Although Pliny was not adverse to exaggerating, scholars do accept his evidence that Phoenicians were the first traveling salesmen. Because they needed an efficient method of keeping records, they invented an alphabet from which every alphabet of the world has descended. Along with an alphabet came the equipment for using it: pen, ink and, of course, papyrus, parchment and finally paper. A wax-writing tablet was found in an ancient Uluburun shipwreck (most likely to have been Canaanite Phoenician) off the coast of Turkey. Please see an image of the original wax tablet below.

The oldest of the attested Semitic languages, Akkadian, was the vehicle of a great ancient literature written in a logosyllabic cuneiform writing system of Sumerian origin. Records of other ancient Semitic languages exist in various forms. Amorite, another ancient Semitic language, is known from proper names; Ugaritic (please see image of Ugaritic cuneiform, top left) was written in a quasi-alphabetic cuneiform script unconnected with the Akkadian. The Canaanites of Phoenicia used a still undeciphered syllabic script, the Proto-Byblian, in the 2nd millennium BC, while those of Palestine and the Sinai Peninsula employed another undeciphered writing, the Sinaitic script, which may be alphabetic in nature. All the other Semites used and, for the most part, still use consonantal quasi-alphabets with no means or only imperfect means to distinguish the vowels. All such alphabets -- of which the more important are the Hebrew, the Aramaic/Syriac, and the Arabic -- are descended from the Phoenician linear quasi-alphabet of 22 signs, first attested at Byblos and externally similar to the Proto-Byblian script. All the European alphabets are descendants of the Phoenician, and all the Asiatic alphabets are descendants of the Aramaic variants of the Phoenician.

From a South Arabian variant of the earliest Semitic alphabet the Ethiopians developed a syllabic writing still in use for the languages of Ethiopia. Maltese uses the Latin alphabet.

Important Note: Please make sure to view vital tables, charts and graphics.

Phoenician & Other Fonts for Mac or Windows (Download) Note: If you experience problems downloading any of these fonts, please try to:

Right-click and save file in Windows, or Hold down Control key and download in Mac If you continue to have problems, please e-mail me.

Phoenician font (TrueType)

eshmoon.mac.zip (Mac) -- updated March 16, 2004 eshmoon.pc.zip (Windows) -- updated March 16, 2004 Ugaritic Canaanite/ Phoenician font (TrueType)

Ugaritic.suit (compressed Mac OS X tar.gz) Ugaritic TT Windows.zip (zipped Windows) Syriac font (TrueType)

Aramaic & Syriac (compressed Mac OS X tar.gz) Syriac (compressed Mac OS X tar) Syriac.msi (installer Windows) All fonts are patented freeware. They may be used for personal purposes; however, if/when they are used for public purposes, the author needs to be duly credited. Please read the "Read Me" files contained in the compressed groups of files. Windows users need to use WINZIP to uncompress the zipped font files or use the Installer. They do not work, if uncompressed. Two characters are not included per the Cypriot version.

The Phoenician alphabet in all its variants changed from its North Semitic ancestor only in external form -- the shapes of the letters varied a little in mainland Phoenician and a good deal in Punic (in North African Phoenician colonies) and neo-Punic. The alphabet remained, however, essentially a Semitic alphabet of 22 letters, written from right to left, with only consonants represented and phonetic values unchanged from the North Semitic script.

Phoenician Alphabet, Adopted by the Greeks According to the ancient Greek historian, Herodotus, the Phoenicians introduced their alphabet to Greece. Cadmus the Phoenician is attributed with the credit for this introduction. Further, Phoenician trade was the vessel which speeded the spread of this alphabet along side Phoenician trade which went to the far corners of the Mediterranean. Phoenician alphabet is the ancestor of the Greek alphabet and, hence, of all Western alphabets.

The earliest Phoenician inscription that has survived is the Ahiram epitaph at Byblos in Phoenicia, dating from the 11th century BC and written in the North Semitic alphabet. The Phoenician alphabet gradually developed from this North Semitic prototype and was in use until about the 1st century BC in Phoenicia proper.

Phoenician colonial scripts, variants of the mainland Phoenician alphabet, are classified as Cypro-Phoenician (10th-2nd century BC) and Sardinian (c. 9th century BC) varieties. A third variety of the colonial Phoenician script evolved into the Punic and neo-Punic alphabets of Carthage, which continued to be written until about the 3rd century AD. Punic was a monumental script and neo-Punic a cursive form. Following is the account from Herodotus on the origins of the Greek Alphabet in words of Herodotus.

Herodotus on the origins of the Greek Alphabet (5.58-61) from Herodotus, The Histories, transl. Audrey de Selincourt, Penguin Books, 1972. ISBN 0-14-044034-8

Repulsed from Sparta, Aristagoras went on to Athens, which had been liberated from autocratic government in the way which I will now describe. Hipparchus, the son of Pisistratus and brother of the despot Hippias, in spite of a vivid dream which warned him of his danger, was murdered by Harmodius and Aristogiton, two men belonging to the family of the Gephyraei; the murder, however, did the Athenians no good, for the oppression they suffered during the four succeeding years was worse than before. Hipparchus had dreamt, on the night before the Panathenaic festival, that the tall and beautiful figure of a man stood over his bed and spoke to him these obscure and riddling words:

O lion, endure the unendurable with enduring heart; No man does wrong and shall not pay the penalty. At dawn next morning he was seen communicating his dream to the interpreters; but later he put it out of his mind and took part in the procession, during which he was killed.

The Gephyraei, to whom the two men who killed Hipparchus belonged, came, by their own account, originally from Eretria; but I have myself looked into the matter and find that they were really Phoenicians, descendants of those who came with Cadmus to what is now Boeotia where they were allotted the district of Tanagra to make their homes in. After the expulsion of the Cadmeans by the Argiva, the Gephyraei were expelled by the Boeotians and took refuge in Athens, where they were received into the community on certain stated terms, which excluded them from a few privileges not worth mentioning here. The Phoenicians who came with Cadmus - amongst whom were the Gephyraei - introduced into Greece, after their settlement in the country, a number of accomplishments, of which the most important was writing, an art till then, I think, unknown to the Greeks. At first they used the same characters as all the other Phoenicians, but as time went on, and they changed their language, they also changed the shape of their letters. At that period most of the Greeks in the neighbourhood were Ionians; they were taught these letters by the Phoenicians and adopted them, with a few alterations, for their own use, continuing to refer to them as the Phoenician characters - as was only right, as the Phoenicians had introduced them. The Ionians also call paper 'skins' - a survival from antiquity when paper was hard to get, and they did actually use goat and sheep skins to write on. Indeed, even today many foreign peoples use this material. In the temple of Ismenian Apollo at Theba in Boeotia I have myself seen cauldrons with inscriptions cut on them in Cadmean characters - most of them not very different from the Ionian. There were three of these cauldrons; one was inscribed: 'Amphityron dedicated me from the spoils of the Teleboae' and would date from about the time of Laius, son of Labdacus, grandson of Polydorus and great-grandson of Cadmus. Another had an inscription of two hexameter verses:

Scaeus the boxer, victorious in the contest, Gave me to Apollo, the archer God, a lovely offering This might be Scaeus the son of Hippocoon; and the bowl, if it was dedicated by him and not by someone else of the same name, would be contemporary with Laius' son Oedipus. The third was also inscribed in hexameters:

Laodamas, while he reigned, dedicated this couldron To the good archer Apollo - a lovely offering. It was during the reign of this Laodamas, the son of Eteocles, that the Cadmeans were expelled by the Argives and took refuge with the Encheles. The Gephyraei remained in the country, but were later forced by the Boeoeians to withdraw to Athens, where they have certain temples set apart for their own special use, which the other Athenians are forbidden to enter; one of them is the temple of Demeter Achaeia, in which secret rites are performed.

Tables and Charts:

Please make sure to view the tables, charts and graphics from links below.

Analytical Developmental Table of Phoenician Alphabet Analytical developmental table of Phoenician Alphabet, Names of Letters, Phonetics, Derivatives and Modern Equivalents -- Phoenician to Greek to Etruscan to Roman. Evolution of Picture Writing to Alphabet Writing The analytical graphical chart makes a comparative study of Sinaitic or Demotic Hieroglyphic -- the short hand form of ceremonial hieroglyphic of ancient Egypt -- and what word representation they contained. It also illustrates the forms of the Phoenician alphabet as an evolution from picture writing to letters. Comparison of Phoenician and Sinaitic script to Akkadian Cuneiform and Ugaritic Cuneiform Graphical chart that presents a comparison of the said forms of writing.* Evolution of Phoenician into Latin/Western Scripts and Arabic/Eastern Scripts Graphical chart that presents the evolution of the Phoenician alphabet to Greek, Etruscan and Latin, on one side, and to Aramaic, Hebrew and Arabic on the other.
 * Author unknown and it is published without permission.

title: User:Vuara/The Phoenician Alphabet


text:
Using GNOME/Differences with Windows

If you are used to Microsoft Windows, here are the differences you will find.

Taskbar
There is no taskbar. The clock is located at the top of the screen. GNOME does not provide a list of buttons to switch between each window.

Start Menu
By default, there is no start menu in GNOME. However, it is easy to enable an Applications menu that works very much like the Windows start menu. Programs in the Applications menu are listed by category (Graphics, Internet, Office, and so on) rather than in alphabetical order.

My Documents
Like modern versions of Windows, GNOME provides four different folders for your documents: Documents, Music, Pictures, and Videos. All of these folders are contained within your “home folder.” To see your home folder, launch the Files app. A new copy of the Files app will display the contents of your home folder by default.

My Computer
External disks such as thumb drives appear in the list at the left of the Files app automatically when they are plugged in. Linux doesn’t use drive letters like A: or C:. Instead, drives are given more logical names. Viewing the contents of your hard drive is more complicated.

Control Panel
GNOME’s Control Panel is called Settings. You can find a few more options in the “Extensions” app as well.

Recycle Bin
GNOME calls this the Trash. (In some languages, it is called the Wastebasket instead.) It works just like the Recycle Bin in Windows. You can find it on the left side of a Files app window.

Windows Explorer/File Manager
In GNOME, this is called the Files app. You can find it in the Applications menu or the Activities screen.

title: Using GNOME/Differences with Windows