每日结算价确定方法与股指期货价格发现效率的关系——以HIS指数期货为例

价格发现效率作为价格发现的一项基础研究一直备受理论重视.以价格发现速度作为价格发现效率的代理变量,在总结现有价格发现速度研究的基础上,提出了一般价格发现模型(GPDM).通过GPDM,以HSI指数期货为例,从结算价确定方法对价格发现速度影响的角度,比较了α-温塞平均数法、不完全平均数法、成交量加权平均数法和指数平滑法确定的结算价以及现行结算价的价格发现效率.结果发现,α-温塞平均数法确定的结算价最具价格发现效率,而现行结算价最不具价格发现效率.     

基于禁忌退火粒子群算法的火力分配

火力分配问题是典型的NP完全问题,传统的求解算法存在指数级的时间复杂度。给出具体实用的防空火力分配模型,提出一种基于禁忌搜索与退火粒子群优化的新算法,并针对多种空袭规模的实例进行计算机仿真。仿真结果表明,与禁忌搜索、标准粒子群优化、退火粒子群优化等智能算法相比,新算法在解决火力分配问题时具有更优良的收敛精度和时间性能。     

院校升格与高教系统分层

院校升格与高教系统分层存在一定矛盾,解决的方法是政府从全局出发进行宏观调控,在高教系统引入市场机制的同时,考虑经济发展情况,把握不同层次院校比例,并结合地区差异构建一个合理的分层系统。     

A perspective on fish gonad manipulation for biotechnical applications

Fish make attractive candidates for conducting stud- ies in gene expression, regulation, function, and genetic modification, since they reach sexual maturity rela- tively quickly, are highly fecund, utilize an external fertilization strategy, develop exte…     

Simulation of maximum light use efficiency for some typical vegetation types in China

MAXIMUM LIGHT USE EFFICIENCY(ΕMAX)IS THE USE RATE OF PHOTOSYNTHETICALLY ACTIVE RADIATION BY VEGETATION IN AN IDEAL CONDITION WITHOUT ANY CONSTRAINTS.IT IS A PHYSIOLOGICAL ATTRIBUTE OF PLANT ITSELF.THE VALUE OFΕMAX IS DIFFERENT FOR DIFFERENT VEGETATION TYPES[1―5].IT IS A KEY PARAMETER FOR THE ESTIMATION OF NET PRIMARY PRODUCTIVITY(NPP)DRIVEN WITH REMOTE SENSING DATA.THERE…     

Time-frequency analysis of SH waves in an isotropic plate bordered with one elastic solid layer

Acoustic sensing utilizing shear-horizontal acoustic plate mode (SHAPM) has attracted much interest in recent years[1―3] due to the fact that the absence of the component of the displacement normal to the surface allows each SH mode to propagate in the p…     

Architecture of Trusted PC

This paper, focusing on the trusted computing group＇s standards, explained the key concept of trusted compuling and provided the architecture of trusted PC. It built trust bottom-up by starting with trusted hardware and adding layers of trusted software. It is a system-level solution available to all applications running on the member platforms. This solution reduces the security burden on applications and thus simplifies application programming.     

The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences

The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

Effect of Starch Sources on the Release Rates of Herbicides Encapsulated

The effects of starch sources on the behaviors of starch matrices and on the rates of herbicides released from the matrices were studied for slow release. The starches considered include native corn starch, wheat starch, potato starch and cassava starch. The matrices were prepared through encapsulating 2,4-dichlorophenoxyacetic or 2,4,5 trichlorophenoxyacetic acids as model herbicides with hot-gelatinized starch pastes. The encapsulation was evaluated in terms of herbicide content, swellability, encapsulation efficiency, and release rate. The results show that starch sources play an important role on the matrix behaviors and on release rates. The rate of 2,4-D released follows the order： wheat starch 〈 potaot starch 〈 corn starch 〈 cassava starch. And for the rate of 2,4,5-T, this order is nearly the same only with an exception that the late two kinds of starch are similar. It is also demonstrated that herbicides with different water solubility show different release rates, no matter what type of starch is used as the matrices.     

A New Algorithm for On-Line Handwriting Signature Verification Based on Evolutionary Computation

The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation （EC）. Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly, this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm. Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail, The preliminary experiments reveal that the type of signature verification problem can be solved by EC.