text:
Talk:Dijon

Wiki Education Foundation-supported course assignment
This article was the subject of a Wiki Education Foundation-supported course assignment, between 24 September 2018 and 6 December 2018. Further details are available on the course page. Student editor(s): AniiikaH.

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

Proposed Major Revision
The French Wikipedia page on Dijon has become quite splendid, well organized, fact checked, and full of information. It seems to me it could serve as the basis for an extensive augmentation of the present English page, if supplemented with a few details necessary for the understanding of English speakers. Both text and photos could be transferred.

Are there other bilingual editors who would like to participate in such an endeavor?

2A01:E35:2E06:77B0:648E:BDC8:CED4:CA9A (talk) 21:28, 16 May 2014 (UTC)

Timeline of Dijon
What is missing from the recently created city timeline article? Please add relevant content! Contributions welcome. Thank you. -- M2545 (talk) 21:26, 23 November 2015 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 one external links on Dijon. 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/20130705094933/http://www.completefrance.com/language-culture/twin-towns to http://www.completefrance.com/language-culture/twin-towns
 * Corrected formatting/usage for http://www.e-local.gob.mx/work/resources/prensa/01-07.htm#hidalgo2

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

Cheers.— InternetArchiveBot  (Report bug) 04:12, 13 December 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Dijon. 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/20091203211441/http://www.volgadmin.ru/EN2/Municipality/FriendlyRelationship.aspx to http://www.volgadmin.ru/EN2/Municipality/FriendlyRelationship.aspx

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

Cheers.— InternetArchiveBot  (Report bug) 17:58, 10 September 2017 (UTC)

title: Talk:Dijon


text:
Talk:Simulated consciousness

This page was previously redirecting to the artificial consciousness page, which presents philosophical arguments about the nature of consciousness in an artificial context. I am aiming that the simulated consciousness article should focus more on the engineering aspects of current and proposed robot and virtual implementations. There may be some overlap between the two topics (artificial vs simulated consciousnes), but I believe there is sufficient material, particularly in reporting researchers' efforts to produce useful simulations, for this to be a separate page. Matt Stan 09:37, 3 May 2004 (UTC)

Simulated vs Synthetic
I'm also interested in drawing appropriate distinctions between simulated consciousness and synthesised consciousness. Matt Stan 09:37, 3 May 2004 (UTC)

Direction of this article
In light of PSB's addition: "Artifacts exhibiting real consciousness, if that should ever be possible, would not be simulating consciousness, of course." My thesis, along, I believe, with mainstream researchers in this field, is that it will only be by making attempts to simulate consciousness that the holy grail of achieving actual machine consciousness might be done. There is, though, perhaps a semantic problem here in that simulations are only ever intended to be simulations, e.g. you don't expect a flight simulator actually to fly. Which is why perhaps the term synthetic consciousness would be better, reflecting the reality that it might be possible to achieve the required end result by different means from what is deemed natural. This, I think, is how the term synthetic is applied in drug manufacture: synthetic insulin is real insulin, but just not acquired from pigs' pancreases. Shall I switch round the main emphasis to synthetic consciousness and abandon simulated consciousness, as the latter now seems to be something of an anachronism? I think the application of Leibniz's law is particularly apt in this context. Matt Stan 07:55, 4 May 2004 (UTC)

Synthetic consciousness would make me happier in that, just as you say, it does not assume that the resulting consciousness is necessarily unreal. Synthetic means put together. It does not even imply the involvement of humans! It would also allow the removal of the rider added by me to the article's 1st para. Paul Beardsell 10:59, 4 May 2004 (UTC)

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

title: Talk:Simulated consciousness


text:
List of foreign ministers in 2004

This is a list of foreign ministers in 2004.

Africa

 * Algeria - Abdelaziz Belkhadem (2000–2005)
 * Angola - João Bernardo de Miranda (1999–2008)
 * Benin - Rogatien Biaou (2003–2006)
 * Botswana - Mompati Merafhe (1994–2008)
 * Burkina Faso - Youssouf Ouedraogo (1999–2007)
 * Burundi - Terence Sinunguruza (2001–2005)
 * Cameroon -
 * François Xavier Ngoubeyou (2001–2004)
 * Laurent Esso (2004–2006)
 * Cape Verde -
 * Fátima Veiga (2002–2004)
 * Víctor Borges (2004–2008)
 * Central African Republic - Charles Wénézoui (2003–2005)
 * Chad - Nagoum Yamassoum (2003–2005)
 * Comoros - Mohamed El-Amine Souef (2002–2005)
 * Republic of Congo - Rodolphe Adada (1997–2007)
 * Democratic Republic of Congo -
 * Antoine Ghonda (2003–2004)
 * Raymond Ramazani Baya (2004–2007)
 * Côte d'Ivoire - Bamba Mamadou (2003–2006)
 * Djibouti - Ali Abdi Farah (1999–2005)
 * Egypt -
 * Ahmed Maher (2001–2004)
 * Ahmed Aboul Gheit (2004–2011)
 * Equatorial Guinea - Pastor Micha Ondó Bile (2003–2012)
 * Eritrea - Ali Said Abdella (2000–2005)
 * Ethiopia - Seyoum Mesfin (1991–2010)
 * Gabon - Jean Ping (1999–2008)
 * The Gambia -
 * Baboucarr-Blaise Jagne (2001–2004)
 * Sidi Moro Sanneh (2004–2005)
 * Ghana - Nana Akufo-Addo (2003–2007)
 * Guinea -
 * François Lonseny Fall (2002–2004)
 * Mamady Condé (2004–2006)
 * Guinea-Bissau -
 * João José Monteiro (2003–2004)
 * Soares Sambu (2004–2005)
 * Kenya -
 * Kalonzo Musyoka (2003–2004)
 * Chirau Ali Mwakwere (2004–2005)
 * Lesotho -
 * Mohlabi Tsekoa (2002–2004)
 * Monyane Moleleki (2004–2007)
 * Liberia - Thomas Nimely (2003–2006)
 * Libya - Abdel Rahman Shalgham (2000–2009)
 * Madagascar - Marcel Ranjeva (2002–2009)
 * Malawi -
 * Lilian Patel (2000–2004)
 * George Chaponda (2004–2005)
 * Mali -
 * Lassana Traoré (2002–2004)
 * Moctar Ouane (2004–2011)
 * Mauritania - Mohamed Vall Ould Bellal (2003–2005)
 * Mauritius - Jaya Krishna Cuttaree (2003–2005)
 * Morocco - Mohamed Benaissa (1999–2007)
 * Western Sahara - Mohamed Salem Ould Salek (1998–2023)
 * Mozambique - Leonardo Simão (1994–2005)
 * Namibia -
 * Hidipo Hamutenya (2002–2004)
 * Marco Hausiku (2004–2010)
 * Niger - Aïchatou Mindaoudou (2001–2010)
 * Nigeria - Oluyemi Adeniji (2003–2006)
 * Rwanda - Charles Murigande (2002–2008)
 * São Tomé and Príncipe -
 * Mateus Meira Rita (2002–2004)
 * Óscar Sousa (2004)
 * Ovídio Manuel Barbosa Pequeno (2004–2006)
 * Senegal - Cheikh Tidiane Gadio (2000–2009)
 * Seychelles - Jérémie Bonnelame (1997–2005)
 * Sierra Leone - Momodu Koroma (2002–2007)
 * Somalia -
 * Yusuf Hassan Ibrahim (2002–2004)
 * Abdullahi Sheikh Ismail (2004–2006)
 * Somaliland - Edna Adan Ismail (2003–2006)
 * South Africa - Nkosazana Dlamini-Zuma (1999–2009)
 * Sudan - Mustafa Osman Ismail (1998–2005)
 * Swaziland - Mabili Dlamini (2003–2006)
 * Tanzania - Jakaya Kikwete (1995–2005)
 * Togo - Kokou Tozoun (2003–2005)
 * Tunisia -
 * Habib Ben Yahia (1999–2004)
 * Abdelbaki Hermassi (2004–2005)
 * Uganda -
 * James Wapakhabulo (2001–2004)
 * Tom Butime (2004–2005)
 * Zambia - Kalombo Mwansa (2002–2005)
 * Zimbabwe - Stan Mudenge (1995–2005)

Asia

 * Afghanistan - Abdullah Abdullah (2001–2006)
 * Armenia - Vartan Oskanian (1998–2008)
 * Azerbaijan -
 * Vilayat Guliyev (1999–2004)
 * Elmar Mammadyarov (2004–2020)
 * Nagorno-Karabakh -
 * Ashot Gulyan (2002–2004)
 * Arman Melikyan (2004–2005)
 * Bahrain - Sheikh Muhammad ibn Mubarak ibn Hamad Al Khalifah (1971–2005)
 * Bangladesh - Morshed Khan (2001–2006)
 * Bhutan - Khandu Wangchuk (2003–2007)
 * Brunei - Pengiran Muda Mohamed Bolkiah (1984–2015)
 * Cambodia - Hor Namhong (1998–2016)
 * China - Li Zhaoxing (2003–2007)
 * East Timor - José Ramos-Horta (2000–2006)
 * Georgia -
 * Tedo Japaridze (2003–2004)
 * Salome Zourabichvili (2004–2005)
 * Abkhazia -
 * Sergei Shamba (1997–2004)
 * Georgy Otyrba (acting) (2004)
 * Igor Akhba (2004)
 * Sergei Shamba (2004–2010)
 * South Ossetia - Murat Dzhioyev (1998–2012)
 * India -
 * Yashwant Sinha (2002–2004)
 * Natwar Singh (2004–2005)
 * Indonesia - Hassan Wirajuda (2001–2009)
 * Iran - Kamal Kharazi (1997–2005)
 * Iraq - Hoshyar Zebari (2003–2014)
 * Israel - Silvan Shalom (2003–2006)
 * Palestinian Authority - Nabil Shaath (2003–2005)
 * Japan -
 * Yoriko Kawaguchi (2002–2004)
 * Nobutaka Machimura (2004–2005)
 * Jordan -
 * Marwan al-Muasher (2002–2004)
 * Hani al-Mulki (2004–2005)
 * Kazakhstan - Kassym-Jomart Tokayev (2002–2007)
 * North Korea - Paek Nam-sun (1998–2007)
 * South Korea -
 * Yoon Young-kwan (2003–2004)
 * Ban Ki-moon (2004–2006)
 * Kuwait - Sheikh Mohammad Sabah Al-Salem Al-Sabah (2003–2011)
 * Kyrgyzstan - Askar Aitmatov (2002–2005)
 * Laos - Somsavat Lengsavad (1993–2006)
 * Lebanon -
 * Jean Obeid (2003–2004)
 * Mahmoud Hammoud (2004–2005)
 * Malaysia - Syed Hamid Albar (1999–2008)
 * Maldives - Fathulla Jameel (1978–2005)
 * Mongolia -
 * Luvsangiin Erdenechuluun (2000–2004)
 * Tsendiin Mönkh-Orgil (2004–2006)
 * Myanmar -
 * Win Aung (1998–2004)
 * Nyan Win (2004–2011)
 * Nepal -
 * Surya Bahadur Thapa (2003–2004)
 * Bhekh Bahadur Thapa (2004)
 * Sher Bahadur Deuba (2004–2005)
 * Oman - Yusuf bin Alawi bin Abdullah (1982–2020)
 * Pakistan - Khurshid Mahmud Kasuri (2002–2007)
 * Philippines -
 * Delia Albert (2003–2004)
 * Alberto Romulo (2004–2011)
 * Qatar - Sheikh Hamad bin Jassim bin Jaber Al Thani (1992–2013)
 * Saudi Arabia - Prince Saud bin Faisal bin Abdulaziz Al Saud (1975–2015)
 * Singapore -
 * S. Jayakumar (1994–2004)
 * George Yeo (2004–2011)
 * Sri Lanka -
 * Tyronne Fernando (2001–2004)
 * Lakshman Kadirgamar (2004–2005)
 * Syria - Farouk al-Sharaa (1984–2006)
 * Taiwan -
 * Eugene Chien (2002–2004)
 * Mark Chen (2004–2006)
 * Tajikistan - Talbak Nazarov (1994–2006)
 * Thailand - Surakiart Sathirathai (2001–2005)
 * Turkey - Abdullah Gül (2003–2007)
 * Turkmenistan - Raşit Meredow (2001–present)
 * United Arab Emirates - Rashid Abdullah Al Nuaimi (1980–2006)
 * Uzbekistan - Sodiq Safoyev (2003–2005)
 * Vietnam - Nguyễn Dy Niên (2000–2006)
 * Yemen - Abu Bakr al-Qirbi (2001–2014)

Australia and Oceania

 * Australia - Alexander Downer (1996–2007)
 * Fiji - Kaliopate Tavola (2000–2006)
 * French Polynesia -
 * Gaston Flosse (1991–2004)
 * Oscar Temaru (2004)
 * Gaston Flosse (2004–2005)
 * Kiribati - Anote Tong (2003–2016)
 * Marshall Islands - Gerald Zackios (2001–2008)
 * Micronesia - Sebastian Anefal (2003–2007)
 * Nauru -
 * René Harris (2003–2004)
 * David Adeang (2004–2007)
 * New Zealand - Phil Goff (1999–2005)
 * Cook Islands -
 * Robert Woonton (1999–2004)
 * Tom Marsters (2004–2005)
 * Niue - Young Vivian (2002–2008)
 * Palau - Temmy Shmull (2001–2009)
 * Papua New Guinea - Sir Rabbie Namaliu (2002–2006)
 * Samoa - Tuilaepa Aiono Sailele Malielegaoi (1998–2021)
 * Solomon Islands - Laurie Chan (2002–2006)
 * Tonga -
 * Prince 'Ulukalala Lavaka Ata (1998–2004)
 * Sonatane Tu'a Taumoepeau Tupou (2004–2009)
 * Tuvalu -
 * Saufatu Sopoanga (2002–2004)
 * Maatia Toafa (2004–2006)
 * Vanuatu -
 * Moana Carcasses Kalosil (2003–2004)
 * Barak Sopé (2004)
 * Marcellino Pipite (2004)
 * Sato Kilman (2004–2007)

Europe

 * Albania - Kastriot Islami (2003–2005)
 * Andorra - Juli Minoves Triquell (2001–2007)
 * Austria -
 * Benita Ferrero-Waldner (2000–2004)
 * Ursula Plassnik (2004–2008)
 * Belarus - Sergei Martynov (2003–2012)
 * Belgium -
 * Louis Michel (1999–2004)
 * Karel De Gucht (2004–2009)
 * Brussels-Capital Region - Guy Vanhengel (2000–2009)
 * Flanders -
 * Patricia Ceysens (2003–2004)
 * Geert Bourgeois (2004–2008)
 * Wallonia - Marie-Dominique Simonet (2004–2009)
 * Bosnia and Herzegovina - Mladen Ivanić (2003–2007)
 * Bulgaria - Solomon Passy (2001–2005)
 * Croatia - Miomir Žužul (2003–2005)
 * Cyprus - Georgios Iacovou (2003–2006)
 * Northern Cyprus -
 * Tahsin Ertuğruloğlu (1998–2004)
 * Serdar Denktaş (2004–2006)
 * Czech Republic - Cyril Svoboda (2002–2006)
 * Denmark - Per Stig Møller (2001–2010)
 * Greenland - Josef Motzfeldt (2003–2007)
 * Estonia - Kristiina Ojuland (2002–2005)
 * Finland - Erkki Tuomioja (2000–2007)
 * France -
 * Dominique de Villepin (2002–2004)
 * Michel Barnier (2004–2005)
 * Germany - Joschka Fischer (1998–2005)
 * Greece -
 * George Papandreou (1999–2004)
 * Tassos Giannitsis (acting) (2004)
 * Petros Molyviatis (2004–2006)
 * Hungary -
 * László Kovács (2002–2004)
 * Ferenc Somogyi (2004–2006)
 * Iceland -
 * Halldór Ásgrímsson (1995–2004)
 * Davíð Oddsson (2004–2005)
 * Ireland -
 * Brian Cowen (2000–2004)
 * Dermot Ahern (2004–2008)
 * Italy -
 * Franco Frattini (2002–2004)
 * Gianfranco Fini (2004–2006)
 * Latvia -
 * Sandra Kalniete (2002–2004)
 * Rihards Pīks (2004)
 * Helēna Demakova (acting) (2004)
 * Artis Pabriks (2004–2007)
 * Liechtenstein - Ernst Walch (2001–2005)
 * Lithuania - Antanas Valionis (2000–2006)
 * Luxembourg -
 * Lydie Polfer (1999–2004)
 * Charles Goerens (2004)
 * Jean Asselborn (2004–present)
 * Republic of Macedonia - Ilinka Mitreva (2002–2006)
 * Malta -
 * Joe Borg (1999–2004)
 * John Dalli (2004)
 * Michael Frendo (2004–2008)
 * Moldova -
 * Nicolae Dudău (2001–2004)
 * Andrei Stratan (2004–2009)
 * Transnistria - Valeriy Litskai (2000–2008)
 * Netherlands - Ben Bot (2003–2007)
 * Norway - Jan Petersen (2001–2005)
 * Poland - Włodzimierz Cimoszewicz (2001–2005)
 * Portugal -
 * Teresa Patrício de Gouveia (2003–2004)
 * António Monteiro (2004–2005)
 * Romania -
 * Mircea Geoană (2000–2004)
 * Mihai Răzvan Ungureanu (2004–2007)
 * Russia -
 * Igor Ivanov (1998–2004)
 * Sergey Lavrov (2004–present)
 * San Marino - Fabio Berardi (2003–2006)
 * Serbia and Montenegro -
 * Goran Svilanović (2000–2004)
 * Vuk Drašković (2004–2007)
 * Montenegro -
 * Dragiša Burzan (2003–2004)
 * Miodrag Vlahović (2004–2006)
 * Slovakia - Eduard Kukan (1998–2006)
 * Slovenia -
 * Dimitrij Rupel (2000–2004)
 * Ivo Vajgl (2004)
 * Dimitrij Rupel (2004–2008)
 * Spain -
 * Ana de Palacio y del Valle-Lersundi (2002–2004)
 * Miguel Ángel Moratinos (2004–2010)
 * Sweden - Laila Freivalds (2003–2006)
 * Switzerland - Micheline Calmy-Rey (2003–2011)
 * Ukraine - Kostyantyn Gryshchenko (2003–2005)
 * United Kingdom - Jack Straw (2001–2006)
 * Vatican City - Archbishop Giovanni Lajolo (2003–2006)

North America and the Caribbean

 * Antigua and Barbuda -
 * Lester Bird (1991–2004)
 * Harold Lovell (2004–2005)
 * The Bahamas - Fred Mitchell (2002–2007)
 * Barbados - Dame Billie Miller (1994–2008)
 * Belize - Godfrey Smith (2003-2003)
 * Canada -
 * Bill Graham (2002–2004)
 * Pierre Pettigrew (2004–2006)
 * Quebec - Monique Gagnon-Tremblay (2003–2008)
 * Costa Rica - Roberto Tovar Faja (2002–2006)
 * Cuba - Felipe Pérez Roque (1999–2009)
 * Dominica - Osborne Riviere (2001–2005)
 * Dominican Republic -
 * Frank Guerrero Prats (2003–2004)
 * Carlos Morales Troncoso (2004–2014)
 * El Salvador -
 * María Eugenia Brizuela de Ávila (1999–2004)
 * Francisco Laínez (2004–2008)
 * Grenada - Elvin Nimrod (2000–2008)
 * Guatemala -
 * Edgar Armando Gutiérrez Girón (2002–2004)
 * Jorge Briz Abularach (2004–2006)
 * Haiti -
 * Joseph Philippe Antonio (2001–2004)
 * Yvon Siméon (2004–2005)
 * Honduras - Leonidas Rosa Bautista (2003–2005)
 * Jamaica - Keith Desmond Knight (2001–2006)
 * Mexico - Luis Ernesto Derbez (2003–2006)
 * Netherlands Antilles - Etienne Ys (2004–2006)
 * Nicaragua - Norman José Caldera Cardenal (2002–2007)
 * Panama -
 * Harmodio Arias Cerjack (2003–2004)
 * Samuel Lewis Navarro (2004–2009)
 * Puerto Rico – Jose Izquierdo Encarnacion (2003–2005)
 * Saint Kitts and Nevis - Timothy Harris (2001–2008)
 * Saint Lucia -
 * Julian Hunte (2001–2004)
 * Petrus Compton (2004–2006)
 * Saint Vincent and the Grenadines - Louis Straker (2001–2005)
 * Trinidad and Tobago - Knowlson Gift (2001–2006)
 * United States - Colin Powell (2001–2005)

South America

 * Argentina - Rafael Bielsa (2003–2005)
 * Bolivia - Juan Ignacio Siles (2003–2005)
 * Brazil - Celso Amorim (2003–2011)
 * Chile -
 * Soledad Alvear (2000–2004)
 * Ignacio Walker Prieto (2004–2006)
 * Colombia - Carolina Barco (2002–2006)
 * Ecuador - Patricio Zuquilanda (2003–2005)
 * Guyana - Rudy Insanally (2001–2008)
 * Paraguay - Leila Rachid de Cowles (2003–2006)
 * Peru - Manuel Rodríguez Cuadros (2003–2005)
 * Suriname - Marie Levens (2000–2005)
 * Uruguay - Didier Opertti (1998–2005)
 * Venezuela -
 * Roy Chaderton (2002–2004)
 * Jesús Pérez (2004)
 * Alí Rodríguez Araque (2004–2006)

title: List of foreign ministers in 2004


text:
Yoav

Yoav (יואב) is a male given name popular among Israeli Jews. Its popularity is attributed to both Joab (יוֹאָב), commander of King David's army in the Hebrew Bible, and Yitzhak Dubno, a 1940s Palmach soldier whose codename was Yoav.

Yoav is also the namesake of two Israeli settlements: Yoav Regional Council (including Sde Yoav, a kibbutz) in the Southern District, named after Yitzhak "Yoav" Dubno; and Givat Yoav, a moshav in the Golan Heights, named after Israeli soldier Yoav Shaham who died during the Samu incident.

Notable people with the name Yoav include:
 * Yoav Avni (born 1969), Israeli author
 * Yoav Bear (born 1991), Israeli cyclist
 * Yoav Benjamini (born 1949), Israeli statistician
 * Yoav Ben-Tzur (born 1958), Israeli politician and acting Minister of Health
 * Yoav Bruck (born 1972), Israeli swimmer
 * Yoav Chelouche (born 1953), Israeli businessman
 * Yoav Cohen (born 1999), Israeli windsurfer
 * Yoav Dothan (born 1955), Israeli chess player
 * Yoav Eliasi (born 1977), Israeli rapper
 * Yoav Eshed (born 1989), Israeli guitarist
 * Yoav Freund (born 1961), Israeli computer scientist
 * Yoav Gallant (born 1958), Israeli politician and Minister of Defense
 * Yoav Gath (born 1980), Israeli swimmer
 * Yoav Gelber (born 1943), Israeli historian
 * Yoav Gerafi (born 1993), Israeli footballer
 * Yoav Goren, American-Israeli musician
 * Yoav Har-Even, Israeli general
 * Yoav Hofmayster (born 2000), Israeli footballer
 * Yoav Horesh (born 1975), Israeli photographer
 * Yoav Kisch (born 1968), Israeli politician and Minister of Education
 * Yoav Kislev (1932-2017), Israeli agricultural economist
 * Yoav Kutner (born 1954), Israeli presenter
 * Yoav Landau, Israeli musician
 * Yoav Meiri (born 1975), Israeli swimmer
 * Yoav Mordechai (born 1964), Israeli general
 * Yoav Omer (born 1998), Israeli windsurfer
 * Yoav Potash, American-Israeli writer and filmmaker
 * Yoav Ra'anan (born 1928), Israeli diver
 * Yoav Sadan (born 1979), Israeli singer-songwriter
 * Yoav Saffar (born 1975), Israeli basketball player
 * Yoav Segalovich (born 1959), Israeli politician
 * Yoav Shamir (born 1970), Israeli filmmaker
 * Yoav Shechtman (born 1980), Israeli physicist
 * Yoav Shoham (born 1956), American-Israeli computer scientist
 * Yoav Talmi (born 1953), Israeli composer and conductor
 * Yoav Yehoshua Weingarten (1845-1923), Polish rabbi
 * Yoav Ziv (born 1981), Israeli footballer

title: Yoav


text:
User:Rsaum

b.1965, sculptor-artist

location: Surrey/ London.

title: User:Rsaum


text:
Talk:Guillaume Le Gentil

Untitled
Is his life really widely considered to be "tragicomic"? The way the article is written is comical, but if written slightly differently, it could've been a complete suffering with no humour. Is it POV?

Well, I guess the fact that he missed something so rare is kinda sad and hilarious. We all have that kind of experience. --Menchi 09:59, 3 May 2004 (UTC)

 * OK, "unfortunate".

 * It might be even worse. His date of death was in 1792, smack in the middle of the French Revolution.  I wonder if he got guillotined or something.  Time for more research. -- Curps 10:24, 3 May 2004 (UTC)

He died at home, peacefully. The Reign of Terror, and the persecution and harrassment of the French nobility, didn't start in earnest until 1793. user:Jsc1973

Portrait
Note that the portrait currently linked to Guillaume le Gentil is actually the portrait of Guillaume de l'Hopital AstroLynx (talk) 14:28, 29 May 2012 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Guillaume Le Gentil. 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/20110810205122/http://www.staff.science.uu.nl/~gent0113/astrobib/outofoldbooks.htm to http://www.staff.science.uu.nl/~gent0113/astrobib/outofoldbooks.htm

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

Cheers.— InternetArchiveBot  (Report bug) 05:26, 25 October 2017 (UTC)

There is a Crater on the moon named after him.
I'm not sure if it belongs in a little section afterwards, or what. Maybe I'm not just seeing it, but there is doesn't seem to be any mention of the eponymous crater.

If someone would like to include some reference to him, it would be appreciated. Or I might just add it if I think of a way to word it.

https://en.m.wikipedia.org/wiki/Le_Gentil_(crater) Mechachleopteryx (talk) 23:21, 13 May 2021 (UTC)

I don't know how to edit this talk page, but I meant to say "some reference to this fact" not "some reference to him" Mechachleopteryx (talk) 23:26, 13 May 2021 (UTC)

 * Done. By the way, the best way to edit the talk page is to do what you did, and post another comment saying what you meant. The second best way is to strike the original, and correct it that way. Either is acceptable as a way to preserve the original talk page history. Renerpho (talk) 04:39, 21 August 2022 (UTC)

Letters
The article states: Due to shipwrecks and wartime attacks on ships, none of the letters he had sent to the Academy or to his relatives had reached their destinations. However, Le Gentil himself wrote of a letter he had sent to France in 1766, and the reply he received in 1767 (Sawyer Hogg, p.89-90). The Academy had discussed Le Gentil's plan to observe the 1769 transit from Manila, found it ill-advised, and suggested in their letter to instead go to Pondicherry. Renerpho (talk) 00:48, 9 August 2022 (UTC)

Removal of unsourced (but possibly true) material
I appreciate that you are trying to remove what may well be false information. Unfortunately, as I explained in my edit summaries here and here, the material you are trying to add is in conflict with reliable sources, and the references you were using (geneanet, archive.wikiwix.com) are not suitable as sources on Wikipedia. Before reverting it a third time, and running the risk of escalating this to an edit war, please discuss the material you want to add. If you are unable to find suitable sources, ask for help at the relevant Wiki Projects, listed at the top of this talk page. Thank you. Renerpho (talk) 18:53, 12 July 2023 (UTC)

 * A translation of the marriage record (p.1, p.2, p.3) may be useful, to see if the problem is actually as claimed. Of course we still need a secondary, reliably published source, that mentions the error. If no such publication exists yet then the correct step would be to create it, and then come back here (not the other way around). If the fact is relevant enough to be in a Wikipedia article then finding a trusted publisher should not be too difficult. Good luck! Renerpho (talk) 01:44, 13 July 2023 (UTC)
 * The Swedish Wikipedia article (marked as a featured article on that project) contains a lot more details about le Gentil, including his family. Maybe that article and the sources linked to from there (mainly Sawyer Hogg's book; compare the talk page section about his letters) can help resolve the issue. Renerpho (talk) 03:42, 3 November 2023 (UTC)

title: Talk:Guillaume Le Gentil


text:
Cynthia Breazeal

Cynthia Breazeal is an American robotics scientist and entrepreneur. She is a former chief scientist and chief experience officer of Jibo, a company she co-founded in 2012 that developed personal assistant robots. Currently, she is a professor of media arts and sciences at the Massachusetts Institute of Technology and the director of the Personal Robots group at the MIT Media Lab. Her most recent work has focused on the theme of living everyday life in the presence of AI, and gradually gaining insight into the long-term impacts of social robots.

Early life and education
As the daughter of two scientists, she had early access to the fields of computer science and engineering. Under the guidance of her parents, Breazeal earned a B.Sc in electrical and computer engineering from the University of California, Santa Barbara, in 1989; her M.S. in 1993; and her Sc.D. in 2000 in electrical engineering and computer science, both from MIT. After watching a NASA robot, she decided to switch her focus to social robotics.

She developed the robot Kismet as a doctoral thesis under Rodney Brooks, which looked into the expressive social exchange between humans and humanoid robots. Kismet, as well as other robots Breazeal co-developed while a graduate student at the MIT Artificial Intelligence Lab, can now be seen at the MIT Museum. Notable examples include the upper torso humanoid robot, Cog; and the insect-like robot, Hannibal. In the early 2000s, she worked on Leonard, Aida, Autom and Huggable.

MIT career
Breazeal is a professor of Media Arts and Sciences at MIT, where she founded and is the current director of the Personal Robotics group within the Media Lab. She has written several books in the field of robotics and has published several peer-reviewed articles on the topic. She also serves on multiple editorial boards for autonomous and various other robotic committees. Growing up and while studying in university, Breazeal found that the issue was that robots too often only interacted with objects and not people. In addition to this, Breazeal found that if we give robots the ability to perform non-verbal cues, such as those that humans inherently do every day, then humans will treat and see robots more like companions and like humans. She also explores the idea of using robots to build better connections between humans, such as humans who live a long distance away from each other.

Breazeal is also the associate director for the Bridge: MIT Quest for Intelligence, where she works on implementing AI through grade school.

Breazeal has centered her work around the concept of "living with AI" which studies the impact of incorporating social robots into our everyday lives. The purpose of adding sentiment to AI is offering support to people, and creating companionship and support in places where there may be none.

In January 2022, Breazeal was named as dean for digital learning at Massachusetts Institute of Technology (MIT). As dean, Breazeal will lead in aiding to grow MIT's online portfolio, libraries, bootcamps, and identifying the areas for innovation, while researching opening learning and how different methods and technologies can improve digital learning.

Research
Leonardo was one of her earliest robots, co-developed with Stan Winston Studio, and a successor to Kismet (recognized in 2006 by Wired magazine as one of the "50 Best Robots Ever"). Leonardo was also used to investigate social cognition and theory of mind abilities on robots with application to human-robot collaboration, in addition to developing social learning abilities for robots such as imitation, tutelage, and social referencing. Next, is another of Breazeal's robots in this tradition, and was named by Time magazine as one of the 50 Best Inventions of 2008. Next is an MDS robot (mobile, dexterous, social) that combines rich social communication abilities with mobile dexterity to investigate more complex forms of human-robot teaming.

Breazeal's Personal Robots group has also done a number of design projects and publications regarding social robots, covering topics such as education, psychology, personalization, and telepresence. Social robots developed in Breazeal's Personal Robots group include Autom, a robot diet and exercise coach (the PhD thesis of Cory Kidd). It was found to be more effective than a computer counterpart in sustaining engagement and building trust and a working alliance with users. Autom was the predecessor of Mabu (Catalia Health). Breazeal's group has also explored expressive remote presence robots such as MeBot. The physical social embodiment of the MeBot was found to elicit greater psychological involvement, engagement, and desire to cooperate over purely screen-based video conferencing or a mobile screen. There is also the Huggable which was designed as a pediatric companion to help support the emotional needs of hospitalized children and to help support and augment child life specialists.

Breazeal has also been part of creating a robotic flower garden installation, Cyberflora which was exhibited at the 2003 National Design Triennial at the Smithsonian Cooper-Hewitt National Design Museum.

She served as a consultant on the 2001 Spielberg-Kubric movie A.I. Artificial Intelligence. She also has a prominent role as a virtual participant in a popular exhibit on robots with the traveling exhibit, Star Wars: Where Science Meets Imagination, interacting with a real C-3PO (voiced by Anthony Daniels) as she spoke to the audience through a pre-recorded message displayed on a large plasma flat-screen display.

In 2003, she was named by the MIT Technology Review TR100 as one of the top 100 innovators in the world under the age of thirty-five.

In 2020, she was elected a AAAI Fellow by the Association for the Advancement of Artificial Intelligence. In March 2020, during the SARS-CoV2 pandemic, Breazeal and her team launched a site with over 60 activities, so students can get access to STEM activities from the lockdown to help teachers and parents continue education from home.

Jibo
On July 16, 2014, Breazeal launched an Indiegogo campaign to crowdfund the development of Jibo, a personal assistant robot widely marketed as the world's first family robot. She served as chief scientist and chief experience officer. Jibo reached its initial fund-raising goal and was due to launch in 2015, then later pushed to 2016, before finally being released in November 2017. The robot was created to enable more engaging social experiences, including storytelling and other forms of entertainment.

Jibo generally received poor reviews, being compared to the more powerful and much cheaper Amazon Alexa and Google Home. The software development kit expected for developers was never released. On December 15, 2017 the company announced layoffs and shut its doors soon after. By the time Jibo shut down, it had raised more than $70 million. Breazeal has made no public comments in regard to the closing of Jibo. In March 2020, the assets of Jibo Inc. were acquired by NTT Corporation. NTT Disruption intends to bring Jibo to the healthcare and education markets.

Awards and recognition
In 2008, she received the Gilbreth Lectures Award by the National Academy of Engineering. Her Nexi robot was named one of Time magazine's Best Inventions of 2008.

In 2014, Breazeal was recognized as an entrepreneur as Fortune magazine's Most Promising Women Entrepreneurs, and she was also a recipient of the L'Oreal USA Women in Digital NEXT Generation Award. The same year, she received the 2014 George R. Stibitz Computer & Communications Pioneer Award for seminal contributions to the development of Social Robotics and Human Robot Interaction.

In 2015, Breazeal was named by Entrepreneur magazine as one of the Women to Watch.

Jibo was featured on the cover of Time magazine's 25 Best Inventions of 2017.

Books

 * Breazeal contributed one chapter to Architects of Intelligence: The Truth About AI from the People Building It, Packt Publishing, 2018, ISBN 978-1-78-913151-2, by the American futurist Martin Ford.
 * Breazeal contributed one chapter to Architects of Intelligence: The Truth About AI from the People Building It, Packt Publishing, 2018, ISBN 978-1-78-913151-2, by the American futurist Martin Ford.
 * Breazeal contributed one chapter to Architects of Intelligence: The Truth About AI from the People Building It, Packt Publishing, 2018, ISBN 978-1-78-913151-2, by the American futurist Martin Ford.

title: Cynthia Breazeal


text:
Litopenaeus setiferus

Litopenaeus setiferus (also accepted: Penaeus setiferus, and known by various common names including Atlantic white shrimp, white shrimp, gray shrimp, lake shrimp, green shrimp, green-tailed shrimp, blue-tailed shrimp, rainbow shrimp, Daytona shrimp, Mayport Shrimp, common shrimp, southern shrimp, and, in Mexico, camaron blanco) is a species of prawn found along the Atlantic coast of North America and in the Gulf of Mexico. It was the subject of the earliest shrimp fishery in the United States.

Distribution
The range of L. setiferus extends from Fire Island, New York to Ciudad Campeche, Mexico. It requires warm water, and is unable to survive below 3 C, with appreciable growth only occurring at temperatures over 20 C.

Description
Litopenaeus setiferus may reach a total length (excluding antennae) of 197 mm, with females being larger than males. The antennae may be up to three times the length of the body, which is bluish white with a tinge of pink on the sides, and black spots. The pleopods are often redder, and the uropods and telson are green. The rostrum is long and thin, with 5–11 teeth on the upper edge and 2 on the lower edge, and continues along the carapace as a dorsal carina (ridge). Deep grooves alongside the carine separate the related species Farfantepenaeus aztecus ("brown shrimp") and Farfantepenaeus duorarum ("pink shrimp") from L. setiferus.

Ecology
Litopenaeus setiferus lives in estuaries and from the littoral zone to water with a depth of 100 ft in the Atlantic, or up to 260 ft in the Gulf of Mexico. Litopenaeus setiferus is an omnivore; in Lake Pontchartrain, it feeds chiefly on the seagrass Vallisneria americana and detritus. Many aquatic animals feed on L. setiferus, including fish such as red drum (Sciaenops ocellatus) and turtles such as the loggerhead sea turtle (Caretta caretta).

Life cycle
Spawning in L. setiferus occurs while the water is warm, between the increase in water temperatures in the spring and the sudden decline in temperature in the fall. It generally occurs within 9 km of the shoreline, in water less than 9 m deep in the Atlantic, or 8 - 31 m deep in the Gulf of Mexico. Males attach a spermatophore to the females, which is then used to fertilize the eggs as they are released. Each female releases 500,000–1,000,000 purplish eggs, each 0.2 - 0.3 mm across, which sink to the bottom of the water column.

After 10–12 hours, the eggs hatch into nauplius larvae, which are 0.3 mm long, planktonic and unable to feed. They molt five times to reach the protozoa stage, 1 mm long. These grow to 2.5 mm long over two molts, before passing through three molts as a mysis larva. About 15–20 days after hatching, the animals reaches the postlarva stage; in the second postlarval stage, at a length of 7 mm, they begin to enter estuaries and drop down to the substrate.

Spring rains flush the shrimp out into the ocean. In the Eastern United States, shrimp then migrate south towards warmer waters.

Fishery
Subsistence fishing for prawns was carried out by Native Americans along the Atlantic coast. This knowledge was passed on to European settlers, and Litopenaeus setiferus became the subject of the earliest shrimp fishery in the United States, with commercial fishery for L. setiferus starting as early as 1709.

The harvesting for L. setiferus began in the 1950s and since that time is collected monthly throughout Gulf of Mexico.

Other references

 * White shrimp NOAA FishWatch. Retrieved 4 November 2012.

title: Litopenaeus setiferus


text:
List of algorithm general topics

This is a list of algorithm general topics.

 * Analysis of algorithms
 * Ant colony algorithm
 * Approximation algorithm
 * Best and worst cases
 * Big O notation
 * Combinatorial search
 * Competitive analysis
 * Computability theory
 * Computational complexity theory
 * Embarrassingly parallel problem
 * Emergent algorithm
 * Evolutionary algorithm
 * Fast Fourier transform
 * Genetic algorithm
 * Graph exploration algorithm
 * Heuristic
 * Hill climbing
 * Implementation
 * Las Vegas algorithm
 * Lock-free and wait-free algorithms
 * Monte Carlo algorithm
 * Numerical analysis
 * Online algorithm
 * Polynomial time approximation scheme
 * Problem size
 * Pseudorandom number generator
 * Quantum algorithm
 * Random-restart hill climbing
 * Randomized algorithm
 * Running time
 * Sorting algorithm
 * Search algorithm
 * Stable algorithm (disambiguation)
 * Super-recursive algorithm
 * Tree search algorithm

title: List of algorithm general topics


text:
Quantum algorithm

In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer,  the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.

Problems that are undecidable using classical computers remain undecidable using quantum computers. What makes quantum algorithms interesting is that they might be able to solve some problems faster than classical algorithms because the quantum superposition and quantum entanglement that quantum algorithms exploit generally cannot be efficiently simulated on classical computers (see Quantum supremacy).

The best-known algorithms are Shor's algorithm for factoring and Grover's algorithm for searching an unstructured database or an unordered list. Shor's algorithm runs much (almost exponentially) faster than the best-known classical algorithm for factoring, the general number field sieve. Grover's algorithm runs quadratically faster than the best possible classical algorithm for the same task, a linear search.

Overview
Quantum algorithms are usually described, in the commonly used circuit model of quantum computation, by a quantum circuit that acts on some input qubits and terminates with a measurement. A quantum circuit consists of simple quantum gates, each of which acts on some finite number of qubits. Quantum algorithms may also be stated in other models of quantum computation, such as the Hamiltonian oracle model.

Quantum algorithms can be categorized by the main techniques involved in the algorithm. Some commonly used techniques/ideas in quantum algorithms include phase kick-back, phase estimation, the quantum Fourier transform, quantum walks, amplitude amplification and topological quantum field theory. Quantum algorithms may also be grouped by the type of problem solved; see, e.g., the survey on quantum algorithms for algebraic problems.

Algorithms based on the quantum Fourier transform
The quantum Fourier transform is the quantum analogue of the discrete Fourier transform, and is used in several quantum algorithms. The Hadamard transform is also an example of a quantum Fourier transform over an n-dimensional vector space over the field F2. The quantum Fourier transform can be efficiently implemented on a quantum computer using only a polynomial number of quantum gates.

Deutsch–Jozsa algorithm
The Deutsch–Jozsa algorithm solves a black-box problem that requires exponentially many queries to the black box for any deterministic classical computer, but can be done with a single query by a quantum computer. However, when comparing bounded-error classical and quantum algorithms, there is no speedup, since a classical probabilistic algorithm can solve the problem with a constant number of queries with small probability of error. The algorithm determines whether a function f is either constant (0 on all inputs or 1 on all inputs) or balanced (returns 1 for half of the input domain and 0 for the other half).

Bernstein–Vazirani algorithm
The Bernstein–Vazirani algorithm is the first quantum algorithm that solves a problem more efficiently than the best known classical algorithm. It was designed to create an oracle separation between BQP and BPP.

Simon's algorithm
Simon's algorithm solves a black-box problem exponentially faster than any classical algorithm, including bounded-error probabilistic algorithms. This algorithm, which achieves an exponential speedup over all classical algorithms that we consider efficient, was the motivation for Shor's algorithm for factoring.

Quantum phase estimation algorithm
The quantum phase estimation algorithm is used to determine the eigenphase of an eigenvector of a unitary gate, given a quantum state proportional to the eigenvector and access to the gate. The algorithm is frequently used as a subroutine in other algorithms.

Shor's algorithm
Shor's algorithm solves the discrete logarithm problem and the integer factorization problem in polynomial time, whereas the best known classical algorithms take super-polynomial time. These problems are not known to be in P or NP-complete. It is also one of the few quantum algorithms that solves a non–black-box problem in polynomial time, where the best known classical algorithms run in super-polynomial time.

Hidden subgroup problem
The abelian hidden subgroup problem is a generalization of many problems that can be solved by a quantum computer, such as Simon's problem, solving Pell's equation, testing the principal ideal of a ring R and factoring. There are efficient quantum algorithms known for the Abelian hidden subgroup problem. The more general hidden subgroup problem, where the group isn't necessarily abelian, is a generalization of the previously mentioned problems, as well as graph isomorphism and certain lattice problems. Efficient quantum algorithms are known for certain non-abelian groups. However, no efficient algorithms are known for the symmetric group, which would give an efficient algorithm for graph isomorphism and the dihedral group, which would solve certain lattice problems.

Estimating Gauss sums
A Gauss sum is a type of exponential sum. The best known classical algorithm for estimating these sums takes exponential time. Since the discrete logarithm problem reduces to Gauss sum estimation, an efficient classical algorithm for estimating Gauss sums would imply an efficient classical algorithm for computing discrete logarithms, which is considered unlikely. However, quantum computers can estimate Gauss sums to polynomial precision in polynomial time.

Fourier fishing and Fourier checking
Consider an oracle consisting of n random Boolean functions mapping n-bit strings to a Boolean value, with the goal of finding n n-bit strings z1,..., zn such that for the Hadamard-Fourier transform, at least 3/4 of the strings satisfy

 * $$| \tilde{f}(z_i)| \geqslant 1$$

and at least 1/4 satisfy

 * $$| \tilde{f}(z_i) | \geqslant 2.$$

This can be done in bounded-error quantum polynomial time (BQP).

Algorithms based on amplitude amplification
Amplitude amplification is a technique that allows the amplification of a chosen subspace of a quantum state. Applications of amplitude amplification usually lead to quadratic speedups over the corresponding classical algorithms. It can be considered as a generalization of Grover's algorithm.

Grover's algorithm
Grover's algorithm searches an unstructured database (or an unordered list) with N entries for a marked entry, using only $$O(\sqrt{N})$$ queries instead of the $$O({N})$$ queries required classically. Classically, $$O({N})$$ queries are required even allowing bounded-error probabilistic algorithms.

Theorists have considered a hypothetical generalization of a standard quantum computer that could access the histories of the hidden variables in Bohmian mechanics. (Such a computer is completely hypothetical and would not be a standard quantum computer, or even possible under the standard theory of quantum mechanics.) Such a hypothetical computer could implement a search of an N-item database in at most $$O(\sqrt[3]{N})$$ steps. This is slightly faster than the $$O(\sqrt{N})$$ steps taken by Grover's algorithm. However, neither search method would allow either model of quantum computer to solve NP-complete problems in polynomial time.

Quantum counting
Quantum counting solves a generalization of the search problem. It solves the problem of counting the number of marked entries in an unordered list, instead of just detecting whether one exists. Specifically, it counts the number of marked entries in an $$N$$-element list with an error of at most $$\varepsilon$$ by making only $$\Theta\left(\varepsilon^{-1} \sqrt{N/k}\right)$$ queries, where $$k$$ is the number of marked elements in the list. More precisely, the algorithm outputs an estimate $$k'$$ for $$k$$, the number of marked entries, with accuracy $$|k-k'| \leq \varepsilon k$$.

Algorithms based on quantum walks
A quantum walk is the quantum analogue of a classical random walk. A classical random walk can be described by a probability distribution over some states, while a quantum walk can be described by a quantum superposition over states. Quantum walks are known to give exponential speedups for some black-box problems. They also provide polynomial speedups for many problems. A framework for the creation of quantum walk algorithms exists and is a versatile tool.

Boson sampling problem
The Boson Sampling Problem in an experimental configuration assumes an input of bosons (e.g., photons) of moderate number that are randomly scattered into a large number of output modes, constrained by a defined unitarity. When individual photons are used, the problem is isomorphic to a multi-photon quantum walk. The problem is then to produce a fair sample of the probability distribution of the output that depends on the input arrangement of bosons and the unitarity. Solving this problem with a classical computer algorithm requires computing the permanent of the unitary transform matrix, which may take a prohibitively long time or be outright impossible. In 2014, it was proposed that existing technology and standard probabilistic methods of generating single-photon states could be used as an input into a suitable quantum computable linear optical network and that sampling of the output probability distribution would be demonstrably superior using quantum algorithms. In 2015, investigation predicted the sampling problem had similar complexity for inputs other than Fock-state photons and identified a transition in computational complexity from classically simulable to just as hard as the Boson Sampling Problem, depending on the size of coherent amplitude inputs.

Element distinctness problem
The element distinctness problem is the problem of determining whether all the elements of a list are distinct. Classically, $$\Omega(N)$$ queries are required for a list of size $$N$$; however, it can be solved in $$\Theta(N^{2/3})$$ queries on a quantum computer. The optimal algorithm was put forth by Andris Ambainis, and Yaoyun Shi first proved a tight lower bound when the size of the range is sufficiently large. Ambainis and Kutin independently (and via different proofs) extended that work to obtain the lower bound for all functions.

Triangle-finding problem
The triangle-finding problem is the problem of determining whether a given graph contains a triangle (a clique of size 3). The best-known lower bound for quantum algorithms is $$\Omega(N)$$, but the best algorithm known requires O(N1.297) queries, an improvement over the previous best O(N1.3) queries.

Formula evaluation
A formula is a tree with a gate at each internal node and an input bit at each leaf node. The problem is to evaluate the formula, which is the output of the root node, given oracle access to the input.

A well studied formula is the balanced binary tree with only NAND gates. This type of formula requires $$\Theta(N^c)$$ queries using randomness, where $$c = \log_2(1+\sqrt{33})/4 \approx 0.754$$. With a quantum algorithm, however, it can be solved in $$\Theta(N^{1/2})$$ queries. No better quantum algorithm for this case was known until one was found for the unconventional Hamiltonian oracle model. The same result for the standard setting soon followed.

Fast quantum algorithms for more complicated formulas are also known.

Group commutativity
The problem is to determine if a black-box group, given by k generators, is commutative. A black-box group is a group with an oracle function, which must be used to perform the group operations (multiplication, inversion, and comparison with identity). The interest in this context lies in the query complexity, which is the number of oracle calls needed to solve the problem. The deterministic and randomized query complexities are $$\Theta(k^2)$$ and $$\Theta(k)$$, respectively. A quantum algorithm requires $$\Omega(k^{2/3})$$ queries, while the best-known classical algorithm uses $$O(k^{2/3} \log k)$$ queries.

BQP-complete problems
The complexity class BQP (bounded-error quantum polynomial time) is the set of decision problems solvable by a quantum computer in polynomial time with error probability of at most 1/3 for all instances. It is the quantum analogue to the classical complexity class BPP.

A problem is BQP-complete if it is in BQP and any problem in BQP can be reduced to it in polynomial time. Informally, the class of BQP-complete problems are those that are as hard as the hardest problems in BQP and are themselves efficiently solvable by a quantum computer (with bounded error).

Computing knot invariants
Witten had shown that the Chern-Simons topological quantum field theory (TQFT) can be solved in terms of Jones polynomials. A quantum computer can simulate a TQFT, and thereby approximate the Jones polynomial, which as far as we know, is hard to compute classically in the worst-case scenario.

Quantum simulation
The idea that quantum computers might be more powerful than classical computers originated in Richard Feynman's observation that classical computers seem to require exponential time to simulate many-particle quantum systems, yet quantum many-body systems are able to "solve themselves." Since then, the idea that quantum computers can simulate quantum physical processes exponentially faster than classical computers has been greatly fleshed out and elaborated. Efficient (i.e., polynomial-time) quantum algorithms have been developed for simulating both Bosonic and Fermionic systems, as well as the simulation of chemical reactions beyond the capabilities of current classical supercomputers using only a few hundred qubits. Quantum computers can also efficiently simulate topological quantum field theories. In addition to its intrinsic interest, this result has led to efficient quantum algorithms for estimating quantum topological invariants such as Jones and HOMFLY polynomials, and the Turaev-Viro invariant of three-dimensional manifolds.

Solving a linear systems of equations
In 2009, Aram Harrow, Avinatan Hassidim, and Seth Lloyd, formulated a quantum algorithm for solving linear systems. The algorithm estimates the result of a scalar measurement on the solution vector to a given linear system of equations.

Provided that the linear system is sparse and has a low condition number $$\kappa$$, and that the user is interested in the result of a scalar measurement on the solution vector (instead of the values of the solution vector itself), then the algorithm has a runtime of $$O(\log(N)\kappa^2)$$, where $$N$$ is the number of variables in the linear system. This offers an exponential speedup over the fastest classical algorithm, which runs in $$O(N\kappa)$$ (or $$O(N\sqrt{\kappa})$$ for positive semidefinite matrices).

Hybrid quantum/classical algorithms
Hybrid Quantum/Classical Algorithms combine quantum state preparation and measurement with classical optimization. These algorithms generally aim to determine the ground-state eigenvector and eigenvalue of a Hermitian operator.

QAOA
The quantum approximate optimization algorithm takes inspiration from quantum annealing, performing a discretized approximation of quantum annealing using a quantum circuit. It can be used to solve problems in graph theory. The algorithm makes use of classical optimization of quantum operations to maximize an "objective function."

Variational quantum eigensolver
The variational quantum eigensolver (VQE) algorithm applies classical optimization to minimize the energy expectation value of an ansatz state to find the ground state of a Hermitian operator, such as a molecule's Hamiltonian. It can also be extended to find excited energies of molecular Hamiltonians.

Contracted quantum eigensolver
The contracted quantum eigensolver (CQE) algorithm minimizes the residual of a contraction (or projection) of the Schrödinger equation onto the space of two (or more) electrons to find the ground- or excited-state energy and two-electron reduced density matrix of a molecule. It is based on classical methods for solving energies and two-electron reduced density matrices directly from the anti-Hermitian contracted Schrödinger equation.

title: Quantum algorithm


text:
Talk:Jasmine (novel)

Untitled
Ugh! I can hardly believe that someone wrote this about Italic textJasmine Italic text It is completely off base and invalid. Don't listen to a word it says! I'll come back when i have time and rewrite the synopsis...but honestly people..did you even read the book-this was pathetic!

 * Sounds as if you had to read it for school. I'm glad you didn't have time to rewrite the synopsis because I think it's accurate (and NPOV) the way it is. < K  F >  00:22, 21 November 2005 (UTC)

Some more comments
Jasmine does not marry the paralized man, Bud Ripplemeyer, even though he wants her to because she realizes she is not happy with him. She only leaves Bud after she realizes she loves Taylor and he arrives at her doorstep.

Bud is not shot before Jasmine arrives, he is shot while the two are together. Jasmine is partially the cause of the shooting. —The preceding unsigned comment was added by KF (talk • contribs) 20:37, 28 December 2006 (UTC).

 * As HagermanBot correctly observes, KF didn't sign "Some more comments" because they are not his comments. See the article page history. <KF> 20:40, 28 December 2006 (UTC)

title: Talk:Jasmine (novel)


text:
Type 82 destroyer

The Type 82 or Bristol-class destroyer was a 1960s guided missile destroyer design intended to replace County-class destroyers in the Royal Navy. Originally eight warships were planned to provide area air-defence for the four planned CVA-01 aircraft carriers. They would also have been able to operate independently as modern cruisers "East of Suez".

Anti-aircraft capability was provided by the new Sea Dart missile system and the class also had anti-submarine capability. They were expected to serve as a group of four Type 82s forming the outer escort of the carrier with four "Broad Beam" Leander-class frigates as the inner escort.

The CVA-01s were all cancelled by 1966, eliminating one of the main roles for the class and removing the need for such a large warship. In its place a smaller design carrying Sea Dart for air defence entered service as the Type 42 destroyer. One Type 82, HMS Bristol (D23), was ordered to act as a testbed for the various technologies to be used on future ships. Sometimes described as a "light cruiser", she was officially classified as a destroyer.

History
The CVA-01 aircraft carrier project was cancelled in the 1966 Defence White Paper, eliminating the requirement for the Type 82 class. Nevertheless, one hull of the original four was ordered on 4 October 1966 for use as a testbed for new technologies. HMS Bristol was laid down in 1967, featuring four new systems: The latter feature, although not externally apparent, was perhaps the most pioneering of the design; a leap forward from the rudimentary action information system of the "Counties" and its heavy reliance on manual data input.
 * The Sea Dart missile that would later be fitted in the Type 42 destroyers and Invincible-class aircraft carriers.
 * The Ikara anti-submarine weapon, later fitted to some Leander-class frigates.
 * A new 113 mm 4.5-inch Mk 8 gun.
 * The advanced Action Data Automation Weapons System Mk.2 (ADAWS-2), a computer system designed to coordinate the ship's weapons and sensors.

The Type 82 was followed into service by the smaller Type 42 destroyer that featured the same Sea Dart missile, 113 mm Mark 8 gun and integrated ADAWS. It was not a direct replacement for the Type 82 per se, but filled the area air defence role in a Cold War, North Atlantic navy. The Type 42 design was however smaller and had a lower manpower requirement and as such many more hulls could be brought into service than a design of the Type 82's size. It also featured a flight deck and hangar for its own air component providing improved anti-submarine, surface-strike and general utility to the design.

Design
The Type 82 was loosely based on the layout of the County-class destroyer and the Type 12I Leander-class frigate (hence the inclusion in the escort Type numbering system.) However the County and Leander designs provided only a limited weapon and command replacement for the war-built cruisers, the last of which had been decommissioned in 1962-65.

The County class depended on data links from the aircraft carriers (Eagle, Hermes and Victorious) equipped with 984 3D radar and ADWAS computers which were able to track 50-100 targets and prioritize targets for fighters, missiles and long range AA. The later Tiger-class cruisers were completed too late with unreliable machinery and automatic guns prone to jamming. The Tigers were inefficient East of Suez and similar problems plagued the last Battle-class and Daring-class destroyers. The Counties had the same obsolescent 4.5-inch guns and Seaslug missile system was now obsolete. Their helicopter facilities were cumbersome and unrealistic for deterrence of Soviet nuclear submarines or even diesel submarines of the Chinese navy and other Far-East nations. The serious naval confrontation between Malaya and Indonesia from 1963-6, showed Asian powers now had jet bombers armed with cruise missiles, and RN carriers with subsonic second generation de Havilland Sea Vixen and Supermarine Scimitar fighters were insufficient. Three of the RN strike carriers in 1963-65 had capacity for only 25 aircraft, which was completely inadequate for the required mix of strike aircraft, fighters, interceptors, tankers, Fairey Gannets and anti-submarine helicopters or aircraft.

Moving the anti-submarine requirement to separate small cruisers or carriers armed with either 4-6 anti submarine helicopters or more reliable dual conventional/nuclear missile anti-submarine missiles such as Ikara or ASROC propelled the development of the Type 82 and the legend was set on 7 July 1965.

Other East of Suez issues in the Gulf and with Egypt, UAE and China and unstated India. Iraq and Iran were also seen as justifying more powerful cruiser substitutes as aircraft carrier complements. As with the County class, gun armament was light, no light AA was included prior to the 1982 Falklands War and the warships were unarmoured. Scantlings, supply and storage capacity was based on destroyer standards as in the preceding Counties. The Type 82 was a much more spacious warship better planned for sustained crew functionality in operational conditions in distant waters.

The vessel was powered by a combined steam and gas (COSAG) plant, and was the last warship designed for the Royal Navy to be powered by steam. The steam plant vented through the large fore funnel while the gas plant exhausted though a side-by-side pair of after funnels (on either side of the extensive air intakes and filters for the gas turbines), giving it a unique three-funnelled layout.

Weapon systems
The new Sea Dart missile was fired from a twin-arm launcher on the quarterdeck and there was a pair of radar Type 909 target illumination sets, an improvement over the single radar Type 901 set of the County-class design.

The single Mark 8 4.5-inch gun was not intended as an anti-aircraft weapon, and as such had an elevation of only 55°. The weapon was designed specifically for reliability over rate of fire, allowing only a single mounting to be shipped, and the comparatively low rate of fire of 25 rounds per minute was more than suitable for the intended anti-ship and shore bombardment roles.

The third weapon system was the Australian Ikara anti-submarine weapon; a rocket-powered aircraft capable of carrying a Mk.44 homing torpedo or nuclear depth bomb out to 10 miles from the ship. The Ikara was backed up by a Mark 10 Limbo anti-submarine mortar. Although capable of landing a Westland Wasp helicopter on the quarterdeck the ship lacked a hangar and aviation facilities and thus had to rely on external air support.

Electronics
The original design called for a long-range 3-D air search radar to be fitted; the joint Anglo-Dutch Type 988 "Broomstick", and early drawings and artist's impression show a large dome on the bridge to carry this set. A similar set was to be fitted to the CVA-01 design. However, the RN dropped out of the program due to high cost, and instead she was fitted with the ageing Type 965 air search radar, with a "twin bedstead" AKE-2 antennae, on a stump foremast. Radar Type 992Q low-angle search was carried on the tall, slender mainmast and as such the electronics fit had not advanced significantly from the County class. Type 909 sets were shipped fore and aft for Sea Dart fire control, allowing two targets to be engaged at any one time.

The main advance in the design was with how the sensor data was processed and displayed. The ADAWS-2 system, based on two Ferranti FM1600 computers, integrated the identification, tracking and engagement of targets into a single system. ADAWS-2 could accept input from any of the ship's radars or sonars, identify targets and produce continuous track histories. Using this information it could evaluate threat levels and control the engagement of targets using the relevant weapons systems. The whole process occurred almost automatically, requiring only oversight and command from the human operator. This new generation of warship would be commanded from an operations room within the ship rather than the traditional location of the bridge.

 * Electronics:
 * ADAWS-2 combat direction system
 * 1 × radar Type 965 2D air warning, later;
 * 1 × radar Type 1022 2D air search
 * 1 × radar Type 992Q low-angle target indication
 * 2 × radar Type 909 Sea Dart target illumination
 * 1 × radar Type 978 (later 1006) navigation
 * 1 × sonar Type 170 search
 * 1 × sonar Type 184 target indication

Appraisal
Despite introducing various new systems, the role for which Bristol was designed never materialised. She faced the problem of entering a navy that had no operational role or requirement for her and that was faced with rapidly changing priorities. This single, large ship was manpower- and maintenance-intensive and was not fitted out to the standard required for front line deployment.

The major shortcomings in the design were twofold: the lack of an air component and the lack of a long-range anti-ship weapon. Because this class of destroyer was proposed to be deployed alongside the new aircraft carriers, both of these capabilities were intended to be delivered from other components of the carrier battle group. Within a few years these features would be standard on ships of this size and type. These deficiencies limited her to squadron (rather than individual patrol) duties, and Bristol is usually seen as something of a white elephant.

Service
The role which the Type 82 was built for never materialised; Bristol, the only ship built, spent most of her service in the 1970s trialling and building up experience using the new weapons and computer systems. A major boiler fire in 1974 destroyed the steam plant. Older ships might have been crippled by this, but Bristol was able to operate for three years using only her turbine plant, demonstrating the flexibility and utility of the latter. The steam plant was repaired in 1976 and it was not until 1979 that she was fitted out for frontline service with ECM, Corvus countermeasures launchers and a pair of World War II-era Oerlikon 20 mm cannons. During this refit the Limbo weapon was removed; the well subsequently saw service as a makeshift swimming pool.

Thanks to her size, Bristol was suitable for use as a flagship as she could embark the extra staff members necessary for this role. As such, she served as the Royal Navy flagship during Exercise Ocean Safari 81. After a short refit, during which the mortar well was plated over to allow the landing of large helicopters on the quarterdeck, she joined the Royal Navy task force in the South Atlantic in the 1982 Falklands War as a component of the carrier battle-group. After the conflict she remained ‘’in situ’’ as flagship of the remaining Royal Navy forces. On return to the UK she entered a refit and, in light of the lessons of the conflict, she had her light anti aircraft weapons augmented with a pair of twin Oerlikon / BMARC 30 mm GCM-A03 and a pair of single Oerlikon / BMARC 20 mm GAM-B01 guns. Loral-Hycor SRBOC countermeasures launchers were also added to augment the elderly Corvus launchers.

With the Royal Navy short on hulls after damages and losses incurred in the Falklands, Bristol remained in commission and made several overseas deployments until paid off for refit in 1984. Another boiler explosion when entering refit caused extensive damage and had to be repaired. The major work undertaken in the refit was to replace the obsolete radar Type 965 with the new radar Type 1022 for long range air search duties. In addition, the Ikara system was removed and it was intended that it be replaced with two triple STWS-1 launchers for 324 mm anti-submarine torpedoes, although these were never fitted.

In 1987 she became part of Dartmouth training squadron, for which duties she had extra accommodation and classrooms added in the former Ikara and Limbo spaces. Finally she was withdrawn from service on 14 June 1991 and configured for her next role in 1993 to be a replacement for HMS Kent (D12) as a static training ship at HMS Excellent (shore establishment), a shore facility in Portsmouth.

As of 28 October 2020, Bristol was decommissioned and is currently awaiting disposal.

title: Type 82 destroyer


text:
Bow Street

Bow Street is a thoroughfare in Covent Garden, Westminster, London. It connects Long Acre, Russell Street and Wellington Street, and is part of a route from St Giles to Waterloo Bridge.

The street was developed in 1633 by Francis Russell, 4th Earl of Bedford for residential purposes. A number of notable people lived here in the 17th and 18th centuries, including Oliver Cromwell and Robert Harley, 1st Earl of Oxford. In the 18th century, the street declined as a place of residence following the establishment of the nearby Covent Garden Theatre, which led to a reputation for prostitution. During the 19th century, Bow Street was a de facto extension of Covent Garden and its associated markets, selling then-exotic fruit and vegetables.

Bow Street has a strong connection with the law; the Bow Street Runners, an early voluntary police force, was established here by Henry Fielding in 1750, and the Metropolitan Police Service operated a station house from 1832, which led to the construction of the Bow Street Magistrates' Court.

Today, only a short run of buildings from No. 35 to Russell Street remain on their original sites; the rest having been given up for large buildings.

Geography
Bow Street is around 0.1 mi long and runs between Russell Street and Long Acre, to the east of Covent Garden. South of Russell Street, the road continues as Wellington Street towards The Strand. As with several other streets in the local area, signs featuring its name are marked with the "Theatreland" logo. The street has historically been part of a through route from St Giles to Waterloo Bridge, though it is no longer the recommended signposted route.

The nearest tube station is Covent Garden. No bus services run along Bow Street, though the route of London Buses route RV1 (from Covent Garden to Waterloo Bridge) is close by.

Bow Street was part of a B road, numbered B401, along with Wellington Street; but it has now been declassified and only Endell Street now bears the number.

Early history
The area around Bow Street was first developed by Francis Russell, 4th Earl of Bedford in 1633. Buildings were first erected on the west side of the street that year, and it was fully built by around 1635–36. Development to the northeast was restricted by a brick wall that had been built by the Earl's cousin, Edward Russell, 3rd Earl of Bedford, in 1610 as a land boundary and remained undeveloped for some time. It was eventually built on between 1673 and 1677, with eleven properties constructed.

The street was named Bow Street in 1638 after its basic shape. It was always the Earl's intention to extend it as far as Long Acre, but this was delayed. It was eventually connected by his son, William Russell, 1st Duke of Bedford, who gave ownership of the street over to the Paving Commissioners of St. Martin in the Fields, so it could be a public right of way.

Bow Street had a number of notable residents in the 17th and 18th centuries. Oliver Cromwell moved to the street in 1645. Robert Harley, 1st Earl of Oxford was born there in 1661. Charles Sackville, 6th Earl of Dorset lived here around 1685. The woodcarver Grinling Gibbons had premises on Bow Street between 1678 and 1721, while the physician John Radcliffe stayed on the street in the 1680s. Author and scribe John Ayres stayed at Bow street during the late 17th century, as did the playwright William Wycherley. The actor-manager David Garrick lived at No. 6 between 1742 and 1744 while Charles Macklin stayed in the street between 1743 and 1748.

Will's Coffee House was founded at No. 71 Bow Street in 1671 by William Urvin. It became popular during the 1690s, extending to No. 20 Russell Street, and survived until 1751.

Many residents moved away from Bow Street after the theatre was established in the early 18th century. Life in the street declined and became known for pornography and prostitution. The publisher Edmund Curll lived at No. 2 during this time, and by 1740 the street held 8 pubs, concealing a number of brothels. In 1833, the Commissioners of Woods, Forest and Land Revenues were looking to buy land on and around Bow Street, and discovered that James Robinson, lessee to the Duke of Bedford, was running a brothel there. In the following legal dispute, Robinson's legal team accused the Commissioner's surveyor of being prejudiced against prostitution. The building was demolished, but made little difference to the area's reputation. In 1844, a resident suggested the street should be renamed as a continuation of Wellington Street to distance itself from the reputation Bow Street had acquired.

Law
Bow Street's character changed during the 18th century to cover police and law. No. 4, originally built by James Browne in 1703–4, served as a magistrates' court from 1740. The forerunner of the modern police force, the Bow Street Runners, were founded there by novelist and dramatist Henry Fielding around 1750, after he assembled a group of volunteers who would be paid for securing convictions and could take private commission or rewards. Fielding called them "thief-takers", but the Bow Street Runner name did not appear until later in the century. Following his death, Fielding was succeeded by his half-brother John.

Many of the early records of the Bow Street Runners were destroyed in the Gordon Riots of 1780, when the magistrates' court became a target. Records of arrest history and convictions were burned to expunge the rioters' criminal records.

In 1832, the Metropolitan Police Service built a new station house on the site of Nos. 33–34. This did not include the Bow Street Runners, who retained their own identity until the organisation disbanded in 1839. A new magistrates' court was designed by John Taylor at a cost of £38,400 (now £) and constructed between 1879 and 1881. Oscar Wilde was arrested and charged with gross indecency at the court in 1895; following an overnight stay on remand, he ordered tea, toast and eggs from the nearby Tavistock Hotel, who delivered them to his cell. In 1961, Bertrand Russell, then aged 89, was brought to the court after demonstrating as part of the Campaign for Nuclear Disarmament. He later spent a week at Brixton Prison. The courts closed in July 2006 as its Grade II listing meant it was not economical to update it to modern standards. The building was then sold and converted into a boutique hotel and a police museum, both of which opened in May 2021.

Theatre

The Royal Opera House fronts onto Bow Street.

There has been a theatre on or near Bow Street since the first opened in 1732, designed by Edward Shepherd for the actor John Rich. Rich also lived on Bow Street between 1754 and 1761. The presence of the theatre gave the area a reputation for prostitution and changed the character of Bow Street. The first theatre was destroyed by fire in 1808, and a second building, designed by Robert Smirke, opened the following year, but was also destroyed by fire in 1856. The third building was designed by Edward Middleton Barry and opened in 1858. The Floral Hall, part of Barry's redevelopment, was badly damaged by fire in 1956, but the remainder survived through the 20th century. A £9.75 million modernisation and extension scheme took place between 1994 and 2000, including a reconstruction of the Floral Hall.

Later history
In March 1919, a riot broke out on Bow Street after around 2,000 overseas World War I servicemen awaiting demobilisation clashed with local police. Four Canadian servicemen were later charged with incitement to riot. The event was dubbed in the media as the "Battle of Bow Street".

The Design Council, a charity promoting modern design of buildings, including accessibility for the disabled, has been based at No. 34 Bow Street since 1994.

Cultural references
Bow Street Police Station is mentioned in the Sherlock Holmes story The Man with the Twisted Lip. At the station, Holmes reveals that the beggar Hugh Boone is the aristocrat Neville St. Clair in disguise.

Bow Street is one of the streets on the British version of the game Monopoly, which is based in London. It forms a group with Marlborough Street and Vine Street, all of which have connections to the police and law.

title: Bow Street


text:
Rodney Brooks

Rodney Allen Brooks (born 30 December 1954 ) is an Australian roboticist, Fellow of the Australian Academy of Science, author, and robotics entrepreneur, most known for popularizing the actionist approach to robotics. He was a Panasonic Professor of Robotics at the Massachusetts Institute of Technology and former director of the MIT Computer Science and Artificial Intelligence Laboratory. He is a founder and former Chief Technical Officer of iRobot and co-founder, Chairman and Chief Technical Officer of Rethink Robotics (formerly Heartland Robotics) and currently is the co-founder and Chief Technical Officer of Robust.AI (founded in 2019).

Life
Brooks received an M.A. in pure mathematics from Flinders University of South Australia. In 1981, he received a PhD in Computer Science from Stanford University under the supervision of Thomas Binford. He has held research positions at Carnegie Mellon University and MIT and a faculty position at Stanford University. He joined the MIT faculty in 1984. He was Panasonic Professor of Robotics at the Massachusetts Institute of Technology. He was director of the MIT Computer Science and Artificial Intelligence Laboratory (1997–2007), previously the "Artificial Intelligence Laboratory".

In 1997, Brooks and his work were featured in the film Fast, Cheap & Out of Control.

Brooks became a member of the National Academy of Engineering in 2004 for contributions to the foundations and applications of robotics, including establishing consumer and hazardous environment robotics industries.

Academic work
Instead of computation as the ultimate conceptual metaphor that helped artificial intelligence become a separate discipline in the scientific community, he proposed that action or behavior are more appropriate to be used in robotics. Critical of applying the computational metaphor, even to the fields where the action metaphor is more relevant, he wrote in 2008 that:

"Some of my colleagues have managed to recast Pluto's orbital behavior as the body itself carrying out computations on forces that apply to it. I think we are perhaps better off using Newtonian mechanics (with a little Einstein thrown in) to understand and predict the orbits of planets and others. It is so much simpler."

In his 1990 paper, "Elephants Don't Play Chess", Brooks argued that for robots to accomplish everyday tasks in an environment shared by humans, their higher cognitive abilities, including abstract thinking emulated by symbolic reasoning, need to be based on the primarily sensory-motor coupling (action) with the environment, complemented by the proprioceptive sense which is a critical component in hand–eye coordination, pointing out that: "Over time there's been a realization that vision, sound-processing, and early language are maybe the keys to how our brain is organized."

Industrial work
Brooks was an entrepreneur before leaving academia to found Rethink Robotics. He was one of ten founders of Lucid Inc., and worked with them until the company's closure in 1993. Before Lucid closed, Brooks had founded iRobot with former students Colin Angle and Helen Greiner.

Robots
He experimented with off-the-shelf components, such as Fischertechnik and Lego, and tried to make robots self-replicate by putting together clones of themselves using the components. His robots include mini-robots used in oil wells explorations without cables, the robots that searched for survivors at Ground Zero in New York, and the robots used in medicine doing robotic surgery.

In the late 1980s, Brooks and his team introduced Allen, a robot using subsumption architecture. Brooks' work focused on engineering intelligent robots to operate in unstructured environments and understanding human intelligence through building humanoid robots.
 * Allen

 * Baxter

Introduced in 2012 by Rethink Robotics, an industrial robot named Baxter was intended as the robotic analogue of the early personal computer designed to safely interact with neighbouring human workers and be programmable for the performance of simple tasks. The robot stops if it encounters a human in the way of its robotic arm and has a prominent off switch that its human partner can push if necessary. Costs were projected to be the equivalent of a worker making $4 an hour.

AI
In June 2024, Brooks said GenAI is overrated.

title: Rodney Brooks


text:
Wikipedia:Articles for deletion/GeorgLadanyi

The complete content is from, and doesn't mention Georg Ladanyi once. I could not find a relation between the text and the title of the article. The article talks about another person a lot, however (David A. Bannister). Copyvio & Wrong place/unrelated text. Delete?
 * This is a little weird. I'm going to have to say that this should be listed on Copyright problems and not here. It probably could have been speedy deleted as something between a newbie test and patent nonsense. -- Cyrius|&#9998 12:56, May 3, 2004 (UTC)

 * Patent nonsense. Speeddelete. (Hey! That has five e's!) Wile E. Heresiarch 14:04, 3 May 2004 (UTC)
 * Something - I'm not sure exactly what - has escaped from the sandbox.  Delete. - Lucky 6.9 20:53, 3 May 2004 (UTC)
 * Delete. Could be sandbox fugitive, but a prank by an anon seems more likely to me. Either way delete. Andrewa 14:56, 4 May 2004 (UTC)
 * Delete. Bizarre. A newbie test, I would guess. Andris 04:05, May 7, 2004 (UTC)
 * Delete. Cribcage 03:17, 8 May 2004 (UTC)
 * Delete. Pattern suggests a plain cut and paste from elsewhere. Kim Bruning 17:40, 8 May 2004 (UTC)


text:
Indian prawn

The Indian prawn (Fenneropenaeus indicus, formerly Penaeus indicus) is one of the major commercial prawn species of the world. It is found in the Indo-West Pacific from eastern and south-eastern Africa, through India, Malaysia and Indonesia to southern China and northern Australia. Adult shrimp grow to a length of about 22 cm and live on the seabed to depths of about 90 m. The early developmental stages take place in the sea before the larvae move into estuaries. They return to the sea as sub-adults.

The Indian prawn is used for human consumption and is the subject of a sea fishery, particularly in China, India, Indonesia, Vietnam and Thailand. It is also the subject of an aquaculture industry, the main countries involved in this being Saudi Arabia, Vietnam, Iran and India. For this, wild seed is collected or young shrimps are reared in hatcheries and kept in ponds as they grow. The ponds may be either extensive with reliance on natural foods, with rice paddy fields being used in India after the monsoon period, or semi-intensive or intensive, with controlled feeding. Harvesting is by drainage of the pond.

Common names
F. indicus is known by many common names around the world, including Indian white prawn, Tugela prawn, white prawn, banana prawn, Indian banana prawn and red leg banana prawn, some of which may also apply to the related species Fenneropenaeus merguiensis. The name white shrimp may also refer to other species.

Ecology and life cycle
F. indicus is a marine decapod with estuarine juveniles. It prefers mud or sandy mud at depths of 2 - 90 m. It grows to 228 mm and has a life span of 18 months. After hatching, free-swimming nauplii are obtained, which further passes through protozoea, mysis and then to postlarval stage, which resembles the adult prawn. The postlarvae migrate to the estuaries, feed and grow until they attain a length of 110–120 mm, and these sub adults return to the sea and get recruited into fishery. It is also commonly used in shrimp farming.

Fisheries and aquaculture
The world's production of shrimp is about 6 million tonnes, of which approximately 3.4 million tonnes is contributed by capture fisheries and 2.4 tonnes by aquaculture. China and four other Asian countries, including India, Indonesia, Vietnam and Thailand, together account for 55% of the capture fisheries. Among the shrimp, the contribution of F. indicus to global fisheries was around 2.4%, and to global farmed shrimp production was 1.2% in 2005. Currently F. indicus is mainly cultured in Saudi Arabia, Vietnam, Islamic Republic of Iran and India. Saudi Arabia was the largest producer in 2005 at nearly 11,300 tonnes with Vietnam not far behind with 10,000 tonnes. In India F. indicus farming declined from 5200 tonnes in 2000 to 1100 tonnes in 2005 due to preference of farmers for P. monodon.

Fishery
In 2010, Greenpeace International added the Indian prawn to its seafood red list. Although the Indian prawn itself is not threatened, the methods used to capture it result in a large amount of bycatch, which includes endangered species such as sea turtles.

Aquaculture
Production cycle of F. indicus follows the same steps as for other species of shrimp, i.e., seed production and Grow-out of the post larvae to marketable size. The sources of seeds and grow-out techniques can be differed as desired by the farmer to achieve a balance between the cost of production and the desired quantity of output.

Supply of seeds
Seeds can be obtained from the wild or by establishment of hatcheries. In traditional paddy field systems the juveniles which have congregated near the sluice gates are allowed to enter the field with the incoming high tide. Among the prawn species entering the field F. indicus constitute around 36%–43%. Earlier wild seeds were also collected and sold to shrimp farmers. Nowadays the dependence on wild seed has been reduced due to establishment of hatcheries and also due to reduction in wild seeds due to overfishing.

Broodstock
Intensification of cultured shrimp is limited by seed supply. The production of seeds in hatcheries depends on the availability of broodstock and quality of spawners. Spawners for seed production can be obtained from the wild or can be developed by induced maturation in hatcheries.

Matured individuals can be collected from the wild during their peak spawning seasons in March/April and July/August in the tropics. A temperature range of 27 - 31 C and salinity of 30‰–35‰ is ideal for spawning.

Although hatcheries in the developing countries still depend on wild seed, maturation can be induced by eyestalk ablation technique where eyestalks of females are unilaterally ablated to stimulate endocrine activity. The ablated females spawn after 4 days, with a peak observed at days 5–6. However it is expensive to raise spawners in captivity and ablated shrimps result in less hardy fry with low survival rate. Even though the fecundity of the ablated females may not differ significantly, the hatch rates of ablated females was found to be markedly less (37.8% to 58.1%) than that of unablated females (69.2%). It is also found that wild females are more fecund per unit weight than ablated females. However quantitatively the number of spawns, eggs and nauplii produced by ablated females is ten, eight and six times respectively that of unablated females.

The size of females used for broodstock and spawning should preferably be above be 150 mm and males above 140 mm, as they mature at approximately 148 mm and 128 mm respectively.

Hatchery
Circular tanks of 2–5 tonnes capacity are used to rear larvae from nauplius to mysis stage. The salinity of water is maintained at around 32‰ and pH at 8.2. Feed is not provided to nauplius as it is a non-feeding stage. The protozoea stage is supplied with a mixed culture of diatoms dominated by Chaetoceros spp. or Skeletonema spp. at a concentration on around 30,000 to 40,000 cells per ml. The best algal density promoting highest survival, growth and fastest larval development is around 60–70 cells per μL. From the mysis stage they are also fed with artemia nauplii and egg-prawn-custard mix. Post larval rearing can be continued in the same tank and post-larvae (PL) are fed with minced mussel meat, mantis shrimp powder or variety of other fresh feeds of particle size 200–1000 μm till they reach PL-20 (day 20 of post-larva). After PL-20 stage they can be stocked directly into grow-out ponds without acclimatization.

Grow-out techniques
Grow-out techniques can be extensive, semi-intensive or intensive.

Extensive
This is the traditional system of shrimp farming which involves stocking of the wild seed with incoming tidal water is practiced in Bangladesh, India, Indonesia, Myanmar, Philippines, and Vietnam. On the southwest coast of India, low-lying coastal paddy fields are used for growing salinity tolerant variety of paddy called ‘pokkali’ and shrimp farming is carried out post monsoon during November to April. It takes an average of 150–180 days for a single crop to be ready to harvest. The estimated production of prawn-cum-paddy culture varies from 400 to 1200 kg/ha for six months period. F. indicus forms about 36%–43% of the total yield of shrimp which can go up to 400–900 kg/ha/yr. Extensive culture can be made more productive by construction of artificial ponds, use of aeration and supplementing with artificial diet. This can increase the productivity to 871.5 kg/ha/320 days in mixed culture of prawns. Monoculture of F.indicus can yield a net profit of up to Rs.8000 (approx. US$180–200) per hectare per annum for 2 crops.

Semi-intensive
Compared with traditional type of management, semi-intensive production are on a relatively smaller scale with 0.2–2 hectare ponds and also deeper 1.0–1.5 m. Stock densities can range from 20–25 PL/m2 using hatchery derived seeds for monoculture. Natural feeds are grown by application of fertilizers and supplementary feeds are also given during the culture at a rate of 4–5 times a day. Water exchange at the rate of 30%–40% is carried out using pumps. Supplementary aeration is also provided using 4–6 aerators per hectare. A culture period may last from 100–150 days depending on various factors.

Intensive
Intensive farming is tightly controlled system of farming with very less dependence on natural foods and high level of mechanization. The ponds are also usually very small (0.1–1 ha), and the stocking density very high (50–100 PL/m2). Water exchange of around 30% daily is essential to avoid degradation of water due to high stocking density and feeding rate (5–7 times/day). Production level of around 10,000–20,000 kg/ha/yr can be achieved. A culture period lasts from 120–140 days.

Harvesting
In traditional farming harvesting is done by fitting conical nets on the sluice gates and opening them during low tide. The shrimp are trapped in the net as the water recedes. The remaining shrimp are harvested by cast netting. In semi-intensive and intensive practices, harvesting is done by complete draining of the pond. The rest of the shrimp are collected by hand.

Production costs and market value
Production cost depends on type of culture used, scale of production, number of production cycles per year, etc. It is estimated that seed production cost was US$1.6/1000. The cost of adult shrimp can range from US$4–5/kg.

The Indian shrimp has a relatively lower market value than P. monodon. Average price of white shrimp is US$5.5/kg for a size range of 21/25 shrimps per kg, while for P. monodon it is US7-13/kg. However, as F. indicus is more easily bred and reared, the relative profit gained by F.indicus may be higher per input than it seems from the above figures.

Traditionally the shrimp are exported as head-on, headless, tail-on or frozen in blocks. The profit can be increased by value-addition to the shrimp in the form of shrimp pickles, cutlets, battered, ready-to-cook, etc.

title: Indian prawn