关于双参数C0半群的一些结果

为了丰富半群理论,利用经典的算子半群理论中的方法和双参数C0半群的概念,将单参数的C0半群的一些性质推广到双参数的C0半群,得到双参数的C0半群、生成元及其预解式的一些基本结果.     

初中物理学习中的创造

论述了如何在物理学习及实践中进行创造能力的培养,特别提出创造意识在实践中的形成过程。     

院校升格与高教系统分层

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

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.     

Microbial starch-binding domains are superior to granule-bound starch synthase I for anchoring luciferase to potato starch granules

Microbial starch-binding domains (SBD) and granule-bound starch synthase I (GBSSI) are proteins which are accumulated in potato starch granules. The efficiency of SBD and GBSSI for targeting active luciferase reporter proteins to granules during starch biosynthesis was compared. GBSSI or SBD sequences were fused to the N- or C-terminus of the luciferase (LUC) gene, via an artificial Pro-Thr encoding linker sequence. The genes were introduced into an amylose-free (amf) potato mutant. It appeared that SBD was superior to GBSSI as a targeting sequence, mainly because the luciferase retained higher activity in the SBD-containing fusion proteins than in the GBSSI-containing ones.     

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.     

A New Digital Multilevel Proxy Signature Scheme Based on Elliptic Curve Cryptography

Based on the analysis of elliptic curve digital signature algorithm（ECDSA）,aiming at multilevel proxy signature in which the original signer delegates the digital signature authority to several proxies and its security demands, a new multilevel proxy signature scheme based on elliptic curve discrete logarithm problem （ECDLP） is presented and its security are proved.