图像的多尺度几何分析概述*

以函数的稀疏表示为主线,详细介绍了各种多尺度几何分析产生的背景、发展历程和逼近性能,并分析了它们各自存在的优缺点,最后指出了其发展方向.     

基于三维特征向量的非侵入式电热负荷细分算法

非侵入式负荷监测分解（NILMD）技术是当前居民用能服务深化提升和电力供需互动的重要数据获取手段,然而当前工程上应用广泛的事件驱动型NILMD技术一直无法准确细化分解电热负荷。针对这一问题,文中提出了一种基于三维特征向量的典型电热负荷细化分解算法。首先,基于有功、无功功率和电流谐波等电气负荷特征采用事件检测方法提取电热事件,在有功功率的基础上,引入运行时长、频繁启停次数等非电气负荷特征共同构建三维特征向量电器模型。然后,采用序贯覆盖法设计典型电热负荷细化分解命题学习规则和细化分解算法。最后,基于实证实验数据进行分解验证,发现4种典型电热负荷的细化分解准确率超过85%。实验结果表明,文中所提典型电热负荷细化分解算法有效地提高了4种典型电热负荷分解的准确率。     

A NEW ELECTROMAGNETIC IMAGING SCHEME

ＡＮＥＷＥＬＥＣＴＲＯＭＡＧＮＥＴＩＣＩＭＡＧＩＮＧＳＣＨＥＭＥ①ＺｈａｎｇＲｏｎｇｆｅｎｇ，ＨｅＪｉｓｈａｎＣｏｌｅｇｅｏｆＲｅｓｏｕｒｃｅ，ＥｎｖｉｒｏｎｍｅｎｔａｎｄＣｉｖｉｌＥｎｇｉｎｅｒｉｎｇ，ＣｅｎｔｒａｌＳｏｕｔｈＵｎｉｖｅｒｓｉｔｙｏ...     

ANN valuation model of material LCIA profile

Weighting model is the only valuation model of life cycle impact assessment(LCIA) profile now. It simplifies evaluation function into linear function, and makes the determination of weighting factor complicated. Therefore the valuation of LCIA profile is the most critical and controversial step in life cycle assessment(LCA). Development on valuation models, which are understood easily and accepted widely, is urgently needed in the field of LCA.The modeling approaches for the linear evaluation function were summed up. The modeling approaches for the nonlinear evaluation function were set up by function approximation theory, which include choosing preference products, forming preference data, establishing artificial neural network(ANN) and training ANN by preference data.By selecting 7 material products as preference product, experience was done with modeling approaches of the nonlinear evaluation function. The results show that the modeling approaches and valuation model of the nonlinear evaluation function are more practical than the weighting model.     

用WKB方法讨论透射系数和反射系数

本文用WKB近似方法讨论了势垒贯穿问题系数T和其透射反射系数R之和恒等为1,即满足恒等式T R=1,并进一步得出这一结论不仅适用于一般势垒贯穿而且在方势垒贯穿中也成立,最后讨论了势垒贯穿的几种极限情况,例如,h→0(即经典情况),势垒高度v→∞、v→0,势垒宽度a→∞、a→0,等几种特殊情况下的T及R的取值问题。     

Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

We consider the problem of scheduling n jobs in batches on a single parallel-batching machine, where the jobs are partitioned into jobs families and the jobs in each family have the same due date. The objective is to minimize the weighted number of tardy jobs. We first devise an efficient pseudo-polynomial time and a fully polynomial time approximation scheme for the weighted problem. Then we present $O(n^2)$-time and $O(n\log n)$-time algorithms for the case where the jobs have the same weight and for the case where the jobs have the same processing time, respectively.     

A stochastic Kaczmarz algorithm for network tomography

We develop a stochastic approximation version of the classical Kaczmarz algorithm that is incremental in nature and takes as input noisy real time data. Our analysis shows that with probability one it mimics the behavior of the original scheme: starting from the same initial point, our algorithm and the corresponding deterministic Kaczmarz algorithm converge to precisely the same point. The motivation for this work comes from network tomography where network parameters are to be estimated based upon end-to-end measurements. Numerical examples via Matlab based simulations demonstrate the efficacy of the algorithm.     

广义Mamdani模糊系统依K-积分模的泛逼近及其实现过程

首先,通过引入拟减法算子给出K-积分模定义,并针对广义Mamdani模糊系统实施等距剖分其输入空间. 其次,应用分片线性函数（Piecewise linear function,PLF）的性质构造性地证明了广义Mamdani模糊系统在K-积分模意义下具有泛逼近性,从而将该模糊系统对连续函数空间的逼近能力扩展到一类可积函数类空间上. 最后,通过模拟实例给出该广义Mamdani模糊系统对给定可积函数的泛逼近及实现过程.