Yadong County




County in Tibet Autonomous Region, People's Republic of China





























Yadong County


.mw-parser-output .nobold{font-weight:normal}
亚东县 • .mw-parser-output .uchen{font-family:"Qomolangma-Dunhuang","Qomolangma-Uchen Sarchen","Qomolangma-Uchen Sarchung","Qomolangma-Uchen Suring","Qomolangma-Uchen Sutung","Qomolangma-Title","Qomolangma-Subtitle","Qomolangma-Woodblock","DDC Uchen","DDC Rinzin",Kailash,"BabelStone Tibetan",Jomolhari,"TCRC Youtso Unicode","Tibetan Machine Uni",Wangdi29,"Noto Sans Tibetan","Microsoft Himalaya"}.mw-parser-output .ume{font-family:"Qomolangma-Betsu","Qomolangma-Chuyig","Qomolangma-Drutsa","Qomolangma-Edict","Qomolangma-Tsumachu","Qomolangma-Tsuring","Qomolangma-Tsutong","TibetanSambhotaYigchung","TibetanTsugRing","TibetanYigchung"}
གྲོ་མོ་རྫོང་།

County
Nathu La.jpg

Location of Yadong County (red) within Shigatse City (yellow) and the Tibet Autonomous Region
Location of Yadong County (red) within Shigatse City (yellow) and the Tibet Autonomous Region



Yadong is located in Tibet

Yadong

Yadong



Location of the seat in the Tibet Autonomous Region

Coordinates (Yadong County government): 27°29′10″N 88°54′26″E / 27.4861°N 88.9071°E / 27.4861; 88.9071Coordinates: 27°29′10″N 88°54′26″E / 27.4861°N 88.9071°E / 27.4861; 88.9071
Country People's Republic of China
Province Tibet Autonomous Region
Prefecture-level city Xigazê
Seat Xarsingma
Time zone
UTC+8 (China Standard)









































Yadong County
Chinese name
Simplified Chinese 亚东县
Traditional Chinese 亞東縣







Alternative Chinese name
Simplified Chinese 卓木县
Traditional Chinese 卓木縣







Second alternative Chinese name
Simplified Chinese 绰莫县
Traditional Chinese 綽莫縣







Tibetan name
Tibetan


གྲོ་མོ་རྫོང༌།












Yadong County (Chinese: 亚东县), also transliterated from Tibetan as Chomo County (Tibetan: གྲོ་མོ་རྫོང༌།; Chinese: 卓木县 / 绰莫县; literally: "deep ravine county"), is a frontier county and trade-market of Tibet Autonomous Region, China, situated in the mouth of the Chumbi valley near the China-India and China-Bhutan border. It lies in the middle part of Himalayas and the south of Tibet Autonomous Region, covering about 4,306 square kilometers with a population of 10,000. It is under the jurisdiction of Xigazê.




Contents






  • 1 Geography


  • 2 History


  • 3 Towns and townships


  • 4 References





Geography


The town of Dromo (Yadong) 27°29′22″N 88°54′21″E / 27.48944°N 88.90583°E / 27.48944; 88.90583 is very close to the borders of both the Indian state of Sikkim and Bhutan and has a hotel, a guest house, some government offices and army barracks.[1]


Local specialities include Dromo fish and barley wine while the main tourist sites are Donggar Monastery, Garju Monastery and Kangbu Hotspring. Yadong is connected to the Indian state of Sikkim via the Nathu La.


As part of the China Western Development strategy, the Chinese government planned to extend the Qinghai–Tibet Railway from Lhasa to Yadong near the Nathu La that marks the disputed China–India border.[2]



History


According to the Convention of Calcutta of 1890–94 signed by Great Britain and Qing dynasty China, the market at Dromo was opened to India. At that time there was a wall-like structure across the valley's stream extending part way up each side of the valley thus blocking the road to the Tibetan capital, Lhasa. This was the demarcation line that British subjects were forbidden to cross and was manned by 20 Tibetan soldiers under a sergeant along with three Chinese officials.[3] The construction of the wall was reported to be one of the incidents that led to the British invasion of Tibet in 1904. According to the resulting Treaty of Lhasa, a British trade-agent was to be stationed at Yadong.[4]



Towns and townships




  • Xarsingma Town (ཤར་གསིང་མ་, 下司马镇)


  • Pagri Town (ཕག་རི་, 帕里镇)


  • Gêrru Township (སྒེར་རུ་, 吉汝乡)


  • Gambu Township (ཁམ་བུ་, 康布乡)


  • Rübunggang Township (རུད་སྲུངས་སྒང་, 上亚东乡)


  • Düna Township (དུད་སྣ་, 堆纳乡)


  • Xiadromo Township (གྲོ་མོ་སྨད་, 下亚东乡)



References




  1. ^ Buckley, Michael and Strauss, Robert. Tibet: a travel survival kit, p. 163. (1986) Lonely Planet Publications, Victoria, Australia. .mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}
    ISBN 0-908086-88-1.


  2. ^ Extension plans. Retrieved June 28, 2006


  3. ^ Sandberg, Graham. An Itinerary of the Route from Sikkim to Lhasa. Calcutta: Baptist Mission Press. p. 7.


  4. ^  One or more of the preceding sentences incorporates text from a publication now in the public domain: Chisholm, Hugh, ed. (1911). "Yatung". Encyclopædia Britannica. 28 (11th ed.). Cambridge University Press. p. 908.











-

Popular posts from this blog

Xamarin.iOS Cant Deploy on Iphone

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } -1 I have a windows laptop and a mac mini my problem is that It wont deploy on iphone if I use Visual Studio Xamarin on windows to install my app, but it works fine with Visual Studio For Mac. Here's what I get after build succeded on Visual Studio Xamarin on windows : 1>------ Build started: Project: FinalCustomerApp.iOS, Configuration: Debug iPhone ------ 1> Connecting to Mac server 192.168.8.100... 1> FinalCustomerApp.iOS -> C:UsersJeremy PaulDesktopFinalCustomerAppFinalCustomerAppFinalCustomerApp.iOSbiniPhoneDebugFinalCustomerApp.iOS.exe 1> Detected signing identity: 1> Code Signing Key: &quo
Read more

Glorious Revolution

Image
"The Bloodless Revolution" redirects here. For a history of the vegetarian movement, see The Bloodless Revolution (book). This article is about the English revolution of 1688. For the revolution of 1868 in Spain, see Glorious Revolution (Spain). For other uses, see Glorious Revolution (disambiguation). Glorious Revolution The Prince of Orange lands at Torbay Date 1688–1689 Location British Isles Also known as Revolution of 1688 War of the English Succession Bloodless Revolution Participants English, Welsh and Scottish society, Dutch forces Outcome Replacement of James II by William III and Mary II Jacobite rising of 1689 Williamite War in Ireland War with France; England and Scotland join Grand Alliance Drafting of the Bill of Rights 1689 Part of a series on the History of England Timeline Prehistoric Britain Roman Britain Sub-Roman Britain Medieval period Economy in the Middle Ages Anglo-Saxon period
Read more

Dulmage-Mendelsohn matrix decomposition in Python

Image
0 Matlab has a function called dmperm that computes the so-called Dulmage–Mendelsohn decomposition of a n x n matrix. From wikipedia, the Dulmage–Mendelsohn is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. Looking both on scipy and numpy, I could not find this function, nor some similar version. Is it possible to implement it using basic linear algebra operations? Any idea if this is implemented in some Python package? python matlab linear-algebra graph-theory matrix-decomposition share | improve this question
Read more