基于微电压调节的太阳能充放电系统设计

基于微电压调节的太阳能充放电系统,是以微控制器LPC1114为核心的太阳能电池板充放电电路,是实现高效率的智能充放电设计方案。微电压调节理论整合了经典电压回授法和多种太阳能最大功率点追踪思想,利用简单合理的DC／DC平衡技术,充分考虑系统功耗等问题,以简单的电路设计和创新的软件思想实现更高效率的太阳能系统。随着能源危机的加剧,高效率、低成本的太阳能系统备受社会关注,其在民用、交通等领域的运用也更加重要。     

自适应变步长最大风能捕获算法

风能具有随机性、不稳定性的特点,为了提高风力发电系统中风能的利用效率,在比较各种最大风能捕获算法的基础上,分析了爬山搜索法和叶尖速比法的不足,提出了自适应变步长搜索算法来捕获最大风能.通过改进爬山搜索法的变步长策略,明显加快了搜索速度,通过引入初始估计叶尖速比值,大大缩小了搜索范围.该算法不需要实时检测准确风速,不依赖风力机最佳功率曲线,有效地降低了成本,提高风力发电的效率.文中重点分析了算法的自适应性和变步长策略,仿真结果表明,该算法能够使风力机更快速到达最大功率点,动态响应快,收敛性好.     

探海侯之死

在北京团城的城台上,有几株古松,相传是辽金遗物。清代乾隆皇帝给三棵古树封赐了爵位。十多年前,团城搞修缮,建筑队的某位工人把生石灰堆在名为“探海侯”的松树周围,生石灰化光了,古树死了。     

How to find Steiner minimal trees in euclideand-space

This paper has two purposes. The first is to present a new way to find a Steiner minimum tree (SMT) connectingN sites ind-space,d >- 2. We present (in Appendix 1) a computer code for this purpose. This is the only procedure known to the author for finding Steiner minimal trees ind-space ford > 2, and also the first one which fits naturally into the framework of backtracking and branch-and-bound. Finding SMTs of up toN = 12 general sites ind-space (for anyd) now appears feasible.We tabulate Steiner minimal trees for many point sets, including the vertices of most of the regular and Archimedeand-polytopes with <- 16 vertices. As a consequence of these tables, the Gilbert-Pollak conjecture is shown to be false in dimensions 3–9. (The conjecture remains open in other dimensions; it is probably false in all dimensionsd withd 3, but it is probably true whend = 2.)The second purpose is to present some new theoretical results regarding the asymptotic computational complexity of finding SMTs to precision .We show that in two-dimensions, Steiner minimum trees may be found exactly in exponential time O(C ^N ) on a real RAM. (All previous provable time bounds were superexponential.) If the tree is only wanted to precision , then there is an (N/)^O(N)-time algorithm, which is subexponential if 1/ grows only polynomially withN. Also, therectilinear Steiner minimal tree ofN points in the plane may be found inN ^O(N) time.J. S. Provan devised an O(N ⁶/⁴)-time algorithm for finding the SMT of a convexN-point set in the plane. (Also the rectilinear SMT of such a set may be found in O(N ⁶) time.) One therefore suspects that this problem may be solved exactly in polynomial time. We show that this suspicion is in fact true—if a certain conjecture about the size of Steiner sensitivity diagrams is correct.All of these algorithms are for a real RAM model of computation allowing infinite precision arithmetic. They make no probabilistic or other assumptions about the input; the time bounds are valid in the worst case; and all our algorithms may be implemented with a polynomial amount of space. Only algorithms yielding theexact optimum SMT, or trees with lengths (1 + ) × optimum, where is arbitrarily small, are considered here.     

A Further Comparison of Splitting Rules for Decision-Tree Induction

One approach to learning classification rules from examples is to build decision trees. A review and comparison paper by Mingers (Mingers, 1989) looked at the first stage of tree building, which uses a splitting rule to grow trees with a greedy recursive partitioning algorithm. That paper considered a number of different measures and experimentally examined their behavior on four domains. The main conclusion was that a random splitting rule does not significantly decrease classificational accuracy. This note suggests an alternative experimental method and presents additional results on further domains. Our results indicate that random splitting leads to increased error. These results are at variance with those presented by Mingers.     

Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.     

基于MODWT和BP神经网络的微电网故障诊断方法

近年来,随着微电网技术的持续发展,电力用户对其供电可靠性的要求也不断提高,因此微电网故障诊断研究也变得越来越重要。提出了一种基于极大重叠离散小波变换(MODWT)和反向传播(BP)神经网络的微电网故障诊断新方法,并通过仿真与算例进行了验证。结果表明:该方法能快速、准确地识别出故障类型,且不受故障初始相位角和过渡电阻等因素的影响;与现有的基于离散小波变换和反向传播神经网络的诊断方法相比所提出的方法可以提供更好的故障分类精度。     

敏捷化AIOps框架及运维数据质量评估方法

敏捷化智能运维(AIOps)框架将模型构建提前至测试阶段,利用该阶段产生的监控数据代替线上采集的数据以训练AIOps模型,进而实现智能运维的早开发与早使用. 运维数据质量评估方法通过最大均值差异度量方式,分别在健康评估与故障诊断运维场景下对训练数据分别进行趋势性、阶段性、可检测性及可诊断性评估,以预估数据对模型的适用性. 基于华为技术有限公司提供的测试环境设置测试用例并构建实验数据集,在该数据集上的实验结果验证了敏捷化AIOps框架的可行性及数据质量评估方法的有效性.     

陈垃圾滚筒筛运动模式与筛分效率优化

推导陈垃圾在滚筒筛中的运动方程并求数值解,按最大位置角将陈垃圾运动模式划分成滚落、抛落、圆周运动,给出不同筛筒转速、半径、动摩擦因数下的运动模式判别云图. 滚筒筛试验结果显示,陈垃圾运动的最大位置角随转速的升高先增大后不变,转速超过50 r/min后垃圾进行圆周运动. 陈垃圾滚筒筛的筛分效率随转速增大呈先升后降的趋势,随抛落差的增大呈持续上升的趋势,随着原料水的质量分数的增加呈下降的趋势. 基于试验结果,给出滚筒筛最优转速取值云图,在实际工程中可根据垃圾动摩擦因数及滚筒半径选择最优转速,同时减小水的质量分数以提高筛分效率.     

快速的层次树集合分划编码算法*

设计了一个改进算法,它仅需对小波分解矩阵进行一遍扫描即可确定层次树集合分划编码(SPIHT)算法所需的所有D(i,j)和L(i,j)重要性并完成对所有(i,j)子系数的编码,使得按照SPIHT的排序方法编码时只需查找存放D(i,j)和L(i,j)的重要性及(i,j)子系数的编码表,从而大大提高了SPIHT的编码速度.