首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   30篇
  免费   0篇
  2023年   1篇
  2020年   1篇
  2019年   1篇
  2017年   1篇
  2016年   3篇
  2015年   2篇
  2013年   1篇
  2012年   1篇
  2009年   1篇
  2008年   1篇
  2007年   1篇
  2006年   2篇
  2005年   1篇
  2001年   2篇
  1999年   4篇
  1998年   2篇
  1997年   1篇
  1996年   1篇
  1995年   1篇
  1988年   1篇
  1979年   1篇
排序方式: 共有30条查询结果,搜索用时 46 毫秒
1.
2.
3.
4.
The paper discusses the potential of a collaborative scheme for the development of a protocol for recording and managing the cultural heritage in Libya. The critical political situation in the country urges the development of cultural heritage management policies in order to protect it more thoroughly and consistently. Moving on from the numerous international initiatives and projects dealing with a mostly “remote” approach to the issue, the project here presented to engages with staff members of the Department of Antiquities (DoA) in the development of a joint strategy for the application of remote sensing and geographical information systems (GIS) to the preservation and monitoring of Libyan cultural heritage. A series of training courses resulted in an initial development of new ways of recording and analysing field data for a better awareness of the full range of threats that the archaeology of the country is subject to. Focussing on the case of the Jebel Nafusa, the training involved the assessment of site visibility on satellite imagery, the analysis of high-resolution satellite datasets for archaeological mapping, the creation of a GIS spatial database of field data, and the mapping of risks and threats to archaeology from remote sensing data. This led to the creation of of a risk map showing the areas that are affected by a number of threats, thus giving the DoA a tool to prioritise future fieldwork to keep the assessment of site damage up to date. Only a collaborative approach can lead to a sustainable strategy for the protection of the invaluable cultural heritage of Libya.  相似文献   
5.
This paper centers on the relationship between renaissance medicine and antitrinitarianism forming an important part of the radical reformation in 16th century. Antitrinitarians denied the theological concept of the triune Christian God. Modern antitriniarianism was first formulated by Michael Servetus, a Spanish physician. The doctrine soon won disciples in northern Italy (Padua, Pisa, Rome) and in some countries of eastern central Europe (Poland, Moravia, Transylvania). Physicians who believed in or sympathized with antitrinitarianism revolutionized the theory of blood flow. They developed new concepts leading to Harvey's theory of the circulation of the blood. Parts of Servet's theory looked like Paracelsus's mystical idea of the eternal flesh of the body of Christ (Latin limbus aeternus), but later the medicine and natural philosophy of antitrinitarian physicians tended to be empiristic, rational and sometimes materialistic. They contributed heavily to the diffusion and physiological foundation of antitrinitarian concepts like unitarianism, tolerance and irenism.  相似文献   
6.
7.
8.
9.
Two new covering problems are introduced. The partial covering P-center problem minimizes a coverage distance in such a way that a given fraction of the population is covered. The partial set covering problem seeks the minimum number of facilities needed to cover an exogenously specified fraction of the population within a given coverage distance. The problems are formulated as integer linear programming problems. Bisection search algorithms are outlined for the two problems. The search algorithm repeatedly solves a Lagrangian relaxation of the maximal covering problem. Computational results for the Lagrangian relaxation of the maximal covering problem and for the bisection search algorithms are presented on problems with up to 150 nodes.  相似文献   
10.
Two new covering problems are introduced. The partial covering P-center problem minimizes a coverage distance in such a way that a given fraction of the population is covered. The partial set covering problem seeks the minimum number of facilities needed to cover an exogenously specified fraction of the population within a given coverage distance. The problems are formulated as integer linear programming problems. Bisection search algorithms are outlined for the two problems. The search algorithm repeatedly solves a Lagrangian relaxation of the maximal covering problem. Computational results for the Lagrangian relaxation of the maximal covering problem and for the bisection search algorithms are presented on problems with up to 150 nodes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号