text:
Talk:Autocracy

Wiki Education Foundation-supported course assignment
This article is or was the subject of a Wiki Education Foundation-supported course assignment. Further details are available on the course page. Peer reviewers: Divya Bhatnagar.

Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 17:43, 17 January 2022 (UTC)

Wiki Education Foundation-supported course assignment
This article is or was the subject of a Wiki Education Foundation-supported course assignment. Further details are available on the course page. Student editor(s): Mmcnichol. Peer reviewers: MoeKasawaki.

Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 15:03, 16 January 2022 (UTC)

See also is for more than just things in the same category
Thebiguglyalien reverted my addition of Patriarchy to the See also list, commenting that patriarchy is not a form of government. I'm not going to fight this right now, but wanted to at least go on the record that this is a made-up limit on the See also section, which can include any page which is relevant enough. (And of course patriarchy is highly relevant to autocracy.) John_Abbe (talk) 17:05, 21 June 2024 (UTC)

 * There are thousands of things relevant to autocracy, and I'd hardly consider patriarchy to be in the top one hundred, let alone prominent enough to be in the article's "see also" section. The section should be reserved for the most pertinent links. The big ugly alien  ( talk ) 17:14, 21 June 2024 (UTC)

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

title: Talk:Autocracy


text: Category:93 deaths

title: Category:93 deaths


text: Category:40 births

title: Category:40 births


text:
SAP NetWeaver Business Warehouse

SAP Business Warehouse (SAP BW) is SAP’s Enterprise Data Warehouse product. It can transform and consolidate business information from virtually any source system. It ran on industry standard RDBMS until version 7.3 at which point it began to transition onto SAP's HANA in-memory DBMS, particularly with the release of version 7.4.

Latterly, it evolved into a product called BW/4HANA so as to align with SAP's sister ERP Product called S/4HANA. This strategy allowed SAP to engineer the database to use the HANA in-Memory database. Consequently, this facilitates the push down of complex OLAP based functions to the database as opposed to NetWeaver ABAP Application Server to improve performance. The product is also more open and can incorporate SAP and Non-SAP data more easily.

History
In 1998 SAP released the first version of SAP BW, providing a model-driven approach to EDW that made data warehousing easier and more efficient, particularly for SAP R/3 data. Since then, SAP BW has evolved to become a key component for thousands of companies. An article, provided the history of SAP BW from inception to the newer releases powered by SAP HANA.

title: SAP NetWeaver Business Warehouse


text:
User:Wyatts

Goodbye, Wikipedia!

In case anybody wonders, I wanted to leave a note explaining why I left Wikipedia. First, I want to make clear that I didn't get mad or feel mistreated in any way. To the contrary, my experience with other editors has always been positive. I think Wikipedia is a great idea, and I tried to make some positive contributions with a few articles. Wikipedia has already achieved critical mass, and I this its success is assured. Although the Wikipedia community is great, I am the type of person who needs more structure in my activities. The total freedom to edit is a Wikipedia strength, but is not for me personnally.

I wish Wikipedia every success and look forward to seeing the one million article milestone soon.

--Wyatts 18:00, 23 August 2005 (UTC)

Note: Some articles to which I contributed have been significantly edited from my version and no longer reflect the quality of my efforts.

Selected contributions
I don't list everything here, just some pages that I like to check on frequently.

Note: Some articles have been significantly edited from my version and no longer reflect the quality of my efforts.

Some New Articles
 * Failure rate
 * Anderson Hills Tornado
 * Severe weather terminology (United States)
 * Slackwater Darter
 * National Highway System

Some Article Stubs
 * Electric catfish
 * Electron Optics
 * Electroceramics
 * Uintatherium
 * Strategic Highway Network

Some Articles Significantly Updated
 * Base realignment and closure
 * Mean time between failures

Maintenance projects I try to help with on occassion

 * WikiProject Missing encyclopedic articles - mostly the missing Britannica articles. I occassionally find a missing article that can be researched with a reasonable amount of effort.
 * Template:Open task

References in Wikipedia

 * Public domain resources
 * Forum_for_Encyclopedic_Standards
 * tutorial
 * How to edit a page
 * Help:Formula
 * Picture tutorial
 * List of images
 * How to write a great article
 * Naming conventions
 * Manual of Style
 * User_page
 * Verifiability
 * 2004 Encyclopedia topics

General comments
I am becoming increasingly concerned about the excessive control over certain articles/pages/processes by some users. I am also concerned about the failure to effectively control disruptive behavior.

title: User:Wyatts


text: User talk:82.45.253.141

title: User talk:82.45.253.141


text: User talk:204.185.108.245

title: User talk:204.185.108.245


text: Category:100 deaths

title: Category:100 deaths


text: Category:27 births

title: Category:27 births


text:
Prepaid mobile phone

A prepaid mobile device, also known as a pay-as-you-go (PAYG), pay-as-you-talk, pay and go, go-phone, prepay, or burner phone, is a mobile device such as a phone for which credit is purchased in advance of service use. The purchased credit is used to pay for telecommunications services at the point the service is accessed or consumed. If there is no credit, then access is denied by the cellular network or Intelligent Network. Users can top up their credit at any time using a variety of payment mechanisms. ("Pay-as-you-go", "PAYG", and similar terms are also used for other non-telecommunications services paid for by advance deposit.)

The alternative billing method (and what is commonly referred to as a mobile contract) is the postpaid mobile phone, where a user enters into a long-term contract (lasting 12, 18, or 24 months) or short-term contract (also commonly referred to as a rolling contract or a 30-day contract) and billing arrangement with a mobile phone operator (mobile virtual network operator or mobile network operator).

Overview
A prepaid mobile phone provides most of the services offered by a mobile phone operator. The main difference is that with prepaid phones, payment for service is made before use. As calls and texts are made, and as data is used, deductions are made against the prepaid balance amount until no funds remain (at which time services stop functioning). A user may avoid interruptions in service by making payments to increase the remaining balance.

Methods of payment:
 * Credit card, debit card, or online payment processors.
 * Direct draw from bank account using an ATM
 * Retail store purchase with a "top-up" or "refill" card at retail. These cards are stamped with a unique code (often under a scratch-off panel) which must be entered into the phone in order to add the credit onto the balance.
 * Retail store purchase using a swipe card where the balance is credited automatically to the phone after the retailer accepts payment.
 * Retail store or online purchase: a person can top-up a prepaid phone in another country by asking for "international top-up". Often, migrant workers will send prepaid top-up internationally as a form of support.
 * Other mobile phones on certain networks which provide international top-up services, where the initiator of the top up is often a migrant worker wanting to add minutes to the prepaid mobile phone of a family member back home.
 * Direct from some open-loop prepaid cards featuring a mobile refill service.
 * Through electronic reloading where a specially designed SIM card is used to reload a mobile phone by entering the mobile number and choosing the amount to be loaded. This process is widely implemented in the Philippines and India so that any person can be a prepaid load retailer, creating a nationwide availability of reloading stations, even in remote areas.

Credit purchased for a prepaid mobile phone may have a time limit – for example, 120 days from the date the last credit was added. In these cases, customers who do not add more credit before expiration will have their remaining balance depleted through expiration of the credits.

There is no compulsion on a prepaid mobile phone user to top up their balance. To maintain revenues, some operators have devised reward schemes designed to encourage frequent top-ups. For example, an operator may offer some free SMS to use next month if a user tops up by a certain amount this month.

Unlike postpaid phones, where subscribers have to terminate their contracts, it is not easy for an operator to know when a prepaid subscriber has left the network. To free up resources on the network for new customers, an operator will periodically delete prepaid SIM cards which have not been used for some time, at which point, their service (and its associated phone number) is discontinued. The rules for when this deletion happens vary from operator to operator, but may typically occur after six months to a year of non-use.

By 2003, the number of prepaid accounts grew past contract accounts, and by 2007, two-thirds of all mobile phone accounts worldwide were prepaid accounts.

History
The history of prepaid mobile phones begins in the 1990s, when larger markets were being sought after by the mobile phone operators. Before this date, all mobile phone services were offered on a post-paid basis, which excluded people with poor credit.

Prepaid mobile service was invented by Subscriber Computing, Inc., an Orange County company, (1986–1998), founded and directed by Arlene Harris. The patents covering this invention are:

 * US-5291543-A, filed 12/5/1990 and awarded on 9/15/1992.
 * US-5148472-A, filed 6/24/1992 and awarded in 3/1/1994.

These patents describe the ability to access the cost of a call and deduct the cost of the call from the user's account balance in near real time. If the user's balance is below the carrier-defined threshold, the next call that the user makes is routed to an Interactive Voice Response (IVR) device that announces to the user that the account balance is low and suggests they add funds to the account so their service is not interrupted. When the user's account balance is depleted, the service is suspended until they added funds to their account. If the user's account balance is depleted, all call attempts are routed to the IVR. These patents expired in 2010 and 2012 respectively.

The prepaid service was sold to Metro Mobile in June 1989, and was implemented in November 1989.

The prepaid service was also sold to carriers in Mexico; Celcom in 1994, and implementation took place in Monterrey, and to Telcel, where implementation began in November 1997 and production took place beginning in April 1998.

Ericsson also became a partner in the prepaid service; a Memorandum of Understanding (MOU) was signed in June 1997 and the final agreement was signed in late 1997. The announcement was made on January 26, 1998 (or listen to it).

Prepaid service enabled carriers in third world countries to add subscribers without having to print monthly statements or having an accounts receivable department, and gave them the ability to add subscribers without concern for their ability to pay their bills.patent holder).

In 1996 MTN became the first mobile operator to introduce a prepaid cellular service in Africa, popularizing "pay as you go" in emerging markets.

The first Prepaid card was called "Mimo" and was launched by TMN, the mobile phone operator of Portugal Telecom, in September 1995. In 2006 Swisscom celebrated ten years with its product and service "NATEL® easy" which also holds a patent on "Prepaid mobile subscriber identification card and method implemented thereby".

Advantages
A prepaid plan may have a lower cost (often for low usage patterns e.g. a telephone for emergency use) and make it easier to control spending by limiting debt and controlling usage. They often have fewer contractual obligations – no early termination fee, freedom to change providers, plans, able to be used by those unable to take out a contract (i.e. under age of majority). Depending on local laws, they may be available to those who do not have a permanent address, phone number, or credit card. This makes them popular among travelers and students away from their hometowns. Additionally, they are popular with parents who wish to have a way to stay connected with their college age students and have some control over the costs.

Disadvantages
Sometimes, pay-as-you-go customers pay more for their calls, SMS and data than contract customers. In some cases they are limited in what they can do with their phone – calls to international or premium-rate telephone numbers may be blocked, and they may not be able to roam. These limitations are usually the results of deficiencies in the prepaid systems used by the wireless carriers, as technology has evolved to the point where these are easily managed by triggers or APIs to third-party solution providers. Current models being deployed by wireless carriers are capable of setting the price points for all services on an individual basis (via packages), such that higher pricing is a marketing decision.

Churn
As described above, prepaid accounts require a subscriber to have a credit balance in the account to make outgoing calls (except emergency calls, which are always allowed). In the US, incoming calls are also barred, while in some other countries, a prepaid mobile with zero balance may still receive calls and texts.

This results in an "on/off" or "all or nothing" proposition for the prepaid service providers and their clients (i.e. the account either has enough credit to use the phone, or it does not). Some operators (e.g., Orange) allow their pre-paid customers to have a small negative balance to allow short calls or texts when the customer's credit has been completely used. This is then deducted when the customer next adds more credit.

The time most likely for a prepaid customer to switch to a different service provider is when the prepaid account reaches a "zero credit balance". Like other service providers, mobile service providers losing a mobile account call it "churn".

Roaming
In the early years, a prepaid mobile phone could only be used within the network of the operator from which the customer purchased the phone. It was not possible to roam onto other GSM networks when using the phone abroad. This was because the operator had no way to bill calls in real time from another network.

However, most prepaid phones now offer roaming using one of the following methods:
 * The prepaid mobile phone user dials a "trigger" number from the foreign location using a USSD message which is not charged for while roaming. Upon receipt of the USSD, the customer's operator will then return the call. When the service calls back, the user is being charged for the cost of the service from the credit available in the home network. The service will then prompt the user to enter the dialed number of the party to be called. The disadvantage of this method of roaming is that the user will not be able to dial numbers directly from the handset. The advantage is that it works in almost all locations around the world since USSD is ubiquitous and free.
 * The user can direct dial from their handset if the network they are roaming in supports CAMEL (Customized Applications for Mobile networks Enhanced Logic). This allows real time billing by the home operator without having to dial the customer back. The advantage is that it is more natural and works seamlessly. The disadvantage is that not all networks support CAMEL so the list of countries where a prepaid customer can use their phone abroad is smaller than for postpaid mobile phones.

Privacy rights
Since July 2013, at least 80 countries globally (including 37 on the African continent) have mandated, or are actively considering mandating, the registration of prepaid SIM users. As of January 2020, researches found that governments of 155 countries have been mandating SIM registration laws; in some countries, prepaid users must submit biometrics like photos and fingerprints.

The reason is a concern by police and security agencies that anonymous use of prepaid mobile services facilitates criminal or terrorist activities.

Prepaid phone users can be anonymous for two reasons:
 * In certain countries, the prepaid SIM card can be sold in a shop like any other goods. There is no need to register them at point of sale, unlike postpaid phones who have to credit check the user before allowing them to purchase and enter into a contract.
 * As prepaid services can often be topped up using cash and vouchers, there is no way to trace the payment and thence determine the identity of a prepaid phone user from payment records.

While there is no doubt that criminals and terrorists use prepaid SIM cards to help stay anonymous and avoid easy detection, to date there has been no empirical evidence to indicate that:
 * 1) Mandating the registration of prepaid SIM users leads to a reduction in criminal activities.
 * 2) The lack of any registration of prepaid SIM users is linked to a greater risk of criminal or terrorist activities.

In fact, a publicly available policy assessment report from Mexico showed that mandatory SIM registration introduced there in 2009 had failed to help the prevention, investigation and/or prosecution of associated crimes. As a result, policymakers decided to repeal the regulation three years later.

A prepaid phone number specifically purchased to be used briefly and then replaced is known colloquially as a burner phone or burner. A Los Angeles technology company developed a mobile application of the same name that replicates this functionality for a smartphone.

United States Senators Chuck Schumer (D-NY) and John Cornyn (R-TX) introduced legislation requiring consumers to produce identification before buying pre-paid phones in 2010,  which was not passed.

International branding
In an effort to differentiate the prepaid from post-paid service for their customers, CSPs have branded prepaid services differently from the post-paid services. A variant of post-paid service has emerged in recent years that comes closer to the prepaid service, by offering a "pay monthly" contract.

Prepaid phones and SIMs in the United Kingdom are known as "Pay as you go".

Usage
Usage of prepaid cellphone service is common in most parts of the world. Around 70% of customers in Western Europe and China use prepaid phones with the figure rising to over 90% for customers in India and Africa. 36% of cellphone users in the United States of America were using some form of prepaid service as of 2021. Prepaid SIM cards are also becoming a variation of the traditional prepaid cellphone plans. Rather than needing to purchase an entirely new phone, existing phones can be used by simply replacing the SIM card within the device. Prepaid service has also evolved to include rate plans and buckets traditionally seen in postpaid plans but with a lower cost of ownership for the network operator. Such Advance Pay plans are often monthly plans with either Unlimited Voice/SMS/MMS (or monthly buckets for some of these) and Prepaid Data Volume Add-ons and throttling mechanisms.

title: Prepaid mobile phone


text:
Talk:Heap (data structure)

Unifying heaps
The articles about heaps keep switching from min to max heaps and back (e.g. in this article the definition is for max heap while the complexity is for min heap.) I think we use consistently min-heap (or max-heap) and say in ONE place the other is just the opposite. What do you think? Jirka6 18:38, 25 February 2007 (UTC)

 * I agree. Bender2k14 (talk) 00:06, 15 October 2009 (UTC)

Definition
I was under the impression that heaps must also be complete trees...that is...the last level of the tree must be filled with a left to right ordering but maybe this is not true for all heaps...
 * That only holds for binary heaps. --Mellum 09:59, 3 Dec 2004 (UTC)
 * Imagine a scenario where the bottom level is completely full. If a new node were to be added to the heap, how could it maintain the property of being a complete binary tree, since the leftmost node would not be filled at the last level? Sheepdude 19:46, 20 April 2007 (UTC)
 * You are talking about a perfect tree, not a complete tree. See Types of binary trees. Bender2k14 (talk) 00:16, 15 October 2009 (UTC)

Let A and B be nodes of a heap, such that B is a child of A. The heap must then satisfy the following condition (heap property): key(A) ≥ key(B)

This is only for the special case of a max-heap, isn't it? --Abdull 17:38, 6 March 2006 (UTC)

 * Yes, special in the sense that a heap is either a minheap or a maxheap. Bender2k14 (talk) 00:11, 15 October 2009 (UTC)

complete table of run time complexity
Anybody able to complete the table of the run time complexity? It also would be nice to have more information than worst case or amortised cost.

Cyc 14:05, 2 May 2006 (UTC)
 * That table is not correct. As the proof on the Binary Heap page shows, the running time for createHeap should be O(n).  I will look into the createHeap times for the other heap implementations to see if they are wrong as well.  Bender2k14 21:42, 12 October 2007 (UTC)

Ditto: the running time for createHeap should be O(n). If it were O(1) as claimed, then sorting is O(n) as follows: for i = 1 to n do { createHeap; remove root } — Preceding unsigned comment added by 96.60.253.126 (talk) 13:45, 28 January 2012 (UTC)

 * According to the cited source (pag 159 and 506 3rd ed), createHeap on a Binary Heap is O(n) but the amortized worst case is Θ(1).
 * Sergio91pt (talk) 12:21, 11 March 2012 (UTC)

heapifying
You know you guys use the term heapifying in this topic? The topic is a mishmash of stuff in its current revision and I might clean it up like I did with tree (data structure). Hope noone objects. Josh Froelich 16:43, 16 February 2007 (UTC)

confusing
I'm a graduate level EE who has been working for 20 years - and I don't understand. Perhaps the explanation could be less circular. Please keep in mind that this data is used by people who do not already know much about the subject.
 * Agreed. This entry does not read well, and provides no explainations or definitions.  —Preceding unsigned comment added by Chieffancypants (talk • contribs) 03:47, 11 January 2008 (UTC)

Key needs to be explained in the definition
It should be explained what a "key" is, becuase it is in the definition with no explanation, which makes the rest of the article usless to anyone who doesn't already know what a heap is, which in turn makes the article usless for %95 of people visiting the page because if you know what a key is there's only a small chance you don't know what a heap is. There isn't even a link (although, noe that a link to key wouldn't be adequeate in this case, because it is probably possible to give a short non-technical descriptioin of a "key"). 76.175.72.51 (talk) 17:19, 13 April 2009 (UTC)
 * I agree. I don't know what kind of key this article is referring to, and so the introduction is meaningless to me. Could someone please explain what a heap key is? 75.72.9.174 (talk) 20:09, 21 December 2013 (UTC)

 * Yes, "key" is one of several problems in the first paragraph [July2015 version]. A definition of "heap" should be given in the first paragraph. In my last LISP class this page developed into a source of jokes: "if you don't know what you are talking about, elevate the discussion to things that no one knows" and "now politicians will tell us about data structures", etc. wrstark (talk) 15:28, 22 July 2015 (UTC)wrstark

I know what is "key" is for sorting, but it's unclear to me what determines whether one item in the heap is the parent of another item. The article says that heaps can be used to implement stacks and queues, but the factor that determines parentage is needed to see the relationship. 206.47.113.103 (talk) 16:54, 10 January 2016 (UTC)

Sublinear Claim
I just removed the claim that heaps can be used to find the max, min, both the max and min, median, or k-th largest element in sublinear time because that is not true. You have to look at each element at least once, so the running time is at least linear. Bender2k14 (talk) 00:20, 15 October 2009 (UTC)

 * I'm pretty sure that the sublinear claim refers to finding these elements after the heap has been constructed. Otherwise that claim would be pointless, and should be removed altogether. Paradoctor (talk) 06:45, 10 November 2009 (UTC)

 * The current statement "Finding the min, max, both the min and max, median, or even the k-th largest element can be done in linear time using heaps" also seems spurious. Firstly, you can easily find min, max and both min and max in linear time without using any kind of special data structure. And … can you really find the median in linear time in any way in which a heap is instrumental? (The standard linear median-finding algorithm doesn't use a heap.) You can find the k-th largest element in linear time with a heap 'if' you assume that k is a constant. Otherwise, if you don't want k popping up in the running time, using the same linear selection algorithm as for the median would be the solution. No heap involved, though. The most natural claims to have in this bullet point (related to selection) would be that it can find the k-th largest or smallest item in (for example) O(n lg k) or O(n + k lg k) time. Mlhetland (talk) 19:58, 12 July 2010 (UTC)
 * I removed the corresponding section according to the above discussion. --mellum (talk) 13:05, 2 August 2010 (UTC)

 * It's easy to find min/max in O(1) using heaps, and update them in O(ln(n)). You can't do that with the linear algorithm, it takes O(n) each and every time. After thinking about it for a while, I came up with O(1) for finding the median also using min/max heaps that update in O(ln n). But I added a ref tag.- Wolfkeeper 13:53, 2 August 2010 (UTC)

 * I hope you don't mind if I remove it again - the article you're citing refers to finding a median or kth element in constant time for data that's already in a heap. The O(ln n) time for an update is correct, but when you're constructing the heap you have to do that n times, so it's O(n ln n) for heap construction. Tristanreid (talk) 23:06, 20 February 2013 (UTC)

Brodal queue
Fibonacci queue cites this paper. From the abstract: An implementation of priority queues is presented that supports the operations MakeQueue, FindMin, Insert, Meld and DecreaseKey in worst case time O(1) and DeleteMin and Delete in worst case time O(log n). The space requirement is linear. The data structure presented is the first achieving this worst case performance. I think this should be mentioned here. Paradoctor (talk) 12:01, 7 November 2009 (UTC)

Weak heaps?
Is there any particular reason why weak heaps are not mentioned? Maybe this variant is not so well known? --188.126.207.212 (talk) 17:46, 23 August 2010 (UTC)

 * If you can write up something about weak heaps with proper sources, be bold. Qwertyus (talk) 15:04, 19 January 2011 (UTC)

Rm pseudo queues
I've removed all reference to "Pseudo Queues". I've never heard of them, and the reference given seems to have nothing to do whatsoever with heaps/priority queues. Qwertyus (talk) 15:09, 19 January 2011 (UTC)

Paring Heap Amortized Linear Time Insert Operation
Hi folks,

why is in the pairing heap implementation the insert operation denoted as amortized linear? Shouldn't it be linear without amortized analysis?

Grettings! —Preceding unsigned comment added by 91.18.86.134 (talk) 16:10, 21 February 2011 (UTC)

 * Because that's the way it's given in the citation. Btw., I've removed all the citation needed tags for the pairing heap operations, since they are all described in the reference given. I'm not going to cite it again in every field of the table. Qwertyus (talk) 10:48, 14 July 2011 (UTC)

Fibonacci heaps
I found this source for the fibonacci heaps, however, it says that every operation is done in amortized time, mind you I haven't read the hole thing. I think is the original paper. Plaga701 (talk) 10:41, 27 July 2011 (UTC)

Leaf heap
I just come across this term from a course slides of MIT OCW, by J.B. Orlin, Network Optimization, spring 2003. I'd like to create a new article to describe this object. However, I can not find a formal public reference now, since my slides at hand is inherited from a senior. In short, this is a heap with all real elements placed in leaves, and all the internal nodes has the value of smaller child. Every operation costs log(n) time. I don't think this structure practical, but it's reasonable to note it here to make a complete article. Can anybody help proceed along this line? Hupili (talk) 09:16, 4 February 2012 (UTC)

Radix heap
Also from 'J.B. Orlin, Network Optimization, spring 2003.', a specialized data structure to improve Dial's algorithm(an implementation of Dijkstra's shortest path algorithm). Use exponentially growed bucket width to improve find-min procedure.Hupili (talk) 02:48, 5 February 2012 (UTC)

Origin of Phrase "the Heap"
I deleted this line:

Some early popular languages such as Lisp provided dynamic memory allocation using heap data structures, which gave the memory area its name.

The line is mysterious to me because I don't see how heaps (the data structure) are useful in the context of memory management. What would the heap property be? Early Lisp implementations generally used mark-and-sweep to reclaim memory.

It was added by an anonymous editor (IP 82.180.29.126) on 20 April 2011. It was justified by a footnote to Cormen etal, but here is what Cormen etal. actually says:

We note that the term "heap" was originally coined in the context of heapsort, but it has since come to refer to "garbage-collected storage" such as the languages Lisp and Java provide. Our heap data structure is not garbage-collected storage, and whenever we refer to heaps in this book, we shall mean the structure defined in this chapter.

In The Art of Computer Programming, Vol. 1, 2nd Ed. p. 435, Knuth says the following on the use of "heap" in the context of dynamic memory:

Several authors began about 1975 to call the pool of available memory a "heap". But in the present series of books, we will use the word only in its more traditional sense related to priority queues.

I found an article dated 1985 which uses what it calls a "heap data structure" to manage memory in a Forth implementation. However the data structure described is not the heap which is the topic of this Wikipedia page.

Googling the line shows that it has been repeated multiple times on the web, but none of the references predate the 20 April 2011 Wikipedia edit. — Preceding unsigned comment added by Grubbiv (talk • contribs) 17:42, 19 August 2012 (UTC)

Floyd's algorithm
There's currently a reference to Floyd's algorithm in section Implementation and operations, but there's no mention of an application to heaps on the algorithm's page. I think the linked one is not the correct "Floyd's algorithm" in this case. If so, the link should be removed. — Preceding unsigned comment added by 77.56.7.92 (talk) 02:27, 8 February 2013 (UTC)

Contradiction of running times
The running time for Fibonacci heaps appears to contradict between the table at Heap (data structure) and at Fibonacci heap. Please check which one is correct. — Preceding unsigned comment added by Theemathas (talk • contribs) 08:32, 30 October 2013 (UTC)

The timings on both pages appear identical? Although the order is somewhat different and delete operation is missing on the heap page. 178.116.166.208 (talk) 18:02, 16 November 2013 (UTC)

Sorry, I didn't notice that the rows are permuted. However, only most of the data are consistent, except some of them: If I miss anything, please post here Theemathas (talk) 06:37, 5 January 2014 (UTC)
 * decrease-key for pairing heap
 * merge for binary heap

Binomial heap should also have O(1) amortized insertion, as stated by its page. Alexis Beingessner (talk) 20:57, 24 February 2014 (UTC)

I have replaced the tables on each page with a template with corrected data combined from both pages. I believe this fixes all the issues listed above. Wingedsubmariner (talk) 04:02, 1 September 2014 (UTC)

Binomial Heap should have O(1) find-min. It is trivial to keep track of the minimum element, just by using a constant amount of space to store it. — Preceding unsigned comment added by Agnishom (talk • contribs) 05:41, 29 March 2017 (UTC)

Link to "completeness" disambiguation page
Could someone replace the absurd link to completeness with an appropriate one? (I'm not sure which one that would be, or I'd have done it by now.)

I'm amazed that anyone would fail to expect completeness to be a disambiguation page. Common sense. Michael Hardy (talk) 22:41, 3 May 2014 (UTC)

heap vs. binary heap
There are two distinct articles, but in this one we see: "... a heap is a complete binary tree ..." -- fixed with "If ..."

min heap vs. max confusion
Article states that " ...the word heap will always refer to a min-heap ..." and then refers to the diagram of a max-heap! -- fixed --- silly sentence removed

Naming of operations
The common operations are a huge mess at the moment with their naming ranging from abc-xyz to AbcXyz and literally EVERYTHING in between. Also, the parameters are sometimes specified, sometimes not, regardless of weather the function actually takes parameters or not. — Preceding unsigned comment added by 93.139.145.237 (talk) 05:07, 5 July 2014 (UTC)

Incorrect short definition for heapify operation
To me, the short definition in the Operations section for heapify is not correct. It currently states: "heapify: create a heap out of given array of elements". However, to me this procedure is more for ensuring the heap contract. CLRS describes a MAX-HEAPIFY method in Section 6.2 ("Maintaining the heap property"). Skiena's Algorithm Design Manual, Section 4.3.3 ("Extracting the Minimum") explains "This percolate-down operation is also called heapify, because it merges two heaps (the subtrees below the original root) with a new key."

I personally find the "create-heap" operation definition ("create-heap: create an empty heap") a bit useless, adding to the confusion around "heapify" ("create a heap out of given array of elements"). To me, "create-heap" (what I would call "build-heap") should use the current definition of "heapify" and a new one presented based on CLRS, Skiena, et al.

Njuk-njuk (talk) 13:05, 21 August 2015 (UTC)

Puzzling diagram
What is the sorting property for the heap in the diagram? It's a maxheap with all the perfect squares on the right main subtree and all the primes on the left, but I cannot come up with any rule for how the nodes were chosen beyond that. — Preceding unsigned comment added by 2601:19a:c102:74d5:7805:8d9:c4ee:94ab (talk • contribs)

Clarifying min vs max, esp in the lead
I see several past comments about potential confusion surrounding min and max heaps but I think the problem is still there, specifically in the lead itself. There are three issues:
 * 1) The lead contradicts itself by defining heap property in terms of (first sentence) only "max heaps" but then goes on (fourth sentence) to include "min heaps".
 * 2) Even that restricted definition is further contradicted by the subsequent mentions of max and min heaps in terms of whether the correct relationships are (first sentence) "greater than" and "less than, or (third and fourth sentences) "greater than or equal to" and "less than or equal to" Searching around the web, "the or equal to" versions are by far the more common.
 * 3) HOWEVER, that then makes the references to "root node" confusing. Putting everything up to that point together it would appear that one could have a heap with multiple nodes, all with the same key (whatever that means). But in that case, what is meant by "highest" or "lowest" (in terms, respectively, of the roots of a max heap and min heap)? Part of the problem here is, as someone earlier noted, it's not exactly clear what a key is. The addition of "or value" helps, but not enough. Is it really the case that one could have a parent and child with the same key (value)? If so, in what way are they: a. different nodes, and; b. parent and child? If not (esp. to a.), then why is the heap property defined in terms of "...or equal to" properties?

Until I hit the third of those points, I was just going to change the text from its current:

 * In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of node P is greater than the key of node C. A heap can be classified further as either a "max heap" or a "min heap". In a max heap, the keys of parent nodes are always greater than or equal to those of the children and the highest key is in the root node. In a min heap, the keys of parent nodes are less than or equal to those of the children and the lowest key is in the root node.

to the following:

 * In computer science, a heap is a specialized tree-based data structure that satisfies the following heap property: for all nodes C and P, if P is a parent of C, then the key (the value) of P is either greater than or equal to (max heap) or less than or equal to (mind heap) the key of C. The node with the highest (max heap) or lowest (min heap) key is called the root node.

However, as I say that may still be an insufficient definition if you really can have a multiple-node heap but with all keys the same (i.e. as seems to be allowed by the "or equal to" component of the heap property. So I've left it unchanged for now. Maybe someone who knows this stuff better than I do could have a look? (And when you are, could you also check the grammar of my replacement definition. I'm trying to say that the relations are either all greater-than-or-equal to or all less-than-or-equal-to, and I could say it in formal logic, but in the plain English needed here I'm not completely sure I've captured the correct logical associations. Thx!) Sleety Dribble (talk) 20:08, 9 September 2017 (UTC)

 * Totally agree about the internal contradiction, which was the most glaring issue. The "≥" versus ">" thing was an issue, and I addressed that too. Basically just used the text you proposed with a couple tweaks, closer to plain English than formal logic. Then I changed the definition of root node to dodge the case when all nodes have equal key.

 * Details: Yes, I do think you can have a parent and child with the same key. NB I'm not a pro at this, though. They are different nodes in the sense that they are different "slots" in which things are stored. They're parent and child in that they satisfy the heap property. Kind of like how [1,2,3] and [1,2,2,3] and [7,7,7] all satisfy the "perfectly sorted list" property. If someone asks me to sort the list [7,7,7], maybe I'm temporarily bemused about why they're asking, or whether each 7 is "really" a different thing from its neighbors, but at the end of the day I just return a sorted list ;).

 * Some things became clear to me when I read the NIST definition of key which is simply "The part of a group of data by which it is sorted [or] indexed...." It confused me initially too, because I'm used to think of key and value as different things. But I gather heaps are much more closely related to simple arrays than to key:value stores. The key is the value; there's no "separate" key by which to look up the value.

 * Finally, I see what you mean about clarifying that "the relations are either all greater-than-or-equal to or all less-than-or-equal-to." I didn't yet address this, but I might. I like what NIST says about "more extreme than or equal to." Probably would require splitting 1st sentence into 2, which might be worth it.--Officiallyover (talk) 14:42, 8 October 2017 (UTC)

New external links
I would like to offer my page of animated illustrations about the Heap (http://www.chrislaux.com/heap.html) for the external links section. I believe the animations explain the Heap nicely visually to go with the text-focussed explanations here.

Ctlaux (talk) 19:02, 3 September 2019 (UTC)

Is first image ("Example of a binary max-heap...") correct?
I'm not a specialist, but is the first image (https://en.wikipedia.org/wiki/Heap_(data_structure)#/media/File:Max-Heap.svg) correct? In the "array representation" part (at image bottom) shouln't be slot with value "17" connecting with "2" and "7", instead of slot with value "3"? Joint ventura (talk) 18:37, 11 February 2021 (UTC)

 * (For the record), there was apparently a glitch, which got fixed 6 days after you noticed it. AHMartin (talk) 17:55, 15 January 2024 (UTC)

Is "almost complete" correct?
As a beginner programmer, I was reading this article and was confused by the term "almost complete." There's no definition of the property on this page, and I can only find definitions of "almost complete" as it applies specifically to binary trees. However, it's clearly stated that a heap can be nonbinary. So does "almost complete" mean anything in this context? What exact property of heaps is it meant to describe? (In addition, even for binary heaps, "almost complete" excludes the "perfect" case, which doesn't seem right at all.) --66.189.60.1 (talk) 01:09, 7 May 2021 (UTC)

 * Given the existance of the (linked) article binary heap, this Heap page has no business discussing the details of binary heap implementations. Also, the nomenclature variants for "complete", "perfect", "full", etc. binary trees are discussed in the (linked) article Binary tree § Types_of_binary_trees.  But since "almost complete" is a variant characterization of the tree underlying a binary heap's implementation, I changed it to "complete".  Now this article uses the term consistently.  AHMartin (talk) 18:36, 15 January 2024 (UTC)

title: Talk:Heap (data structure)


text:
The Beta Band (album)

The Beta Band is the debut studio album of the Beta Band, released in June 1999 by Regal Records. The album followed the critically acclaimed compilation of their first three EPs titled The Three E.P.'s (1998). With high anticipation for The Beta Band, the band originally planned to record the album in four separate continents, but financial constraints slimmed the recording locations down; however, the album was still recorded in a variety of locations. The band approached creating the songs in a variety of ways, sometimes forming songs from single melodies, sometimes bringing together other strands of music, among other forms.

The album builds upon the experimentation of their EPs, and is often seen as a particularly intricate, experimental and layered album, with a variety of different influences, sound effects, instrumentation and song structures. Based more around beat and rhythm than prior releases, the numerous different styles and influences incorporated into The Beta Band include psychedelia, hip hop and blues. Vocalist Steve Mason described his lyrics as fitting but without narrative interests. The band also recorded an ambient bonus disc of two long compositions, "Happiness and Colour" and "The Hut", but decided not to include the disc in the final release.

Upon its release, the band made their dissatisfaction with the album public, infamously calling it "fucking awful", largely blaming time constraints. Upon its release, it reached number 18 on the UK Albums Chart. Critics were favourable towards the album, although many found the album particularly messy and disappointing after the EPs. In later years however, several critics have found the album to be underrated and have praised its ambitions. In 2018, as part of a reissue campaign of the band's discography, Because Music re-released the album alongside the intended bonus disc.

Background
In 1997 and 1998, Scottish-based The Beta Band recorded their first releases, three EPs, Champion Versions, The Patty Patty Sound and Los Amigos del Beta Bandidos, which were met with high critical acclaim. After they had signed to Regal Records, a subsidiary of EMI's label Parlophone, the three EPs were released together as the album The Three E.P.'s in September 1998, which similarly was met with positive reviews. In 1999, they signed to Astralwerks in the United States and the label subsequently released The Three E.P.'s in the country. According to writer Ted Hedrickson, the band – consisting of multi-instrumentalists Steve Mason, Robin Jones, Richard Greentree and John MacLean – fused musical elements like ambient drones, trip hop beats and Pink Floyd-style introspective balladry to create their unique sound throughout their EPs, and that these releases "served as a fabulous taster for the band's self-titled debut."

By the time of The Beta Band, the group had undergone a successful, quick American tour while having become known in Britain for their live performances. Their gigs typically featured films, a DJ set that they would perform before the show, and quirky on-stage sampling from Mclean. Although anticipation for the band's official debut album was high, McLean later admitted they were "sure a bit worried about doing an album." They would later tour in the United States in promotion of The Beta Band.

Writing and recording
Each song on the album was approached differently; some songs the band developed from a single idea or melody, while the chords and melodies of others were developed beforehand. Robin Jones stated "We never really had a master plan ... after we did a song, we turned around and tried to do exactly the opposite. The most exciting songs were the ones where we were making something out of nothing." Describing his lyrics for the record, vocalist Steve Mason explained he typically just followed "the rhythms of the songs, more like a percussionist", and mentioned that the songs "don't really tell a story. It's just words that go in there. They mean something, but they don't mean…anything." Despite some critics believing some of the tracks to be pastiches, the band explained to writer Lydia Vanderloo that they were not "really into pastiche or irony or anything", with Maclean commenting, "Everything's very serious and honest, hopefully. We're not so scared that we hide behind the irony that a lot of folks seem to hide behind these days." Mason later explained to Hedrickson about the creation of the songs: "'Each song starts differently, really. Some times it's a sample or a drum beat. Sometimes it's lyrics or a melody or something like that. It's different every time. [...] 'The Hard One' is a good example because we did something in a way we've never tried before. We don't really have songs where its verse and chorus, but the song has two verses and two choruses. Just to make it a bit more interesting we split everything up. We treated each section like a separate song. So the first verse was like one song. The second verse wasn't a copy at all and we tried to treat the choruses that way as well. Then we combined the songs together to make one song.'"

According to Steve Taylor in The A to X of Alternative Music, none of the songs were prepared before the band entered the studio, which is where they were "determined to keep their manual looping techniques". The band's original intention for The Beta Band was for it to be a double album with each side of the LP recorded in a different continent, "one in Tokyo, one in Mexico and so on". The band tried to plan this with their manager and Regal owner Miles Leonard, but ultimately Leonard dismissed the idea as impossible: "it would have cost three-quarters of a million pounds or something and they would have lost the plot."

Instead, according to Spin, the album was at least partly recorded in a small hut belonging to Maclean's grandfather in a remote northwest part of Scotland, where the group found themselves with no room to sleep as they filled the hut with an excessive amount of musical equipment and homemade instruments. Sawmills Studio, Rockfield Studios and Jacobs Studio were also recording locations for the album. In a 1999 interview, Mclean clarified that separate sections of the albums were recorded in different places: "Four songs here, four songs somewhere else. You know, break it up a bit?" As with the band's prior releases, The Beta Band co-produced the album with Chris Allison, who also engineered it, although the band's manager later admitted he felt the collaboration was not as successful this time.

Ambient bonus disc
In one of their attempts to "make something out of nothing", the band had originally intended the album to contain a bonus disc of two long-form ambient pieces, "Happiness and Colour" and "The Hut", both of which lasted over 20 minutes and represented the band's desire to "make a record of sound as a description for something like happiness, where a distinct first part gives way to a distinct second part". The band's idea to record The Beta Band in Maclean's grandfather's hut was so they could record the sounds of the ocean for these pieces, and during which they discussed the possibility of a quadruple album. After the band returned to London, they had with them several hours of audio that they had recorded, which were then edited down into the two tracks.

According to Craig McLean of Spin, "both sounded a little random, like a radio scanning across the ether". However, the band ultimately decided to remove these tracks from the album. Jones recalled: "We liked some of what we recorded, but it's not really what we wanted it to be from start to finish. We felt the second part was lacking in direction." Nonetheless, this decision came several weeks after the band's record label had already included the ambient disc with promotional copies of the album distributed to various people in the music industry. Drummer Robin Jones felt the reason they dropped the disc was because they were rushed into constructing it in only four days, saying they intended it to be "an ambient… sound-piece. It’s really indulgent on our part, but I wanted to make it a musical story. In the same way Chill Out by The KLF is a story. So it sort of succeeds. It just needed more… conclusions. Rushed again." The bonus disc was eventually released officially alongside special editions of the album's 2018 remaster.

Musical style
The Beta Band is an experimental, sonically complex, dense and detailed album. Unlike the band's previous EPs, which presented their varied genre influences in a less coarse way, the album is more abstract and beat-minded, fusing genres more abrasively, whilst being less influenced by folk music. Described by AllMusic's Jason Ankeny as "a brashly schizophrenic freak-out which weaves its way throughout the history of rock & roll," the album crosses a wide variety of musical ground which, in the words of CMJ New Music Monthly, makes it "hard to locate exactly where the foursome are coming from." Ankeny, describing the styles, said: "Pop, blues, folk, psychedelia, hip-hop -- they're all here, sometimes even colliding within the same song; the disc somehow sounds almost completely different with each successive listen, consistently revealing new layers and possibilities.”

The ten songs on the album rely on a snippet of melody, often sung and played on acoustic guitar by Steve Mason, but surrounding his voice are not only guitars or drums but many other, more unusual instruments and techniques, including samples, xylophones, sleigh bells, hand claps, spoons, and a diversity of bird whistles, including a cuckoo, with its songs integrating numerous tape loops and offbeat breakbeats into what writer Ron Hart called the album's "ambient classic rock jams and textured pop melodies". The music is said to disregard melody and other examples of musical theory such as verses and choruses in favour a chaotic approach. Jonathan Perry of Rolling Stone, describing the tracks, said: "'Each track unfolds into panoramic vistas of texture and sound that suggest other ethereal worlds even as the band's approach remains rooted in organic instrumentation like acoustic guitar and percussion and lyrics that often amount to little more than earth-bound mantra-like chants. It's that sense of improvisational freedom within the framework of a specific song that gives the band's material its expansive flair'"

As with prior albums, the band's early Pink Floyd influence is prominent throughout The Beta Band, although hip hop is said to be a more prominent influence on this record, with rapping, splicing and samples appearing prominently. Mason hoped, regardless of the "really obvious" criss-cross of styles on "The Beta Band Rap", the band's various influences throughout the rest of The Beta Band would sound "a bit more subtly involved". He also felt the record was both a conscious and natural effort, adding "it's just something we all really wanted to do", while Greentree himself described the album as "like a bird without all the fleshy bits and feathers." Stylus Magazine's Derek Miller called the album a "testimony to balls-out astral tribalism" which features "some of the more singular 'alt-pop music' of the last decade", while doing so "in a veiled manner that never shows its hand until you’re four songs deep and still stuck in thought about the first.”

Songs
"The Beta Band Rap" opens the album and consists of three distinctive parts, opening with a spirited marching band introduction that segues into a rap section whose lyrics recount the band's history to date in detail, describing the band's formation, signing to Parlophone subsidiary label Regal Records and "drinking champagne at EMI". It was described by writer Stuart Berman as "actually equal parts barbershop-quartet serenade, proto-'Lazy Sunday' faux b-boy braggadocio, and Elvis pelvis thrusts." "It's Not Too Beautiful" follows, starting with pulsating guitars that push "a wished whirlpool sound" and followed by Mason's multitracked vocals. According to one review, "the song seems to take flight on the whirl of a helicopter, with blades blunted and made soft by the dander in the air." "Simple Boy" is a quieter song, backed by atmospheric changes.

Described as a country rock ramble, "Round the Bend" is among the more focused songs. Mason's very specific lyrics are displayed as internal monologue as he recalls a disappointing night. He blends simple thoughts about drinking and dinner with travel fantasies about pyramids, opinions on the Beach Boys' Wild Honey and "moments of deep awkwardness". A jam of both organic and electronic elements, "Dance O'er the Border" is heavy on repetition and percussion and lacks a melody for the first four minutes, while featuring lyrics that forgo verses, choruses and rhyming in favour of Mason spoken, stream-of-consciousness comments. Miles Bowe named it the album's best song and the band's fifth best overall, saying that although not "very representative of the Beta Band's sound", it "does a pretty great job" of anticipating LCD Soundsystem.

"Brokenupadingdong" and "Smiling" were compared to Julian Cope by writer Tom Ewing, who described them as "ramshackle campfire clapalong jams with a powerful communal momentum" that partly recall Amon Duul I, Can and late 1980s British house music. Between them is "Number 15", a frustrated song with an emphasis on dance music and unusual choral refrains, alongside gamelan elements played with kitchen utensils. "The Hard One" was partly inspired by Bonnie Tyler's 1983 hit "Total Eclipse of the Heart". The band sampled the piano motif from the song, and "although [they] put it through stuff", they declared it "their cover version"; "We switched the lyrics to the chorus around", Mason told CMJ, "I thought that it was a great song, so we ended up writing a tune around it." Jim Steinman, who wrote and produced "Total Eclipse of the Heart", threatened the band with legal action over using its lyrics, "Once upon a time I was falling in love, now I'm only falling apart", which the band changed slightly so that they became "Once upon a time I was falling apart, now I'm only falling in love", but changed his mind after he heard the song. "The Cow's Wrong" closes the record in a muted fashion.

Release and promotion
The Beta Band was highly anticipated,  with  Spin calling it "one of the most anticipated releases in Britain since Oasis' Definitely Maybe". Prior to release, The Beta Band was played before an invite-only industry audience in a studio/bar in Shoreditch, London, which included Noel Gallagher and Verve guitarist Nick McCabe. The band were in attendance, "looking slightly embarrassed, like gate crashers at a party in their own home", according to Craig McLean. Gallagher praised the album when talking to an NME journalist. As the band told Lydia Vanderloo of CMJ New Music Monthly, the band did not enjoy promoting the album. The Beta Band was released by Regal Records in the United Kingdom on 21 June 1999, and by Astralwerks in the United States on 29 June 1999. Astralwerks also released "Round the Bend" and "The Cow's Song" as a promotional cassette single in the US. Upon its release, The Beta Band debuted and peaked at number 18 on the UK Albums Chart and stayed on the chart for two weeks.

Band denouncement
A week prior to the album's release, Steve Mason infamously denounced the album as "fucking awful", adding that "it's definitely the worst record we've ever made and it's probably one of the worst records that'll come out this year." Speaking to NME, he said the album contained "some terrible songs", opining that none of the album's tracks were fully written or developed, dismissing them as "[h]alf-written songs with jams in the middle.” Greentree felt the production should have been less muddy, while McLean noted that their apparent shortcomings were the band's fault; however, the band also blamed Regal for their dissatisfaction with the final album, including the abandoning of the ambient disc, which they saw as having been incomplete, and for not providing them with enough time or money to work on the album satisfyingly.

The statements immediately caused tension between the band and their label; The Guardian quoted "an enraged EMI chairman" as demanding to know "what the fuck is going on with the Beta Band?" The newspaper said the band "began a public slagging match with their record company." Miles Leonard, boss of Regal and the band's manager, dismissed their complaints, calling them "lame excuses" as "they had as much time as they wanted to have to make it, they were not forced to do anything they didn't want to." However, he did admit that some of the financial constraints led him to prevent the band's continental recording idea, but felt the album was "nowhere near as bad as they say", despite feeling it could have better. By the time of follow-up album Hot Shots II (2001), the band's opinion on The Beta Band had not changed and spoke out against it being mentioned to them in interviews, with Greentree adding: "We just never felt the album was properly finished." Mason later said, "I sometimes wonder how that album would have been received if I'd kept my mouth shut."

Critical reception
The Beta Band was less well received by music critics than the Beta Band's previous releases. According to Pitchfork's Stuart Berman, the album "deflated the ballooning expectations surrounding the group in the wake of The Three EPs with all the elegance and subtlety of a whoopee cushion." While many critics praised the band's ambitions, the album was also concurrently criticised as overstuffed and messy. In a retrospective piece, Derek Miller of Stylus Magazine disagreed that it was messy, saying it was "brave and cohesive", and noted how "they manage to somehow form a whole out of shattered, uneven pieces. It's awkward, Dalian, almost completely disinterested in closing the circle, and that’s the beauty in its madness."

Among original reviews, Brent DiCrescenzo of Pitchfork hailed The Beta Band as a unique sounding album that was "so psychedelic, yet not excessively experimental." Ron Hart, writing for CMJ New Music Monthly, was favourable, praising the album and how it turned "experimental dabblings" into a "fully realised concept". Rob Sheffield of Rolling Stone said the band "layer warped voices, pastoral guitars and random sound effects over slow-motion loops to evoke a chance meeting between King Crimson circa 1969 and Happy Mondays circa 1989", highlighting "The Cow's Wrong". Robert Christgau of The Village Voice gave the album a three-star honourable mention rating, signifying "an enjoyable effort consumers attuned to its overriding aesthetic or individual vision may well treasure." He stated that the band is "still lost in sound, but oriented enough here to make tunes out of it."

Writing several months after the release of The Beta Band, Tom Ewing of Freaky Trigger called it "the most troublesome album of 1999," highlighting how "its makers disown it, its few disciples adore it, a whole lot of people hate it, and a whole lot more like me just don't know what to make of it, but keep playing it anyway. While there are certainly good bits and bad bits on The Beta Band, it’s not always possible to work out which is which, let alone pull them apart. And the funny thing is that after a few months you stop caring and just take the whole damn lot as it comes."

At the end of 1999, The Beta Band was ranked in several publications' lists of the year's best albums; Intro named it 9th, Mojo named it the 10th, Rockdelux named it the 26th, Muzik named it the 27th, and NME named it the 36th. In a retrospective review, AllMusic critic Jason Ankeny thought that the album "constantly runs the risk of collapsing into complete self-indulgence." Nevertheless, Ankeny further stated: " In its way the Beta Band's genius is their wanton disregard for niceties like verses, choruses, and melodies; rejecting musical theory in favor of the chaos theory, the album's neither a masterpiece nor a mess, but both." Miles Bowe of Stereogum have conceded no less that "everyone knew that the record was rushed, and that maybe the band didn’t have enough time to fully develop the songs or lyrics as much," while also noting that "people tend to forget that The Beta Band is not 'fucking awful' — it’s actually pretty fucking great."

Legacy
In retrospect, The Beta Band has been re-assessed by some critics and considered underrated. Writing in 2005, Jess Harvell of Pitchfork felt the band were neglected by critics and said "there's not a single band in the past year with the balls– or lack of sense, your call– to release a debut album as overgrown with ideas (not always good ones, mind you) as The Beta Band." Stuart Berman, also of Pitchfork, described The Beta Band as the group's most notorious release and felt it was the last known example of a "group this strange" signing to a major label and then using their new label to make even stranger music, especially when considering the abandoned ambient bonus disc. "If the record violently vascillates between fascinating and frustrating on a song-by-song basis," he said, "its over-arching oddness retains its own peculiar allure."

Derek Miller of Stylus Magazine said that by the time the band split up in 2004, The Beta Band was widely considered to be "unnecessarily difficult, a short side-step in the career of a remarkably talented band", but he felt the album had been long underrated and was due for re-evaluation, praising its unique sound and adding that it "remains the broken-toothed step-child with a little bit of dander on the lip and a tangle of hair on its back, but Christ those eyes, so keen and full of mischief, forgive the ugly parts." Pitchfork founder Ryan Schreiber called The Beta Band "the greatest acid-burnt full-length of the late 90s", saying that although it "took some getting used to, since half of its songs were, to put it gently, cracked", the "densely layered electronic psychedelia" songs proved the band as "one of the few modern electronic-based bands capable of successfully splicing hundreds of self-created sources into huge, pastoral symphonies, grounded in both pop music and Dalí surrealism." The album is featured in Mojo magazine's book The Mojo Collection, which lists what its authors consider to be the 1,000 greatest albums of all time.

Track listing
All tracks written by The Beta Band.

 * 1) "The Beta Band Rap" – 4:41
 * 2) "It's Not Too Beautiful" – 8:29
 * 3) "Simple Boy" – 2:18
 * 4) "Round the Bend" – 4:56
 * 5) "Dance O'er the Border" – 5:33
 * 6) "Brokenupadingdong" – 4:46
 * 7) "Number 15" – 6:49
 * 8) "Smiling" – 8:35
 * 9) "The Hard One" – 10:06
 * 10) "The Cow's Wrong" – 5:49

Personnel
Adapted from the liner notes of The Beta Band

 * Steve Mason - vocals
 * Richard Greentree – bass
 * Robin Jones – drums
 * Chris Allison – producer, recorder
 * John Maclean – sampler, turntables
 * Fergus Percell – human beatbox (track 5)
 * Kingsley – vocals (track 1)
 * Neil Richardson – trumpet (track 9)
 * Gordon Anderson – lyrics (track 10)
 * Stephen Mason – lyrics (track 10)

title: The Beta Band (album)


text:
User:Louis Jean-Richard~enwiki

Visit my page www.ljr.ch to learn more about me.

Post a message

title: User:Louis Jean-Richard~enwiki


text:
Wikipedia:WikiProject Judaism/People template/Example

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.

The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here. The rest of the text about Shelomo goes here.


text:
DJ Cheese

DJ Cheese (born Robert Cheese) is a disc jockey and record producer who won the 1986 DMC World Final in London, showcasing the art of scratching in turntablism for the first time. He also appeared in the 1986 UK tour with Run-DMC. He is known as ‘master of the crossfader’.

Early life
Cheese was born in Oak Hill, West Virginia. He lived in Edison, New Jersey from birth and later moved to Plainfield in 1977. In 1980, Cheese would become inspired by Grandmaster Flash and begin to develop an interest for hip hop and purchasing and collecting official DJ equipment.

Career
In 1984, DJ Cheese won the DJ Battle for World Supremacy at the New Music Seminar, becoming the first non-NYC DJ to win the title. At the seminar, Cheese met and joined Tony Prince in competition. Cheese was later invited by Tony Prince to appear in the inaugural DMC DJ World Championship. Cheese's portion of the competition incorporated scratching, which initiated a different approach to deejay battling and changed the course of DMC competitions moving forward.

From 1985-1986, under the label Profile Records, Cheese released two vinyl 12" singles with the group Word Of Mouth entitled 'Coast to Coast' and 'King Kut'. King Kut would be used in the coming years as a way of "basing songs around how great your deejay is."

In 1986, Cheese headlined both performances (afternoon/evening) at the London’s "UK Fresh ’86" show at the Wembley Arena. It was during these performances that DJ Cheese performed his set along with KMC and MC Original G from Word of Mouth. Later that year Cheese would collaborate with Fats Comet on the song 'Eat The Beat'.

After this, Cheese distanced himself from Word of Mouth due to a financial dispute with Profile Records. Since then, he has spent periods of involvement in music, performing with Doug E. Fresh, Slick Rick, Big Daddy Kane, and 50 Cent. In 2013, he reconnected with Word of Mouth to record the single "Life Without Hip Hop".

title: DJ Cheese


text:
William R. Webb

William Robert Webb (November 11, 1842 – December 19, 1926) also known as "Sawney" Webb, was an educator who founded the Webb School and served briefly as a Democratic United States Senator from Tennessee.

Biography
Webb was born near Mount Tirzah in Person County, North Carolina. He was the grandson of Richard Stanford, an early ten-term United States Representative from North Carolina. His father, Alexander Webb, died when he was six years old. He attended private schools, including the Bingham School in Oaks, North Carolina, and then matriculated at the University of North Carolina at Chapel Hill in 1860. However, he soon left to join the Confederate Army in the Fifteenth North Carolina Infantry Regiment, in which he served until badly wounded at the Battle of Malvern Hill on July 1, 1862. While recovering from his wounds, he again attended UNC. In the spring of 1864, he re-enlisted as a private in the Second North Carolina Cavalry Regiment and had risen to the rank of Captain by the time of his capture on April 3, 1865, after the Battle of Namozine Church. He was imprisoned on Hart's Island in western Long Island Sound and then transferred to Castle Williams on Governors Island in June, 1865, from which he escaped for a one-day adventure in the city. After the conclusion of the Civil War he returned to UNC, graduating in 1868 and subsequently teaching at Horner Military School in Oxford, North Carolina until 1870.

That year he moved to Tennessee and established The Webb School, a preparatory school in the small community of Culleoka. In 1886, after Culleoka incorporated and legalized the sale of liquor in the new city, he (being a prohibitionist) moved the Webb School to Bell Buckle, where it still exists today.

Webb married Emma Clary on April 23, 1873, and together they produced eight children: William Robert, Jr. (1874–1960), Alla (1875–1944), John Stanford (1877–1951), Adeline (1879–1968), Daniel Clary (1881–1954), Susan (1882–1980), Emma (1884–1973), and Thompson (1887–1975). His eldest son Will succeeded him as principal at the Webb School, and his youngest son Thompson founded the Webb School of California (now The Webb Schools) in Claremont in 1922.

He was elected to the United States Senate by the Tennessee General Assembly to fill the vacancy caused by the death of Senator Robert Love Taylor and served from January 24 to March 3, 1913. He was the last Confederate soldier to do so. Always a prohibitionist, he delivered his one speech in the Senate to support a law prohibiting interstate transport of liquor. He then returned to Bell Buckle and his school, dying there in 1926 and being buried at Hazelwood Cemetery.

title: William R. Webb


text:
Robert Aitken (composer)

Robert Morris Aitken (born August 28, 1939) is a Canadian composer and flautist. He began his career as a teenager playing in a number of orchestras, notably becoming the youngest principal flautist in the history of the Vancouver Symphony Orchestra in 1958 at the age of 19. In 1971, he abandoned ensemble performance to pursue a highly successful solo career. He has appeared as a soloist with major symphony orchestras throughout North America, Europe and Asia and has made more than 40 commercial recordings.

Born in Kentville, Nova Scotia, Aitken has played with the Vancouver Symphony Orchestra, CBC Symphony Orchestra, and Toronto Symphony Orchestra. He is Co-Artistic Director of New Music Concerts in Toronto. He has also done classical and contemporary music (along with eminent harpist Erica Goodman) on BIS Records. He studied flute with Nicolas Fiore, Marcel Moyse, Jean-Pierre Rampal, Andre Jaunet, Severino Gazzelloni, and Hubert Barwahser.

From 1988 to 2004, Aitken was a member of the music faculty at the Staatliche Hochschule für Musik in Freiburg, Germany. He is also a former faculty member of the University of Toronto (1960–1975) and the Shawnigan Summer School of Arts (1972–1982) and was director of advanced studies in music at the Banff Centre from 1985 to 1989.

Selected compositions

 * Scores are available through the Canadian Music Centre.

 * Orchestral
 * Spectra for four chamber groups (1968)
 * Shadows I: Nekuia (1971)
 * Spiral (1975)

 * Concertante
 * Concerto for 12 solo instruments (2 flutes, 2 oboes, 2 clarinets, bassoon, horn, violin, viola, cello, double bass) and orchestra (1965)
 * Berceuse "for Those Who Sleep before Us" for flute and orchestra (1992)
 * Concerto (Shadows V) for flute and string orchestra (1999)

 * Chamber music
 * Kebyar for flute, clarinet, trombone, 2 double basses, percussion and prepared tape (1971)
 * Shadows II: Lalitá for flute, 3 cellos, 2 harps and 2 percussion (1973)
 * Icicle for flute solo (1977); Éditions musicales transatlantiques
 * Plainsong for flute solo (1977); Universal Edition
 * Folia for woodwind quintet (1980)
 * My Song: Shadows IV for 2 flutes (1994)
 * A Little Ground for Max for violin, trumpet, bass clarinet, double bass, percussion and piano (1997)
 * Wedding Song for 2 flutes (1998)

 * Choral
 * Monodie: Fragments for mixed chorus and flute (1983)

Honours

 * 1993 – Aitken was made a Member of the Order of Canada.
 * 2003 – National Flute Association Lifetime Achievement Award

title: Robert Aitken (composer)


text: User talk:66.81.46.163

title: User talk:66.81.46.163


text:
Ramón Franco

Ramón Franco Bahamonde (2 February 1896 – 28 October 1938), was a Spanish pioneer of aviation, a political figure and brother of later caudillo Francisco Franco. Well before the Spanish Civil War, during the reign of Alfonso XIII, both brothers were acclaimed as national heroes in Spain; however, the two had strongly differing political views. However, with the "Ley de Unidad Sindical" of 26 January 1940, his brother Francisco realized many of Ramón's syndicalist political ideals. The syndicate law was unique in Europe and brought Spain a high level of social welfare, housing and labour protection without the high costs of social conflict between stakeholders that normally accompanied such social advancements in other countries. They had a less-known brother, Nicolás.

Aviator
Ramón started his career as an ordinary successful military officer in the infantry, assigned to Morocco in 1914. In 1920 he joined the Spanish Air Force, participating in activities that earned him international attention. Promoted major, in 1926 he became a national hero when he piloted the Plus Ultra flying boat on a transatlantic flight. His co-pilot was Julio Ruiz de Alda Miqueleiz; the other crew members were Teniente de Navio (Navy Lieutenant) Juan Manuel Duran and the mechanic Pablo Rada. The Plus Ultra departed from Palos de la Frontera, in Huelva, Spain on 22 January and arrived in Buenos Aires, Argentina on 26 January. It stopped over at Gran Canaria, Cape Verde, Pernambuco, Rio de Janeiro and Montevideo. The 10,270 km journey was completed in 59 hours and 39 minutes.

The event appeared in most of the major newspapers worldwide. Throughout the Spanish-speaking world the Spanish aviators were glamorously acclaimed, particularly in Argentina and Spain where thousands gathered at Christopher Columbus square in Madrid.

In 1929, he attempted another trans-Atlantic flight, this time crashing the airplane to the sea. The crew was rescued days later by an aircraft carrier of the British Royal Navy.

Political activism
During the reign of Miguel Primo de Rivera he declared himself on several occasions against the regime. He conspired against the Monarchy, inflicted losses on the army and was sent to prison, from which he was able to escape. In December 1930, along with other Republican aviators, he seized some aircraft at the aerodrome of Cuatro Vientos and flew over Madrid dropping leaflets which falsely stated a republican revolution had broken out all over Spain, calling on citizens and soldiers to aid the movement and stating that troops' quarters would be bombed shortly if they did not help in the revolution. He fled to Portugal and returned to Spain when the Second Spanish Republic was proclaimed.

Reentering the Army, in April 1931 he was named chief of a main directorate of Aeronautics. His tenure lasted 2 months; in June 1931 he was dismissed in wake of a Tablada affair, an unclear episode which gave rise to suspicion that Franco was involved in a revolutionary plot in Andalusia. He was elected as a deputy in the Cortes for Republican Left of Catalonia in Barcelona, retiring from the army and focused on politics.

Civil War
When the Spanish Civil War exploded in July 1936, he was in the United States as an air attaché of the Spanish Embassy.

Upon his return to Spain, in spite of his leftist political past, he joined the Nationalist side of which his brother Francisco was a main leader. He was promoted to lieutenant colonel and was named head of the airbase at Majorca. His receipt of the command in Majorca was "received very badly" by his fellow aviators, who resented that Ramón, a Freemason who had been dismissed, had been promoted over officers with war merits.

Death
Ramón Franco was killed in an air accident on 28 October 1938, when his seaplane, a CANT Z.506, crashed off Pollença, near the coast of Majorca, while attempting to bomb Republican-controlled Valencia. His body was found floating in the water, and his death led to rumours of conspiracies and sabotage. According to his sister, he was murdered by Freemasons who loaded bricks and mortar aboard his plane because he wanted to publish an anti-Masonic book called La burla del grado 33. After the crash, his brother Francisco, who would rule Spain for the next three decades, severed most relations with his brother's widow and daughter.

title: Ramón Franco


text:
Have You Ever Been in Love (album)

Have You Ever Been in Love is the tenth studio album by recording artist Leo Sayer. It was originally released in November 1983 by Chrysalis (UK), and Warner Bros. (US) as the follow-up to his ninth album World Radio (1982). It was co-produced by the Grammy Award-winning Arif Mardin, in association with Alan Tarney, and Christopher Neil producing the other tracks. Sayer is credited as co-writer on the tracks "Don't Wait Until Tomorrow", and "Orchard Road".

The album reached number 15 on the UK Albums Chart, making it (including the compilation album, The Very Best of Leo Sayer) his eleventh successive Top 50 chart entry in the UK Albums Chart, in a period of over nine years. The album spawned three singles which first two reached the top sixty on the UK Singles Chart, including "Orchard Road", which would become one of Sayer's most popular songs, this would also become the last Sayer single to make the Top 20, peaking at number 16 and spending nine weeks on the chart.

Personnel
Credits are adapted from the album's liner notes.
 * Leo Sayer – lead, harmony and background vocals
 * Al Hodge – guitar
 * Steve Khan – guitar
 * Steve Lukather – guitar
 * Hank Marvin – guitar
 * Derek Austin – synthesizer
 * Michael Boddicker – synthesizer
 * Bob Christianson – synthesizer
 * Ian Lynn – synthesizer
 * Alan Tarney – synthesizer, bass guitar, guitar, background vocals
 * James Stroud – Synclavier, LinnDrum programming
 * Robbie Buchanan – piano
 * Geoff Westley – piano
 * Mo Foster – bass guitar
 * Abraham Laboriel – bass guitar
 * Will Lee – bass guitar
 * Bob Jenkins – drums
 * Jeff Porcaro – drums
 * Casey Scheuerell – drums
 * Trevor Spencer – drums
 * Frank Ricotti – percussion, marimba
 * Sharon Campbell – background vocals
 * Alan Carvell – background vocals
 * Steve George – background vocals
 * John Kirby – background vocals
 * Marcy Levy – background vocals
 * Christopher Neil – background vocals
 * Gordon Neville – background vocals
 * Richard Page – background vocals
 * Jackie Rawe – background vocals

Production

 * Producers: Arif Mardin, Alan Tarney, Christopher Neil

title: Have You Ever Been in Love (album)


text:
BMH

BMH is a three letter abbreviation that could mean:

 * Bacchus Marsh railway station, Australia
 * Bengbu South railway station, China Railway telegraph code BMH
 * Britas MöHippa 2022-11-20
 * Benjamin Mkapa Hospital, located in Dodoma, Tanzania
 * Big Momma's House, a 2000 comedy film starring Martin Lawrence and Nia Long
 * Big Money Hustlas, a 1999 comedy film starring Detroit hip hop group Insane Clown Posse
 * Bournemouth – ISO 3166-2:GB administrative division code GB-BMH
 * Bournemouth railway station
 * Boyer–Moore–Horspool algorithm, an algorithm for finding substrings in strings
 * British Military Hospital (disambiguation), hospitals provided for military personnel; esp. in foreign countries
 * British Motor Holdings, UK company created with the merger of Jaguar and BMC in 1966
 * Bureau of Military History, Irish military archive
 * BMH also known as Burst My Head, moniker for Music Producer BolaBMH
 * Black Magic Holiday/Bank Monday Holiday, noise mongrels from Warminster, Wiltshire, UK

title: BMH


text:
Talk:Have You Ever Been in Love (album)

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

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

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

BetacommandBot (talk) 23:19, 13 February 2008 (UTC)

title: Talk:Have You Ever Been in Love (album)


text: User talk:65.125.141.68

title: User talk:65.125.141.68


text:
Category:Religious studies books

Religious studies is the academic field of multi-disciplinary, secular study of religious beliefs, behaviors and institutions. It describes, compares, interprets, and explains religion, emphasising systematic, historically-based, and cross-cultural perspectives.

While theology attempts to understand the intentions of a supernatural force (such as deities), religious studies tries to study human religious behavior and belief from outside any particular religious viewpoint. Religious studies draws upon multiple disciplines and their methodologies including anthropology, sociology, psychology, philosophy, and history of religion.

For religiously inspired works which are not considered scripture see Category:Religious literature

title: Category:Religious studies books


text:
Romanian Athenaeum

The Romanian Athenaeum (Ateneul Român) is a concert hall in the center of Bucharest, Romania, and a landmark of the Romanian capital city. Opened in 1888, the ornate, domed, circular building is the city's most prestigious concert hall and home of the "George Enescu" Philharmonic and of the George Enescu Festival.

History
In 1865, cultural and scientific personalities such as Constantin Esarcu, V. A. Urechia, and Nicolae Crețulescu founded the Romanian Athenaeum Cultural Society. To serve its purposes, the Romanian Athenaeum, a building dedicated to art and science, would be erected in Bucharest.

The building was designed by the French architect Albert Galleron, built on a property that had belonged to the Văcărescu family and inaugurated in 1888, although work continued until 1897. A portion of the construction funds was raised by public subscription in a 28-year-long effort, of which the slogan is still remembered today: "Donate one leu for the Ateneu!" (Romanian "Dați un leu pentru Ateneu!").

On December 29, 1919, the Athenaeum was the site of the conference of leading Romanians who voted to ratify the unification of Bessarabia, Transylvania, and Bukovina with the Romanian Old Kingdom to constitute Greater Romania.

Extensive reconstruction and restoration work has been conducted in 1992 by a Romanian construction company and restoration painter Silviu Petrescu, saving the building from collapse. The nine million Euro required were contributed in equal shares by the government and the Council of Europe Development Bank.

Building and facilities
The overall style is neoclassical, with some more romantic touches. In front of the building there is a small park and a statue of Romanian poet Mihai Eminescu.

Inside, the ground floor hosts an ornate conference hall as large as the auditorium above; in the auditorium there are 600 seats in the stalls, the rest of the seats being placed in 52 loges.

A 75 by 3 m fresco by Costin Petrescu decorates the inside of the circular wall of the concert hall. Painted using the al fresco technique, the piece depicts the most important moments of Romanian history, starting with the conquest of Dacia by Roman emperor Trajan and ending with the realization of Greater Romania in 1918.

Recognized as a symbol of Romanian culture, the building has been inscribed in 2007 on the list of the Label of European Heritage sites.

title: Romanian Athenaeum


text: User talk:156.63.116.142

title: User talk:156.63.116.142


text: Template:Western Athletic Conference navbox


text: Talk:Allium

title: Talk:Allium


text:
Wych Kaosayananda

Wych Kaosayananda (วิชช์ เกาไศยนันท์; born 1974), also known as Wych Kaos or Kaos, is a Thai film director.

Early life
The son of Thai diplomat Kaosayananda, he lived and studied in Pakistan, where his father was posted in Islamabad as an ambassador.

Career
His directorial debut was Fah, released in 1998, which at the time was the highest-budgeted film in the history of the Thai film industry, but failed in the Thai box office.

His second film and American debut (which he directed under the shortened name "Kaos") was the 2002 thriller Ballistic: Ecks vs. Sever, which upon release was widely panned by both critics and moviegoers as one of the worst films ever made. In March 2007, Rotten Tomatoes ranked the film number 1 among "The Worst of the Worst" movie list.

Kaosayananda's post-Ballistic films include Tekken 2: Kazuya's Revenge (2014), 'Zero Tolerance' (2015) and One Night in Bangkok (2020).

Zero Tolerance was previously completed and released only in Vietnam under the title of Angels. Kaosayananda found it difficult to sell his film to distributors because Angels was more of a drama than an action film. Therefore, he decided to add action star Scott Adkins into the mix for marquee value and to re-shoot and re-edit the entire film in order to craft more of a streamlined actioner that would interest buyers. This re-edited version, entitled Zero Tolerance, is the cut of the film that has been released to the rest of the world.

Dead Earth tells a parallel story to Kaosayananda's The Driver, focusing on events that happen within the same post-apocalyptic world, with characters and locations intersecting between both films.

Filmography

 * Cinematographer only
 * The Mark (2012)
 * The Mark: Redemption (2013)
 * Once Upon a Time in Vietnam (2013)
 * Invincible (2020)
 * The Gunrunner (TBA)

title: Wych Kaosayananda


text:
Wikipedia:Articles for deletion/Ryoma (disease)

Ryoma (disease) was proposed for deletion. This page is an archive of the discussion about the proposed deletion. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was delete

Ryoma_(disease)

 * Delete. It's amusing and all that sort of thing, but that's not really what wikipedia is all about. I also second an addition to BJAODN, but. As much as I love Dinosaur Comics, I think outright deletion is necessary without adding it to the Dino Comics article. Rockingharder 19:46, 2 Dec 2004 (UTC)

 * Not an actual disease; article is based on a joke from a webcomic.  Merope 19:29, 2 Dec 2004 (UTC)

 * Keep. It says in the article it's not an actual disease, and gives the origins of the idea.  There's many things on Wikipedia that aren't real but still profoundly affect people's lives.  Qwantz 20:08, 2 Dec 2004 (UTC)
 * Delete,, nonsense or fancruft, but perhaps worthy of preservation at BJAODN. -- Smerdis of Tlön 20:27, 2 Dec 2004 (UTC)
 * Keep! Ryoma may not be a "real" disease, but it still has a profound impact on the lives of millions of americans and other living things. Also it's basically impossible to take the opinion seriously of anyone who uses the word "fancruft" in conversation.  I mean seriously.  "Ihcoyc"?  "Tlön"?!.  How would you like it if I deleted YOU for not being a real word?  Also I'd like to point out that I don't understand the voting system at all, but I feel compelled to make myself heard on issues I really haven't thought through very well. keinsignal 20:27, 38 Cun 1786 (UTC)
 * Note that there is no User:KSE nor User:keinsignal; the above posting is by anonymous User:209.98.48.222, whose only other edit is a solitary addition to Ryoma (disease). --jpgordon{gab} 21:25, 2 Dec 2004 (UTC)
 * Note that Quantz is likely the creator of the webcomic in question, which is located at www.quantz.com. In any case, redirect to Daily Dinosaur Comics and merge any meaningful content to there. Snowspinner 20:57, Dec 2, 2004 (UTC)
 * Delete. Prank/hoax. Having talked with Ryan North (author of Dinosaur Comics) before, it seems unlikely to me that User:Qwantz is him. Trolling Wikipedia isn't his style.   — Gwalla | Talk 01:22, 3 Dec 2004 (UTC)
 * What's more, he said on his messageboard that he didn't write this article, and someone else there took credit for it. Factitious 02:20, Dec 3, 2004 (UTC)
 * Delete: DCEdwards1966 21:17, Dec 2, 2004 (UTC)
 * Merge and redirect or delete. -Sean Curtin 21:39, Dec 2, 2004 (UTC)
 * Delete: Unencyclopedic.  It is satirical fiction, written so as to make a point, apparently, about the proliferation of medical alarms -- but Wikipedia is a place for factual information, not for satirical fiction.  Contrary to claims by Qwantz, it is not forthcoming about its fictional nature, and while Qwantz states a true principle that there are things which are not real which have still profoundly affected people's lives, there is no indication that Dinosaur Comics has all that profoundly affected people's lives, let alone a fictional disease contained therein. -- Antaeus Feldspar 22:29, 2 Dec 2004 (UTC)
 * Delete. To ensure I am taken "seriously" by the author, I will refrain from using the word "fancruft" and use my newly coined term Fiction and Entertainment Compiled with Extreme Specificty. Affected millions, my ass. -R. fiend 22:36, 2 Dec 2004 (UTC)
 * As a fictional disease, it has wreaked havoc on uncounted fictional lives, their imaginary friends and families, and those who are forced to share speculative elevators with them. In fact, millions is probably an understatement -- I believe it would be safer to say kajillions . Also, I have no personal affiliation with Qwantz or Daily Dinosaur Comics, and my additions to the entry for "Ryoma" were on the level of minor corrections.  I simply have a vested interest in fictional diseases as I am myself a fictional character.  I am also bored and enjoy causing trouble for people.  I am sorry that you had to read all this.  keinsignal 22:22, Dec 2 2084 (UTC)
 * Qwantz, I like Daily Dinosaur Comics, but I'm still voting Delete. Crazy Utahraptor. Silly Dan 23:12, 2004 Dec 2 (UTC)

 * Delete: Prank. I hate whatever comic this came from.  There.  Now my vote can be seen as a conspiracy to keep it down.  I have no idea what it came from, of course, but, since its author will assume that it's all personal, I might as well make the world simpler to understand.  Pranks do not belong in encyclopedias, and the article could be speedy deleted as such. Geogre 01:53, 3 Dec 2004 (UTC)
 * The comic in question is Dinosaur Comics. It's very funny, in my opinion.  Hating it because of something someone else wrote on Wikipedia doesn't seem entirely reasonable.  The ryoma article was not created by the author of that comic strip. Factitious 02:20, Dec 3, 2004 (UTC)
 * Comment: I really don't, you know.  My comment was aimed at the incivil votes we've been getting lately on rap, webcomic, and Internet issues.  Some 2-3 people (won't say who) have come along to accuse all who vote to delete as "not knowing" the thing or "hating it," etc.  Figured I'd save some time.  I'm sure it's amusing, but I don't think we should break out jokes from much of anything, including No soup for you and the like.  These are all best discussed in the articles on their originating topics.  Geogre 04:27, 3 Dec 2004 (UTC)
 * Redirect to Dinosaur Comics. It should probably be on BJAODN as well. Factitious 02:20, Dec 3, 2004 (UTC)

 * Keep: but make it more clear that it is a fictisious disease.
 * Sign your votes, people! --Improv 03:35, 3 Dec 2004 (UTC)
 * Apologies from the Originator: No, I do not see it as personal and I do not see it as a conspiracy to "keep it down". I saw it as, as mentioned before by someone else, just a satire that I thought would be amusing. However, choosing Wikipedia was very poor reasoning on my part and I do apologize for it. I understand the true purpose of this wiki, and fully respect it, even if it did not appear so through my actions. So, I must apologize for my misdirection. Instead of outright deletion though, I suggest either redirection to Dinosaur Comics, a move to a more appropriate wiki (Suggestions would be helpful, as I do not have the capabilities to host my own wiki at this time), or, if at all possible, perhaps on the Qwantz site itself. I apologize for all this, and will assure you that an fictional mess in a quite-real encyclopedia will not occur from me again. Crowbar 9:37 PM, Dec. 2, 2004 (EST).

 * Delete it. —[[en:RaD Man|RaD Man (talk)]] 03:33, 3 Dec 2004 (UTC)
 * Delete the fancruft. --Improv 03:35, 3 Dec 2004 (UTC)

 * Keep. This is an entry about a specific detail of a fictional topic. Removing this is no different than removing an article about "TIE Fighters" in Star Wars, or "Q" from Star Trek.  Except that this is a bit more obscure, and infinitely funnier.  Only the hosters of Wikipedia should get the choice to even suggest removing this, and only if it's causing a burden on the server's hard drive(s).  Is not the point of wikipedia to eventually contain the entirety of human knowledge (as awesome and impossible as that might be)? Note -- This is one of User:24.159.46.189's two edits.
 * No. It's not. -R. fiend 23:09, 3 Dec 2004 (UTC)
 * Delete, no redirect. Wile E. Heresiarch 06:09, 8 Dec 2004 (UTC)

This page is now preserved as an archive of the debate and, like other '/delete' pages is no longer 'live'. Subsequent comments on the issue, the deletion or on the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text: User talk:24.218.103.51

title: User talk:24.218.103.51