排序方式: 共有23条查询结果,搜索用时 15 毫秒
1.
袁香环 《新疆大学学报(理工版)》1987,(4)
作者在文献[1]中证明了一个结果:有限群G如果满足|P(G),p|=1,则G为P~-可解群。本文将指出,这个论断的逆命题不成立。并且还指出,满足条件(|P(G)|,p)=1的有限群也不一定是p~-超可解群。 相似文献
2.
Ida‐Marie Hyvik Branislav Jansik Kasper Kristensen Poul Jrgensen 《Journal of computational chemistry》2013,34(15):1311-1320
Using the three‐level energy optimization procedure combined with a refined version of the least‐change strategy for the orbitals—where an explicit localization is performed at the valence basis level—it is shown how to more efficiently determine a set of local Hartree–Fock orbitals. Further, a core–valence separation of the least‐change occupied orbital space is introduced. Numerical results comparing valence basis localized orbitals and canonical molecular orbitals as starting guesses for the full basis localization are presented. The results show that the localization of the occupied orbitals may be performed at a small computational cost if valence basis localized orbitals are used as a starting guess. For the unoccupied space, about half the number of iterations are required if valence localized orbitals are used as a starting guess compared to a canonical set of unoccupied Hartree–Fock orbitals. Different local minima may be obtained when different starting guesses are used. However, the different minima all correspond to orbitals with approximately the same locality. © 2013 Wiley Periodicals, Inc. 相似文献
3.
Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement. 相似文献
4.
5.
Iterative process acceleration of calculation of unsteady,viscous, compressible,and heat‐conductive gas flows
下载免费PDF全文
![点击此处可从《国际流体数值方法杂志》网站下载免费的PDF全文](/ch/ext_images/free.gif)
K. S. Shterev 《国际流体数值方法杂志》2015,77(2):108-122
In this paper, extrapolation technique is introduced in the Semi‐Implicit Method for Pressure‐Linked Equations ‐ Time Step (SIMPLE‐TS) finite volume iterative algorithm for calculation of compressible Navier–Stokes–Fourier equations subject of slip and jump boundary conditions. The initial state, required by the iterative solver in simulation of unsteady flow problems, is approximated in time by Lagrange polynomial extrapolation in each node. The approach is applicable to a parallel code in a straightforward way due to algorithmic independence of the neighboring nodes in the computational grid. A criterion is proposed to determine the order of extrapolation polynomial and stop the extrapolation execution, when the local steady state is reached. The approach is tested on different microflow problems: Couette flow, flow past a square in a microchannel at subsonic and supersonic speeds, and convective Rayleigh–Bénard flow of a rarefied gas. The acceleration varies from 1.14‐fold to 2.8‐fold. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
6.
Shaofei Sun Hongxin Zhang Xiaotong Cui Qiang Li Liang Dong Xing Fang 《Entropy (Basel, Switzerland)》2021,23(11)
Cryptographic algorithm is the most commonly used method of information security protection for many devices. The secret key of cryptographic algorithm is usually stored in these devices’ registers. In this paper, we propose an electromagnetic information leakage model to investigate the relationship between the electromagnetic leakage signal and the secret key. The registers are considered as electric dipole models to illustrate the source of the electromagnetic leakage. The equivalent circuit of the magnetic field probe is developed to bridge the output voltage and the electromagnetic leakage signal. Combining them, the electromagnetic information leakage model’s function relationship can be established. Besides, an electromagnetic leakage model based on multiple linear regression is proposed to recover the secret key and the model’s effectiveness is evaluated by guess entropy. Near field tests are conducted in an unshielded ordinary indoor environment to investigate the electromagnetic side-channel information leakage. The experiment result shows the correctness of the proposed electromagnetic leakage model and it can be used to recover the secret key of the cryptographic algorithm. 相似文献
7.
8.
依据欧拉定理,研究了边数差和着色数计算公式,对四色猜想进行了研究.借助四面体顶点数与面积数相等的原则、多面体边数不变的原则和多余理论,用边数差数学计算方法论证了四色猜想.用简单的数学公式和几何作图方法说明了四色猜想的合理性,为其提供了可靠的理论依据.用“三色包点”和“以面切体”的几何作图法,证明多面体和平面地图的着色数恒为4;非三色包点的图形,可以通过“以面切体”的方法转换成三色包点的图形;使用多余国家、多余边数的数学技巧代替计算机使用的不可避免性、可约性是合适的.理论分析及实例论证表明该方法简单可行. 相似文献
9.
10.