人力资源的预测方法

人力资源规划是必不可少的管理环节．科学的人力资源规划，必须建立在对人员供、需的准确预测的基础上．本文讨论人力资源预测的问题和转移矩阵等方法的使用．     

Optical current transducer with bulk type Bi12SiO20 faraday sensor for power systems

Two types of optical current transducers (OCTs) have a bulk Faraday sensor inserted into the gap of an iron core and a porcelain insulator with optical fiber. The sensor consists of Bi₁₂SiO₂₀ (BSO) single crystal, a polarizer, and an analyzer. The OCTs satisfied the target performance requirement for fault location and metering and demonstrated maintained performance at some power utilities in Japan and the US. We have developed a fault location system that immediately detects the fault current with the OCTs, there by locating the fault section. The OCT can easily replace the existing support insulators for the disconnecting switch without any modifications to structure height or bus-bar. For metering requiring 0.3% class accuracy, use of a BSO with right optical rotatory power combined with BSO with left optical rotatory power results in a Faraday sensor with improved temperature characteristics. The OCT demonstrated 0.3% class accuracy for metering described in the current transformer Specifications of IEEE C57–13, 1993.     

转动喇曼散射截面的群论计算

本文利用群链U(4)U(3)O(3)描述双原子分子N_2和O_2振转谱的对称性质,并利用群论方法计算了N_2和O_2分子转动喇曼散射的跃迁矩阵元,给出了它们的转动喇曼散射的截面。结果与实验较好地符合。     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

Transfer matrix approach of vibration isolation analysis of periodic composite structure

The transmission properties of elastic waves propagating in a three-dimensional composite structure embedded periodically with spherical inclusions are analyzed by the transfer matrix method in this paper. Firstly, the periodic composite structures are divided into many layers, the transfer matrix of monolayer structure is deduced by the wave equations, and the transfer matrix of the entire structure is obtained in the case of boundary conditions of displacement and stress continuity between layers. Then, the effective impedance of the structure is analyzed to calculate its reflectivity and transmissivity of vibration isolation. Finally, numerical simulation is carried out; the experiment results validate the accuracy and feasibility of the method adopted in the paper and some useful conclusions are obtained. Project (No. 50075029) supported by the National Natural Science Foundation of China.     

Regularization of singular systems of linear algebraic equations by shifts

Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived.     

多线性Calderón-Zygmund算子的加权有界性

建立了多线性Calderón-Zygmund算子在比幂权空间更一般的Herz空间和Herz型Hardy空间上的有界性.作为推论,得到了该算子的幂权估计.在这些幂权估计中,权指标可以突破Ap权的指标限制,显示出和经典Calderón-Zygmund算子本质的区别.     

基于矩阵初等变换的n元函数极值的快速判别法

给出了 n元函数极值的一个充分条件 ,并结合矩阵的初等变换建立了 n元函数极值的一种快速判别法 ,最后给出了一个例子     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.