同杆双回线跨线故障最优跳闸方案

以六序分量法为基础，通过对同杆双回线系统在故障以及故障切除后的非全相运行状态下的最大传输容量的分析，提出了适用于同杆双回线的最优跳闸方案。与目前国内传统跳闸方式相比，该方案可以最大限度地保留系统的传输能力，抑制注入系统的不对称分量，提高系统稳定裕度，为重合闸等自动装置的成功动作创造了条件。动模实验和软件仿真结果验证了该方案的有效性。     

某办公楼高支模的计算及应用

详细介绍了某大楼模板支撑体系的验算过程。     

长洲水利枢纽工程施工导流方案优化

介绍长洲水利枢纽施工原导流方案,在保证施工期通航和满足工程防洪度汛的前提下,对原方案进行优化;简介优化方案,并与原方案比较:优化方案缩短工期,提前发电,节省投资,提高工程整体效益。     

浅谈安康医院的特点与设计

结合新疆兵团公安安康医院综合病房大楼的设计,对安康医院与精神病医院进行了对比,总结了安康医院及使用者的特点,从安全性、封闭性、特殊性等方面,深入探讨了安康医院的设计,可供同行参考。     

基于改进Informer的蒸汽管网流量预测

提出了一种基于改进Informer的蒸汽管网流量预测模型Informer_BEST。该模型通过引入扩展的因果卷积、相对位置和季节特征编码以及梯度中心化技术等3种算法，对Informer模型进行了改进和优化。对5种预测模型进行实验，结果表明，所提出的Informer_BEST预测模型展现了令人满意的测试结果，预测曲线与实际数据的变化趋势相吻合，对供热调度决策具有良好的指导作用。     

黑龙江省旱情信息采集系统设计方案

干旱灾害是黑龙江省最主要的自然灾害之一，每年都给城乡居民生活和工农业生产造成不同程度的影响，严重制约黑龙江省社会经济的正常发展。目前中国的旱情监测体系还很不完善，不能满足当前抗旱减灾的需要，国家防总在前期工程建设经验成果基础上，采用当代国际新技术，加大了建设力度，把旱情信息采集系统作为国家防汛抗旱指挥系统二期工程建设中的重要内容，黑龙江省作为产粮大省，是建设项目的重中之重。旱情信息的特点是信息种类多、涉及部门多、信息来源渠道广。文章介绍了黑龙江省旱情信息采集系统设计方案。     

采煤方法及设备选择决策支持系统的研究

论述了缓倾斜煤层采煤方法选择的评价过程及评价指标，将煤层地质条件评价、可行方案论证、计算机模拟、技术经济分析、模糊评判及多目标评价等方面的内容和方法汇集成完整的数据库、模型库和方法库，建立了具有良好用户界面的缓倾斜煤层采煤方法及设备选择决策支持系统．该系统已在实践中应用．     

A large-time-stepping scheme for balance equations

A well-balanced, large-time-stepping method for conservation laws with source terms is presented. The numerical method is based on a local reformulation of the balance law as a conservation law with a discontinuous flux function, and the approximate solution of this equation by a front tracking method. This yields an unconditionally stable method which is particularly well suited to calculate stationary states. The viability of this approach is demonstrated by several numerical examples. KHK has been supported in part by an Outstanding Young Investigators Award from the Research Council of Norway.     

Retraction of Hard, Lozano, and Tversky (2006).

Reports a retraction of "Hierarchical encoding of behavior: Translating perception into action" by Bridgette Martin Hard, Sandra C. Lozano and Barbara Tversky (Journal of Experimental Psychology: General, 2006[Nov], Vol 135[4], 588-608). All authors retract this article. Co-author Tversky and co-author Hard believe that the research results cannot be relied upon; Sandra C. Lozano takes full responsibility for the need to retract this article. (The following abstract of the original article appeared in record 2006-20327-007.) People encode goal-directed behaviors, such as assembling an object, by segmenting them into discrete actions, organized as goal-subgoal hierarchies. Does hierarchical encoding contribute to observational learning? Participants in 3 experiments segmented an object assembly task into coarse and fine units of action and later performed it themselves. Hierarchical encoding, measured by segmentation patterns, correlated with more accurate and more hierarchically structured performance of the later assembly task. Furthermore, hierarchical encoding increased when participants (a) segmented coarse units first, (b) explicitly looked for hierarchical structure, and (c) described actions while segmenting them. Improving hierarchical encoding always led to improvements in learning, as well as a surprising shift toward encoding and executing actions from the actor's spatial perspective instead of the participants' own. Hierarchical encoding facilitates observational learning by organizing perceived actions into a representation that can serve as an action plan. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A fast iterative scheme for multilevel thresholding methods

The previously published optimal thresholding techniques based on some objective functions are very efficient in the bi-level thresholding case, but they are impractical when extended to multilevel thresholding. The reason for this is their computational complexity which grows exponentially with the number of thresholds. In this paper, an iterative scheme is proposed to render these optimal thresholding techniques more practical. The proposed algorithm starts with a bi-level thresholding, then uses the initial results to obtain higher-order thresholds. This algorithm is iterative and the convergence is proved. We also introduce some useful programming techniques to make the computation more efficient. The proposed algorithm can therefore determine the number of thresholds automatically as well as save a significant amount of computing time.