text:
Wikipedia:Articles for deletion/Noran bakrie

The result of the debate was delete. Mailer Diablo 02:02, 26 March 2006 (UTC)

Noran bakrie
Non-notable web artist. 12 Google hits. Instead of speedy, I chose prod, but the prod tag was removed, so I am taking this here. Delete. Kusma (討論) 10:59, 21 March 2006 (UTC)
 * Delete per nom. --Ed (Edgar181) 13:30, 21 March 2006 (UTC)
 * Delete as vanity. Feezo (Talk) 13:50, 21 March 2006 (UTC)
 * Delete Not notable, possible vanity ect... Nigelthefish 14:57, 21 March 2006 (UTC)
 * Delete as NN, promotional.  OhNo itsJamie Talk 23:05, 22 March 2006 (UTC)
 * Delete per above. --Khoikhoi 04:11, 25 March 2006 (UTC)


text:
Krishnapur, Murshidabad

Krishnapur is a village in the Lalgola CD block in the Lalbag subdivision of Murshidabad district in the state of West Bengal, India.

Location
Krishnapur is located at 24.4123°N, 88.2582°W.

Krishnapur is a village in Lalgola gram panchayat (Murshidabad district). It is about 1 km from Lalgola.

Area overview
While the Lalbag subdivision is spread across both the natural physiographic regions of the district, Rarh and Bagri, the Domkal subdivision occupies the north-eastern corner of Bagri. In the map alongside, the Ganges/ Padma River flows along the northern portion. The border with Bangladesh can be seen in the north and the east. Murshidabad district shares with Bangladesh a porous international border which is notoriously crime prone (partly shown in this map). The Ganges has a tendency to change course frequently, causing severe erosion, mostly along the southern bank. The historic city of Murshidabad, a centre of major tourist attraction, is located in this area. In 1717, when Murshid Quli Khan became Subahdar, he made Murshidabad the capital of Subah Bangla (then Bengal, Bihar and Odisha). The entire area is overwhelmingly rural with over 90% of the population living in the rural areas.

Note: The map alongside presents some of the notable locations in the subdivisions. All places marked in the map are linked in the larger full screen map.

Demographics
According to the 2011 Census of India, Krishnapur had a population of 19,462, of whom 10,014 (51%) were males and 9,448 (49%) were females. The population in the age range 0–6 years was 2,715. The number of literate persons in Krishnapur was 11,270 (67.30% of the population over 6 years).

Transport
State Highway 11A, running from Raghunathganj to Bhagawangola passes through Krishnapur.

Krishnapur is a station on the Ranaghat-Lalgola branch line.

Healthcare
Krishnapur Rural Hospital, with 50 beds, is the major government medical facility in Lalgola CD block.

See also - Healthcare in West Bengal

source: wikimedia

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

title: Krishnapur, Murshidabad


text:
1983 Kansas Jayhawks football team

The 1983 Kansas Jayhawks football team represented the University of Kansas in the Big Eight Conference during the 1983 NCAA Division I-A football season. In their first season under head coach Mike Gottfried, the Jayhawks compiled a 4–6–1 record (2–5 against conference opponents), finished in seventh place in the conference, and were outscored by opponents by a combined total of 320 to 296. They played their home games at Memorial Stadium in Lawrence, Kansas.

The Jayhawks upset 10th ranked USC in Los Angeles 26–20 in what remains their only game against USC in school history.

The team's statistical leaders included Frank Seurer with 2,789 passing yards, Kerwin Bell with 498 rushing yards, and Bob Johnson with 1,154 receiving yards. Seurer, Mike Arbanas, Paul Fairchild, E. J. Jones, and Eddie Simmons were the team captains.

title: 1983 Kansas Jayhawks football team


text:
John Wright (basketball)

John Thomas "Doc" Wright (January 8, 1921 – July 24, 2008) was an American professional basketball player. He played in the National Basketball League for the Youngstown Bears in two games during the 1945–46 season and averaged 5.5 points per game. Some sources indicate that he played at George Washington University, but GWU's all-time letter winners records do not include him.

title: John Wright (basketball)


text:
The Kayapo: Out of the Forest

The Kayapo: Out of the Forest is a 1989 color documentary film and the second of two films, the first being the 1987 film The Kayapo. Both films were directed by Michael Beckham with assistance by Terry Turner, a consulting anthropologist.

The film focuses on the conflict between the Kayapo Indian Nation and the Electronorte power development company of the Brazilian government, along with the World Bank, who will be the source of funding. Electronorte is pushing to construct a dam near the Kayapo village, which if built would flood much of the Kayapo's land. This film documents the plight of the Kayapo Indians and their struggle to not only save their village but also the rivers and rainforest of Brazil, which they state will be irrefutable destroyed if the Kararao dam is built.

Synopsis
The Kayapo Indians of Central Brazil are faced with an unwanted development that could bring devastation to their villages and the rainforest. This in turn brought the reunification of the thirteen Kayapo villages along with forty other Indian nations in an organized protest to protect it. The Kayapo chiefs and key leaders, especially Chief Payakan, are ready to defend their land from the development of the Kararao dam on the Xingu river by means of a political demonstration in-front of the international media. If the dam is built, the Xingu river will flood onto very large areas of Kayapo territory. A neighboring dam, the Tucuri dam, is highlighted in the film as an example of the possible ramifications building a new dam could bring.

Cast

 * Kayapo Chief Payakan
 * Chief Ropni
 * Chief Pombo
 * Chief Komari
 * Chikari
 * Kubini Kynti
 * Sting
 * Kokomu
 * Jose Antonio Muniz (Chief Engineer Electronorte).
 * Kokomu
 * Jose Antonio Muniz (Chief Engineer Electronorte).

Production
The films were shot on location in the lowlands of South America, in Central Brazil, where the Kayapo Indians inhabit a large area of land near the Xingu River.

Release information
The Kayapo: Out of the Forest was first released to view on ITV in 1989 on the 13th of June.

Reception
This film received mixed reviews, as some criticized the lack of a more in-depth account as to the relationship between foreign banks and investors and the Amazonian hydroelectric project. In another review the film is depicted as being a great educational addition in the studies of anthropology and ecology.

title: The Kayapo: Out of the Forest


text:
1860 Braidwood colonial by-election

A by-election was held for the New South Wales Legislative Assembly electorate of Braidwood on 10 August 1860 because of the resignation of Frederick Cooper.

Results
Frederick Cooper resigned.

title: 1860 Braidwood colonial by-election


text:
Massive Multiplayer Online Role Playing Game Research Project

Welcome to the Massive Multiplayer Online Role Playing Game Research Project (MMORPGRP - pronounced Morp-Group)

There are currently a variety of open source massive multiplayer online role playing game (MMORPG) projects in existence over at Sourceforge.

This research project may attempt to discover how to integrate the most appropriate technologies to develop an MMORPG that is:
 * Flexible
 * Fun
 * Fast
 * Decentralized
 * Secure
 * Light
 * Portable
 * Open

Questions to answer
What is the corporate appeal of projects like Second Life?
 * Second life has over 8 million users.

What has contributed to World of Warcraft's ongoing success?
 * The Blizzard name, purposely addictive game mechanics, the previous Warcraft titles.
 * A large user base

'''What has contributed to other large-scale MMORPG successes? (EverQuest, RuneScape, GuildWars, Neverwinter Nights, etc.)'''
 * Word-of-Mouth
 * Ability to host private servers and dungeons (Ultima Online and Dungeons & Dragons, for example)
 * Ease of Access

How can custom scripting be implemented into an MMORPG?
 * addons (e.g. WoW using LUA)
 * This can be done by programming the server to control some objects' behavior using an internal scripting language.

What would be a more specific and appropriate name for this project?
 * OMP (Open MMORPG Project)
 * OpenWorld
 * WikiVerse
 * FreeGameVerse?

How could security be implemented in a decentralized MMORPG while still keeping the integrity of character abilities and powers?
 * Check abilities/powers etc. against a database record and check for increases or decreases according to items or beneficial effects and check where they came from and block "bad" ones.
 * How could this question be worded more succinctly and clearly?
 * Before you can discuss security, you need to know how the "decentralized" model works.

How does the "decentralized" model work?

'''What is meant by decentralized? What will be centralized in the game?'''
 * Player finding, how will other players/clients be found?

Will there be a true decentralized network, or will there still be a server?
 * If there is a server then what will be done with Peer to Peer and what will be done on the server?

'''What will be special in this game? Will there be unique features?'''

Brainstorming
Tentatively, the structure will be as follows: A central server will act as a placeholder for the "world". The "world" could be designed to encompass any scenario set to any scale (i.e. this "world" could be an aquatic planet roughly the size of the Atlantic, or an entire solar system comparative to our own.) This "world" could even be a clone of present reality in a rough vector-based form (so that one server could initially handle the load). Perhaps all this could be accomplished with 500MB - 1GB of hard drive space.

Considering Lunar Boom Town's current approach, perhaps a symbolic interface to logical analog and digital control circuity designed via defined zones, initial conditions, restriction condition sets, etc. could take the place of the server. This may work initially for prototyping or until a better method can be implemented. With the "worlds" asynchronously updating to each other's statuses, holds, releases, automatic rule checking, implementation of filters, wormholes, etc. it would quickly grow into fairly accurate overview of our perceived reality. When participation picks up, it should not take much to trigger blooms in resolution within densely trafficked regions. There could also be unique one-offs, each starting a sequence of versions as the known cases are slowly incremented to other cases which need to be examined.

Mirwin 14:40, 27 November 2007 (UTC)

Dekenet 02:12, 10 January 2008 (UTC) (simple edits for clarity)

How about this: should the game be real-time all the time? De-centralizing could work in a way like wiki works. Inside the game universe is created an adventure module/project/room that only some people know of (and have the rights to drive as some kind of mini-servers). Everybody has basically a change to be part of the adventure module, but not necessarily so.

Here a short concept of game I've been pondering about. It is role playing in a sense of Nethack or Elite, where lone adventurer enters the dungeon/space/new continent and starts stockpiling as usual. This part is done independently on the client side. Random generation is the key here, we just might need to check the status of created items min/max from the server. Adventuring goes on, but there are certain locations/wormholes/magic fields that connect to other plains. On these plains the player interacts with the server or other players real-time. These interactions can be mini-games, information feeds, challenges etc. but the main idea here is that there is a higher goal. Personal stockpiling and colonialist thinking won't win the game. One's equipment might make of some use, but more important is to get other characters' support. Player is encouraged to work together with others in order to advance. Maybe they need some energy crystals to open up a new portal that only one can be carried per character or maybe people should join to give sufficient energy to one of the group to get to the next level/another planet/selected as president etc..

A few characters can meet in a small portal and get a few connections elsewhere in the universe. More advanced players have more options like this. These actions should somehow affect the universe. Not in a sense of just having separate economy of just buying selling stuff, but adventures played should have an organic way of materializing new modules in the game universe. For example, if a group of players can invoke magic that summons some monster, that monster should stay active until dispelled. Or if a group of adventures create a kingdom that kingdom starts to live on its own. Or starting some support group which eventually could be supporting somebody else. Basic idea is, however, that not all the players are in contact with everybody all the time but they adventure in a seemingly endless universe that has portals here and there to jump elsewhere. The most important thing is to create a strive for something that is constructive not destructive in nature.

Most of the actions should be able to be driven offline and then update to the game universe. This way the decentralization could work. This kind of approaches are used on smaller scale in several tactics games but without the common changing universe or common goals.

--JJ 15:38, 16 March 2008 (UTC)

Do not limit research and data-gathering to one or two key sources (SourceForge & FreshMeat seem to be the only ones used as references). The MMORPG world is vast and diverse; make sure sources, reference materials, data, and all research and artifacts come from all available sources...not just favorites or preferred locations.

The key to getting and keeping a long-term MMORPG player's attention is to provide a game that encompasses what THEY want, not what the developer wants to achieve. For example: EverQuest had a long life in terms of keeping a player's attention, but had some very critical flaws in design that were, unfortunately, addressed too late to retain the long-term player base that had since shifted to "greener" pastures. Gaming might be a 'social' activity, but some people do not want to be forced to join groups, find companions, or have lists of friends to advance, explore, or conquer. The ability to successfully solo your way to the same level as a group-oriented player should be one of the highest priorities in game development, regardless of your choice in class/function/race, etc.

While the idea of an open-source plane where characters can leave a lasting impression (i.e. - the summoning of a monster) is enticing, it poses serious risks as far as game balance, security, hackers, game-spoilers and the like. This topic would have to be addressed in order to successfully integrate real-time player integration with environment.

--MC 17:15, 15 January 2013

Open source

 * CrystalSpace3d - An open source portable 3d gaming engine.
 * Expanses of Naryan - An open source 3d MMORPG
 * aocpp An open source C++ port of Argentum Online, a 2D MMORPG(AKA project Morgoao ).
 * The ManaWorld - An open source 2D MMORPG with lots of support.
 * Angelion - Isometric 2d MMORPG with realtime map editing.
 * FIFE - An isometric 2D fallout like engine.
 * Angelion: The Demon Project - Another MMORPG
 * Daimonin -                         "     "
 * Isotope - An open source decentralized MMORPG (This is not truly decentralized; a server is still involved.)
 * PHP MMORPG (AcetoneRPG) - An MMORPG framework designed to work in a web browser using Ajax, PHP, and MySQL
 * Bullet Physics Engine - Open source free to use physics library. Pretty slick.


text:
kantautua

Verb

 * 1)  To carry, be carried, reach, emanate,.
 * 2)  To drift, wash (up) due to the action of water; to be tracked.
 * 1)  To drift, wash (up) due to the action of water; to be tracked.
 * 1)  To drift, wash (up) due to the action of water; to be tracked.

title: kantautua


text:
Wikipedia:Articles for deletion/Jakub Tenčl

The result was Delete.  JGHowes   talk  01:26, 1 October 2019 (UTC)

Jakub Tenčl

 * – ( View AfD View log  Stats )

Fails WP:BIO and WP:SIGCOV. Very very poor referencing. Mostly books. Only one actual ref and that doesn't assert nowt. Possibly A7.  scope_creep Talk  23:59, 23 September 2019 (UTC)
 * Delete I don't see any references that qualify as third-party reliable sources. OhNo itsJamie Talk 00:48, 24 September 2019 (UTC)
 * Note: This discussion has been included in the list of Authors-related deletion discussions. Shellwood (talk) 05:46, 24 September 2019 (UTC)
 * Note: This discussion has been included in the list of Czech Republic-related deletion discussions. Shellwood (talk) 05:46, 24 September 2019 (UTC)
 * Note: This discussion has been included in the list of England-related deletion discussions.  CAPTAIN RAJU (T) 06:05, 24 September 2019 (UTC)
 * Delete No evidence of notability. BubbaJoe123456 (talk) 13:21, 24 September 2019 (UTC)

 * Delete - There's lots of books and tapes by him but insignificant coverage about him. No reliable sources that I see. Bearian (talk) 15:27, 24 September 2019 (UTC)
 * Delete - Mostly all information found on him is his own writings or tapes. He seems to be notable in his own mind. The article also is missing inline citations and is very self serving. VViking Talk Edits 17:38, 24 September 2019 (UTC)
 * Delete Sources are not clear enough Catorce2016 (talk) 07:00, 26 September 2019 (UTC)
 * Delete there is an article on cs.wiki but it is almost entirely referenced to self-published sources, just like this one. No evidence of independent notability. – filelakeshoe (t / c) 🐱 15:16, 26 September 2019 (UTC)
 * Delete - Doesn't present enough notability. Barca (talk) 20:20, 26 September 2019 (UTC)
 * Delete Perhaps this could have been a speedy deletion. Edwardx (talk) 14:11, 27 September 2019 (UTC)


text:
List of Norwegian football transfers summer 2012

The 2012 summer transfer window for Norwegian football transfers opened on 1 August and closed on 31 August 2012. Additionally, players without a club may join at any time. This list includes transfers featuring at least one Tippeligaen or Adeccoligaen club which are completed after the end of the winter 2011–12 transfer window and before the end of the 2012 summer window.

Aalesund
In:

Out:

Brann
In:

Out:

Fredrikstad
In:

Out:

Haugesund
In:

Out:

Hønefoss
In:

Out:

Lillestrøm
In:

Out:

Molde
In:

Out:

Odd Grenland
In:

Out:

Rosenborg
In:

Out:

Sandnes Ulf
In:

Out:

Sogndal
In:

Out:

Stabæk
In:

Out:

Strømsgodset
In:

Out:

Tromsø
In:

Out:

Viking
In:

Out:

Vålerenga
In:

Out:

Bodø/Glimt
In:

Out:

Bryne
In:

Out:

Bærum
In:

Out:

Kongsvinger
In:

Out:

Sandefjord
In:

Out:

Sarpsborg 08
In:

Out:

Start
In:

Out:

Tromsdalen
In:

Out:


text:
Puzzles/Logic puzzles/5 Houses

Einstein's riddle

There are 5 houses in 5 different colors. In each house lives a person with a different nationality. The 5 owners drink a certain type of beverage, smoke a certain brand of cigar, and keep a certain pet. No owners have the same pet, smoke the same brand of cigar, or drink the same beverage.

Somebody owns a fish. The question is: who?

Hints:

The English man lives in the red house.

The Swede keeps dogs as pets.

The Dane drinks tea.

The green house is one house to the left of the white house.

The green homeowner drinks coffee.

The person who smokes Pall Mall rears birds.

The owner of the yellow house smokes Dunhill.

The man living in the center house drinks milk.

The Norwegian lives in the first house.

The man who smokes Blends lives next to the one who keeps cats.

The man who keeps the horse lives next to the man who smokes Dunhill.

The owner who smokes Bluemaster drinks beer.

The German smokes Prince.

The Norwegian lives next to the blue house. The man who smokes Blends has a neighbor who drinks water.

Solution

title: Puzzles/Logic puzzles/5 Houses


text:
keep out of

Verb

 * 1) To stay away from (a place or condition).
 * 2) To restrain someone or something from entering (a place or condition).
 * 1) To restrain someone or something from entering (a place or condition).

title: keep out of


text:
JLPT Guide

Before 2010, there were only 4 levels of the JLPT, and the test agency released official vocabulary and grammar lists. One level was split in two, forming the current N2 and N3 levels. Since then, the test agency has not released vocabulary or grammar lists for either of these levels. As such, the N2 and N3 lists here are formed using things test takers remember and general estimates as to the difficulty of the material, and should not be considered entirely comprehensive. The N5, N4, and N1 material should be rather representative.

title: JLPT Guide


text:
Sukhvir Singh

himanshu lakra is an Indian politician and is member of the Sixth Legislative Assembly of Delhi. He is a member of the Aam Aadmi Party and represents Mundka (Assembly constituency) of Delhi.

title: Sukhvir Singh


text:
Primary Mathematics/Method for Factoring

A method of prime factorization for children
In math, the way you get to the correct answer is just as important as getting the right answer. Sometimes the way one gets the answer can be thought of a proof. People don't usually use the word proof when talking about arithmetic problems, but I think it is a good idea and good habit to get into. This is a method of doing prime factorization that constructs a proof that your answer is correct as you arrive at the answer. It keeps you from getting lost and shows your work. More importantly, I think it helps you understand the process. It starts out very easy, so that beginners can use it, but later on lets you skip some steps to save time.

The basic point of prime factorization is to take a number and find the prime factors. Since each prime factor may occur more than once, for example in the number 4, which has prime factors (2,2), we know that the factors of a number are not a set but a multi-set. (The difference will be important as you get to more advanced math.) So the basic way we are going to do our work looks like this:

pf(X) = { a reason we believe this} (a list of factors)

For example, for the number 4, we could factorize it like this:

pf(4) = { 4 = 2 * 2 }   (2,2)

This is a very simple proof, and also represents what is sometimes called "showing our work" or our "scratch paper". Learning math is often about learning the language and symbols of math, and we need to do that now.

I use the symbol pf(X) to mean "the prime factors of X". I use a comma list of numbers of "pf(X)" symbols between parentheses to mean a multi-set of prime factors. So (pf(45),2,5) means "multi-set that includes the prime-factors of 45 and the prime number 2 and the prime number 5".

Now, for doing prime factorization, we are only going to allow certain reasons to go from one step to the next toward the answer. For example, "my friend Harold said so" is not a good reason.

The first reason that we will allow is a simple multiplication equation of the form x = y * z.   In particular, we are allowed to do this:

pf(x) = { x = y*z } (pf(y),pf(z))

so long as the equation x = y* z is true (and y and z are both greater than 1, otherwise we'd be going in circles!)

The second rule that we are allowed to use is to replace pf(x) with (x) if we know for sure that x is a prime. For example, you should probably memorize the first ten primes: (2, 3, 5, 7, 11, 13, 17, 19, 23, 29), so it's OK to go from substitute the number 23 for pf(23), since we should know by heart that 23 is prime. When we do this, we give the reason "23 is prime".

Finally, we need to note that ((X)) = (X), no matter what X is, so we never need to write parentheses inside parentheses (this is not true of multiplication, it is only true because we are using parentheses to mean something special).

So let's do an example:

pf(4) = { 4 = 2 * 2 }   (pf(2), pf(2) = { 2 is prime}    (2,2)

So, in this example, we've chained together two steps, with a reason for each one that is very simple. This is a good idea when you are starting out. However, mathematicians also want to be efficient, so if you are sure of what you are doing, you could do two steps at once: pf(4) = { 4 = 2 * 2, 2 is prime} (2,2)

Notice that whether we perform one, two, or even more steps, we are really creating an equation. If we drop out the intermediate steps, the result is pf(4) = (2,2), which is probably about what someone would want on a test.

Now let's do a harder one:

pf(60) = { 60 = 6 * 10 }   (pf(6), pf(10)) = { 6= 2* 3, 10 = 2* 5 }   (2,3,2,5) = { commutativity of multiplication} (2,2,3,5)

Commutativity of multiplication is a rule that just lets us reorder the factors. It's nice to have them in order in our list, so we will often do that at the end. But that's a lot of writing, so we'll abbreviate it { com. of mult. } Also, notice that in the second step I dropped the unnecessary parentheses, instead of writing ((2,3), (2,5)).

Now let's do an even bigger one, that's still easy, since the prime factors are all small, and it's easy to see the factors.

pf(450) = { 450 = 45 * 10 }   (pf(45), pf(10)} = { 45 = 5 * 9, 10 = 2 * 5 }    (5,pf(9),2,5) = { 9 = 3 * 3, com. of mult.}    (2,3,3,5,5)

Now we see a way in which we could have made a mistake --- if we forgot that 9 is not prime and had written (5,9,2,5). Hopefully we would have noticed, but we need to be careful!

When the factors aren't obvious
I think this is a nice method when the factors are easy to see. But unfortunately, sometimes they aren't easy to see at all, and we need a new symbol for expressing our work in that case.

Consider the number 143. Is it prime, or does it have factors? Well, its not obvious. The basic approach to finding any factor, or proving that a number is prime, is to start at the first prime (the number 2) and see if it is a factor. By going systematically up through each prime, we either find a factor or reach a prime that is bigger than the square root of the number, in which case we know the number is prime.

However, this is sometimes a big job, and we would really like to show our work in a way that helps us keep track of where we are and also can be quickly checked over to make sure we haven't made any mistakes.

The way we can do this is with the symbol nu(X,Y), which means "the multi-set of prime factors of Y, understanding that none of the numbers up to and including X evenly divide Y". I'm thus using the "not divisible up to" function nu both to help remember what has already been checked, but I've defined it so that my equation remains technically true at all times. The reason we want this symbol is that we know that is how you prove something is prime---you prove nu(sqrt(Y),Y), and then you know Y is prime. For example, if you know nu(13, 123), you know 123 is prime since 13*13 > 123. We can introduce nu(2,X) with the reason { X is not even}. If we know nu(2,X), then we can introduce nu(3,X) with the reason { sum of X's digits not divisible by 3 }.

So let's try this:

pf(143) = { 143 is not even } (nu(2,143)) = { 1+4+3 not divisible by 3 } (nu(3,143)) = { 143 doesn't end in 5 } (nu(5,143)) = { 143 / 7 = 20 and 3 / 7 } (nu(7,143)) = { 143 / 11 = 13!!}   (11,pf(13)) = { 13 is prime } (11,13)

So that is our answer. Now in this case, we had to use a reason that we derived by division: 143/ 7 is not a whole number, but 20 and 3/ 7s. And, we were surprised to learn that 11 evenly divides 143. Let's try an even harder one. (Note, I am using the divisibility test from the Dr. Math website: http://mathforum.org/dr.math/faq/faq.divisibleto50.html rather than doing division for many of these divisibility tests at noted, but if I had to do it on a test, I would use division, since I don't have those rules memorized.) pf(1709) = { not even, doesn't sum to 3, doesn't end in 5 } (nu(5,1709)) = { 170+45 = 215, not divisible by 7 (x5 and add rule for 7) } (nu(7,1709)) = { 1709/ 11 leaves 609, 609/ 11 leaves 59 (short division)} (nu(11,1709)) = { 170+ 4*9 = 206, 20+24 = 48 not divisible by 13 (x4 and add rule for 13) } (nu(13,1709)) = { 170-45 = 125, not divisible by 17 (x5 and subtract rule for 17) } (nu(17,1709)) = { 170+18 = 188, not divisible by 19 (x2 and add rule for 19)} (nu(19,1709)) = { 170+63 = 233, not divisible by 23 (x7 and add rule for 23)} (nu(23,1709)) = { 170+27 = 197, 19+21 = 40, not divisible by 29 (x3 and add rule for 29)} (nu(29,1709)) = { 170 - 27 = 143, 14 - 27 = -13, not divisible by 31 (x3 and subtract rule for 31)} (nu(31,1709)) = { 170 - 99 = 71, not divisible by 37 (x11 and subtract rule for 37)} (nu(37,1709)) = { 170 - 36 = 134, 41* 3 = 123 (x4 and subtract rule for 41) } (nu(41,1709)) = { 4*43 = 172, 3 * 43 = 129, 1720+129 = 1849, so by nu rule we are done!} (1709)

By systematically working our way up from 2 to the square root of the number, we can always keep track of where we are. For example, if we had started with 6 * 1709 = 10254, we would have ended up with:

pf(10254) = { even} (2,pf(5127)) = {5+1+2+7=15 = 3 * 5 }   (2,3,pf(1709)) .....   (2,3,1709)

and then the proof would proceed as it did above, carrying with it the prime factors 2 and 3 the whole time.

It is recommended that children use this method of writing out their work in order to build good habits that will pay off in algebra and other more advanced mathematical calculation, and introduces gently the all-important concept of the proof.

One sometimes sees factor trees suggested as a notation. Factor trees may be useful for visualizing some things but are not useful at all if one can't see the factors!


text:
Sharon Lee (politician)

Sharon Lee is an American Democratic politician from New York City. From January 2020 until December 2020, she served as the borough president of Queens through the height of the COVID-19 pandemic. Lee is the first person of Asian descent to serve as a borough president in the City of New York.

As the COVID-19 pandemic devastated the borough, Lee managed the distribution of tons of pounds of food and support for small businesses, a dozen virtual job fairs for out-of-work New Yorkers, 2020 presidential election amidst the pandemic, funding for hospital services including doubling the number of SANE nurses across Queens hospitals, championed racial justice in the wake of the police killing of George Floyd, and helped boost Queens County's count in the 2020 United States Census.

Some of her signature public investments included a $1 million allocation to fully fund the FDNY's Decontamination Specialization Unit in Corona, Queens to purchase and install new equipment necessary for cleaning firefighters' equipment, and a $5.4 million allocation to fully fund cutting-edge cancer treatment technology at the oncology unit of Elmhurst Hospital, one of Queens' two public hospitals. Lee also weighed in on key land use issues—including a recommendation opposing the 2020 Flushing Waterfront rezoning plan.

Lee was an early outspoken leader amidst the scourge in anti-Asian hate, especially in the wake of the Atlanta spa shootings.

Previously, she served as Deputy Queens Borough President from November 2018 through December 2019.

Political career
Lee was appointed deputy borough president in November 2018. Lee took over as borough president from Melinda Katz in January 2020, who was elected Queens District Attorney in November 2019. Lee oversaw the borough's response to the COVID-19 pandemic in New York City.

Prior to that, Lee served as the Executive Director of the Transition Committee for Queens District Attorney Melinda Katz from November-December 2019, and as Communications Director for the Queens Borough President from November 2014-October 2018.

Previously, Lee served as Senior Advisor and Press Secretary to former New York City Comptroller John Liu from September 2009-December 2013. Lee was instrumental in innovative priorities such as the Pension Investment Reform Proposal of 2011 between Comptroller Liu and Mayor Michael Bloomberg, and Retirement Security Initiative NYC in 2011 between Comptroller Liu and the Schwartz Center for Economic Policy Analysis. Lee helped develop and execute strategies for award-winning transparency initiatives such as Checkbook NYC in 2010 that launched unprecedented access to information about the City’s expenditures, and MWBE Report Card NYC in 2021, a performance measurement tool to publicly track City agencies’ progress in achieving their MWBE goals. She was also an integral member of the team that identified and exposed the fraud and mismanagement of the infamous CityTime case in 2010, which ultimately led to the recoupment of an historic $500 million for the City of New York.

She served as Policy Director and Press Secretary to former New York City Councilmember and Transportation Committee Chair John Liu from 2006-2009.

Lee opposes cuts in healthcare spending. She did not run for reelection.

title: Sharon Lee (politician)


text:
Wikipedia:Articles for deletion/Project Hindsight

The result was   delete. The Bushranger One ping only 03:10, 25 July 2012 (UTC)

Project Hindsight

 * – ( View AfD View log  •  Stats )

There are plenty of scholar and book sources about "Project Hindsight", but they are about a '60s military research project, not astrology. Nothing suggests to me that this astrology project is sufficiently notable to get a standalone article. MakeSense64 (talk) 17:51, 11 July 2012 (UTC)
 * Speedy keep - you seem to have got lost in references to the other use of the term. Here's a link to a recent scholarly assesment of the influence of the project in a book published by Springer. See this Google Books check, which shows that there are a great many literary references to Project Hindsight from independent works. Also this and this - which shows the term needs independent reference from that of its main translator, Robert Schmidt. In addition, there are plenty of other WP pages linking to this term. --   Zac   Δ talk! 09:55, 12 July 2012 (UTC)
 * The only actual source you have shown, only gives a passing one line mention. The list of links is just some external links added to articles, I'm not sure what you propose that shows. The list of books from google you show also only give passing mentions. Note the requirements of WP:GNG and ORG. IRWolfie- (talk) 19:15, 12 July 2012 (UTC)
 * Right. The kind of trivial mentions we see in these links do not allow us to write a properly sourced article. Where does the text of the current article come from, if not from the organization's own website? If this is the case then we should not have an article about this topic. MakeSense64 (talk) 08:46, 18 July 2012 (UTC)

 * Note: This debate has been included in the list of Organizations-related deletion discussions.  • Gene93k (talk) 14:20, 12 July 2012 (UTC)

 * Relisted to generate a more thorough discussion so a clearer consensus may be reached.

 * Please add new comments below this notice. Thanks, —Tom Morris (talk) 18:43, 18 July 2012 (UTC)

 * Delete. Upon a search, once you sieve out the material about the military project, what's left is not close to reliable sources and I was unable to find anything beyond the level of the single line in the book noted above.  Ubelowme U  Me  19:08, 18 July 2012 (UTC)
 * Delete as lacking indepth coverage in independent sources. If such sources are added tot he article, feel free to ping my talk page. Stuartyeates (talk) 22:28, 20 July 2012 (UTC)


text:
rotzak

Etymology
Compound 🇰🇲. Reportedly (WNT, De Vries) a bahuvrihi meaning “a syphilitic”. Syphilis was also known as the French disease, explaining why it became a slur for French and Walloon people.

Noun

 * 1) scumbag, fiend

title: rotzak


text:
MMTS

MMTS may refer to:
 * Moscow Monorail
 * Hyderabad Multi-Modal Transport System, a suburban railway in Hyderabad, Telangana, India
 * MMTS (meteorology), the Maximum Minimum Temperature System used to track temperature over a period of time
 * MMTS Kwidzyń, a team handball and a member of the European Handball Federation

title: MMTS


text:
James Edmund Burke

James Edmund Burke (April 23, 1849 – May 4, 1943) was an American politician who served as the 18th, 20th, 22nd, and 27th mayor of Burlington, Vermont. A Democrat, he also served in the Vermont House of Representatives from 1925 to 1927, 1931 to 1935, and 1937 to 1939.

Early life
James Edmund Burke was born in Williston, Vermont on April 23, 1849, a son of Irish immigrants James and Ann Burke; his parents named him for Irish statesman Edmund Burke. He was educated in the public schools of Williston and at Williston Academy. In 1870 Burke married Sarah Roakes and in May 1873, they moved to Burlington, where he worked as a blacksmith.

Burlington politics and government
Burke became involved in politics as a Democrat in the 1890s and was a founder of Burlington's Young Men's Democratic Club. He became involved in Burlington's city affairs when he was appointed to local positions including election day ballot clerk, and he was elected an alderman from the 4th Ward in 1893. In the mid to late 1890s, Burke also served on the school board and as a member of the board of police commissioners.

In 1900 he made his first attempt for Burlington's mayoralty, but was defeated by incumbent Robert Roberts. In 1902 he ran for mayor against incumbent Mayor Donly C. Hawley and was defeated in a landslide along with the rest of the city Democrats.

In 1903 he ran against Hawley again and was initially defeated by three votes, but after a recount and a ruling by the state supreme court Burke was declared as the winner in May. During his first term as mayor, Burke suspended the chief of police and launched an investigation into the police department, oversaw the establishment of the city's electric department and completion of the electrical infrastructure construction. He was easily reelected in 1904 against R. E. Brown with 1,965 votes to 1,495 votes. Burke served as Burlington's postmaster 1915 to 1923.

In 1929 he ran for mayor of Burlington and was defeated in a landslide by former mayor John Holmes Jackson with 3,425 votes to 2,354 votes. During the 1933 Burlington mayoral election incumbent Mayor Jackson chose not to run for reelection and endorsed Burke. In his fourth term he oversaw the creation of what would become the Burlington International Airport; in 1934, during his 5th term, he presented to Amelia Earhart the keys to the city at the airport.

State politics and government
In 1900 and 1902 he was selected as one of Burlington's delegates to the Vermont Democratic state convention. In 1902, Burke ran for Vermont Secretary of State. In 1904 he served as a delegate to the Democratic National Convention. He was the unsuccessful Democratic nominee for Governor of Vermont in 1908.

In 1912, Burke engaged in an extended feud with Thomas H. Browne, Vermont's member of the Democratic National Committee and unsuccessfully attempted to have him replaced by James E. Burke of West Rutland. Later that year, Burke campaigned for Woodrow Wilson for president. During World War I, Burke joined a statewide speaker's bureau that made speeches in support of fundraising for the American Red Cross and other wartime causes.

Burke represented Burlington in the Vermont House of Representatives from 1925 to 1927, 1931 to 1935, and 1937 to 1939. In his final term, Burke was the oldest member of the legislature, and was recognized as the dean of the House.

Death and burial
On May 4, 1943, Burke died in Burlington after a short illness. He was buried at Saint Joseph Cemetery in Burlington.

title: James Edmund Burke


text:
User:Rosskurator~enwikibooks

I’m writing my thesis in media and communication studies at the University in Zurich (Switzerland) about Wikipedia. I research the following question: What are the conditions for a wiki system to produce journalistic texts of high quality. I measure the influence that traffic, number of edits, vandalism, anonymous edits and relevance have on the quality of the articles. To put it into concrete terms, I try to find answers to the following questions:

 * What is the critical mass for users and authors in a wiki system?
 * What effect have number of edits, authors and discussion edits, traffic, age of the article and backlins on quality?
 * what influence has vandalism on quality?
 * Do anonymous authors contribute in a positive or negative way?
 * What is the connection between the relevance of a topic an the quality of the article?

I research a sample of 450 articles from the german Wikipedia.

You'll find more information at http://editthispage.blogspot.com (german) or you can contact me at abraendle [at] gmx [dot] ch.

title: User:Rosskurator~enwikibooks


text:
Trigonometry/Solving Trigonometric Equations

Trigonometric equations are equations including trigonometric functions. If they have only such functions and constants, then the solution involves finding an unknown which is an argument to a trigonometric function.

sin(x) = n
The equation $$\sin(x)=n$$ has solutions only when $$n$$ is within the interval $$[-1,1]$$. If $$n$$ is within this interval, then we first find an $$\alpha$$ such that:
 * $$\alpha=\arcsin(n)$$

The solutions are then:
 * $$x=\alpha+2k\pi$$
 * $$x=\pi-\alpha+2k\pi$$

Where $$k$$ is an integer.

In the cases when $$n$$ equals 1, 0 or -1 these solutions have simpler forms which are summarized in the table on the right.

For example, to solve:
 * $$\sin\bigl(\tfrac{x}{2}\bigr)=\frac{\sqrt3}{2}$$

First find $$\alpha$$ :
 * $$\alpha=\arcsin\bigl(\tfrac{\sqrt3}{2}\bigr)=\frac{\pi}{3}$$

Then substitute in the formulae above:
 * $$\frac{x}{2}=\frac{\pi}{3}+2k\pi$$

 * $$\frac{x}{2}=\pi-\frac{\pi}{3}+2k\pi$$

Solving these linear equations for $$x$$ gives the final answer:
 * $$x=\frac{2\pi}{3}(1+6k)$$

 * $$x=\frac{4\pi}{3}(1+3k)$$

Where $$k$$ is an integer.

cos(x) = n
Like the sine equation, an equation of the form $$\cos(x)=n$$ only has solutions when n is in the interval $$[-1,1]$$. To solve such an equation we first find one angle $$\alpha$$ such that:
 * $$\alpha=\arccos(n)$$

Then the solutions for $$x$$ are:
 * $$x=\pm\alpha+ 2k\pi$$

Where $$k$$ is an integer.

Simpler cases with $$n$$ equal to 1, 0 or -1 are summarized in the table on the right.

tan(x) = n
An equation of the form $$\tan(x)=n$$ has solutions for any real $$n$$. To find them we must first find an angle $$\alpha$$ such that:
 * $$\alpha=\arctan(n)$$

After finding $$\alpha$$, the solutions for $$x$$ are:
 * $$x=\alpha+k\pi$$

When $$n$$ equals 1, 0 or -1 the solutions have simpler forms which are shown in the table on the right.

cot(x) = n
The equation $$\cot(x)=n$$ has solutions for any real $$n$$. To find them we must first find an angle $$\alpha$$ such that:
 * $$\alpha=\arccot(n)$$

After finding $$\alpha$$, the solutions for $$x$$ are:
 * $$x=\alpha+k\pi$$

When $$n$$ equals 1, 0 or -1 the solutions have simpler forms which are shown in the table on the right.

csc(x) = n and sec(x) = n
The trigonometric equations $$\csc(x)=n$$ and $$\sec(x)=n$$ can be solved by transforming them to other basic equations:
 * $$\csc(x)=n\ \Leftrightarrow\ \frac{1}{\sin(x)}=n\ \Leftrightarrow\ \sin(x)=\frac{1}{n}$$
 * $$\sec(x)=n\ \Leftrightarrow\ \frac{1}{\cos(x)}=n\ \Leftrightarrow\ \cos(x)=\frac{1}{n}$$

Further examples
Generally, to solve trigonometric equations we must first transform them to a basic trigonometric equation using the trigonometric identities. This sections lists some common examples.

a sin(x)+b cos(x) = c
To solve this equation we will use the identity:
 * $$a\sin(x)+b\cos(x)=\sqrt{a^2+b^2}\sin(x+\alpha)$$

 * $$\alpha=\begin{cases}\arctan\bigl(\frac{b}{a}\bigr), & \mbox{if } a>0 \\ \pi+\arctan\bigl(\frac{b}{a}\bigr), & \mbox{if } a<0 \end{cases}$$

The equation becomes:
 * $$\sqrt{a^2+b^2}\sin(x+\alpha)=c$$

 * $$\sin(x+\alpha)=\frac{c}{\sqrt{a^2+b^2}}$$

This equation is of the form $$\sin(x)=n$$ and can be solved with the formulae given above.

For example we will solve:
 * $$\sin(3x)-\sqrt3\cos(3x)=-\sqrt3$$

In this case we have:
 * $$a=1,b=-\sqrt3$$
 * $$\sqrt{a^2+b^2}=\sqrt{1^2+\Big(-\sqrt3\Big)^2}=2$$
 * $$\alpha=\arctan\Big(-\sqrt3\Big)=-\frac{\pi}{3}$$

Apply the identity:
 * $$2\sin\left(3x-\frac{\pi}{3}\right)=-\sqrt3$$
 * $$\sin\left(3x-\frac{\pi}{3}\right)=-\frac{\sqrt3}{2}$$

So using the formulae for $$\sin(x)=n$$ the solutions to the equation are:
 * $$3x-\frac{\pi}{3}=-\frac{\pi}{3}+2k\pi\ \Leftrightarrow\ x=\frac{2k\pi}{3}$$

 * $$3x-\frac{\pi}{3}=\pi+\frac{\pi}{3}+2k\pi\ \Leftrightarrow\ x=\frac{\pi}{9}(6k+5)$$

Where $$k$$ is an integer.

Matemática elementar/Trigonometria/Equações e inequações envolvendo funções trigonométricas

authors: יהודה שמחה ולדמן


text:
Turnpike Troubadours

The Turnpike Troubadours are an American country music band from Tahlequah, Oklahoma founded in 2005. They started their own imprint, Bossier City Records, in 2007 and have released six studio albums. Their self-titled 2015 album peaked at number 17 on the Billboard 200.

Career
The band was formed in 2005 by Evan Felker and R.C. Edwards. Their debut album, Bossier City, was recorded a month after the formation of the band, in order to have a recording to sell at live shows. Felker later said the musical arrangements were "not a good representation" of what the band later became.

Their sophomore album, Diamonds & Gasoline, followed in 2010.

The songs "Easton and Main" and "Bossier City" were re-recorded for their 2015 self-titled album.

In October 2017, the album A Long Way from Your Heart was released, peaking at number three on the Billboard Top Country Albums chart.

Following a string of poor performances in late 2018, stemming from Felker's insobriety, the band was forced to cancel 12 shows slated to be held in the weeks to follow, returning on November 30th to play at ACL Live. Felker's personal battles continued the following year, spurring the band to cancel all remaining tour dates. It left the band's future undecided but noting a possible return to the stage once "everyone is of strong mind, body and spirit and can deliver what our fans deserve."

In November 2021, the band's Instagram was cleaned of all previous posts and their website displayed only the band's logo and a message that read "Coming Soon". In January 2022, the band announced their long-awaited reunion and return to live performances, holding their first shows on April 8–9, 2022 at Cain's Ballroom. One month later, another two-night run of shows were held May 14–15 at Red Rocks Amphitheatre.

On August 25, 2023 the band released their album A Cat in the Rain after releasing three earlier singles: "Mean Old Sun," "Chipping Mill," and "Brought Me."

Musical style, composition, and influences
Critically, the Turnpike Troubadours' musical style has been labeled as primarily country music and its respective subgenres, such as red dirt,  honky-tonk, Americana, neotraditional country, and country rock. Mark Deming of AllMusic referred to the Turnpike Troubadours as a "country-leaning roots rock band," with elements of political folk music, honky-tonk, bluegrass, Cajun music, and rock.

In an interview with the Chicago Tribune, band co-founder and bassist RC Edwards identified the band's musical style as honky-tonk.

title: Turnpike Troubadours


text:
Stever (disambiguation)

Stever may refer to:

Places

 * Stever, a river in Germany
 * Stever Ridge, ridge in Victoria Land in Antarctica

People

 * Guyford Stever (1916–2010), American administrator, physicist, educator, and engineer
 * Johann Stever (1889–c.1945), German officer during World War II
 * Margo Taft Stever, American poet
 * Michael Stever, American film director, cinematographer, producer, writer, and actor
 * Travis Stever (born 1978), lead guitarist for American rock band Coheed and Cambria

Other

 * Willoughby v. Stever, American legal case

title: Stever (disambiguation)


text:
Gandurar

Gandurar (Гандурар; Гъвандзурар) is a rural locality (a selo) in Kilersky Selsoviet, Dokuzparinsky District, Republic of Dagestan, Russia. The population was 39 as of 2010.

Geography
Gandurar is located 6 km southwest of Usukhchay (the district's administrative centre) by road. Kiler and Esetar are the nearest rural localities.

Nationalities
Lezgins live there.

title: Gandurar


text:
vú sữa

Etymology
🇰🇲, perhaps inspired by a folktale about a mother who turned into this tree, or inspires it.

Noun

 * 1) the star apple fruit,

title: vú sữa


text:
Yuvaraj Adhikari

Yuvaraj Adhikari (युवराज अधिकारी) (1920-1983) was a Nepalese politician belonging to the Nepali Congress Party (NCP). He was in the forefront of the leaders who took part in 1947 Biratnagar jute mill strike along with Girija Prasad Koirala, Tarini Prasad Koirala, Man Mohan Adhikari He was among the six National Congress leaders i.e. Bishweshwar Prasad Koirala, Girija Prasad Koirala, Tarini Prasad Koirala, Gehendrahari Sharma, Manmohan Adhikari who were taken to Kathmandu as the prisoners of conscience from Biratnagar via the land routes. It took 24 days for them to reach Kathmandu on foot, and was jailed at a Sundarijal-based prison after completing the walk. He was in active role in and after abolition of Rana rule. Later he was arrested and imprisoned by King Mahendra following the 1960 royal coup. Upon his release, Adhikari, was exiled to India along with other leaders and workers of the party and returned home following a government to grant him amnesty. He was then involved in underground politics to abolish the Panchayati regime.

title: Yuvaraj Adhikari


text:
Louis 'Country & Western' Armstrong

Louis 'Country & Western' Armstrong is a 1970 album by the trumpeter and singer Louis Armstrong of country and western music. It was Armstrong's last album of recorded music.

Armstrong's vocals were dubbed over the pre-recorded instrumental backing. Armstrong's contributions were recorded in New York due to his health issues, with the remainder being recorded in Nashville, Tennessee. Armstrong appeared on The Johnny Cash Show to promote the album in October 1970, the month of its release.

Reception
Eugene Chadbourne reviewed the reissue of the album for Allmusic and wrote that "Fans of Armstrong's singing, in fact, will probably hate this record even more than fans of his trumpet playing...With the understanding that he was one of the great musical geniuses of the 20th century, it nonetheless must be stated firmly that in the final judgment, delivered by someone attempting to sit through this record, no rating system of any kind can really describe just what a total piece of crap it is". The decision to have Armstrong record his vocals separately from the instrumental backing led Chadbourne to describe the music as "just rhythm run-throughs, with Armstrong singing, mumbling, and commenting over the top; the instrumental parts are devoid of any flair or commitment whatsoever" and that the "resulting lack of any sort of sympathy or communication between Armstrong and the accompanying musicians is simply a total death blow".

Track listing

 * 1) "Miller's Cave" (Jack Clement) – 3:47
 * 2) "Almost Persuaded" (Billy Sherrill, Glenn Sutton) – 4:18
 * 3) "Running Bear" (J.P. Richardson) – 3:16
 * 4) "Get Together" (Chet Powers) – 3:40
 * 5) "Crystal Chandeliers" (Ted Harris) – 2:37
 * 6) "You Can Have Her" (Bill Cook) – 4:00
 * 7) "The Easy Part's Over" (Bill Rice, Jerry Foster) – 2:24
 * 8) "Black Cloud" (Bill Brock) – 2:00
 * 9) "Why Did Mrs. Murphy Leave Town" (Clement) – 2:51
 * 10) "Wolverton Mountain" (Claude King, Merle Kilgore) – 3:15
 * 11) "Ramblin' Rose" (Joe Sherman, Noel Sherman) – 2:35
 * 12) "Crazy Arms" (Charles Sales, Ralph Mooney) – 2:29

Personnel

 * Louis Armstrong – vocals
 * Jack Eubanks – guitar
 * Stu Basore – steel guitar
 * Billie Grammer – rhythm guitar
 * Larry Butler – piano
 * Henry Strzelecki – double bass
 * Willie Ackerman – drums

title: Louis 'Country & Western' Armstrong


text:
Shaanxi

Etymology
From a modified form of the romanization of. The double-a spelling, used certainly to avoid homography with (, of shān rather than shǎn), is not a feature of Hanyu Pinyin and cannot be observed outside reference to Shaanxi (see also:, ). It is likely inherited from the pre-Pinyin system devised and employed by Communist linguists, which was toneless and employed "" for undesirable homographs. The pairs Shaansi and Shansi  appear (for the first time?) in the influential Sin Wenz primer 《中國話寫法拉丁化——理論·原則·方案》 (1935).

An alternative theory is that the double-a spelling is from the romanization system, where the third tone is spelled by doubling a vowel (Shaanshi  vs. Shanshi ), but this is less likely considering the history of  and, including the political and ideological rivalry between the two systems.

Translations

 * Arabic: شَانْشِي
 * Armenian: Շենսի
 * Chinese:
 * Cantonese: 陝西
 * Hokkien: 陝西
 * Mandarin:
 * Czech: Šen-si
 * Georgian: შენსი
 * Greek: Σαανσί
 * Hungarian:
 * Japanese: 陝西
 * Korean: ^산시, 섬서
 * Latin: Xensi
 * Latvian: Šaaņsji
 * Lithuanian: Šaansi, Šensi
 * Macedonian: Шенсји
 * Manchu: ᡧᠠᠨᠰᡳ
 * Mongolian:
 * Mongolian script: ᠱᠠᠨᠰᠢ
 * Cyrillic: Шаньши
 * Russian:
 * Vietnamese:
 * Zhuang: Sanjsih

title: Shaanxi


text:
Ada Programming/Control

condition statement; other statement; ;

condition statement; condition other statement; condition other statement; ...    another statement; ;

;  ; ...  Degrees   Float  -273.15 .. Float'Last; ... Temperature : Degrees; ... Temperature >= 40.0 Put_Line ("Wow!"); Put_Line ("It's extremely hot"); Temperature >= 30.0 Put_Line ("It's hot"); Temperature >= 20.0 Put_Line ("It's warm"); Temperature >= 10.0 Put_Line ("It's cool"); Temperature >= 0.0 Put_Line ("It's cold"); Put_Line ("It's freezing"); ;

In Ada, conditional statements with more than one conditional do not use short-circuit evaluation by default. In order to mimic C/C++'s short-circuit evaluation, use  or   between the conditions.

X     1 Walk_The_Dog; 5       Launch_Nuke; 8 | 10       Sell_All_Stock; Self_Destruct; ;

The subtype of X must be a discrete type, i.e. an enumeration or integer type.

In Ada, one advantage of the case statement is that the compiler will check the coverage of the choices, that is, all the values of the subtype of variable X must be present or a default branch  must specify what to do in the remaining cases.

For procedures:

;

For functions:

Value;

Label; Dont_Do_Something; Label ...

Use_Return Do_Something; Test ;    ;    Do_Something_Else; ; Use_Return;

Use_Goto Do_Something Test Exit_Use_Goto Do_Something_Else Exit_Use_Goto Use_Goto

Use_If Do_Something; Test Do_Something_Else; ;   ;  Use_If;

Endless_Loop : Do_Something; Endless_Loop;

The loop name (in this case, "Endless_Loop") is an optional feature of Ada. Naming loops is nice for readability but not strictly needed. Loop names are useful though if the program should jump out of an inner loop, see below.

While_Loop : X <= 5 X := Calculate_Something; While_Loop;

Until_Loop : X := Calculate_Something; Until_Loop X > 5; Until_Loop;

Exit_Loop : X := Calculate_Something; Exit_Loop X > 5; Do_Something (X); Exit_Loop;

In Ada the exit condition can be combined with any other loop statement as well. You can also have more than one exit statement. You can also exit a named outer loop if you have several loops inside each other.

For_Loop : I Integer  1 .. 10       Do_Something (I) For_Loop;

You don't have to declare both subtype and range as seen in the example. If you leave out the subtype then the compiler will determine it by context; if you leave out the range then the loop will iterate over every value of the subtype given.

As always with Ada: when "determine by context" gives two or more possible options then an error will be displayed and then you have to name the type to be used. Ada will only do "guess-works" when it is safe to do so.

The loop counter I is a constant implicitly declared and ceases to exist after the body of the loop.

Array_Loop : I X'        X (I) := Get_Next_Element; Array_Loop;

With X being an array. Note: This syntax is mostly used on arrays — hence the name — but will also work with other types when a full iteration is needed.

Working example
The following example shows how to iterate over every element of an integer type.

; Range_1 Range_Type  -5 .. 10;    T_IO  ; I_IO    (Range_Type); A Range_Type I_IO.Put (Item => A,                 Width => 3,                 Base  => 10); A < Range_Type'Last T_IO.Put (","); T_IO.New_Line; ;    ;  Range_1;

Wikibook

 * Ada Programming

Ada Reference Manual

|Control Programación en Ada/Sentencias y estructuras de control

title: Ada Programming/Control


text:
Talk:Long Man of Wilmington

Questions
Anyone care to explain what the "Long Man Morris" is, who Damh the Bard is, or who the Anderida Gorseed are? Is this about a chalk man or about hippie frippery?--TurabianNights 19:05, 11 August 2006 (UTC)

 * The Anderida Gorsedd (note spelling) are apparently a NeoPagan Druid organisation. Long Man Morris is a Morris dance team, and for your passing information, Morris dancing is older than a fair few nations, so it can hardly be called "hippie frippery."  One assumes that Damh the Bard is a member of the Gorsedd, although I'm sure the time spent writing snarky "questions" here would produce more detailed information through a Google search.
 * It's entirely appropriate to make reference to current uses of the chalk figure, as long as that section does not overwhelm the article, which it appears to be in no danger of doing.
 * * Septegram * Talk * Contributions * 21:59, 2 July 2007 (UTC)
 * On the other hand, the The Seer of Wilmington link is utter rubbish.--QuestingVole 13:17, 3 July 2007 (UTC)

Asatru
This 'Chalk Man' is of great importance to the Asatru religion. Many believe it is a chalk-figure of Odin.

That has only come to my attention due to a recent outrage which is occurring in the Asatru community. A television programme are considering turning this "man" into a "woman", as a stunt.

Cheers. Unconscious  (talk)  21:08, 1 July 2007 (UTC)

Trinny and Susannah
It looks like the modern users section gives undue attention to this item, uses POV wording (i.e. "stunt") and is inaccurate (as in it was broadcast - just now). Thanks/wangi (talk) 20:57, 20 November 2007 (UTC)

Chalk man?
Is this really a chalk man? No mention is made in the article of the fact that the outline is made up of concrete blocks. (http://www2.prestel.co.uk/aspen/sussex/wilmington.html). I can verify this as I was there this weekend. --Gordon (talk) 21:02, 25 March 2008 (UTC)

"Dr. J.S. Phene who discovered the Long Man in the 1870s and who initiated the marking out of the giant's outline in yellowish white bricks at the expense of the Duke of Devonshire, and under the direction of the Reverend de St Croix, found he could only do so by overcoming with difficulty his repugnance at inspecting that figure." — Preceding unsigned comment added by AaronCarson (talk • contribs) 10:30, 30 November 2012 (UTC)
 * Not according to Philip Carr-Com's The Druid Way. He says it was an impression in the earth, which was later outlined. AaronCarson (talk) 08:29, 30 November 2012 (UTC)

Am I the only person
that thinks it looks a heck of a lot like Samson? —Preceding unsigned comment added by <IP_ADDRESS> (talk) 00:28, 22 July 2008 (UTC)

Council of British Druid Orders
Is this part of the British Druid Order or are they merely similarly named? Autarch (talk) 18:14, 20 November 2008 (UTC)

Age
Article mentions archaeological work supporting a relative late date for the Long Man. This allegation is unsourced. —Preceding unsigned comment added by <IP_ADDRESS> (talk) 06:47, 4 February 2009 (UTC)
 * Allegation?? A source has been added ++ MortimerCat (talk) 10:43, 8 February 2009 (UTC)

Firle Giant and Windover Giant
No mention has been made of the legend of the two giants who were friends, and got into a rock throwing contest, which resulted in the Windover Giant of Wilmington being killed by a rock to the head by the Firle Giant. The legend says that the outline is a restored representation of the impression his body made when it fell. — Preceding unsigned comment added by AaronCarson (talk • contribs) 08:23, 30 November 2012 (UTC)

Very disappointing
I was expecting to see something 'long' innit. — Preceding unsigned comment added by <IP_ADDRESS> (talk) 09:03, 29 March 2015 (UTC)

removed text relating to ref 6 as it is a blank page.
This archaeological paper (ref 6) has been removed from the internet. I removed the accompanying text as it no longer has a source. — Preceding unsigned comment added by 2A00:23C6:3087:9F01:48E7:A562:8360:22E2 (talk) 21:04, 9 May 2020 (UTC)

Vandalism
I propose that a new section entitled Vandalism be added to the article. It could also be labelled Defacement. What do others say? — Preceding unsigned comment added by <IP_ADDRESS> (talk) 03:26, 30 January 2021 (UTC)

 * Personally I think none of these incidents should be listed at all. It's a 400 year old archaeological site; fleeting, barely newsworthy incidents of vandalism are not really encyclopaedic.Svejk74 (talk) 17:51, 30 January 2021 (UTC)

title: Talk:Long Man of Wilmington


text:
Semyonovka, Kulundinsky District, Altai Krai

Semyonovka (Семёновка) is a rural locality (a selo) and the administrative center of Semyonovsky Selsoviet, Kulundinsky District, Altai Krai, Russia. The population was 404 as of 2013. There are 4 streets.

Geography
Semyonovka is located 37 km east of Kulunda (the district's administrative centre) by road. Ozyornoye is the nearest rural locality.


text:
Learning and neural networks

Single Layer Perceptrons
A Perceptron is a type of Feedforward neural network which is commonly used in Artificial Intelligence for a wide range of classification and prediction problems. Here, however, we will look only at how to use them to solve classification problems. Consider the problem below. Suppose you wanted to predict what someone's profession is based on how much they like Star Trek and how good they are at math. You gather several people into a room and you measure how much they like Star Trek and give them a math test to see how good they are at math. You then ask what they do for a living. After that you create a plot placing each person on in based upon their Star Trek and Math scores.

To summarize
The neural network starts out kind of dumb, but we can tell how wrong it is and based on how far off its answers are, we adjust the weights a little to make it more correct the next time. We do this over and over until its answers are good enough for us. It is important to note that we control the rate of learning, in this case via a constant learning rate $$\eta $$. This is because if we learn too quickly we can overshoot the answer we want to get. If we learn too slow, then the drawback is that it takes longer to train the neural network.

 * Note: The difference between $$t_k$$ and $$y_k$$ is that $$t_k$$ is what you want the network to produce while $$y_k$$ is what it actually outputs. If the network is well trained $$y_k \approx t_k$$

Steps in training and running a Perceptron:
These steps can also be applied to the multi layer Perceptron.
 * 1) Get samples of training and testing sets. These should include
 * 2) What the inputs $$x_i$$ (observations) are
 * 3) Inputs and outputs generally should be normalized so that the largest number is 1 and the smallest is either -1 or 0. This can be done with the basic formula [[Image:Basic_Normalization_Formula.gif]] Here normalizeConst would be 2 and offsetConst would be 1 is we normalized from -1 to 1 so we would have: $$ x_i ^\prime  = \frac  \cdot 2 - 1 $$
 * 4) What outputs $$t_k$$ (decisions) you expect it to make
 * 5) Set up the network
 * 6) Created input and output nodes
 * 7) Create weighted edges $$w_{ki}$$ between each node. We usually set initial weights randomly from 0 to 1 or -1 to 1.
 * 8) Run the training set over and over again and adjust the weights a little bit each time.
 * 9) When the error converges, run the testing set to make sure that the neural network generalizes a good answer.

Multi Layer Perceptrons

 * Note: The sigmoid activation function at the output is optional. Only the activation function following $$w_{ij}$$ must be used. The reason for using a sigmoid at the output $$y_k$$ is to force the output values to normalize between 0 and 1. It should be noted that other output functions can be used such as stepper functions and soft-max functions at the final output layer. For more on transfer functions see: Transfer Function

Training and Back Propagation
The standard way to train a multi layer perceptron is using a method called back propagation. This is used to solve a basic problem called assignment of credit, which comes up when we try to figure out how to adjust the weights of edges coming from the input layer. Recall that in the single layer perceptron, we could easily know which weights were producing the error because we could directly observe the weights and output from those weighted edges. However, we have a new layer that will pass through another layer of weights. As such, the contribution of the new weights to the error is obscured by the fact that the data will pass through a second set of weights or values.

To give a better idea about this problem and its solution, consider this toy problem:
A Mad scientist wants to make billions of dollars by controlling the stock market. He will do this by controlling the stock purchases of several wealthy people. The scientist controls information that can be given by wall street insiders and has a device to control how much different people can trust each other. Using his ability to input insider information and control trust between people, he will control the purchases by wealthy individuals. If purchases can be made that are ideal to the mad scientist, he can gain capital by controlling the market.

As a mad scientist, you will need to adjust this social network in order to create optimal actions in the market place. You do this using your secret Trust 'o' Vac 2000. With it you can increase or decrease each trust weight how you see fit. You then observe the trades that are made by the rich dudes. If the trades are not to your liking, then we consider this error. The more to your liking the trades are, the less error they contain. Ideally, you want to slowly adjust the network so that it gets closer and closer to what you want and contains less error. In general terms this is referred to as gradient descent.

There are many ways in which we can adjust the trust weights, but we will use a very simple method here. Each time we place some insider information, we watch the trades that come from our rich dudes. If there is a large error coming from one rich dude, then they are getting bad information from someone they trust too much or are not getting good information from someone they should trust more. When the mad scientist sees this, he uses the Trust 'o' Vac 2000 to weaken a strong trust by a little and strengthen a weak trust by a little. Thus, we try to slowly cut off the source of bad information and increase the source of good information going to the rich dudes.

We can take the ideas above and make them more mathematically formal
One should notice that while the feedforward network uses sigmoid activation functions for the non-linearity, when we propagate the error backwards, we use the derivative of the activation function. This way we adjust the weights at a rate that reflects the curvature of the sigmoid. In the center of the sigmoid, more information is passed through the layer. As a result, we can assign more credit reliably from values that pass through the center. First recall the activation function used for each neuron: $$ g\left( a \right) \equiv \frac{1}

$$ which has the very nice property that the derivative can be expressed simply as: $$ g'\left( a \right) = g\left( a \right)\left( {1 - g\left( a \right)} \right) $$ Next we need to know the error. While we can compute it in many different ways, it is most common to simply use the sum of squared error function: $$ E^n = \frac{1} {2}\sum\limits_{k = 1}^c {\left( {y_k - t_k } \right)^2 } $$ Where $$y_k$$ is the output we got, while $$t_k$$ is what we wanted to get. Thus, we compute how different the network output was from what we wanted it to be. Additionally, in this example, we use a simple update based on the general error. This leads to a straight forward computation for $$\delta _k$$ which is simply: $$ \delta _k = g'\left( {a_k } \right)\left( {y_k  - t_k } \right) $$ where: $$ a_k = \sum\limits_{j = 0}^M {w_{kj}^{\left( 2 \right)} g\left( {\sum\limits_{i = 0}^d {w_{ij}^{\left( 1 \right)} x_i } } \right)} $$ If we decided to omit the sigmoid activation on the output layer it's even simpler as: $$ \delta _k = \left(y_k  - t_k \right) $$ In its general form, the adjustment of weights can be described as: $$ \Delta {\mathbf{w}}^{\left( \tau \right)}  =  - \eta \nabla E\left| {_{{\mathbf{w}}^{\left( \tau  \right)} } } \right. $$

Momentum learning
We can speed this up greatly by introducing a momentum term that toggles the learning rate to be faster by adding in some of the last steps error adjustments. $$ \Delta {\mathbf{w}}^{\left( \tau \right)}  =  - \eta \nabla E\left| {_{{\mathbf{w}}^{\left( \tau  \right)} } } \right. + \mu \Delta {\mathbf{w}}^{\left( {\tau - 1} \right)} $$ Notice that at its maximum we can see the momentum term as: $$ \Delta {\mathbf{w}} = - \eta \nabla E\left\{ {1 + \mu  + \mu ^2  + ...} \right\} $$ which leads to: $$ \Delta {\mathbf{w}} = - \frac{\eta } \nabla E $$ Here $$\mu$$ is a number from 0 to 1 that is a momentum controlling constant. This causes the learning rate $$\eta$$ to range as: $$ \eta \le learningRate \le \frac{\eta } $$ Additionally, there are many other advanced learning rules that can be used such as Conjugate Gradients and Quasi-Newtonian methods. These and other methods like them use Heuristics to speed up the learning rate, but have the downside of using more memory. Additionally, they make more assumptions about the topology of your sample space, which can be a drawback if your space has an odd shape.

From this example observe that we can keep adding more and more layers. We need not stop with only two layers but we can add three, four or however many we want. $$ y_k = g''\left( {\sum\limits_{k = 0}^N {w_{lk}^{(3)} } g'\left( {\sum\limits_{j = 0}^M {w_{kj}^{(2)} } g\left( {\sum\limits_{i = 0}^d {w_{ji}^{(1)} } x_i } \right)} \right)} \right) $$ In general, two layers is usually sufficient. Adding extra layers is only helpful if the topology of our sample space becomes more complex. Adding extra layers allows us to fold space more times.

Another way of looking at this
One can also look at a feedforward neural network trained with back propagation as a Simulink circuit diagram.

The Well Behaved Robot
This project has been used at the University of Southern California for teaching core concepts on Back Propagation Neural Network Training.

Your great uncle Otto recently passed away leaving you his mansion in Transylvania. When you go to move in, the locals warn you about the Werewolves and Vampires that lurk in the area. They also mention that both vampires and werewolves like to play pool, which is alarming to you since your new mansion has a billiard room. Being a savvy computer scientist you come up with a creative solution. You will buy a robot from Acme Robotics (of Walla Walla Washington). You’re going to use the robot to guard your billiard room and make sure nothing super natural finds its way there.

To train your robot you need to select a set of features which the robot can detect and which also can be used to tell the difference between humans, vampires and werewolves. Further, after having your nephew Scotty ruin one of your priceless antique hair dryers, which you keep in the billiard room you decide that the robot should also detect children entering the room. After reading up on the nature of the undead and after taking careful measurement, you realize that the two best features for detection are how tall a person is who is entering the room is and how hairy they are. This works because vampires are tall and completely bald, werewolves are either short and totally covered in fur, or they are the mutant type that are extremely tall, but no more hairy than a human. An adult human is taller than a child and slightly hairier. The chart below shows samples that you took to validate your hypothesis. The next thing your robot will need to do in addition to detecting what creatures enter your billiard room is take an action that is appropriate for the situation. Since you want your robot to be polite, it will greet every human that enters the room. Additionally, if a child enters the room, when it greets the child it will scream so that you know to look in your closed circuit television and see what is happening in the room. When the robot detects a vampire, it will scream and impale it with a stake. Since robots are no match for werewolves, if the robot detects a werewolf, it will scream and then run away. Thus, your robot can take any of four actions, it can impale something entering the room, it can scream, it can run away and it can greet people. Any of these action can be performed following the detection of anything entering the room. Your job is to train the robot so that it performs the correct actions whenever it detects something entering the room.

Part 1
Your first task is to train your robot. Take the training data marked train1.dat and plug it into bpt1.nsls located in 2layer. Compile the model and run it. After you train the model, test it with bpr.nsls. The output from testing can then be found in out.bin.dat or out.dec.dat. These are tab-delimited files with the test results. You will want to take this data and make a scatter plot which shows a map of how the robot will react when it observes different heights and different amounts of hairiness.

The way to interpret the output is as follows, there are four actions the robot can take, if the robot will take that action, the output is a 1, if the robot will not take that action, the output is a 0. The four actions in order are Impale, Scream, Run Away and Greet. Thus, if the output is 0,1,0,1 then that means the robot will scream and greet.

 * 1) Take and plot the actions the robot takes over the space of possible inputs. Out.bin.dat and out.dec.dat contain the same information. However, out.bin.dat contains the binary coarse code for the output while, out.dec.dat contains the decimal equivalent. You can use either for creating the plot. The decimal version may be easier to use. It’s up to you. For the plot, make the x-axis the height of the visitor and the y-axis the amount of hair measured. Each point on the plot should show the robots action for that input. Note: you may create the plot with any method you choose, just so it is neat and clear.
 * 2) Compare the plot of the robot’s test actions against the training data. Does the network do a good job of generalizing over the training data? Why or why not?
 * 3) Does the robot always behave as programmed or does it commit actions that do not fit the patterns for people, children, werewolves or vampires? Explain.
 * 4) Notice that it reacts to things entering the room as if they were vampires in two regions of space not visibly connected to the vampire training data. Why is that?

Part 2
Being an inquisitive lad or lass you decide you would like to find out how your robot would perform if you added a third layer to your back prop. Recall the equations from the NSL back prop lecture. Derive equations for a 3 layer back prop. This can be done by extending a two layer perceptron to three layers the same way a one-layer perceptron is extended to two layers. The figure below shows the schematic of the three-layer perceptron. Define: $$D_{wij}$$, $$D_{wjk}$$, $$D_{wkl}$$, $$d_j$$, $$d_k$$, $$d_l$$ and $$y_l$$ using the same notation from the NSL slides.
 * 1) Using figure 2 as a guide and your results from 3.a, extend the 2 layer back prop model to a three layer back prop model. Do this on the model in the folder 3layer. Some parts have been filled in already to help guide the process. When you are finished, run the model on the same testing and training data as question 2. Create a scatter plot in the same manner and compare the two.
 * 2) How good a job does the three layer network do on generalizing on the problem?
 * 3) How does it compare to the results from the two layer network?
 * 4) Does it do a better job? Why or why not?
 * 5) As it turns out the evil Dr. Moriarty has created vampires that are similar in height and hairiness as adult humans. You have discovered his fiendish plan and must now train a new network. The figure below shows a scatter plot of the new training data. How fortunate for you that almost no one in Transylvania is the same height and hairiness as the mutant vampires, but which neural network should you use? Train both the two layer network and the three layer network on the new data. Create scatter plots for both results in the same manner as before.
 * 6) How well do the two networks perform on the new data?
 * 7) Which of the two networks performs better on generalization?
 * 8) Specifically, why does the one that performs better do so?
 * 9) Having analyzed the outcome of two networks on two different sets of data list several pro’s and con’s to using either network and explain with each one why it is the case that it is either a pro or a con.

Part 3
The Royal Society of Devious Werewolves has figured what method you use to train your robot. So before coming over to play pool, they all put on disguises. However, not being as bright as they think they are, they all wear the same disguise. Your faithful servant Igor having infiltrated the Royal Society can phone ahead to tell you what the features the werewolves disguises have so you can retrain your robot before they come over. The only problem is that Werewolves drive Italian sports cars, and since they are not known to drive with caution, time is of the essence in training. You decide to augment the training error in your network to use momentum.
 * 1) Plug the extra momentum term into the training error. Train the two layer network on the first data set WolfData1.txt both with and without the momentum term. Give a print out of the networks error.
 * 2) Does the network train faster with the new momentum term? If so, what is your intuition as to why this is or is not the case?[[Image:Learning_and_Neural_Networks_Material_Chart3.png|center]]

Project Materials and Data

 * 1) Full Werewolf Data Files
 * 2) Augmented Back Propagation Model
 * 3) Neural Simulation Language Package

Additional Links

 * 1) Other Projects in Artificial Intelligence at Cool-ai.org
 * 2) The NSL (Neural Simulation Language) Home Page
 * 3) Old but Relevant CSCI564 Course Web Page - This is the course in which this project was first used

Mundhenk 07:21, 1 February 2007 (UTC)

title: Learning and neural networks


text:
Wikipedia:WikiProject Articles for creation/Help desk/Archives/2019 September 18

= September 18 =

03:29:12, 18 September 2019 review of submission by Lifelonglearning1
{{Lafc|username=Lifelonglearning1|ts=03:29:12, 18 September 2019|page= — Preceding unsigned comment added by Lifelonglearning1 (talk • contribs)

Request on 04:42:45, 18 September 2019 for assistance on AfC submission by Ada Wan
Hi Wiki, I do not understand why this article is being rejected because it is not significant enough. As I see Wikipedia is a platform to share knowledge and information and there always will be some topics or articles that are not interesting or significant for others. Please assist me. Thank you.

Ada Wan (talk) 04:42, 18 September 2019 (UTC)
 * pending paid editing disclosure, see User talk:Ada Wan. --Worldbruce (talk) 13:11, 19 September 2019 (UTC)

05:52:13, 18 September 2019 review of submission by Ka1591915
I would like to request assistance with this page because the topic covers a prominent cultural practitioner of the Hawaiian community who deserves to have his story told. Could I please receive some additional information as to why this was rejected? Ka1591915 (talk) 05:52, 18 September 2019 (UTC)

 * - it was rejected because the sources weren't suitable. To prove notability you need sources that are: in-depth, reliable, independent (which also rules out interviews) and secondary (newspapers, books etc). The Genealogy documents, the census and kaananiau's site are all primary, and also aren't in-depth (on Nunes himself) or fail independent (in the case of the site). The interview is also not independent because most of the content would come from a non-independent source. The obituary causes warnings to crop up all over my laptop so I've not seen that, but even as a good source, it wouldn't be enough on its own. Have a look at WP:GNG for a good summary of what you need. Nosebagbear (talk) 16:06, 18 September 2019 (UTC)

06:12:57, 18 September 2019 review of draft by MaroonFrogbh
The following article is an introduction to readers to know about Al Salam Bank in Bahrain. and all the information in the article are informative and does not advertise anything related to Al Salam Bank. Could you kindly advice me on how can I improve the article pleas. Thank you! MaroonFrogbh (talk) 06:12, 18 September 2019 (UTC)

 * Greetings. May I know what is your connection with the bank?  CASSIOPEIA(talk) 14:07, 18 September 2019 (UTC)

This is Anwaar from www.maroonfrog.com. We are a Marketing Agency based in Bahrain. Our client Alsalam Bank Bahrain has asked us to create online content on Wikipedia & the top online directories and other websites. This is the first time we create a Wikipedia page and we are not sure how we can do it right to get accepted. — Preceding unsigned comment added by MaroonFrogbh (talk • contribs) 05:48, 19 September 2019 (UTC)

 * Post the mandatory disclosure to your user page at User:MaroonFrogbh. The template Paid can be used for this purpose – e.g. in the form: . --Worldbruce (talk) 13:22, 19 September 2019 (UTC)

06:31:34, 18 September 2019 review of submission by Chirag-Behre
Hello,

Thank you for your feedback. We have added a few reliable links for the content as reference.

Regards, Chirag-Behre (talk) 06:31, 18 September 2019 (UTC)

13:38:18, 18 September 2019 review of submission by Briannaburns123
Here is the code I submitted that was denied, can anyone give me any advice?

[copy of draft removed, the link above is sufficient --Worldbruce (talk) 14:21, 18 September 2019 (UTC)]

Briannaburns123 (talk) 13:38, 18 September 2019 (UTC)
 * Please read the declination reason at the top of your draft, as it contains helpful links for you to improve your draft.  JTP (talk • contribs) 18:21, 18 September 2019 (UTC)

19:12:11, 18 September 2019 review of submission by Shaikh7977741665

 * - Wikipedia isn't a "how-to" guide (WikiHow might work), but also the tone isn't correct - we don't use "We" or "our". There's also a concern that this would be a US-centric article: documents would range heavily region to region. Finally the article doesn't have any references. Nosebagbear (talk) 19:55, 18 September 2019 (UTC)
 * and I don't think anyone will accept Copyright violations. 09:08, 19 September 2019 RHaworth talk contribs deleted page User:Shaikh7977741665/sandbox (G12: Unambiguous copyright infringement of https://www.compareclosing.com/blog/documents-for-refinance/ ) (thank) Victor Schmidt mobil (talk) 09:40, 19 September 2019 (UTC)
 * Indeed! Nosebagbear (talk)

19:12:11, 18 September 2019 review of draft by Shaikh7977741665
Shaikh7977741665 (talk) 19:12, 18 September 2019 (UTC)

Please see the above Nosebagbear (talk)

20:43:01, 18 September 2019 review of submission by Shaikh7977741665
Shaikh7977741665 (talk) 20:43, 18 September 2019 (UTC)

23:19:38, 18 September 2019 review of draft by SamanGorilla
I think this article is being denied unfairly and the reason for denial is totally personal. I need a second eye for it.

SamanGorilla (talk) 23:19, 18 September 2019 (UTC)
 * Hi . Most companies, including Elago, are not notable (not suitable for inclusion in Wikipedia). You may find WP:BFAQ informative. --Worldbruce (talk) 00:32, 19 September 2019 (UTC)

Briannaburns123 (talk) 00:25, 19 September 2019 (UTC)

00:35:20, 19 September 2019 review of submission by Briannaburns123
I don't understand the "declination reason" for my article submission denial, can someone actually give me some help in the help desk? Help that I can actually understand so that I can correct it? Can anyone help me? Briannaburns123 (talk) 00:35, 19 September 2019 (UTC)

 * - of course. Inline citations are the little blue numbers that appear at the end of sentences in many articles (e.g. Fairness Project). In most articles, they are only needed for potentially controversial or disputable statements or quotes. However, for biographies of living persons, stricter rules apply. Any potentially contentious material, at all, needs to have an inline citation.

 * Conveniently, you've already written your sources in a suitable format. I've cut the first one from the bottom and used it as an inline ref.

 * It's worth knowing you can name references. For example, I've named the example inline reference so it reads  at the start of the citation. If you want to use that reference again, elsewhere in the article, you just need to write instead of writing out the whole citation again. Nosebagbear (talk) 08:49, 19 September 2019 (UTC)


text:
User:Ultravioletray

Born in Boonton Township, New Jersey. Have lived in Durham, North Carolina, Chapel Hill, North Carolina, and Brooklyn, New York. Currently residing in Hoboken, New Jersey. I'm a musician, fabricator by trade.

Articles created:
Music:
 * Cor-Crane Secret - Polvo
 * Today's Active Lifestyles - Polvo
 * Vee Vee - Archers of Loaf

Articles edited:
Music: Albums
 * Exploded Drawing - Polvo
 * Icky Mettle - Archers of Loaf
 * White Trash Heroes - Archers of Loaf

Music: Bands
 * Archers of Loaf
 * Polvo
 * Versus

WikiProjects:

 * WikiProject Albums

title: User:Ultravioletray


text:
A Waltz by Strauss

A Waltz by Strauss may refer to:
 * A Waltz by Strauss (1931 film), a German historical musical film
 * A Waltz by Strauss (1925 film), an Austrian silent film

title: A Waltz by Strauss


text:
Talk:Introduction to Philosophy/Logic

Well, I've got as far as a table of contents. I welcome constructive comments. I might copy some of the wikiversity stuff I've written across to here, as I think this is where a lot of it really belongs. --publunch 12:40, 22 Oct 2004 (UTC)

Well, I'm busy working on this. But I need your help. I feel like there is some kind of 'mathematical creep' going on. Now this might be something to do with the nature of logic as a tradition - a lot of logicians were also mathematicians, predicate calculus has its roots in mathematical analysis, etc. Trouble is I've been steeped in mathematics and am part of this tradition myself. I don't want to expunge the maths, but I don't want the book to become too mathematical, which it could do if I'm the sole author. Logic should be able to cope with the real world, not just some platonic heaven.

It would be nice to have some logic gurus here. But failing that, I'll try to be the guru for any student who is moderately interested in being guinea pig for this text as it develops. --publunch 16:35, 27 Oct 2004 (UTC)

Under construction, Update
I (User:JMRyan) have decided that it is best to move (most of) the newer pages (see Introduction to Philosophy/Logic/Some Properties of the Logical Connectives above) to a new book, Formal Logic. Introduction to Philosophy appears to be a general survey book which looks broadly at a wide variety of philosophical areas, but does not cover any one of them in much detail. The newer pages are a more detailed presentation of standard formal logic. I will also try to patch up the older pages to fit in with the apparent goal of Introduction to Philosophy. (October 13, 2005)

link back
publunch, good work. I think it would be good to have links from the subpages back to the main page. See the example I made on the modes page. What do you think? I was also wondering what the reasoning was behind calling the page Modes vs Introduction_to_Philosophy:Logic:Modes or Introduction_to_Philosophy:Modes? Does Modes ever have the potential of being a book of its own? It is possible I am seeing all these pages in a bit too linear of form though. liblamb 19:32, 29 Oct 2004 (UTC)

 * Thanks, liblamb. It is nice to know that someone is reading this stuff - I sometimes get the feeling that I am talking to myself when I am writing and that makes me feel lonely and depressed and makes me wonder what the point of writing this is.  Well, there is a lot of bad reasoning in the world, and a bit of teaching about logic might just help.  It could stop wars!

 * Perhaps there is a problem with the page called 'modes'. I needed to introduce modus ponens and modus tollens there, as they are pretty basic and I don't think the propositional calculus, which I am working on at the moment would make any sense without me talking a little bit about introducing MP and MT there.  Somehow some rather important stuff about logical fallacies has crept in at the bottom of the modes page.

--<IP_ADDRESS> 12:13, 4 Nov 2004 (UTC)

 * Well, I might get round to putting some links back in my pages, or you can put the links in for me. There is so much to do, so a bit of help is appreciated.  --publunch 11:06, 17 Nov 2004 (UTC)

 * Well, I'm note sure where this goes so feel free to move or delete it, but what I am trying to understand is another paradox and its relation to logic.

When a person is inebriated they often report bothing being and not-being themselves.

Or there are some logical arguments that have all sound premises that are true for the people who believe them. While there are opposite logical arguements leading to the opposite conclusions, but consisting of sound premises from the point of view of the people who believe them.

All x is y, a is x. .: a is y

But other people will believe that All x is ~y, a is x. .: a is not y.

My problem is that it can be shown by both parties that 1) All x is y and 2) All x is not y is sound from their point of view. But this leads to the unallowable a is not a, a contradiction

Now, is this handled by having some sort of statement that when we see "a is not a," what we are really seeing is that B(a is y) and C(a is not y) where B and C are the people holding those conclusions. Or they hold those beliefs because they flow logically from their assumptions B(All x is y) or C(All x is not y).

I guess what I'm asking is how does point of view fit into logic, specifically related to what are taken to be sound premises.

Almost all political arguments for policy outcomes seem to fall into the above (paradox?). The other example may not, but it's the one of both being and not being yourself when you are inebriated. I guess I'm trying to see if there's a relation of logic to psychology or if logic can't apply to psychological states<EMAIL_ADDRESS>
false name space
I've been asked by someone on irc to move all the logic pages to a 'false name space'. So stuff is slowly being moved to 'introduction to logic'. This will be done, but it may take a while, 'coz I don't rush anything these days. --publunch 12:09, 17 Nov 2004 (UTC)

Notation
I have just put a couple of paragraphs into the Modal logic section and I have used LaTeX with the "math" tab to write the formulae. I think they look much better this way. Although the formulae in the previous sections look fine, I don't think they will when they get more complicated. (<IP_ADDRESS> 11:52, 26 Dec 2004 (UTC))

Casing
I have started to moving (renaming) these pages to achieve better casing consistency, especially with the parent Introduction to Philosophy book. The parent book is not completely consistent, but it mostly appears to follow book title casing with the first and all subsequent non-minor words capitalized. --JMRyan 19:42, 13 July 2005 (UTC)

E-Prime
I thought this might be the place to also mention E-Prime. It relates very much to logic. Perhaps the regular editors to this book would be interested in incorporating a chapter about it. --Loplin 05:34, 2 September 2005 (UTC)

title: Talk:Introduction to Philosophy/Logic


text:
Anne McKnight

Anne McKnight (24 July 1924 – 29 August 2012) was an operatic soprano.

Life and career
A native of Aurora, Illinois, she was a 1943 graduate of Shimer College. McKnight made her official debut in 1946, as Musetta in the NBC Symphony's Concert Version of La bohème, with Licia Albanese and Jan Peerce, conducted by Arturo Toscanini. Two years later, she sang in Beethoven's Ninth Symphony under the Maestro.

McKnight opened the 1952 Fall Season of the New York City Opera, in the title role of Tosca, followed by the name part in Aïda, both conducted by Tullio Serafin. In 1953, the soprano sang there again in Tosca (now led by Julius Rudel), Don Giovanni (as Donna Elvira, opposite Walter Cassel), Aïda again, Der Rosenkavalier (as the Marschallin), and Le nozze di Figaro (as the Contessa).

She then began a career in Italy, under the name Anna de Cavalieri, appearing at the Teatro di San Carlo (as Busoni's Turandot and Gluck's Alceste, and as Asteria in Boito's Nerone), Teatro alla Scala (Alfano's Cyrano de Bergerac, and as Elena in Mefistofele), Rome Opera, Caracalla (Loreley), Arena di Verona (Aïda), and Teatro Regio (Parma).

In 1960, the soprano returned to the City Opera, as Anne McKnight, for the "professional" American premiere of Dallapiccola's Il prigioniero, opposite Norman Treigle and Richard Cassilly, conducted by Leopold Stokowski. Later that season, she sang again the Marschallin with the company.

She continued her international career at Rio de Janeiro (Puccini's Turandot and Tosca), Piacenza, Rovigo, Brussels, Cremona (Fedora), Toulouse (Norma), and, in 1968, Padua (Tosca).

McKnight died on August 29, 2012, at the age of eighty-eight, at her home in Lugano, Switzerland.

Commercial discography

 * Puccini: La bohème (Albanese, Peerce, Valentino, Cehanovsky, Moscona; Toscanini, 1946) [live] RCA
 * Dallapiccola: Il prigioniero (Cassilly, Treigle; Stokowski, 1960) [live] Opera Depot

Commercial videography

 * Beethoven: Symphony No. 9 (Hobson, Dillon, Scott; Toscanini, 1948) [live] RCA

title: Anne McKnight


text:
Template:Research projects header/Concept

A STRONOMY P ROJECT  · L EARNING THE W IKI W AY  · B LOOM C LOCK P ROJECT  · H UMAN G ENETIC U NIQUENESS P ROJECT  · N ERD P ROJECT  · AMWADS


text:
Talk:Stewarts Lane

Has just had....
"has just had a heavy boiler and mechanical overhaul lasting just over 5½ years." - reading this article from cold, it seems to me that this could be worded in a different way to indicate when the activity took place? I don't know enough about the subject to do this myself, but perhaps "...underwent a heavy boiler and mechanical overhaul from January xxxx to July xxxx"?ColourSarge 17:22, 21 July 2007 (UTC)

Shed code
The only online source for SR shed code 'BAT' I can find is this blog, which looks quite convincing but has no indication of authorship or sources of information. Where does this info come from? -- Verbarson talkedits 10:02, 29 May 2024 (UTC)
 * The Southern Railway did not use shed codes, although some of its predecessors did. Codes such as BAT for Stewarts Lane (others include AFD = Ashford, BPL = Barnstaple, BAS = Basingstoke etc.) were devised by the RCTS for their own use, primarily in their monthly subscription-only journal Railway Observer. -- Red rose64 🌹 (talk) 18:25, 29 May 2024 (UTC)
 * Thanks. I have removed the mentions from the article. Would the info in the blog be coming from RCTS sources, do you think? -- Verbarson talkedits 18:55, 29 May 2024 (UTC)
 * It might be put together from RCTS-published material. Or it might be from personal observations. It's probable that some locospotters used the RCTS shed codes as a convenient mnemonic before the BR codes were introduced. -- Red rose64 🌹 (talk) 20:31, 29 May 2024 (UTC)

title: Talk:Stewarts Lane


text:
詳細

Adjective

 * 1) detailed; minute

Adverb

 * 1) in detail

Adjective

 * 1) detailed

Noun

 * 1) details

title: 詳細


text:
Tone-Lise Skagefoss

Tone-Lise Skagefoss (born 10 May 1974 in Nesbru) is a Norwegian radio and television presenter and head of music for Radio Norge.

Career
She began her career as presenter and head of music at Radio Oslofjord. Later, she worked for Ole Evenrud at the record company Polygram. She was also a music journalist at NRK P3 and was a presenter on Poprush, Hammock and Platina. She also presented the music programme Svisj-show on NRK 2 for two years. In 1997, she was one of the three members of the Norwegian team that took second place on the Nordic pop quiz show Pick-Up.

Skagefoss was a member of the jury on the third and fourth season (2005–2006) of Idol on TV 2. She presented the programme Absolutt Underholdning on TV 2, while also working for Radio Norge.

She has also taken part in Zebra Grand Prix.

title: Tone-Lise Skagefoss


text:
Palais Miller von Aichholz

Palais Miller von Aichholz was a city-palace (Palais) in Vienna, Austria. It was constructed for the noble Miller von Aichholz family and later bought by the Jewish aristocrat Camillo Castiglioni. Therefore, the building was later known as Palais Castiglioni.

The owner was forced to flee after the Anschluss of Austria to Nazi Germany in 1938 and became property of the city of Vienna. It was subsequently demolished in 1961.

title: Palais Miller von Aichholz