双因素和需求理论在和谐工会建设中的探索型应用

在工会工作中,应用双因素和需求理论,即赫茨伯格的激励因素、保健因素理论和马斯洛的需求层次理论,以单位员工需求为导向,以人为本地开展工作,为全体干部员工创建一个和谐环境。本文从和谐工会的内涵和双因素、需要层次理论内容为起点,充分认识工会在构建和谐社会中的重要历史地位和作用,由浅入深地探讨了在先进理论引导下构建和谐工会的方法和思路,本研究对构建和谐工会具有很强的现实指导意义。     

Dual watermark for image tamper detection and recovery

An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large.     

基于最大互信息指标的对偶控制研究

针对参数未知但恒定的随机系统, 研究了基于最大互信息指标的对偶控制. 运用了Kalman滤波器估计随机系统未知参数的方法; 研究了最大互信息指标所具有的对偶特性, 即跟踪理想的目标以及探测未知参数的不确定性; 采用了两级优化算法获得次优对偶控制律. 算例验证了此算法的有效性和可行性.     

类算法在保险行业的运用与分析

聚类分析是数据挖掘中的非常重要的技术,通过对数据挖掘中常用聚类算法的分类分析比较,使得人们在实际应用中能方便、快捷地找到最好的聚类算法以解决实际问题,然后通过一个实例运用聚类来进行分析和实践。     

基于双种群的小生境差分进化算法

将非线性方程组的求解问题转化为函数优化问题,当方程组有多个解时,它的适应值函数就是具有多个最优解的多峰函数.为此,提出了基于双种群的小生境差分进化算法.在该算法中,进化在两个不同的子群间并行进行,通过使用不同的变异策略,实现种群在解空间具有尽可能分散的探索能力的同时在局部具有尽可能细致的搜索能力.通过子群重组实现子群间的信息交换,然后引入小生境淘汰机制.对典型测试函数的优化结果表明,该算法能找到全部解,而且精度好.     

基于二重差分法的光流场运动检测

对视频图像序列中运动目标的检测,是计算机视觉领域长期关注的问题.传统的Horn-Schunck光流算法非常耗时,不利于在视频图像序列中做实时分析,故提出采用结合背景差分法与帧间差分法的二重差分法(DS)来做光流算法的预处理.实验结果也表明二重差分法的光流算法(DSOF)比单纯用Horn-Schunck方法计算光流效率更高,用时更短,能更好地满足对视频图像序列做实时运动检测分析的需求.     

功率受限的无线网络的传输速率控制

无线自组织网络是没有预置基础设施支撑的自组织可重构的自治网络.由于需要克服远近效应问题、干扰问题以及提高信道的空间复用度,并且为了降低网络节点的能耗,提高网络的生存时间和系统的能量效率,网络节点的发射功率受到限制.因此,如何在功率受限的情况下保证网络数据传榆性能,成为无线网络的关键问题.提出了功率受限的无线自组织网络模型,该模型用发送功率的凸函数作为度量效用的指标之一,更加贴切地反映了网络节点功率受限的特点.采用对偶分解的方法求解模型,得到分布式算法,协调节点的传输功率和数据速率,达到全网效用最大化.最后用具体的拓扑和效用函数进行仿真,验证了算法的收敛性,并考察传输速率和功率的关系对网络性能的影响.     

Solving the Beck and Wieland model with optimal experimentation in DualPC

Currently, there is a renewed interest in the use of optimal experimentation (adaptive control) in economics. Example are found in [Amman and Kendrick, 1999], [Amman and Kendrick, 2003], [Cosimano, in?press], [Cosimano and Gapen, 2005b], [Cosimano and Gapen, 2005a], [Cosimano and Gapen, 2006], [Tesfaselassie et?al., 2007], [Tucci, 1997], [Wieland, 2000a] and [Wieland, 2000b]. In this paper we present the Beck & Wieland model [Beck, G., & Wieland, V. (2002). Learning and control in a changing economic environment. Journal of Economic Dynamics and Control, 26, 1359-1378] and the methodology to solve this model with time-varying parameters using the various control methods described in [Kendrick, 1981] and [Kendrick, 2002]. Furthermore, we also provide numerical results using the DualPC software [Amman, H. M., & Kendrick, D. A. (1999). The DualI/DualPC software for optimal control models: User’s guide. Working paper, Austin, TX 78712, USA: Center for Applied Research in Economics, University of Texas] and show first evidence that optimal experimentation or Dual Control may produce better results than Expected Optimal Feedback.     

Weight distribution and dual distance

Several results in coding theory (e.g. the Carlitz-Uchiyama bound) show that the weight distributions of certain algebraic codes of lengthn are concentrated aroundn/2 within a range of width n. It is proved in this article that the extreme weights of a linear binary code of sufficiently high dual distance cannot be too close ton/2, the gap being of order n. The tools used involve the Pless identities and the orthogonality properties of Krawtchouk polynomials, as well as estimates on their zeroes. As a by-product upper bounds on the minimum distance of self-dual binary codes are derived.     

3D-line clipping algorithms — a comparative study

Some well-known line-polyhedron intersection methods are summed up and new accelerating modifications presented. Results of comparison of known and newly developed methods are included. New methods use the fact that each line can be described as the intersection of two planes.