首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2261篇
  免费   253篇
  国内免费   140篇
安全科学   703篇
废物处理   40篇
环保管理   425篇
综合类   860篇
基础理论   173篇
环境理论   3篇
污染及防治   120篇
评价与监测   79篇
社会与环境   90篇
灾害及防治   161篇
  2024年   8篇
  2023年   27篇
  2022年   35篇
  2021年   49篇
  2020年   62篇
  2019年   73篇
  2018年   51篇
  2017年   91篇
  2016年   104篇
  2015年   96篇
  2014年   112篇
  2013年   174篇
  2012年   160篇
  2011年   160篇
  2010年   136篇
  2009年   124篇
  2008年   97篇
  2007年   158篇
  2006年   148篇
  2005年   134篇
  2004年   99篇
  2003年   110篇
  2002年   75篇
  2001年   64篇
  2000年   61篇
  1999年   48篇
  1998年   30篇
  1997年   18篇
  1996年   19篇
  1995年   18篇
  1994年   11篇
  1993年   10篇
  1992年   9篇
  1991年   6篇
  1990年   8篇
  1989年   9篇
  1988年   9篇
  1987年   3篇
  1986年   3篇
  1985年   3篇
  1984年   7篇
  1983年   3篇
  1982年   5篇
  1980年   4篇
  1978年   5篇
  1977年   2篇
  1976年   3篇
  1974年   2篇
  1972年   3篇
  1971年   4篇
排序方式: 共有2654条查询结果,搜索用时 593 毫秒
561.
562.
The choice of neighborhood definition and critical value in adaptive cluster sampling is critical for designing an efficient survey. In designing an efficient adaptive cluster sample one should aim for a small difference between the initial and final sample size, and a small difference between the within-network and population variances. However, the two aims can be at odds with each other because small differences between initial and final sample size usually means small within-network variance. One way to help in designing an efficient survey is to think in terms of small network sizes since the network size is a function of both critical value and neighborhood definition. One should aim for networks that are small enough to ensure the final sample size is not excessively large compared with the initial sample size but large enough to ensure the within-network variance is a reasonable fraction of the population variance. In this study surveys that had networks that were two to four units in size were the most efficient.  相似文献   
563.
~~特变电工衡阳变压器有限公司环境景观设计构思@陈盛彬$湖南环境生物职业技术学院园林系!湖南衡阳421005 @陈景$湖南环境生物职业技术学院园林系!湖南衡阳421005 @谢振华$衡南县林业局!湖南衡阳421005~~~~~~  相似文献   
564.
We use a mechanism design framework to analyze the optimal design of green payment policies with the dual goals of conservation and income support for small farms. Each farm is characterized by two dimensions of attributes: farms size and conservation efficiency. The policymaker may not be able to use the attributes as an explicit criterion for payments. We characterize optimal policy when conservation efficiency is unobservable to policymakers, and when farm size is also unobservable. An income support goal is shown to reduce the conservation distortion caused by asymmetric information. The cost of optimal green payment mechanisms is shown to depend crucially on whether large or small farms have greater conservation efficiency.  相似文献   
565.
介绍了采用碳纤维布加固钢筋混凝土框架梁正截面、斜截面的设计计算及施工步骤,为了验证加固效果,对加固后的钢筋混凝土梁进行了现场静载检测,结果表明:该加固方案切实有效.图4,表2,参6.  相似文献   
566.
We compared genetic algorithms, simulated annealing and hill climbing algorithms on spatially constrained, integrated forest planning problems. There has been growing interest in algorithms that mimic natural processes, such as genetic algorithms and simulated annealing. These algorithms use random moves to generate new solutions, and employ a probabilistic acceptance/rejection criterion that allows inferior moves within the search space. Algorithms for a genetic algorithm, simulated annealing, and random hill climbing are formulated and tested on a same-sample forest-planning problem where the adjacency rule is strictly enforced. Each method was randomly started 20 times and allowed to run for 10,000 iterations. All three algorithms identified good solutions (within 3% of the highest found), however, simulated annealing consistently produced superior solutions. Simulated annealing and random hill climbing were approximately 10 times faster than the genetic algorithm because only one solution needs to be modified at each iteration. Performance of simulated annealing was essentially independent of the starting point, giving it an important advantage over random hill climbing. The genetic algorithm was not well suited to the strict adjacency problem because considerable computation time was necessary to repair the damage caused during crossover.  相似文献   
567.
应用五因子二次正交旋转回归试验设计,建立了微生物谷氨酰胺转胺酶 (TG)发酵生产过程中以酶活力和菌体细胞生长量作为目标函数的数学模型,并以此模型对链霉菌 (Streptomycessp. )WJS-825菌株发酵生产TG的培养条件进行优化,确定了影响TG生产的主要因子及其最适取值为多价胨 2. 1%、可溶性淀粉 1. 5%、初始pH 7. 0及培养温度 30℃.以该优化工艺条件进行了 5L发酵罐小试和 200L发酵规模的中试生产.结果表明,在中试发酵生产中使用以豆饼粉部分替代多价胨的经济性发酵优化培养基,以及发酵过程中在线监控pH、溶氧系数等多项发酵调控参数,并分段控制pH、温度、通气量和搅拌转速以及进行适时的流加补充碳源,该菌株生长繁殖能力强、产酶效果好,TG活性达 3. 2u/mL,而且连续重复的中试发酵生产试验的TG产量均稳定在 3. 2u/mL以上. 图 2表 3参 15  相似文献   
568.
Use of Traditional Ecological Knowledge in Marine Conservation   总被引:6,自引:0,他引:6  
Abstract:  Traditional ecological knowledge (TEK) represents multiple bodies of knowledge accumulated through many generations of close interactions between people and the natural world. TEK and its application via customary ecological management plans can be useful in modern conservation programs. I disaggregate the term TEK into its constituent parts and show several ways in which TEK can strengthen research designs by increasing locality-specific knowledge, including environmental linkages occurring in those localities. Examples of the uses of TEK in conservation include folk taxonomy in systematics in Micronesia, species knowledge for conservation in Kiribati, and fishers' knowledge of ecological interactions for reserve design in Belize. When conservationists recognize the utility of TEK, they can engage in an equitable exchange of knowledge and foster shared responsibility with indigenous people. These types of exchanges can also provide an opportunity for indigenous people to develop a scientific infrastructure.  相似文献   
569.
对一个 5 0 0 0t a的黄磷电炉的尾气回收系统的设计进行了全面的安全分析 ,指出了其中存在的不足。在此基础上 ,提出了一个改进的设计方案 ,新的设计在生产应用中取得了明显的成效 ,安全性和效益均得到明显的提高。  相似文献   
570.
介绍了以微计算机为核心的中文智能型pH在线监控仪的软硬件结构、系统配置模式,及多个废水处理工程中pH监控系统的设计思路和小试的工艺流程。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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