identifier stringlengths 7 768 | collection stringclasses 3 values | open_type stringclasses 1 value | license stringclasses 2 values | date float64 2.01k 2.02k ⌀ | title stringlengths 1 250 ⌀ | creator stringlengths 0 19.5k ⌀ | language stringclasses 357 values | language_type stringclasses 3 values | word_count int64 0 69k | token_count int64 2 438k | text stringlengths 1 388k | __index_level_0__ int64 0 57.4k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
https://ru.wikipedia.org/wiki/%D0%92%D0%B0%D1%80%D1%88%D0%B0%D0%B2%D0%B0%20%D0%9E%D0%BB%D1%8C%D1%88%D0%B8%D0%BD%D0%BA%D0%B0-%D0%93%D1%80%D0%BE%D1%85%D0%BE%D0%B2%D1%81%D0%BA%D0%B0%D1%8F | Wikipedia | Open Web | CC-By-SA | 2,023 | Варшава Ольшинка-Гроховская | https://ru.wikipedia.org/w/index.php?title=Варшава Ольшинка-Гроховская&action=history | Russian | Spoken | 52 | 188 | Варша́ва Ольши́нка-Грохо́вская () — остановочный пункт железной дороги в Варшаве (расположен в районе Прага-Полудне), в Мазовецком воеводстве Польши. Имеет 1 платформу и 2 пути.
Остановочный пункт на железнодорожной линии Варшава-Восточная — Дорогуск, построен в 1915 году.
Ссылки
Информации в базе atlaskolejowy.pl
Информации в базе bazakolejowa.pl
Остановочные пункты в Мазовецком воеводстве
Транспорт Варшавы | 10,354 |
https://vi.wikipedia.org/wiki/Khoai%20t%C3%A2y%20Vivaldi | Wikipedia | Open Web | CC-By-SA | 2,023 | Khoai tây Vivaldi | https://vi.wikipedia.org/w/index.php?title=Khoai tây Vivaldi&action=history | Vietnamese | Spoken | 442 | 954 | Khoai tây Vivaldi là giống khoai tây được HZPC nhân giống ở Hà Lan, và sau đó được chuyển đến 'Naturally Best', có trụ sở tại Lincolnshire, Anh, người đã quảng bá và phân phối khoai tây ở Anh.
Các nghiên cứu trong phòng thí nghiệm đã chỉ ra rằng "Vivaldi" có lượng calo và carbohydrate thấp hơn so với nhiều giống khoai tây phổ biến khác. Mặc dù, siêu thị của vùng Sainsbury liệt kê các chi tiết dinh dưỡng của khoai tây 'Vivaldi' và các loại khác, cho thấy khoai tây salad 'Vivaldi' chứa 81 calo và 17,5g carbohydrate mỗi 100g. Ngoài ra 'Khoai tây mới của Charlotte và Khoai tây thương hiệu riêng của Sainsbury có chứa chính xác lượng calo và carbohydrate như' Vivaldi '. Cái tên được chọn làm liên quan đến Antonio Vivaldi, vì, khoai tây được trồng cả ở Anh và ở nước ngoài, chúng có sẵn trong tất cả " Bốn mùa " trong năm. Thế hệ cha mẹ lai tạo được biết đến của 'Vivaldi' là 'TZ 77 148' và 'Monalisa', những loài không được trồng phổ biến ở Anh.
'Vivaldi' là giống thứ hai sản xuất củ hình bầu dục có vỏ màu vàng và thịt màu vàng nhạt và có khả năng kháng bệnh ghẻ. Ngoài việc được gọi là 'khoai tây của người theo dõi cân nặng', nó còn được gọi là 'thợ làm bánh không bơ', vì kết cấu và hương vị kem của nó có nghĩa là người ta không nhất thiết phải thêm bơ để cải thiện hương vị 'Vivaldi nướng.
Đặc điểm thực vật của giống này bao gồm một cây cao với thân cây có sắc tố yếu và các hạch hơi sưng. Phần chót là hình trứng, hoa có bao phấn màu cam và tràng hoa màu trắng với một ngôi sao nổi bật. Củ có vài mắt nông với thịt màu vàng nhạt và mầm có màu đỏ tím.
Các loại kháng bệnh cho giống này bao gồm, miễn dịch tại chỗ với mụn cóc khoai tây và nó có khả năng kháng cao với PVA và PVY. Ngoài ra, Vivaldi là vừa phải kháng cuộn lá, PVX, bệnh mốc sương trên củ, vảy bạc, chân đen và chấm đen và nhạy cảm với trễ bạc lá trên lá, bệnh ghẻ nói chung, bột vảy, Rhizoctonia và chỗ da.
Loại khoai tây này đã giành chiến thắng trong hạng mục Sản phẩm tươi tại giải thưởng Q Food and Drink năm 2006 và giành được giải vàng tại The Grocer Label Awards năm 2011 Nó đã được trao Đại hội RHS.
Tham khảo | 12,282 |
https://war.wikipedia.org/wiki/Mycosphaerella%20vulnerariae | Wikipedia | Open Web | CC-By-SA | 2,023 | Mycosphaerella vulnerariae | https://war.wikipedia.org/w/index.php?title=Mycosphaerella vulnerariae&action=history | Waray | Spoken | 58 | 111 | An Mycosphaerella vulnerariae in uska species han Fungi in nahilalakip ha divisio nga Ascomycota, ngan nga syahan ginhulagway ni Karl Wilhelm Gottlieb Leopold Fuckel, ngan ginhatag han pagkayana nga asya nga ngaran ni Gustav Lindau hadton 1903. An Mycosphaerella vulnerariae in nahilalakip ha genus nga Mycosphaerella, ngan familia nga Mycosphaerellaceae. Waray hini subspecies nga nakalista.
Mga kasarigan
Mycosphaerella | 19,486 |
https://zh.wikipedia.org/wiki/%E6%96%B0%E6%99%AE%E5%88%A9%E8%8C%85%E6%96%AF%20%28%E6%84%9B%E9%81%94%E8%8D%B7%E5%B7%9E%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | 新普利茅斯 (愛達荷州) | https://zh.wikipedia.org/w/index.php?title=新普利茅斯 (愛達荷州)&action=history | Chinese | Spoken | 9 | 185 | 新普利茅斯（）是一個位於美國愛達荷州佩埃特縣的城市。
地理
新普利茅斯的座標為，而該地的平均海拔高度為690米（即2260英尺）。
人口
根據2010年美國人口普查的數據，新普利茅斯的面積為1.78平方千米，均為陸地。當地共有人口1538人，而人口密度為每平方千米864.04人。
參考文獻
愛達荷州城市
佩埃特縣城市 (愛達荷州) | 27,949 |
https://en.wikipedia.org/wiki/1812%20United%20States%20House%20of%20Representatives%20elections%20in%20New%20York | Wikipedia | Open Web | CC-By-SA | 2,023 | 1812 United States House of Representatives elections in New York | https://en.wikipedia.org/w/index.php?title=1812 United States House of Representatives elections in New York&action=history | English | Spoken | 1,561 | 2,330 | The 1812 United States House of Representatives elections in New York were held from December 15 to 17, 1812, to elect 27 U.S. Representatives to represent the State of New York in the United States House of Representatives of the 13th United States Congress. At the same time, a vacancy was filled in the 12th United States Congress.
Background
17 U.S. Representatives had been elected in April 1810 to a term in the 12th United States Congress beginning on March 4, 1811. The representatives' term would end on March 3, 1813. Although the U.S. census of 1810 showed that New York would be entitled to more seats in the House, the New York State Legislature adjourned on March 27, 1812 without re-apportioning the congressional districts. Congressional elections were held, as usual, together with the State elections from April 28 to 30, 1812, but these were subsequently declared void.
On May 6, 1812, Robert Le Roy Livingston resigned his seat to fight in the War of 1812, leaving a vacancy in the 6th District.
The State Legislature reconvened on May 21, 1812, and re-apportioned the congressional district by an Act passed on June 10, 1812. The number of seats was increased to 27, and the date of the elections was set for December 15 to 17. At the same time the vacancy in the former 6th District was to be filled.
Congressional districts
Due to the increase in seats, the previously eliminated 16th and 17th D. were re-established, and four more districts were created. Six districts had two members, elected districtwide on a general ticket.
The 1st District (two seats) comprising the 1st and 2nd Ward of New York County, and Kings, Queens, Suffolk and Richmond counties.
The 2nd District (two seats) comprising the other eight wards of New York County.
The 3rd District comprising Westchester and Rockland counties.
The 4th District comprising Dutchess County, except the towns of Rhinebeck and Clinton; and Putnam County.
The 5th District comprising Columbia County; and Rhinebeck and Clinton in Dutchess County.
The 6th District comprising Orange County.
The 7th District comprising Ulster and Sullivan counties.
The 8th District comprising Delaware and Greene counties.
The 9th District comprising Albany County.
The 10th District comprising Rensselaer County.
The 11th District comprising Saratoga County.
The 12th District (two seats) comprising Clinton, Essex, Franklin and Washington counties.
The 13th District comprising Schenectady and Schoharie counties.
The 14th District comprising Montgomery County.
The 15th District (two seats) comprising Chenango, Broome and Otsego counties.
The 16th District comprising Oneida County.
The 17th District comprising Herkimer and Madison counties.
The 18th District comprising St. Lawrence, Jefferson and Lewis counties.
The 19th District comprising Onondaga and Cortland counties.
The 20th District (two seats) comprising Tioga, Steuben, Cayuga and Seneca counties.
The 21st District (two seats) comprising Ontario, Genesee, Allegany, Niagara and Chautauqua counties.
Note: There are now 62 counties in the State of New York. The counties which are not mentioned in this list had not yet been established, or sufficiently organized, the area being included in one or more of the abovementioned counties.
Result
19 Federalists and 8 Democratic-Republicans were elected to the 13th Congress, and one Federalist to fill the vacancy in the 12th Congress. The incumbents Sage and Avery were re-elected; the incumbent Van Cortlandt was defeated. Grosvenor was elected to fill the vacancy, and to succeed himself in the next Congress.
Note: The Anti-Federalists called themselves "Republicans." However, at the same time, the Federalists called them "Democrats" which was meant to be pejorative. After some time both terms got more and more confused, and sometimes used together as "Democratic Republicans" which later historians have adopted (with a hyphen) to describe the party from the beginning, to avoid confusion with both the later established and still existing Democratic and Republican parties.
Aftermath, special elections and contested elections
Thomas P. Grosvenor took his seat in the 12th United States Congress on January 29, 1813.
William Dowse, elected in the 15th D., died on February 18, 1813, before the begin of the congressional term. A special election to fill the vacancy was held at the time of the annual State election from April 26 to 28, and John M. Bowers, of the same party, was declared elected.
Note: One vote was given for "John M. Bowey", and 17 votes were scattered among other people. At the time, in the State of New York ballots with the name written by hand, or printed and distributed by the party machine men, were put in a box marked with the office the vote was intended for, like "Congress" or "Governor".
The House of Representatives of the 13th United States Congress met for the first time at the United States Capitol in Washington, D.C., on May 24, 1813, and Avery, Benson, Comstock, Denoyelles, Fisk, Geddes, Grosvenor, Kent, Lefferts, Lovett, Markell, Miller, Moffitt, Oakley, Post, Sage, Sherwood, Shiphard, Taylor, Thompson and Winter took their seats on this day. Boyd and Smith took their seats on May 25; Howell on May 26; Hopkins on June 4; Bowers on June 21; and Hasbrouck sometime before July 1.
Two days after Bowers had taken his seat, on June 23, Jonathan Fisk presented a petition on behalf of Isaac Williams, Jr., contesting the election of John M. Bowers to fill the vacancy caused by the death of William Dowse. Williams, Jr., claimed that the votes returned for "Isaac Williams" were intended for him, since there were only two candidates - Bowers and Williams, Jr. - and although there were two other men named Isaac Williams living in this district, neither of them was running for Congress. On July 2, the United States House Committee on Elections reported that it seemed the claim was justified, considering that in some towns apparently all votes were given for "Williams" and none for "Williams, Jr." Nevertheless, the Committee were "of the opinion that further evidence was necessary, to form a correct decision" and postponed the matter "until the first Wednesday of the next session."
On July 7, 1813, a petition on behalf of Peter A. Jay and Benjamin B. Blydenburgh was presented to the House, contesting the election of Ebenezer Sage and John Lefferts in the 1st D. On July 13, the Committee on Elections postponed this case also to the next session, but no further action was taken.
Egbert Benson resigned his seat on August 2, 1813, at the end of the first session of the 13th Congress. A special election to fill the vacancy was held in the 2nd District from December 28 to 30, and was won by William Irving, of the opposing party. Irving took his seat on January 22, 1814.
The second session of the 13th Congress began on December 6, 1813, and on December 13, Fisk asked the Committee to submit its final report. On December 20, the Committee reported that in the towns of Exeter, Milford and Westford 322 votes were in fact given for "Isaac Williams, Jr.", but had been returned for "Isaac Williams" by the election inspectors "by mistake." The House declared unanimously Williams, Jr., entitled to the seat instead of Bowers. Williams, Jr., took his seat on January 24, 1814.
Notes
Sources
The New York Civil List compiled in 1858 (see: pg. 66 for district apportionment; pg. 70 for Congressmen)
Members of the Thirteenth United States Congress
Election result 1st D. at project "A New Nation Votes", compiled by Phil Lampi, hosted by Tufts University Digital Library
Election result 2nd D. at "A New Nation Votes"
Election result 3rd D. at "A New Nation Votes"
Election result 4th D. at "A New Nation Votes"
Election result 5th D. at "A New Nation Votes"
Election result 6th D. at "A New Nation Votes"
Election result 7th D. at "A New Nation Votes"
Election result 8th D. at "A New Nation Votes"
Election result 9th D. at "A New Nation Votes"
Election result 10th D. at "A New Nation Votes"
Election result 11th D. at "A New Nation Votes"
Election result 12th D. at "A New Nation Votes"
Election result 13th D. at "A New Nation Votes"
Election result 14th D. at "A New Nation Votes"
Election result 15th D. at "A New Nation Votes"
Election result 16th D. at "A New Nation Votes"
Election result 17th D. at "A New Nation Votes"
Election result 18th D. at "A New Nation Votes"
Election result 19th D. at "A New Nation Votes"
Election result 20th D. at "A New Nation Votes"
Election result 21st D. at "A New Nation Votes"
1813 Special election result 2nd D. at "A New Nation Votes"
Voided election result Old 2nd D. at "A New Nation Votes" [gives result only for Richmond Co.]
Voided election result Old 3rd D. at "A New Nation Votes" [gives result only for Orange Co.]
Voided election result Old 5th D. at "A New Nation Votes" [gives result only for Greene Co.]
Voided election result Old 7th D. at "A New Nation Votes" [gives result only for Schenectady Co.]
Voided election result Old 10th D. at "A New Nation Votes" [gives result only for Jefferson Co.]
Voided election result Old 14th D. at "A New Nation Votes" [gives result only for Cayuga Co.]
Voided election result Old 15th D. at "A New Nation Votes" [gives result only for Niagara Co.]
1812
New York
United States House of Representatives | 9,502 |
https://no.wikipedia.org/wiki/Adygejsk | Wikipedia | Open Web | CC-By-SA | 2,023 | Adygejsk | https://no.wikipedia.org/w/index.php?title=Adygejsk&action=history | Norwegian | Spoken | 98 | 250 | Adygejsk (russisk: Адыге́йск, adygisk: Адыгэкъалэ) er en by i Republikken Adygia i Russland. Byen ligger nær Krasnodar-reservoaret, 100 km nordvest for Majkop. Innbyggertall: 12 209 (folketelling 2002), 12 548 (folketelling 1989).
Historie
Byen ble grunnlagt som bosetningen Adygejskij (russisk: Адыге́йский) i 1969, i forbindelse med byggingen av Krasnodar-reservoaret. Da den fikk innvilget bystatus i 1976 ble samtidig navnet endret til Teutsjezjsk (russisk: Теуче́жск), men i 1992 ble det endret tilbake til Adygejsk igjen.
Eksterne lenker
Om Adygejsk på Republikken Adygias nettsted
Byer i Adygia
Bosetninger etablert i 1969
1969 i Russland
Byer grunnlagt i 1976
1976 i Russland | 11,485 |
https://en.wikipedia.org/wiki/Abdulghani%20Halalu | Wikipedia | Open Web | CC-By-SA | 2,023 | Abdulghani Halalu | https://en.wikipedia.org/w/index.php?title=Abdulghani Halalu&action=history | English | Spoken | 153 | 225 | Abdulghani Halalu (, kunya: 'Abu Khaldun') (1947 – November 5, 2017) is a Palestinian politician. As of 2015, he was a member of the politburo of the Democratic Front for the Liberation of Palestine and in-charge of the Syria Region of DFLP.
Halalu was born in Jaffa in 1947. His family fled to Syria during the 1948 Palestinian expulsion and flight. Halalu was a co-founder of the DFLP in 1969. He was a fighter in Jordan, but later returned to Syria. He acted as the DFLP representative in Baghdad, then in the Libyan capital Tripoli, before returning again to Syria to take charge of the international representative of the movement. He later became the leader of DFLP in Syria. Halalu was a member of the Palestinian National Council, the Arab National Conference and the Arab People's Conference.
References
People from Jaffa
1947 births
2017 deaths
Democratic Front for the Liberation of Palestine politicians | 43,573 |
https://arz.wikipedia.org/wiki/%D8%B1%D8%A7%D8%AC%D9%86%D9%81%D8%A7%D9%84%20%D8%A7%D9%84%D9%81%D8%B1%D9%8A%D8%AF%20%D8%B1%D9%88%D8%B4%D8%B1%20%D9%84%D9%88%D9%86%D8%AF | Wikipedia | Open Web | CC-By-SA | 2,023 | راجنفال الفريد روشر لوند | https://arz.wikipedia.org/w/index.php?title=راجنفال الفريد روشر لوند&action=history | Egyptian Arabic | Spoken | 39 | 127 | راجنفال الفريد روشر لوند كان دبلوماسى من النرويج.
حياته
راجنفال الفريد روشر لوند من مواليد يوم 24 فبراير 1899, مات فى 23 اكتوبر 1975.
الحياه العمليه
كان بيشتغل فى: الامم المتحده.
المناصب
لينكات برانيه
مصادر
دبلوماسيين
دبلوماسيين من النرويج | 11,577 |
https://simple.wikipedia.org/wiki/Edward%20McClain | Wikipedia | Open Web | CC-By-SA | 2,023 | Edward McClain | https://simple.wikipedia.org/w/index.php?title=Edward McClain&action=history | Simple English | Spoken | 109 | 166 | Edward Browning "E. B." McClain (April 29, 1940 – November 9, 2020) was an American politician and chemist. He was a Democratic member of both the Alabama Senate from 1995 through 2009 and the Alabama House of Representatives from 1987 through 1994. He was born in Bessemer, Alabama.
In 2009, he was convicted of money laundering and corrpution. He was sentenced to 70 months.
McClain died on November 9, 2020 in Pleasant Grove, Alabama at the age of 80.
References
1940 births
2020 deaths
State legislators of the United States
American chemists
American fraudsters
Scientists from Alabama
Politicians from Alabama
Democratic Party (United States) politicians
People from Bessemer, Alabama | 7,862 |
https://nl.wikipedia.org/wiki/Andeocalynda%20lojaense | Wikipedia | Open Web | CC-By-SA | 2,023 | Andeocalynda lojaense | https://nl.wikipedia.org/w/index.php?title=Andeocalynda lojaense&action=history | Dutch | Spoken | 32 | 60 | Andeocalynda lojaense is een insect uit de orde Phasmatodea en de familie Diapheromeridae. De wetenschappelijke naam van deze soort werd voor het eerst geldig gepubliceerd in 2020 door Hennemann en Conle.
Diapheromeridae | 34,729 |
https://vi.wikipedia.org/wiki/Pomacentrus%20pavo | Wikipedia | Open Web | CC-By-SA | 2,023 | Pomacentrus pavo | https://vi.wikipedia.org/w/index.php?title=Pomacentrus pavo&action=history | Vietnamese | Spoken | 400 | 874 | Pomacentrus pavo là một loài cá biển thuộc chi Pomacentrus trong họ Cá thia. Loài này được mô tả lần đầu tiên vào năm 1787.
Từ nguyên
Từ định danh pavo trong tiếng Latinh mang nghĩa là "chim công", hàm ý đề cập đến kiểu màu của loài cá này giống với loài công lam Ấn Độ.
Phạm vi phân bố và môi trường sống
Từ vùng bờ biển Đông Phi, phạm vi của P. pavo trải dài về phía đông đến Tuamotu, băng qua vùng biển các nước Đông Nam Á và các đảo quốc ở châu Đại Dương, giới hạn phía bắc đến vùng biển phía nam Nhật Bản, phía nam đến Úc và đảo Lord Howe ngoài khơi.
Tại Việt Nam, loài này được ghi nhận tại Nha Trang, cù lao Câu (Bình Thuận) và quần đảo Trường Sa. P. pavo sống tập trung gần các rạn san hô ngoài biển khơi và trong đầm phá, nơi có nền đáy cát và đá vụn ở độ sâu đến 18 m.
Mô tả
Chiều dài lớn nhất được ghi nhận ở P. pavo là 9 cm. Cơ thể của P. pavo có màu xanh lục lam, với các vệt xanh óng trên đầu. Vảy cá có các vạch màu xanh sẫm. Có đốm đen nổi bật ngay rìa nắp mang. Vây đuôi ở nhiều cá thể có màu vàng nhạt. Các vây có viền xanh ánh kim.
Số gai ở vây lưng: 13; Số tia vây ở vây lưng: 13–14; Số gai ở vây hậu môn: 2; Số tia vây ở vây hậu môn: 12–14; Số gai ở vây bụng: 1; Số tia vây ở vây bụng: 5.
Sinh thái học
Thức ăn của P. pavo bao gồm tảo và các loài động vật phù du. Chúng thường hợp thành những nhóm nhỏ. Cá đực có tập tính bảo vệ và chăm sóc trứng.
Tham khảo
P
Cá Ấn Độ Dương
Cá Thái Bình Dương
Cá Somalia
Cá Kenya
Cá Tanzania
Cá Mozambique
Cá Nam Phi
Cá Myanmar
Cá Thái Lan
Cá Việt Nam
Cá Indonesia
Cá Malaysia
Cá Philippines
Cá Đài Loan
Cá Nhật Bản
Cá Úc
Cá Papua New Guinea
Cá Palau
Cá Fiji
Cá Tonga
Cá Nouvelle-Calédonie
Động vật quần đảo Solomon
Động vật Vanuatu
Động vật quần đảo Marshall
Động vật Kiribati
Động vật Polynésie thuộc Pháp
Động vật được mô tả năm 1787 | 42,845 |
https://fy.wikipedia.org/wiki/Hayuma%20Tanaka | Wikipedia | Open Web | CC-By-SA | 2,023 | Hayuma Tanaka | https://fy.wikipedia.org/w/index.php?title=Hayuma Tanaka&action=history | West Frisian | Spoken | 42 | 96 | (31 july 1982) is in Japansk fuotballer, dy't spilet foar Matsumoto Yamaga FC. Earder spile foar Yokohama F. Marinos, Tokyo Verdy en Nagoya Grampus.
Statistiken
Keppeling om utens
National Football Teams
Japan National Football Team Database
Japansk fuotballer
Persoan berne yn 1982 | 40,337 |
https://arz.wikipedia.org/wiki/%D8%AC%D9%88%D9%86%20%DA%86%D9%88%D8%B1%DA%86%20%28%D9%85%D9%86%D8%A7%D9%81%D8%B3%20%D8%A7%D9%84%D8%B9%D8%A7%D8%A8%20%D9%82%D9%88%D9%89%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | جون چورچ (منافس العاب قوى) | https://arz.wikipedia.org/w/index.php?title=جون چورچ (منافس العاب قوى)&action=history | Egyptian Arabic | Spoken | 87 | 244 | جون چورچ كان منافس العاب قوى من المملكه المتحده.
حياته
جون چورچ من مواليد يوم 26 ابريل 1882 فى لوندون بوروج اوف كرويدون, مات فى 26 نوفمبر 1962.
المشاركات
شارك فى:
الالعاب الاولمبيه الصيفيه 1908
العاب قوى
هى مجموعة رياضات متكونه من الجرى و المشى و الرمى و النط, كانت موجوده قبل الميلاد بايام الحضاره اليونانيه و بقت بعدين جزء اساسى من الالعاب الاولمبيه الى بتتنظم كل 4 سنين و بتتعرف بأم الألعاب.
لينكات برانيه
مصادر
منافس العاب قوى
العاب قوى
منافس العاب قوى من المملكه المتحده | 126 |
https://id.wikipedia.org/wiki/Wang%20Yong | Wikipedia | Open Web | CC-By-SA | 2,023 | Wang Yong | https://id.wikipedia.org/w/index.php?title=Wang Yong&action=history | Indonesian | Spoken | 64 | 147 | Wang Yong (; kelahiran Desember 1955 di Gaizhou) adalah seorang politikus Tiongkok. Ia menjabat sejak 2013 sebagai Penasihat Negara dan merupakan mantan Ketua Komisi Administrasi dan Pengawasan Aset Milik Negara. Dari September 2008 sampai Agustus 2010, ia menjadi Direktur Administrasi Umum Pengawasan, Pemeriksaan dan Penyaringan Kualitas. Pada 2010, ia diangkat oleh Majalah Forbes sebagai Tokoh Paling Berpengaruh di Dunia ke-62.
Referensi
Politikus dari Yingkou | 18,855 |
https://stackoverflow.com/questions/31321484 | StackExchange | Open Web | CC-By-SA | 2,015 | Stack Exchange | English | Spoken | 631 | 1,013 | Avoiding non-linearity using bit-vectors in z3
I am trying to solve formulas containing thousands of variables. The major portion of these formulas is linear and z3 is chewing through them at an unbelievable speed from my point of view. However, it happens that few constraints introduce some non-linearity. Then, the computation time grows from a few minutes to not be able to have a solution after days of computation.
I thought it would be interesting to try to use bit-vectors but just for those non-linear constraints losing some precision along the way, but this is not an issue for the problem I am trying to solve. So more or less, I want to use small SAT problems by switching to a bit representation for numbers just when needed. I have seen in another post that int2bv and bv2int are treated as uninterpreted so it seems these functions cannot be used. However, I am still unsure as to why they are uninterpreted. Are there any theoretical issues or is it for performance reasons?
I have also seen that the last stable version of z3 can handle floating points (here). However, it seems that going from FP to Reals introduces non-linearity. Therefore, using floating point just for the non-linear constraints and solving the rest with real and integers also seems impossible. I haven’t tried yet, but I am assuming that using floating points for all variables would not scale for the kind of problems I have.
I came up with very naïve functions which would be equivalent to int2bv and bv2int. Obviously, it is very slow even for small examples of non-linearity. Here is the implementation for 8-bit vectors working for positive integers in SMT2.
(define-fun BitVecToInt ((x (_ BitVec 8))) Int
(+
(ite (= #b1 ((_ extract 0 0) x)) 1 0)
(ite (= #b1 ((_ extract 1 1) x)) 2 0)
(ite (= #b1 ((_ extract 2 2) x)) 4 0)
(ite (= #b1 ((_ extract 3 3) x)) 8 0)
(ite (= #b1 ((_ extract 4 4) x)) 16 0)
(ite (= #b1 ((_ extract 5 5) x)) 32 0)
(ite (= #b1 ((_ extract 6 6) x)) 64 0)
(ite (= #b1 ((_ extract 7 7) x)) 128 0)
)
)
(define-fun IntToBitVec ((x Int)) (_ BitVec 8)
(bvor
#b00000000
(ite (> (rem x 2) 0) #b00000001 #b00000000)
(ite (>= (rem x 4) 2) #b00000010 #b00000000)
(ite (>= (rem x 8) 4) #b00000100 #b00000000)
(ite (>= (rem x 16) 8) #b00001000 #b00000000)
(ite (>= (rem x 32) 16) #b00010000 #b00000000)
(ite (>= (rem x 64) 32) #b00100000 #b00000000)
(ite (>= (rem x 128) 64) #b01000000 #b00000000)
(ite (>= x 128) #b10000000 #b00000000)
)
)
Any thoughts on the best way to solve this problem or is there anything in z3 that I have missed and that could make my life easier?
Your BitVecToInt function makes the implicit assumption that the number represented is an unsigned quantity. This might be just fine of course; though if you're using (_ BitVec 8) type as a 2's complement number, then you'll have to take account of that explicitly. So, perhaps you need UBitVec8ToInt and SBitVec8ToInt variants; to be clear about that.
I think the reason why int2bv and bv2int are left uninterpreted is precisely because of the performance implications: Imagine turning an integer to a very-large bit-vector of thousands bits long. The formulas would be really large and with a performance penalty. For smaller target sizes, I think the problem is quite tractable; like you have here with 8-bits.
My (limited) experience with floats in Z3 is that the support is fairly good, provided you don't do conversions to/from Reals. As soon as you go there, problems become intractable. There're some comments here from the Z3 developers regarding that very question: https://github.com/Z3Prover/z3/issues/14
| 29,089 | |
https://stackoverflow.com/questions/40339940 | StackExchange | Open Web | CC-By-SA | 2,016 | Stack Exchange | Cheng Shi, Gary's Student, Robin Mackenzie, SJR, Vegard, Zac, danl, https://stackoverflow.com/users/2474656, https://stackoverflow.com/users/4604845, https://stackoverflow.com/users/5545882, https://stackoverflow.com/users/6916504, https://stackoverflow.com/users/7008044, https://stackoverflow.com/users/7008334, https://stackoverflow.com/users/765395 | English | Spoken | 3,817 | 7,140 | Using VBA to identify a product code within an Excel string
Quick background:
I am in the process of creating a search tool in Visual Basic that will allow me to search for inconsistently named materials in my database, that were entered as free text. While I have developed (with the help of Stack Overflow users) a tool which can search for hundreds or items at once, I need to further improve this.
My Question:
I need to be able to pull out item codes from these material descriptions. These items are general numbers such as: 20405-002 or alternatively: A445 or even B463-563. These are the main types of code I would be searching for, and these would be unique identifiers.
Some examples:
In a plant in Italy, I have a material named:
Siemens;Motor;A4002
In a plant in Germany, it is called:
Motor;FP4742;Siemens;TurnFast;A4002
I would search for the terms Siemens, Motor
My current search would return Siemens, Motor next to the first one, and Motor, Siemens next to the second. I would then want the visual basic to in essense say 'these could be the same part', then to look within both for a matching code. When it finds the matching code, I would want it to return some sort of indicator in an excel cell.
The overall aim: To have a tool I can use to find if two materials are actually the same, with minimum human input. There could be up to 50,000 materials from each of two plants. I also have the price and supplier of these parts. While the supplier is the same 75% of the time, the price is usually within 20% difference of the same material in a different country. If you have any other ideas as to how to see if two free text materials are actually the same, I'd be happy to hear.
My search code:
Function MultiSplitX(ByVal SourceText As String, RemoveBlankItems As Boolean, ParamArray Delimiters()) As String()
Dim a As Integer, b As Integer, n As Integer
Dim i As Integer: i = 33
Dim u As Variant, v As Variant
Dim tempArr() As String, finalArr() As String, fDelimiters() As String
If InStr(TypeName(Delimiters(0)), "()") <> 0 And LBound(Delimiters) = UBound(Delimiters) Then
ReDim fDelimiters(LBound(Delimiters(0)) To UBound(Delimiters(0))) 'If passing array vs array items then
For a = LBound(Delimiters(0)) To UBound(Delimiters(0)) 'build that array
fDelimiters(a) = Delimiters(0)(a)
Next a
Else
fDelimiters = Delimiters(0)
End If
Do While InStr(SourceText, Chr(i)) <> 0 'Find an unused character
i = i + 1
Loop
For a = LBound(fDelimiters) To UBound(fDelimiters) 'Sort Delimiters by length
For b = a + 1 To UBound(fDelimiters)
If Len(fDelimiters(a)) < Len(fDelimiters(b)) Then
u = fDelimiters(b)
fDelimiters(b) = fDelimiters(a)
fDelimiters(a) = u
End If
Next b
Next a
For Each v In fDelimiters 'Replace Delimiters with a common character
SourceText = Replace(SourceText, v, Chr(i))
Next
tempArr() = Split(SourceText, Chr(i)) 'Remove empty array items
If RemoveBlankItems = True Then
ReDim finalArr(LBound(tempArr) To UBound(tempArr))
n = LBound(tempArr)
For i = LBound(tempArr) To UBound(tempArr)
If tempArr(i) <> "" Then
finalArr(n) = tempArr(i)
n = n + 1
End If
Next i
n = n - 1
ReDim Preserve finalArr(LBound(tempArr) To n)
MultiSplitX = finalArr
Else: MultiSplitX = tempArr
End If
Erase finalArr
Erase tempArr
End Function
Thanks for your help everyone :)
Hello. Please provide the relevant code you're using for your current search.
Seems to me you need one of two things here-
1- a very complicated bit of VBA code which you really should have started doing some work on yourself before asking here
2- machine learning, which isn't exactly (to my knowledge) well suited for use in VBA
@danl I usually would try and work on something before asking on here, but I couldn't think of how to get it off the ground. My knowledge of VBA is mainly making monotonous tasks quicker, as opposed to creating dynamic tools. I think machine learning would be useful yes, but it is far above anything I have done so far.
Could you provide a sample of your sheet? it would help. Just of the top of my head, can you not have dropdowns for the user to select the values from? instead of a free text field. If you control what is entered in the sheet, you wouldn't have to do most of what you are attempting to do
This code is interesting, I like your parsing ideas.
If the product codes have a distinct, unique format, you can probably use a few loops with string comparisons (similar to what you're already doing) and regex to extract them.
The issue is I work for a large organisation, and so changing the way people enter data in SAP for example would be a very large project (to standardize it). I can't claim credit for the code unfortunately, another stack overflow user created it for me after it was clear my original idea was suitable or efficient. The issue is they aren't standard at all. They are entered by hundreds of people around the world which causes the issue. I wrote a code ones that isolated non-alphanumerical characters (for delimiting), I was wondering if I could do something based on find numerical characters?
So two rows are a match if a) they have a common set of terms e.g. Siemens and Motor and then b) if they have a common product code that wasn't supplied by the user. Does the test for a match fail if a) passes but b) is not present ?
Precisely Robin, yes.
Is there a list of product codes, or any consistency to their format? Your examples suggest not much!
I'm afraid thats part of the problem. The majority of the time, it is a letter, which is immediately followed by some numbers, ie 'A857'. So something that would work for this would be fantastic.
This is response written in VBA for Excel but used arrays to get/put the data, so you should be able to modify it for a database easily. VB is very similar. If I were to do this work, I would do it in MS Access, in which case you can adapt this code even more easily. Of course, straight VB is always an option. VB is not a great tool for this.
If you work with data much, I strongly recommend you learn the free and open source Python language. You can find a great Python video series for the noob on Youtube from Sentdex. His videos are nice and slow. You will quickly exceed what you can accomplish with VB.
It is difficult to answer the question comprehensively due to the lack of detail and small set of sample data.
There are many ways to approach this, depending on your desired output. I am making the following assumptions.
You are new to coding and want output that is easy to read. As
such, my solution defaults to a single 2x2 array of results. You
can change this to 3+ dimensions by setting DeepArr = True.
You want the results pasted in the same worksheet.
You have a separate list of supplier/vendor codes that can be found in the part codes. The GuessSupplier function depends on this assumption. If need be, update the function based on actual requirements.
I call your raw inputs (like Siemens;Motor;A4002) part codes.
I assume the text after the last semi-colon will always be the part
number. If not, you can easily replace that assumption in the
GuessPartNum function.
The following describes the spreadsheet I used for simple testing.
Sheet "PartCodes" contains the part codes in a single column with sample values in cells B3:B6 (header in B2). Columns G-H are reserved for the results.
Sheet "Suppliers" contains the unique supplier list in a single column (B3:B6).
You can specify sheet names and ranges for inputs and output in the RunMain() sub.
For convenience, I hard coded the sheet names in some places. You should bring these to the surface as arguments.
The code is somewhat verbose to make it easy to understand.
I did not test performance, as I do not have the data set and expect you will run this infrequently.
I added only a trivial amount of error handling.
My complete set of code is below. You will find the RunMain() sub near the bottom. This kicks off the Main() sub that controls the workflow.
Option Base 0
Option Explicit
' 1) Manually eliminate duplicates in your parts list using Excel built-in feature.
' a) highlight the range
' b) Data ribbon > Remove Duplicates
' 2) Create a supplier list on a separate sheet in teh same workbook
' 3) Edit the RunMain() procedure per your data. I assume: your part code list
' - part code list is in cells B3:B10 of the PartCodes sheet.
' - supplier list in cells b4:b6 of Suppliers sheet.
' - output goes to D2 in PartCodes sheet.
' 4) Run the RunMain() procedure simply kicks off Main.
' Main() sub does the following:
' a)Run ProcessPartCodes:
' i. load the parts codes from the worksheet into an array
' ii. run GuessPartNum and GuessSupplier and place results in the parts code array.
' b) Run FindMatches to add more to the array. Finds other part codes that may be for the same part.
' Logic is described in the function.
' c) Run ArrayToRange to paste part of the result set to the workseet. Note that
' the ourput array is more than 2 dimensions, so not all data is pasted neatly.
' I leave it to you to determine how you want to format the data for output.
'
Function RangeToArray(inputRange As Range)
'Copies values from a rectangular range to a 2D Array.
'Array is always 2D, even if data is a single column or row.
'inputRange: a rectangular range
Dim Col1 As Integer, row1 As Integer
Dim i As Integer, j As Integer
Dim rowCnt As Integer
Dim colCnt As Integer
Dim retArr() As Variant
' Size output array
rowCnt = inputRange.Rows.Count
colCnt = inputRange.Columns.Count
ReDim retArr(1 To rowCnt, 1 To colCnt) As Variant
' Load range values into array
For i = 1 To rowCnt
For j = 1 To (colCnt)
retArr(i, j) = Trim(inputRange.Cells(i, j))
Next j
Next i
' Return array
RangeToArray = retArr
End Function
Sub ArrayToRange(myArr As Variant, Target As Range)
' Copies the content of a 2D array to a Range.
' myArr must be exactly 2 dimensions
' Target is a range. If more than 1 cell, the top left cell is used.
' Copies the array to the range starting with the top left cell.
' Target Range size can be a single cell and need not match the array dimensions.
Dim r As Long, tgtRow As Long
Dim c As Long, tgtCol As Long
Dim firstRow As Long
Dim firstCol As Long
Dim lastRow As Long
Dim lastCol As Long
' Find the top left cell of the Target Range
tgtRow = Target.Row
tgtCol = Target.Column
' Set target range dimesions based on array size.
firstRow = tgtRow + LBound(myArr, 1)
firstCol = tgtCol + LBound(myArr, 2)
lastRow = tgtRow + UBound(myArr, 1)
lastCol = tgtCol + UBound(myArr, 2)
' The next row would usually work. If you get funky data, it will fail,
' so, we will use a loop instead.
' Range(Cells(firstRow, firstCol), Cells(lastRow, lastCol)) = myArr
' Loop through rows and columns, setting cell values one at a time.
For r = LBound(myArr, 1) To UBound(myArr, 1)
For c = LBound(myArr, 2) To UBound(myArr, 2)
On Error Resume Next ' Prevent one bad value from killing the entire operation.
Cells(tgtRow + r - 1, tgtCol + c) = myArr(r, c)
On Error GoTo 0
Next c
Next r
End Sub
' Not used, this is just an example
'Public Function RangeCorners(Optional MyRange As Range = Range("c2:c10"))
' TopLeft = MyRange.Cells(1)
' BottomLeft = MyRange.Cells(.Rows.Count, 1)
' TopRight = MyRange.Cells(1, .Columns.Count)
' BottomRigt = MyRange.Cells(.Cells.Count)
' RangeCorners = Array(TopLeft, TopRight, BottomLeft, BottomRight)
'End Function
Function IsInArray(stringToBeFound As String, arr As Variant) As Boolean
'Returns True if stringToBeFound is in the array (arr); else False
'This one-liner need not be in a fucntion, but makes reading code easier.
IsInArray = (UBound(Filter(arr, stringToBeFound)) > -1)
End Function
Function GuessPartNum(splitPartCode As Variant, Optional delim As String = ";")
' Find a way to determine what part of the partCode is the part number.
' Perhaps it is always last. Perhaps it always has at least 3 digits.
' Simply takes the last item from the part code. Update this logic to whatever
' makes sense for your dataset (which I could nto see when writing this).
GuessPartNum = splitPartCode(UBound(splitPartCode))
End Function
Function GuessSupplier(splitPartCode As Variant, supplierList As Variant, Optional delim As String = ";")
' Determine the supplier of this part from the partCode.
' For each supplier in the supplierList, see if the supplier name is in the partCode.
Dim i As Integer
For i = LBound(supplierList) To UBound(supplierList)
'Simply verifies if a supplier from supplierList is in the part code. Uses first match.
If (UBound(Filter(splitPartCode, supplierList(i, 1))) > -1) Then 'if arr(i) is in supplier_array
GuessSupplier = supplierList(i, 1)
Exit Function
End If
Next i
End Function
Function ProcessPartCodes(partCodeRange As Range, supplierListRange As Range, Optional delim As String = ";")
' Main ProcessPartCodes
'
' PartCodeRange: a range representing the part code list;
' must be in single column form.
' SupplierList: array of supplier names as strings
'
' Load part code array into array
Dim resultArr As Variant 'result set as array
Dim supplierList As Variant
Dim splitCode As Variant
Dim i As Integer
resultArr = RangeToArray(partCodeRange)
ReDim Preserve resultArr(LBound(resultArr) To UBound(resultArr), 0 To 4) As Variant
supplierList = RangeToArray(supplierListRange)
' Get supplier and part num from each part code
For i = LBound(resultArr) To UBound(resultArr)
If Len(resultArr(i, 0)) > 0 Then
splitCode = Split(resultArr(i, 0), delim) ' Split the partCode by delimiters, semi-colon (;)
resultArr(i, 0) = resultArr(i, 0) ' Part Code (not parsed)
resultArr(i, 1) = GuessPartNum(splitCode) ' Part Number
resultArr(i, 2) = GuessSupplier(splitCode, supplierList) ' Supplier
resultArr(i, 3) = splitCode ' Part Code (parsed)
'resultArr(i, 4) ' reserved for match information
Else
' Empty array element.
splitCode = ""
resultArr(i, 3) = Array()
End If
Next i
ProcessPartCodes = resultArr
End Function
Function CompareParts(splitPartCode1 As Variant, splitPartCode2 As Variant)
'
'
'splitPartCode1 is an array of a parsed partCode string
'splitPartCode2 is an array of a parsed partCode string
Dim matches() As String
Dim i As Integer
Dim matchCnt As String
ReDim matches(0 To 0) As String
' Check each item in arr1 (each substring of partCode1) for a match in arr2
For i = LBound(splitPartCode1) To UBound(splitPartCode1)
If (UBound(Filter(splitPartCode2, splitPartCode1(i))) > -1) Then 'if arr1(i) is in arr2
' Found an item in splitPartCode1 (a substring in partCode1) that is also in splitPartCode2.
' Add this item to the list of matches.
If LBound(matches) = -1 Then
ReDim matches(0 To 0) As String
Else
ReDim Preserve matches(LBound(matches) To UBound(matches) + 1) As String ' grow the matches array by one
End If
matches(UBound(matches)) = splitPartCode1(i) ' set value of last item in matches() = this item (this substring of partCode1)
End If
Next i
matchCnt = UBound(matches) - LBound(matches) + 1 ' Total number of matching substrings from each part.
CompareParts = Array(matchCnt, matches)
End Function
Function FindMatches(partCodeArr As Variant, Optional DeepArr As Boolean = False)
' Fucntion compares 2 part numbers to determine likelihood of a match.
' Parses partCode1 and partCode2 using the delimiter into arrays of strings.
' Then counts the number of matching strings in each array.
' Then determines if the part numbers (assumed to be the last string of each array) match.
' After running this, you can use the match count (matchCnt integer) and part number match
' (partNumMatch boolean) as a basis for determining how likely it is that partCode1=partCode2.
'
'
' DeepArr: If True, returns 3+ dimensional array. If False, flattens results to 2D array.
'
' Returns: Array(partCode1, partCode2, partNum1, partNum2, matchCnt, pricePct, supplierMatch, partNumMatch)
' partCode1 = partCode1 input argument
' partCode2 = partCode2 input argument
' partNum1 = the portion (substring) of partCode1 after the last ocurrence of the delimiter, delim.
' partNum2 = the portion (substring) of partCode2 after the last ocurrence of the delimiter, delim.
' match (boolean) = True if parts are likely the same.
' matchCnt = number of matching sub-strings between partCode1 and part 2
' (essentially, a match score, where higher is more likely a positive match)
' Returns -1 if partCode1=partCode2, meaning exact match.
' pricePct = percentage price match calculated as (decimal portion of price1/price2) * 100
' partNumMatch = True is partNum1=partNum2; else False
Dim i As Integer, j As Integer, k As Integer
Dim partCodei, partCodej
Dim partNumi As String, partNumj As String, numMatch As Boolean
Dim Duplicate As Boolean, newMatch As Boolean
Dim partSupplieri As String, partSupplierj As String, supplierMatch As Boolean
Dim splitCodei() As String, splitCodej() As String, matchCnt As Integer
Dim splitCompare
Dim matches() As String 'empty array has LBound=0 and UBound=-1, so UBound-LBound=-1 indicates an empty array
Dim matchstr As String
Dim s As String
matchCnt = 0 ' matchCnt = UBound(matches) - LBound(matches) + 1 ' starting with 0 matches.
For i = LBound(partCodeArr) To UBound(partCodeArr)
If i = 1 Or i = UBound(partCodeArr) Or i Mod 100 = 0 _
Then Debug.Print "Starting record " & i & ": " & Now()
If partCodeArr(i, 0) <> "" Then
matchstr = ""
For j = i + 1 To UBound(partCodeArr)
If Len(partCodeArr(j, 0)) > 0 Then
partCodei = partCodeArr(i, 0)
partCodej = partCodeArr(j, 0)
Duplicate = partCodei = partCodej 'found duplicate entry in table.
partNumi = partCodeArr(i, 1)
partNumj = partCodeArr(j, 1)
numMatch = partNumi = partNumj
partSupplieri = partCodeArr(i, 2)
partSupplierj = partCodeArr(j, 2)
supplierMatch = partSupplieri = partSupplierj
splitCodei = partCodeArr(i, 3)
splitCodej = partCodeArr(j, 3)
splitCompare = CompareParts(splitCodei, splitCodej)
matchCnt = splitCompare(0)
newMatch = False
If Duplicate Then
' You should have removed duplicates before starting.
On Error GoTo redimErr
ReDim Preserve matches(0 To UBound(matches) + 1, 0 To 2) As String
On Error GoTo 0
newMatch = True
matches(UBound(matches), 0) = partCodej 'The duplicate partCode
matches(UBound(matches), 1) = "0" ' Matching score, where -1 indicates an exact duplicate.
matches(UBound(matches), 2) = "Duplicate Entry. Part codes are identical." ' Matching score, where -1 indicates an exact duplicate.
ElseIf supplierMatch And numMatch Then
' Possible duplicate part since supplier and part number both match.
On Error GoTo redimErr
ReDim Preserve matches(0 To UBound(matches) + 1, 0 To 2) As String
On Error GoTo 0
newMatch = True
matches(UBound(matches), 0) = partCodej 'The duplicate partCode
matches(UBound(matches), 1) = "1" ' Matching score, where -1 indicates an exact duplicate.
matches(UBound(matches), 2) = "Probably same part with differnt part code. Same supplier and part number." ' Matching score, where -1 indicates an exact duplicate.
ElseIf supplierMatch And matchCnt > 2 Then
' Possible duplicate part since supplier and part number both match.
On Error GoTo redimErr
ReDim Preserve matches(0 To UBound(matches) + 1, 0 To 2) As String
On Error GoTo 0
newMatch = True
matches(UBound(matches), 0) = partCodej 'The duplicate partCode
matches(UBound(matches), 1) = "2" ' Matching score, where -1 indicates an exact duplicate.
matches(UBound(matches), 2) = "Possible duplicate. More likely a similar part from same supplier" ' Matching score, where -1 indicates an exact duplicate.
ElseIf supplierMatch = False And matchCnt > 2 Then
' Possible duplicate part since supplier and part number both match.
On Error GoTo redimErr
ReDim Preserve matches(0 To UBound(matches) + 1, 0 To 2) As String
On Error GoTo 0
newMatch = True
matches(UBound(matches), 0) = partCodej 'The duplicate partCode
matches(UBound(matches), 1) = "3" ' Matching score, where -1 indicates an exact duplicate.
matches(UBound(matches), 2) = "Possible part match from different supplier" ' Matching score, where -1 indicates an exact duplicate.
ElseIf supplierMatch = False And matchCnt > 1 Then
' Possible duplicate part since supplier and part number both match.
On Error GoTo redimErr
ReDim Preserve matches(0 To UBound(matches) + 1, 0 To 2) As String
On Error GoTo 0
newMatch = True
matches(UBound(matches), 0) = partCodej 'The duplicate partCode
matches(UBound(matches), 1) = "4" ' Matching score, where -1 indicates an exact duplicate.
matches(UBound(matches), 2) = "Low probability part match from different supplier" ' Matching score, where -1 indicates an exact duplicate.
End If
If newMatch And Not DeepArr Then
For k = LBound(matches) To UBound(matches)
matchstr = matchstr & "[" & partCodej & "," & matches(UBound(matches), 1) & "," & matches(UBound(matches), 2) & "], "
Next k
End If
End If
Next j
If DeepArr Then
' return 3+ dimensional array
partCodeArr(i, 4) = matches
Else
' return 2D array for easier pasting to worksheet
' Flatten partCodeArr(i, 4), the parsed potential part matches to an ordinary string
' with format [[part code, match value, match description],[part code, match value, match description],...]
If Len(matchstr) > 0 Then
matchstr = "[ " & Left(matchstr, Len(matchstr) - 2) & "] "
End If
partCodeArr(i, 4) = matchstr
' Flatten the parsed part code back to original string format.
partCodeArr(i, 3) = partCodeArr(i, 0)
End If
ReDim matches(0) As String
End If
Next i
FindMatches = partCodeArr
Exit Function
redimErr:
ReDim matches(0 To 0, 0 To 2) As String
Resume Next
End Function
Sub RunMain()
' Kicks off Main(partCodeRange As Range, supplierListRange As Range, destination As Range)
'
' Arguments:
' partCodeRange = Excel Range (not string name of range)
' that contains the raw part code list
' supplierListRange = Excel Range (not string name of range)
' that contains a unique list of supplier
' codes found in the part codes.
'
Call Main(Sheets("PartCodes").Range("B3:B10"), Sheets("Suppliers").Range("B4:B6"), Range("PartCodes!D2"))
End Sub
Sub Main(partCodeRange As Range, supplierListRange As Range, destination As Range)
' This is the main sub that runs the full process of finding equivalent part
' codes and writing the findings to an excel worksheet.
' See RunMain() sub for example use.
'
' Arguments:
' partCodeRange = Excel Range (not string name of range)
' that contains the raw part code list
' supplierListRange = Excel Range (not string name of range)
' that contains a unique list of supplier
' codes found in the part codes.
'
Dim partCodesArr, matchArr
Dim startdate As Date, stopdate As Date
startdate = Now()
Debug.Print
Debug.Print String(70, "*")
Debug.Print
Debug.Print "Starting: " & startdate
Debug.Print
partCodesArr = ProcessPartCodes(partCodeRange, supplierListRange)
matchArr = FindMatches(partCodesArr) ' FindMatches(partCodesArr, True) for 3+ dimensional results
Sheets("PartCodes").Activate
'Write column headers.
destination.Offset(0, 0) = "Part Code"
destination.Offset(0, 1) = "Part Num"
destination.Offset(0, 2) = "Part Supplier"
destination.Offset(0, 3) = "Part Code"
destination.Offset(0, 4) = "Potential equivalent part numbers"
Call ArrayToRange(matchArr, destination.Offset(1, 0))
stopdate = Now()
Debug.Print
Debug.Print "Finished: " & stopdate
Debug.Print
Debug.Print "Run time: " & (stopdate - startdate)
Debug.Print
Debug.Print String(70, "*")
Debug.Print
End Sub
| 44,436 |
https://stackoverflow.com/questions/6215778 | StackExchange | Open Web | CC-By-SA | 2,011 | Stack Exchange | Ozan Turan, Siddhant Singh, YAwMoMMa962, https://stackoverflow.com/users/13484429, https://stackoverflow.com/users/13484430, https://stackoverflow.com/users/13484431, https://stackoverflow.com/users/13494063, 神達小楠 | English | Spoken | 62 | 83 | How to link two custom taxonomies in WordPress?
Let's say I have one custom taxonomy called "movies" and another called "actors". How to I link those two taxonomies so as to know which actors play in such and such movie, or which movie does such and such actors plays in ?
You could use tags or categories and make a custom loop.
| 38,091 |
https://stackoverflow.com/questions/77035120 | StackExchange | Open Web | CC-By-SA | 2,023 | Stack Exchange | Danish | Spoken | 272 | 700 | Google translate v3 hanging when deployed to App Engine Flex Python
I've built a single wrapper for translating text using google.cloud translate_v3
from google.cloud import translate_v3 as translate
from google.cloud.translate_v3 import types
from credentials import credentials
from typing import Optional
class Translator:
def __init__(self):
project_name = credentials.project_id
self.client = translate.TranslationServiceClient()
self.parent = f"projects/{project_name}/locations/global"
def translate(self, text: str, source: str, target: str) -> Optional[str]:
try:
request = types.TranslateTextRequest()
request.parent = self.parent
request.source_language_code = source
request.target_language_code = target
request.contents = [text]
request.mime_type = "text/plain"
print("Translator: translate_text start")
response = self.client.translate_text(request=request)
print("Translator: got response")
for translation in response.translations:
print(f"Translated text: {translation.translated_text}")
if len(response.translations) < 1:
return text
print("Translator: translate_text complete")
return response.translations[0].translated_text
except Exception as e:
print(f"Exception during translation: {e}")
return text
This has been working fine whilst building on my local machine, however deploying it to my app engine flex instance it doesn't..
I've added the Cloud Translation API User role to my App Engine service account, and I'm getting absolutely no feedback... it actually seems to crash the App Engine.
Calling...
print(f"Translating text: {text} from {raw_source} to {raw_target}")
translation = self.translator.translate(text, raw_source, raw_target)
Locally...
Translating text: testing locally from en to ja
Translator: translate_text start
Translator: got response
Translated text: ローカルでのテスト
Translator: translate_text complete
Deployed...
Translating text: test deployed from en to ja
Translator: translate_text start
Then nothing.. no exception, no warnings, everything dies.
I've tried moving client inside the method...
i.e.
request = types.TranslateTextRequest()
request.parent = self.parent
request.source_language_code = source
request.target_language_code = target
request.contents = [text]
request.mime_type = "text/plain"
client = translate.TranslationServiceClient()
print("Translator: translate_text start")
response = client.translate_text(request=request)
print("Translator: got response")
and i've tried removing request.mime_type = "text/plain"
both with no success
| 32,871 | |
https://ru.stackoverflow.com/questions/1516145 | StackExchange | Open Web | CC-By-SA | 2,023 | Stack Exchange | Simon, https://ru.stackoverflow.com/users/211900, https://ru.stackoverflow.com/users/552543, Евгений Павлюченков | Russian | Spoken | 94 | 227 | Можно ли дать пользователям доступ к созданию страниц в конструкторе Gutenberg?
Хочу добавить на свой сайт возможность создавать личный блог с функционалом конструктора (tilda, wix и т. д.). Могу ли я дать доступ всем пользователям к созданию страниц в конструкторе Gutenberg. Во всех материалах, которые мне удалось найти страницы редактировались только из админки.
Хочу добавить на свой сайт (написанный не на WordPress) => в конструкторе Gutenberg -- какая здесь связь?
Убрал эту пометку.
How to Enable Frontend Editing with Gutenberg Blocks (Part 1) и How to Enable Frontend Editing with Gutenberg Blocks (Part 2)
| 13,080 |
https://su.wikipedia.org/wiki/Aek%20Manyuruk%2C%20Lingga%20Bayu%2C%20Mandailing%20Natal | Wikipedia | Open Web | CC-By-SA | 2,023 | Aek Manyuruk, Lingga Bayu, Mandailing Natal | https://su.wikipedia.org/w/index.php?title=Aek Manyuruk, Lingga Bayu, Mandailing Natal&action=history | Sundanese | Spoken | 17 | 46 | Aek Manyuruk nyaéta salah sahiji Désa di kacamatan Lingga Bayu, Kabupatén Mandailing Natal, Propinsi Sumatra Kalér, Indonésia. | 10,775 |
https://stackoverflow.com/questions/20242868 | StackExchange | Open Web | CC-By-SA | 2,013 | Stack Exchange | Jonathan Wakely, Shafik Yaghmour, bitmask, https://stackoverflow.com/users/1708801, https://stackoverflow.com/users/430766, https://stackoverflow.com/users/981959 | English | Spoken | 1,405 | 2,077 | Correct behaviour of trivial statements involving expressions with volatile variables?
Consider the following statements
volatile int a = 7;
a; // statement A
volatile int* b = &a;
*b; // statement B
volatile int& c = a;
c; // statement C
Now, I've been trying to find a point in the standard that tells me how a compiler is to behave when coming across these statements. All I could find is that A (and possibly C) gives me an lvalue, and so does B:
"§ 5.1.1.8 Primary expressions - General" says
An identifier is an id-expression provided it has been suitably declared (Clause 7). [..]
[..] The result is the entity denoted by the identifier. The result is an
lvalue if the entity is a function, variable, or data member and a
prvalue otherwise.
[..]
"§ 5.3.1 Unary operators" says
The unary * operator performs indirection: the expression to which it is applied shall be a pointer to an object type, or a pointer to a function type and the result is an lvalue referring to the object or function to which the expression points.
clang and gcc
I tried this with clang++ 3.2-11 and g++ 4.7.3, and the first produced three reads in C++11 mode and zero reads in C++03 mode (outputting three warnings) while g++ only produced the first two, explicitly warning me that the third would not be generated.
Question
It is clear which type of value comes out of the expression, from the quoted line in the standard, but:
which of the statements (A,B,C) should produce a read from the volatile entity according to the C++ standard?
The G++ warning about the "implicit dereference" comes from code in gcc/cp/cvt.c which intentionally does not load the value through a reference:
/* Don't load the value if this is an implicit dereference, or if
the type needs to be handled by ctors/dtors. */
else if (is_volatile && is_reference)
G++ does that intentionally, because as stated in the manual (When is a Volatile C++ Object Accessed?) the standard is not clear about what constitutes an access of a volatile-qualified object. As stated there you need to force lvalue-to-rvalue conversion to force a load from a volatile.
Clang gives warnings in C++03 mode that indicate a similar interpretation:
a.cc:4:3: warning: expression result unused; assign into a variable to force a volatile load [-Wunused-volatile-lvalue]
a; // statement A
^
a.cc:6:3: warning: expression result unused; assign into a variable to force a volatile load [-Wunused-volatile-lvalue]
*b; // statement B
^~
a.cc:8:3: warning: expression result unused; assign into a variable to force a volatile load [-Wunused-volatile-lvalue]
c; // statement C
^
3 warnings generated.
The G++ behaviour and the GCC manual seem to be correct for C++03, but there is a difference in C++11 relative to C++03, introduced by DR 1054 (which also explains why Clang behaves differently in C++)3 and C++11 modes). 5 [expr] p10 defines a discarded-value-expression and says that for volatiles the lvalue-to-rvalue conversion is applied to an id-expression such as your statements A and C. The spec for lvalue-to-rvalue conversion (4.1 [conv.lval]) says that the result is the value of the glvalue, which constitutes an access of the volatile. According to 5p10 all three of your statements should be accesses, so G++'s handling of statement C needs to be updated to conform to C++11. I've reported it as http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59314
Your point about *b is absolutely right! I find your warnings interesting, because I did compile with -Wall -Wextra -pedantic but didn't get a single warning out of clang++. At any rate, I was curious about what the standard has to say, not what individual compilers do.
I just checked, the warnings are not produced when passing -std=c++11.
Ah yes, good point. Maybe The C++11 standard is less vague than the C++03 one then, I'll check.
N.B. did you read the link provided by the deleted answer? The first two sentences seem directly related to "whether or not the standard requires a read" in that it says the standard isn't clear.
Well, that was actually the question. Are we accessing the object or not.
@bitmask I deleted it b/c I was trying derive the logic that gcc developers used and I have some doubts but if you think that it is relevant I can add more details from the link and undelete. I assumed the logic was obvious when I first read it but it was soon clear that it was not that simple.
@bitmask, the link says "[the standard] fails to specify what constitutes a volatile access" which is pretty relevant. If whoever wrote that is right (and it is still true of C++11) then it's hard to answer your "are we accessing the object or not" question
I think the C++11 standard clarifies what constitutes an access, see the edit at the end of my question
+1 I undeleted my answer, I saw the reference from the DR in the draft standard but it was not clear to me if this section actually applied even though 5.1.1 p8 says it's an lvalue but I guess the DR says it does. The wording still seems vague wrt even after reading the DR. Also, I think you mean DR 1054
This gcc document 7.1 When is a Volatile C++ Object Accessed? is relevant here, and I quote (emphasis mine going forward):
The C++ standard differs from the C standard in its treatment of volatile objects. It fails to specify what constitutes a volatile access, except to say that C++ should behave in a similar manner to C with respect to volatiles
The C and C++ language specifications differ when an object is accessed in a void context:
and provides this example:
volatile int *src = somevalue;
*src;
and continues by saying:
The C++ standard specifies that such expressions do not undergo lvalue to rvalue conversion, and that the type of the dereferenced object may be incomplete. The C++ standard does not specify explicitly that it is lvalue to rvalue conversion that is responsible for causing an access.
which should be referring to draft standard section 5.3.1 Unary operators paragraph 1 which says :
The unary * operator performs indirection: the expression to which it is applied shall be a pointer to an object type, or a pointer to a function type and the result is an lvalue referring to the object or function to which the expression points. [...]
and with respect to references:
When using a reference to volatile, G++ does not treat equivalent expressions as accesses to volatiles, but instead issues a warning that no volatile is accessed. The rationale for this is that otherwise it becomes difficult to determine where volatile access occur, and not possible to ignore the return value from functions returning volatile references. Again, if you wish to force a read, cast the reference to an rvalue.
so it looks like gcc is choosing to treat references to volatile differently and in order to force a read you need to cast to an rvalue, for example:
static_cast<volatile int>( c ) ;
which generates a prvalue and hence a lvalue to rvalue conversion, from section 5.2.9 Static cast:
The result of the expression static_cast(v) is the result of converting the expression v to type T. If T is an lvalue reference type or an rvalue reference to function type, the result is an lvalue; if T is an rvalue reference to object type, the result is an xvalue; otherwise, the result is a prvalue.
Update
The C++11 draft standard adds 5 Expressions paragraph 11 which says:
In some contexts, an expression only appears for its side effects. Such an expression is called a discarded-value expression. The expression is evaluated and its value is discarded. The array-to-pointer (4.2) and functionto-pointer (4.3) standard conversions are not applied. The lvalue-to-rvalue conversion (4.1) is applied if and only if the expression is an lvalue of volatile-qualified type and it is one of the following:
and includes:
— id-expression (5.1.1),
This seems ambiguous to me since with respect to a; and c; section 5.1.1 p8 says it is an lvalue and it is not obvious to me that it covers this case but as Jonathan found DR 1054 says it does indeed cover this case.
I have difficulty seeing how this relates to whether or not the standard requires a read from the respective entity. It seems like this is a gcc implementation decision, right?
| 41,288 |
https://es.wikipedia.org/wiki/Crist%C3%B3bal%20Pineda | Wikipedia | Open Web | CC-By-SA | 2,023 | Cristóbal Pineda | https://es.wikipedia.org/w/index.php?title=Cristóbal Pineda&action=history | Spanish | Spoken | 525 | 891 | Cristóbal Felipe Pineda Andradez (Concepción, 23 de septiembre de 1987) es un ingeniero civil en transporte, académico y político chileno, militante de Revolución Democrática (RD). Entre marzo de 2022 y marzo de 2023, se desempeñó como subsecretario de Transportes en el gobierno de Gabriel Boric.
Estudios
Realizó sus estudios superiores en la carrera de ingeniería civil mención en transporte en la Universidad de Chile, posteriormente cursó un magíster en ciencias de la ingeniería, con mención en transporte de la misma casa de estudios y un magíster en transporte y planificación urbana de la University College London, Inglaterra.
Trayectoria profesional
Especialista en la realización de estudios estratégicos y tácticos de transporte, dónde ha conocido las interacciones institucionales de la gobernanza del transporte urbano en Chile. Se ha desarrollado como docente universitario relacionado con temáticas de transporte urbano. Por otra parte, desde 2014 se desempeña como profesor en la Universidad de Chile y en la Universidad Técnica Federico Santa María, en temas relacionados al transporte urbano y planificación urbana.
Durante el segundo gobierno de Michelle Bachelet, trabajó en la gerencia de Planificación y Desarrollo del Metro de Santiago y como coordinador de la consultora Cityplanning, evaluando programas en las regiones Metropolitana y de Antofagasta. Luego, se desempeñó como encargado de la Secretaría de Planificación (SECPLA) en la Municipalidad de Maipú, entre julio de 2021 y febrero de 2022. En esa labor gestionó el desarrollo de proyectos de infraestructura, equipamiento, movilidad y espacio público.
Trayectoria política
Militante del partido Revolución Democrática (RD), es uno de los autores de la propuesta de transportes del programa de gobierno del candidato presidencial de Apruebo Dignidad Gabriel Boric, de cara a la elección de noviembre de 2021. En el programa, uno de sus ejes es «instalar un "transporte doble cero", referido a un sistema público gratuito y sin emisiones de gases contaminantes, que partiría en forma piloto en algunas ciudades». También se propone «avanzar a una integración tarifaria y operacional del transporte público en regiones y ampliar los trenes de carga, entre otras medidas».
Luego del triunfo de Boric en la segunda vuelta de diciembre de dicho año, ya en calidad de presidente electo, fue nombrado por éste como titular de la Subsecretaría de Transportes, función que asumió el 11 de marzo de dicho año, con el inicio formal de la administración.
Controversias
Su designación como subsecretario de Transportes ha estado envuelto en polémica y ha sido criticado junto a otros tres nombramientos de subsecretarios designados: Christian Larraín Pizarro en Previsión Social, Fernando Araos en Redes Asistenciales, Alfredo Gutiérrez Vera en Obras Públicas y Galo Eidelstein en Fuerzas Armadas. Pineda fue cuestionado porque salieron a la luz algunos tuits publicados entre 2010 y 2014 —actualmente borrados— con contenido considerado machista y misógino en los cuales nombraba a la entonces dirigenta estudiantil Camila Vallejo y otras personalidades.
Se refirió a estos tuits confirmando su existencia y, además, ofreció disculpas por haberlos publicado, señalando:
Véase también
Anexo:Gabinetes ministeriales del gobierno de Gabriel Boric
Referencias
Enlaces externos
Ingenieros civiles de Chile
Alumnado de la Universidad de Chile
Militantes de Revolución Democrática
Subsecretarios de Estado de Gabriel Boric
Subsecretarios de Transporte de Chile
Políticos de Chile | 2,450 |
https://ar.wikipedia.org/wiki/%D8%A5%D8%AF%D9%88%D8%A7%D8%B1%D8%AF%20%D8%A5%D9%86%D8%BA%D8%B1%D8%A7%D9%85 | Wikipedia | Open Web | CC-By-SA | 2,023 | إدوارد إنغرام | https://ar.wikipedia.org/w/index.php?title=إدوارد إنغرام&action=history | Arabic | Spoken | 46 | 160 | إدوارد إنغرام هو مؤرخ كندي، ولد في 1945.
مراجع
وصلات خارجية
أعضاء هيئة تدريس جامعة سايمون فريزر
خريجو كلية باليول (أوكسفورد)
خريجو كلية لندن للاقتصاد
كتاب غير روائيين ذكور كنديون
مواليد 1945
مؤرخون إنجليز في القرن 20
مؤرخون بريطانيون
مؤرخون كنديون
مؤرخون كنديون في القرن 20 | 18,633 |
https://war.wikipedia.org/wiki/Mycomicrothelia%20punctata | Wikipedia | Open Web | CC-By-SA | 2,023 | Mycomicrothelia punctata | https://war.wikipedia.org/w/index.php?title=Mycomicrothelia punctata&action=history | Waray | Spoken | 41 | 81 | An Mycomicrothelia punctata in uska species han Fungi in nahilalakip ha divisio nga Ascomycota, ngan nga ginhulagway ni Andre Aptroot. An Mycomicrothelia punctata in nahilalakip ha genus nga Mycomicrothelia, ngan familia nga Trypetheliaceae. Waray hini subspecies nga nakalista.
Mga kasarigan
Mycomicrothelia | 42,476 |
https://skeptics.stackexchange.com/questions/40183 | StackExchange | Open Web | CC-By-SA | 2,017 | Stack Exchange | Lynob, Nat, Oddthinking, Tgr, https://skeptics.stackexchange.com/users/13947, https://skeptics.stackexchange.com/users/23, https://skeptics.stackexchange.com/users/29579, https://skeptics.stackexchange.com/users/37939, https://skeptics.stackexchange.com/users/805, the gods from engineering | English | Spoken | 579 | 871 | Did Russia have over a million universities in 2005?
According to the European University Institute's Academic Careers Observatory, in 2005 Russia had over a million degree-granting institutions:
In 2005, Russia had 1,196,350 universities and higher education establishments that are authorised to offer undergraduate, postgraduate and doctorate degrees. Some of these establishments are private. See http://www.kref.ru/vyzrf_m.shtml
This number seems absurdly high. In 2005, the population of Russia was 143,518,816, which would mean that there was one university or other degree-granting institution for every 120 residents.
Is the figure quoted by the EUI an error, or is there some meaningful way of interpreting it as-is? (For example, does it perhaps include all the individual degree programs of all university departments? Does it include a large number of private diploma mills that were operated by a tiny number of scammers?)
The site referenced by the EUI is in Russian, which I don't speak, so it's hard for me to find the supporting evidence there, let alone to assess its reliability.
Looks like a typo, as the cited list doesn't appear to have that many entries. Someone could probably count them up, but I dunno if what appears to basically be a typo would constitute a notable claim. This is, is there any evidence that anyone believes that the typo'd entry is correct, or alternatively that it wasn't a typo?
This number is so absurdly high that I doubt anyone believes it is true. I can't find any examples of people repeating the claim. Have we got any evidence that this is widely-believed and not just an ignored typo?
It's probably a mistranslation, as the number of universities and such is much lower; a little over 1,000 even if you count branches. Oddly enough however, that 1.2 million, is not the number of students either, which seems to be higher nowadays. Just in the state-funded universities there are about 2 million.
The table that the claimant cites, http://www.kref.ru/vyzrf_m.shtml, is literally just a database of institutions, and presumably they're just reporting the number of entries in it. Some of the links for subsections of it are broken, but the total sum appears to be much closer to 1,000 than 1,000,000. The citation looks lazy and hastily given (e.g., the _m suffix in the link is for the subset of entries that start with an "M"), so presumably they just typo'd it. Perhaps they counted 1,196 at first, but then missed something, and meant to change it to 1,350.
In any case, the same claimant website claims that Russia has a total of 226,298 instructors/professors across those institutions, which if the typo is taken as intended, would mean that they're claiming that the average instructor/professor works for ~5.29 institutions.
For a specific number though, http://www.kref.ru/vyzrf_m.shtml lists 167 institutions that start with "M" (10-per-page on the first 16 pages of entries, then 7 more on the last page). To get the total number, someone'd have to add up the entries for institutions that start with other letters, though some of those links are broken, at least when viewed through Google Translate.
Per the Webometrics website, and as of January 2014, there are 22,123 universities in the world.
http://www.answers.com/Q/How_many_universities_are_there_in_the_world not the best reference but no matter how you look at it, even with illegal institutions (not recognized) i doubt there will be more than 200000 worldwide
@Nat given that the character frequency of M in Russian is 3%, that would give a very rough estimate of 5-6000.
| 47,946 |
https://azb.wikipedia.org/wiki/%D9%86%D8%A7%D9%82%D8%A7%D8%B1%DB%8C%2C%20%D8%B1%D8%A7%D8%AC%D8%A7%D8%B3%D8%AA%D8%A7%D9%86 | Wikipedia | Open Web | CC-By-SA | 2,023 | ناقاری, راجاستان | https://azb.wikipedia.org/w/index.php?title=ناقاری, راجاستان&action=history | South Azerbaijani | Spoken | 20 | 103 | ناقاری, راجاستان
(اینگیلیسجه:Nagari, Rajasthan) هیندوستان اؤلکهسینین راجستان ایالتینده بیر کند دیر. بۇ کنده هیندی دیل دانیشیلیر.
گؤرونتولر
قایناقلار
هیندوستان کندلری | 21,272 |
https://stackoverflow.com/questions/14989937 | StackExchange | Open Web | CC-By-SA | 2,013 | Stack Exchange | Alohci, Neil, Shridhar, dave mankoff, https://stackoverflow.com/users/10093, https://stackoverflow.com/users/182705, https://stackoverflow.com/users/1985815, https://stackoverflow.com/users/42585 | English | Spoken | 1,090 | 1,560 | HTML5 Tag Omission: Spec Clarification With Regards To Language
The HTML5 specification for tag omission (http://www.w3.org/TR/html51/syntax.html#syntax-tag-omission) starts with the following two statements (emphasis mine):
An html element's start tag may be omitted if the first thing inside
the html element is not a comment.
An html element's end tag may be omitted if the html element is not
immediately followed by a comment.
Those to statements read similarly, but not the same and I am wondering if someon can offer clarification on what they mean.
The following case seems unambiguous - you can't remove the start or close tags:
<html><!-- start --> ... </html><!-- end -->
But what about when whitespace is introduced into the mix. Can the start tag for html be eliminated in the following case?
<html>
<!-- comment after whitespace -->
...
Can the end tag be eliminated in a similar scenario?
...
</html>
<!-- comment after whitespace -->
Some of the other rules make specific mention of whitespace characters which leads me to believe that they should be taken into account. Most of the rules say "...immediately followed by..." which is different than the first bullet point listed.
I tried this in Gecko and it ignores whitespace before <head> and after <body>, just leaving the comment nodes, although interestingly it places the tag as late as possible, so that the initial comments appear before the <html> in the DOM but the trailing comments appear after the <body>.
For end tag followed by means comment first and then html end tag <! --->
@Shridhar why do you think that? That would not match what it says.
To me ( may be wrong) that sentence says html end tag can be omitted if last line is not comment line.
I guess the reason being html engine will not able to interpret if element content are ended or not. I ll have some tests and let you know.
@shridhar interesting - i would have phrased the example you give as "an html element immediately preceded by a comment".
The important factor here is that the phrases first thing inside and immediately following are talking about nodes i.e. the DOM, not tags or other markup, so the distinction it is making is about whether the node is a child (first thing inside) or a following sibling (immediately following).
As far as spaces go:
An html element's start tag may be omitted if the first thing inside
the html element is not a comment.
The first thing inside an html element cannot be a space character because at that point in the parser algorithm, space character tokens are discarded and not added to the DOM.
An html element's end tag may be omitted if the html element is not
immediately followed by a comment.
Space characters, regardless of whether they appear just before or just after the </html> tag, end up inside the html element (in fact, also inside the body element), so the comment will be immediately following the html element regardless of whether there are spaces in between in the markup.
Isn't this statement parser dependent? "The first thing inside an html element cannot be a space character because at the point in the parser algorithm, space character tokens are discarded and not added to the DOM."
@davemankoff - No. The question is about a quote from the HTML5 (work in progress) spec. The HTML5 spec is completely specific about the parser algorithm, to the extent that any stream of bytes is parsed in exactly the same way.
In html, space between tags doesn't matter. <html> <head> and <html><head> are the same thing to the browser. In content (e.g. between words inside a span/p tag) it's rendered up by the browser, but when you want to use space between elements (as a design resource) you should use  .
So, as I see, immediately followed by doesn't mean "the next character" but "the first thing after the place that end tag was supposed to be, no matter how many spaces between them.
Then, removing html tags in both cases would invalidate the html, because no matter how many spaces are betweeen the place </html> was supposed to be and the comment.
edit: I think they were trying to express the same thing by using another words and avoid being repetitive, but ended up being confuse;
The rules about tag omission are somewhat misleading in that for the most part they're not actually saying when tags can be omitted, but rather how they should be interpreted when they are omitted. Take, for example, the following document:
<!DOCTYPE html><!-- A comment --><title>A title</title>
This is a valid HTML5: you can run it through the W3C validator yourself. But the tag omission rules clearly state that
[a]n html element's start tag may be omitted if the first thing inside the html element is not a comment.
How do we reconcile this? The answer is that these are disambiguation rules. Because an html element's start tag may not be omitted if the first thing inside it is a comment, we are free to assume when parsing that the comment is not the first thing inside the html element. Similarly, the tag omission rules state that
[a] body element's start tag may be omitted if the element is empty, or if the first thing inside the body element is not a space character or a comment [...]
So we are free to assume that the comment is also not the first thing inside the body element. So in fact this document can be unambiguously parsed as equivalent to
<!DOCTYPE html><!-- A comment --><html><head><title>A title</title></head><body></body></html>
The parser algorithm for HTML5 specifies that if we are in the before html insertion mode, which is the state the parser transitions to after seeing <!DOCTYPE html>, and we see
A character token that is one of U+0009 CHARACTER TABULATION, "LF" (U+000A), "FF" (U+000C), "CR" (U+000D), or U+0020 SPACE
then we are to "Ignore the token." If on the other hand we see a comment token, then we are to
Insert a comment as the last child of the Document object.
It's not until we see some other kind of tag that we emit an html element. So we should expect this behavior not to be affected by whitespace, and indeed both Firefox 54 and Chrome 60 interpret the document
<!DOCTYPE html>
<!-- A comment -->
<title>A title</title>
identically to
<!DOCTYPE html><!-- A comment --><title>A title</title>
That is, both of them are treated like
<!DOCTYPE html><!-- A comment --><html><head><title>A title</title></head><body></body></html>
| 34,655 |
https://lld.wikipedia.org/wiki/Super%20Mario%20Bros.%2035 | Wikipedia | Open Web | CC-By-SA | 2,023 | Super Mario Bros. 35 | https://lld.wikipedia.org/w/index.php?title=Super Mario Bros. 35&action=history | Ladin | Spoken | 17 | 40 | Super Mario Bros. 35 ie n videojuech svilupà da y publicà ai da .
Storia
Referënzes
Videojuech | 33,780 |
https://math.stackexchange.com/questions/583178 | StackExchange | Open Web | CC-By-SA | 2,013 | Stack Exchange | Derek Holt, Truong, https://math.stackexchange.com/users/100751, https://math.stackexchange.com/users/2820 | English | Spoken | 464 | 1,124 | Let $R$ be an UFD and $a,b\in R\setminus\left\{ 0\right\}$. Prove that $ab=\operatorname{lcm}(a,b)\gcd(a,b)$
Let $R$ be an UFD and $a,b\in R\setminus\left\{ 0\right\}$. Prove that $ab=\operatorname{lcm}(a,b)\gcd(a,b)$.
It's correct modulo multiplication by units.
Can you explain more precisely to me?
Write down the factorisation of $a$ and $b$ as products of powers of irreducibles, and then use that to work out the lcm and gcd. For example, in ${\mathbb Z}$, $a=2^3.3.5^2.11$, $b=2^2.3^4.5.7^2$, the lcm is $2^3.3^4.5^2.7^2.11$ and the gcd is $2^2.3.5$. It's basically the same argument for any UFD.
I know that in a UFD $R$, every finite sets of nonzero elements of $R$ have $gcd$. Hence $a,b$ have $gcd$ but why $ab=lcm(a,b).gcd(a,b)$ (modulo multiplication by units)?
Your comment suggests me that you are in a GCD domain (that is, an integral domain where every two non-zero elements have a $\gcd$), not in an UFD.
Please be aware that commenters and readers like to be interacted with socially. When you copy a question verbatim without writing any of your own thoughts or even a greeting or any formatting to indicate you're posting a quote, you invoke the image of someone anonymously exploiting others to do their homework for them for free. Even if this isn't homework, please see:
http://meta.math.stackexchange.com/questions/1803/how-to-ask-a-homework-question/
In a UFD this is more concrete than the general situation (a GCD domain). This is because all elements can be thought of as multisets of primes (each prime that divides a given element appears in this multiset with multiplicity equal to its exponent in the factorization). The gcd is a kind of "intersection" whereas the lcm is a kind of "union," and our law is a sort of spiritual realization of the combinatorial fact $|A|+|B|=|A\cap B|+|A\cup B|$ (interpreted correctly for multisets).
In particular, in a UFD one can prove the following explicit formulas:
$$\gcd(a,b)=\prod_{\pi\mid a,b}\pi^{\large\min\{v_{\pi}(a),v_\pi(b)\}}$$
$$\operatorname{lcm}(a,b)=\prod_{\pi\mid a,b}\pi^{\large\max\{v_\pi(a),v_\pi(b)\}}$$
where $v_\pi(\cdot)$ represents the power of $\pi$ in a factorization and $\pi$ runs over irreducibles. The desired law $ab=\operatorname{lcm}(a,b)\gcd(a,b)$ boils down to $e_1+e_2=\min\{e_1,e_2\}+\max\{e_1,e_2\}$ in $\Bbb N$ (which can be seen clearly by assume $e_1\le e_2$ without loss of generality).
More generally, in a GCD-domain, where gcds are defined (up to units) but factorization needn't be unique, the law still holds. Firstly, we define gcd and lcm by "universal properties," and only up to units. In particular, let $R$ be a GCD domain, and consider the multiplicative monoid $(R\setminus0)/R^\times$ (i.e. the nonzero elements modulo units as an algebraic structure with multiplication and identity).
Define the gcd of $a$ and $b$ as $(a,b)$ and their $\rm lcm$ as $[a,b]$, defined uniquely by
$$d\mid a,b\iff d\mid (a,b), \qquad a,b\mid m\iff [a,b]\mid m.$$
If $[a,b]$ exists then $ab/[a,b]\in R$ satisfies the universal property of $(a,b)$ via
$$d\mid a,b\iff db,ad\mid ab\iff a,b\mid ab/d\iff [a,b]\mid ab/d\iff d\mid ab/[a,b].$$
This is explained in Bill Dubuque's answer here.
| 7,063 |
https://unix.stackexchange.com/questions/572525 | StackExchange | Open Web | CC-By-SA | 2,020 | Stack Exchange | Murphy, https://unix.stackexchange.com/users/157411, https://unix.stackexchange.com/users/312541, jsotola | English | Spoken | 125 | 217 | Kali won't boot in GUI
After installation of kali on 32 bit a terminal opened.
Entered command
startx
It says command not found
So I thought of installing gnome for the same purpose
Sudo apt-get update && sudo apt-get upgrade
Sudo apt-get install -f gnome
It says package gnome has no installation candidate
Then I tried
Sudo apt-get update && sudo apt-get upgrade
Apt-get install gdm3
It says package gdm3 has no installation candidate
What should I do?
https://unix.stackexchange.com/tags/kali-linux/info
you should try a user friendly linux distribution, such as Mint or Ubuntu or Debian etc etc .... basically anything that is not Kali
Kali 2020.1a had error in its image so it was not booting in GUI.
Kali just fixed this issue in 2020.1b version.
| 46,495 |
https://ceb.wikipedia.org/wiki/Lac%20Capelli%C3%A8re | Wikipedia | Open Web | CC-By-SA | 2,023 | Lac Capellière | https://ceb.wikipedia.org/w/index.php?title=Lac Capellière&action=history | Cebuano | Spoken | 123 | 201 | Lanaw ang Lac Capellière sa Kanada. Nahimutang ni sa kondado sa Nord-du-Québec ug lalawigan sa Québec, sa sidlakang bahin sa nasod, km sa amihanan sa Ottawa ang ulohan sa nasod. metros ibabaw sa dagat kahaboga ang nahimutangan sa Lac Capellière. Naglangkob kin og ka kilometro kwadrado. Hapit nalukop sa durowan ug kabugangan ang palibot sa Lac Capellière. Naglukop ni og 2.7 km gikan sa amihanan ngadto sa habagatan ug 3.8 km gikan sa sidlakan ngadto sa kasadpan.
Ang klima boreal. Ang kasarangang giiniton °C. Ang kinainitan nga bulan Hulyo, sa °C, ug ang kinabugnawan Disyembre, sa °C.
Saysay
Ang mga gi basihan niini
Mga lanaw sa Québec (lalawigan)
Mga lanaw sa Kanada nga mas dako pa kay sa 2 ka mga kilometro kwadrado | 9,673 |
https://stackoverflow.com/questions/67686030 | StackExchange | Open Web | CC-By-SA | 2,021 | Stack Exchange | Bad Coder, https://stackoverflow.com/users/212435, https://stackoverflow.com/users/3865607, shollyman | English | Spoken | 190 | 374 | Get the BQ Query History Data
I am running the following query in my BQ console to see the query history data:
select * from `region-us`.INFORMATION_SCHEMA.JOBS_BY_PROJECT;
I can see the all the data query data present in the results. I came across Audit Logs https://cloud.google.com/bigquery/docs/reference/auditlogs
I have created the sink using command:
gcloud logging sinks create bq-audit-sink pubsub.googleapis.com/projects/my-project/topics/bq_audit --log-filter='protoPayload.metadata."@type"="type.googleapis.com/google.cloud.audit.BigQueryAuditMetadata
But i am not able to find the query data i.e past query which is fired and the information about the job.
How to get the data is which we can get via INFORMATION_SCHEMA.JOBS_BY_PROJECT view.
The INFORMATION_SCHEMA table is a historical record, the log sync receives events when they flow through the log mechanism. The sink doesn't get backfilled with events from before the sink was setup, if that was your hope.
Are you not receiving any events in the pubsub topic? Try running a query in the instrumented project and observe what's emitted into the pubsub topic.
Method name as google.cloud.bigquery.v2.JobService.Query will give me the required results
Depending on invocation, you may also want to look for events related to google.cloud.bigquery.v2.JobService.InsertJob, as BQ supports two entrypoints for inserting query work.
| 2,401 |
https://oc.wikipedia.org/wiki/Mont%C3%B3n | Wikipedia | Open Web | CC-By-SA | 2,023 | Montón | https://oc.wikipedia.org/w/index.php?title=Montón&action=history | Occitan | Spoken | 15 | 36 | Montón es un municipi de la província espanhòla de Saragossa dins la Comunautat Autonòma d'Aragon. | 38,594 |
https://dba.stackexchange.com/questions/247131 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | Rick James, Wilson Hauck, https://dba.stackexchange.com/users/1876, https://dba.stackexchange.com/users/56436 | English | Spoken | 614 | 1,158 | Mysql Config Suggestions - CPU too high
My server (64GB,16CPUs) has mariadb 5.5.60.
The queries are around 500 selects /second and 300 inserts/seconds.
The queries are simple select of auth token and user details.
Both are properly indexed.
The insert query is also very simple.
However, the CPU usage is still high %cpu usage is >600%.
The following is the mysql config.
Please suggest.
max_connections = 5000
max_user_connections=1000
key_buffer_size = 10024M
myisam_sort_buffer_size = 512M
read_buffer_size = 1G
table_open_cache = 9000
thread_cache_size = 900
wait_timeout = 300
connect_timeout = 300
tmp_table_size = 8G
max_heap_table_size = 4G
max_allowed_packet = 10G
net_buffer_length = 2048M
max_connect_errors = 100
read_rnd_buffer_size = 2048M
bulk_insert_buffer_size = 2G
query_prealloc_size = 512M
query_alloc_block_size = 128M
transaction_alloc_block_size = 128M
transaction_prealloc_size = 128M
max_write_lock_count = 16
log-error
external-locking=FALSE
open_files_limit=50000
character-set-server = utf8
innodb_buffer_pool_size=40G
table_cache=10G
innodb_file_per_table=1
skip-name-resolve
Additional information request. Post on pastebin.com and share the links.
Text results of:
B) SHOW GLOBAL STATUS; after minimum 24 hours UPTIME
C) SHOW GLOBAL VARIABLES;
D) SHOW FULL PROCESSLIST;
E) complete MySQLTuner report
AND Optional very helpful information, if available includes -
htop OR top OR mytop for most active apps,
ulimit -a for a linux/unix list of limits,
iostat -xm 5 3 for IOPS by device and core/cpu count,
for server workload tuning analysis to provide suggestions.
If you will post the requested info, I can help you. #1 problem is you have 64GB RAM and your configuration is asking for 75GB with named Global Variables requests. Awaiting your data to be posted and share the links, please.
table_cache=10G
Is the old name for table_open_cache. They limit the number of entries. 10G is unreasonable. 9000 is high, but probably OK.
tmp_table_size = 8G
max_heap_table_size = 4G
are dangerously high. If just a few threads decide to build a big temp table, you could run out of RAM, possibly out of swap space. Set them to no more than 1% of RAM.
These are OK as you have them:
innodb_buffer_pool_size=40G
key_buffer_size = 10024M
but it would be better to tune them based on which Engine you are using.
Meanwhile, do not randomly raise config settings; it can cause more harm than good. Swapping is terrible for performance; over committing RAM can lead to swapping.
mariadb 5.5.60
The queries are around 500 selects /second and 300 inserts/seconds
5.5 is rather old; there have been some relevant improvements since then.
With that rate of querying, I hope you are using InnoDB; you are pushing the limits of MyISAM.
Are the disks SSDs? If so, that query rate should be no problem. Since you are commenting on CPU, not I/O, I assume I/O is not a problem?
As already metioned, you are using only 6/16ths of available CPU, so there no immediate threat of meltdown. Still, it is good to be concerned.
Both are properly indexed.
Sorry, but most people who say "properly indexed" have never heard of the benefits of 'composite' indexes. Please provide the queries and SHOW CREATE TABLE so we can verify.
Two things:
As you posted 600% of CPU usage, I'll guess that you are using Linux, so no worries, actually this means that you are just using 100% of 6 processors, so you still have 10 processors totally free. When you start seeing a CPU usage above 1400% then you can start worrying.
More important than point number 1 is the crazy mess you have in your config file. You can't just grow those values with no knowledge of what are you doing. My recommendations is to hire a experienced DBA or learn how to tune a MySQL server properly.
Are you using InnoDB or MyISAM? Show us the common queries, together with SHOW CREATE TABLE.
| 49,703 |
https://war.wikipedia.org/wiki/Endococcus%20brachysporus | Wikipedia | Open Web | CC-By-SA | 2,023 | Endococcus brachysporus | https://war.wikipedia.org/w/index.php?title=Endococcus brachysporus&action=history | Waray | Spoken | 69 | 135 | An Endococcus brachysporus in uska species han Fungi in nahilalakip ha divisio nga Ascomycota, ngan nga syahan ginhulagway ni Friederich Wilhelm Zopf, ngan ginhatag han pagkayana nga asya nga ngaran ni M. Brand och Paul Diederich hadton 1999. An Endococcus brachysporus in nahilalakip ha genus nga Endococcus, classis nga Dothideomycetes, divisio nga Ascomycota, ngan regnum nga Fungi. Waray hini subspecies nga nakalista.
Mga kasarigan
Mga sumpay ha gawas
Endococcus | 17,272 |
https://tg.wikipedia.org/wiki/%D0%98%D0%BB%D0%B4%D0%B5%D1%84%D0%BE%D0%BD%D1%81%20%D0%9B%D0%B8%D0%BC%D0%B0 | Wikipedia | Open Web | CC-By-SA | 2,023 | Илдефонс Лима | https://tg.wikipedia.org/w/index.php?title=Илдефонс Лима&action=history | Tajik | Spoken | 78 | 307 | Илдефонс Лима Сола (; 10 декабри 1979, Барселона, Испания) — футболбози испанӣ, .
Зиндагинома
Маснади бошгоҳӣ
Мунтахаби миллӣ
Эзоҳ
Пайвандҳо
Зодагони 10 декабр
Зодагони соли 1979
Муҳофизатгарони футбол
Футболбозони Испания
Футболбозони тими миллии футболи Андорра
Бозингарони БФ Андорра
Бозингарони БФ Эспанол Б
Бозингарони БФ Sant Andreu
Бозингарони БФ Ionikos F.C.
Бозингарони БФ Пакука
Бозингарони БФ УД Лас Палмас
Бозингарони БФ Polideportivo Ejido
Бозингарони БФ Райо Валекано
Бозингарони БФ Triestina Calcio
Бозингарони БФ АК Беллинзона
Бозингарони БФ Санта Колома | 9,210 |
https://en.wikipedia.org/wiki/Hades%20Project%20Zeorymer | Wikipedia | Open Web | CC-By-SA | 2,023 | Hades Project Zeorymer | https://en.wikipedia.org/w/index.php?title=Hades Project Zeorymer&action=history | English | Spoken | 1,615 | 2,409 | Hades Project Zeorymer, known in Japan as , is a Japanese manga series by Yoshiki Takaya, written under the pen name Chimi Moriwo, and published in the adult manga magazine Lemon People from October 1983 to November 1984. A three-part finale was serialized in Monthly Comic Ryū in 2007. A four-episode OVA adaptation by AIC tones down the explicit sexual content and deviates entirely from the manga storyline and setting.
Manga
In the near future, a secret society, Nematoda, with ambitions of world domination, hired three men, Professor Akitsu, Professor Himuro, and Professor Wakatsuki, to build the ultimate "G-Class" giant robot, Zeorymer. Nearly two decades later, on his deathbed, Professor Akitsu tells his son, Masaki Akitsu, that Zeorymer must not awaken. A short time later, a new student transfers into Masaki's school, named Miku Himuro. She quickly persuades him to meet her adopted father, Professor Himuro, and Masaki is curious to find out what is going on, and what his father meant in his final words. Traveling by a high-speed pod hidden under the city, he meets Professor Himuro in a vast underground facility. Nematoda's General Golshid, aware of the Himuro's appearance in Japan, send a G-Class robot to assault their base and kill them, as they believed they had the only "Joint". Himuro compels Masaki to pilot Zeorymer and save them, as he is the only one that can pilot it. Once he agrees, Himuro and his daughter head to an operating room without Masato's knowledge, and he installs a sphere called a "Dimensional Joint" - a flawed duplicate of the original - into his daughter's womb, and she is teleported to within Zeorymer's "eye". This is necessary to utilise Zeorymer's true abilities - without them, it is simply an outdated G-Class robot. Though Masaki stumbles with the unfamiliar systems, Zeorymer eventually awakens fully, Masaki undergoes a strange and short-lived shift in personality, and with the spherical energy weapon on the back of Zeorymer's hand, destroys its opponent in a single attack.
Soon, Nematoda sends its three newest and most powerful robots after Zeorymer. Finding its pilots at school, they attempt to apprehend them, but Zeorymer is teleported to their location. Masaki's personality shifts again, and Zeorymer fights the three, despite being in the middle of a city, showing no care for civilian casualties. Zeorymer shows its power, being much faster than the fastest of the three, vastly stronger than the strongest of the three, and takes the many, many missiles of the third without damage. Finally, Zeorymer activates both of the spheres on the back of its hands and taps them together, the shockwave cleaving the final robot and several buildings behind it in two. As a result, the city has undergone immense damage, and many of its citizens are surely killed, including all of their schoolmates.
With Nematoda, General Golshid, seeing the vast power of Zeorymer, elects to pilot the powerful Rose C'est La Vie, a G-Class robot that had crippled test pilots, even at less than full power. Knowing he has little choice Golshid still elects to go, with Rose C'est La Vie at full power. Upon returning to base, Professor Himuro is shown to have collapsed and is dying of an incurable disease, and Masato realised the level of destruction fighting would cause, but strangely didn't care. Suddenly teleported to Zeorymer's cockpit, it's revealed that Masaki is the revived, evil, Professor Wakatsuki, reduced to an embryo and reborn to escape an inevitable death, Miku was Himuro's wife, who had been cheating on her husband with him, had undergone the same process as she had been caught in the same event, and that Himuro was the one to attempt to kill them. Though the three scientists were conspiring against Nematoda while they worked for the organisation, Wakatsuki was planning to betray the others and take Zeorymer for himself. Akitsu and Himuro had stolen the embryos to stop the revival, and Akitsu then took Masaki's embryo and fled from his other colleague as well. However, by activating Zeorymer, the memories and personality of Wakatsuki had been installed into Masaki, though the same was not true of Miku. Following this reveal, Wakatsuki forces himself on Miku, sexually, and uses sex to make her his.
Rose C'est La Vie lands and fights Zeorymer. Golshid successfully tears off one of Zeorymer's arms, but it is instantly regenerated in its entirety. He then successfully destroys its cockpit, killing Wakatsuki, to which both cockpit and pilot are regenerated completely. Defeated and nearly destroyed, Golshid is saved by the sudden loss of power of Zeorymer, as the Dimensional Joint had finally failed. With both robots retreating, Wakatsuki installs a new Dimensional Joint into Miku, and upon her awakening, suddenly shifts back to Masaki for a moment. With both Wakatsuki and Miku realising, Wakatsuki reinforces himself and flees. In the midst of coitus with Miku, Masaki comes to the realisation that the "fake Masaki Akitsu" was not a fake - it was not Wakatsuki's personality that was installed, just his memories. While that would be enough for a child without memories to become a "true" Masaki Wakatsuki, Masaki Akitsu's personality was too strong, and he eventually came to the realisation that he was simply being dragged along by how he thought he should be acting, thanks to Wakatsuki's memories, with Professor Himuro secretly watching. Deep in the base, Himura hovers over a switch, which would destroy the flawed Dimensional Joint in Miku's womb, killing both Miku and Masaki, but accepts that Masaki is not really Wakatsuki, and Miku is not his deceitful wife, feels guilt for considering Miku to only be a tool, and dies of his sickness. Upon finding him, Masaki decides that the only way to escape Zeorymer is by burying it himself, and decides to do so by attacking Nematoda's main base.
Arriving at Nematoda's base, Zeorymer's landing destroys many of its defending machines with the resulting shockwave, and makes short work of the remainder. Suddenly, the president of Nematoda appears, piloting a black Zeorymer, powered by the original Dimensional Fault installed into an "inhuman" Miku clone, revealing himself to be a second backup of Wakatsuki, but one with advanced aging thanks to the destruction left by the theft of the original Zeorymer affecting his regeneration. After the theft, he had killed the Nematoda president and taken his place. Fighting with Zeorymer and showing that they had equally powerful offensive and regeneration abilities, the two Zeorymer grappled and began to merge. Revealing that Zeorymer's power source was in another dimension, and that as a result, there can only be one Zeorymer, which was the reason that even Masaki couldn't make a perfect Dimensional Joint, despite having Wakatsuki's memories, the two machines merged into one, with the fake Miku collapsing, the original Dimensional Joint installing itself into Miku's womb, and Wakatsuki planning to take over Masaki's body in the process. Though Zeorymer is merged into a half-black, half-white version, Masaki, Miku and Wakatsuki were ejected from it. Wakatsuki fails to understand why, but Masaki enlightens him - Zeorymer reformatted its pilot registry when Masaki started piloting Zeorymer, and was installed with Wakatsuki's memories. Thus, Zeorymer couldn't install Wakatsuki's personality into Masaki's body. Wakatsuki's driven somewhat mad, reveals that he also has a self-destruct for the Joint in Miku's womb, but is shot and killed by Golshid, furious at Wakatsuki's murder of the original Nematoda president. However, there's a massive Deuterium Bomb under the Nematoda base, activated by Wakatsuki's death, which is large enough to destroy the world. However, Zeorymer is strong enough to survive. Rather than escaping, Masaki and Miku plan to absorb all the energy from the bomb's detonation into Zeorymer and into the other dimension. Golshid's expectation is that even Zeorymer will be destroyed, but Masaki says that he and Miku want to live, in this world that they grew up in. As they attempt it, Golshid is shown to have escaped in a pod. Though Masato and Miku succeed, the manga concludes by saying that no-one ever saw the G-Class Robot "Hades" ever again.
Anime
Set in the near future, a secret organization called , also known as , is bent on world domination. Using the electronics firm International Electronic Brains as a front to fund their activities, Tekkoryū builds an army of eight giant robots known as the , but Masaki Kihara, the scientist behind the Hakkeshū, betrays the Tekkoryū and steals , along with the embryo of the pilot genetically linked to the robot. He dies shortly after handing Zeorymer and the embryo to the Japanese government. Fifteen years later, Yuratei ascends to the throne as Empress of Tekkoryū and orders the recovery or destruction of Zeorymer before proceeding with her plans to conquer the world.
Episodes
Cast
Release
Central Park Media licensed Hades Project Zeorymer in 1995 on LaserDisc through Image Entertainment It was first released on DVD through NuTech Digital in 2001. Following the end of NuTech's distribution contract, Zeorymer was re-released by CPM in 2003 with both Japanese and English versions.
In Japan, Hades Project Zeorymer was released on Blu-ray by Bandai Visual (under the Honneamise label) on October 24, 2008.
Merchandise
An action figure of Zeorymer of the Heavens was released by Yamato Toys in 2007. Bandai released Zeorymer in the Super Robot Chogokin toy line in 2012. In 2022, Good Smile Company released model kits of Zeorymer and Great Zeorymer as part of the Moderoid line.
In other media
Zeorymer was featured in the 2004 game Super Robot Wars MX for the PlayStation 2.
Notes
References
External links
1983 manga
1988 anime OVAs
2007 manga
2008 manga
2010s toys
Anime International Company
Central Park Media
Seinen manga | 1,697 |
https://stackoverflow.com/questions/59211411 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | Ritik Singh, Rory McCrossan, https://stackoverflow.com/users/12320180, https://stackoverflow.com/users/519413 | English | Spoken | 288 | 546 | Change checkbox default value before sending
This is small problem I am facing. I am printing a checkbox list in which they are checked if the JSON value coming inside them is true and unchecked if JSON value is false.
So if the checkbox is checked the line of html is
<input id="to_be_shown_individually" type="checkbox" ${(this.to_be_shown_individually && 'checked')} value=> <br>
Now , i have given option to user to check and uncheck chekbox . So when they uncheck the checkbox its value remains true always.
See this image in first as chekbox are checked so i get true, but in second attempt when i uncheck them i still get true .
so when i use
documen.getElementByID("to_be_shown_individually").value;
It always says true whther user have unchecked the checkbox
Note that it should be document.getElementById() - but given you state this doesn't shown any errors I assume this is just a typo in the question
The value of a checkbox is always available. To determine if it's checked or not you need to use the checked property:
document.querySelector('button').addEventListener('click', function() {
var checkbox = document.getElementById("to_be_shown_individually");
console.log(checkbox.value, checkbox.checked);
})
<input id="to_be_shown_individually" type="checkbox" checked value="foobar" />
<button>Get state</button>
Instead of
document.getElementByID("to_be_shown_individually").value;
Look for
document.getElementByID("to_be_shown_individually").checked;
this will give you a true or false response based on if the checkbox is checked
No still i am getting true. I think this is because the input line is . Maybe this is problem. But your code is still giving me true on uncheckinig the chekbox
@RitikSingh the value of the checkbox is always available in the DOM. You need to read the checked state and then use or ignore the value manually.
html
<input type="checkbox" id="chk">
javascript code
var checked = json value is true;
$("#chk"). prop("checked", checked);
| 19,991 |
ikOcrFnGw6I_2 | Youtube-Commons | Open Web | CC-By | null | Bradford's History of the Plymouth Settlement, 1608-1650 | Harold Paget, William Bradford | 5/7 | None | English | Spoken | 7,625 | 9,281 | So they opened up a fair discussion of the subject, and after all evidence had been fully sifted, the opinion of each of the magistrates and ministers was demanded, with the result that though all wished the trouble had never occurred, they could not but lay the blame and guilt on Hawking's own head, whereupon such grave and godly councils and exhortations were given as they thought fitting, both for the present and future, which were received with love and gratitude, with promises to endeavor to profit by them, and so it ended, and their love and concord renewed. Further Mr. Winthrop and Mr. Dudley wrote very effectually on their behalf to Lord Say and others interested, which with their own letters and Mr. Winslow's further declarations when in England satisfied them fully. They sent Mr. Winslow to England this year, partly for this object, and partly to notify the partners in England that the period of their contract for the company's trade here having expired, they instructed him to close the accounts with them, and to find out how much they still remained debtors to the account, and what further course would be best to pursue. The outcome of it all will appear in next year's narrative. They sent over with him a substantial cargo which was very acceptable to them, and beaver three thousand seven hundred thirty-eight pounds, mostly coat beaver which sold at twenty shillings per pound, and two hundred thirty-four otter skins at fourteen shillings per skin, so altogether it arose to a large sum of money. Early this year they sent a boat to trade with the Dutch colony, where they met with a captain's stone who had lived in Christopher's, one of the West Indian islands, and had now been some time in Virginia and had come up from there. He kept company with the Dutch governor, and in some drunken fit got his leave to seize their boat, just as they were ready to leave and had finished trading, having five hundred pounds worth of goods aboard. There was not the least provocation or ground for such an act, but having made the governor so drunk that he could scarcely utter an intelligible word, he urged him to do it, and got the answer as you please. So he got aboard, most of their men being ashore, and with some of his own men made the rest way anchor, set sail, and carry her away towards Virginia. But several of the Dutch sailors ashore, who had often been at New Plymouth and kindly entertained there, said to each other, Shall we allow our friends to be wronged in this way, and have their goods carried away before our faces whilst our governor is drunk? They vowed they would not permit it, and got a vessel or two, and chased him and brought him back again, and delivered them their boat and goods. Afterwards Stone came to Massachusetts, and they commenced an action against him for it, but by the mediation of friends it was allowed to lapse. Later Stone came with some other gentleman to New Plymouth, and was friendly entertained by them with the rest, but revenge boiled in his breast, and some thought that on one occasion he intended to stab the governor, and put his hand to his dagger for that purpose. But by God's providence and the vigilance of those at hand it was prevented. Afterwards returning to Virginia in a penance with a Captain Norton and some others, for some unknown reason they must need to go up the Connecticut River. What they did I know not, but the Indians came aboard and knocked Stone on the head as he lay in his cabin. This was his end. They also killed all the others, but Captain Norton defended himself for a long time against them all in the cookroom, till, by accident, the gunpowder which he had put ready in some open vessel before him, took fire and it so burnt and blinded him that he could no longer make resistance, and was killed by them, though they much commended his valor. I must now relate a strange occurrence. There was a tribe of Indians living on the upper parts of the Connecticut River, a long way from the colony's trading-house there, who were enemies of the Indians that lived in the neighborhood, who stood in some fear of them, for they were a warlike tribe. About a thousand of them had enclosed themselves in a fort which they had strongly palisaded. Three or four Dutchmen went up in the beginning of winter to live with them, to get their trade and prevent them from bringing it down to the English or from getting friendly with them. But their enterprise failed, for it pleased God to afflict these Indians with such a deadly sickness that out of one thousand, over nine hundred fifty of them died, and many of them lay rotting above ground for want of burial, and the Dutchmen almost starved before they could get away, kept there by the ice and snow. But about February, with much difficulty, they reached the trading-house of the New Plymouth people, by whom they were kindly treated, for they were almost exhausted with hunger and cold. After being refreshed by them for several days, they got to their own place, and the Dutch were very grateful for this kindness. This spring, too, the Indians who lived around their trading-house fell sick of smallpox, and died most miserably. A more terrible disease cannot attack them. They fear it worse than the plague, for usually it spreads amongst them broadcast. For want of bedding and linen and other comforts, they fall into a lamentable condition. As they lie on their hard mats, thepox breaks and matters and runs, their skin sticking to the mats they lie on, so that when they turn, a whole side will flay off at once, and they will be all one gore of blood, dreadful to behold. And then, what with cold and other hardships, they die like rotten sheep. The condition of these natives was indeed lamentable. They were swept so generally by the disease that in the end they were unable to help one another, or to make a fire or fetch a little water to drink, or to bury their dead. They would keep up as long as they could, and when there was no other means to make a fire, they would burn the wooden dishes they ate their food in, and their very bows and arrows. Some would crawl out on all fours to get a little water, and sometimes die by the way, not being able to get home again. But the people of the English trading-house, though they were at first afraid of the infection, seeing their woeful condition, and hearing their pitiful cries, had compassion on them, and daily fetched them wood and water, and made them fires, and got them food whilst they live, and buried them when they died. Very few of the Indians escaped, notwithstanding that they did what they could for them at great risk to themselves. The chief satcham himself died, and almost all his friends and relatives, but by the marvelous goodness and providence of God not one of the English was so much as ill, or in the least degree tainted with the disease, though they did these services for them daily for many weeks. The mercy they showed them in this way was greatly appreciated by all the Indians who knew or heard of it, and earned their gratitude, and their masters at new Plymouth highly commended and rewarded them for it. CHAPTER XVI Mr. Winslow was welcomed by them in England, the more so owing to the large consignment of fur he brought with him, which came safely to hand and was well sold. He was given to understand that all the accounts would be cleared up before his return, and all former differences settled, and that the account of the White Angel would not be charged to them. Being called upon to answer some complaints made against the country at the council, more particularly concerning their neighbors at the Bay than themselves, which he did to good effect, at the same time furthering the interests of the colonies as a whole as regards the encroachments of the French and other strangers, with a view to preventing them for the future, he took the opportunity of presenting this petition to their honors, the commissioners for the colonies. To the right honorable, the Lord's commissioners for the colonies in America, the humble petition of Edward Winslow on behalf of the colonies in New England, humbly shows your Lordships that whereas your petitioners have settled in New England under his Majesty's most gracious protection, now the French and Dutch endeavor to divide the land between them, for which purpose the French on the east side entered and seized upon some of our houses and carried away the goods, killed two men in another place, and took the rest prisoners with their goods, and the Dutch on the west also made entry along the Connecticut River, within the limits of his Majesty's letters patent, where they have raised a fort and threatened to expel your petitioners, who are also established on the same river, maintaining possession for his Majesty to their great expense and the risk of both their lives and goods. In tender consideration whereof your petitioners humbly pray that your Lordships will either procure their peace with those foreign states, or else give special warrant to your petitioners and the English colonies to defend themselves against all foreign enemies, and your petitioners shall pray, etc. This petition was well received by most of them, and Mr. Winslow was heard several times by them, and appointed to attend for an answer from their Lordships, having shown how this might be done without any expense or trouble to the state, simply giving the leading men their authority to undertake it at their own cost and in such a way as would avoid public disturbance, but this interfered with both Sir Ferdinand Gorge's and Captain Mason's plans, with whom the Archbishop of Canterbury was in league. For Sir Ferdinand Gorge's, by the Archbishop's favour, was to have been sent over to the country as Governor-General, and was about to conclude this project. The Archbishop's intention was to send over officials with him, furnished with Episcopal power, to disturb the peace of the churches here, overthrow their proceedings, and stop their further growth. But it fell out by God's providence that though in the end they prevented this petition from taking any further effect, his plot with Sir Ferdinand came to nothing. So when Mr. Winslow went before the Board to have his petition granted, he found that the Archbishop had checked it. However, hoping to obtain it nevertheless, he went to the Board again, but he found that the Archbishop, Sir Ferdinand and Captain Mason, had procured Morton, the man referred to previously, to prevent complaints. Mr. Winslow answered them to the satisfaction of the Board, who checked Morton and rebuked him sharply, and also blamed Sir Ferdinand Gorge's and Mason for countenancing him. But the Archbishop had a further object, and began to cross-question Mr. Winslow about many things. He accused him of preaching in the church publicly, with which Morton had charged him, affirming that he had seen and heard him do it, to which Mr. Winslow answered that sometimes, for want of a minister, he had endeavored to assist in the edification of his brethren. The Archbishop then questioned him about marriage, to which he replied that as a magistrate he had occasionally married some of the people, pointing out to their lordships that marriage was a civil institution, and that he nowhere found in the word of God that it belonged to the ministry, and furthermore for a long time they had no minister, besides it was no new idea, for he himself had been married in Holland by the magistrates in their stadhouse. To be short, in the end the Archbishop, by his vehement importunity, got the Board at last to consent to his commitment, so he was imprisoned in the fleet, and lay there about seventeen weeks before he could get released. This was the end of the petition, but the scheme of the others was frustrated too, which was no small blessing to the people over here. The expense to this colony was heavy, though it was undertaken as much or more in the interests of others. Indeed, Mr. Winslow was chiefly urged to the business by them, and the colony knew nothing of it till they heard of his imprisonment, though it had to bear the whole expense. As to their own business, whatever Mr. Shirley's intention was before, he now declared plainly that he would neither take the White Angel from the general account, nor present any further account till he had received more goods. That though a fair supply had been sent over this time, they were mostly without notes of the prices, and not as properly invoiced as formerly. This Mr. Winslow said he could not help because of his imprisonment. However, Mr. Shirley, Mr. Beauchamp, and Mr. Andrews sent over a letter of attorney under their hands and seals to recover what they could from Mr. Allerton on the White Angel's account, but they sent neither the bonds nor contracts, nor such other evidence as they had, to enable those at New Plymouth to act upon it. I will here insert a few passages from Mr. Shirley's letters about these things. James Shirley in London to the Colony at New Plymouth. I have received your letter of July 22, 1634, through our trusty and loving friend Mr. Winslow, and your large parcel of beaver and otter skins. Blessed be our God, both He and it arrived safely. We have sold it in two parcels, the skins at fourteen shillings per pound, and some at sixteen, the coat at twenty shillings per pound. I have not sent the accounts over this year. I refer you to Mr. Winslow for the reason, but be assured that none of you shall suffer through not having them if God spare me life. You say the six years have expired during which the people put the trade of the colony into your and our hands, for the discharge of the heavy debts which Mr. Allerton needlessly and unadvisedly ran us into, but it was promised that it should continue till our disbursements and engagements were met. You think this has been done already? We know otherwise. I doubt not we shall lovingly agree, notwithstanding all that has been written on both sides about the White Angel. We have now sent you a letter of attorney, giving you power in our names, and to shadow it the more we say for our uses, to obtain what is possible from Mr. Allerton towards meeting the great expense of the White Angel. He certainly gave a bond, though at present I cannot find it, but he has often affirmed with great protestations that neither you nor we should lose a penny by him, and I hope you will find he has enough to meet it, so that we shall have no more trouble about it. Notwithstanding his unkind treatment of you, in the midst of justice, remember mercy, and do not all you might do. Let us get out of debt, and then let us survey the matter reasonably. Mr. Winslow has undergone an unjust imprisonment, but I am convinced it will result to your general advantage. I leave it to him to tell all particulars. Your loving friend, James Shirley, London, September 7, 1635. This year they sustained another great loss from the French. Monsieur Donnet, coming into the harbor of Penobscot, having invited several of the chief men belonging to the house aboard his vessel, got them to pilot him in, and after getting the rest into his power he took possession of the house in the name of the King of France. By threats and otherwise he made Mr. Willet, their agent there, approve of the sale of the goods to him, of which he fixed the prices himself, making an inventory, though with many omissions. But he made no payment for them, saying that in due course he would do so if they came for it. As for the house and fortifications, he would not allow anything for them, claiming that it was not built on their own land. So, turning them out, with many compliments and fine words, he let them have their shallop and some provisions to bring them home. When they got home and related the occurrence they were much disturbed about it, for the French had robbed this house once before, at a loss to them of above five hundred pounds, and now to lose house and all vexed them greatly. So they decided to consult with their friends at the bay, who now had many ships there, and if they approved of it they intended to hire a fighting ship and tried to beat the French and regain their property. Their plan was approved of, if they themselves would bear the expense. So they hired a fine ship of over three hundred tons, well fitted with ordinance, and agreed with the captain, one girling, that he and his crew should deliver them the house after they had overcome the French, and give them peaceable possession of it, with all such trading commodities as should be found there, giving the French fair quarter if they would yield. In consideration of which services he was to have seven hundred pounds of beaver to be delivered to him there when he had completed his bargain. But, if he did not accomplish it, he was to lose his labor and have nothing. With him they sent their own bark, and about twenty men under Captain Standish, to help him if necessary, and to put things in order if the house were regained, and then to pay girling the beaver which was aboard their own bark. So they piloted him there, and brought him safely into the harbour. But he was so rash and heady he would take no advice, nor give Captain Standish time to summon them to surrender as his orders were. If he had done so, and they had parleyed, seeing their force, the French would probably have yielded. He did not even have patience to place his ship where she could do execution, but began to shoot at a distance like a madman, and did them no harm at all. At last, when he saw his own folly, he was advised by Captain Standish and brought her well up, and placed a few shots to some purpose. But now, when he was in a position to do some good, his powder was used up, so he was obliged to draw off again. He consulted with the Captain how he could get further supplies of gunpowder, for he had not enough to carry him home. So he told him he would go to the next settlement and endeavour to procure him some, and did so. But Captain Standish gathered, from intelligence he received, that he intended to seize the bark and take the beaver, so he sent him the powder and brought the bark home. Girling never attacked the place again, and went on his way, which ended the business. Upon the ill success of their plans, the Governor and his assistants here notified their friends at the bay, and pointed out that the French were now likely to fortify themselves more strongly, and become undesirable neighbours to the English. In reply they wrote to them as follows, From the colony of Massachusetts to that of New Plymouth. Worthy sirs, after reading your letters and considering the importance of their contents, the court has jointly expressed their willingness to assist you with men and ammunition to accomplish your ends with the French. But as none of you here have authority to conclude anything with us, nothing can be done for the present. We desire you therefore, with all convenient speed, to send some one of trust with instructions from yourselves to make such an agreement with us as may be useful to you and fair to us. So in haste we commit you to God and remain your assured loving friends, John Haynes Governor, Richard Bellingham, Deputy Governor, John Winthrop, Thomas Dudley, John Humphrey, William Coddington, William Pension, Atherton Howe, Increase Noel, Richard Doomer, Simon Bradstreet, Newtown, October 9, 1635. Upon receipt of this they at once deputed two of their people to treat with them, giving them full power to conclude an agreement according to the instructions they gave them, which were to this purpose, that if the Massachusetts colony would afford such assistance as, together with their own, was likely to affect the desired end, and also bear a considerable part of the expense they would go on. If not, having lost so much already, they must desist and wait such further opportunity to help themselves as God should give. But the conference resulted in nothing, for when it came to an issue the others would go to no expense, they sent the following letter and referred them to their messengers. Richard Bellingham, Deputy Governor of Massachusetts, to the Governor of New Plymouth. Sir, having seriously considered the great importance of your business with the French, we gave our answer to those whom you deputed to confer with us about the voyage to Penobscot. We showed our willingness to help by procuring you sufficient men and ammunition. But as for money, we have no authority at all to promise, and should we do so it might be only to disappoint you. We also think it would be proper to seek the help of the other eastern colonies, but that we leave to your own discretion. For the rest we refer you to your deputies, who can report further details. We salute you, and wish you all success in the Lord. Your faithful and loving friend, Richard Bellingham, Deputy, in the name of the rest of the committee. Boston, October 16th, 1635. Not only was this the end of their suggested cooperation, but some of the merchants of Massachusetts shortly after started trading with the French, and furnished them both with provisions and ammunition, and have continued to do so to this day. So it is the English themselves who have been the chief supporters of the French, and the colony at Pemaquid, which is near them, not only supplies them, but constantly gives them intelligence of what is passing among the English, especially among some of them. So it is no wonder that they still encroach more and more upon the English, and supply the Indians with guns and ammunition to the great danger of the English settlers, whose homes are scattered and unfortified. For the English are mainly occupied with farming, but the French are well fortified and live upon trade. If these things are not looked to and remedied in time, it may easily be conjectured what will result. This year, on the 14th or 15th of August, a Saturday, there was such a fearful storm of wind and rain as none living hereabouts either English or Indians ever saw. It was like those hurricanes and typhoons that writers mention in the Indies. It began in the morning, a little before day, and did not come on by degrees, but with amazing violence at the start. It blew down several houses and unroofed others. Many vessels were lost at sea, and many more were in extreme danger. To the southward the sea rose twenty feet, and many of the Indians had to climb trees for safety. It took off the boarded roof of a house which belonged to the settlement at Manomet, and floated it to another place, leaving the posts standing in the ground, and if it had continued much longer without the wind shifting, it would probably have flooded some of the inhabited parts of the country. It blew down many hundred thousands of trees, tearing up the stronger by the roots and breaking the higher pine trees off in the middle, and tall young oaks and walnut trees of a good size were bent like widths, a strange and fearful sight. It began in the southeast and veered different ways. It lasted, though not at its worst, for five or six hours. The marks of it will remain this one hundred years in these parts where it was most violent. There was a great eclipse of the moon the second night after. Some of their neighbors at the bay, hearing of the fame of the Connecticut River, had a hankering after it, as mentioned before. Understanding that the Indians had been swept away by the recent mortality, fear of whom was the chief obstacle to them before, they now began to explore it with great eagerness. The New Plymouth people there had most trouble with the Dorchester settlers about it, for they set their minds on the place which the New Plymouth colony had not only purchased from the Indians, but where they had actually built, and the Dorchester people seemed determined if they could not remove them altogether, at any rate, to leave them only an insignificant plot of land round the house, sufficient for a single family. This attempt not only to intrude themselves into the rights and possessions of others, but in effect to oust them, was thought to be most unjustifiable. Many were the letters that passed between them about it. I will first insert a few lines written from their own agent from there. Jonathan Brewster at Matianic to the Governor of New Plymouth Sir, the Massachusetts men are coming almost daily, some by water and some by land, as yet undecided where to settle, though some evidently have a great liking for the place we are in, which was bought last. Many of them are looking for what this river will not afford, except at the place where we are, namely a site for a great town, with comodious dwellings for many not far apart. What they will do I cannot yet inform you. I shall do what I can to withstand them. I hope they will hear reason that we were here first and entered the district with much difficulty and danger, both in regard to the Dutch and the Indians, and bought the land at great expense and have since held possession at no small trouble, and kept the Dutch from encroaching further, though but for us they would have possessed it all and kept out all others. I hope these and similar arguments will stop them. It was your will that we should use them and their messengers kindly, and so we have done, and do daily, to our great expense. The first party of them would have almost starved had it not been for this house, and I was forced to supply twelve men for nine days. Those who came last I entertained as best we could, helping them with canoes and guides. They got me to go with them to the Dutch, to see if I could arrange that some of them should have quiet settling near them, but they peremptorily refused them. I also gave their goods house-room according to their earnest request, and Mr. Pension's letter on their behalf, which I thought well to send you, enclosed. What trouble and cost will be further incurred I know not, for they are coming daily, and I expect those back again from below, where they have gone to view the country. All this should surely, in the judgment of all wise and understanding men, give us just claim to hold and keep our own. Thus with my duty remembered I rest, yours to be commanded, Jonathan Brewster, Matianek, July 6th, 1635. After a thorough view of the place they began to pitch upon the land near the house belonging to the New Plymouth people, which occasioned much expostulation between them and much agitating correspondence. But lest I should be tedious, I will forbear the details and come to the conclusion. To make any forcible resistance was far from their minds, they had enough of this at Kennebec, and to live in continual contention with their friends would be uncomfortable. So for peace's sake, though they considered they suffered injury, they thought it better to let them have it, getting as good terms as possible, so they fell to treaty. First, since there had been such long disputes about it, they insisted they must first acknowledge that they had no right to it, or else they would not treat with them about it at all. This being granted, the conclusion reached was as follows, that the people of New Plymouth should retain their house and have the sixteenth part of all that they bought from the Indians, and the others should have all the rest of the land, leaving such a portion for the settlers of New Town as the New Plymouth Colony reserved for them. This sixteenth part was to be taken in two places, one in the neighborhood of the house, the other near the New Town settlement. Further, they were to pay to the New Plymouth Colony the proper proportion of what had been dispersed to the Indians when purchased. In this way the controversy was ended, but the injustice was not so soon forgotten. The New Town people dealt more fairly, only wishing to have what could be conveniently spared. Amongst the other business that Mr. Winslow had to do in England, he had orders from the Church to bring over some able and fit person as their minister. Accordingly, he had procured a godly and worthy man, a Mr. Glover, but it pleased God that when he was ready for the voyage, he fell sick of fever and died. Afterwards, when Mr. Winslow was ready to sail, he became acquainted with a Mr. Norton, who was willing to come over, but would not engage himself to settle permanently at New Plymouth until he had an opportunity of judging of it. So he arranged that if later he preferred to be elsewhere, he would repay the money expended for him, which came to about seventy pounds, and be at liberty to move. He stayed about a year with them, and was much liked by them, but he was invited to Ipswich, where there were many rich and able men, and several of his acquaintances, so he went to them and is their minister. About half the expense was repaid, the rest he was allowed to keep for his services amongst them. Book 2 Chapter 17 of Bradford's History of the Plymouth Settlement 1608-1650 This LibriVox recording is in the public domain. Bradford's History of the Plymouth Settlement 1608-1650 by William Bradford, rendered into modern English by Harold Padgett. Book 2, Chapter 17 Mr. Edward Winslow was elected governor this year. The previous year, seeing from Mr. Winslow's later letters that no accounts would be sent, they had resolved to keep the beaver and send no more till they had them, or some further agreement had been come to. At least they decided to wait until Mr. Winslow came back, and they could arrive at what was best. When he came, though he brought no accounts, he persuaded them to send the beaver, and was confident that upon receipt of it and his letters they would have the accounts next year, and though they thought his ground for hope was weak, they yielded to his importunity, and sent it by a ship at the latter end of the year, which took one thousand one hundred fifty pounds of beaver and two hundred otter skins, besides many small furs such as fifty-five mink, two black fox skins, etc. This year, in the spring, came a Dutchman, who had intended to trade at the Dutch fort, but they would not permit him. So, having a large stock of trading goods, he came here and offered them for sale. They bought a good quantity that were very suitable, such as Dutch roll, kettles, etc., amounting to the value of five hundred pounds, for payment of which they gave bills on Mr. Shirley in England, having already sent the parcel of beaver mentioned above. By another ship this year they again sent a further considerable quantity, which would reach him and be sold before any of these bills came due. The quantity of beaver then sent was one thousand eight hundred nine pounds, and ten otter skins, and shortly after the same year, then sent by another ship, of which one langroom was captain, seven hundred nineteen pounds of beaver, and one hundred ninety nine otter skins, concerning which Mr. Shirley writes as follows. James Shirley in London to the new Plymouth Colony. I have received your letters with Eight Hogshead of Beaver by Edward Wilkinson, Captain of the Falcon. Blessed be God for its safe arrival. I have also seen and accepted three bills of exchange, but I must acquaint you that the Lord's hand is heavy upon this kingdom in many parts, but chiefly in this city with his judgment of the plague. Last week's bill was twelve hundred deaths, and I fear this will be more, and it is much feared that it will be a winter sickness. It is incredible the number of people who have gone into the country in consequence, many more than went out during the last plague. So there is no trading here. Carriers from most places are forbidden to enter, and money, though long due, cannot be obtained. Mr. Hall owes us more than would pay these bills, but he, his wife, and all are in the country, sixty miles from London. I wrote to him, he came up but could not pay us. I am sure that if I were to offer to sell the beaver at eight shillings per pound I could not get the money. But when the Lord shall please to cease his hand, I hope we shall have better and quicker markets, so it shall lie by in the meantime. Before I accepted the bills, I acquainted Mr. Beauchamp and Mr. Andrews about them, that no money could be got, and that it would be a great discredit to you to refuse the bills, none having ever been dishonored, and ashamed to us, with eighteen hundred pounds of beaver lying by, and more already owing than the bills came to, etc. But it was useless, neither of them would lift a finger to help. I offered to put up my third part, but they said they neither could nor would, etc. However, your bills shall be met, but I did not think they would have deserted either you or me at this time. You will expect me to write more fully and answer your letters, but I am not a day each week at home in town. I take my books and all to clap them, for here it is the most miserable time that I think has been known in many ages. I have known three great plagues, but none like this. And that which should be a means to pacify the Lord and help us is denied us, for preaching is put down in many places, not a sermon in Westminster on the Sabbath nor in many towns about us. The Lord in mercy look upon us. Early in the year there was a great drought, and no rain for many weeks, so that everything was burnt up, hay at five pounds aload, and now there is nothing but rain, so that much summer corn and late hay is spoiled. Thus the Lord sends judgment after judgment, and yet we cannot see or humble ourselves, and therefore may justly fear heavier judgments unless we speedily repent and turn unto him, which the Lord give us grace to do if it be his blessed will. Thus desiring you to remember us in your prayers, I ever rest your loving friend, James Shirley, September 14th, 1636. This was all the answer they had from Mr. Shirley, which made Mr. Winslow's hopes fail him. So they decided to send no more beaver till they came to some settlement. But now there came letters from Mr. Andrews and Mr. Beauchamp, full of complaints, surprised that nothing had been sent over to meet the amounts due them, and that it appeared by the account sent in 1631 that they were each of them out about eleven hundred pounds apiece, and all this time they had not received one penny towards it, and now Mr. Shirley was trying to get more money from them, and was offended because they refused him. They blamed them here very much that all was sent to Mr. Shirley and nothing to them. The partners here wondered at this, for they supposed that much of their money had been paid in, and that each of them had received a proportionate quantity yearly out of the large returns sent home. They had sent home since the account was received in 1631, which included all and more than all their debts, with that ear's supplies, goods to the following amount. November 18th, 1631, by Mr. Pierce, four hundred pounds of beaver, otter twenty skins. July 13th, 1632, by Mr. Griffin, thirteen hundred forty-eight pounds of beaver, otter one hundred forty-seven skins. Sixteen thirty-three, by Mr. Graves, three thousand three hundred sixty-six pounds of beaver, otter three hundred forty-six skins. Sixteen thirty-four, by Mr. Andrews, three thousand seven hundred thirty-eight pounds of beaver, otter two hundred thirty-four skins. Sixteen thirty-five, by Mr. Bab, one thousand one hundred fifty pounds of beaver, otter two hundred skins. June twenty-fourth, sixteen thirty-six, by Mr. Wilkinson, one thousand eight hundred nine pounds of beaver, otter ten skins. Sixteen thirty-six, by Mr. Langroom, seven hundred nineteen pounds of beaver, otter one hundred ninety-nine skins. Total twelve thousand five hundred thirty pounds of beaver, otter one thousand one hundred fifty-six skins. All these quantities were safely received and well sold as appeared by letters. The coat beaver usually sold at twenty shillings per pound, and sometimes at twenty-four shillings, otter skins at fifteen shillings, and sometimes sixteen shillings each. I do not remember any under fourteen shillings. It may be that the last year's shipment fetched less, but there were some small furs not reckoned in this account, and some black beaver at high rates to make up any such deficit. It was calculated that the above parcels of beaver came to little less than ten thousand pounds sterling, and the otter skins would pay all the expenses, and with other furs make up besides whatever might be short of the former some. When the former account was passed, all their debts, those of the white angel and friendship included, came to but four thousand seven hundred seventy pounds. They estimated that all the supplies sent them scents and bills paid for them could not exceed two thousand pounds, so that their debts should have been paid with interest. It may be objected how came it that they did not know the exact amount of their receipts as they did of their returns, but had to estimate them. Two things were the cause of it. The first and principle was that the new accountant, who was pressed upon them from England, wholly failed them, and could never render them any accounts. He trusted to his memory and loose papers, and let things run into such confusion that neither he nor anyone else could bring things to rights. Whenever he was called upon to perfect his accounts, he desired to have so long or such a time of leisure, and he would finish them. In the interim he fell very ill, and in conclusion he could make no account at all. His books, after a brief good beginning, were left altogether imperfect, and of his papers some were lost and others so confused that he knew not what to make of them himself when they came to be examined. This was not unknown to Mr. Shirley, and the colony came to smart for it to some purpose, both in England and here, though it was not their fault. They reckoned they have lost in consequence some hundred of pounds for goods sold on credit, which were ultimately a dead loss for want of clear accounts to call for payment. Another reason of the mischief was that after Mr. Winslow was sent into England to demand accounts and to take exception to the White Angel, no prices were sent with their goods, and no proper invoice of them. Everything was confused, and they were obliged to guess at the prices. They wrote back to Mr. Andrews and Mr. Beauchamp, and told them they wondered they could say that they had sent nothing home since the last accounts. They had sent a great deal, and it might rather be wondered how they could send so much, beside all the expenses here and what the French had captured, and what had been lost at sea when Mr. Pierce's ship was wrecked off the coast of Virginia. What they had sent was sent to them all, to them as well as Mr. Shirley, and if they had not looked after it it was their own faults. They must refer them to Mr. Shirley who had received it, from whom they should demand it. They also wrote to Mr. Shirley to the same purpose, and what the others' complaints were. This year two shallops going to Connecticut with goods from Massachusetts, belonging to those who had gone there to settle, were wrecked in an easterly storm, coming into the harbor at night. The boatmen were drowned, and the goods were driven all along the shore, and strewn up and down at high watermark. But the governor had them collected, and an inventory made of them, and they were washed and dried. So most of the goods were saved and restored to the owners. Afterwards another boat from the same place, and bound for the same destination, was wrecked at Minoan's Cusset, and the goods that came ashore were preserved for them. Such misfortunes the Connecticut settlers from Massachusetts met with in their beginnings, and some thought them a correction from God for their intrusion there to the entry of others. But I dare not be so bold with God's judgments as to say that it was so. In the year 1634 the Pequots, a war-like tribe that had conquered many of its neighbors, and was puffed up with numerous victories, were at variance with the Narragansets, a great neighboring tribe. These Narragansets held correspondence and were on terms of friendship with the English of Massachusetts. The Pequots, being conscious of the guilt of the death of Captain Stone, whom they knew to be an Englishman, and of those who were with him, and having fallen out with the Dutch, lest they should have too many enemies at once wished to make friends with the English of Massachusetts, and sent messengers and gifts to them, as is shown by some letters from the Governor there as follows, Governor Winthrop of Massachusetts to the New Plymouth Colony, Dear and Worthy Sir, to let you know something about our affairs. The Pequots have sent to us desiring our friendship, and offering much wampum and beaver, etc. The first messengers were dismissed without answer, with the next we had several days' conference, and taking the advice of some of our ministers and seeking the Lord in it we concluded a peace and friendship with them on these conditions, that they should deliver to us the men who were guilty of Stone's death. If we desired to settle in Connecticut they should give up their right to us, and we should trade with them as friends, the chief thing aimed at. To this they readily agreed, and begged that we should mediate a peace between them and the Narragansets, for which purpose they were willing that we should give the Narragansets part of the present they would bestow on us, for they stood so much on their honor that they would not be seen to give anything of themselves. As for Captain Stone they told us there were but two left who had a hand in his death, and that they killed him in a just quarrel, for he surprised two of their men, and bound them, and forced them to show him the way up the river. He went ashore with two others, nine Indians secretly watching him, and when they were asleep that night they killed him and the others to free their own men, and some of them going afterwards to the Penis it was suddenly blown up. We are now preparing to send the Penis to them. In another of his he writes thus, Our Penis has lately returned from the Piquots, they did little trade, and found them a very false tribe, so they mean to have no more to do with them. I have many other things to write you. | 28,994 |
https://cs.wikipedia.org/wiki/M-teorie | Wikipedia | Open Web | CC-By-SA | 2,023 | M-teorie | https://cs.wikipedia.org/w/index.php?title=M-teorie&action=history | Czech | Spoken | 702 | 1,884 | M-teorie je fyzikální teorie, která sjednocuje všechny konzistentní verze teorie superstrun. Edward Witten poprvé předpokládal existenci takové teorie na konferenci teorie strun na Univerzitě Jižní Kalifornie v roce 1995. Wittenovo sdělení spustilo příval výzkumných aktivit známých jako druhá superstrunová revoluce. Před Wittenovým oznámením identifikovali teoretičtí fyzikové pět verzí teorie superstrun. Ačkoli se tyto teorie zpočátku jevily jako velmi odlišné, ukázalo se, že tyto teorie spolu souvisí složitým a netriviálním způsobem. Fyzici zjistili, že zjevně odlišné teorie lze sjednotit matematickými transformacemi nazývanými S-dualita a T-dualita. Wittenova domněnka byla založena částečně na existenci těchto dualit a částečně na vztahu teorií strun k teorii pole zvané jedenáctirozměrná supergravitace.
Historie
Do roku 1984, tzv. první superstrunové revoluce, byla jediným kandidátem na teorii všeho teorie 11-rozměrné supersymetrické supergravitace. Jedenáct je minimální dimenze, ve které lze uvedenou lokálně symetrickou teorii vytvořit. Teorie superstrun vzala supergravitaci její jedinečnost. Supergravitace nešla odvodit z žádné z pěti různých superstrunových teorií, ale v roce 1995, během tzv. druhé superstrunové revoluce, se ukázalo, že superstrunové teorie a supergravitaci lze propojit při limitním růstu vazební konstanty nade všechny meze do zobecňující 11-rozměrné M-teorie.
Princip
Při růstu vazební konstanty v teoriích IIA a HE totiž vzniká makroskopická jedenáctá (desátá prostorová) dimenze. V prvním případě (jak ukázal E. Witten) je svinuta na kružnici o obvodu L a v druhém případě na úsečku o délce L. Limita obou teorií je tedy teorií v 11-rozměrném prostoru, která získala název M-teorie, jejíž nízkoenergetickou aproximací je právě 11-rozměrná supergravitace. Tato jedenáctá dimenze je zcela neviditelná v poruchovém rozvoji, protože je to v podstatě rozvoj okolo. Název M-teorie se poprvé objevil až v říjnu 1995 a má svoji motivaci ve slovech mystérium, magično či membrány, protože pro M-teorii jsou podstatné stavy v podobě vícerozměrných membrán.
Svinutí M-teorie na úsečku, je objevem Edwarda Wittena a našeho slavného krajana Petra Hořavy. Kalibrační grupa teorie HE se skládá z dvou stejných faktorů. Každá z těchto dvou grup žije jednom ze dvou desetirozměrných okrajů pásu jedenáctirozměrného časoprostoru. Petr Hořava pokračuje v pilné práci a přišel s úžasným návrhem na řešení záhady kosmologické konstanty. Náš svět je podle něho vhodné popisovat v řeči M-teorie se šesti souřadnicemi svinutými na Calabi-Yauovu varietu a jednou souřadnicí svinutou na úsečku. Na jednom jejím okraji (tj. jednom okraji světa) žije grupa, která zodpovídá za narušení supersymetrie. Na druhém okraji žije naše grupa, narušená do grupy standardního modelu. Hořava ukázal, že lokálně všude (včetně okrajů světa) zůstává teorie supersymetrická, což by měl být důvod pro vymizení kosmologické konstanty. Svět se jeví supersymetrickým pozorovateli kratšímu, než je délka úsečky. Ovšem globálně teorie supersymetrická není, protože oba okraje světa požadují jiný skok parametru supersymetrické transformace.
Další zajímavý princip pro M-teorii objevil E. Martinec a D. Kutasov. Zjistili, že všechny známé teorie strun je možné generovat pomocí tzv. (2,1) heterotických strun. Podobně, jako je obvyklá (1,0) heterotická teorie směsí vpravojdoucí 10D superstruny (1) a vlevojdoucí 26D bosonové struny (0), je (2,1) teorie směsí vpravojdoucí N=2 superstruny a vlevoujdoucí N=1 superstruny. Liší se v tom, že vede jen ke konečnému množství stavů, protože kritická dimenze N=2 strun je D=2 (obě souřadnice jsou ovšem jistým způsobem zdvojeny) a neobsahuje tedy žádné příčné polarizace. (Parametr N udává stupeň supersymetrie na světoploše. Kromě hodnot 0, 1, 2 s kritickými dimenzemi 26, 10, 2 se promýšlela i hodnota 4, která ovšem vede ke zcela nepoužitelné kritické dimenzi D=-2.)
N=2 superstruna obsahuje dvě časové a dvě prostorové souřadnice. Kvůli skloubení s 9+1 souřadnicemi vlevojdoucími je třeba k nim přidat a poté zase odhodit 1+1 souřadnici. (2,1) teorie tedy generuje teorii pole ve 2+2 rozměrech. Takovou membránu s 2 časovými souřadnicemi nazvali autoři M-bránou. Z 2+2 souřadnic se efektivně 0+1 nebo 1+1 odhodí, proto nám zbude teorie v 1+1 rozměrech (podle volby okrajových podmínek dostaneme různé teorie strun — bosonovou, teorii typu II, heterotickou apod.) nebo v 2+1 rozměrech, kandidát pro konzistentní teorii membrán.
Odkazy
Reference
Související články
Gravitace
Časoprostor
Teorie superstrun
Literatura
Brian Greene: Elegantní vesmír. Superstruny, skryté rozměry a hledání finální teorie, Mladá fronta, Praha 2001,
Michio Kaku: Paralelní světy – Putování stvořením, vyššími dimenzemi a budoucností vesmíru,
Michio Kaku: Hyperprostor – Vědecká odysea paralelními vesmíry, zakřiveným prostorem a desátým rozměrem,
Externí odkazy
M-teorie - výběr
Holografický princip
Holografický princip - rezerva
Vesmír před velkým třeskem
Sněníokvantovégravitaci
Teoretická fyzika | 4,037 |
https://war.wikipedia.org/wiki/Asterina%20plectranthi | Wikipedia | Open Web | CC-By-SA | 2,023 | Asterina plectranthi | https://war.wikipedia.org/w/index.php?title=Asterina plectranthi&action=history | Waray | Spoken | 48 | 100 | An Asterina plectranthi in uska species han Fungi in nahilalakip ha divisio nga Ascomycota, ngan nga ginhulagway ni <![cdata[hosag., Manojk., H. Biju ngan > hadton 2005. An Asterina plectranthi in nahilalakip ha genus nga Asterina, ngan familia nga Asterinaceae. Waray hini subspecies nga nakalista.
Mga kasarigan
Asterina (Asterinaceae) | 46,133 |
https://stackoverflow.com/questions/54292672 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | https://stackoverflow.com/users/2901002, https://stackoverflow.com/users/8713611, jezrael, who_am_i | English | Spoken | 401 | 817 | Pands: Creating dataframe based on keywords from dictionary
I have a dictionary where key is model name and values are keywords. I want to filter every row in a column that string contains one of the keywords that are in the values of dictionary.
Matching should be case insensitive.
Dictionary looks like this:
{'J7 2017': [' J730F', 'amoled'], 'J5 2017': ['J530', 'TFT']}
data frame looks like:
name
0 SCREEN SAMSUNG FULL AMOLED
1 SCREEN SAMSUNG J7 J730F 2017
2 WYŚWIETLACZ LCD + DIGITIZER SAMSUNG J5 2017 (J530)
3 3 colors SCREEN LCD SAMSUNG Galaxy J5 TFT
4 LG K10 K410 K420N K430
As a result i want to have model name [key] stored in separate data frame with with all rows that had my keyword
so the output would be:
dfJ72017:
name
0 SCREEN SAMSUNG FULL AMOLED
1 SCREEN SAMSUNG J7 J730F 2017
dfJ52017:
name
0 WYŚWIETLACZ LCD + DIGITIZER SAMSUNG J5 2017 (J530)
1 3 colors SCREEN LCD SAMSUNG Galaxy J5 TFT
And do it for all keys and values in dictionary.
Use dict comprehension with str.contains and filtering by boolean indexing, '|'.join here is for regex OR:
d = {'J7 2017': [' J730F', 'AMOLED'], 'J5 2017': ['J530', 'TFT']}
dfs = {k: df[df['name'].str.contains('|'.join(v))] for k, v in d.items()}
print (dfs)
{'J7 2017': name
0 SCREEN SAMSUNG FULL AMOLED
1 SCREEN SAMSUNG J7 J730F 2017, 'J5 2017': name
2 WYŚWIETLACZ LCD + DIGITIZER SAMSUNG J5 2017 (J...
3 3 colors SCREEN LCD SAMSUNG Galaxy J5 TFT}
Hi, your solution is great and it works like a charm. I'm trying to figure out the code and i have one question.
Hi, your solution is great and it works like a charm. I'm trying to figure out the code and i have one question.
I've tried to use others boolean indexing's such as ~ but when i replace '|'.join in your code for '~'.join the result is still the same, please help me understand why and how to use other indexes?
@user732954 if need different masks use df[~df['name'].str.contains('|'.join(v))]
Thanks, is there any way to use another method in this dict comprehension?
Such as:
df.nlargest(5, 'DIFFRENT COLUMN NAME')
@user732954 - do you need replace df[df['name'].str.contains('|'.join(v))] by df.nlargest(5, 'col name') ?
@user732954 or chain it by df[df['name'].str.contains('|'.join(v))].nlargest(5, 'col name') ? First filter data by values and then get 5 top rows
First one gave me syntax error, but second solution worked out great. Thanks again!
| 21,430 |
https://de.wikipedia.org/wiki/Ernst%20Hofmann%20%28Schauspieler%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | Ernst Hofmann (Schauspieler) | https://de.wikipedia.org/w/index.php?title=Ernst Hofmann (Schauspieler)&action=history | German | Spoken | 310 | 604 | Ernst Karl Heinrich Hofmann (* 7. Dezember 1890 in Breslau; † 27. April 1945 in Potsdam) war ein deutscher Schauspieler.
Leben und Wirken
Hofmann studierte 1910/11 Kunstgeschichte, Germanistik und Neue Sprachen an der Universität Berlin. Gleichzeitig nahm er Schauspielunterricht an der Schauspielschule des Deutschen Theaters. Hofmann gab 1911 sein Debüt und trat am Kleinen Theater, den Kammerspielen und am Kleinen Schauspielhaus auf. Als Moritz Stiefel in dem Stück Frühlings Erwachen feierte er seinen ersten größeren Erfolg.
Hofmann wurde dann aber vor allem Filmschauspieler. 1913 verhalf ihm Max Reinhardt zu seiner ersten Filmrolle. Zwei Jahre diente er im Ersten Weltkrieg als Reserveoffizier bei der Feldartillerie. Dann stand er wieder vor der Kamera und erfreute sich einige Jahre beträchtlicher Popularität als Frauenliebling. Henny Porten, Asta Nielsen und Pola Negri zählten zu seinen Partnerinnen.
Gegen Ende der 1920er Jahre verblasste sein Ruhm rapide, und auch auf der Bühne, zum Beispiel am Theater in der Behrenstraße war Hofmann nur noch selten zu sehen. So verlegte er sich auf das Schreiben und verfasste unter dem Pseudonym Ernst Hofmann von Schönholtz einige Romane mit den Titeln Täter entflohen, Im Urwald verschollen, Erbschaft aus Übersee, Nacht der Verwirrung, Orchestersessel 13 und Der Schattentänzer. Er lieferte auch Beiträge für Zeitungen wie Der Tag. Hofmann fiel gegen Kriegsende bei den Kämpfen um Berlin.
Mit seiner zwei Jahre älteren Ehefrau Hedda Kemp stand er in mehreren Filmen gemeinsam vor der Kamera wie beispielsweise in Der Knabe in Blau, für den sie das Drehbuch unter dem Pseudonym Edda Ottershausen verfasste.
Filmografie
Literatur
Kay Weniger: Das große Personenlexikon des Films. Die Schauspieler, Regisseure, Kameraleute, Produzenten, Komponisten, Drehbuchautoren, Filmarchitekten, Ausstatter, Kostümbildner, Cutter, Tontechniker, Maskenbildner und Special Effects Designer des 20. Jahrhunderts. Band 4: H – L. Botho Höfer – Richard Lester. Schwarzkopf & Schwarzkopf, Berlin 2001, ISBN 3-89602-340-3, S. 17.
Weblinks
Einzelnachweise und Anmerkungen
Autor
Stummfilmschauspieler
Theaterschauspieler
Deutscher
Geboren 1890
Gestorben 1945
Mann | 5,940 |
https://it.wikipedia.org/wiki/Duttogliano | Wikipedia | Open Web | CC-By-SA | 2,023 | Duttogliano | https://it.wikipedia.org/w/index.php?title=Duttogliano&action=history | Italian | Spoken | 363 | 739 | Duttogliano () è una località della Slovenia, insediamento (naselje) del comune di Sesana.
È capoluogo di una delle 13 comunità locali in cui si suddivide il comune, includendo anche i vicini insediamenti di Godnje, Crepegliano (Kreplje), Scoppo (Skopo), Capriva del Carso (Kopriva), Berie (Brje pri Koprivi) e Krajna vas.
Geografia fisica
Il centro è situato sul Carso a 313,2 metri s.l.m. e a 6 km circa dal confine italiano di Monrupino.
Storia
In epoca asburgica Dutoglie/Duttoule (Dutovlje) fece parte della Contea di Gorizia e Gradisca e, a livello regionale, dapprima del Regno d'Illiria e poi del Litorale austriaco. Costituì un comune autonomo, che comprendeva anche i vicini villaggi di Godinia (Godinje o Godnje) e Creplie (Kreplje).
Nel 1920, in seguito alla prima guerra mondiale e al Trattato di Rapallo, venne annesso come il resto della regione al Regno d'Italia e il suo nome venne cambiato in Duttogliano. Nel 1922 venne inquadrato nella provincia di Trieste come comune autonomo, che incluse le stesse frazioni che in epoca asburgica fino al 1927, quando aggregò i soppressi comuni di Capriva del Carso e Scoppo. A tale epoca dunque il comune includeva le frazioni di:
Duttogliano (Dutovlje), con i centri di Creplie/Crepegliano (Kreplje) e Godnie/Godignano (Godnje);
Scopo/Scoppo (Skopo), con il centro di Crainavas/Villa Cargna (Krajna vas);
Copriva/Capriva nel Carso (Kopriva), con il centro di Berie (Berje).
Nel 1947, dopo la seconda guerra mondiale e i Trattati di Parigi, il paese passò alla Jugoslavia. Dal 1991 fa parte della Slovenia.
Monumenti e luoghi d'interesse
Nei pressi del centro abitato vi è un cimitero militare della prima guerra mondiale. La chiesa parrocchiale è dedicata a san Giorgio (Sv. Jurij).
Un giardino carsico di nome Orto carsico di Pepa, che ha ricevuto una medaglia d'oro a Londra all'Hampton Court Flower Show, è posto nel casale di Buncetov.
Economia
La località è famoso centro vitivinicolo specializzato nella produzione del vino Terrano, grazie alla terra rossa di cui è composto il terreno.
Infrastrutture e trasporti
Duttogliano si trova sulla strada che porta verso Nova Gorica e possiede una propria stazione ferroviaria sulla linea Sesana-Nova Gorica.
Note
Voci correlate
Stazione di Duttogliano
Altri progetti
Insediamenti di Sesana
Comuni della provincia di Trieste soppressi | 30,992 |
https://ceb.wikipedia.org/wiki/Talgodapitiya | Wikipedia | Open Web | CC-By-SA | 2,023 | Talgodapitiya | https://ceb.wikipedia.org/w/index.php?title=Talgodapitiya&action=history | Cebuano | Spoken | 83 | 140 | Administratibo nga balangay ang Talgodapitiya sa Sri Lanka. Nahimutang ni sa lalawigan sa North Western Province, sa sentro nga bahin sa nasod, km sa amihanan-sidlakan sa Colombo ang ulohan sa nasod.
Ang klima habagat. Ang kasarangang giiniton °C. Ang kinainitan nga bulan Marso, sa °C, ug ang kinabugnawan Nobiyembre, sa °C. Ang kasarangang pag-ulan milimetro matag tuig. Ang kinabasaan nga bulan Disyembre, sa milimetro nga ulan, ug ang kinaugahan Hulyo, sa milimetro.
Ang mga gi basihan niini
Mga subdibisyon sa North Western Province | 9,061 |
https://stackoverflow.com/questions/53446061 | StackExchange | Open Web | CC-By-SA | 2,018 | Stack Exchange | English | Spoken | 276 | 684 | Python re.finditer error at special characters
I have code that loops through a list of strings, then loops through each occurrence of that string inside another string. This seems to work until it reaches a string that begins with a question mark (? I).
This is the code.
dtID = 0
for datum in sorted(datumList, key=operator.attrgetter('Sum'), reverse = True):
datum.ID = dtID
for foundDatum in re.finditer(datum.Name, text):
datumLocList.append(DatumLoc(dtID,foundDatum.start()))
dtID += 1
How can I solve this?
Traceback (most recent call last):
File "C:\Users\trist\Documents\Python\The Compressor\The Compressor.py", line 97, in <module>
compress()
File "C:\Users\trist\Documents\Python\The Compressor\The Compressor.py", line 73, in compress
for foundDatum in re.finditer(datum.Name, text):
File "C:\Program Files\Python37\lib\re.py", line 230, in finditer
return _compile(pattern, flags).finditer(string)
File "C:\Program Files\Python37\lib\re.py", line 286, in _compile
p = sre_compile.compile(pattern, flags)
File "C:\Program Files\Python37\lib\sre_compile.py", line 764, in compile
p = sre_parse.parse(p, flags)
File "C:\Program Files\Python37\lib\sre_parse.py", line 930, in parse
p = _parse_sub(source, pattern, flags & SRE_FLAG_VERBOSE, 0)
File "C:\Program Files\Python37\lib\sre_parse.py", line 426, in _parse_sub
not nested and not items))
File "C:\Program Files\Python37\lib\sre_parse.py", line 651, in _parse
source.tell() - here + len(this))
re.error: nothing to repeat at position 0
Your pattern string containing a question mark is being treated as a regular expression special character. The ? symbol attempts to match 0 or 1 repetitions of the preceding regular expression. Since in your string the ? is the first character, it is attempting to match 0 or 1 repetitions of the preceding regular expression, which is nothing: hence your 'nothing to repeat at position 0' error.
To avoid this you can use the re.escape() method which will escape all RE special characters in your pattern string.
for foundDatum in re.finditer(re.escape(datum.Name), text):
datumLocList.append(DatumLoc(dtID,foundDatum.start()))
See https://docs.python.org/3/library/re.html#re.escape
| 33,658 | |
https://pl.wikipedia.org/wiki/Nottingham%20Panthers | Wikipedia | Open Web | CC-By-SA | 2,023 | Nottingham Panthers | https://pl.wikipedia.org/w/index.php?title=Nottingham Panthers&action=history | Polish | Spoken | 105 | 268 | Nottingham Panthers – angielski klub hokeja na lodzie z siedzibą w Nottingham, występujący w brytyjskich rozgrywkach EIHL.
Sukcesy
Mistrzostwo Wielkiej Brytanii / EIHL: 1951, 1954, 1956, 2013 (sezon regularny)
Mistrzostwo EIHL: 1989, 2007, 2011, 2012, 2013, 2016 (play-off)
Autumn Cup: 1956, 1987, 1992, 1995, 1997, 1999
Challenge Cup: 2004, 2008, 2010, 2011, 2012, 2013, 2014, 2016
Puchar Kontynentalny: 2017
Drugie miejsce w Pucharze Kontynentalnym: 2020
Zawodnicy
Zastrzeżone numery
3 – Gary Rippingale
10 – Randall Weber
11 – Greg Hadden
22 – Paul Adey
77 – Corey Neilson
Przypisy
Linki zewnętrzne
Oficjalna strona klubu
Brytyjskie kluby hokejowe
Sport w Nottingham
Kluby hokejowe założone w 1946 | 29,819 |
https://stackoverflow.com/questions/75536364 | StackExchange | Open Web | CC-By-SA | 2,023 | Stack Exchange | English | Spoken | 103 | 195 | Create plot only in some time frames
I have the following code to create a plot in pinescript.
plot(line_to_plot, 'line_to_plot', color=color.lime, style=plot.style_circles, join = true)
I only want to plot this in the 10mins timeframe. This plot is not to appear in other timeframes. The problem I face is that plot() cannot be used in conditional if statements in pinescript.
I am using pinescript v5
create a boolean and then set the boolean to true if the time frame is the 10m
bool = false
if timeframe.period == '10'
bool := true
plot(bool ? line_to_plot : na, 'line_to_plot', color=color.lime, style=plot.style_circles, join = true)
| 37,356 | |
https://de.wikipedia.org/wiki/Ruggero%20Tita | Wikipedia | Open Web | CC-By-SA | 2,023 | Ruggero Tita | https://de.wikipedia.org/w/index.php?title=Ruggero Tita&action=history | German | Spoken | 264 | 537 | Ruggero Tita (* 20. März 1992 in Rovereto) ist ein italienischer Segler.
Erfolge
Der in Civezzano lebende Ruggero Tita nahm als Achtjähriger an ersten Regatten auf dem Caldonazzosee teil. Mit 13 Jahren wurde er italienischer Meister in der Klasse Optimist.
Ruggero Tita, der für die Sportgruppe der Guardia di Finanza startet, nahm an zwei Olympischen Spielen teil. Bei seinem Olympiadebüt 2016 in Rio de Janeiro belegte er in der 49er Jolle mit Pietro Zucchetti den 14. Platz. Danach wechselte er in die Katamaran-Klasse Nacra 17 mit Caterina Banti als Partnerin. Bei den 2021 ausgetragenen Olympischen Spielen 2020 in Tokio waren die beiden in ihrer Konkurrenz sehr erfolgreich. Sie gewannen vier der ersten zwölf Wettfahrten und wurde vier weitere Male Zweite sowie zweimal Dritte. Damit hatten sie bereits vor dem abschließenden Medal Race eine Medaille sicher. Ein sechster Platz genügte letztlich, um den Wettbewerb mit 35 Gesamtpunkten vor den Briten John Gimson und Anna Burnet sowie Paul Kohlhoff und Alica Stuhlemmer aus Deutschland auf dem ersten Platz abzuschließen und als Olympiasieger die Goldmedaille zu gewinnen.
Bereits vor ihrem Olympiasieg hatten Tita und Banti im Nacra 17 zahlreiche Erfolge erzielt. In den Jahren 2017, 2018 und 2020 wurden sie jeweils Europameister. Bei Weltmeisterschaften sicherten sie sich zunächst 2017 in La Grande-Motte die Bronzemedaille, ehe sie 2018 in Aarhus Weltmeister wurden.
Ruggero Tita besitzt einen Hochschulabschluss (Laurea) in Ingenieurinformatik.
Weblinks
Ruggero Tita in der Datenbank von World Sailing (englisch)
Einzelnachweise
Regattasegler (Italien)
Olympiasieger (Segeln)
Weltmeister (Segeln)
Europameister (Segeln)
Olympiateilnehmer (Italien)
Informatiker
Teilnehmer der Olympischen Sommerspiele 2016
Teilnehmer der Olympischen Sommerspiele 2020
Sportler (Trentino)
Italiener
Geboren 1992
Mann | 14,915 |
https://scifi.stackexchange.com/questions/215448 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | NKCampbell, Spencer, https://scifi.stackexchange.com/users/55637, https://scifi.stackexchange.com/users/63330 | English | Spoken | 280 | 392 | Short story about a girl with a spider in her hair
I'm trying to find the name of a short story I read around 2002-2003 as an e-book from the now-defunct fictionwise.com. It could have been a free book from them, implying it was either a recent award nominee or an older story (I remember reading Sandkings around the same time).
A schoolgirl (grade school or high school) is regularly bullied by her classmates. She wakes up one morning from friendly, comforting dreams with small bites around her scalp. Somehow, either through her dreams or some other mental link, she comes to realize that there is an intelligent (alien?) spider nesting in her hair. The spider might be the last of her species and is about to die, and needs a human host, who will also die in the process, to hatch her brood.
The girl's bond with the spider grows and she decides to let the spider lay her eggs, sacrificing herself to help the spider who has been kind and understanding towards her. She puts her hair up and pretends to be sick for a few days to hide the spider from her parents and give its eggs time to develop. At the end, the brood of spiders bursts from the now-dead girl's body and one of the newborn spiders, remembering the name of the leader of the girl's bullies, scurries towards the school to target that bully.
sounds kinda like: http://www.scaryforkids.com/the-red-spot/
Unfortunately, Sandkings was first published 20 years earlier than when you read it. However, the association still might be useful if you can confirm that you read the two in the same anthology or magazine issue.
| 33,907 |
https://stackoverflow.com/questions/16729415 | StackExchange | Open Web | CC-By-SA | 2,013 | Stack Exchange | 0xAli, Ashwin Yaprala, Hanky Panky, https://stackoverflow.com/users/1570534, https://stackoverflow.com/users/1903696, https://stackoverflow.com/users/736564 | English | Spoken | 346 | 499 | Update column from same table column
I have table t1.
table t1
id post_id tags
1 null a
2 1 null
3 1 null
4 null b
I want to update tags where post_id = id.
I tried a query it is giving me zero output.
post_id is always null when tags exists and tags is always null when post_id exists
update t1 set tags = tags where post_id = id;
Can u guys frame it properly for me. Please help me
Its better if i won't need to create a temp table to get this
set tags = tags this query will not update anything even if it runs
Why would you want to update the tags with the same tags value?
update t1 a join t1 b on a.id = b.post_id set b.tag = a.tag
What different is it from the real one? updating a value with itself does not change anything
I believe OP wants to take the tag where id=1, and set the tag equal to that value where all post_id = 1, so on and so forth. I might have the a and b backwards though.
Thank You Mister Melancholy. This can help me changing other things
Any time. Don't forget to accept the answer if it worked for you.
it asked me to wait 6 min while accepting it. I don't know why it said.
Probably to make sure that the really smart guy that's potentially typing the long answer has a chance to get accepted too.
update t1 set tags = tags where post_id = id;
Here no record will update because tags = tags.You are updating the column with that column value.
PSR, Hanky. How can i get this.
Which value you want to save in tags field for this query?
update t1 set tags = tags where post_id = id;
That means set A=A, 1=1, B=B, Set something to itself. That won't update anything. You have to provide a different value to update that, for example
update t1 set tags = "Testing 123" where post_id = id;
| 1,284 |
https://nl.wikipedia.org/wiki/Kalenbergergracht | Wikipedia | Open Web | CC-By-SA | 2,023 | Kalenbergergracht | https://nl.wikipedia.org/w/index.php?title=Kalenbergergracht&action=history | Dutch | Spoken | 92 | 205 | De Kalenbergergracht is een waterweg in de Nederlandse provincie Overijssel.
De Kalenbergergracht is een schakel in de vaarverbinding vanaf Blokzijl en het Giethoornsche Meer en de Friese waterwegen. Vanaf het punt waar de Heuvengracht en de Heer van Diezenvaart samenkomen loopt de Kalenbergergracht in noordwestelijke richting langs Kalenberg en dwars door het natuurgebied De Weerribben naar Ossenzijl. In Ossenzijl komt de Kalenbergergracht samen met het kanaal Steenwijk-Ossenzijl. De Ossenzijlersloot verbindt deze vaarwegen met de Linde, die verbonden is met de Friese wateren.
Kanaal in Overijssel
Geografie van Steenwijkerland
Stroomgebied van het IJsselmeer | 45,674 |
https://stackoverflow.com/questions/32997588 | StackExchange | Open Web | CC-By-SA | 2,015 | Stack Exchange | English | Spoken | 149 | 457 | LDAP ERROR - Cannot Login to Portal
A co-developer of mine has made some changes in Liferay's LDAP configuration and now we cannot log into our portal (LDAP or manual login) and the following exception is returned:
16:19:01,330 ERROR [http-nio-20110-exec-2][MainServlet:477] com.liferay.portal.ModelListenerException: javax.naming.NameNotFoundException:
[LDAP: error code 32 - No Such Object]; remaining name 'cn=admin,'
com.liferay.portal.ModelListenerException: javax.naming.NameNotFoundException:
[LDAP: error code 32 - No Such Object]; remaining name 'cn=admin,'
...
16:28:15,372 ERROR [liferay/scheduler_dispatch-4][PortalLDAPImporterImpl:210] Error importing LDAP users and groups
javax.naming.directory.InvalidSearchFilterException: Empty filter; remaining name 'dc=mycompany,dc=com'
I cannot access the Control Panel in order to reset the config - is there any way to reset this in portal-ext.properties or the database?
In the portal-ext.properties you can use this key:
ldap.auth.required=
ldap.auth.enabled=
ldap.base.provider.url.0=
ldap.base.dn.0=
ldap.security.principal.0=
ldap.security.credentials.0=
ldap.auth.search.filter.0=
ldap.user.mappings.0=
Another solution is to add another ldap configuration. In order to do that just increment .0 on each properties like:
ldap.base.provider.url.1=
ldap.base.dn.1=
ldap.security.principal.1=
ldap.security.credentials.1=
ldap.auth.search.filter.1=
ldap.user.mappings.1=
| 21,502 | |
https://superuser.com/questions/817375 | StackExchange | Open Web | CC-By-SA | 2,014 | Stack Exchange | Journeyman Geek, Pacerier, https://superuser.com/users/10165, https://superuser.com/users/278985, https://superuser.com/users/78897, oldmud0 | English | Spoken | 430 | 666 | Recover the text from a notepad dump file
I was typing in notepad I then clicked save and it hanged so I went to task manager and clicked on the hanged process of notepad.exe "Create Dump File". I never got to save my .txt file ony the .dmp file. My dump file says notepad.dmp and is 104MB. Is there anyway I can recover my text from the dump file?
Smart for making a dump file.
Yes, there is. The dump created a copy of the program's memory, so all you need to do is get a hex editor like the excellent HxD. Open your .dmp file, which is located in %TEMP%\notepad.dmp in this case.
Now press Ctrl+F and search for a piece of your text. Make sure to check "Unicode string."
Your text should automatically be highlighted where it is found. Note that the address may differ.
If the null between each character is annoying you, try Find + Replace to remove as much of it as you can..
And remember... don't ever type anything important on Notepad!
Autosave is a nice feature, tho I overely on it with sublime text 2
@oldmud0, Odd, why would they be stored as Unicode strings..
@oldmud0, Hey bro, any tips on how to recover data when I don't have information regarding the text to "Ctrl+F"?
@Pacerier well, you can always scroll through the hex dump manually. This should be pretty easy to do if the file you want to recover is fairly large and has mostly text (not a binary file...).
@oldmud0, It's a text file, but "Scrolling manually" doesn't work because it will take about 200 hours to scroll through them and the thing is I am not not quite sure how big the file is (it might be all of 10 lines), so I'll have to scroll even more slowly to be able to catch that text file :( There got to be some format that we can search right? Like starting bytes or ending bytes?
@Pacerier Look for common words like "that" or "and". The file contents usually begin at the very beginning of the dump file, at about 0xD71A0.
@oldmud0, Wow dude, you're a life saver! I'm lucky, there is a lot of false positives (e.g. http://i.stack.imgur.com/LF3N8.png , http://i.stack.imgur.com/DyOnI.png) and I was about to give up when I found it. Odd that your's is way up at the top. I actually found it at 2ce930. If I test with a new notepad now (win 8.1), it appears at 203a990. And if Ctrl-S subwindow is open, it appears at 3169bf0.
| 3,880 |
https://de.wikipedia.org/wiki/Louis%20Charles%20de%20Bourbon%2C%20comte%20d%E2%80%99Eu | Wikipedia | Open Web | CC-By-SA | 2,023 | Louis Charles de Bourbon, comte d’Eu | https://de.wikipedia.org/w/index.php?title=Louis Charles de Bourbon, comte d’Eu&action=history | German | Spoken | 518 | 888 | Louis Charles de Bourbon, Graf von Eu, französisch Louis Charles de Bourbon, comte d’Eu (* 15. Oktober 1701 im inzwischen zerstörten Schloss von Sceaux; † 13. Juli 1775 ebenda), war ein französischer Adliger, Grand maître de l’artillerie de France und Colonel général des Cent-Suisses et Grisons. Letzteren Posten gab er 1762 wieder ab.
Er war seit 1736 Duc d’Aumale, seit 1762 Duc de Gisors, Comte de Dreux, Prince d’Anet und Baron de Sceaux. Von 1755 bis 1762 war er der letzte souveräne Fürst von Dombes, bis dieses Fürstentum vom Königreich Frankreich annektiert wurde.
Er führte zur Lebenszeit den Titel: Son Altesse Sérénissime, Monseigneur le comte d’Eu.
Leben
Louis Auguste war der zweite Sohn und das fünfte von sieben Kindern von Louis Auguste de Bourbon, Herzog von Maine und von Louise Bénédicte de Bourbon. Damit war er ein Enkel von König Ludwig XIV. von Frankreich. Er wuchs zusammen mit seinem älteren Bruder Louis Auguste (1700–1755) und seiner Schwester Louise Françoise (1707–1743), Mademoiselle du Maine, auf. Wie seine Geschwister blieb auch er unverheiratet. Nach dem Tod seines Vaters im Jahr 1736 erhielt er den Titel Herzog von Aumale und Graf von Eu. Außerdem erbte er von seinem Vater den Titel eines Großmeisters der Artillerie. Haupterbe seines Vaters war allerdings sein älterer Bruder Louis Auguste. Nachdem dieser im Jahr 1755 in einem Duell getötet wurde, erbte er dessen Besitztümer und Titel. Ähnlich wie sein Bruder ließ er sich selten am Hof sehen und widmete sich vor allem der Jagd. Im Jahr 1762 tauschte er mit König Ludwig XV. seine Herrschaft über Dombes (La souveraineté de Dombes), die er ebenfalls 1755 geerbt hatte, gegen das Herzogtum Gisors und die Besitzungen von Gretz-Armainvilliers und Pontcarré. Ähnlich wie sein Cousin und späterer Erbe Louis Jean Marie de Bourbon, duc de Penthièvre war Louis Charles sehr beliebt. Das hing auch mit seiner Großzügigkeit bei Spenden zusammen. Im Jahr 1773 veräußerte er einen Großteil seines Besitzes für zwölf Millionen Livres an den König. Allerdings wurde der Betrag nach dem Tod des Königs im Mai 1774 nie bezahlt. Im Jahr 1775 starb Louis Charles in Sceaux.
Er war Offizier und wurde 1734 zum Maréchal de camp befördert. Im Jahre 1735 wurde er zum Lieutenant-général ernannt.
Während des Polnischen Thronfolgekrieges Österreichischen Erbfolgekrieges nahm er an der 1733 an der Belagerung von Kehl teil und war dann der Armee am Rhein zugeteilt.
Im Österreichischen Erbfolgekrieg kämpfte er 1743 in der Schlacht bei Dettingen, in der er verwundet wurde. Die ganze Zeit bei der Armee am Rhein stand er 1744 bei der Belagerung von Freiburg, dann 1745 bei der Belagerung von Fontenoy und kämpfte anschließend in der Schlacht bei Fontenoy, der Schlacht bei Raucoux und der Schlacht bei Lauffeldt.
1728 wurde er von Louis XV. zum Chevalier des Ordre du Saint-Esprit und des Ordre royal et militaire de Saint-Louis ernannt.
Weblinks
Eintrag bei Geneall
Literatur
Patrick Van Kerrebrouck, La Maison de Bourbon 1256–2004, deuxième édition revue et augmentée, 2004, Villeneuve d’Ascq, l’auteur, 1010 p., tome 2, pages 762 à 767.
Fürst (Dombes)
Graf (Dreux)
Ritter des Ordens vom Heiligen Geist
Hofbeamter (Frankreich)
Louis Charles
Franzose
Geboren 1701
Gestorben 1775
Mann | 51 |
https://stackoverflow.com/questions/68542607 | StackExchange | Open Web | CC-By-SA | 2,021 | Stack Exchange | English | Spoken | 156 | 381 | Webpack 5 assetModuleFilename avoid illegal characters in filename
Is there a way to avoid/scape illegal chars as "çãáéó" and white spaces in filenames using type: 'asset' and assetModuleFilename: 'images/[name][ext] ?
[...]
output: {
[...]
assetModuleFilename: 'images/[name][ext][query]', // name NOT hash etc..
},
module: {
rules: [
{
test: /\.(jpe?g|png|gif|svg)$/i,
type: 'asset',
parser: {
dataUrlCondition: {
maxSize: 10 * 1024
}
}
},
[...]
Got it, if someone is interested, this may help SEO of files. This sanitize the filename to avoid white spaces and latin characters. I don't know if this is a 'fancy' way to do it, but it works! (I'm open to improvements):
[...]
output: {
[...]
assetModuleFilename(module) { //Instead of using as a object we use as a function
module.filename = module.filename.normalize("NFD").replace(/[\s]/g, "_").replace(/[\u0300-\u036f]/g, ""); // Thanks to https://stackoverflow.com/a/37511463/3955955
return 'images/[name][ext]'; // I'm not sure why we don't need a dot here
},
}
[...]
Take a note that this is using Webpack 5.
| 30,049 | |
https://de.wikipedia.org/wiki/Thomas%20Grumme | Wikipedia | Open Web | CC-By-SA | 2,023 | Thomas Grumme | https://de.wikipedia.org/w/index.php?title=Thomas Grumme&action=history | German | Spoken | 202 | 485 | Thomas Grumme (* 1939 in Göttingen; † 2007) war ein deutscher Neurochirurg. Er war Chefarzt und Professor für Neurochirurgie am Klinikum Augsburg (heute Universitätsklinikum Augsburg).
Grumme wurde 1964 in Göttingen promoviert (Das Hypophysenadenom: Klinisches Bild, Verlauf, Prognose, Behandlung). Er war von der Gründung der Neurochirurgischen Klinik am Klinikum Augsburg 1982 bis zum Ruhestand 2003 deren Chefarzt.
Grumme ist Mitautor eines Standardwerks über Komplikationen (und Behandlungsfehler) in der Neurochirurgie. Er war auch bekannt als einer der führenden Fachleute für Hirndiagnostik mit Einführung der Computertomographie in Deutschland.
2002 erhielt er die Wilhelm-Tönnis-Medaille.
Schriften
mit Dieter Kolodziejczyk: Komplikationen in der Neurochirurgie, Blackwell 1994, 1995
Herausgeber mit E. Kazner u. a.: Computer- und Kernspin-Tomographie intrakranieller Tumoren aus klinischer Sicht, Springer 1981, 2. Auflage 1988
als Herausgeber: Das Hirnödem: intensivmedizinische Probleme in der Neurochirurgie, De Gruyter 1984
mit Wolfgang Kluge, Konrad Kretzschmar: Zerebrale und spinale Computertomographie, Blackwell, 3. Auflage 1998
mit Sebastian Lange, Wolfgang Meese: Zerebrale Computer-Tomographie, Berlin, Schering 1977
mit W. Lanksch, E. Kazner: Schädelhirnverletzungen im Computertomogramm, Springer 1978 (englische Übersetzung: Computed tomography in head injuries, Springer 1979)
Weblinks
Nachruf in der Augsburger Allgemeinen, 30. Oktober 2007
Neurochirurg
Mediziner (20. Jahrhundert)
Mediziner (21. Jahrhundert)
Person (Universitätsklinikum Augsburg)
Hochschullehrer (Universität Augsburg)
Deutscher
Geboren 1939
Gestorben 2007
Mann | 37,782 |
https://es.wikipedia.org/wiki/Lenguas%20alarodianas | Wikipedia | Open Web | CC-By-SA | 2,023 | Lenguas alarodianas | https://es.wikipedia.org/w/index.php?title=Lenguas alarodianas&action=history | Spanish | Spoken | 459 | 1,127 | Las lenguas alarodianas serían una supuesta macrofamilia dentro de las lenguas caucásicas que incluiría tanto a dos familias lingüísticas comprobadas:
Lenguas caucásicas del nordeste.
Lenguas hurrito-urartianas.
Historia de la hipótesis alarodiana
La familia alarodiana fue propuesta inicialmente por Fritz Hommel (1854-1936). El término proviene del nombre que Heródoto usó para referirse al reino de Urartu. La conexión entre las lenguas caucásicas del nordeste y las lenguas caucásicas norcentrales se basó en similitudes fonéticas y gramaticales, tales como el alineamiento morfosintáctico de tipo ergativo.
Hoy en día sabemos que dichas similitudes podrían ser el resultado de convergencia lingüística típica de un área lingüística en formación. Por esa razón las similitudes señaladas no constituyen una prueba concluyente para demostrar la relación filogenética. Peor aún, ninguna de las características señaladas es exclusiva del área caucásica, por lo que ni siquiera puede argumentarse que haya existido un contacto especialmente estrecho entre las lenguas hurrita-urarteas y las lenguas caucásicas septentrionales.
Posteriormente K. Ostir (1921, 1922), y A. Svanidze (1937), G. Melikishvili (1965), I.M. Diakonov y S. A. Starostin (1986). Retomaron la idea de Hommel tratando de aportar evidencia léxica en favor de la hipótesis, ya que la evidencia léxica y las correspondencias fonéticas regulares son el único medio universalmente aceptado para probar un parentesto filogenético.
Comparación léxica
Los numerales en hurrita-uraritano, comparados con los numerales en lenguas caucásicas son:<!R0>
{|class=wikitable style=text-align:center;
|-
! rowspan=2|GLOSA
! colspan=2|Hurrita-Urartiano
! rowspan=2|PROTO-CAUCÁSICONOROR.
! rowspan=2|PROTO-CAUCÁSICONOROCC.
|-
! Hurrita !! Urartiano
|-
| '1' || šukki ||
| *c(h)a || *za
|-
| '2' || šin(a) ||
| *qʷʼa || *tʼqʷʼa
|-
| '3' || kig(a) ||
| *ɬeb (?) || *ɬːə
|-
| '4' || tumni ||
| *əmq(ʷ)ʼi || *pʼɬʼa
|-
| '5' || nariy(a) ||
| *x̂ʷə || *sx̂ʷə
|-
| '6' || šeže ||
| *renɬə- || *ɬʷə
|-
| '7' || šindi ||
| *u̯ərδ (?) || *bɮə
|-
| '8' || kira/i ||
| *mbərδ || *ɣa
|-
| '9' || tamri/a ||
| *wərčʼ || *bʒʷʲə
|-
| '10' || eman ||
| *wəcʼ || *bɕʼʷə
|}
Véase también
Lenguas caucásicas
Idioma hurrita
Idioma urartiano
Referencias
Bibliografía
K. Ostir. Beiträge zur Alarodischen Sprachwissenschaft (a monograph), I, 1921 (en alemán)
K. Ostir. Alarodische Sprachwissenschaft (a monograph), 1922 (en alemán)
A. Svanidze. "Materials for history of Alarodian tribes" (a monograph), Tbilisi, 1937 (en ruso)
G.A. Melikishvili. Questions of the oldest population of Georgia, Caucasus and the Near East (a monograph), Tbilisi, 1965 (en georgiano, sumario en ruso)
I. Diakonoff, S. Starostin. "Huro-Urartian as an Eastern Caucasian Language".- Münchener Studien zur Sprachwissenschaft, Beiheft, N.F., 12, 1986 (en inglés)
Alarodian languages.- Encyclopedia "Sakartvelo", vol. I, Tbilisi, 1997, pp. 90 (en georgiano)
Enlaces externos
Comparative Notes on Hurro-Urartian, Northern Caucasian and Indo-European by V. V. Ivanov
Alarodiana
Alarodiana | 45,595 |
https://puzzling.stackexchange.com/questions/97764 | StackExchange | Open Web | CC-By-SA | 2,020 | Stack Exchange | HelloWorld1337, https://puzzling.stackexchange.com/users/65588 | English | Spoken | 205 | 284 | Puzzle - Turn all the lights on
A machine has 2020 lights and 1 button. Each button press changes the state of
exactly 3 of the lights. That means if the light is currently on, it turns off, and if
the light is currently off, it turns on. Before each button press, the user selects
which 3 lights will change their state.
To begin with, all the lights on the machine are off. What is the fewest number
of button presses required in order for all the lights to be on?
Hint: Start by thinking about a machine with fewer lights.
I could be wrong, but is the answer:
674
Because:
If we'd take modulo-3 on 2020 there is 1 remaining. This means we'll have to get to a state with either 1 light turned on, or alternatively 4 (3+1) lights turned on. To do the second, we'll need 2 button-presses:
1. Turn 3 lights on
2. Turn 1 light off + 2 on (we now have 4 lights turned on)
After that there are 2020 - 4 = 2016 lights remaining, which we can all turn on as sets of three in 672 (2016 / 3) additional button-presses.
I think you're right, good job!
| 17,571 |
https://stackoverflow.com/questions/3578058 | StackExchange | Open Web | CC-By-SA | 2,010 | Stack Exchange | Coutz, Hamza Eldemery, Max, PatrickSteele, Ryan D, Suleman Saeed, Tony Orlando, Westpennoil, alex cyrus, dezfowler, https://stackoverflow.com/users/160419, https://stackoverflow.com/users/182895, https://stackoverflow.com/users/349414, https://stackoverflow.com/users/7470191, https://stackoverflow.com/users/7470192, https://stackoverflow.com/users/7470193, https://stackoverflow.com/users/7471094, https://stackoverflow.com/users/7471842, https://stackoverflow.com/users/7472686, https://stackoverflow.com/users/7472975, https://stackoverflow.com/users/7476879, oneateach | English | Spoken | 459 | 844 | Using List as query string parameter using MVC
I have an action method that looks like this:
public ActionResult DoSomething(string par, IEnumerable<string> mystrings)
I wanted to map this to a URL using Url.Action, passing mystrings in the RouteValueDictionary. However, this only yields a query string that only corresponds to mystrings.ToString().
How could I pass a list in the query string? Is there some functionality in MVC 2 that supports this?
CLARIFICATION: The action method is called using GET, not POST.
There is no problem for my action method to parse the query string DoSomething?mystrings=aaa&mystrings=bbb
However, I cannot generate this using Url.Action. Passing a list generates the following query string: mystrings=system.collections.generic.list%601%5bsystem.string%5d
Is there some way I could accomplish this easily?
Yes. Model Binding To A List
EDIT: Ok, now I see where you're going with this. I don't think ASP.NET MVC has that built-in since it's designed to generate query strings from route values that have unique names. You may have to roll your own. I would create an extension method on IEnumerable<String> like this:
public static class Extensions
{
public static string ToQueryString(this IEnumerable<string> items)
{
return items.Aggregate("", (curr, next) => curr + "mystring=" + next + "&");
}
}
Then you could generate your own query string like this:
<%= Url.Action("DoSomething?" + Model.Data.ToQueryString()) %>
This needs some polish as you should UrlEncode your strings and it creates a trailing "&", but this should give you the basic idea.
Well, that seems to pertain only to POST model binding, which I have used before. However, this is about GET model binding and the query string. I will update my question to clarify.
Did you try it? :) I did and it works fine with GET. Using your method signature above, try sending the querystring "mystrings=aaa&mystrings=bbb&mystrings=ccc" and see what happens.
Well, I can successfully CALL the method. Which is pretty logical, since its the same for POST. However, I cannot generate these query strings. I'd like to use Url.Action, but it does not work out of the box, the way I am trying to. Please see my updated question (Again) ;)
The more serious issue with this, rather than the UrlEncode, is that it's concatenating strings instead of using a StringBuilder.
How about:
<%: Html.ActionLink("foo", "DoSomething", new RouteValueDictionary() {
{ "mystrings[0]", "aaa" }, { "mystrings[1]", "bbb" }
}) %>
which generates:
<a href="/Home/DoSomething?mystrings%5B0%5D=aaa&mystrings%5B1%5D=bbb">foo</a>
This is not exactly the URL you were looking for but it will successfully bind to your controller action. If you want to generate an url without the square brackets you will need to roll your own helper method.
public static class Extensions
{
public static string ToQueryString(this IEnumerable<string> items)
{
if (items.Count>0)
{
var urlParam = string.Join("&", items.ToArray());
return "?"+ urlParam;
}
return "";
}
}
| 46,305 |
https://math.stackexchange.com/questions/4374669 | StackExchange | Open Web | CC-By-SA | 2,022 | Stack Exchange | Eric Wofsey, Nik Bren, https://math.stackexchange.com/users/113448, https://math.stackexchange.com/users/30222, https://math.stackexchange.com/users/86856, tomasz | English | Spoken | 966 | 1,937 | The set is meager if it has a cover of clopen meager sets
Let $X$ be a topological space such that there exists a collection of meager clopen sets $(C_i)_{i \in I}$ such that $X = \bigcup_{i \in I} C_i$. I want to prove that $X$ is then meager itself.
As each $C_i$ is meager there is a sequence of nowhere dense sets $(N_{i,n})^\infty_{n=1}$ such that $C_i = \bigcup^\infty_{n=1} N_{i,n}$. For natural $n$ define set $M_n = \bigcup_{i\in I} N_{i,n}$. Then by basic set theory
$$
X = \bigcup_{i \in I} C_i = \bigcup_{i \in I} \bigcup_{n=1}^\infty N_{i,n} =
\bigcup_{n=1}^\infty \bigcup_{i \in I} N_{i,n} = \bigcup_{n=1}^\infty M_n.
$$
So, we need to show that each $M_n$ is meager and we are done. Initaly I thought that it may be possible to use clopennes to write something like
$$
\mathrm{int}\;\mathrm{cl}\;M_n = \mathrm{int}\;\mathrm{cl}\;\bigcup_{i \in I} N_{i,n} =
\bigcup_{i \in I} \mathrm{int}\;\mathrm{cl}\; N_{i,n} = \bigcup_{i \in I} \emptyset =\emptyset,
$$
where $\mathrm{int}$ and $\mathrm{cl}$ stand for interior and closure operations respectively, so $M_n$ is nowhere dense. But this works only if $(C_i)_{i \in I}$ are disjoint. This won't work in general, for example take $(C_i)_{i \in I}$ to be a collection of all clopen sets in $X=\mathbb{Q}$, and choose $N_{i,n}$ to be a collection of singletons so each $M_n = \mathbb{Q}$. I know that in this example sets $X$ is meager, but I wanted to show that argument above may fail in general.
My first idea was to transform $(C_i)_{i\in I}$ into a different disjoint clopen cover $(C'_j)_{j \in J}$, such that for each $j\in J$ there is $i\in I$ with $C'_j\subset C_i$. But how to do so? In case $X$ is locally connected one can just take its connected components, but this won't work in general. I thought that a transfinite induction may also work. By abuse of notation assume that $I$ is an ordinal, let $\mathcal{C}_{1}$ be an well-order by $I$ version of $(C_i)_{i\in I}$. then for a non-limit ordinal $\kappa + 1$ we may construct a Set $\mathcal{C}_{\kappa + 1} = \{ C^\kappa_{1}, \ldots, C^\kappa_\kappa \} \cup \{ C^\kappa_{\kappa +1} \setminus C^\kappa_\kappa , \ldots, C^\kappa_{I} \setminus C^\kappa_\kappa \}$, which is an ordered set of clopen sets, where each set in the first brackets is disjoint from any other set in $\mathcal{C}_{\kappa + 1}$. And for the limit ordinals $\lambda$ just write $\mathcal{C}_\lambda = \{ C^i_i | i < \lambda\} \cup \left\{ \bigcap_{i < \lambda} C^i_j |\lambda \le j \le I \right\}$? I don't think this will work, as clopeness may be lost. But in the end I hoped $\mathcal{C}_I$ to be a disjoint cover I seek.
Please, help me to prove this statement.
Where did you get this problem from? Is this an exercise? Are you sure it's true?
This is a problem 9.124 from A. Wilansky's Topology for analysis, I want to prove it because it used for proving Baire-related facts for topological groups later on.
@tomasz problem 9.3.124 to be exact
Here's the trick. Let $(U_j)_{j\in J}$ be a maximal family of disjoint meager open subsets of $X$ (such a maximal family clearly exists by Zorn's lemma, for instance). Let $U=\bigcup U_j$. Then $U$ is meager using the line of argument you propose, since the $U_j$ are disjoint. But now observe that $X\setminus U$ is closed and has empty interior (if a point $x$ was in its interior, then we could find a meager open neighborhood of $x$ contained in it which we could then add to our family, contradicting maximality). So we can add $X\setminus U$ as one more nowhere dense set to witness that $X$ is meager.
(Incidentally, this argument only requires the $C_i$ to be open, not necessarily clopen. So this shows that if a topological space is locally meager (i.e., each point has a meager neighborhood) then it is meager.)
I'm afraid if $U_j$ are not clopen then $U$ may not be a meager as my argument may fail. But if we demand from $U_j$ to be clopen, then the maximality argument may fail.
Well you did not give the details of your argument so I am not sure what step you think fails. But it is true that if you have nowhere dense sets $N_j$ that are contained in disjoint open subsets $U_j$ then the union $\bigcup N_j$ is still nowhere dense.
If you were claiming that you can just say $\operatorname{int cl}\bigcup N_i=\bigcup \operatorname{int cl}N_i$ whenever the $N_i$ are contained in disjoint clopen sets, then that does not work (even with clopen rather than open sets). For instance the $N_i$ themselves could be disjoint clopen sets whose union is dense in the whole space (but not equal to the whole space), and then the interior of the closure of the union is the whole space.
https://mathoverflow.net/a/109241/91850 lets have this as a reference.
It is not true that ${\star} \times [0,1] \subset \mathrm{int};\mathrm{cl};\bigcup_{i \in I} N_i$ in your example. An open neighborhood of ${\star} \times [0,1]$ would need to contain an entire vertical interval around $(i,0)$ for each $i\in[0,1]$.
The argument I had in mind for $\bigcup N_i$ being nowhere dense is that if its closure had nonempty interior, the interior would have to intersect some $U_j$. But since $U_j$ is open, $U_j\cap \operatorname{cl}\bigcup N_i=\bigcup \operatorname{cl}(U_j\cap N_i)=\operatorname{cl}(U_j\cap N_j)$ which has empty interior since $N_j$ is nowhere dense.
Looking at the reference you posted I guess this is basically the same as Hamkins's argument for his Claim.
I think overall you are correct, and you answer is surely correct accepting Banach category theorem. My only point was that $U_j$ and $\mathrm{cl};N_i$ may have nonempty intersection even for $i\neq j$ if $U_j$ is not closed.
That's not possible though if $U_j$ is open. For $i\neq j$, since $X\setminus U_j$ is a closed set containing $N_i$, it contains the closure of $N_i$.
| 21,844 |
https://ar.wikipedia.org/wiki/%D8%AE%D8%B1%D9%88%D8%A8%D8%A9%20%D8%B9%D8%A8%D9%88%D8%AF%20%28%D8%A8%D9%86%D9%8A%20%D8%AD%D9%8A%D8%AA%D9%85%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | خروبة عبود (بني حيتم) | https://ar.wikipedia.org/w/index.php?title=خروبة عبود (بني حيتم)&action=history | Arabic | Spoken | 55 | 184 | خروبة عبود هو دُوَّار يقع بجماعة مكناسة الشرقية، إقليم تازة، جهة فاس مكناس في المملكة المغربية. ينتمي الدوّار لمشيخة بني حيتم التي تضم 20 دواوير. يقدر عدد سكانه بـ 206 نسمة حسب الإحصاء الرسمي للسكان والسكنى لسنة 2004.
مراجع
روابط خارجية
البوابة الوطنية للجماعات الترابية
المندوبية السامية للتخطيط
أماكن مأهولة في بني حيتم (مكناسة الشرقية) | 45,592 |
https://sv.wikipedia.org/wiki/Pelargonium%20ochroleucum | Wikipedia | Open Web | CC-By-SA | 2,023 | Pelargonium ochroleucum | https://sv.wikipedia.org/w/index.php?title=Pelargonium ochroleucum&action=history | Swedish | Spoken | 31 | 66 | Pelargonium ochroleucum är en näveväxtart som beskrevs av William Henry Harvey. Pelargonium ochroleucum ingår i släktet pelargoner, och familjen näveväxter. Inga underarter finns listade i Catalogue of Life.
Källor
Pelargoner
ochroleucum | 17,788 |
https://tt.wikipedia.org/wiki/%D0%A0%D0%B0%D0%B6%D0%B4%D0%B0%D0%B3%D0%B8%D0%BD%D1%8F | Wikipedia | Open Web | CC-By-SA | 2,023 | Раждагиня | https://tt.wikipedia.org/w/index.php?title=Раждагиня&action=history | Tatar | Spoken | 173 | 565 | Раждагиня () — Сербиянең Златибор округы җирлегендә () урнашкан торак пункт.
Географиясе
Балкан ярымутравының төньяк өлешендә, диңгез дәрәҗәсе өстеннән биеклектә урнашкан.
Климаты
Биредә кышлар кыска һәм карлы, җәйләр җылы. Иң салкын ай – гыйнвар, иң җылы ай – июль. Урта температура - 11 °C. Уртача еллык явым-төшем саны – 896 мм.
Демография
Искәрмәләр
Әдәбият
Никифоров К. В. Сербия на Балканах. XX век. — Москва: Индрик, 2012. — 176 с. — ISBN 978-5-91674-209-1.
Поспелов Е. М. Географические названия мира. Топонимический словарь / отв. ред. Р. А. Агеева. — 2-е изд., стереотип. — М.: Русские словари, Астрель, АСТ, 2002. — 512 с. — 3000 экз. — ISBN 5-17-001389-2.
Љубоја, Бранко. Организација власти у локалној самоуправи у Републици Србији. — Београд: Стална конференција градова и општина — Савез градова и општина Србије, 2013. — 57 с. — ISBN 978-86-88459-08-2.
Ђурић В., Танасковић Д., Вукмировић Д., Лађевић П. Етноконфесионални и језички мозаик Србије. — Београд: Републички завод за статистику, 2014. — 209 с. — ISBN 978-86-6161-126-1.
Златибор округы торак пунктлары
Сербия торак пунктлары
Әлифба буенча торак пунктлар | 6,275 |
https://stats.stackexchange.com/questions/477547 | StackExchange | Open Web | CC-By-SA | 2,020 | Stack Exchange | Dave, ExcitedSnail, Mentossinho, guy, https://stats.stackexchange.com/users/224576, https://stats.stackexchange.com/users/247274, https://stats.stackexchange.com/users/269142, https://stats.stackexchange.com/users/5339 | English | Spoken | 523 | 1,133 | What's the definition of $O_{p}(\cdot)$ in the vector case?
For a scalar random sequence $X_n$, we write $X_n=O_p(a_n)$ if for every $\epsilon$ there exists $M_{\epsilon}$ such that $\limsup_{n}\Pr(|X_n/a_n|>M_{\epsilon})<\epsilon$.
What's the extension of this definition to the vector case?
For example, when we write random vector $Z_n=O_{p}(a_n)$, do we mean that for every $\epsilon>0$ there exists $M_{\epsilon}$ such that
$\limsup_{n}\Pr(||Z_n/a_n||>M_{\epsilon})<\epsilon$, where $||\cdot||$ is the Euclidean norm?
I think there is a problem with your scalar definition of $O_p(\cdot)$. If $Z_n \equiv Z \sim N(0,1)$ then of course $Z_n = O_p(1)$ but it is not the case that there exists $M$ such that $\Pr(|Z_n| > M) \to 0$. Instead, you want that for every $\epsilon$ there exists an $M$ such that $\limsup_n \Pr(|Z_n| > M) \le \epsilon$.
I get the feeling that it might not matter which ($L_p$) norm you choose; there will still be such an $M$. It might be a different $M$ for a different norm, but the requirement is that $M$ exists, not that $M$ is a particular value.
@guy Thanks! I think what you said makes more sense, will change the question. Btw, what I wrote seems a direct translation of the $\epsilon-N$ language in the following link to limit: https://en.wikipedia.org/wiki/Big_O_in_probability_notation. So this link is wrong, or my translation is wrong? And why?
I don’t know that I’m right. I just started wondering what would happen if you used an $L_1$ norm, and I think we still get an $M$.
In Wooldridge, "Econometric analysis and panel data" is said, that the definition of $O_p(\cdot)$ in scalar case is applied element by element to vectors, what is equivalent to say, that Euclidean norm of vector is bounded in probability. Analogously, definition could be extended to random matrices.
@JTS365 To answer you question about the wikipedia link, your translation is not correct. The correct translation is that for every $\epsilon$ there exists an $M$ such that $\limsup_n \Pr(|Z_n| > M) \le \epsilon$, which is quite different from what you have.
@guy Thanks! I updated my question. So basically this $O_p(a_n)$ notation is saying $Z_n/a_n$ is stochastically bounded uniformly over all $n$ in the sense that there is an $M_{\epsilon}$ common to all $n$ that can make the tail probabilities small, right?
With vectors of fixed finite dimension, say $m$, you can do this in various equivalent ways. Write $X_{ni}$ for the components of $X_n$.
$X_n=O_p(1)$ when the components $X_{ni}$ of $X_n$ are $O_p(1)$ as scalar sequences.
$X_n=O_p(1)$ when the Euclidean norm $\|X_n\|_2=\sqrt{\sum_{i=1}^m X_{ni}^2}$ is $O_p(1)$ (note: this is the random quantity $\|X_n\|_2$, not the possibly non-existent $E[\|X_n\|_2])$
Like 2, but for any $p$-norm $\|X_n\|_p=\sqrt[p]{\sum_{i=1}^m |X_{ni}|^p}$, for $0<p\leq \infty$
These are all equivalent to each other, and they are equivalent to tightness of the sequence, which is a topological condition: for any $\epsilon$ there exists a compact set $K_\epsilon$ such that $P(X_n\in K_\epsilon)>1-\epsilon$ for all $n$.
These are all different if the dimension is not finite or is allowed to grow with $n$; in that context you would usually be explicit and say $\|X_n\|_2=O_p(1)$ or $X_{ni}=O_p(1)$ componentwise. In particular, definition 1 is a very weak condition for infinite-dimensional vectors.
Thanks! This is very helpful!
| 19,609 |
cB_D6FE9z-Q_1 | Youtube-Commons | Open Web | CC-By | null | danah boyd on Embracing a Culture of Connectivity | None | English | Spoken | 10,376 | 12,051 | I'm Judy Singer. I'm the Senior Vice Provost for Faculty Development and Diversity, and I would like to welcome you today to our panel discussion and demonstrations on the use of social media in academia. We're going to begin with a few words of thanks to the groups that are participating here, and it'll give you a sense of what we were trying to accomplish. This event is co-sponsored by a number of Harvard groups and represents an effort across the university to try to think about how the changes in technologies around us can influence how it is that we teach, how we do research, and how we communicate to each other as colleagues and to the outside world. So we are privileged to have sponsorship from the Berkman Center for Internet and Society, and I want to say thanks to Urs Gasser, who's the Executive Director and his staff for participating in this. The Harvard Office of Public Affairs and Communication, and I want to say thank you to Perry Hewitt, who you'll be hearing from shortly, and her staff for putting this together. My team in Faculty Development and Diversity, in particular Amy Brand and the rest of the staff in making this all happen, and our corporate partner, Dell Computers, who, oops, I didn't mean to make that go, corporate partner Dell Computer, who has provided the computers outside that we will be using for demonstrations at the end. The genesis of this event is from a set of conversations I've been having with faculty over the past few years about how the world is changing around us and we simply can't keep up. And I find myself thinking about the day in the 1995, 96 school year, and I thought I was very technologically savvy. I teach statistics at the Graduate School of Education. I use computers a lot in my classroom, and I was using this really sexy web browser called Lynx. Anybody remember Lynx? It was a text-based web browser. And sometime, I can't actually date it, but sometime in the winter, one of my teaching fellows came in and said, you're gonna be blown away. And she sits down on my computer and she types in to Alta Vista. I had never seen anything like Alta Vista. All of a sudden, the worldwide web from that Lynx, which was a text-based browser, to something that was more graphic, was there's going to be a change going on. And if I could just master that, I could keep up. I won't even tell you about the day I walked into my classroom and one of the students said, have you seen Kenyon's Facebook page? And I said, what? And he said, Kenyon's Facebook page, he's put together a spoof group about your class. And I said, I heard about Facebook, but somebody came to my office and showed me how to get on Facebook because this was in the days when you needed a Harvard.edu address. And this was going to be the way, the students in my class were communicating about what was going on in my class on Facebook. And I had no idea what was going on. The rate of change in technology and how it's going to influence how we teach is something that I think most of us are having a hard time even keeping up with. And what we're trying to do here today is to bring together resources from across the university so you can hear how colleagues are thinking about this problem space and both in terms of very concrete kinds of things we'll be having demonstrations outside, but also in terms of the thought processes about why are they doing this? Why are they changing what they've been doing quite happily for many years because the students around us are changing so much more rapidly than we can ever think about. Few words of housekeeping. This event is being webcast live out there. Hello. It is also being recorded. It'll be up on YouTube on the Berkman site so that people can in fact participate in both real time and then moving forward in virtual time. It is also being tweeted. I understand I just said that correctly. With the hashtag academicSN for social networks. You are welcome to eat. I'm glad to hear the sounds of plastic going on here. Please continue to eat during the sessions. And this is going to sound very Luddite like but there's no Wi-Fi in this room. So you are welcome to tweet with your smartphones but this is not a Wi-Fi space. So let me segue over to our host for this afternoon, John Palfrey sitting over here. John is a Henry NS Professor of Law and the Vice Dean for Library and Information Resources at Harvard Law Schools. He is also the Director of the Schools Library and Co-Chair of the IT Committee. He is one of the faculty co-directors of the Berkman Center, a co-sponsor for this event. And John's research focuses on internet law, intellectual property, the potential uses of new technologies to strengthen democracies around the world. And he is the co-author of many publications including two books, Born Digital, which I know I'm not. Understanding the first generation of digital natives and access denied, the practice and politics of global internet filtering. John, thank you. Professor Singer, thank you so much for this amazing event that you have pulled off. It's really a joy, I have to say, to be here about to kick off this afternoon. I cannot imagine actually having had this conversation with such an august group if we had thought eight or nine or 10 years ago about the issue of social media and how it might intersect with the academy. And it's so fun to see the oversubscribed capacity that your group has brought together. And I thank to Amy and Perry and others who have brought this event together and to bring the Berkman Center into the main fold here of the university. You may know the Berkman Center as one of the outliers on Harvard University's northern and maybe northwestern territory, a little yellow building out there. In the last few years, we've become a university-wide center, an inner faculty initiative. And it's from there that we have in many respects aspired to be part of this more mainstream conversation about how we use technology in service of our core pedagogical goals at Harvard University. And it's fun to have this chance to explore it. But I actually want before we start to complexify the conversation before we get into the specifics because I think it's actually much trickier than it looks at the outset. And maybe that's why all of you are here to try to figure out what are the handholds we can use as we think about this problem or this opportunity in the context of our work as teachers and scholars and as more broadly people communicating with the outside world. I wanna make three quick points and then I'm gonna introduce a great friend who we've got the pleasure of hearing from first off. The first point is I think it's incontrovertible that there is enormous growth in usage of new technologies including social media among kids. I think we don't need to go deeply into that question. We can sort of stipulate it as we as lawyers do. But there are a couple aspects of it that I think that are very important. One is that not all of our students come into Harvard College or any of our different schools the Extension School or the professional schools with an equal set of abilities in this way. I suspect that Dana will talk to some of these data that there is what we call not just a digital divide in terms of the ability to access the technology but skills wise. And it's very often a socioeconomic divide. I think this is something that in our society it's very important to start with as a framing device. Though we wrote a book called Born Digital the truth is not all kids, not even all kids at rich institutions are born digital in the same way. I think this is a very important starting point. And to note that there are issues that we have in terms of basic skills before we get to the very advanced things among our students as they come into the academy. And Dana will pick up from here in terms of many of the very specific kinds of usages that people are putting these technologies to. Second is a framing question which is how do we think about the use of new technologies in an institution that's very good at what it does in terms of teaching and learning? And in the Berkman Center we argue about this a lot and there are at least two ways to think about this problem. One school of thought says we know that lots of people are using these technologies. We know that it is dramatically changing in some ways that the most sophisticated kids, often the richest kids are relating to one another to information and to institutions. So we know that's happening and therefore we should get in the mix, get our hands dirty, experiment. Experiment with the knowledge that it's gonna be relevant one way or another. And in some ways that guided our initial efforts in this space. In 2002 we hired a research fellow, someone who was one of the early bloggers, a guy named Dave Weiner, who was sort of a pied piper of blogging. And the project we set up with him was to put up a web server, a blog server, that would let anyone on the Harvard campus, anyone with a Harvard.edu email address to set up a blog for free, which we would host. It turns out this blog server is still going. It took about a year before there were 500 people blogging on it. Any of you may sign up if you had any wifi. You might be able to do it from your mobile device in here at blogs.law.harvard.edu to join this community of scholars. And the thing that that experimentation did, we didn't know the outcomes. We didn't have a set of metrics we were leading to. But it transformed the way that we talked to one another within the Berkman research community and our students. And it was fascinating, the extent to which we would start going into meetings where people knew the conversation that had been happening all week between research fellows. Dana talking to Ethan Zuckerman, talking to Dorothy Zinberg over the blogs in a way that was asynchronous to the conversations we were having in person and increasing our students would come in and say, oh yeah, I read that on your blog before class and so forth. It changed in a way the nature of the discourse and actually it improved our internal communications dramatically. And it also helped other people to see what we were doing. And the number of different faculty we'll hear from today, Professor Mencu in particular has a very well-regarded blog and we can talk about how that fits into his scholarship and his teaching. But that's the first approach. It's basically put it out there, try it, throw spaghetti at the wall, as we say in technical terms, and see what comes of it. I think there's another approach which is to say define your pedagogical goals first and work from there. Figure out what are we trying to do? What is the core mission that we're trying to accomplish as teachers and as researchers and so forth and to build from there? I admit that I prefer the second approach. It is more natural to my own way of thinking and I think both have some benefit. I think one of the great things about the university is we can have centrally planned and common goals where we work from core principles and we can also have experiments in labs and so forth. And I think as a university that having a combination of these two approaches is actually a good idea from a portfolio perspective and I hope at the end of this two hours plus and when we hear from Perry as to what's going on and offered through the university and the demos and so forth, you have a sense of this portfolio which is both very planful in terms of thinking about what does innovative teaching look like and how do we use these technologies in service of that as well as straight experimentation like what we would do in a lab so that we are a little bit ahead of the curve and we know these technologies and are using them well. Okay, so third and by way of introduction of a great friend and colleague, I think one of the places that's useful to start particularly in the face of uncertainty is to look to the data. And in this particular field, if we had asked 10 years ago what are the data around social media and their usage and their roles in an academic setting, we would have nowhere to turn. There was very little in the way of data. Turns out that thanks to a small group of pioneers and the best of those pioneers sitting in this room and about to speak to you, we actually have a fair amount of data now about how young people in particular use these technologies both in a learning context and in a social context that is broader than the academy. So we're gonna start in the first hour or so hearing from Dr. Dana Boyd. Dana is in my view the best researcher working on kids and the relationship to technology. The person that I and many people turn to for the sort of core information about how this is happening. She is a slightly unconventional researcher in various ways, all good, I assure you. She has her PhD in information from the iSchool at Berkeley, which is a hotbed of leadership in this space. She is a senior researcher which equates to a tenured level appointment within Microsoft Research down the street in a wonderful facility, which if you haven't been to is called NERD, New England Research and Development at Microsoft. She's been a longtime Berkman Fellow. She's now a visiting researcher, working in a research group with me at the Harvard Law School. She also has the single longest list of pending speaking requests. She needs to be scheduled a year out in advance about the same as Professor Sandel sitting here as well. So we are enormously, enormously grateful to Dana for making time to share with us some basic data and then we'll go from there into some further presentation. So, Dr. Boyd. Good afternoon. Thank you so much for coming out. So, John was so kind to me. My name is Dana Boyd and I'm a researcher. And most of my work is actually ethnographic in nature. I spend most of my time running around the United States talking to young people about how they use social media. And I've been looking at social media practices actually really since 1999 with a focus on social network sites since 2003, which at this point is particularly long. My goal today is actually give you a higher order conceptual understanding of what it is that young people are doing with social media so you can understand the conceptual works, the cultural logic in other words. And we can kind of go from there to get into the more depths of what it means to be engaging with this stuff. The first is to locate social media. Many of you are familiar with the top names, things like Twitter and Facebook, things that are coming out, but I want to sort of give you a way of thinking about what it is that these services actually do. And the way I'm gonna do that is I'm gonna give you an idea of what social network sites are. Social network sites have some very interesting components of them. The first is actually a profile. And the key to understanding a profile is actually to realize that it's a way of writing yourself into being online. When you walked into this room, you had a body that was very convenient. It allowed you to sort of move and be recognized, to have presence, to exist. Online, by default, you're an IP address, which is not particularly interesting. So for most people, there's a way of trying to express yourself and having a place where you can do that. And if you look at the creation of profiles online, a lot of it is about expressing yourself and having that embodiment of identity. Of course, what young people do with that, in many ways, looks like the ways in which they might decorate a dorm room. It's a collection of images, a collection of materials, a way of showing off who they are to their friends, to anybody that might enter. And they're constantly thinking about how they wanna show off. This is also the way in which they repurpose a lot of technology that was intended for one reason for a different. For example, you will find that there's this whole process of liking things on Facebook. The intention was so that you would go and you would like McDonald's or a corporation and show your corporate interests, right? What young people have done is actually repurposed this to make an expressive format, right? A way of actually building networks and expressing themselves, again, through that moment of really doing presence work. The next key component of a social network site has to do with the friends structure. For the longest time, people would scratch their heads and be like, why are people friending everybody? What you have to understand about the friending structure is it's a way of actually writing the audience into being, right? The idea is that when people go into a public space, they have an understanding of who the audience is and they're trying to figure out how to negotiate that. What these friends lists are is the people's understanding of who the public is that they care about. And so when you see a college student only friending other college day students, they mean that to be a college space. They mean that to be a college audience, a college public. And they don't necessarily mean to include you, right? And that's where it becomes very tricky because in some ways it's a way of reading the understanding of the public and to realize that people aren't speaking to all people across all space and all time. Another key component of social network side and many other social media seems to be a lot of public conversation, right? And if you look at the content of most of this conversation, again, you might scratch your head and be like, why are people spending so much time going back and forth saying, I love you, I love you too. You're my friend, we're friends, aren't we? And what you'll find is that this is social grooming. This is really a way of acknowledging one another and doing it in a public place where we can really actually build those relationships and acknowledge those relationships. Now, we can kind of laugh at it and get going and be like, I don't do that. I dare you to listen to the conversations that will happen in the hallway when we're done and you will realize that it is basically a constant game of social grooming. It's just that young people are doing it online. Next key component that sort of is constantly lamented has to do with this idea of writing the details of what's going on in your life. This is usually complained about in terms of the what I ate for breakfast problem, right? And the funny thing about it is that my mother conveniently writes what she wrote for breakfast. And I found a really interesting moment of realizing that it allowed me to see the temporal patterns of my mother's life. And what you see with a lot of the data creation in these environments is about actually being present when you're not physically co-present. It's about a sense of peripheral awareness, right? And all of those come together to explain why it is, or what young people are doing with a lot of these social media. Of course, the next reasonable question to ask is why, right? If they can get together in person, especially in a college environment, why on earth would they do this? And quotes are here gonna come from high school students, but I think the same thing operates at a much older level as well, which is depending on what the social media of their particular friend group is, being a participant is absolutely essential to being a part of the social world, right? It's like knowing where your friends are and making sure you show up there, except that this showing up is a showing up online, not just a showing up in person. So what makes it interesting? One, the idea that everybody is on it, right? It's the place that you can go where everybody knows your name, right? It's really about that sense of community. The ability of keeping in touch with people for a much longer time. This, by the way, is one of the things that's radically changing the higher education landscape is that young people are actually in touch with their high school, middle school, elementary school friends in unprecedented levels. So the idea of college being a space where you break away from all of that is really radically changed, which I think is particularly notable in a place like Harvard. Finally, it's about actually having that moment where you actually get all of the updates. You're aware of what's going on. And what you see is that for young people, it has become a scrapbook of their social lives. It's a way of really tracking and having a sense of what's going on, what's going on with all of the people around them. So again, at a higher-order conceptual level, the way you can actually understand all of the social media is as the creation of a new kind of public space. We think about publics, and I'm using very much a public's notion here. We think about publics often in civic terms, in community terms, in places where people come together for action. But there's also a heavy importance for publics as a social space. And this is where people come to gather and understand broader societies. Of course, the challenge with networked publics is that networked publics aren't quite the same as the physical publics and the physical networks of people that we're so used to. And part of it is that the affordances of these technologies radically change some of the kinds of dynamics that play out. I'm gonna give you four affordances and three dynamics in order to sort of put this in position. One is persistence. What you say online sticks around for a very long time. This is great for asynchronous conversations. This is really embarrassing when the things that you wrote when you were 13 are still online. And we get this really interesting moment of what you have to do when you're dealing with the idea of time. And we're so used to an understanding of having ephemeral conversations for social purposes and really sort of published or formalized conversations in very specific and limited ways. And what you see is that this is really changing. We're now having really persistent conversations even during everyday ephemeral interactions. So this is all getting messing or messing everything up. Another key affordance has to do with replicability. You can copy and paste content from one place to another. And it's very hard to tell the difference between the original and the duplicate. This means that what you're seeing online may be a copy of something that happened somewhere else and you may not know all of the ways in which this moves. By the way, this is a way in which young people actually torment one another. It's a way in which they torment faculty. The idea of taking material from one place and replicating it somewhere else, totally blowing up its context. A third key affordance of network publics has to do with searchability. Now my mother would have loved the ability to stand in a room and scream grep or fine and figure out where I was when I was with my friends. She couldn't for which I am deeply, deeply grateful. But what you see right now is that a lot of young people become extremely searchable. And they're not just searchable by just anyone. They're searchable by people who hold power over them. In high school, this often means parents and teachers, college admissions officers. At a college level, it means their faculty and it means they're possible employers. This moment of becoming searchable, and again, what are you reading when it's taken out of context? Finally, there's the issue of scalability. Now, Technorati a few years ago decided that they would look at how frequently blogs were read. And they found that the average, and I do mean average blog, was read by six people. And what you will realize about that is that there are a few blogs that are read by lots of people and many blogs that are read by absolutely nobody. So just because it is online doesn't mean it's necessarily getting widespread distribution. One of the challenges of scale online is that which scales tends to be that which is most embarrassing, sexual or grotesque. So one of the big challenges is that as all sorts of people are saying, hey, don't put stuff up online, everybody can read it, most people are going, actually nobody reads it, I would love it if they read it. So you have this interesting tension around scale. So what are some of the dynamics that sort of fall out of this? The first is this moment of having to constantly figure out how to negotiate invisible audiences, right? I'm in this room, I have a sense of what the context of this meeting is. I'm very much giving a talk with you as the intended audience with my understanding of you. At the same time, there's a camera at the back of the room. I have no idea who's at the other end of that. I don't know if they're watching it now, I don't know if they're watching into the future, I don't know if they speak English, I don't know if they have any understanding what Facebook is. And what you see is that how you understand a space and how you interact with it has to do with your imagined audience. The imagined audience is usually based on an understanding and interaction in a space like this. But what happens online is you're constantly dealing with invisible audiences. Not just in terms of lurkers, but people you didn't even imagine to be a part of your community. And this becomes a really interesting challenge of how do you actually imagine speaking to an imagined audience? The next key issue has to do with the collapsing of contexts, right? We understand contexts to actually have certain spaces or certain properties. For example, there are norms that come with that, right? The norm of this space is that I'm speaking, you're supposed to be pretending like you're paying attention, right? And nodding along. There are ways in which we could change this, right? Any one of you could suddenly get up and dance on your chair, and I'd be totally entertained. But that would totally violate the context and the rules and the social norms of this environment. What happens online is that we have this interesting collision of contexts constantly coming together. Some of those contexts are with the same people who may go to the pub at night together and then be in the classroom the next day together. Those different environments have different norms, but they're coming colliding together online. And young people are trying to actually manage this, they're trying to manage how to deal with these contexts. Finally, there's an interesting blurring of what's happening about public and private. And this is where, you know, we're gonna dive deep into this for a moment because I think that this is a huge tension that is really coming into play around what's going on in terms of social privacy. We understand certain places to be public, certain places to be private. And yet we realize that that's always actually been an imagined construct to begin with. And what we see is that young people are trying to actually deal with this online. So let's talk a little bit about some privacy and publicity issues. Because it really sort of shapes how it is that you are to interact with young people, college students, with your fellow faculty when you see them online. This is a quote from a couple years ago which I think is actually really delightful because she sort of highlights the key issue here. My mom always uses the excuse about the internet being public when she defends herself. It's not like I do anything to be ashamed of, but a girl needs her privacy. What you will hear over and over again is that privacy is about an understanding of having social control over the situation and about having agency to assert that social control. And both end up getting challenged for young people online, right? You will see that young people will constantly come back being like, I don't have anything to hide, I didn't do anything wrong. And that's the constant frame of what they think that privacy is supposed to be about, but yet they want privacy. And they're constantly running back and forth about this. And what you see is that just because young people are participating in a public environment, just because they're participating in these networked publics, doesn't mean that they've actually thrown privacy out the window. So I really love talking to teens about this because you see, even at that young age, how they're starting to work through and see the differences. I'm gonna read you this quote because I think it's really delightful because she really highlights the tensions that happened around technology change. I think that it's just technology is redefining what's acceptable for people to put out about themselves. I've grown up with technology so I don't know how it was before the boom of social networking. But it just seems like instead of spending all of our time talking to other individual people and sharing things that would seem private, we spend all of our time putting it in one module of communication where people can go and access it if they want to. It's just more convenient. I think adults think about privacy because when they see pictures being put up or things, they never had that ability. So when they see our photo albums or when they see conversations on Facebook wall to wall, they think that it's this huge brief of range of privacy and your personal ideas or whatever. So I just think it's different because I think it depends on how you grew up and what you're used to. Like I said earlier, there are things you shouldn't put up and things you shouldn't say. But I think privacy is more just you choosing what you wanna keep to yourself. I don't think Facebook is violating privacy. I think it's letting people choose how they wanna define privacy. What she's highlighting here is actually a radical transformation in about how we negotiate privacy. When we have an interaction, a face-to-face interaction, our interaction is private by default, public through effort. We have a conversation and you have to choose what you want to publicize. Media changes that. Media makes the act of publicizing things much, much easier. And what is happening with young people as they engage with network publics is they start to actually deal with an environment where interactions are public by default, private through effort. They assume things to be public and they make a conscious choice of when to make things private. And it's hard. It's really, really hard. And they're constantly struggling with this. They're constantly struggling with how to deal with it. But it's not because they're rejecting privacy is because they're trying to actually create intimacy. And they're trying to create spaces for intimacy at different layers. And that doesn't mean that they necessarily want you looking in at any moment. And what you see is that young people actually seem to share a lot of things but they don't actually share those things. So for example, they give the idea of where they are without giving the details. And you have this moment where they're starting to sit there and they're sharing but they're not sharing everything. I liken this actually to a great conversation between a journalist and Angelina Jolie a few years back where this was before Jolie had children and she was asked why are you putting up all of this stuff in the public about you? You give everything away. You make it so easy for us journalists and she smiles and she goes, the more that I appear to be public, the less you look at the things that I care about the most. And what I see from young people is a similar and interesting move, the moment of how they put things up in order to keep privacy. Of course, they care deeply about who's doing the looking and one of the big challenges in this is that they're constantly dealing with this power boundary. Their primary one is about that direct moment, right? So parents are constantly in their attention and they're dealing with the context issues all the time. So, for example, a few years back I received an interesting phone call from a college admissions officer and Ivy League admissions officer. They'd received an application from a young black man living in South Central in Los Angeles and he'd written a college essay about wanting to leave the gang-ridden community that he was coming from behind and they called me up to ask me a funny question. They said, why would he lie to us when we can tell the truth online? They had gone to his MySpace at the time and had found that it was filled with gang insignia. Now, I've spent a lot of time actually in South Central and I know what that environment looks like and there's a whole moment where those performing for certain audiences having to look legit to your peers doesn't mean that's who you are across all space and all time and to all audiences. And so here's this interesting moment that he was having to deal with a very specific idea of public, a very specific idea of negotiating that and he was engaged in a very private act between him and the college hoping to get out of this environment and here the college wasn't coming and judging him in a particular way. So some of the people that young people don't want to keep in mind, right? You always hear about mom. Mom is always the issue and so for those of you that are parents in the room, I'm sure you've heard this in different forms. Another thing has to do with teachers, right? Which is what you hear with teachers is interesting because teachers are both good and bad depending on judgment. Same with parents for that matter. And so what you see is that young people actually start to develop really innovative strategies to try to work around this, to try to achieve privacy. You know, it's interesting. Since I started studying my space, originally looking at all of this, young people were much more open and much more willing to put things up. Facebook has actually been interesting because as it's been more locked down and as parents have become more part of the process and as young people started to be aware of college admissions officers being there, they've started trying to innovate different strategies for achieving privacy. My favorite of which is the overuse of pronouns, right? So I can't believe what she said, right? Everybody knows what that she was about, right? And they know what happened and they know the full context. So you can put this referent up there knowing that other audiences won't see it. Another thing would just be screaming yes, knowing that the right people will ask. Now not all young people are doing this but they're starting to really experiment with this and it's part of why they're experimenting with this is because over and over again, adults are judging them out of context, taking the material that they put up on these environments and assuming that they can understand and interpret what's going on. And young people are trying to push back, showing that they actually care about privacy and they really are screaming keep out but the social norms aren't working as a way of actually regulating the space. So how do we think about this in terms of learning in higher ed, right? There's some obvious implications in terms of what it is in terms of invading privacy especially for the college admissions community about what it means that you may or may not be able to interpret that red cup and what's actually going on in that image. But there's also some interesting implications for the classroom. So one of the things about Paul Fri's work which is beautiful is that born digital and the notion of digital natives is not that all young people are digital natives. And what you will find is that there's a huge variation in skill, in experience, in understanding of these kinds of environments and what they're trying to do with it. Even those sort of extreme strategies of privacy achievement are actually exceptions at this point. I actually think that they're becoming more commonplace but they are exceptions. And one of the challenges is that we see all of these technologies proliferate is how do we actually deal with people who are using them in a wide variety of different ways. And so when we think about and putting technology into the classroom we can't assume that just because they're young they understand these technologies. Because oftentimes they don't and what they understand of them is very different than what adults are understanding of them. My favorite has to do with all the flows of information. Young people, many of them have grown up with a search engine. That doesn't mean that they know how to write a query. That doesn't mean they know how to actually get information or understand the credibility of specific information. So just because they're used to a search engine and have it at their fingertips doesn't mean they actually know how to think through this. And that's where things like media literacy become extremely important. Likewise, they're starting to create their own content but they don't always understand the implications of it. They don't understand what it means. They have no idea what the concept of copyright means, right? That doesn't exist in their minds that all they know is that they're playing with cultural material and trying to make sense of it and being creative and they don't understand why this is a problem. Likewise, at the same time that they're starting to use things, they're having a lot of backlash from a lot of adults in terms of their usage. My favorite of which has to do with actually information around the Wikipedia. Well, I don't know the current stance of Harvard on this one but I'm amazed at how many high schools and colleges around the country have basically come out with Wikipedia as bad as their answer to Wikipedia. So the idea rather than looking at it as a nuanced space, it's just bad. So young people basically go and look at it, feel guilty because they know they're not supposed to be there, try desperately to figure out the citations at the bottom in order to cite those for their paper and move on. But this is an amazing opportunity where media literacy could actually be in action. So my mother, when she came to the United States, one of the first classes she took in the seventh grade was actually an American history class. And very early on they got to the American Revolution. My grandfather picked up the textbook, was horrified and burnt it. That was his response to it because as a Brit, this was actually wrong, right? Everything that was said about the American Revolution and her textbook was wrong and therefore she should not be taught it, it was unacceptable. What's interesting to me about this entry on Wikipedia is that the Americans, the Brits actually had to resolve their differences. And it's amazing to go through the detailed history of the revisions to create this entry, right? Because this entry basically has a conversation about whether the Americans were terrorists, which is a really interesting language at the current time, or versus Patriots, and these different ways in which these things get resolved. But the thing is that when people look at Wikipedia, they look at the end result, they don't look at how it was created. And one of the most amazing about some of these social media is actually the process of creation. Now, many of you have written books as part of your career and you realize how much thinking goes into the creation and how draining it is, and then you hope that this is this perfect end result that people will love as you kind of run away and be like, I don't wanna hear about any corrections or any problems with it, right? Well, Wikipedia has sort of challenged that and says these are living things, these are constantly evolving, you can see how the process works. And that's one of the beauties of it and it's moment of media literacy. It's one of the exemplars of where we can actually teach media literacy, rather than just saying this source is good, this source is bad. Likewise, we see blogs and Wikis sort of entering the classroom, which was a really interesting thing on my understanding is there's gonna be a great panel talking about this so I won't go into detail. But one of the challenges with this is that just because young people are using these environments to talk to their friends, doesn't mean that they know how to craft it in this format, right? They don't necessarily know how to speak in this way. The other thing is that what does it mean is that you are forcing young people to publicize their thinking in action. And the reason I say this is I'm always amazed at how many academics refuse to put out material themselves when it's thinking in action and then expect their students to do so, right? So it's like putting out your draft paper, publishing that online, most academics are unwilling to do that and yet they think that it's totally appropriate for students to have this on their permanent record for the digital era, right? So I think that one of the challenges in this space is while we explore the opportunities for doing this and there are amazing opportunities for getting feedback, we have to think about how we create this as an environment that's about living thinking and not just publishing. One of the other things to keep in mind, especially if you start thinking about using social network sites in these environments, is that social network sites have brought social dynamics, right? People don't always get along. And so I think it's really challenging as faculty, we often want young people to work together in group projects thinking that everybody should get along and that's not necessarily the way this works. And I'm sure all of you as faculty have had that experience. So what happens with online environments, especially if you think about things like Facebook being a social space, is that asking people to actually also turn it into an academic space says they have to actually friend people that they may not get along with, that they may not want to be a part of their public. So you really want to sort of deal with these different tensions and not just assume that because they're engaged there that it's always inherently a positive thing. Teachers involvement is also sort of really interesting. And I think this is one of the things I'm certainly seeing at the high school and it's a really interesting implication for the college, which is when we talk about how young people, their lives go on beyond school and they have to deal with ramifications beyond school, that's also true for teachers. So a lot of teachers have found that their presence on social media requires that they respond to students 24 seven, right? Which has been an interesting dynamic. And this can be both good and bad. Mr. C in this case is sort of an interesting moment because he laments that in his school he's so stuck to the standards in high school that he can't actually teach people why they're learning. And then he uses social media actually to help people understand why it is that they're learning to do the more community building thinking stuff. So another big question for all of you is is that where is your relationship with your students end and where does it sort of begin and when does it get blurred, right? So we have this moment of like, you certainly have office hours of different forums, but what happens, the ways in which social media challenges that makes it part of the blurred environment? Again, just sort of questions to think about. So you have the ability, as we sort of think about this more generally, you have the ability to look in on the lives of young people, but one of the challenges for everybody in a position of power is to think about when and where you're judging those young people. You have the amazing ability to help them and learn from them, but you also have the ability to judge them in ways that are deeply problematic. So as we see these participations online, we have to think about them in terms of that tension. And this, by the way, has a lot of implications for recruiting because what you see online may not actually be the whole person. It's only one face of their story. It's only one understanding of who they are to one particular kinds of audience. So you really have to think about what respect looks like in an era of social media. And I think that's one of the big challenges of dealing with these environments. To also realize that social networks are messy. Different kinds of networks are coming together and they're blurring in all sorts of ways. So treating them as one and assuming that the Facebook or their Twitter is their entire universe is not going to be an inaccurate portrayal. Of course, that doesn't mean to sort of run away. This is not to be afraid of these environments, but to be curious. This is a new kind of public space. What it looks like, how it plays out is radically changing. It's constantly evolving and there's amazing opportunities to explore and experiment. But one of the best ways you can do it is actually doing it with your students. Don't tell them how this is to be run, but imagine this is a game of tango. You are very much trying to dance with them. You're trying to actually get away of really sort of helping them learn, helping them engage. And you are in one of the best universities in the country to be able to do that. Because many of your students do want to learn. They do want to participate. They do want to experiment. They do want to understand what these new media are all about. And working with them to help sort of evolve the use of these technologies in higher ed becomes really important. But keep in mind that this is a new kind of public. Everything that's gonna happen here is going to sort of evolve and be radically different in short order. Everything I told you is probably gonna be outdated six to nine months from now. Things are really, really changing. And that's one of the most delightful moments because it's a phenomenon. And we're really seeing a moment where public life gets reworked in all sorts of interesting ways that have implications for all of us. Thank you very much. Questions with Dana and the panel members can ask questions as well. Sure. But I thought we would have some pushback on Dana. Please. Questions? She'll take it, trust me. Questions from the audience? Dana, let me start with one just to do the warm up bit. One thing you said at the end was that this was a great time to experiment and to do things with the technology but also that it'll change in six to nine months. I've written a book called Born Digital that was obsolete the minute it was printed. I know from this problem. One way that one might react to that though is to say let's get under the umbrella and wait for the sunshine to come out. This is New England after all and the weather changes quickly and not actually engaged at any moment because it's so unstable. I think one could draw exactly that inference rather than the one that I think you drew which was getting the mix and start tangoing in the rain. So I wonder if you could help us unpack that possible tension. Right, I mean one of the challenges is that if you think about your undergrads they're here for four years. They're here for a short period of time and they're trying to understand how the world is working. And one of the things is they're trying to understand how things have sped up. And so these moments where we get more conservative and be like oh we don't have to worry about the speeding up of things means that they're further and further removed from this. I'm facing this because a lot of your students are coming to me asking desperately to have faculty guidance of some way and I'm like I'm not sure that I count as faculty here but thank you. So I think that as you start to thinking about the fact that you're trying to actually help a generation, part of that helping that generation is helping them actually explore things that are moving fast. Right, and this is a weird tension as academics because a lot of our work as academics is to sit back and think slowly, think long term. But at the same time our role as teachers is to actually very much help people engage with what's happening as a rapidly changing environment. Not just simply so that they can get jobs but so that they can understand the world out there. So I think that the more conservative we are and the more we sort of refuse to acknowledge the outside world, the more irrelevant we make ourselves in this environment when young people so desperately are coming to our universities to understand what's going on in our larger society. And our society is changing fast and I don't think it's gonna slow down anytime soon. No computer, can you comment on that? Sure. Digital light is a very tricky concept because there's a couple of different ways to looking at it. One is in terms of pure access to internet and in some ways that gap has been closed at some levels. So Pew Internet and American Life Project has found that they're at this point they're at I think 94% of American teens ages 12 to 17 have some form of internet access. Of course some form is what we'll sort of get to in a second. It's important to note that the remaining 6%, the vast majority of them come from families where internet access is not desired. This by the way is primarily religious and homeschooling. So that's a separate kind of divide that we have to deal with. In terms of some form of access we get some really interesting inflections. The lower socioeconomic population is the more likely that their internet access is through a school or a library in a very constrained time and heavily basically filtered. So their filter access becomes really problematic. What's been interesting to watch in is an interesting division between urban and rural in terms of socioeconomic, like low socioeconomic urban and rural in terms of their practices. The urban are all learning how to use proxies basically to figure out how to politically work around all of the filters and restrictions. This is not true in rural environments. When it comes to mobile telephony it's been also you see an amazing urban and rural divide. Rural mobile telephony is atrocious of all ages because of limited towers and certainly limited 3G. Urban environments you see a lot of low socioeconomic populations have jumped first to mobile. And one of the things that was most interesting to me is there used to be a device called the Sidekick which was actually this predated all of them sort of iPhones and sort of new smartphones. And it meant that urban, primarily black and Latino, young people were getting onto smartphones before smartphones were at all popular. They were primarily using it for instant messaging and for web access. Each of these kinds of devices, each of these kinds of experiences really shapes your understanding of what these spaces are. Shapes your understanding of social media, shapes your understanding of information access. And part of the challenge in all of this is that it's not so cleanly like a curve like this where it's just about low experience. It's basically inflected in all sorts of different ways with different understandings of what these practices are, different understandings about the purpose of technology, different understandings of what it can actually achieve or not. So one of the examples of how this plays out is that Facebook on the mobile, actually you couldn't adjust your privacy settings on Facebook on the mobile. So an amazing number of people who were mobile only access actually had no idea that there were privacy settings to begin with which put them in an amazing state of vulnerability and that was primarily low income populations. That has changed but it's still complete mess. So we're seeing these huge variabilities in terms of understandings of the technologies, in terms of skill, all of which you will usually hear talked about either as digital divide or as participation gap, which is more the language of Henry Jenkins. But I think it's important to realize that it's not that there's just sort of a curve like this but it's just a complete mess right now in terms of experience. It's a great question. There's so much data in this area and so many implications. It's worth really exploring. I think it end up Virginia Weiss from the law school. I sort of think of the classroom as a place that should be protected. So when you talk about using social media like Twitter and like Facebook and Myspace, I want to ask you why is that better than having a course webpage where students can interact about the content of the course rather than doing what you just suggested a moment ago at the end of your speech, forcing my students to friend people they don't necessarily want to friend so that they can interact collaboratively. It seems to me that there are already some better collaboration spaces that exist. So I'll let the panel do a lot of that conversation because I know that that's there. But I think part of it is to really go back to what the pedagogical goals of your particular classroom are. And they're gonna vary widely across the college, right? Different folks are gonna have different reasons and different goals. And the university, of course. Sorry, Virginia is talking about the law school. So they're gonna vary widely. So part of it is really saying what is the goal and how do you get there? One of the challenges that I'm facing, you know, when I see hiring decisions at corporations is that corporations are looking at people and saying if you don't have a presence on social media, we're not hiring you because you shouldn't be invisible if you're coming out of college at this point, right? And that's a very interesting move. So how do you actually simultaneously learn to be a part of the public and the public sphere and find ways to have those safe spaces? So depending on your classroom, your classroom may be a place for creating that, but how do you also help young people actually figure out how to have a voice in a broader community? And I think that's where we see a lot of interesting tensions. I love Microsoft, Dana, but there might be a more cynical way to look at that particular hiring thing, which is if someone says something bad about you and you have no other presence, that might well be the first 10 Google search hit results. And if you have a robust presence, it actually might be number 11, right? So this would be corporate branding behind it. Reputation becomes a really interesting challenge for a lot of people online, honestly. And it's become this really interesting tension how to do that. And you know, mind you, Harvard puts out lots of information that becomes Google-able about your students. You do it in the form of their sports scores. You do it in the form of any awards they've given. You have amazing amounts of information that you already pump out about your students without them actually having control over it. That's precisely my point in a way, which is that I want, within my classroom, I want them to feel a protected environment where they aren't exposed to the entire world, everything they say. And I think that's your right. I think that you have the ability to do that, but part of it is dealing with both the good and the bad of these, right? To deal with where they become really advantageous to actually have these voices and where it becomes something that you wanna create as more of a private space. Your classroom may very well need to be very private. It may be a more appropriate environment. Figuring out the tools for that might be extremely important. But to realize there's gonna be huge variability across different classes. I think this is a very important point on the different perspectives that different teachers, even perhaps within the same school, otherwise are gonna have on this topic. We often in the law school talk about whether to ban laptops, right? This is one proxy for that same conversation. And advanced legal research may be a place where you don't ban the laptops, but you do keep out social media and so forth, right? And that these may be a number of different things on different interlocking kind of spectrums that we looked at. Maybe one more question for Dana and then we'll switch over, sir. And just realize it's not one size fits all ever. So nothing about this today should be one size fits all for all of you. Thank you for your presentation. I'd like to push this point here. We hear a lot about, from your presentation, a lot about grooming. And I think it's the right term. The conversation on the internet moving from web, from emails to Facebook to Twitter becomes thinner and thinner. And I must say that I observed in the classroom the extent to which, and I don't know if it's something that is shared by colleagues here, the extent to which students starts to have a difficulty of having focused and sophisticated conversation in the classroom. They're losing an ability of taking the time to listen and to project themselves into a higher conceptual level. And I must say I'm an enthusiastic supporter of social media, and especially using it at a global level because it does open new doors. But I must say I'm quite in distress over the, let's say two, three years to see the extent to which it has an impact in the culture of students in the classroom and diminished their ability to engage in sophisticated conversation that may last more than 20 minutes. So, you know, it's really interesting. | 22,910 |
https://ru.wikipedia.org/wiki/%D0%A5%D0%BE%D0%B2%D0%B0%D1%80%D0%B4%2C%20%D0%AD%D0%BD%D0%BD%20%D0%9C%D0%B0%D1%80%D0%B8 | Wikipedia | Open Web | CC-By-SA | 2,023 | Ховард, Энн Мари | https://ru.wikipedia.org/w/index.php?title=Ховард, Энн Мари&action=history | Russian | Spoken | 164 | 514 | Энн Мари́ Хо́вард (; 31 марта 1960, Сан-Диего, Калифорния, США) — американская и .
Биография и карьера
Бывший пресс-секретарь Ditech.com и нынешний пресс-секретарь Национальной ассоциации риелторов.
Старшая из пяти детей, она родилась в Сан-Диего, Калифорния, в военно-морской больнице Бальбоа, где её отец Томас Ховард был дантистом в ВМС США. В возрасте двух лет они переехали в Оттумву, штат Айова, а когда ей было четырнадцать лет, семья переехала в Давенпорт, штат Айова.
Она появилась в более чем 100 рекламных роликах, включая Life Savers, The George Foreman Grill, Quaker Oats, Nexium и AARP. Среди телевизионных работ Энн гостевые роли в телесериалах «Отчаянные домохозяйки», «Части тела», «Детектив Монк», «Близко к дому», «Лас-Вегас», «Главный госпиталь: Ночная смена», «Детектив Раш», «Скорая помощь», «Справедливая Эми», «Бостонская школа», «Другой мир», «Дни нашей жизни», «Нетакая», «Добиться или сломаться» и «Частная практика».
Среди её работ в кино роли в фильмах «Синоптик» с Николасом Кейджем, «Князь тьмы», «Они поменялись местами» и «Не шутите с Зоханом» с Адамом Сэндлером.
Избранная фильмография
Примечания
Ссылки
Киноактрисы США | 5,106 |
https://ko.wikipedia.org/wiki/%ED%81%B4%EB%9D%BC%EC%9D%B4%EB%93%9C%20FC | Wikipedia | Open Web | CC-By-SA | 2,023 | 클라이드 FC | https://ko.wikipedia.org/w/index.php?title=클라이드 FC&action=history | Korean | Spoken | 76 | 324 | 클라이드 FC(Clyde Football Club, Clyde F.C.)는 1877년에 창단된 스코틀랜드 컴버놀드의 축구 클럽으로, 현재 스코티시 리그 1에서 활동하고 있다.
성적
스코틀랜드 컵 우승 3회 (1939, 1955, 1958), 준우승 3회 (1910, 1912, 1949)
스코틀랜드 챌린지 컵 준우승 1회 (2007)
스코틀랜드 풋볼 리그 1부 우승 5회 (1905, 1952, 1957, 1962, 1973), 준우승 5회 (1904, 1906, 1926, 1964, 2004)
스코틀랜드 풋볼 리그 2부 우승 4회 (1978, 1982, 1993, 2000)
외부 링크
공식 홈페이지
스코틀랜드의 축구단
1877년 설립된 축구단
스포츠팀 이전 | 26,097 |
https://pl.wikipedia.org/wiki/Marian%20Nietupski | Wikipedia | Open Web | CC-By-SA | 2,023 | Marian Nietupski | https://pl.wikipedia.org/w/index.php?title=Marian Nietupski&action=history | Polish | Spoken | 171 | 491 | Marian Nietupski (ur. 26 maja 1931 w Ostrynce) – polski wioślarz, olimpijczyk z Melbourne (1956), Mistrz Sportu, Zasłużony Pracownik Rolnictwa, a także działacz Klubu Olimpijczyka. Syn Klemensa i Felicji (z d. Kropiwnicka).
Ukończył Wyższą Szkołę Rolniczą we Wrocławiu, gdzie zdobył zawód lekarza weterynarii, a następnie również na tej samej uczelni, doktoryzował się.
W latach 1952-1957 należał do klubu sportowego AZS Wrocław. Jego trenerem był Zbigniew Schwarzer.
Osiągnięcia sportowe
1956 – 4. miejsce podczas Mistrzostw Europy w Bledzie (czwórki bez sternika, w osadzie razem ze Szczepanem Grajczykiem, Kazimierzem Błasińskim, Zbigniewem Paradowskim);
1956 – uczestnik Igrzysk Olimpijskich w Melbourne, w osadzie razem ze Szczepanem Grajczykiem, Kazimierzem Błasińskim, Zbigniewem Paradowskim – czwórki bez sternika odpadły z konkurencji – po 2. miejscu w przedbiegach (6:46.3), a następnie 4. miejscu w półfinałach (8:32.0).
Wchodził w skład reprezentacyjnej osady czwórek bez sternika.
Bibliografia
Bogdan Tuszyński, Henryk Kurzyński; Leksykon Olimpijczyków Polskich 1924-2006, Fundacja Dobrej Książki, Warszawa 2007,
Linki zewnętrzne
Polscy wioślarze
Polscy wioślarze na igrzyskach olimpijskich
Polscy olimpijczycy (Melbourne 1956)
Urodzeni w 1931
Odznaczeni odznaką „Zasłużony Pracownik Rolnictwa” | 30,050 |
https://stackoverflow.com/questions/65957973 | StackExchange | Open Web | CC-By-SA | 2,021 | Stack Exchange | Joerg, https://stackoverflow.com/users/15107226, https://stackoverflow.com/users/299242, mscha | Slovak | Spoken | 116 | 328 | Perl WWW::Mechanize: How can I specify the destination IP address independently of the URL?
I want to use Perl www::mechanize to connect to the webserver and request a resource. E.g. http://www.my.domain/test.html. But I want to specify the IP address independently from the hostname in the URL.
For example: www.my.domain resolves to 1.1.1.1, but I want to connect to 2.2.2.2.
I want to do this to test multiple web servers behind a load balancer.
use LWP::UserAgent::DNS::Hosts;
It works fine with WWW::Mechanize.
use LWP::UserAgent::DNS::Hosts;
use WWW::Mechanize;
LWP::UserAgent::DNS::Hosts->register_host('www.my.domain' => '2.2.2.2');
LWP::UserAgent::DNS::Hosts->enable_override;
my $mech = WWW::Mechanize->new;
$mech->get('http://www.my.domain/test.html'); # connects to 2.2.2.2
I had to add LWP::UserAgent::DNS::Hosts->enable_override; to make it work.
You're right, I missed that. Added it to the answer.
| 11,549 |
https://en.wikipedia.org/wiki/Fresnel%20%28disambiguation%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | Fresnel (disambiguation) | https://en.wikipedia.org/w/index.php?title=Fresnel (disambiguation)&action=history | English | Spoken | 63 | 126 | Augustin-Jean Fresnel (1788–1827) was a physicist.
Fresnel may also refer to:
Fresnel (frequency), a formerly used unit equal to one terahertz
Rimae Fresnel, an escarpment on the moon
Fresnel lens, a type of composite compact lens
, more than one submarine of the French Navy
People with the surname
Fulgence Fresnel (1795–1855), French Orientalist and brother of Augustin-Jean Fresnel
See also
French-language surnames | 28,763 |
https://en.wikipedia.org/wiki/Nine%20Lives%20of%20Nestor%20Makhno | Wikipedia | Open Web | CC-By-SA | 2,023 | Nine Lives of Nestor Makhno | https://en.wikipedia.org/w/index.php?title=Nine Lives of Nestor Makhno&action=history | English | Spoken | 544 | 810 | The Nine Lives of Nestor Makhno (, ) is a 12-part mini-series which aired on Channel One Russia. The series is a historical biographical drama about the life of Nestor Makhno, a Ukrainian anarchist who was the commander of the Revolutionary Insurgent Army of Ukraine (Makhnovshchina). A 6-disc DVD set of the series is available.
Plot
The series tells the story about the life of Nestor Makhno and his Revolutionary Insurgent Army. During the 1905 Russian revolution, he joined the Union of Poor Peasants and carried out a campaign of expropriative anarchism. He was arrested and sent to Butyrka prison, where he received an education from Peter Arshinov before being granted amnesty during the February Revolution and released. His first steps were to organize communes in the Huliaipole region, later forming rebel detachments, which eventually grew into the Revolutionary Insurgent Army of Ukraine and played an influential role in the Russian Civil War. After it was defeated, Makhno fled into exile in France, where he would eventually die.
Cast
Reception
Critical response
The Nine Lives of Nestor Makhno received mixed reviews, with praise typically being reserved for the performance of Pavel Derevyanko as the titular Makhno, while criticism was generally focused on the series' lack of narrative structure and its poor direction.
Anastasia Krainer for Nash Film reviewed the series positively, exalting it for its historical accuracy. She particularly lauded Derevyanko's "soulful" performance, in which he "conveys Nestor's inner feelings, his passion, his pain, his eternal protest through gestures, intonations and glances. Sometimes it seems that he feels deeper, sharper than the role requires." However, she also criticized the series' direction, notably in a scene that featured Makhno and Pavel Dybenko drinking together, finding the performances on display "unbelievable". She concluded by stating that "this is not a masterpiece, but also not an empty glossy picture that has nothing to do with history."
On the other hand, the Russian Marxist Boris Kagarlitsky gave the series a negative review, criticizing the show's lack of narrative coherence as "events simply drag on one after the other in chronological order, without any internal connection, without any logic." He claimed that the show's writers had little understanding of the Russian Revolution, its causes and consequences, stating that "the [show] will tell you who won, but you will not be able to understand why. And most importantly, you will not be left with a sense of tragedy." He also criticized the casting of Leon Trotsky as the main antagonist, comparing his portrayal to "evil wizards" from children's stories.
Sergey Varshavchik for the Russian Journal was also critical of the series, pointing out its historical inaccuracy in respect to a fabricated sequence where Fedir Shchus murders Nestor's first wife Nastia, going further to attack it for its incoherent narrative and illogical set design, while also poking fun at the direction of the battle scenes.
Accolades
References
Further reading
External links
The Nine Lives of Nestor Makhno on archive.org
2007 Russian television series debuts
2007 Russian television series endings
2000s Russian television series
Biographical films about military leaders
Biographical films about military personnel
Channel One Russia original programming
Cultural depictions of Nestor Makhno
Films about anarchism
Russian Civil War films
Russian drama television series
Russian television miniseries
Russian biographical television series | 46,891 |
https://stackoverflow.com/questions/74640493 | StackExchange | Open Web | CC-By-SA | 2,022 | Stack Exchange | English | Spoken | 669 | 1,522 | How do I call a function in a different Move module / smart contract?
I know there is a Move module (smart contract) on chain with a function that looks like this:
public entry fun do_nothing() {}
I know it is deployed at 6286dfd5e2778ec069d5906cd774efdba93ab2bec71550fa69363482fbd814e7::other::do_nothing. You can see the module in the explorer here.
I have a Move module of my own that looks like this.
Move.toml:
[package]
name = 'mine'
version = '1.0.0'
[dependencies.AptosFramework]
git = 'https://github.com/aptos-labs/aptos-core.git'
rev = 'main'
subdir = 'aptos-move/framework/aptos-framework'
[addresses]
my_addr = "81e2e2499407693c81fe65c86405ca70df529438339d9da7a6fc2520142b591e"
other_addr = "6286dfd5e2778ec069d5906cd774efdba93ab2bec71550fa69363482fbd814e7"
sources/mine.move:
module my_addr::mine {
use other_addr::other::do_nothing;
public entry fun do_stuff() {
do_nothing();
}
}
As you can see, I'm telling the compiler where the other module is by setting other_addr = "6286dfd5e2778ec069d5906cd774efdba93ab2bec71550fa69363482fbd814e7". However, when I try to compile my Move module, it fails, saying "unbound module", meaning it doesn't know what the "other" module is.
$ aptos move compile --named-addresses my_addr="`yq .profiles.default.account < .aptos/config.yaml`"
Compiling, may take a little while to download git dependencies...
INCLUDING DEPENDENCY AptosFramework
INCLUDING DEPENDENCY AptosStdlib
INCLUDING DEPENDENCY MoveStdlib
BUILDING mine
error[E03002]: unbound module
┌─ /Users/dport/github/move-examples/call_other_module/mine/sources/mine.move:2:9
│
2 │ use other_addr::other::do_nothing;
│ ^^^^^^^^^^^^^^^^^ Invalid 'use'. Unbound module: '(other_addr=0x6286DFD5E2778EC069D5906CD774EFDBA93AB2BEC71550FA69363482FBD814E7)::other'
error[E03005]: unbound unscoped name
┌─ /Users/dport/github/move-examples/call_other_module/mine/sources/mine.move:5:9
│
5 │ do_nothing();
│ ^^^^^^^^^^ Unbound function 'do_nothing' in current scope
{
"Error": "Move compilation failed: Compilation error"
}
Why is compilation failing? Why can't the compiler figure it out for me based on the ABIs of the Move modules it finds at other_addr on chain?
The problem
In order to publish a Move module that calls a function in another Move module, you need its source code. This is true of all Move modules, not just your own. You'll notice in Move.toml there is already a dependency on AptosFramework. This is what allows you to call all the framework functions, e.g. those related to coins, tokens, signer, timestamps, etc.
So to make this work, you need to have access to the source.
Source: Git Dependency
If you have access to the source in another git repository, you can tell the compiler where to find the other module by adding this to your Move.toml:
[dependencies.other]
git = 'https://github.com/banool/move-examples.git'
rev = 'main'
subdir = 'call_other_module/other'
This is telling the compiler, "the source code for other can be found in the call_other_module/other/ directory at that git repo".
Source: Local
If you have the source code locally, you can do this instead:
[dependencies.other]
local = "../other"
Where the argument for local is the path to the source code.
Source: I don't have it?
If you don't have the source, you can try to download it. By default, when someone publishes a Move module, they include the source code alongside it.
First try to download the code:
cd /tmp
aptos move download --account 6286dfd5e2778ec069d5906cd774efdba93ab2bec71550fa69363482fbd814e7 --package other
If the source code was indeed deployed on chain, you should see this:
Saved package with 1 module(s) to `/tmp/other`
{
"Result": "Download succeeded"
}
Inside /tmp/other you'll find the full source, including Move.toml and sources/.
From here, you can just follow the steps for Source: Local above.
Note: The value for --package should match the name field in Move.toml of the deployed code. More to come on how to determine this based on on-chain data.
Source: The download failed?
If you ran aptos move download and saw this:
module without code: other
Saved package with 1 module(s) to `/private/tmp/other_code/other`
{
"Result": "Download succeeded"
}
You'll find that sources/other.move is empty.
This means the author published the code with this CLI argument set:
--included-artifacts none
Meaning they purposely chose not to include the source on chain.
Unfortunately at this point you're out of luck right now. It is a hard requirement of compilation that if you want to call a function in another Move module, you must have the source for that module. There is work in the pipeline that should enable decompilation of Move bytecode, but that's not ready yet.
I hope this helps, happy coding!!
The code used in this answer can be found here: https://github.com/banool/move-examples/tree/main/call_other_module.
| 34,007 | |
https://ceb.wikipedia.org/wiki/Inkheart%20%28TV%20serye%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | Inkheart (TV serye) | https://ceb.wikipedia.org/w/index.php?title=Inkheart (TV serye)&action=history | Cebuano | Spoken | 10 | 20 | Ang Inkheart mao ang usa ka America-UK drama.
Mga reperensiya | 40,853 |
https://arz.wikipedia.org/wiki/%D8%A7%D9%8A%D9%84%D9%8A%D8%A7%20%D9%83%D9%88%D8%B1%D9%88%D8%AA%D9%83%D9%88%DA%A4 | Wikipedia | Open Web | CC-By-SA | 2,023 | ايليا كوروتكوڤ | https://arz.wikipedia.org/w/index.php?title=ايليا كوروتكوڤ&action=history | Egyptian Arabic | Spoken | 80 | 246 | ايليا كوروتكوڤ منافس العاب قوى من روسيا.
حياته
ايليا كوروتكوڤ من مواليد يوم 6 ديسمبر 1983 فى نيجنى نوفجورود.
المشاركات
شارك فى:
الالعاب الاولمبيه الصيفيه 2008
الالعاب الاولمبيه الصيفيه 2012
العاب قوى
هى مجموعة رياضات متكونه من الجرى و المشى و الرمى و النط, كانت موجوده قبل الميلاد بايام الحضاره اليونانيه و بقت بعدين جزء اساسى من الالعاب الاولمبيه الى بتتنظم كل 4 سنين و بتتعرف بأم الألعاب.
لينكات
مصادر
منافس العاب قوى
العاب قوى
منافس العاب قوى من روسيا | 6,374 |
https://stackoverflow.com/questions/60022806 | StackExchange | Open Web | CC-By-SA | 2,020 | Stack Exchange | Deepak Kothari, Mr Qian, https://stackoverflow.com/users/12450747, https://stackoverflow.com/users/3198767 | English | Spoken | 263 | 358 | How to open a custom project overview page when the project is loaded from the custom project template
Where to add a custom page and open it when the custom project template is loaded within the visual studio. For example below is the project home page when an MVC project template is opened in visual studio, similarly I have a requirement to open such a custom page for my project template.
I know that the below MVC project home page markup, styles, resources and manifest files are located at "C:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\Common7\IDE\Extensions\Microsoft\Web Tools\Project\Overview". How does the microsoft predefined templates loaded such home page? what is the starting point? Are they using any tool or library which does it?
When you creae a mvc project, the mechanism will generate a project-based overciew page based on your information combined with the background master page. This mechanism is internal to vs and is not available. And if you want to get the generated overview page, you'll find that it's not a form itself (hover over the header and it's called xxx.csproj) and doesn't exist. So you can't open it through the API. Perhaps if you want to modify this overview page, you can directly modify web.default.html under the path.
The changes I do for web.default.html will show up for actual mvc project template too which is not expected.
Actually, this page itself acts as a guidance page and the form does not exist in the current project. And Microsoft didn't extend the page. So I'm sorry to tell you it's not available through API.
| 25,124 |
https://stackoverflow.com/questions/77737237 | StackExchange | Open Web | CC-By-SA | 2,023 | Stack Exchange | Epic-legend128, https://stackoverflow.com/users/20377008 | Danish | Spoken | 826 | 1,509 | Variable input error in Postfix Expression Calculator
This postfix calculator works with an implemented stack, it works fine for normal postfix expressions such as '2 5 +', but there seems to be an issue in variable handling. When i run it, it returns this error:
Output:
7
27
index.js:44
throw new Error(`Invalid token encountered: ${token}`);
^
Error: Invalid token encountered: A
at PostfixCalculator.evaluate (index.js:44:19)
at Object.<anonymous> (/runtime/javascript/3zxrd96tq_3zxykq39r/index.js:78:24)
at Module._compile (node:internal/modules/cjs/loader:1103:14)
at Object.Module._extensions..js (node:internal/modules/cjs/loader:1157:10)
at Module.load (node:internal/modules/cjs/loader:981:32)
at Function.Module._load (node:internal/modules/cjs/loader:822:12)
at Function.executeUserEntryPoint [as runMain] (node:internal/modules/run_main:77:12)
at node:internal/main/run_main_module:17:47
I have posted the code below, please let me know what i have done wrong and how i can improve and fix it, i am a beginner so any advice will be appreciated thanks.
class PostfixCalculator {
constructor() {
// Initialize an empty stack to hold operands and an empty symbol table for variables
this.stack = [];
this.symbolTable = {};
}
// Method to evaluate postfix expressions
evaluate(expression) {
// Split the expression into tokens (operands, operators, or variables) using spaces
const tokens = expression.split(' ');
// Iterate through each token in the expression
for (let token of tokens) {
if (!isNaN(token)) {
// If the token is a number, push it onto the stack as an operand
this.stack.push(parseFloat(token)); // Push operands to the stack
} else if (token in this.symbolTable) {
// If the token is a known variable, push its corresponding value onto the stack
this.stack.push(this.symbolTable[token]); // Push variable values to the stack
} else {
// If the token is an operator (+, -, *, /) or '=', perform the corresponding operation
switch (token) {
case '+':
this.performOperation((a, b) => a + b); // Addition operation
break;
case '-':
this.performOperation((a, b) => a - b); // Subtraction operation
break;
case '*':
this.performOperation((a, b) => a * b); // Multiplication operation
break;
case '/':
this.performOperation((a, b) => a / b); // Division operation
break;
case '=':
// Perform variable assignment by popping value and variable name from the stack
const value = this.stack.pop();
const variable = this.stack.pop();
this.symbolTable[variable] = value; // Store variable value in the symbol table
break;
default:
// Throw an error for an invalid token encountered
throw new Error(`Invalid token encountered: ${token}`);
}
}
}
// Check if the stack contains only one element after evaluation
if (this.stack.length !== 1) {
throw new Error('Invalid expression');
}
// Return the final result by popping the last element from the stack
return this.stack.pop(); // Result will be the only element in the stack
}
// Method to perform arithmetic operations on operands
performOperation(operation) {
// Pop the last two operands from the stack
const operand2 = this.stack.pop();
const operand1 = this.stack.pop();
// Perform the specified operation on the operands
const result = operation(operand1, operand2);
// Push the result back onto the stack
this.stack.push(result);
}
}
// Example usage:
const calculator = new PostfixCalculator();
// Evaluate postfix expressions
console.log(calculator.evaluate('3 4 +')); // Output: 7
console.log(calculator.evaluate('3 4 5 + *')); // Output: 27
// Handle variable assignments
console.log(calculator.evaluate('A 2 =')); // Setting variable A to 2
console.log(calculator.evaluate('B 3 =')); // Setting variable B to 3
console.log(calculator.evaluate('A B *')); // Output: 6 (Multiplication of variables A and B)
The error that is thrown is the error that has been placed to be thrown when the program has run out of options and doesn't recognise a token. In this case, you split up all of the expression "A 2 =" wherever there are spaces, so you first get 'A'. Your if statements try to check if this 'A' is a number, if it is a variable that ALREADY exists and finally if it is one of the mathematical signs. But it never accounts for the possibility that 'A' is a new variable. In that case you shouldn't throw an error, but rather save the name of this variable together with its value into your hash table, like so this.symbolTable[token] = ....
There are a lot of things to take into account when making such an open calculator. Because I said that if the token is none of the options that are being checked then it must be a new variable and we should assign for it a value. However, in this case of a new variable you should also make sure to check that the input is in fact aimed at variable declaration because if you have sth like A B * and both A and B are new variables then you should throw an error or an alert to the user that the variables do not exist or sth similar depending on how you want to handle that case.
Also sth else that I picked up is that the expression "3 4 5 + " returns 27. At first when I saw it I interpreted it as 3+45 = 23 but the calculator interpreted it as 3*(4+5) = 27. Maybe you did in fact aim it to work like that but I am just pointing it out just in case.
| 43,457 |
https://stackoverflow.com/questions/1756008 | StackExchange | Open Web | CC-By-SA | 2,009 | Stack Exchange | Benabderrahmane Mohammed, CloudSync, Gunther, James Moore, Raph Metal, airtower, https://stackoverflow.com/users/10584983, https://stackoverflow.com/users/16787, https://stackoverflow.com/users/3511232, https://stackoverflow.com/users/3511233, https://stackoverflow.com/users/3511234, https://stackoverflow.com/users/3570812, https://stackoverflow.com/users/3570934, https://stackoverflow.com/users/3575127, https://stackoverflow.com/users/4211726, https://stackoverflow.com/users/4310013, luthien, rtperson, user3511232, user3575127 | English | Spoken | 774 | 1,095 | QuickBooks vs. MYOB vs. PeachTree
I've been trying to choose between the three accounting software. However, I can't decide which one should I use. In terms of user interface, I would go for PeachTree and QuickBooks. MYOB seems too old IMHO. In terms of using for software development, I would go for QuickBooks because I think there are many developers using it and the SDK can be easily downloaded. Also, do these software support currencies aside from dollar? What SDK is easy to use for .NET development? TIA.
This is probably a better question for SuperUser or http://answers.onstartups.com/. Personally, I've used QuickBooks and been pretty happy with it, though I had a very small, one-person company.
QuickBooks is very mature and much, much more popular than either other system. It's also much easier to find an accountant familiar with QuickBooks than it is to find an accountant familiar with either of the two others.
As far as development goes, QuickBooks has a reasonably strong developer community behind it, and integration/the SDK is pretty flexible. There is an official QuickBooks SDK that's pretty easy to use and is downloadable from Intuit's site. The forums are also a good resource:
https://idnforums.intuit.com/
To answer the question about SDK's (selecting an accounting package for everyday use is beyond the scope of this site), I've used both Quickbooks and Peachtree; I don't know anything about MYOB. Here we go.
Quickbooks:
A lot of stuff is hidden by the COM interfaces, so you end up having to do tricky type casts that you have to look up in the documentation. And since you'll be doing this every time you unwind a results list, it happens quite frequently.
It's confusing at first because the framework is actually quite powerful in terms of result filtering. This, coupled with the previous point, makes getting started a little difficult.
The documentation is not the greatest, but is more or less complete. Some of the examples are convoluted and unhelpful, but most of the time you can get what you need from them.
Actually connecting to Quickbooks is quite slow. The API lets you aggregate requests (i.e., on one call, you can query customers and items at the same time) which helps out a little bit.
There are a lot of little quirks in the API
The API is interface-centric
There are some features in Quickbooks that are implemented much differently than in other accounting packages. These things show through in the API, which in turn makes it more difficult to write code. Sometimes it makes sense, sometimes it doesn't.
Peachtree:
Connecting and querying is very fast, but involved queries (such as invoices) are very very slow, even when only a single field is returned.
Results come back in XML, so it's not as automatic as having things come back in .NET objects, but at least it's easy to process. Some of the XML structures are a bit bonkers (attributes attached to the wrong element), but processing that isn't a huge deal.
The documentation (a single Word document) is pretty bad, and the developer community is essentially under lock and key (you have to be a partner with Sage, i.e., $$$, to get access to their online forums). Googling "Peachtree SDK"-anything returns zero useful results.
The API is enum-centric, and the enums aren't documented very well. API classes and interfaces are named poorly (no I-prefixed interfaces) such that name collisions are likely... so you'll have to alias the API namespace in most cases. The enum names themselves are unbelievably long. Sometimes it takes 2 lines to specify a single enum value, which is unbelievably messy and annoying (example, without namespace alias: PeachwIEObjCustomerListFilter.peachwIEObjCustomerListFilter_CustomerName).
Result filtering isn't as powerful as Quickbooks, and in fact I'm struggling to get it to work at all (with an example lifted directly from the docs) is essentially useless.
From what I've read, API support is less than stellar (it seems like Sage aren't really developing it any more, and they may possibly be phasing out Peachtree altogether)
The implementation is less complete than Quickbooks
Both APIs have their strengths and weaknesses... I couldn't really give any kind of recommendation for either without knowing what type of application you're targeting, and how extensive your needs are.
I use MYOB as the main accounting package for a law firm employing 10 people. The program integrates with another package we have to use for statutory Trust accounting. Of the two programs, MYOB is noticeably superior. It is easier to use and is extremely robust and reliable. I have not used Peachtree or Quickbooks but rate MYOB as 9/10 and would be reluctant to change.
| 25,467 |
https://ru.wikipedia.org/wiki/%D0%9A%D0%B0%D0%BB%D0%B5-%D0%AD%D1%81%D1%82 | Wikipedia | Open Web | CC-By-SA | 2,023 | Кале-Эст | https://ru.wikipedia.org/w/index.php?title=Кале-Эст&action=history | Russian | Spoken | 247 | 670 | Кале-Эст () — упраздненный кантон во Франции, регион Нор-Па-де-Кале, департамент Па-де-Кале. Входил в состав округа Кале.
В состав кантона входили коммуны (население по данным Национального института статистики за 2009 г.):
Кале (14 141 чел.) (частично)
Марк (9 340 чел.)
Политика
На президентских выборах 2012 г. жители кантона отдали Франсуа Олланду в 1-м туре 31,0 % голосов против 25,5 % у Марин Ле Пен и 19,5 % у Николя Саркози, во 2-м туре в кантоне победил Олланд, получивший 60,3 % голосов (2007 г. 1 тур: Саркози — 25,2 %, Сеголен Руаяль — 25,1 %; 2 тур: Руаяль — 53,4 %). На выборах в Национальное собрание в 2012 г. по 7-му избирательному округу департамента Па-де-Кале они поддержали кандидата Социалистической партии Яна Капе, набравшего 35,4 % голосов в 1-м туре и 65,1 % — во 2-м туре. (2007 г. 1 тур: Наташа Бушар (СНД) — 34,3 %, 2 тур: Жиль Кокемпо — 53,5 %). На региональных выборах 2010 года в 1-м туре победил список социалистов, собравший 27,7 % голосов против 17,6 % у Национального фронта и 16,8 % у списка «правых». Во 2-м туре единый «левый список» с участием социалистов, коммунистов и «зелёных» во главе с Президентом регионального совета Нор-Па-де-Кале Даниэлем Першероном получил 55,6 % голосов, «правый» список во главе с сенатором Валери Летар занял второе место с 22,6 %, а Национальный фронт Марин Ле Пен с 21,8 % финишировал третьим.
См. также
Округа департамента Па-де-Кале
Коммуны департамента Па-де-Кале
Ссылки
Национальный институт статистики
Результаты кантональных выборов
Упразднённые кантоны департамента Па-де-Кале | 30,673 |
https://ceb.wikipedia.org/wiki/Xerocomus%20astereicola | Wikipedia | Open Web | CC-By-SA | 2,023 | Xerocomus astereicola | https://ceb.wikipedia.org/w/index.php?title=Xerocomus astereicola&action=history | Cebuano | Spoken | 47 | 98 | Kaliwatan sa uhong ang Xerocomus astereicola. sakop sa ka-ulo nga Basidiomycota, ug Una ning gihulagway ni Rokuya Imazeki ni adtong 1952. Ang Xerocomus astereicola sakop sa kahenera nga Xerocomus, ug kabanay nga Boletaceae. Walay nalista nga matang nga sama niini.
Ang mga gi basihan niini
Abungawg-uhong
Xerocomus | 12,580 |
https://ar.wikipedia.org/wiki/%D8%AD%D9%83%D9%85%D8%A7%D8%A1%20%28%D9%8A%D9%87%D9%88%D8%AF%D9%8A%D8%A9%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | حكماء (يهودية) | https://ar.wikipedia.org/w/index.php?title=حكماء (يهودية)&action=history | Arabic | Spoken | 356 | 1,213 | حكماء (العبرية: חז"ל, اختصار : חכמינו זכרונם לברכה - حكماؤنا رحمهم الله) هو مصطلح يشير إلى الزعماء الروحيين والدّينيّين لشعب إسرائيل من بداية فترة الهيكل الثاني حتّى نهاية القرن 6. في الكتابات الربّانيّة يقصد بهذا المصطلح جميع حكماء الميشنا والتّلمود، وغيرهم من المعلّقين في الأدب الربّاني الذّين يتّسم رأيهم بنوع من الحجيّة.
وينقسم الحكماء إلى عدّة مجموعات بحسب العصور التي عاشوها ووفقا للكتابات التي ميّزت تلك العصور:
هناك التّنائيم، وهم حكماء الميشنا الذين يعود إليهم الفضل في وجودها عبر الكتابة أو النّقل. وتمتدّ فترة التّنائيم من الهيكل الثّاني حتّى إغلاق الميشنا حوالي سنة 220. وتنقسم هذه الفترة بدورها إلى:
فترة أولى وجد فيها رجال المجلس الأعلى (אנשי כנסת הגדולה)، وهو السّنهدرين. ويتكوّن من مجموعة غير معروفة من الرّجال. ويعود الفضل في وجوده حسب التّقاليد إلى عزرا الكاتب. وذكر في هذه التّقاليد أنّ آخر أنبياء اليهود حسب الكتاب المقدّس العبريّ أي زكريّا وحجّي وملاخي كانوا يملون بأنفسهم على أعضاء المجلس تعاليم الرّسل. وأوّل أعضاء المجلس الذين ذكروا بأسمائهم هم الكاهن الأكبر شمعون العادل، وقد عرّف بأنّه شمعون بن أونياس الأوّل ، ثمّ شمعون الثّاني، وتلميذه أنتيجون السّوخي.
الفترة الثّانية هي فترة الأزواج (الزّوجوت)، ويحكم هؤلاء بناسٍ، والنّاسي هو رئيس السّنهدرين، وينوبه آف بيت الدّين. وقد وجدت خمسة أجيال من الزّوجوت طيلة قرن. وكان هيليل وشماي أشهرهم. وكان لهذين الحكيمين العدويّن الفضل في تدفّق التّأويلات وتعدّد المدارس.
فترة التّنائيم الخالصة شملت خمسة أجيال واستغرقت مدّة بدأت منذ السّنة الأربعين قبل الميلاد حتّى إنهاء الميشنا، وتتميّز أدبيّاتهم بثرائها وتنوّعها.
الأمورائيم (القائلون)، هم علماء الجيمارة، وهو القسم الذي فسّرت فيه الميشنا، وجدوا في إسرائيل وبابل. وينسب إليهم التّلمود الأورشليميّ والبابليّ وأيضا الميدراشيم خاصّة ميدراش ربّا حول التّكوين وميدراش ربّا حول اللّاويّين أقدم الكتب الميدراشيّة.
الصّافورائيم (المفكّرون) هم علماء الأكاديميات التّلموديّة الذين اهتمّوا بتحرير التّلمود. وقد وجدوا من القرن الخامس حتّى بداية عصر الجاؤونيم حوالي سنة 589.
سلطة الحكماء
في منتصف المدة الظروف التي السنهدرين، السلطة وقطعت قصاصات الصحيحة التي كتبت كانت لوائح جديدة في التوراة وسيناء، بشأن أي مسألة رأوا من الضروري : أمثلة من الوصايا والنواهي حكماء قراءة كتاب استير على البوريم، وحظر يهز تعيينه على السبت، واجب غسل الأيدي قبل تناول الطعام الخبز، واجب الصلاة ثلاث مرات يوميا وغيرها الكثير.
انظر أيضًا
حاخام
مراجع
أسماء مختصرة
تاريخ اليهود | 39,200 |
https://de.wikipedia.org/wiki/Moogerah-Peaks-Nationalpark | Wikipedia | Open Web | CC-By-SA | 2,023 | Moogerah-Peaks-Nationalpark | https://de.wikipedia.org/w/index.php?title=Moogerah-Peaks-Nationalpark&action=history | German | Spoken | 383 | 741 | Der Moogerah-Peaks-Nationalpark (engl.: Moogerah Peaks National Park) ist ein Nationalpark im Südosten des australischen Bundesstaates Queensland.
Lage
Er liegt etwa 70 Kilometer südwestlich von Brisbane und besteht aus vier einzelnen Gebieten im Fassifern Valley, die um den Lake Moogerah gruppiert sind.
Im Westen und Süden dieses Nationalparks liegt der Main-Range-Nationalpark.
Moogerah Peaks
Die Moogerah Peaks sind ein kleines Gebirge vulkanischen Ursprungs. Die Berge Mount French, Mount Edwards, Mount Moon und Mount Greville sind jeweils in einem der vier Teile des Nationalparks zu finden.
Die Frog Buttress am Mount French sind eine der bekanntesten Kletterstellen im Bundesstaat. Der Nationalpark umgibt den Lake Moogerah und so ist der Mount Edwards über die Staumauer zugänglich.
Flora und Fauna
Wegen der relativen Unzugänglichkeit des Parks blieb die natürliche Vegetation fast unangetastet. Es handelt sich dabei hauptsächlich um Eukalyptuswald, Hartlaubvegetation und Bergheidelandschaften auf schrofigem Gelände. An geschützten Stellen gibt es etwas subtropischen Regenwald. Regenwald bedeckte früher das gesamte Fassifern Valley, wurde aber mit der Zeit größtenteils gerodet. Nur im Nationalparkgebiet um den Mount French kann man noch Reste sehen. Zu den endemischen Pflanzen zählen die Moogerah-Peaks-Leionema (Leionema gracile) und Mount-Greville-Riedgras (Arundinella grevillensis). Die Palm Gorge liegt am Mount Greville In dieser engen Schlucht findet man Bangalow-Palmen (Archontophoenix cunninghamia) fast in Reinkultur.
Der Park ist Teil der Scenic Rim Important Bird Area, die von BirdLife International wegen ihrer Bedeutung als Lebensraum für etliche bedrohte Vogelarten als solche ausgewiesen wurde.
Einrichtungen
Einen Zeltplatz gibt es nur im Nationalparkteil um den Mount French bei den Frog Buttress.
Ausgebaute Wanderwege gibt es ebenfalls nur um den Mount French. In den anderen Sektionen kann man ebenfalls wandern, aber die Steige durch den Busch werden nicht besonders gewartet und sind nur für geübte Wanderer gedacht.
Zufahrt
Alle vier Teile des Nationalparks sind vom Cunningham Highway (Ausfahrt Aratula oder Fassifern) aus zu erreichen. Der Mount French liegt ca. vier Kilometer östlich von Fassifern an der Staatsstraße 90. Der Mount Edwards liegt direkt nördlich des Lake Moogerah, etwa vier Kilometer südlich von Aratula. Der Mount Greville liegt südwestlich des Lake Moogerah, ca. zwei Kilometer westlich der Siedlung Moogerah. Der ca. fünf Kilometer südöstlich derselben Siedlung gelegene Mount Moon ist von Privatgelände umgeben, sodass man bei den Eigentümern nach einer Zufahrtserlaubnis fragen muss.
Weblinks
Offizielle Webpräsenz des Nationalparks
Einzelnachweise
Nationalpark in Queensland
Nationalpark in Australien und Ozeanien | 28,633 |
https://stackoverflow.com/questions/41105992 | StackExchange | Open Web | CC-By-SA | 2,016 | Stack Exchange | Oleg Kurbatov, Souciance Eqdam Rashti, Vadim, https://stackoverflow.com/users/1497060, https://stackoverflow.com/users/5311694, https://stackoverflow.com/users/7134058 | English | Spoken | 821 | 1,278 | Apache Camel: error when bean endpoint returns null
I'm trying to implement a service that searches for an item in external database and, if found, saves it in the local one.
I have following route:
from("direct:find-and-save")
.to("bean:itemSearcher?method=searchFor(${header.brand}, ${header.model})")
.to("bean:itemConverter")
.to("bean:itemRepository?method=saveItem");
It works perfectly when itemSearcher finds the item. When itemSearcher does not find the item, it returns null. I expected that body of the message would be set to null but I got the following exception:
org.apache.camel.NoTypeConversionAvailableException: No type converter available to convert from type: org.apache.camel.converter.stream.InputStreamCache to the required type
I have debugged Camel's code right after itemSearcher returns null and seen that null effectively got set as body of out-message of the current exchange and then the out-message became in-message for the next exchange. But somewhere body gets replaced with InputStreamCache anyway.
My question is: how can I configure Camel to preserve null value as a message body? If it is not possible, how do I go around giving that the beans should not have dependencies of Camel (i.e. cannot take Exchange instance as an argument).
Please point me if I'm missing something in documentation I've read:
Bean Integration
Bean Component
Bean Binding
I use Camel v. 2.18.0
I really doubt Camel adds InputStreamCache by default as I have routes that return null in various steps of the flow and I use choice()/when() to determine the content of the body. You might want to add a condition after the itemConverter to check for a null body. And how does the code in your item converter bean look like?
It seems that Camel 2.18.0 has that kind of misbehavior.
I have updated version to 2.18.1 (didn't change any of my code) and now null body gets to the next endpoint as expected.
Since you are calling a method where camel had to convert to a particular type before calling the method.
And if the value is null it won't be able to assign a type.
can you try defaulting value like this ${header.brand:ABC}, ${header.model:ABC}
OR default to empty string ${header.brand:}, ${header.model:}
The question is not about header values. searchFor(${header.brand}, ${header.model}) works fine. This very method may return null and exception happens after that.
I guess exception happens when your null body needs to be converted to what
.to("bean:itemConverter")
expects to get.
Perhaps you need an additional processor between itemSearcher and itemConverter to handle null body.
At least for debugging purpose try to put one (which has Processor implementation) and see how body actually looks in Exchange.
BTW: I'm not sure why "the beans should not have dependencies of Camel" as long as they are Camel endpoints?
ADDED: maybe bean:itemConverter has to be able to accept Object as body and then decide what to do when body is not an instance of needed "item" class.
I did as you suggested. I added .process(exchange -> LOGGER.debug("body is {}", exchange.getIn().getBody())) before .to("bean:itemConverter"). In the log I get body is org.apache.camel.converter.stream.InputStreamCache@28f67f4f
The beans should be independent of Camel because those are used as direct dependencies in other parts of the application. I would write some wrappers only if there is no other way because now it seems it should work as it is.
That is expected... so there are 3 ways - 1. special processor in between, 2. itemConverter must accept Object and handle wrong type of body 3. as suggested by Rajesh special converter which will do the same - handle wrong type of body...
Could you please give me a refference to a document which sais that null body is supposed to be represented as InputStreamCache object in the next exchange?
... still wondering how do you implement Camel Endpoint without dependency on Camel?
Not inside the beans.
About body: behind the scene Body in Camel is not actual object, but can be 0 element in array of objects. So, maybe because of message format there is an InputStream as another part of message... Some time back I had a problem with webservice InOut parameters in Camel and had to make an special interceptor to avoid bug in Camel-CXF to handle it properly. It was also about that array of objects in body... and it was not documented. I had to travel through debugger...
Also it is not good anyway to use null as "valid body" - simple: when itemSearcher cannot find a type make it something and handle that "something" in itemConverter.
It is excepted behavior according to camel document in http://people.apache.org/~dkulp/camel/type-converter.html
Could you try writing your own converter to do a null check? For Eg.
context.getTypeConverterRegistry().addTypeConverter(MyOrder.class, String.class, new MyOrderTypeConverter());
Check the above document for more details.
It is expected behavior when there is no converter that can convert a message body from one type to another. And I don't have one. But I don't ever expect that null body all of a sudden become InputStreamCache instance. So my issue is not in conversion, it is unexpected object in the message body.
| 4,786 |
https://en.wikipedia.org/wiki/Wulanyili | Wikipedia | Open Web | CC-By-SA | 2,023 | Wulanyili | https://en.wikipedia.org/w/index.php?title=Wulanyili&action=history | English | Spoken | 29 | 56 | Wulanyili is a community in Tamale Metropolitan District in the Northern Region of Ghana.
See also
Suburbs of Tamale (Ghana) metropolis
References
Communities in Ghana
Suburbs of Tamale, Ghana | 14,558 |
https://ceb.wikipedia.org/wiki/Parnassius%20delphius | Wikipedia | Open Web | CC-By-SA | 2,023 | Parnassius delphius | https://ceb.wikipedia.org/w/index.php?title=Parnassius delphius&action=history | Cebuano | Spoken | 42 | 80 | Kaliwatan sa alibangbang ang Parnassius delphius. Una ning gihulagway ni Eduard Friedrich Eversmann ni adtong 1843. Ang Parnassius delphius sakop sa kahenera nga Parnassius, ug kabanay nga Papilionidae. Walay nalista nga matang nga sama niini.
Ang mga gi basihan niini
Insekto
Parnassius | 7,551 |
https://ru.wikipedia.org/wiki/U-154 | Wikipedia | Open Web | CC-By-SA | 2,023 | U-154 | https://ru.wikipedia.org/w/index.php?title=U-154&action=history | Russian | Spoken | 7 | 26 | Немецкие подводные лодки
U-154 (1917)
U-154 (1941) | 39,168 |
https://be.wikipedia.org/wiki/%D0%97%D0%B0%D1%82%D0%BE%D1%87%D1%87%D0%B0%20%28%D0%92%D0%B5%D1%80%D1%85%D0%BD%D1%8F%D0%B4%D0%B7%D0%B2%D1%96%D0%BD%D1%81%D0%BA%D1%96%20%D1%80%D0%B0%D1%91%D0%BD%29 | Wikipedia | Open Web | CC-By-SA | 2,023 | Заточча (Верхнядзвінскі раён) | https://be.wikipedia.org/w/index.php?title=Заточча (Верхнядзвінскі раён)&action=history | Belarusian | Spoken | 30 | 126 | Зато́чча (, ) — вёска ў Верхнядзвінскім раёне Віцебскай вобласці. Уваходзіць у склад Бялькоўшчынскага сельсавета.
Да 2004 года ўваходзіла ў склад Жоўнінскага сельсавета.
Спасылкі
Бялькоўшчынскі сельсавет
Населеныя пункты Верхнядзвінскага раёна | 35,296 |
https://sv.wikipedia.org/wiki/Bl%C3%A4dinge%20socken | Wikipedia | Open Web | CC-By-SA | 2,023 | Blädinge socken | https://sv.wikipedia.org/w/index.php?title=Blädinge socken&action=history | Swedish | Spoken | 229 | 591 | Blädinge socken i Småland ingick i Allbo härad i Värend, ingår sedan 1971 i Alvesta kommun i Kronobergs län och motsvarar från 2016 Blädinge distrikt.
Socknens areal är 80,01 kvadratkilometer, varav land 70,10. År 2000 fanns här 495 invånare. Blädinge kyrkby med sockenkyrkan Blädinge kyrka ligger i socknen.
Administrativ historik
Blädinge socken har medeltida ursprung.
Vid kommunreformen 1862 övergick socknens ansvar för de kyrkliga frågorna till Blädinge församling och för de borgerliga frågorna till Blädinge landskommun. Denna senare inkorporerades 1952 i Vislanda landskommun som sedan 1971 uppgick i Alvesta kommun.
1 januari 2016 inrättades distriktet Blädinge, med samma omfattning som församlingen hade 1999/2000.
Socknen har tillhört samma fögderier och domsagor som Allbo härad. De indelta soldaterna tillhörde Kronobergs regemente, Skatelövs kompani, Smålands grenadjärkår, Sunnerbo kompani.
Geografi
Blädinge socken ligger väster om sjön Salen. Socken består av odlingsbygd närmast sjön och mossrik skogsbygd väster därom.
Fornminnen
Några hällkistor från stenåldern, några gravrösen från bronsåldern och några järnåldersgravfält samt en hällristning finns här.
Namnet
Namnet (1350 Bädhinge), taget från kyrkbyn, har ett förled med oklar tolkning, både ett mansnamn och blad har föreslagits. Efterledet inge är en vanlig ortnamnsändelse som betyder boplats.
Se även
Blädinge församling
Lista över fasta fornminnen i Alvesta kommun#Blädinge
Referenser
Fotnoter
Vidare läsning
Sveriges bebyggelse : statistisk-topografisk beskrivning över Sveriges städer och landsbygd.Landsbygden. Kronobergs län Hermes 1952
Externa länkar
Indelningar i Alvesta kommun
Socknar i Allbo härad | 35,618 |
https://stackoverflow.com/questions/72877734 | StackExchange | Open Web | CC-By-SA | 2,022 | Stack Exchange | https://stackoverflow.com/users/14734019, https://stackoverflow.com/users/4581301, https://stackoverflow.com/users/4688321, kcash, kiner_shah, user4581301 | English | Spoken | 346 | 996 | C++ Compile Error:'Set "compilerPath" to "" to disable detection of system includes and defines.'
Let the laughs begin!(at least I told you)
Machine: Asus win10 ryzen 5800x w/ virtualization on
errors:
[7/5/2022, 9:51:02 PM] For C source files, IntelliSenseMode was changed from "windows-gcc-arm64" to "windows-gcc-x64" based on compiler args and querying compilerPath: "C:\msys64\mingw64\bin\gcc.exe"
[7/5/2022, 9:51:02 PM] IntelliSenseMode was changed because it didn't match the detected compiler. Consider setting "compilerPath" instead. Set "compilerPath" to "" to disable detection of system includes and defines.
[7/5/2022, 9:51:02 PM] For C++ source files, IntelliSenseMode was changed from "windows-gcc-arm64" to "windows-gcc-x64" based on compiler args and querying compilerPath: "C:\msys64\mingw64\bin\gcc.exe"
[7/5/2022, 9:51:02 PM] IntelliSenseMode was changed because it didn't match the detected compiler. Consider setting "compilerPath" instead. Set "compilerPath" to "" to disable detection of system includes and defines.
Compile CMD win10: g++ .\http_example.cpp -o http_example // note in pwd
Code taken for web:
How to send http request and retrieve a json response C++ Boost
#include <boost/asio.hpp>
#include <iostream>
int main() {
boost::system::error_code ec;
using namespace boost::asio;
// what we need
io_service svc;
ip::tcp::socket sock(svc);
sock.connect({ {}, 8087 }); // http://localhost:8087 for testing
// send request
std::string request("GET /newGame?name=david HTTP/1.1\r\n\r\n");
sock.send(buffer(request));
// read response
std::string response;
do {
char buf[1024];
size_t bytes_transferred = sock.receive(buffer(buf), {}, ec);
if (!ec) response.append(buf, buf + bytes_transferred);
} while (!ec);
// print and exit
std::cout << "Response received: '" << response << "'\n";
}
Installed mingw-w64-x86_64-boost using: MYSY2 MYSY; pacman -S mingw-w64-x86_64-boost
Any Suggestions on the issue/error?
We don't laugh. That would be rude. We do vote, though. This looks like a question about Visual Studio or Visual Studio Code. You should add the visual-studio or visual-studio-code tag to catch the attention of the appropriate IDE's gurus. They'll be more useful here than the general C++ and GCC folks.
Are those really errors? I don't understand what is going wrong. Please elaborate. Also, please try compiling directly from command line rather than from an IDE.
1: AppData\Local\Temp\ccKZsSdJ.o:http_example.c:(.text$_ZN5boost4asio6detail17winsock_init_base7startupERNS2_4dataEhh[_ZN5boost4asio6detail17winsock_init_base7startupERNS2_4dataEhh]+0x74): undefined reference to __imp_WSAStartup' 2: \AppData\Local\Temp\ccKZsSdJ.o:http_example.c:(.text$_ZN5boost4asio6detail10socket_ops5closeEyRhbRNS_6system10error_codeE[_ZN5boost4asio6detail10socket_ops5closeEyRhbRNS_6system10error_codeE]+0xaa): undefined reference to __imp_closesocket' (This straight off the command line using g++ )
| 46,570 |
https://gl.wikipedia.org/wiki/STS-133 | Wikipedia | Open Web | CC-By-SA | 2,023 | STS-133 | https://gl.wikipedia.org/w/index.php?title=STS-133&action=history | Galician | Spoken | 158 | 307 | STS-133 foi a última misión do transbordador espacial Discovery, lanzada o 24 de febreiro de 2011 desde a rampla 39A do Centro de Lanzamento de Cabo Cañaveral.
Características
STS-133, con seis astronautas a bordo, foi unha misión de aprovisionamento da Estación Espacial Internacional. A tripulación estaba formada polo comandante Steve Lindsey, o piloto Eric Boe e os especialistas de misión Alvin Drew, Nicole Stott, Steve Bowen e Michael Barratt.
O Discovery, no seu último voo, levou varias toneladas de subministracións e equipamento diverso no MPLM Leonardo, así como os módulos PMM e ELC4 para almacenar partes de reposto e servir como almacenamento. Tamén levou o Robonaut 2, un asistente robótico experimental para o interior da estación. Durante a misión se levaron a cabo dous paseos espaciais.
O Discovery volveu por última vez a terra en Cabo Cañaveral o 9 de marzo de 2011 ás 16:57 GMT.
Notas
Véxase tamén
Outros artigos
Transbordador espacial
Transbordador espacial Discovery
Programa STS | 23,041 |
https://en.wikipedia.org/wiki/Liveware | Wikipedia | Open Web | CC-By-SA | 2,023 | Liveware | https://en.wikipedia.org/w/index.php?title=Liveware&action=history | English | Spoken | 115 | 160 | Liveware was used in the computer industry as early as 1966 to refer to computer users, often in humorous contexts, by analogy with hardware and software.
It is a slang term used to denote people using (attached to) computers, and is based on the need for a human, or liveware, to operate the system using hardware and software. Other words meaning the same or similar to liveware include wetware, meatware and jellyware. Meatware and jellyware are most often used by internal customer support personnel as slang terms when referencing human operating errors.
The term liveware is found in the Culture novels by Iain M. Banks. A Culture Ship is named "Liveware Problem".
References
Computer jargon | 2,768 |
https://fr.wikipedia.org/wiki/Saison%202017%20des%20Cardinals%20de%20Saint-Louis | Wikipedia | Open Web | CC-By-SA | 2,023 | Saison 2017 des Cardinals de Saint-Louis | https://fr.wikipedia.org/w/index.php?title=Saison 2017 des Cardinals de Saint-Louis&action=history | French | Spoken | 137 | 236 | La saison 2017 des Cardinals de Saint-Louis est la en Ligue majeure de baseball pour cette franchise et sa dans la Ligue nationale.
Les Cardinals terminent en place de la division Centrale de la Ligue nationale avec 83 victoires et 79 défaites. Malgré cette saison avec davantage de victoires que de défaites, les Cardinals perdent 3 matchs de plus qu'en 2016 et ratent les séries éliminatoires pour la fois de suite, ce qui ne s'était pas produit depuis les saisons 2007 et 2008.
Contexte
Saison régulière
La saison régulière de 162 matchs des Cardinals débute le par la visite à Saint-Louis des Cubs de Chicago et se termine le octobre suivant.
Classement
Effectif
Affiliations en ligues mineures
Notes et références
Liens externes
Site officiel des Cardinals de Saint-Louis
Calendrier 2017 des Cardinals de Saint-Louis
Saint-Louis
2017
Saint-Louis | 7,278 |
https://sv.wikipedia.org/wiki/Platygaster%20rutubus | Wikipedia | Open Web | CC-By-SA | 2,023 | Platygaster rutubus | https://sv.wikipedia.org/w/index.php?title=Platygaster rutubus&action=history | Swedish | Spoken | 30 | 66 | Platygaster rutubus är en stekelart som beskrevs av Walker 1836. Platygaster rutubus ingår i släktet Platygaster och familjen gallmyggesteklar. Inga underarter finns listade i Catalogue of Life.
Källor
Gallmyggesteklar
rutubus | 10,619 |
https://ru.wikipedia.org/wiki/%D0%9A%D0%B8%D1%80%D0%B8%D0%BB%D0%BB%D0%BE%D0%B2%2C%20%D0%90%D0%BB%D0%B5%D0%BA%D1%81%D0%B0%D0%BD%D0%B4%D1%80%20%D0%A1%D0%B5%D0%BC%D1%91%D0%BD%D0%BE%D0%B2%D0%B8%D1%87 | Wikipedia | Open Web | CC-By-SA | 2,023 | Кириллов, Александр Семёнович | https://ru.wikipedia.org/w/index.php?title=Кириллов, Александр Семёнович&action=history | Russian | Spoken | 546 | 1,573 | Алекса́ндр Семёнович Кири́ллов (30 мая 1921, село Япрынцево, Киргизская АССР, РСФСР — 15 сентября 2016, Липецк, Россия) — участник Великой Отечественной войны, командир эскадрильи 41-го штурмового авиационного полка 198-й штурмовой авиационной дивизии 6-го штурмового авиационного корпуса 16-й воздушной армии 1-го Белорусского фронта, Герой Советского Союза (1946), полковник. Почётный гражданин Липецка.
Был последним живущим участником Великой Отечественной войны — Героем Советского Союза, проживавшим в Липецкой области.
Биография
Родился 30 мая 1921 года в селе Япрынцево Переволоцкого района Оренбургской области в семье крестьян. Русский. Проживал в Оренбурге. Окончил среднюю школу № 6.
В Красной Армии с 1940 года. В 1942 году окончил Чкаловскую школу пилотов. С августа 1942 года в боях Великой Отечественной войны. В звании сержанта он был командиром экипажа Ил-2 — лётчиком, старшим лётчиком, командиром звена, заместителем командира эскадрильи. Будучи исполняющим обязанности командира эскадрильи получил звание лейтенанта. В конце 1943 года назначен командиром эскадрильи. Он участвовал в Курской битве, в обороне и освобождении Воронежа, Белоруссии, Украины, Польши, освобождении многих городов (Краков, Лодзь, Люблин, Кутно, Коло, Торуно, Варшава), в Берлинской операции.
К февралю 1945 года капитан А. С. Кириллов выполнил 96 боевых вылетов. Уничтожил 22 танка, 77 автомашин, 37 орудий, много живой силы, сбил в воздушном бою самолёт противника, взорвал 2 склада с горючим. 41-й штурмовой авиационный полк с ноября 1945 года входил в состав 3-й гвардейской штурмовой авиационной дивизии 6-го штурмового авиакорпуса 16-й воздушной армии.
За мужество и героизм, проявленные в воздушных боях с немецко-фашистскими захватчиками Указом Президиума Верховного Совета СССР от 15 мая 1946 года капитану Кириллову Александру Семёновичу присвоено звание Героя Советского Союза с вручением ордена Ленина и медали «Золотая Звезда» (№ 7056).
После окончания Великой Отечественной войны А. С. Кириллов был направлен в Липецк на курсы переподготовки лётчиков, которые должны были участвовать в войне с Японией. В 1947 году поступил на командный факультет Военно-воздушной академии в Монино, которую окончил в 1951 году. По окончании академии он был направлен в Прикарпатский военный округ, а через год — в Австрию на должность заместителя командира полка; позже он стал помощником командира дивизии по огневой и тактической подготовке. В 1956 году его дивизия была переведена на Украину в Кременчуг. В 1959 году А. С. Кириллов получил назначение в Воронеж в ордена Ленина Краснознамённый авиационный центр имени В. П. Чкалова. В 1960 году центр был перебазирован в Липецк, где А. С. Кириллов служил в различных должностях. С 1976 года — в запасе.
Выйдя на пенсию, А. С. Кириллов выступал на конференциях ветеранов войны в Москве, избирался депутатом в районный и городской Советы, был гостем Президента Российской Федерации на праздновании Дня Победы, участвовал в параде Победы в 1995, 2000 и 2001 годах. Жил в городе Липецк.
Скончался 15 сентября 2016 года. Похоронен в городе Липецк.
Награды и звания
Награды
Герой Советского Союза (15 мая 1946 года, № 7056)
орден Ленина (15 мая 1946 года, № 7056)
3 ордена Красного Знамени
орден Александра Невского
орден Отечественной войны I степени
орден Отечественной войны II степени
2 ордена Красной Звезды
орден «За службу Родине в ВС СССР» III степени,
медаль «За боевые заслуги»
медаль «За освобождение Варшавы»
медаль «За взятие Берлина»
другие медали
орден «Крест Храбрых» (ПНР)
Звания
Почётный гражданин Липецка
Примечания
Литература
Чурилов Ю. И. Он воевал за Воронеж. // Вестник архивиста: науч.-информ. бюл. — Липецк. — 2006. — Вып. 1. — С.61-64.
Ссылки
Лётчики Великой Отечественной войны
Почётные граждане Липецка | 10,582 |
https://en.wikipedia.org/wiki/Bassam%20Saba | Wikipedia | Open Web | CC-By-SA | 2,023 | Bassam Saba | https://en.wikipedia.org/w/index.php?title=Bassam Saba&action=history | English | Spoken | 574 | 826 | Bassam Saba (26 October 19584 December 2020) was a Lebanese musician and a promoter of Arabic music in the west. He was a co-founder of the New York Arabic Orchestra and the director of Lebanon's national conservatory of music.
He died of complications from COVID-19 in Beirut, Lebanon, on December 4, 2020.
Early life and education
Saba was born on 26 October 1958, in Tripoli, Lebanon. His father, Antoine Saba, worked for an oil company. His mother, Delena Saba, was a homemaker. His family was musical, and his older siblings taught him to play the nay. At the outset of the Lebanese Civil War in 1976 he went to Paris to study music at the Conservatoire Municipal des Gobelins in Paris, where he earned his BA in Western Classical Music and Flute Performance, and the Gnessin School in Moscow, where he received a master's degree in Western Flute Performance and Music Education. He then moved to the United States and settled in Northport, New York.
Career
Saba started a band in New York, and traveled throughout the world to promote Lebanese and Arabic music. He performed as a soloist for the Hanover Philharmonic, Qatar Philharmonic, Beirut Philharmonic, Zurich Orchestra, and East Oakland Bay Symphony and others. Saba also composed for and performed with his own musical ensemble called Myriad, and directed the Middle Eastern Ensemble of Harvard University.
Saba was a former member of Yo Yo Ma's Silk Road Ensemble and Global Musician Workshop faculty.
In 2007, he co-founded the New York Arabic Orchestra.
He played music with many established western musicians throughout his career, including Sting, Alicia Keys, Herbie Hancock and Quincy Jones. He also played with some of the major cultural figures from the Arab region, including Fairouz and Marcel Khalife. Saba lived in the United States for almost 30 years. In 2018, he was offered a job as the president of the Lebanese National Higher Conservancy of Music, for which, due to bureaucratic error, he was never paid. He played many instruments, including the nay (an Arabic flute), oud, violin and flute.
Awards
He was named one of the 10 Most Outstanding Artists by the Arab American National Museum in 2007.
Personal life
Saba was married to Dr. Diala Jaber and had a daughter, Mariana. According to his daughter, Saba was eager to introduce Arabic music to as many people as he could, including by volunteering to teach her high school choir how to sing muwashahat, an Arabic musical genre.
Final performance and death
On 17 October 2020, Saba played the flute in a chamber piece by Telemann in the town of Bsharri in a church there as part of his work to raise money for the conservancy that had been damaged in the huge port explosion on 4 August 2020, which left 200 people dead and caused considerable damage. Three days later. he was infected with COVID-19 amid the COVID-19 pandemic in Lebanon at a board meeting at the conservatory. He was hospitalized and later transferred to the non-Covid ICU at the American University of Beirut Medical Center when he was considered no longer contagious. A few days later, he developed septic shock after contracting a "superbug". He was intubated, but later died from complications of COVID-19, on 4 December 2020, at the age of 62.
References
1958 births
2020 deaths
Lebanese oud players
Lebanese musicians
Lebanese flautists
Academic staff of Conservatoire Libanais
Deaths from the COVID-19 pandemic in Lebanon | 26,207 |
https://electronics.stackexchange.com/questions/533487 | StackExchange | Open Web | CC-By-SA | 2,020 | Stack Exchange | Fixer69, https://electronics.stackexchange.com/users/211480, https://electronics.stackexchange.com/users/38098, jonk | English | Spoken | 1,534 | 2,085 | Art of Electronics, Second edition pp. 73-75 -- question about pull-up resistor and the logic of current setting
Edit: As you can see in the comments, I got a great explanation about the pull-up resistor question. I also wanted to make more of a bullet point of the PNP question as follows:
When it comes to setting the current in a PNP circuit (like a current source or emitter follower), is the procedure the same as for NPN, i.e. base voltage determines emitter voltage (as long as Vee is high enough), which will be a diode drop higher that the base voltage, then the emitter resistor is chosen to set the current based on that and I=V/R? If so, why does the voltage stabilize at that level? It seems that Iec is bringing Ve down from Vee, but why would it stop at Vb+.6V? I could imagine the transistor constantly turning off and back on.
Original post:
I was really grateful for the answers to my last question and am hoping not to wear out my welcome by asking about everything I come across, but this question involves something that has confused me all along in reading this book, which is the logic of setting voltages and currents in transistor circuits, and another issue is what is meant by pull-up resistor in this context.
On pp. 74-75 (see attached image), the authors state that R3 in figure 2.23 is a pull-up resistor for Q1. First of all, I don't think they ever introduced the concept of a pull-up resistor in the foregoing, but putting that aside, I'm not sure how this is a pull-up resistor or why one is needed. I think I must not know what the term means -- when I look it up, the definitions usually have to do with logic levels and using resistors to tie a node to either ground or +5, and that makes sense to me. It doesn't seem as though there is any shortage of either voltage or current in that location, and although I see that Q2's base is drawing current from the emitter of Q1, it doesn't seem as though it would be enough to cause any deficiency. What am I missing?
Trying to understand that comment led me to think about how a PNP transistor circuit is set up and how often the logic seems confusing (to me). In the NPN circuits like the emitter follower and current source, the base voltage is supposed to set the emitter voltage, then the drop across the emitter resistor determines the current according to ohm's law as in figure 2.22 A and B. This seems to make sense, since the emitter should be at ground (in these examples) before voltage is applied to the base, and then the applied voltage overcomes the diode threshold voltage and the emitter is separated from ground by the resistor, allowing the voltage to rise to VB-.6V.
But in the PNP case (2.22 C), if there were no diodes or emitter resistor, the base and the emitter would be at +10V, and the transistor would be in cutoff. When the diodes are added, the transistor is biased and turns on -- what happens then? I guess the +10V on the emitter would cause the base voltage to rise until there is less than diode drop between them? And possibly destroy the transistor with a giant current through the base?
But when I look at the 560 Ohm resistor, I think, well, that would create a 1.2 Volt drop if the current were 2ma, OR it would produce a 2ma current if the voltage drop were 1.2V, but can it really set both values at once?
Now that I think of it, I guess that with no emitter resistor, once the transistor is on, a giant current flows to the collector, and that will destroy some components. But as long as there is any resistor on the emitter, the current flowing to the collector will cause the voltage to drop to VB +.6V, and that is how the voltage is set to allow the resistor value to be the determinant for the current. Does that sound right? And if so, why doesn't the voltage drop any further and cause the transistor to constantly turn on and off?
You may need to break this discourse up into more bite-sized chunks. Figure out which question or two is probably most important to you. The answers to that may help you with the rest, anyway. So it may be a good idea to size this down. I can't seem to find a single concept or idea that would satisfy this, as it is. I'd have to write a similarly long discussion covering various ideas in various ways. And I may still miss the mark you are hoping for, incorrectly projecting my own guesses, because of the breadth of all this.
Fair enough -- I did just sort of blurt out all of my thoughts without boiling anything down much. I'll take a look at it. Thanks for considering!
Just to address the "pull-up" part: I don't know if you understand a "current source" or "current sink" as an idealized concept, but the BJT collector (in active mode only, not saturated) is very much like a current source (PNP) or current sink (NPN.) These ideally have "infinite impedance." (In reality, obviously, not so much.) So the collector itself tends to be "disconnected." The pull-up resistor simply provides a known resistance to the collector and some voltage source. It's called "pull-up" in the NPN case because it pulls the collector towards the + rail.
That's really interesting. The terms you mentioned are all familiar to me. I think because so many circuits have the collector directly connected to VCC, I tend to think of the collector as already having a relatively high voltage, so the resistor seems to be bringing the collector voltage down from VCC (or the + rail -- I think of those as the same thing, not sure if that's correct).
A BJT collector acts like a current source in active mode (amplifier -- analog) situations but instead acts more like a voltage source in saturated mode (switching -- digital) situations. It's still the same BJT, but it is being operated differently. In switching applications, the collector is either "floating" because the BJT is "off" or else tied very hard to its emitter because the BJT is "on." In analog situations, the collector resistor is used to create a varying voltage drop as the collector, always working like a current source/sink, varies its current.
So, in digital situations the shared end of the collector resistor is either "pulled-hard" towards its emitter or else "released to a floating condition" when it then needs a collector resistor to pull it to some specific voltage value (there's no current in the resistor, unloaded, so no drop across it and so it actually does pull almost all the way to the tied rail.) That's a "pull-up" or "pull-down" situation. In analog, the BJT collector is always a current source/sink, so infinite impedance all the time and the collector resistor still does pull, but that's not the point in analog.
In analog, it's about the voltage drop that is induced across the resistor by the current through the resistor. So it's not called a "pull-up" or "pull-down." Not because it's not performing that function. But instead because the important function is really the voltage drop across it. The resistor is converting the current into a voltage. And that's the more important idea, in these situations. So different names are used, instead.
There's a wonderful biography about Feynman, "The Beat of a Different Drum," by Jagdish Mehra. In it, there's a parable of sorts. But the summarized punchline would be something like, "You can know the name of things in all the languages in the world, but when you are finished, you'll know absolutely nothing whatever about anything. So let's look and study and observe and hypothesize and over time see how things really are, without words." Kind of like that, anyway. The gist is not to get lost in the words people use. Focus yourself upon learning behaviors. Then worry about words for them.
I see. Thanks for that explanation, which totally makes sense to me, especially in the CE amplifier situation you mentioned.
Are you now talking about 2.22(c)? Or 2.23?
Might apply to either (?), but 2.22c I guess because of the more specific values provided.
I just realized my question might not make much sense because I am still on the part of the chapter before they introduce ebers-moll and using base voltage to determine collector current -- still reading!
In the case of 2.22(c), you might estimate that each diode contributes about $600:\text{mV}$ (assuming some current exists in them.) This would mean about $3\cdot 600:\text{mV}\approx 1.8:\text{V}$ drop across all three diodes. So the base of the PNP is about $1.8:\text{V}$ below$10:\text{V}$, or about $8.2:\text{V}$. Which matches the example, well. If $V_\text{BE}\approx 600:\text{mV}$ for the PNP, then there is about $10:\text{V}-8.8:\text{V}=1.2:\text{V}$ across the $560:\Omega$ resistor. A little over $2:\text{mA}$. Note that this is the collector current!
| 28,181 |
https://stackoverflow.com/questions/58351055 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | https://stackoverflow.com/users/924299, showdev | English | Spoken | 154 | 409 | Custom object-detection AttributeError: module 'tensorflow' has no attribute 'app'
I am doing this project on custom object-detection using tensorflow.
When I tried to create TF record for the train images using the following command:
python generate_tfrecord.py
--csv_input=images\train_labels.csv
--image_dir=images\train
--output_path=train.record
I get the following error:
"generate_tfrecord.py", line 102, in tf.app.run()
AttributeError: module 'tensorflow' has no attribute 'app'
What's going wrong?
Can we see the code you're using?
Well I encountered the same issue,
You can resolve the same by making changes in generate_tfrecords.py file
Line 45: Replace tf.gfile.GFile(os.path.join(path, '{}'.format(group.filename)), 'rb') as fid:
as
tftf.compat.v1.gfile.GFile(os.path.join(path, '{}'.format(group.filename)), 'rb') as fid:
Line 23: flags = tf.app.flags as tf.compat.v1.flags
Line 86: writer = writer = tf.python_io.TFRecordWriter(FLAGS.output_path) as tf.compat.v1.python_io.TFRecordWriter(FLAGS.output_path)
and
Line 100: tf.app.run() as tf.compat.v1.app.run()
Basically there are certain methods which are built according to Tensorflow Version 1.0 so for these you can use tf.compat.v1 so that your code is modified for these particular methods which were throwing the errors.
| 4,548 |
https://arz.wikipedia.org/wiki/%D8%AF%D9%8A%D9%84%D8%A7%D9%86%D8%AB%D9%89 | Wikipedia | Open Web | CC-By-SA | 2,023 | ديلانثى | https://arz.wikipedia.org/w/index.php?title=ديلانثى&action=history | Egyptian Arabic | Spoken | 25 | 80 | ديلانثى ( الاسم العلمى: Deilanthe ) هوا جنس من النباتات من نوع ديلانذا پيرسى بيتبع روسكيا.
لينكات
مصادر
كائن
جنس من النباتات
ديلانذا پيرسى
روسكيا | 2,351 |
https://stackoverflow.com/questions/57552771 | StackExchange | Open Web | CC-By-SA | 2,019 | Stack Exchange | English | Spoken | 401 | 2,070 | Uncaught ReferenceError: revslider_showDoubleJqueryError is not defined at onLoad (nile-slider.js:45)
I am trying to use a theme for my Angular 7 Project Landing Page. I observed that the slider is not working. So when I inspected the Page and checked console, I got this error:
> Uncaught ReferenceError: revslider_showDoubleJqueryError is not defined
at onLoad (nile-slider.js:45)
at nile-slider.js:37
at nile-slider.js:82
Then when I opened the source, I got this:
See it below:
var revapi3,
tpj;
(function () {
if (!/loaded|interactive|complete/.test(document.readyState)) document.addEventListener("DOMContentLoaded", onLoad);
else onLoad();
function onLoad() {
if (tpj === undefined) {
tpj = jQuery;
if ("off" == "on") tpj.noConflict();
}
if (tpj("#rev_slider_3_1").revolution == undefined) {
revslider_showDoubleJqueryError("#rev_slider_3_1");
} else {
revapi3 = tpj("#rev_slider_3_1").show().revolution({
sliderType: "standard",
jsFileLocation: "//localhost/slider/revslider/public/assets/js/",
sliderLayout: "fullwidth",
dottedOverlay: "none",
delay: 9000,
navigation: {
onHoverStop: "off",
},
responsiveLevels: [1240, 1024, 778, 480],
visibilityLevels: [1240, 1024, 778, 480],
gridwidth: [1120, 1024, 778, 480],
gridheight: [868, 768, 960, 720],
lazyType: "none",
shadow: 0,
spinner: "spinner0",
stopLoop: "off",
stopAfterLoops: -1,
stopAtSlide: -1,
shuffle: "off",
autoHeight: "off",
disableProgressBar: "on",
hideThumbsOnMobile: "off",
hideSliderAtLimit: 0,
hideCaptionAtLimit: 0,
hideAllCaptionAtLilmit: 0,
debugMode: false,
fallbacks: {
simplifyAll: "off",
nextSlideOnWindowFocus: "off",
disableFocusListener: false,
}
});
}; /* END OF revapi call */
}; /* END OF ON LOAD FUNCTION */
}()); /* END OF WRAPPING FUNCTION */
landing-page.component.ts
import { Component, OnInit, enableProdMode } from '@angular/core';
enableProdMode();
@Component({
selector: 'app-landing-page',
templateUrl: './landing-page.component.html',
// styleUrls: ['./landing-page.component.scss']
styleUrls: [
'../../../assets/landing_page/css/animate.css',
'../../../assets/landing_page/css/owl.carousel.css',
'../../../assets/landing_page/css/owl.theme.css',
'../../../assets/landing_page/css/bootstrap.min.css',
'../../../assets/landing_page/css/hover-min.css',
'../../../assets/landing_page/css/flag-icon.min.css',
'../../../assets/landing_page/css/style.css',
'../../../assets/landing_page/css/elegant_icon.css',
'../../../assets/landing_page/fonts/font-awesome/css/font-awesome.min.css',
'../../../assets/landing_page/rslider/fonts/pe-icon-7-stroke/css/pe-icon-7-stroke.css',
'../../../assets/landing_page/rslider/fonts/font-awesome/css/font-awesome.css',
'../../../assets/landing_page/rslider/css/settings.css'
]
})
export class LandingPageComponent implements OnInit {
constructor() { }
ngOnInit() {
}
}
landing-page.component.html
<!-- jquery library -->
<i let [appLoadscript]="'assets/landing_page/js/nile-slider.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/jquery-3.2.1.min.js'"></i>
<!-- REVOLUTION JS FILES -->
<i let [appLoadscript]="'assets/landing_page/rslider/js/jquery.themepunch.tools.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/jquery.themepunch.revolution.min.js'"></i>
<!-- SLIDER REVOLUTION 5.0 EXTENSIONS -->
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.actions.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.carousel.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.kenburn.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.layeranimation.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.migration.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.navigation.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.parallax.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.slideanims.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/rslider/js/extensions/revolution.extension.video.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/YouTubePopUp.jquery.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/owl.carousel.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/imagesloaded.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/custom.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/popper.min.js'"></i>
<i let [appLoadscript]="'assets/landing_page/js/bootstrap.min.js'"></i>
Please how do I resolve this problem.
This means that jquery.js and/or the revslider-related javascripts are not loaded as this is a functionality defined in there.
A possible cause is that revslider-related folders (assets and revolution with their subfolders) are not accessible for your wewbserver.
By default, the zip contains these folders with rights like
drwx------@
So solution can be:
chmod -R 755 <yourFolderThatContainsRevSlider>
The answer is quite late, but hopefully helpful for someone else.
| 44,307 | |
https://stackoverflow.com/questions/1679201 | StackExchange | Open Web | CC-By-SA | 2,009 | Stack Exchange | Arjun, Marek Karbarz, Rob Maldeney, https://stackoverflow.com/users/203280, https://stackoverflow.com/users/3352864, https://stackoverflow.com/users/3352865, https://stackoverflow.com/users/3352866, https://stackoverflow.com/users/3352881, https://stackoverflow.com/users/3353005, https://stackoverflow.com/users/77017, ssut, steven, user3352864, user3352881 | English | Spoken | 147 | 207 | how to make ajax submit redirect?
in php, if i submit via ajax, how to redirect to other page when result comes back?
do it in javascript; after you get the result back window.location = "newpage.php"
is it not appropriate to put navigation logic in client side?
yeah, but with ajax you can't do it any other way
If you're using AJAX to redirect pages with Javascript, you're losing all the benefits of AJAX, consider simplifying your system so that it just submits its data with a regular POST.
If you're doing it asynchronously because you want the page to redirect on some specific event that the user has no control over, don't. Instead do something similar to StackOverflow - pop up a little status bar at the top or bottom (or side) of the page with a link for the user to click when they're ready.
| 45,718 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.