灯泡贯流式电站机组多水头协联优化与负荷寻优

为验证某灯泡贯流式电站机组协联关系是否存在优化空间,本文以某电站2号机组为研究对象,选取3个水头开展相对效率试验,在机组稳定性无明显突变的前提下,从机组效率及功率最大化考虑,电站在临界弃水状态附近,以追求功率最大化优化协联关系,桨叶开度以增加为主;高水头时因电站无法持续满负荷运行,以优化效率为主,低负荷工况下桨叶开度增加后相对效率同步提升,高负荷工况则降低桨叶开度以提升相对效率。此外,交叉类型的协联关系不会引起调速器协联关系计算的逻辑错误,可为同类双调机组进一步优化协联关系提供指导。

基于仿真的供应链协作优化

供应链协作是供应链成员企业之间的一种复杂的博弈行为,由于供应链协作的非线性和不确定性,本文提出采用仿真技术对供应链系统进行仿真研究。在构建的虚拟供应链的基础上,选取Witness作为仿真工具,通过模型的运行结果分析出供应链系统中的"瓶颈"和导致供应链缺乏协作的原因,从而提出有效的加强供应链协作的策略,并通过设置模型中的参数对供应链系统进行改善,以达到提高供应链运作效率、优化供应链协作的目的。

灯泡贯流式机组协联优化试验分析

灯泡贯流式机组具有低水头、大流量的特点,运行中导桨叶协联关系对机组的运行效率及稳定性影响较大。本文针对某灯泡贯流式机组开展了真机协联优化试验分析,通过真机试验对机组的协联曲线进行了优化,提高了水轮机出力及效率,改善了机组的运行稳定性。

协联优化对轴流转浆式水轮发电机组运行稳定性的影响

一系列的试验研究表明,通过协联优化能成功消除轴流式水轮机组的异常振动、明显提高水轮机的效率。结合某电站一起轴流式水轮机组的异常振动处理,介绍了诊断分析及处理过程,为研究改善该类型水轮机组运行稳定性状态的方法提供了依据。

洪江水电厂3号水轮机协联优化试验分析

洪江水电厂3号水轮机自投产以来就存在效率偏低及水头较低时无法带至额定功率的状况,电厂运行数据显示:3号机在与其他机组带相同负荷的情况下,导叶开度、桨叶开度均比其他机组大,给电厂造成了经济上的损失。针对3号机组效率偏低问题,洪江电厂通过对导桨叶叶型开口的测量及真机试验发现其主要原因是协联关系并非最优,为此洪江电厂组织开展了多水头下的水轮机现场协联优化试验研究,优化了水轮机的协联关系,提升了水轮机效率,并改善了机组运行稳定性。

广州市城镇居民可支配收入与消费支出实证研究——基于优化的协整模型

基于优化的协整模型,以广州市2005-2011年城镇居民人均可支配收入和人均消费支出的季度数据为样本,对广州市各个季度人均可支配收入和人均消费支出的数量关系进行实证研究。研究表明广州市人均可支配收入和人均消费支出时间系列是一阶单整系列,存在着很强的协整关系,并且两者之间表现出很强的双向因果关系;还有误差修正项都符合反向修正作用,反映出了人均可支配收入和消费性支出之间有较强的反向相互调节作用,并且保持长时期的均衡关系。

优化低负荷段协联参数改善灯泡贯流式水电机组性能

灯泡贯流式机组的协联曲线直接影响到水轮机运行效率和稳定性。制造厂提供的协联参数固然是重要的参考,但需要经过现场试验验证。本文对紫兰坝电站1F机组协联参数进行优化,优化后不仅满足了一次调频性能的要求,而且改善了机组的稳定性,提高了水轮机组的发电效率,在实际运行过程中,机组发电效率平均提高达4.5%,为电厂取得了良好的经济效益。

灯泡贯流式机组低负荷协联优化与实践

本文通过采用固定导叶开度改变桨叶开度的协联测试方式,对机组8m和9m水头段不同阶段的协联关系进行了分析。综合机组出力和稳定性因素,改善了机组低负荷区域的主要振动测点随负荷的变化趋势,明显降低了各测点的振动幅值,机组运行稳定性和部分工况下的出力均达到最优。

电磁力作用下绕流减阻与优化控制

电介质溶液中,电磁场产生的Lorentz力可以控制流体的运动。将其用于钝体绕流时,可以减少阻力、抑制分离和消除涡街。为了使这种控制更加经济和有效,电磁场的强度即控制强度,应当是优化的,随流场实时调正的。基于优化控制理论,以圆柱绕流的电磁优化控制为例,推导了流场电磁控制的性能指标表达式和协态方程,并对雷诺数Re为200流场的非线性优化控制问题进行了数值研究,流场的基本方程为指数极坐标中考虑场力的Navier-Stokes方程,计算采用交替方向隐式格式和快速傅里叶变换格式。得到了优化电磁场强度的变化规律,讨论了该优化控制下,流场和圆柱表面阻力和升力的变化过程。研究结果表明,通过优化控制,可以达到减少阻力、抑制分离和消除涡街及涡生振荡的目的。

大型轴流转桨式机组导叶和桨叶协联关系探讨

轴流转桨式水轮机存在的导叶和桨叶的协联关系,对机组出力效率、摆动、振动等数据至关重要。本文从机组在不同工况下、不同水头下,导叶和桨叶两者的配合关系入手,说明了导叶和桨叶协联关系的实现方法及其配合关系的要点,总结了多个大型轴流转桨机组调试和控制改进的实际经验,提出了该类型机组在运行、维护、优化等方面的改进方法和意见。希望能为今后大型轴流转桨式机组在协联关系优化、调速器控制方式改进、防抬机措施等方面提供借鉴。

Static and dynamic collaborative optimization of ship hull structure

The goal of this effort was to provide a static and dynamic collaborative optimization （CO） model for the design of ship hull structure. The CO model integrated with static, mode and dynamic analyses. In the system-level optimization model, a new objective function was advised, integrating all the subsystem-levels＇ objective functions, so as to eliminate the effects of dimensions and magnitude order. The proposed CO architecture enabled multi-objectives of the system and subsystem-level to be considered at both levels during optimization. A bi-level optimization strategy was advised, using the multi-island genetic algorithm. The proposed model was demonstrated with a deck optimization problem of container ship stern. The analysis progress and results of example show that the CO strategy is not only feasible and reliable, but also well suited for use in actual optimization problems of ship design.

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Co-evolutionary cloud-based attribute ensemble multi-agent reduction algorithm

In order to improve the performance of the attribute reduction algorithm to deal with the noisy and uncertain large data, a novel co-evolutionary cloud-based attribute ensemble multi-agent reduction（CCAEMR） algorithm is proposed.First, a co-evolutionary cloud framework is designed under the M apReduce mechanism to divide the entire population into different co-evolutionary subpopulations with a self-adaptive scale. Meanwhile, these subpopulations will share their rewards to accelerate attribute reduction implementation.Secondly, a multi-agent ensemble strategy of co-evolutionary elitist optimization is constructed to ensure that subpopulations can exploit any correlation and interdependency between interacting attribute subsets with reinforcing noise tolerance.Hence, these agents are kept within the stable elitist region to achieve the optimal profit. The experimental results show that the proposed CCAEMR algorithm has better efficiency and feasibility to solve large-scale and uncertain dataset problems with complex noise.

远程信息集中:优化非对称经济1→3相位协变克隆之逆

研究基于优化非对称经济1→3相位协变克隆的远程信息集中问题.首先,以最大纠缠W型态为量子信道,分别通过投影测量和半正定算子值测量,给出了两个远程信息集中协议,以非最大纠缠W型态为量子信道,将上述协议进行了推广.其次,通过投影测量,并分别以最大纠缠GHZ型态和四粒子团簇态为量子信道,提出了两个远程信息集中方案.当以最大纠缠GHZ型态为量子信道时,远程信息集中成功的概率总为1;而以W型态或团簇态为量子信道、信息集中成功的概率呈现出克隆态或量子信道之参数的函数形式.在以GHZ型态、团簇态和W型态这三种态为量子信道的信息集中协议中,前者之恢复操作最简单,第三个的恢复操作最复杂.最后,指出了上述协议都是安全和实验实现的.

Coordinated optimization setting of reagent dosages in roughing-scavenging process of antimony flotation

Considering the influence of reagent adjustment in different flotation bank on the final production index and the difficulty of establishing an effective mathematical model,a coordinated optimization method for dosage reagent based on key characteristics variation tendency and case-based reasoning is proposed.On the basis of the expert reagent regulation method in antimony flotation process,the reagent dosage pre-setting model of the roughing–scavenging bank is constructed based on case-based reasoning.Then,the sensitivity index is used to calculate the key features of reagent dosage.The reagent dosage compensation model is constructed based on the variation tendency of the key features in the roughing and scavenging process.At last,the prediction model is used to finish the classification and discriminant analysis.The simulation results and industrial experiment in antimony flotation process show that the proposed method reduces fluctuation of the tailings indicators and the cost of reagent dosage.It can lay a foundation for optimizing the whole process of flotation.

Hardware Optimization Technique of Full-Customized HW/SW Co-Design

The hardware optimization technique of mono similarity system generation is presented based on hardware/software(HW/SW) co design.First,the coarse structure of sub graphs' matching based on full customized HW/SW co design is put forward.Then,a universal sub graphs' combination method is discussed.Next,a more advanced vertexes' compression algorithm based on sub graphs' combination method is discussed with great emphasis.Experiments are done successfully with perfect results verifying all the formulas and the methods above.

Hierarchical Algorithms of Large-Scale Systems with Nonseparable Multiobjective

A class of large-scale hierarchical control systems is considered, the overall objective function is a nonlinear and nonseparable function of multiple quadratic performance indices.The separation strategy of the multiobjective optimization technique and the three-level objective coordination method are applied to the large -sacle systems, and a four-level hierarchical algorithms of optimization control is obtained.

A discrete multi-swarm optimizer for radio frequency identification network scheduling

Due to the effectiveness, simple deployment and low cost, radio frequency identification （RFID） systems are used in a variety of applications to uniquely identify physical objects. The operation of RFID systems often involves a situation in which multiple readers physically located near one another may interfere with one another＇s operation. Such reader collision must be minimized to avoid the faulty or miss reads. Specifically, scheduling the colliding RFID readers to reduce the total system transaction time or response time is the challenging problem for large-scale RFID network deployment. Therefore, the aim of this work is to use a successful multi-swarm cooperative optimizer called pseo to minimize both the reader-to-reader interference and total system transaction time in RFID reader networks. The main idea of pS20 is to extend the single population PSO to the interacting multi-swarm model by constructing hierarchical interaction topology and enhanced dynamical update equations. As the RFID network scheduling model formulated in this work is a discrete problem, a binary version of PS20 algorithm is proposed. With seven discrete benchmark functions, PS20 is proved to have significantly better performance than the original PSO and a binary genetic algorithm, pS20 is then used for solving the real-world RFID network scheduling problem. Numerical results for four test cases with different scales, ranging from 30 to 200 readers, demonstrate the performance of the proposed methodology.

洪江电厂3~#机组出力偏低原因分析及处理措施

针对洪江电厂3#机组在相同运行环境下较其他5台机组出力偏低的问题,采用理论分析与现场测试的方法,系统研究了影响灯泡贯流式机组效率和出力的因素,查明了3#机组出力偏低的主要原因。通过桨叶转角调整及协联优化,解决了3#机组出力偏低的问题,产生了一定的经济效益。所得成果可供相关研究人员参考。

Two-Hop Gaussian Relay Channel with Linear Relaying： Achievable Rate and Optimization Design

The relay node with linear relaying transmits the linear combination of its past received signals.The optimization of two-hop relay channel with linear relaying is discussed in this paper.The capacity for the two-hop Gaussian relay channel with linear relaying is derived,which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the source.It is proved that the solution to this optimization problem is equivalent to a "single-letter" optimization problem.We also show that the solution to this "single-letter" optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward(TSAF).In order to solve this equivalent problem,we proposed an iterative algorithm.Simulation results show that if channel gain of one hop is relatively smaller,the achievable rate with TSAF is closer to the max-flow min-cut capacity bound,but at a lower complexity.