绿色设计与绿色化学设计

根据绿色设计的基本定义，特点，过程与原则，将绿色设计与传统设计与进行比较，阐述绿色化学设计的主要内容。     

A/A/O微曝氧化沟处理城市污水的工程设计

以某日处理量为80 000 m3城市污水处理厂为例,介绍了A/A/O微曝氧化沟工艺的设计思路及参数选择,能够满足设计要求,且可信度高,有实用参考价值.     

均匀设计法处理含硫废水的研究

对钠盐型和铵盐型含硫工业废水进行脱硫处理,采用均匀设计法设计试验,得到定量描述试验内在规律的多元非线性回归方程.用该回归方程计算的预测值与试验结果一致.对影响脱硫效果和脱硫效率的影响因素--絮凝剂投加量、pH以及废水含硫量进行了考察.利用回归方程,对反应体系进行了模拟优化处理.研究表明,在试验条件下,用聚合氯化铝作为絮凝剂、pH=7的条件下,采用两段工艺,可以使脱硫后废水含硫量降至40 mg/L以下,满足下游污水处理装置对含硫量的要求.     

Conservation Strategies for Endemic Fish Species Threatened by the Three Gorges Dam

Abstract:   The largest damming project to date, the Three Gorges Dam has been built along the Yangtze River (China), the most species-rich river in the Palearctic region. Among 162 species of fish inhabiting the main channel of the upper Yangtze, 44 are endemic and are therefore under serious threat of global extinction from the dam. Accordingly, it is urgently necessary to develop strategies to minimize the impacts of the drastic environmental changes associated with the dam. We sought to identify potential reserves for the endemic species among the 17 tributaries in the upper Yangtze, based on presence/absence data for the 44 endemic species. Potential reserves for the endemic species were identified by characterizing the distribution patterns of endemic species with an adaptive learning algorithm called a "self-organizing map" (SOM). Using this method, we also predicted occurrence probabilities of species in potential reserves based on the distribution patterns of communities. Considering both SOM model results and actual knowledge of the biology of the considered species, our results suggested that 24 species may survive in the tributaries, 14 have an uncertain future, and 6 have a high probability of becoming extinct after dam filling.     

Designing an efficient adaptive cluster sample

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.     

特变电工衡阳变压器有限公司环境景观设计构思

~~特变电工衡阳变压器有限公司环境景观设计构思@陈盛彬$湖南环境生物职业技术学院园林系!湖南衡阳421005 @陈景$湖南环境生物职业技术学院园林系!湖南衡阳421005 @谢振华$衡南县林业局!湖南衡阳421005~~~~~~     

Green payments and dual policy goals

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.     

粘贴碳纤维布在钢筋混凝土梁加固中的应用

介绍了采用碳纤维布加固钢筋混凝土框架梁正截面、斜截面的设计计算及施工步骤,为了验证加固效果,对加固后的钢筋混凝土梁进行了现场静载检测,结果表明:该加固方案切实有效.图4,表2,参6.     

Optimisation algorithms for spatially constrained forest planning

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.