text:
Talk:List of wars 2003–2010

Purpose of this list
the title is list of wars 2003-current does it mean that all wars here are either still going on or have between 2003 and now? Evilbu 21:11, 21 March 2006 (UTC)
 * Yes. Though some have stopped without an end-date being listed here. -- Beland 23:01, 14 May 2006 (UTC)

What about Nationalist-Loyalist hello in Northern Ireland? --The Lizard Wizard 06:35, 7 December 2006 (UTC)

Is this list correct? I have from another source (not referenceable unfortunately) that the number of wars currently going on in the world is closer to 30. Sorry I can't provide a proper fix.<IP_ADDRESS> 06:07, 29 December 2006 (UTC)
 * These are the ones that have started since 2003, you may be looking for Ongoing wars. Kmusser 15:20, 17 January 2007 (UTC)

Another question : why 2003? If the idea of this list is to list recents conflicts, ongoing or not, it should take in account all conflicts during the last X years, and so the title should be changed every year... Kromsson (talk) 09:38, 22 January 2009 (UTC)

[Cival War]
hammas is on the verge of concering gazza come on its tiime to call it a civil war

Tabled
I've put the list into a table and added location and death toll. What do people think?

Also, there must be more wars occurring in this time period. Can people help with finding the rest of them? --Mark J 21:02, 14 September 2007 (UTC)

Inaccuracy regarding "Fatah-Hamas conflict"
The "end date" for the Fatah-Hamas conflict in this table is not consistent with the article on the Fatah-Hamas conflict. Somebody should go through this list and verify the end dates of all conflicts that purportedly have ended. <IP_ADDRESS> (talk) 03:42, 25 January 2008 (UTC)

Sortable tables do not work correctly
Note that the tables can't be sorted correctly by date, because the first word of the date column is the day, not the year. They should be arranged by yyyy:mm:dd: to work correctly. The same problem occurs in List of wars 1990-2002 and List of wars 1945-1989. Rayhou (talk) 09:35, 23 March 2008 (UTC)
 * Fixed for this article. -- Beland (talk) 17:54, 20 May 2008 (UTC)

Zimbabwe Conflict
The Zimbabwe conflict is not a conflict at all. A poster has put a link indicating that 12 to 20 people are missing after having gone to a Botswana training camp (unproven as well). Many people go missing in Zimbabwe. If the poster wants to do like Kenya and post post-election conflict in Zimbabwe March 2008 - November 2008 and the hundreds that died with proof that they died then go ahead.

Trans-African Inititive
The transafrican inititive concerns about anti-terrorism. It lists no operations, or battles, or deaths and rails against the U.S for starting the inititive. We already have the insurgency of the maghred that includes Algeria, Maurtanian and Morrocco. We do not need anti-u.s rhetoric in the list of wars. Find another article.

Thai-Cambodian Conflict
I have no problem n posting about the Thai-Camobodian conflict that killed an estimated 5 people. However, since the Djoutbi-Eritea border clash has not been posted which killed over 100+ people I do not think this needs to be posted in wars and needs to be in its own list of list of border skirmishes.

Border conflict vs. war
Your concern about the Thai-Cambodian conflict is understandable, however it is important to keep an updated list of wars for Wiki users, and I believe that the Thai-Cambodian conflict (and also the Abu Kamal raid) fit into the list. If the number of casualties (in terms of listing) is a concern, remember that the 2008 Anjouan conflict is listed as having only 3 casualties. As for the aforementioned Djibouti-Eritrea conflict, I have added this to the list. —Preceding unsigned comment added by Peiping dorknose (talk • contribs) 23:56, 23 December 2008 (UTC)

Palestinian Israeli conflict
I believe it is still connected to the Second Intifada not a seperate conflict. —Preceding unsigned comment added by Jersay (talk • contribs) 05:48, 4 January 2009 (UTC)
 * wrong. -- TheFE ARgod (Ч) 13:26, 4 January 2009 (UTC)

Tough. Your opinion is not the whole of the community and the second intifada is still ongoing so it should be put with the intifada. Not some totally knew bogus conflict when a good reliable old conflict is ongoing. —Preceding unsigned comment added by Jersay (talk • contribs) 18:36, 4 January 2009 (UTC)

Started Table Modification
I thought it might be better if the fatalities could be sorted and with notes, minimums and maximums. I was not sure if this is acceptable. Also, I am not sure what before some counts means. So I pasted the table here if anyone wants to continue or please advise me. I also don't know if the references can be put in the sortable columes and still work. Also, how to format dates so they will sort too? Perhaps I'm getting in over my editing abilities. Thanks <IP_ADDRESS> (talk) 07:05, 28 May 2009 (UTC)

Deleted my long table above, left enough to show if anyone has the ambition to redue the one in the article. <IP_ADDRESS> (talk) 21:51, 13 June 2009 (UTC)

Definitely Ongoing - DRC
Can't anyone check the news carefully? This is conflict that continues to produce violent deaths, displacements, rape and everything else associated with an ongoing conflict. As I noted in the "ongoing conflicts" article discussion it should be on that list.

UN - Daily Press Briefing (7 August 2009) "The UN refugee agency (UNHCR), says that an unprecedented 55 rebel attacks by the Lord's Resistance Army (LRA) in eastern Democratic Republic of the Congo have displaced some 12,500 civilians in THE PAST MONTH ALONE. This is a spike from 23 LRA attacks in May and 34 in June.

UNHCR says that the Ugandan rebels have MURDERD 1,273 civilians and abducted 655 children and 1,427 adults. A number of women were also raped and houses were looted and torched. Fleeing civilians have found shelter in public buildings including schools and churches. And the situation is made worse by a lack of basic medical supplies at local hospitals, while aid agencies have so far reached only half of the internally displaced persons. And that’s due to widespread insecurity in the region. You can read more about this upstairs." <IP_ADDRESS> (talk) 01:29, 9 August 2009 (UTC)

Why 2003?
Of all years to start this timeline from, why 2003? It seems a little random. I am thinking of maybe getting this article moved to "List of Wars 2000-current." Having an article that marks all the wars of a current decade seems less arbitrary than having marked wars starting with a random year. Does anyone object? Bibbly Bob (talk) 19:22, 7 November 2009 (UTC)

{{subst:RMtalk|List of Wars 2000-present|2003 seems to be kind of a random year to start a war timeline from. I think it would make more sense to have the timeline start at 2000, since 2000 is the beginning of a new decade, century, and millennium, as opposed to 2003, which seems random and arbitrary. Of course I am aware that if we move the article to List of Wars 2000-present, we will have to expand the list and include conflicts that happened between 2000 and 2003. But if we can expand the list as needed, I request that we make the move. —Preceding unsigned comment added by Bibbly Bob (talk • contribs) 22:37, 9 November 2009 (UTC)
 * I would merge and make List of wars 1990-current since the approx. end of the Cold War (or 1991)-- TheFE ARgod (Ч) 19:34, 12 January 2010 (UTC)

Page Design
The other lists of wars (see List of wars 1900-1944) include a belligerents table, with victors on one end, losers on the other. Should this article not have the same format?--Astrofreak92 (talk) 02:07, 5 January 2010 (UTC)

 * Victors/losers is hard for an ongoing conflict, but main parties should be listed. —Preceding unsigned comment added by <IP_ADDRESS> (talk) 13:37, 6 January 2010 (UTC)
 * There are some conflicts from 1990-2002 that are ongoing, and they simply show the belligerents table as blank. Though I think it would be better to show belligerents for ongoing and indecisive conflicts, bringing this article at least in line with the others seems like a good idea. I will rework the article this weekend.--Astrofreak92 (talk) 03:14, 7 January 2010 (UTC)

2006 Lebanon War
The results of this war is disputed, as both sides claim victory. Personally, I favour this to be called an Israeli victory, as the Hezbollah were withdrawn from Southern Lebanon and replaced by UN peacekeeping forces, which in fact was Israels goal. However, the media often refer to this as a defeat to Israel and a decisive victory to Hezbollah. Please keep in mind that the media is not neutral, and remember that wikipedia shall on no account adopt the medias opinions. With regards, --Mikrobølgeovn (talk) 17:06, 16 March 2010 (UTC)

 * I agree. I don't think a gang of gun-toting criminals such as Hezballah would be considered the victor of a war with a country that has a sophisticated army with weapons such as tanks and fighter aircraft. According to the Arab media, Israel definitely came out a loser. And according to them, Israel also seemed to have come out a loser in every other war they fought too. But in reality, not a lot of other sources seem to agree with those figures. The placement of Israel in the loser box is definitely a violation of NPOV. Yertuy (talk) 19:49, 24 March 2010 (UTC)

 * Is this some sort of sick joke? You claim the media are biased and that we are not adopting their opinions, so you include your own opinions instead? I have reverted your edit, and if you revert me this will be going to the appropriate noticeboards. O Fenian (talk) 23:37, 9 April 2010 (UTC)

 * This is not about my opinion, I just try too explain that the media is not neutral, and the fact that many likes to describe Israel as the looser does not necessarily represent the real situation. Hezbollah lost controll over Souther Lebanon, and Israel destroyed big parts of their rocket stock. Israel never intended to destroy Hezbollah, which Olmert said all the time, they only seeked too weaken them and make life in Northern Israel safe. They succeeded in doing this, and therefore, this was an operative success. With regards, --Mikrobølgeovn (talk) 15:47, 10 April 2010 (UTC)

 * The result of the conflict was inconclusive and disputed. It's very problematic to claim that either side was victorious. <IP_ADDRESS> (talk) 19:53, 19 February 2011 (UTC)

 * I agree that there was either no winnner, or Israel was victorious. I don't get what Hezbollah won? There were more fatalities in Lebanon and the Israeli objective was complete. How else could Israel win? Were you expecting that they would occupy Lebanon?!!?! I don't know how this works, but we need to make it so that both sides claim victory. Thing is you claim that "no side was victorious" then why does it show that Israel lost? Bezuidenhout (talk) 10:36, 5 March 2011 (UTC)

Nagorno-Karabakh Skirmish
Both sides claim victory in this skirmish, so it's not accurate to say who won/lost. I checked the page on the skirmish itself, and apparently the casualties are undetermined, as both sides claim different amounts of people killed/injured. I did figure out though that for Azerbaijan, the deaths averaged 6 and the injured 4.5, and for Armenia, dead average 6 and injured 8.5 (the numbers are averages and some have .5). Also, it was Armenia who fought Azerbaijan not Nagorno-Karabakh. —Preceding unsigned comment added by <IP_ADDRESS> (talk) 02:01, 22 March 2010 (UTC)

Non-war removed again
I have again removed the incident in Kingston, as it was not a war. The title of this article begins "List of wars" and the lead says "list of wars". If any sources have described this incident as an actual war please provide them, but in the absence of several high quality sources saying this was a war this seems to be extreme fringe point-of-view pushing. O Fenian (talk) 18:03, 11 July 2010 (UTC)
 * If you look at the other lists, they have conflicts and expeditions. What about invasions? Wars, conflicts, invasions, expeditions, rebellions belong here. As for the Kingston thing, it was an armed conflict between Jamaica's military and the Shower Posse drug cartel. I'm adding it back. B-Machine (talk) 23:31, 11 July 2010 (UTC)
 * Please provide sources that describe it as a war, or I will be removing it again. O Fenian (talk) 23:37, 11 July 2010 (UTC)
 * O Fenian is correct, I have not seen it characterised as a war by any reliable source. And it is not an excuse that other items on the list may be erronously listed as well. It should be removed, and the list gone over for other wrongly placed incidents. --Saddhiyama (talk) 21:02, 12 July 2010 (UTC)

If you any of you remove it, I'll add it back. You want sources? Go look for it. It was an armed conflict between the Jamaican military and a Jamaican drug cartel. B-Machine (talk) 17:03, 14 July 2010 (UTC)
 * That is not how Wikipedia works. The addition of this conflict is disputed, and since consensus is clearly against you, it is up to you to add the sources to back up your claim. And "If you any of you remove it, I'll add it back." is a self admission of edit warring, I would advise you to read Edit warring. --Saddhiyama (talk) 09:23, 15 July 2010 (UTC)

http://www.drugwarrant.com/2010/05/the-drug-war-in-jamaica/, http://www.digitaljournal.com/article/292512, http://www.digitaljournal.com/article/293744, and http://www.english.rfi.fr/americas/20100526-death-toll-rises-jamaican-drug-war B-Machine (talk) 14:45, 15 July 2010 (UTC)

 * A "drug war" is not necessarily the same as a war. Also please stop reverting while discussion is still taking place, it constitutes edit warring. --Saddhiyama (talk) 19:35, 15 July 2010 (UTC)

Since User:B-Machine keeps reverting to his preferred version, despite my repeated warnings no to do so while discussion is ongoing, I had no choice but to report him for edit-warring here. --Saddhiyama (talk) 09:17, 16 July 2010 (UTC)

Back on topic: Drug war - "1. drug war - conflict between law enforcement and those who deal in illegal drugs" Link. The term is linked to law enforcement, and does not necessarily have anything to do with actual war. In this case it does not. --Saddhiyama (talk) 14:17, 16 July 2010 (UTC)

This was an armed conflict between the Shower Posse and Jamaica's military. That term does not only apply to cops. You're pulling straws now, lol. B-Machine (talk) 14:32, 16 July 2010 (UTC)

 * It is not an unusual thing that the military carry out law enforcement, as was the case here. "Armed conflict" includes a wide variety of conflicts, most of which are not "wars" in any respect. --Saddhiyama (talk) 14:50, 16 July 2010 (UTC)

This event was a war, an internal war, between Jamaica's armed forces and a drug cartel called Shower Posse. B-Machine (talk) 15:00, 16 July 2010 (UTC)

 * We seem to be going in circles. --Saddhiyama (talk) 15:07, 16 July 2010 (UTC)

Iraq war participants.
Why has the participants in the Iraq war been narrowed down to just 4 countries in the coalition of 48? —Preceding unsigned comment added by <IP_ADDRESS> (talk) 14:44, 7 October 2010 (UTC)

Non-conflicts, sub-conflicts and general misfit to war
Several of the events described here are certainly not wars, but rather minor conflicts, or subconflicts of major events. I would like B-Machine explain the revert of my last edit, expaining how conflicts below 1,000 casualties, not named wars by WP:RS, can be included here (!?). I would like to remind that a war is generally defined as an event of two side or more violence restricted by time, with weaponry in use and 1,000+ casualties. I assume WP:GF and WP:NOTYOURS. Thanx.Greyshark09 (talk)
 * Since when is a war not a war because there are or were casualties below 1,000? And what do you mean by restricted by time? B-Machine (talk) 00:33, 21 June 2011 (UTC)
 * Since this is titled the "list of wars" (not conflicts or battles), then all events listed here should qualify the definition of war (sometimes wars are part of a bigger conflict or war - like WW, but usually not) or at least be defined as a "war" by WP:RS :
 * "War" is an armed conflict with at least 1,000 military battle deaths, where at least one of the parties is the government of a state.
 * The events which do not qualify the definition or are subconflicts or even single battles, and are not named "war" per WP:COMMONNAME:
 * 2003 Invasion of Iraq (part of Iraq war per RS, not war by itself)
 * Iran–Party for a Free Life in Kurdistan conflict (small conflict, 300 killed)
 * Operation Rainbow (part of second Intifada, which is doubtful a war by itself, but "Rainbow", 63 people killed, is certainly not a war)
 * Operation Days of Patience (same as above)
 * French-Ivorian clashes (part of an Ivorian war, not war by itself)
 * Apparently, this page includes a WP:SYNTH and it needs to be eventually fixed. If you have objections - pls relate to events i've listed. Thanx.Greyshark09 (talk) 19:49, 21 June 2011 (UTC)
 * Since i got no response i'm assuming a silent agreement to remove.Greyshark09 (talk) 20:39, 24 July 2011 (UTC)

There is no agreement to move. I just think you're wasting time. If you do remove, I'm going to the authorities. B-Machine (talk) 22:50, 24 July 2011 (UTC)

Iraq War "winner" (if there was one), was clearly the USA
A dubious tag was placed next to the USA as the winner, but nobody has really discussed much whether this is dubious or not. It seems clear that the winner could not be anyone other than the USA. It went into Iraq to overthrow Hussein's regime, which was accomplished in short order, and then fought a prolonged counter-insurgency in order to maintain the Iraqi government which it set up. It fought in that conflict against largely Sunni insurgents and the Iraqi Al Qaeda group led by Abu Musab Zarqawi. Most of the sunni insurgents eventually crossed over to the US side and Zarqawi was killed. To some extent there remain holdout Iraqi AQ terrorists and sunni insurgents still attacking the Iraqi government, but they were diminished to a level such that the US was able to successfully turn the fight over to the elected Iraqi government and Iraqi Army which it created. So the US war aims have been achieved, even though some violence continues. Therefore since the binary nature of the winner/loser columns forces us to pick a victor, then that can only be the USA. The fact that the cost for all sides was far higher than anticipated is consistent with many wars, in which victory is often pyrrhic. The fact that the purpose of the war was without need, is also typical of many wars. But every war, even ones which are perhaps pointless or pyrrhic, has a winner and loser. So it isn't really dubious and the tag can be removed. Walterego (talk) 18:08, 3 January 2013 (UTC)

Orphaned references in List of wars 2003–10
I check pages listed in Category:Pages with incorrect ref formatting to try to fix reference errors. One of the things I do is look for content for orphaned references in wikilinked articles. I have found content for some of List of wars 2003–10's orphans, the problem is that I found more than one version. I can't determine which (if any) is correct for this article, so I am asking for a sentient editor to look it over and copy the correct ref content into this article.

Reference named "IMU joins ISIL": From Islamic State of Iraq and the Levant:  From War in North-West Pakistan:

I apologize if any of the above are effectively identical; I am just a simple computer program, so I can't determine whether minor differences are significant or not. AnomieBOT ⚡ 03:35, 1 August 2015 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on List of wars 2003–10. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20140714024317/http://presstv.com/detail/2014/05/19/363304/iran-ready-to-help-over-nigeria-girls/ to http://presstv.com/detail/2014/05/19/363304/iran-ready-to-help-over-nigeria-girls/

Cheers.— InternetArchiveBot  (Report bug) 07:21, 30 November 2016 (UTC)

Map
A map was requested. Is this something along the lines of what is needed? Comments please! Hel-hama 17:34, 23 May 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on List of wars 2003–10. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20111001163040/http://fr.jpost.com/servlet/Satellite?cid=1251804542247&pagename=JPost%2FJPArticle%2FShowFull to http://fr.jpost.com/servlet/Satellite?cid=1251804542247&pagename=JPost%2FJPArticle%2FShowFull
 * Added archive https://web.archive.org/web/20080513074927/http://www.hiik.de/en/konfliktbarometer/index.html to http://www.hiik.de/en/konfliktbarometer/index.html

Cheers.— InternetArchiveBot  (Report bug) 01:32, 24 May 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on List of wars 2003–10. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20120106084750/http://www.montrealgazette.com/news/canada-in-afghanistan/Canada+sends+special+forces+African+Qaida+fight/5804679/story.html to http://www.montrealgazette.com/news/canada-in-afghanistan/Canada+sends+special+forces+African+Qaida+fight/5804679/story.html
 * Added archive https://web.archive.org/web/20121224145854/http://www.africom.mil/getArticle.asp?art=5937 to http://www.africom.mil/getArticle.asp?art=5937

Cheers.— InternetArchiveBot  (Report bug) 09:34, 3 January 2018 (UTC)

title: Talk:List of wars 2003–2010


text:
Luo Tong

Luo Tong (193 CE–228 CE), courtesy name Gongxu, was an official serving under the warlord Sun Quan during the late Eastern Han dynasty and early Three Kingdoms period of China.

Life
Luo Tong was from Wushang County (烏傷縣), Kuaiji Commandery, which is around present-day Yiwu, Zhejiang. His father Luo Jun (駱俊), who served the Prince of Chen Liu Chong as his chancellor (陳相) in the Eastern Han dynasty, was killed by the warlord Yuan Shu. Luo Tong's mother remarried after her husband's death, and became a concubine of the official Hua Xin. Luo Tong, who was seven years old then, returned to Kuaiji Commandery with his close friends. Before Luo Tong left his hometown, his mother tearfully bid him farewell. When the carriage driver told him that his mother was looking on from behind, Luo Tong did not turn around. When asked why, he said, "If I look back, my mother will only miss me more. I don't want to make her suffer." This story highlights Luo Tong's filial piety and respect for his family. It also shows his loyalty and determination, as he did not let his emotions cloud his duty.

At the time, there was a famine, so the residents in Luo Tong's hometown and other travellers taking shelter there suffered from hunger. Luo Tong was very worried about this and his appetite decreased. His elder sister, who was widowed and had no children, was known for being very kind. She saw that her brother looked very upset, so she asked him why. Luo Tong said, "I feel bad when I can fill my own stomach while those people don't have enough to eat." His sister replied, "You're right. Why do you suffer in silence and not tell me about this?" She then took grain from her personal stores and gave it to Luo Tong, and also informed their mother about it. Luo Tong's mother agreed with what they were doing, and she distributed grain to the people. Luo Tong became famous after this incident.

When the warlord Sun Quan was nominally serving as the Administrator (太守) of Kuaiji Commandery, Luo Tong, then 19 years old, was appointed as the Chancellor of Wucheng County (烏程縣; south of present-day Huzhou, Zhejiang), which had over 10,000 residents. He performed well in office and received praise from Sun Quan, who promoted him to an Officer of Merit (功曹) and acting Cavalry Commandant (騎都尉). He married the daughter of Sun Quan's cousin, Sun Fu. Luo Tong was known for being very diligent in examining the state of affairs in his jurisdiction. Whenever he encountered important issues that required action, he would attempt to resolve them within the day itself. He also advised Sun Quan to give greater attention to talented and virtuous people, so as to attract them to serve him. He suggested that Sun Quan meet the guests individually (instead of in groups) and hold private conversations with them to understand them better and make them feel appreciated and grateful to him. Sun Quan accepted Luo Tong's advice. Luo Tong was appointed as "General of the Household Who Builds Loyalty" (建忠中郎將) and was placed in charge of 3,000 troops. He was placed in command of Ling Tong's unit after Ling died.

At some point during his career, Luo Tong became aware of the hardships suffered by the common people. He noted that the population was plagued by contagious diseases, onerous taxes, and forced labor. He wrote a lengthy memorial to Sun Quan, the ruler of Eastern Wu, warning him that these problems could lead to instability and unrest if they were not addressed. Luo Tong's memorial demonstrated his concern for the welfare of the people and his understanding of the social and political issues of the time. He urged Sun Quan to implement policies to help the people and relieve their burdens. Sun Quan felt touched after reading Luo Tong's memorial and he paid greater attention to Luo's ideas. Throughout his career, Luo Tong had written many memorials to Sun Quan, giving appropriate advice on policies. Among all the pieces of advice he gave to Sun Quan, the most notable one is his suggestion to stop increasing conscription, because he felt that forcing the people into conscription would lead to social problems and make them feel resentful. Sun Quan argued with him again and again over this issue, but eventually accepted his ideas.

In 221–222 CE, Luo Tong participated in the Battle of Xiaoting between Eastern Wu and its former ally state, Shu Han. He was a subordinate of the Wu general Lu Xun, and the Wu forces emerged victorious in the battle. Luo Tong was promoted to Lieutenant-General (偏將軍) for his contributions. Later, in 222–223 CE, he participated in the Battle of Ruxu against Wu's rival state Cao Wei. The Wei general, Cao Ren had sent his subordinate Chang Diao (常雕) to attack Zhongzhou (中洲). Luo Tong and Yan Gui (嚴圭) led the Wu forces to Zhongzhou to resist the enemy and defeated them. For his success, Luo Tong was promoted to Area Commander of Ruxu (濡須督) and enfeoffed as the Marquis of Xinyang Village (新陽亭侯). He also spoke up for Zhang Wen when Zhang Wen was implicated in a scandal involving Ji Yan, but Sun Quan did not accept his advice.

Luo Tong died in 228 at the age of 36 (by East Asian age reckoning).

Luo Jun
Luo Tong's father was Luo Jun (駱俊), whose courtesy name was Xiaoyuan (孝遠). Luo Jun was known for being skilful in handling both civil and military affairs. He served as a minor officer in his home commandery when he was young and was nominated as a xiaolian (civil service candidate). He was subsequently promoted to a Gentleman of Writing (尚書郎), and was later appointed as the Chancellor of Chen State. When chaos broke out towards the end of the Eastern Han dynasty, Luo Jun successfully maintained law and order within Chen State and ensured that the people lived well and were safe. Sometime in the 190s, when the warlord Yuan Shu was running short of supplies, he sent a messenger to Chen State to request for grain. Luo Jun saw Yuan Shu as a traitor and despised him, so he refused to send supplies. The angry Yuan Shu then sent assassins to kill Luo Jun.

Appraisal
Chen Shou, who wrote Luo Tong's biography in the Records of the Three Kingdoms, appraised Luo Tong as follows: "Luo Tong understood righteousness and provided rational advice. He was able to convince those in power."

source: wikimedia

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

title: Luo Tong


text:
SuperX (Operating System)

SuperX is a Linux distribution, a computer operating system originally developed in India. SuperX uses a tweaked version of KDE and is aimed towards beginners and casual users. SuperX features a new launcher made in QML that allows users to get a grid view of all icons of the installed applications in the system, the new launcher is called "SuperX App Launcher".

Name
The name SuperX is an acronym which bears its aim of providing a simple elegant  computing experience

SuperX stands for "Simple, User friendly, Powerful, Energetic and Robust eXperience".

Philosophy
SuperX aims to be as simple and down-to-earth as possible avoiding bloat and unnecessary components. It aims to be as easy as possible for the non Linux users especially those who are coming from Microsoft Windows. The operating system embraces beginners, casual users and makes them feel at home. Simplicity doesn't mean feature-less. SuperX is as powerful and very handy for professionals and experts alike. The GNU utilities plus the software packages available are enough to be used for any task. SuperX is perfectly capable of being a desktop publishing setup, multimedia hub or even server. SuperX uses a tweaked version of KDE as its Graphical User Interface for providing a more polished, smooth and beautiful looking desktop experience which is delightful to use. SuperX is based on the Linux kernel with Hardware Enablement (HWE) for use on newer hardware and follows the Ubuntu LTS specifications. As a consequence, it is strong, stable and recovers quickly. It is virus and malware-free and no one can gain access to computer without knowledge. There is no need to defragment the hard-drive or clean up the registry every month, as all housekeeping is done by the operating system itself.

Features
A default installation of SuperX contains a wide range of software that includes LibreOffice, Firefox, Ktorrent, and several lightweight games such as Kpaitence and Kacman Many additional software packages are accessible from the built in SuperX Appstore as well as any other APT-based package management tools. Many additional software packages that are no longer installed by default, are still accessible in the repositories still installable by the main tool or by any other APT-based package management tool. Cross-distribution snap packages and flatpaks are also available, that both allow installing software. The default file manager is Dolphin

All of the application software installed by default is free software. In addition, SuperX redistributes some hardware drivers that are available only in binary format, but such packages are clearly marked in the restricted component.

History
SuperX was first developed in Guwahati, the capital city of Assam in India by a high school student named Wrishiraj Kausik in 2007. Later he released the first public version of SuperX in 2011 and started a company to support and promote SuperX called Libresoft (Libresoft Technology Pvt. Ltd.). Libresoft along with its supporters, funds the development of SuperX and provides support to the users. Libresoft also organizes various public events to spread awareness about open-source software and computers in general.

Its first formal release, SuperX 1.0 "Galileo", was released to selected users on April 24, 2011, and was made available to the public as a free download on October 8, 2011. The second release, SuperX v1.1 "Cassini" was released on June 21, 2012. It is an LTS version with 5 years of support.

The latest version is 5.0 "Lamarr" which was released on May 2, 2019, based on Ubuntu 18.04 and KDE Neon code base. It features a highly modified KDE workspace. Version 5.0 updates in a much slower and predictable rate and thus Qt and KDE libraries maybe not be binary compatible with KDE Neon.

It comes with 4 years of security, maintenance and standard support of all the packages and will be supported until April 2023.

Funding
SuperX is a self-funded project of Libresoft Technology Pvt. Ltd. In 2017, Libresoft Technology Pvt. Ltd. and Assam Electronics Development Corporation Ltd. (AMTRON), the nodal agency for Government of Assam, signed a Memorandum of Understanding to distribute and deploy SuperX across the state of Assam, giving Libresoft the contract for paid support services.

Application Installation
SuperX is based on KDE Neon which in turn is based on Ubuntu 18.04, which mean its supports most applications available for Ubuntu 18.04 and also follows the same commands as Ubuntu. It also ships with support for snaps and flatpacks out of the box. SuperX also have its own Appstore which have a very nice and intuitive interface to install and remove apps. However the repositories of SuperX are not 100% sync with Neon due to difference in release cycle.

System requirements
The recommended minimum system requirements for a desktop installation are as follows:

Release history
The following is the release history for SuperX:

title: SuperX (Operating System)


text:
User:Partha Pratim Medhi/Sample page

Title : Voice bhawanipur

Voice bhawanipur Is A Music Label From Assam

Team : 1/Partha Pratim Medhi

.             2/Riki Days

3/Rahul Baishya

4/Rodali Medhi

5/Mandeep Das

6/Tanmoy Das

Join On Youtube : 2018

title: User:Partha Pratim Medhi/Sample page


text:
User:LjL/Italian vs Spanish

Difficulties of Italian

 * Verbs "essere" and "avere" are used as auxiliaries of other verbs for composite tenses in a way that's not intuitive at all, and for a few verbs you just have to know it, there is no clear "reason". Spanish always uses "haber".
 * Plurals are a little harder: -a becomes -e, -o becomes -i, -e becomes -i, words ending in accented vowels or consonants don't change... with exceptions. Spanish is always just -s (if ending in vowel) or -es (if ending in consonant). Additionally, plurals in -ci vs -chi and -gi vs -ghi can often seem arbitrary: "amico" (friend) becomes "amici", but "carico" (charge, load) becomes "carichi".
 * There are more definite articles, dependings on what sounds the following words starts with, in non-trivial ways: il, lo, l', la, i, gli, le. Spanish just has el, los, la, las.
 * There are some verbal clitics that are non-obvious: ne (roughly "of it", or "about it"), ci/vi (can be "us", but also "here", "there", but sometimes also "about it" like "ne", confusingly: for example, "cosa ne pensi?" = "what do you think about it?", but "ci penso" = "I'll think about it"), and they combine in more complex ways (gli/le + ne = "gliene"). Catalan is similar but even worse. Spanish just has lo(s), la(s), le(s), which of course also exist in Italian anyway.
 * Orthography is less transparent: you can't know where the stress of a word lies if you read it written (except in a few limited cases), while in Spanish, stress is always marked (even when there isn't an accent mark on a word, stress is completely predictable). "Ce" vs "cie" and "gi" vs "gie" can be arbitrary (e.g. "ciechi" = "blind people", "cechi" = "Czech people", with identical pronunciation; "scienza" could be written "scenza", just like "scemo" is, with identical pronunciatio of "sce" vs "scie" as /ʃe/). "Gli" as a word is pronounced with /ʎ/ but "glicine" is pronounced with /gl/. Not a big deal, but "ch" being /k/ tends to confuse people, since "ch" often indicates /tʃ/ in other languages, while Italian indicates it with "ci" or "ce" (or more specifically, with the lack of an "h" in the middle). The Spanish system is more intuitive for Englishs peakers.
 * There are more vowels: 7 vs the 5 of Spanish, although they go back to 5 in unstressed syllables. They are not typically distinguished in the orthography (except at the end of words or in some monosyllables, like "è" vs "sé"). Regional accents vary widely in the way they combine è/é and ò/ó, but despite that, if you pronounce them "like a foreigner", that will still be perceived as foreign. Depending on your native language, it may be easy to confuse "é" with "i", and "ó" with "u".

Difficulties of Spanish

 * The orthography is probably better than Italian's but it does have its own pitfalls: "je" and "ge" sound the same so you have to know which to use in a word ("jefe" vs "general", both have /x/); initial "h" is always silent and it's present in a lot more words than in Italian (which basically just has it in some forms of the verb "avere", while Spanish has words like "huevo", "horno" pronounced the same as *"uevo", *"orno"); you do have to learn the rules for when to put an accent mark or not, although the whole accent mark thing makes figuring out stress easier than in Italian. If you're learning a "seseo" accent, "ci"/"ce" and "si"/"se" have the same pronunciation, so you must learn how to write them; same with "yeismo", where "y" and "ll" will have the same sound.
 * The phonology is also trickier, with many allophones, like "b"/"v" sounding like /b/ or /β/ depending not on the spelling, but on the phonological context; similarly with /ɡ/ vs /ɣ/ and /d/ vs /ð/. Spanish has more unusual sounds (statistically over the world's languages) than Italian, with /θ/, if non-seseo, and /ð/ (although these aren't a problem for English speakers), and /x/, /ɣ/ (which can definitely be a problem for English speakers).
 * "Ser" and "estar" are used in a way that's very non-intuitive for English speakers, and sometimes arbitrary. While both verbs also exist in Italian, their distribution is more predictable, with "essere" being used for most things, and "stare" being relegated to continuous form "sto facendo" vs "estoy haciendo" (I am doing) and frozen form like "sto bene" (I'm well).
 * There are some unusual, but not very difficult, grammatical rules like having to use the article "lo" only in front of adjective used as noun ("lo bueno" means "the good", as in "the good for mankind", with "el bueno" meaning "the good [person] instead); another is having to use "a" for direct objects that are animate (people), but not "things".

Difficulties in common

 * Arbitrary genders; this is easy, many other IE languages have it, but still, you have to learn them, especially for words ending in consonant (in Spanish) or in -e (in Italian), which can easily be masculine or feminine. Nouns in -o and -a can have unexpected genders too ("la mano" feminine in both languages despite ending in -o, "l'astronauta"/"el astronauta" masculine despite ending in -a).
 * Complicated, often seemingly arbitrary, past tenses (both the simple and the composite past can hold surprises), even with verbs that are not very irregular. Actually irregular verbs are even worse, with widely different forms even in the various persons of simple present, and this type of irregular verbs contains a lot more elements than just English's "to be".

For now I'm tired of figuring out other ones...

title: User:LjL/Italian vs Spanish


text:
splain

Alternative forms

 * 'splain

Etymology 2
Partly from the preceding sense, partly from (after ).

Verb

 * 1)  To condescendingly explain something, often extensively, especially to someone that knows more about it; for example, to mansplain, whitesplain, etc.

title: splain


text:
Let expression

In computer science, a "let" expression associates a function definition with a restricted scope.

The "let" expression may also be defined in mathematics, where it associates a Boolean condition with a restricted scope.

The "let" expression may be considered as a lambda abstraction applied to a value. Within mathematics, a let expression may also be considered as a conjunction of expressions, within an existential quantifier which restricts the scope of the variable.

The let expression is present in many functional languages to allow the local definition of expression, for use in defining another expression. The let-expression is present in some functional languages in two forms; let or "let rec". Let rec is an extension of the simple let expression which uses the fixed-point combinator to implement recursion.

History
Dana Scott's LCF language was a stage in the evolution of lambda calculus into modern functional languages. This language introduced the let expression, which has appeared in most functional languages since that time.

The languages Scheme, ML, and more recently Haskell have inherited let expressions from LCF.

Stateful imperative languages such as ALGOL and Pascal essentially implement a let expression, to implement restricted scope of functions, in block structures.

A closely related "where" clause, together with its recursive variant "where rec", appeared already in Peter Landin's The mechanical evaluation of expressions.

Description
A "let" expression defines a function or value for use in another expression. As well as being a construct used in many functional programming languages, it is a natural language construct often used in mathematical texts. It is an alternate syntactical construct for a where clause.

In both cases the whole construct is an expression whose value is 5. Like the if-then-else the type returned by the expression is not necessarily Boolean.

A let expression comes in 4 main forms,

In functional languages the let expression defines functions which may be called in the expression. The scope of the function name is limited to the let expression structure.

In mathematics, the let expression defines a condition, which is a constraint on the expression. The syntax may also support the declaration of existentially quantified variables local to the let expression.

The terminology, syntax and semantics vary from language to language. In Scheme, let is used for the simple form and let rec for the recursive form. In ML let marks only the start of a block of declarations with fun marking the start of the function definition. In Haskell, let may be mutually recursive, with the compiler figuring out what is needed.

Definition
A lambda abstraction represents a function without a name. This is a source of the inconsistency in the definition of a lambda abstraction. However lambda abstractions may be composed to represent a function with a name. In this form the inconsistency is removed. The lambda term,
 * $$ (\lambda f.z)\ (\lambda x.y) $$

is equivalent to defining the function $$f$$ by $$f\ x = y$$ in the expression $$z$$, which may be written as the let expression;

 * $$\operatorname{let} f\ x = y \operatorname{in} z$$

The let expression is understandable as a natural language expression. The let expression represents the substitution of a variable for a value. The substitution rule describes the implications of equality as substitution.

Let definition in mathematics
In mathematics the let expression is described as the conjunction of expressions. In functional languages the let expression is also used to limit scope. In mathematics scope is described by quantifiers. The let expression is a conjunction within an existential quantifier.

 * $$ (\exists x E \land F) \iff \operatorname{let} x : E \operatorname{in} F $$

where E and F are of type Boolean.

The let expression allows the substitution to be applied to another expression. This substitution may be applied within a restricted scope, to a sub expression. The natural use of the let expression is in application to a restricted scope (called lambda dropping). These rules define how the scope may be restricted;

 * $$\begin{cases}

x \not \in \operatorname{FV}(E) \land x \in \operatorname{FV}(F) \implies \operatorname{let} x : G \operatorname{in} E\ F = E\ (\operatorname{let} x : G \operatorname{in} F)\\ x \in \operatorname{FV}(E) \land x \not \in \operatorname{FV}(F) \implies \operatorname{let} x : G \operatorname{in} E\ F = (\operatorname{let} x : G \operatorname{in} E)\ F\\ x \not \in \operatorname{FV}(E) \land x \not \in \operatorname{FV}(F) \implies \operatorname{let} x : G \operatorname{in} E\ F = E\ F \end{cases}$$

where F is not of type Boolean. From this definition the following standard definition of a let expression, as used in a functional language may be derived.
 * $$ x \not \in \operatorname{FV}(y) \implies (\operatorname{let} x : x = y \operatorname{in} z) = z[x := y] = (\lambda x.z)\ y $$

For simplicity the marker specifying the existential variable, $$x :$$, will be omitted from the expression where it is clear from the context.
 * $$ x \not \in \operatorname{FV}(y) \implies (\operatorname{let} x = y \operatorname{in} z) = z[x := y] = (\lambda x.z)\ y $$

Derivation
To derive this result, first assume,
 * $$ x \not \in \operatorname{FV}(L) $$

then
 * $$\begin{align}

L\ (\operatorname{let} x : x = y \operatorname{in} z) & \iff (\operatorname{let} x : x = y \operatorname{in} L\ z) \\ & \iff x = y \land L\ z \end{align}$$

Using the rule of substitution,
 * $$\begin{align}

& \iff x = y \land(L\ z)[x :=y]\\ & \iff x = y \land(L[x :=y]\ z[x :=y])\\ & \iff x = y \land L\ z[x :=y]\\ & \implies L\ z[x :=y] \end{align}$$ so for all L,
 * $$ L \operatorname{let} x : x = y \operatorname{in} z \implies L\ z[x :=y]$$

Let $$ L\ X = (X = K) $$ where K is a new variable. then,
 * $$ (\operatorname{let} x : x = y \operatorname{in} z) = K \implies z[x :=y] = K $$

So,
 * $$ \operatorname{let} x : x = y \operatorname{in} z = z[x :=y]$$

But from the mathematical interpretation of a beta reduction,
 * $$ (\lambda x.z)\ y = z[x :=y]$$

Here if y is a function of a variable x, it is not the same x as in z. Alpha renaming may be applied. So we must have,
 * $$ x \not \in \operatorname{FV}(y) $$

so,
 * $$ x \not \in \operatorname{FV}(y) \implies \operatorname{let} x : x = y \operatorname{in} z = (\lambda x.z)\ y$$

This result is represented in a functional language in an abbreviated form, where the meaning is unambiguous;
 * $$ x \not \in \operatorname{FV}(y) \implies (\operatorname{let} x = y \operatorname{in} z) = z[x := y] = (\lambda x.z)\ y $$

Here the variable x is implicitly recognised as both part of the equation defining x, and the variable in the existential quantifier.

No lifting from Boolean
A contradiction arises if E is defined by $$ E = \neg $$. In this case,
 * $$ x \not \in \operatorname{FV}(E) \land x \in \operatorname{FV}(F) \implies \operatorname{let} x : G \operatorname{in} E\ F = E\ (\operatorname{let} x : G \operatorname{in} F)$$

becomes,
 * $$ \operatorname{let} x : G \operatorname{in} \neg F = \neg\ (\operatorname{let} x : G

\operatorname{in} F)$$

and using,
 * $$ (\exists x E \land F) \iff \operatorname{let} x : E \operatorname{in} F $$

 * $$ (\exists x G \land \neg F) = \neg\ (\exists x G \land F)$$
 * $$ = (\exists x \neg G \lor \neg F)$$

This is false if G is false. To avoid this contradiction F is not allowed to be of type Boolean. For Boolean F the correct statement of the dropping rule uses implication instead of equality,
 * $$ x \not \in \operatorname{FV}(E) \land x \in \operatorname{FV}(F) \implies (\operatorname{let} x : G \operatorname{in} E\ F \to E\ (\operatorname{let} x : G \operatorname{in} F))$$

It may appear strange that a different rule applies for Boolean than other types. The reason for this is that the rule,
 * $$ (\exists x E \land F) \iff \operatorname{let} x : E \operatorname{in} F $$

only applies where F is Boolean. The combination of the two rules creates a contradiction, so where one rule holds, the other does not.

Joining let expressions
Let expressions may be defined with multiple variables,

 * $$ (\exists v \cdots \exists w \exists x E \land F) \iff \operatorname{let} v, \ldots ,w, x : E \operatorname{in} F $$

then it can be derived,
 * $$ x \not \in FV(E) \implies (\exists v \cdots \exists w \exists x E \land F) \iff (\exists v \cdots \exists w (E \land \exists x F)) $$

so,
 * $$ x \not \in FV(E) \implies (\operatorname{let} v, \ldots, w, x : E \land F \operatorname{in} L \equiv \operatorname{let} v, \ldots, w: E \operatorname{in} \operatorname{let} x : F \operatorname{in} L) $$

Laws relating lambda calculus and let expressions
The Eta reduction gives a rule for describing lambda abstractions. This rule along with the two laws derived above define the relationship between lambda calculus and let expressions.

Let definition defined from lambda calculus
To avoid the potential problems associated with the mathematical definition, Dana Scott originally defined the let expression from lambda calculus. This may be considered as the bottom up, or constructive, definition of the let expression, in contrast to the top down, or axiomatic mathematical definition.

The simple, non recursive let expression was defined as being syntactic sugar for the lambda abstraction applied to a term. In that definition,

 * $$(\operatorname{let}_s x = y \operatorname{in} z) \equiv (\lambda x.z)\ y $$

The simple let expression definition was then extended to allow recursion using the fixed-point combinator.

Fixed-point combinator
The fixed-point combinator may be represented by the expression,

 * $$ \lambda f.\operatorname{let} x = f\ x \operatorname{in} x $$

This representation may be converted into a lambda term. A lambda abstraction does not support reference to the variable name, in the applied expression, so x must be passed in as a parameter to x.
 * $$ \lambda f.\operatorname{let} x\ x = f\ (x\ x) \operatorname{in} x\ x $$

Using the eta reduction rule,
 * $$f\ x = y \equiv f = \lambda x.y $$

gives,
 * $$ \lambda f.\operatorname{let} x = \lambda x.f\ (x\ x) \operatorname{in} x\ x $$

A let expression may be expressed as a lambda abstraction using,
 * $$ n \not \in FV(E) \to (\operatorname{let} n = E \operatorname{in} L \equiv (\lambda n.L)\ E) $$

gives,
 * $$ \lambda f.(\lambda x.x\ x)\ (\lambda x.f\ (x\ x)) $$

This is possibly the simplest implementation of a fixed point combinator in lambda calculus. However one beta reduction gives the more symmetrical form of Curry's Y combinator.
 * $$ \lambda f.(\lambda x.f\ (x\ x))\ (\lambda x.f\ (x\ x))$$

Recursive let expression
The recursive let expression called "let rec" is defined using the Y combinator for recursive let expressions.

 * $$(\operatorname{let\ rec} x = y \operatorname{in} z) \equiv (\lambda x.z)\ (Y\ (\lambda x.y)) $$

Mutually recursive let expression
This approach is then generalized to support mutual recursion. A mutually recursive let expression may be composed by rearranging the expression to remove any and conditions. This is achieved by replacing multiple function definitions with a single function definition, which sets a list of variables equal to a list of expressions. A version of the Y combinator, called the Y* poly-variadic fix-point combinator is then used to calculate fixed point of all the functions at the same time. The result is a mutually recursive implementation of the let expression.

Multiple values
A let expression may be used to represent a value that is a member of a set,
 * $$ \operatorname{let} x \in X \operatorname{in} x $$

Under function application, of one let expression to another,
 * $$\begin{align}

& (\operatorname{let} x \in X \operatorname{in} x)\ (\operatorname{let} y \in Y \operatorname{in} y) \\ & = \operatorname{let} x \in X \land y \in Y \operatorname{in} x\ y \\ & = \operatorname{let} (x, y) \in X \times Y \operatorname{in} x\ y \end{align}$$

But a different rule applies for applying the let expression to itself.
 * $$\begin{align}

& (\operatorname{let} x \in X \operatorname{in} x)\ (\operatorname{let} x \in X \operatorname{in} x) \\ & = \operatorname{let} x \in X \operatorname{in} x\ x \end{align}$$

There appear no simple rule for combining values. What is required is a general form of expression that represents a variable whose value is a member of a set of values. The expression should be based on the variable and the set.

Function application applied to this form should give another expression in the same form. In this way any expression on functions of multiple values may be treated as if it had one value.

It is not sufficient for the form to represent only the set of values. Each value must have a condition that determines when the expression takes the value. The resulting construct is a set of pairs of conditions and values, called a "value set". See narrowing of algebraic value sets.

Rules for conversion between lambda calculus and let expressions
Meta-functions will be given that describe the conversion between lambda and let expressions. A meta-function is a function that takes a program as a parameter. The program is data for the meta-program. The program and the meta program are at different meta-levels.

The following conventions will be used to distinguish program from the meta program,
 * Square brackets [] will be used to represent function application in the meta program.
 * Capital letters will be used for variables in the meta program. Lower case letters represent variables in the program.
 * $$ \equiv $$ will be used for equals in the meta program.

For simplicity the first rule given that matches will be applied. The rules also assume that the lambda expressions have been pre-processed so that each lambda abstraction has a unique name.

The substitution operator is also used. The expression $$ L[G := S] $$ means substitute every occurrence of G in L by S and return the expression. The definition used is extended to cover the substitution of expressions, from the definition given on the Lambda calculus page. The matching of expressions should compare expressions for alpha equivalence (renaming of variables).

Conversion from lambda to let expressions
The following rules describe how to convert from a lambda expression to a let expression, without altering the structure.
 * 1) $$ \operatorname{de-lambda}[V] \equiv V $$
 * 2) $$ \operatorname{de-lambda}[M\ N] \equiv \operatorname{de-lambda}[M]\ \operatorname{de-lambda}[N] $$
 * 3) $$ \operatorname{de-lambda}[F = \lambda P.E] \equiv \operatorname{de-lambda}[F\ P = E] $$
 * 4) $$ \operatorname{de-lambda}[E = F] \equiv \operatorname{de-lambda}[E] = \operatorname{de-lambda}[F] $$
 * 5) $$ \operatorname{de-lambda}[(\lambda F.E) L] \equiv \operatorname{let-combine}[\operatorname{let} F : \operatorname{de-lambda}[F = L] \operatorname{in} E] $$
 * 6) $$ V \not \in \operatorname{FV}[\lambda F.E] \to \operatorname{de-lambda}[\lambda F.E] \equiv \operatorname{let-combine}[\operatorname{let} V : \operatorname{de-lambda}[V\ F = E] \operatorname{in} V] $$
 * 7) $$ V \ne W \to \operatorname{let-combine}[\operatorname{let} V : E \operatorname{in} \operatorname{let} W : F \operatorname{in} G] \equiv \operatorname{let} V, W : E \land F \operatorname{in} G $$
 * 8) $$ \operatorname{let-combine}[\operatorname{let} V : E \operatorname{in} F] \equiv \operatorname{let} V : E \operatorname{in} F $$

Rule 6 creates a unique variable V, as a name for the function.

Example
For example, the Y combinator,
 * $$\lambda f.(\lambda x.f\ (x\ x))\ (\lambda x.f\ (x\ x)) $$

is converted to,
 * $$\operatorname{let} p : p\ f = \operatorname{let} x : x\ q = f\ (q\ q) \operatorname{in} f\ (x\ x) \operatorname{in} p $$

Conversion from let to lambda expressions
These rules reverse the conversion described above. They convert from a let expression to a lambda expression, without altering the structure. Not all let expressions may be converted using these rules. The rules assume that the expressions are already arranged as if they had been generated by de-lambda.

 * 1) $$ \operatorname{get-lambda}[F, G\ V = E] = \operatorname{get-lambda}[F, G = \lambda V.E] $$
 * 2) $$ \operatorname{get-lambda}[F, F = E] = \operatorname{de-let}[E] $$
 * 3) $$ \operatorname{de-let}[\lambda V.E] \equiv \lambda V.\operatorname{de-let}[E] $$
 * 4) $$ \operatorname{de-let}[M\ N] \equiv \operatorname{de-let}[M]\ \operatorname{de-let}[N] $$
 * 5) $$ \operatorname{de-let}[V] \equiv V $$
 * 6) $$ V \not \in FV[\operatorname{get-lambda}[V, E]] \to \operatorname{de-let}[\operatorname{let} V : E \ \operatorname{in} V] \equiv \operatorname{get-lambda}[V, E]  $$
 * 7) $$ V \not \in FV[\operatorname{get-lambda}[V, E]] \to \operatorname{de-let}[\operatorname{let} V : E \ \operatorname{in} L] \equiv (\lambda V.\operatorname{de-let}[L])\ \operatorname{get-lambda}[V, E] $$
 * 8) $$ W \not \in \operatorname{FV}[\operatorname{get-lambda}[V, E]] \to \operatorname{de-let}[\operatorname{let} V, W : E \land F \ \operatorname{in} G] \equiv \operatorname{de-let}[\operatorname{let} V : E \ \operatorname{in} \operatorname{let} W : F \ \operatorname{in} G] $$
 * 9) $$ V \in \operatorname{FV}[\operatorname{get-lambda}[V, E]] \to \operatorname{de-let}[\operatorname{let} V : E \ \operatorname{in} L] \equiv \operatorname{de-let}[\operatorname{let} V : V\ V = \operatorname{get-lambda}[V, E][V:=V\ V] \ \operatorname{in} L[V:=V\ V]] $$
 * 10) $$ W \in \operatorname{FV}[\operatorname{get-lambda}[V, E]] \to \operatorname{de-let}[\operatorname{let} V, W : E \land F \ \operatorname{in} L] \equiv \operatorname{de-let}[\operatorname{let} V: V\ W = \operatorname{get-lambda}[V, E][V:=V\ W] \ \operatorname{in} \operatorname{let} W: F[V:=V\ W] \ \operatorname{in} L[V:=V\ W]] $$

There is no exact structural equivalent in lambda calculus for let expressions that have free variables that are used recursively. In this case some addition of parameters is required. Rules 8 and 10 add these parameters.

Rules 8 and 10 are sufficient for two mutually recursive equations in the let expression. However they will not work for three or more mutually recursive equations. The general case needs an extra level of looping which makes the meta function a little more difficult. The rules that follow replace rules 8 and 10 in implementing the general case. Rules 8 and 10 have been left so that the simpler case may be studied first.

& \equiv \operatorname{de-let}[\operatorname{let} V \ldots W: \operatorname{sub-vars}[L, S, X] \ \operatorname{in} \operatorname{let} \operatorname{sub-vars}[\operatorname{lambda-form}[F], S, X] \ \operatorname{in} \operatorname{sub-vars}[G, S, X]] \end{align}$$
 * 1) lambda-form - Convert the expression into a conjunction of expressions, each of the form variable = expression.
 * 2) $$ \operatorname{lambda-form}[G\ V = E] = \operatorname{lambda-form}[G = \lambda V.E] $$
 * 3) $$ \operatorname{lambda-form}[E \land F] = \operatorname{lambda-form}[E] \land \operatorname{lambda-form}[F] $$
 * 4) $$ \operatorname{lambda-form}[V = E] = V = E $$ ...... where V is a variable.
 * 5) lift-vars - Get the set of variables that need X as a parameter, because the expression has X as a free variable.
 * 6) $$ X \in \operatorname{FV}[E] \to \operatorname{lift-vars}[X, V = E] = \{V\} $$
 * 7) $$ X \not \in \operatorname{FV}[E] \to \operatorname{lift-vars}[X, V = E] = \{\} $$
 * 8) $$ \operatorname{lift-vars}[X, E \land F] = \operatorname{lift-vars}[X, E] \cup \operatorname{lift-vars}[X. F] $$
 * 9) sub-vars - For each variable in the set substitute it for the variable applied to X in the expression.  This makes X a variable passed in as a parameter, instead of being a free variable in the right hand side of the equation.
 * 10) $$ \operatorname{sub-vars}[E, \{V\} \cup S, X] = \operatorname{sub-vars}[E[V:=V\ X], S, X] $$
 * 11) $$ \operatorname{sub-vars}[E, \{\}, X] = E $$
 * 12) de-let - Lift each condition in E so that X is not a free variable on the right hand side of the equation.
 * 13) $$\begin{align} L &= \operatorname{lambda-form}[E] \land S = \operatorname{lift-vars}[X, L] \to \operatorname{de-let}[\operatorname{let} V \ldots W, X : E \land F \ \operatorname{in} G] \\

Examples
For example, the let expression obtained from the Y combinator,
 * $$\operatorname{let} p : p\ f = \operatorname{let} x : x\ q = f\ (q\ q) \ \operatorname{in} f\ (x\ x) \ \operatorname{in} p $$

is converted to,
 * $$\lambda f.(\lambda x.f\ (x\ x))\ (\lambda q.f\ (q\ q)) $$

For a second example take the lifted version of the Y combinator,
 * $$\operatorname{let}p, q : p\ f\ x = f\ (x\ x) \land q\ p\ f = (p\ f)\ (p\ f) \ \operatorname{in} q\ p $$

is converted to,
 * $$ (\lambda p.(\lambda q.q\ p)\ \lambda p.\lambda f.(p\ f)\ (p\ f))\ \lambda f.\lambda x.f\ (x\ x) $$

For a third example the translation of,
 * $$ \operatorname{let} x: x\ f = f\ (x\ f) \ \operatorname{in} x $$

is,
 * $$ (\lambda x.x\ x)\ (\lambda x.\lambda f.f\ (x\ x\ f)) $$

For a forth example the translation of,
 * $$ \operatorname{let} x: x = f\ x \ \operatorname{in} x $$

is,
 * $$ (\lambda x.x\ x)\ (\lambda x. f\ (x\ x)) $$

which is the famous y combinator.

Key people

 * Dana Scott

title: Let expression


text:
Kibbey

Kibbey is a surname. Notable people with the surname include:

 * Ephraim Kibbey (1754/1756–1809), American Revolutionary War soldier
 * Ilah Marian Kibbey (1883–1957), American genre and landscape painter
 * John Franklin Kibbey (1826-1900), American lawyer and politician
 * Joseph Henry Kibbey (1853–1924), American attorney and judge

title: Kibbey


text:
Vizcaíno-Serra Oak

The Vizcaíno-Serra Oak (also known as the Junípero Oak) was a large California live oak tree closely associated with Junípero Serra and the early history of Monterey, California. First described in 1602 by the explorer Sebastián Vizcaíno, it stood next to a creek in what is now Monterey State Historic Park. The tree was declared dead in 1904 and cut down in 1905. The preserved trunk and lower branches were erected in the grounds of the Cathedral of San Carlos Borromeo where they remained for most of the 20th century. Although the remains of the tree have since been removed, pieces of it are on display in local museums.

History
The tree once stood in a ravine whose creek flowed into the southern end of Monterey Bay. It was there that the Sebastián Vizcaíno expedition drew fresh water after entering the bay on December 3, 1602. On December 17, 1602 the Carmelite friars of the Vizcaíno expedition held a mass under the tree and Vizcaíno claimed Monterey for Spain. Vizcaíno also noted the tree in his descriptions of the bay for future expeditions. In 1769 Gaspar de Portolà led an expedition to find the bay and establish Monterey as a Spanish settlement. After initially failing to find it, he was successful in May 1770 after following Junípero Serra's suggestion to look for the large oak tree described by Vizcaíno. On June 3, 1770 bells were hung from the tree. Father Serra said a Mass in an arbor constructed under the tree and the military officers of the Portolà expedition unfurled the Spanish flag.

Although damaged by lightning in 1840, the tree continued to stand as a landmark until 1905. In 1903 workmen repairing a culvert near the tree had caused what later proved to be irreversible sea-water damage to its roots. William Randolph Hearst bought the plot of land on which the tree stood with the intention of asking Congress to cede further land to construct a memorial park around the tree and preserve it from future intrusions. However, in July 1904 the tree was declared dead, and a year later it was cut down and thrown into Monterey Bay. When Ramón Mestres, the pastor of the Cathedral of San Carlos Borromeo, discovered what had happened, he had the tree hauled out of the bay by local fishermen and brought to the grounds of the cathedral. With financial help from Harry Ashland Greene, the trunk and with some of its lower branches was preserved with crude oil and creosote and the parts which had been eaten away were filled with concrete. The remains of the tree were then erected on a pedestal in the gardens at the rear of the cathedral. A commemorative plaque was placed at its foot. The dedication reads:

"The Junipero Oak. At Monterey, June 3rd, 1770 the ceremony of taking possession of California for Spain was enacted by Father Junipero Serra under the shade of this tree, placed here for preservation by R.M. Mestres, H.A. Greene, 1905" Greene also commissioned local craftsmen to make chairs out of some of its branches, two of which he donated to the Native Sons of the Golden West. One of the chairs, owned by California State Parks, was exhibited at the Panama Pacific International Exposition and was on display at the Pacific Grove Museum of Natural History in 2015 and 2016.

In 1908, a granite Celtic cross with a bas-relief portrait of Junípero Serra sculpted by Douglas Tilden was erected near the original site of the tree by the art collector James A. Murray and is now a California Historical Landmark. Murray, who had made his fortune in the Montana mining industry, settled in Monterey in 1904. He took a keen interest in Monterey's history and owned one of the three paintings by Léon Trousset depicting Junípero Serra's first Mass beneath the oak tree. Murray's wife commissioned "The Passing of an Oak", a poem by Mary Sullivan Spence commemorating the tree. It was published in a limited edition in 1909.

The preserved tree eventually decayed beyond repair and was removed from the cathedral grounds, leaving only the plaque which had been placed beneath it in 1905. However pieces of the tree are on display at the San Carlos Cathedral Heritage Center and at the Carmel Mission museum.

In art
In 2015 a mural, commissioned by the city of Monterey and depicting what the tree might have looked like to Sebastián Vizcaíno in 1602, was erected along the Monterey Bay Coastal Recreation Trail. The 12-foot by 5-foot work is attached to a wall opposite Fisherman's Wharf. Its artist, scientific illustrator Stephanie Rozzo, based the painting on late 19th-century photographs of the tree and an 1876 drawing by Jules Tavernier.

Two other European artists who frequented Tavernier's art colony also painted the Vizcaíno-Serra Oak—Carl von Perbandt and Léon Trousset. In the 1870s Trousset created three romanticized depictions (two in oil and one in watercolor) of Junipero Serra celebrating Mass beneath the tree on June 3, 1770. Trousset's large-scale 1877 version, Father Serra Celebrates Mass at Monterey, is on display in the Carmel Mission museum. Another version is held by the California Historical Society.

title: Vizcaíno-Serra Oak


text:
Zheleznodorozhnaya Kazarma 519 km

Zheleznodorozhnaya Kazarma 519 km (Железнодорожная Казарма 519 км) is a rural locality (a station) in Rubtsovsky Selsoviet, Rubtsovsky District, Altai Krai, Russia. The population was 38 as of 2013.

title: Zheleznodorozhnaya Kazarma 519 km


text:
Brad Turner

Brad Turner may refer to:

 * Brad Turner (director), television director
 * Brad Turner (ice hockey) (born 1968), former AHL/NHL hockey player
 * Brad Turner, fictional character in the cartoon series M.A.S.K.
 * Brad Turner (musician), Canadian jazz trumpeter

title: Brad Turner


text:
Robotics/Types of Robots/Walkers

“In the early days of air travel, detractors used to argue that, if God had meant us to fly, he would have given us wings. Had he meant us to roll, he might also have given us wheels – but instead we, along with the great preponderance of land animals great and small, have wound up traveling on legs.”

Legs v. Wheels
Most man-made vehicles today travel on wheels and for good reason: wheels are much easier to construct and control. In today’s economy, they also tend to be much cheaper than their legged counterparts. However legs have distinct advantages over wheels. The biggest advantage is in transversability and efficiency. Legged robots have a unique ability to:

 * Isolate their body from terrain irregularities
 * Avoid undesirable footholds
 * Regulate their stability
 * Achieve energy efficiency

These advantages are very desirable in modern robotics, and therefore a lot of research is being put into creating robots that can walk. The most challenging task in designing a legged robot is to create a system that can generate the proper gait.

Dynamic v. Static
Locomotion techniques can be divided into two main categories: static and dynamic.

Robots that use static movement are always balanced; that is, their center of gravity is always within their ground contact base. While this technique has been successfully used to create many robots (included wheeled ones), it is more akin to wheeled movement than true dynamic walking and as such retains fewer of the advantages. While more adept at transversing uneven terrain than most wheeled robots, robots that use static walking are very inefficient as power is put into every movement. However, robots that use static walking are much easier to control than their dynamic counterparts and thus often more viable.

Dynamic walking is characterized in that the robot is not always in balance. Many robots that use dynamic walking are continually “falling” and thus much more energy efficient. Dynamic walking requires much more complex control systems in order to not fall. Robots utilizing dynamic walking cannot use the same motions at different speeds to attain different speeds of movement, but must use entirely different motions at different speeds. However, dynamic walking can achieve many more advantages over wheeled locomotion. Dynamic walking is found very abundantly in nature.

A subset of dynamic walking is called passive dynamic movement. Most dynamic walking systems use active control to move the legs to the correct orientations for walking (hence active dynamic walking). Passive dynamic walking is characterized by a system where “gravity and inertia alone generate the locomotion pattern.” Passive dynamic movement can be achieved with maximum efficiency, as the vehicle uses its own forward momentum to propagate its next movement. Very little energy is lost from the system. Most of the concepts of passive dynamic walking and research conducted in the field was done by aeronautical engineer Tad McGeer between 1988 and 1992.

More Than Four
Many different walking robots have been developed that use six or more legs. This is due to the fact that a robot using this many legs can be controlled with static walking techniques rather than dynamic walking. Most of the walking techniques can be demonstrated sufficiently using the six legged model:

Wave Gait

 * 1) Six legged robot in neutral position
 * 2) Front pair of legs move forward
 * 3) Second pair of legs move forward
 * 4) Third pair of legs move forward
 * 5) Body follows legs forward

Tripod Gait

 * 1) Six legged robot in neutral position
 * 2) Alternating legs move forward on either side
 * 3) All other legs move forward
 * 4) Body follows legs forward

Most robots using six or more legs use a variation of one of these two gait models.

Four Legs
A system on four legs is another walking scheme found readily in nature. Four legged robots have the advantage of being statically stable when not moving, but require dynamic walking control. There are many different ways for a four legged robot to walk including alternating pairs and opposite pairs as in six legged robots. However these techniques now cease to be statically stable and thus require dynamic control.

Boston Dynamics has developed a four legged robot for DARPA (Defense Advanced Research Projects Agency) called “Big Dog,” that they claim is “the most advanced quadruped robot on earth.” Big Dog can run at four miles per hour, climb thirty five degree slopes, and carry 340 pounds. But the most impressive feature is its dynamic walking: Big Dog can recover from slipping and even being pushed. Its behavior is such that it approaches the infamous “uncanny valley” (http://en.wikipedia.org/wiki/Uncanny_Valley). The Boston Dynamics website (http://bostondynamics.com/content/sec.php?section=BigDog) features a video demonstration of Big Dog’s abilities.

Three Legs
Three legged robots are not very common, especially since they have no biological counterparts. However, researchers at Virginia Tech’s RoMeLa lab have developed a three legged robot STriDER that uses a “revolutionary” passive dynamic walking technique. STriDER is short for Self-excited Tripedal Dynamic Experimental Robot. STriDER sways until it can lift one leg, and using the other two as an A-frame, swing it in between the other two “stance” legs moving forward at a sixty degree angle. This patent pending “tripedal gait” is extremely energy efficient and requires minimal control. It also allows STriDER to easily change directions by changing the sequence of its steps. A video posted by the development team can be found at http://www.youtube.com/watch?v=7XsaJwKKBYo&feature=related.

Two Legs
Two legged robots have probably seen the most development dollars since humanoid robots have been envisioned since the very beginning of the field. Much of the development in passive dynamic walking has been done in this area. The design of a bipedal passive dynamic walker begins with the concept of a wheel with spokes. If the wheel is divided into sections, and all but two removed, we have what appears to be a set of legs. When the mass is properly distributed, the legs each act as inverted pendulums and the robots “rolls” through its steps.

Further complexity can be added to the model by using knee joints to shorten the legs (allowing one to swing past the other without touching the ground) and ankle joints that can provide a “spring” to the step to add lost energy back into the system. For a more in-depth explanation of passive dynamics walking visit http://www-personal.umich.edu/~artkuo/Passive_Walk/passive_walking.html.

There are several robots that have used these concepts to achieve firsts in the field of robotics. “RunBot,” developed in Germany and Scotland, broke the speed record per size for a robot in April 2006 by walking at 3.5 leg-lengths per second. The Cornell Ranger, while not truly passive, is passive inspired and one of many robots that has more than two legs but is still classified as bipedal. When viewed from the side, Ranger appears to have only two legs, but it actually has four legs. These four legs act in pairs of two, qualifying it as bipedal but providing better lateral stability. On April 3, 2008 Ranger walked 9.07 kilometers without stopping, an unofficial record at that time (it has since been surpassed, according to the Cornell team, by Boston Dynamic’s Big Dog).

One of the most successful companies at building bipedal robots over the years has been Honda. Their most recent model, ASIMO, is one of the few bipedal robots that appears humanoid, can climb stairs, and carries its own power supply. ASIMO can also change its gait in real time using Honda’s i-WALK technology. This allows ASIMO to continuously change speeds and direction. The robot can walk up stairs and run up to four miles per hour.

One Leg
1980 and 1993 there was a lot of research in making one legged robots at the Massachusetts Institute of Technology (MIT). The MIT lab turned out a series of “MIT hoppers” that could balance themselves and traverse a path. The biggest challenge with the hoppers was that they could not stand still; they needed to continue hopping in order to maintain their balance. Researchers were able to build a 3-D One-Leg Hopper that “hopped in place, traveled at a specific rate, followed simple paths, and maintained balance when disturbed.” They also constructed a hopper named Uniroo that used an actuated tail to maintain its balance.

title: Robotics/Types of Robots/Walkers


text:
Race: Science's Last Taboo

Race: Science's Last Taboo is a season of five British television programmes about race, broadcast on Channel 4 in 2009. In promotion of the series, Channel 4 doctored images of famous individuals, such as Margaret Thatcher, The Beatles, Usain Bolt and Barack Obama, to change their racial appearances.

Programmes
Race and Intelligence: Science's Last Taboo Journalist Rageh Omaar speaks with various scientists to discuss whether race and intelligence are linked.

Bleach, Nip, Tuck: The White Beauty Myth A two-part episode that looks at the increasing trend for people to "de-racialise" their body through cosmetic surgery.

The Event: How Racist Are You? A grade-school exercise called "Blue eyes/Brown eyes", devised by Jane Elliott in the 1960s, is recreated using members of the British public to draw attention to racism.

The Human Zoo: Science's Dirty Secret A history of the human zoo, which were popular in the late 19th-early 20th centuries.

Is It Better to Be Mixed Race? Aarathi Prasad looks at whether this is a genetic advantage to being mixed race.

Controversy
"Race and Intelligence: Science's Last Taboo", the first episode of the series, caused controversy when scientists such as Richard Lynn and J. Philippe Rushton claimed in interview that Africans were less intelligent than white people and East-Asians a little more, with a mean I.Q above the white mean. The production of the programme had been inspired by similar comments made by the Nobel prize James Watson, who was advised not to participate.

title: Race: Science's Last Taboo


text:
Whitshed Keene

Whitshed Keene (c. 1731–1822) was an Irish soldier in the British Army and a politician who sat in the House of Commons for 50 years between 1768 and 1818. Keene was born in Ireland, the son of Captain Gilbert Keene and his wife Alice Whitshed, daughter of Thomas Whitshed of Dublin, serjeant-at-law. He was educated at Trinity College, Dublin and was awarded BA in 1750. He joined the army and was lieutenant in the 5th Foot in 1754, captain in 1756 and major in 1762. He served as lieutenant colonel and then colonel in the Portuguese army. He then went to Paris, and attached himself to Stephen Fox the brother of Charles James Fox. He soon became acquainted with Lord Hertford, then ambassador, and became his master of the horse and gradually his intimate dependant. He retired from the army in 1768. He married Elizabeth Legge, daughter of George, Viscount Lewisham on 1 August 1771.

Keene was elected Member of Parliament for Wareham at a by-election in November 1768. In 1772 he became Secretary to the Lord Chamberlain, a post he held until March 1782. In 1774, when he was appointed to the Board of Trade, he was required to undergo re-election but having resigned at Wareham, he was then re-elected at Ludgershall  where he sat for 6 months. He seems never to have spoken in the Parliament of 1768–1774.

At the 1774 general election Keene was returned unopposed at Montgomery on the Powis interest. He was returned there for a total of 44 years by three successive members of the Powis-Clive family. In June 1777 he was removed from the Board of Trade to succeed Thomas Worsley as surveyor general at the Board of Works. It was believed that Worsley could scarcely outlive the day, but he lived on until December 1778. Keene took up hs post in January 1779 and was paid £2,000 from secret service funds for his loss of salary etc. of the Board of Trade and election expenses.

In 1780 an opposition to Keene was intended at Montgomery but the neighbouring country gentleman who was proposed never materialized, and Keene's election was once more unopposed. He made his first speech on record on 28 April 1780 when he was on his legs three quarters of an hour, giving a full account of the Board of Works, and a detail of works done by it. On the fall of Lord North in March 1782 he lost his positions but was re-appointed secretary to the Lord Chamberlain and made a Lord of the Admiralty in the Coalition Government in April 1783. He lost both places when the coalition was dismissed in December 1783. The few interventions by him in the 1784-1790 parliament all refer to the work of that Board or of the Lord Chamberlain's office. Keene continued to sit for Montgomery for the rest of his parliamentary life on the interest of the Earls of Powis and was returned unopposed in 1784, 1790 and 1796. They could count on his loyalty and ensured his return in the only contest he faced in 1802. He took a very active part in parliament in his later years speaking on various topics until 1816. From then he made no mark in the House and retired in 1818. He died on 27 February 1822 aged 90.

title: Whitshed Keene


text:
Template:Kosovo women's football updater/doc

This template provides a semi-automated system for updating the current leagues and previous season performance of football clubs in Kosovo.

Please only update this at the end of each season.

In order to reduce its size, it uses a list of leagues at KVXs.


text:
Portal:Cosmology

A course within the Institute of Astrophysics and the School of Physics

Cosmology is the scientific study of the nature and evolution of the Universe as a whole. A great amount of information in cosmology comes from the study of the Cosmic Microwave Background (CMB), a homogeneous electromagnetic radiation source from the big bang.

Courses

 * Cosmology

Wikipedia

 * Cosmology
 * Cosmic microwave background
 * Physical cosmology
 * Boltzmann brain

title: Portal:Cosmology


text:
Ella Emhoff

Ella Rose Emhoff (born May 29, 1999) is an American model, artist, and fashion designer. As the daughter of U.S. Second Gentleman Doug Emhoff and stepdaughter of U.S. Vice President Kamala Harris, she is a member of the Second Family of the United States.

Early life
Emhoff was born to Douglas Emhoff, an entertainment lawyer, and Kerstin Emhoff (née Mackin), a film producer. She was named after the jazz singer Ella Fitzgerald. Although her father is of Ashkenazi Jewish descent, a spokesperson for Emhoff clarified that Ella does not identify as Jewish. She has an older brother, Cole. Her parents divorced in 2008. In August 2014, her father married Kamala Harris, a lawyer who was then serving as the Attorney General of California. Emhoff and her brother coined the term "Momala" for their stepmother. Emhoff, whose family are members of the Democratic Party, was raised around politics. She and her family, as supporters of same-sex marriage in California, were active in fighting against the 2008 California Proposition 8. In 2016, her stepmother was elected to the United States Senate, representing California. In 2021, she became a member of the second family when her stepmother was sworn in as the Vice President of the United States.

Emhoff graduated from Wildwood School, where she was a member of the swimming and basketball teams, in 2018. She was a student at the Parsons School of Design in New York City, where she majored in fine arts with a concentrated focus in apparel and textiles, and she graduated in May 2021.

Career
In 2014, Emhoff made a cameo in the music video for Bo Burnham's song "Repeat Stuff".

Emhoff designs jackets, hats, coats, and knitted shorts, which she sells from her Instagram account and her website. She also sells ceramics, paintings, and drawings from her website.

In January 2021, Emhoff was signed with IMG Models worldwide, an international modelling agency based in New York City. She has gained attention from the BBC and the New York Times for having tattoos and not shaving her armpit hair. The agency announced her contract on Twitter. Earlier, she was featured in an editorial for the independent fashion magazine Buffalo Zine. Viola, her modeling agent, signed her to his agency in September 2019.

She is a member of The 3% Movement, an organization focused on increasing the number of women creative directors in the United States.

Personal life and public image

Emhoff lives in Bushwick, Brooklyn and has been called "The First Daughter of Bushwick". Her family has homes in Brentwood, Los Angeles; South of Market, San Francisco; and West End, Washington, D.C.

She is a supporter of LGBT rights, particularly as an advocate for the rights of transgender people. In 2020, she announced she would support the organization For the Gworls, a black, transgender-led collective that fundraises money to help black transgender people pay for rent, gender-affirming surgery, travel, and medical care.

Emhoff spoke in the broadcast of the 2020 Democratic National Convention in August 2020.

On January 20, 2021, Emhoff attended the 59th U.S. Presidential Inauguration in Washington, D.C., where her stepmother was sworn in as the 49th Vice President of the United States , Emhoff is dating GQ editor Sam Hine.

In November 2023, it was reported that she conducted a fund-raising campaign for Gaza during the ongoing Israel–Hamas war.

Fashion
Emhoff received international media attention at the inauguration due to her outfits, including a dress she co-designed with Batsheva Hay, and a jewel-encrusted Miu Miu coat. Vogue said that Emhoff's inauguration outfit "perfectly married her signature Brooklyn quirk with the solemnity of the occasion" and stated that "[Emhoff] wouldn't be hewing to any outdated notions of what a White House-adjacent young woman should dress like." After the inauguration, Emhoff's Instagram following increased from 50,000 followers to over 300,000 in less than a week. Fashion retailer Lyst reported that, after footage of Emhoff went viral on Twitter and TikTok, Miu Miu saw a 455% increase in internet searches six hours after the inauguration. She had also received attention for her skirt, tie, and Thom Browne coat she wore to the National COVID-19 Memorial in Washington, D.C., the night before the inauguration.

title: Ella Emhoff


text:
terzino

Etymology
From.

Noun

 * 1)  full-back or quarterback
 * 2)  a unit of measure corresponding to a third of a flask
 * 3)  a wood instrument intoned a minor third above the normal intonation

title: terzino


text:
Creating dynamic webpages

From the official document:
 * "This unit defines the competency required to build active or dynamic web pages."

Basically, that means ... (translate above into plain english)

You can read more about this unit on the National Training Information Systems Official document for ICAB5165A.

This unit forms part of the following qualifications:
 * Cert IV Websites Qualification in Australia

How this unit will help you
After learning and applying the skills required by this unit you'll be able to demonstrate your skills in:

 * translate the above elements and performance criteria into plain english and summarise here...

Ideas for learning the required skills
...

Ideas for demonstrating this unit
The best way to demonstrate these skills is ...

Grading
If you are demonstrating this unit as part of a formal course, you might find that the unit is graded (meaning you can not only demonstrate your competence, but can also gain a credit or distinction). Your facilitator may already have set criteria that your college uses. If not, here are some ideas for possible credit/distinction activities that you can discuss with your facilitator:

 * Creating and using custom PHP functions
 * Utilising PHP's built in session functionality
 * Advanced functionality such as a shopping cart
 * Integrating AJAX calls to your database for your website.

title: Creating dynamic webpages


text:
What is Tariffing?/VI

'''Q1. VI.'''

Ans

Demand is inelastic whenever the elasticity coefficient is less than modulars one. When it is greater than then the demand is called elastic.

title: What is Tariffing?/VI


text:
Zoo Tycoon DS

Zoo Tycoon DS is the Nintendo DS version of the business simulation game Zoo Tycoon. A sequel to the game, titled Zoo Tycoon 2 DS, was released in 2008.

Content
The graphics and gameplay are somewhat similar to the first Zoo Tycoon game, however, for the DS version, the terrain is in a grid format and does not blend smoothly with other terrain types like they do in the PC and Mac versions.

The objects and animals available in the game are also that of the first Zoo Tycoon game.

The game has two playing options, either tutorial/scenario or freeform. Tutorial/Scenario mode takes the player through many short games, each with a set goal, increasing in difficulty. Freeform lets players create a zoo free of time restrictions and goals.

Reception
Zoo Tycoon DS received mixed to poor reviews, with an average score of 44.96% on GameRankings and 44/100 on Metacritic, indicating "generally unfavorable reviews". Greg Mueller, reviewing Zoo Tycoon DS for GameSpot, disproved of the game's graphics, criticizing how "Of all the 50 animals [in the game], only a few of them actually have distinct looks. You'll see the same brownish blob move around using the same two or three frames of animation over and over, which just doesn't look natural at all.". Muller also criticized the near-complete lack of music and sound effects, remarking "You could play this game on mute without missing anything. You might be deprived of the sweeping noise maintenance workers make, but you can just grab a broom and make the noise yourself, which, incidentally, would probably be about as much fun as playing this game". Dan Adams of IGN also strongly detested the game, despairingly opening up his review with the words, while sending himself death threads; "Please kill me. I just want to die. Zoo Tycoon DS has sucked the will to live out of my eyeballs and left me with nothing but cramped hands. ... I can't remember the last time I saw such an ugly game with so many deficiencies." The most positive review came from Nintendo Power, who praised the game for "faithfully reproducing the Zoo Tycoon experience" on the Nintendo DS.

Zoo Tycoon DS received a "Platinum" sales award from the Entertainment and Leisure Software Publishers Association (ELSPA), indicating sales of at least 300,000 copies in the United Kingdom.

title: Zoo Tycoon DS


text:
Palazzo Barbarigo Nani Mocenigo

Palazzo Barbarigo Nani Mocenigo is a Gothic palace in Venice, Italy located in the Dorsoduro district, along the Nani embankment on the San Trovaso canal, near the Campo San Trovaso.

History
The palace dates to the 15th century and was the residence of the Barbarigo family. The building was part of the dowry that Elena Barbarigo, a daughter of Doge Agostino Barbarigo, brought to her husband Giorgio Nani. From them the palace passed to his son Bernardo, a founder of the family branch named di San Trovaso. In the first half of the 19th century, the San Trovaso branch died out, and the complex became the home of the distant relatives of Nani Mocenigo who previously lived in a building on the Cannaregio district.

Part of the building still belongs to this family, while the rest was purchased by the Ca' Foscari University, which made it the seat of the Department of Italian Studies, along with an adjoining library. Starting in 2007, the building remained empty for several years, sometimes being rented out to wealthy tourists or used for art events. , it houses the Hotel Nani Mocenigo Palace.

Architecture
The palace is a typical example of Venetian Gothic architecture of the 14-15th centuries. The square-shaped façade has three levels and a mezzanine. The ground floor offers two Gothic portals: the central one and the smaller one on the left. The two noble floors have central quadriforas supported by balustrades and flanked by pairs of ogival single-light windows. The first noble floor has a pair of coats of arms in the wings.

On the right side of the roof, there is a terrace overlooking the San Trovaso and Giudecca Canal area.

title: Palazzo Barbarigo Nani Mocenigo


text:
uurre

Etymology
From. Equivalent to.

Noun

 * 1) furrow, line deep wrinkle, such as in the skin of the face, especially on someone's forehead
 * 2) rut track worn in the ground, as from the passage of many wheels along a road
 * 3)  groove, striation scratch or gouge cut into bedrock by glacial abrasion
 * 1)  groove, striation scratch or gouge cut into bedrock by glacial abrasion

Etymology
From. Cognates include 🇨🇬 and 🇨🇬.

Noun

 * 1) groove

title: uurre


text:
Measurement (journal)

Measurement is a peer-reviewed scientific journal covering all aspects of metrology. It was established in 1983 and is published 18 times per year. It is published by Elsevier on behalf of the International Measurement Confederation and the editor-in-chief is Paolo Carbone (University of Perugia). According to the Journal Citation Reports, the journal has a 2021 impact factor of 5.131.

title: Measurement (journal)


text:
Wollerich

Wollerich is a restaurant located in Sint-Oedenrode, in the Netherlands. It is a fine dining restaurant that was awarded one Michelin star in the period 1997–2007 and 2010–present.

Gault Millau awarded the restaurant 17 out of 20 points.

Head chef of Wollerich is Gerard Wollerich.

In 2008, there was great consternation when the restaurant unexpectedly lost its Michelin star. This despite the high score in the Gault Millau. In 2010, the restaurant won its star back.

Wollerich is a member of Alliance Gastronomique Néerlandaise.

title: Wollerich


text:
Advanced Java/Java.util.List

A List is a subinterface of java.util.Collection that keeps its elements ordered (like an array) and allows duplicate elements (also like an array). In fact, the main difference between an array and a list is that arrays are fixed-width, but lists can grow and shrink on demand.

title: Advanced Java/Java.util.List


text:
Talk:Java Swings/Overview

Reorganized
I tried to reorganize the Swing topic so that it was more on par with the others -- ie, navigation boxes at the top of the pages, discrete pages instead of giant ones; hopefully I did alright. The content needs some serious work as well, but hopefully this was a step in the right direction :-)

title: Talk:Java Swings/Overview


text:
Akronym

Etymology
From. First attested in the early 1900s. The term was modelled after and, and the parts are ultimately derived from  and.

Noun

 * 1) acronym (word formed by initial letters)

title: Akronym


text:
User:Blathersknows/sandbox

Notes for NEPA

Topics to add:

 * 1) Violations cases
 * 2) Influence of Presidents through the years.
 * 3) Obama admin guidelines
 * 4) Trump admin deregulation of NEPA

Draft
NEPA has been the bedrock of

title: User:Blathersknows/sandbox


text:
Japanese/Lessons/Existence

When you want to say that something exists, there two verbs you have to choose from depending on whether the subject is an animate- or inanimate object. The difference is not quite living/non-living, as plants would be considered inanimate (as they don't move ... well, most only really slowly). A fish swimming in its fish-bowl would be an animate object, but a dead fish (whether at the fish-mongers or — let's hope not — in its bowl) would be in-animate.

 * For animate objects (humans and animals), use "いる" (polite present positive: "います").
 * For inanimate objects, use "ある" (polite present positive: "あります").

Note that these can denote both presence or possession.

In the dialogues below, you may replace "います" with "あります".

To ask about the presence of a particular animate object
If the animate object in question is not present but something else is, you can suggest this by saying:

Notice that this reply uses "は" instead of "が". The "は" particle can be translated as "as for such and such", while "が" directly marks the subject.

Vocabulary
か: "anything/something". も: "everything/nothing" (positive/negative depends on the verb)

title: Japanese/Lessons/Existence


text:
Gatley Park

Gatley Park is an English 17th-century park and country house lying near Leinthall Earls, Herefordshire. Both the park and the house are separately listed, the park as Grade II and the house as a Grade II* listed building.

Gatley Park house
The house was originally built for high court judge Sir Sampson Eure in the 1630s, but extended and restored between 1894 and 1907. It is built in brick with two storeys and an attic to a square plan later extended by attached wings. The roofs are of stone tiles with a central chimney stack of nine octagonal brick shafts,

Gatley Park
The park consists of a strip of land on the south side of a long ridge which slopes downwards from north to south into a small valley. The house stands in the centre of the strip at the foot of the ridge and is surrounded by gardens. The rest of the estate comprises ancient woodland and grassland with specimen trees.

In the 1960s a domed three-storey tower designed by Raymond Erith was built just outside the park as a folly and dower house. The interior was designed by John Beresford Fowler.

History
Gatley Park and the nearby manor of Leinthall Starkes once belonged to the Earl of March, reverting to the Crown on the accession of Edward IV. They were granted in the reign of Elizabeth I to merchant William Horne from whom they passed to the Croft family.

The Gatley estate was bought in 1632 from Sir William Croft by Sir Sampson Eure, who built the present house. On his death in 1659 with no surviving children the property was left to his widow, who died in 1673. It was acquired in 1679 by Philip Dunne and has descended in the Dunne family ever since.

The current owner is Philip Dunne, the MP for Ludlow.

title: Gatley Park