实行全面质量管理 做好江口水电站工程设计

江口水电站是芙蓉江干流开发中的骨干工程。为认真履行江口工程的设计合同，确保优质、高效地完成江口工程的各项设计工作，长江委设计院实行全面质量管理，建立了一套规范化的统计管理程序，制订详细的设计计划，落实江口工程项目各级责任人的质量责任制，采取特殊技术措施，对工程设计过程中的各项质量活动进行全过程的管理，使江口工程在满足质量标准、合同进度的情况下，工程投资最省。     

江苏省本地电话网结构与发展

分片汇接的网状网结构是江苏省本地电话网的基本框架,而汇接局和连接汇接局的传输系统则是网路规划与通信建设的重点。     

Practical method for generation expansion planning based on dynamic programming

This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology.     

GSM与WCDMA无线网络规划比较

WCDMA与GSM在空中接口上存在较大差异,WCDMA基于码分多址技术,GSM基于时分多址技术。GSM主要处理语音和低速数据,而WCDMA引入了多种速率的数据业务,根据业务的QoS进行资源控制和分配,因此在无线网络规划方法上,WCDMA与GSM存在较大差异。文章从容量规划、覆盖规划、蜂窝布局、规划流程、网络评估等方面对WCDMA与GSM的无线网络规划进行了比较和分析。     

新浦江城规划设计优劣分析

文章通过对上海“新浦江城”首期项目的介绍，分析了意大利设计在该项目应用中的独特之处，同时指出了存在的一些问题。指出国外设计应结合中国国情，符合社会发展的需要。     

模糊规划在炼油厂生产计划优化中的应用

生产计划的编制是炼油化工企业生产经营管理中的一个关键环节，然而由于市场变化的不确定性，使得企业的长远规划制定受到限制，笔者将模糊数学应用于炼厂生产计划的编制，通过模糊规划对炼油企业生产计划进行优化，使编得的生产计划在一定程度上反映市场的变化并使企业的生产效益最优，为企业管理决策者进行长期规划给予指导，给出了实例来说明该方法的可行性。     

各国核电厂场外应急计划的比较

本文分析和比较了各国核电厂的应急计划,特别是场外应急的干予水平和应急计划区,讨论了我国干予水平、核电厂应急计划区和香港核应急计划几个实际问题。     

Programming tool-use actions.

When humans plan to execute a tool-use action, they can only specify the bodily movement parameters by taking into account the external target or goal of the tool-use action and the target-movement mapping implemented by the tool. In this study, the authors used the movement precuing method to investigate how people prepare for actions made with tools. More specifically, they asked whether people would be able to specify the spatial target and the target-movement mapping of the tool-use action independently of each other, and to what degree they would be able to prepare these components in advance. In 3 experiments, they precued either the target or the target-movement mapping of tool-use actions involving either a compatible or an incompatible target-movement mapping. Results indicate that participants benefit from partial advance information about the target-movement mapping, whereas no significant effects were found for precuing the spatial target of the action. These results occurred regardless of whether the target-movement mapping was compatible or incompatible and provide evidence for the notion that the target-movement mapping of a tool-use action is part of its cognitive representation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

基于能力拍卖和多Agent的综合生产计划分布式建模及求解

把拍卖和市场理念引入到生产计划的求解过程中,结合多Agent理论,对大规模生产系统按生产单元建立分布式模型.各个生产单元看作相对独立核算的经济实体,其目标是实现自身利益最大化.当生产能力足够时,按照需求进行生产;当生产能力不足以完全满足需求时,紧缺生产资源的持有者按照单位能力获得最大收益的原则进行生产竞价与拍卖,实现了各个生产单元的分布式自主协商决策,并设计了求解算法.算例研究证明该方法的可操作性和求解的有效性.     

Line balancing in a just-in-time production environment: balancing multiple U-lines

The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.