A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.     

Algorithm for finding all k nearest neighbors

A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering.     

光学分数傅里叶逆变换的无透镜模式

用波前相因子判断法，将球面波照明物体的自由空间菲涅耳衍射光场分布与分数傅里叶逆变换的标准频谱分布进行位相比较，提供了广义条件下光学分数傅里叶逆变换的无透镜模式，给出其光学实现基本单元参量选择的判定法则，计算机模拟实验证明了结论的可靠与可行。     

Scaffolded writing and rewriting in the discipline: A web-based reciprocal peer review system

This paper describes how SWoRD (scaffolded writing and rewriting in the discipline), a web-based reciprocal peer review system, supports writing practice, particularly for large content courses in which writing is considered critical but not feasibly included. To help students gain content knowledge as well as writing and reviewing skills, SWoRD supports the whole cycle of writing, reviews, back-reviews, and rewriting by scaffolding the journal publication process as its authentic practice model. In addition, SWoRD includes algorithms that compute individual reviewer’s review accuracy, which is in turn used to support the various drawbacks of reciprocal peer reviews (e.g., variation in motivation or ability of reviewers). Finally, this paper describes an empirical evaluation showing that the SWoRD approach is effective in improving writing quality in content classes.     

利用最小熵法预测高频拓宽频带

本根据最小熵观点给出了预测高频成分拓宽频带的方法，实际效果表明，该方法是一种拓宽频带的有效方法。     

Least mean p-power error criterion for adaptive FIR filter

An adaptive FIR filter based on the least mean p-power error (MPE) criterion is investigated. First, some useful properties of MPE function are studied. Three main results are as follows: 1) MPE function is a convex function of filter coefficients; so it has no local minima. 2) When input process and desired process are both Gaussian processes, then MPE function has the same optimum solution as the conventional Wiener solution for any p. 3) When input process and desired process are non-Gaussian processes, then MPE function may have better optimum solution than Wiener solution. Next, a least mean p-power (LMP) error adaptive algorithm is derived and some application examples are presented. Consequently, when the signal is corrupted by an impulsive noise, the adaptive algorithm with p=1 is preferred. Furthermore, when the signal is corrupted by noise or interference, the adaptive algorithm with proper choice of p may be preferred     

Generalized eigenvectors and fractionalization of offset DFTs and DCTs

The offset discrete Fourier transform (DFT) is a discrete transform with kernel exp[-j2/spl pi/(m-a)(n-b)/N]. It is more generalized and flexible than the original DFT and has very close relations with the discrete cosine transform (DCT) of type 4 (DCT-IV), DCT-VIII, discrete sine transform (DST)-IV, DST-VIII, and discrete Hartley transform (DHT)-IV. In this paper, we derive the eigenvectors/eigenvalues of the offset DFT, especially for the case where a+b is an integer. By convolution theorem, we can derive the close form eigenvector sets of the offset DFT when a+b is an integer. We also show the general form of the eigenvectors in this case. Then, we use the eigenvectors/eigenvalues of the offset DFT to derive the eigenvectors/eigenvalues of the DCT-IV, DCT-VIII, DST-IV, DST-VIII, and DHT-IV. After the eigenvectors/eigenvalues are derived, we can use the eigenvectors-decomposition method to derive the fractional operations of the offset DFT, DCT-IV, DCT-VIII, DST-IV, DST-VIII, and DHT-IV. These fractional operations are more flexible than the original ones and can be used for filter design, data compression, encryption, and watermarking, etc.     

职业道德建设的调查与思考

近年来各行各业加强职业道德建设,取得了一定成绩,涌现了一大批敬业爱岗、服务社会的岗位明星,但也存在着这样或那样的认识误区或现实局限,如形式主义、短期行为和领导观念异位等,这极大地阻碍了职业道德建设的深入推进。职业道德建设就其特征而言,它具有长期性、时代性和阶级性、相对稳定性以及创新性等属性,对此需要有一个理智而清晰的认识。应从营造良好的社会氛围、制定切实可行的道德准则、进行规范化的教育引导和发挥先进人物的示范作用等几方面入手,把职业道德建设推向深入。