薄壳问题的三维虚边界元解法

直接从三维弹性力学微分方程出发,依据三维的Kelvin解,应用最小二乘法建立了三维虚边界元法解薄壳问题的一般方法。本方法的显著优点是：不论求解何种壳体问题,方法的思想是不变的,均以三维的Kelvin解来建立方程,而勿需对不同几何形状的壳体采用不同的基本解。文中给出了数值算例,以作为本方法的应用。本文方法与边界元直接法相比,优点在于无需处理奇异积分,且系数阵是对称的;再者,本文方法思想简单,程序实现容易。     

A Categorical Structure for the Virtual Braid Group

This article gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one morphism corresponding to a transposition in the symmetric group. This point of view makes many relationships between the virtual braid group and the pure virtual braid group apparent, and makes representations of the virtual braid groups and pure virtual braid groups via solutions to the algebraic Yang–Baxter Equation equally transparent. In this categorical framework, the virtual braid group has nothing to do with the plane and nothing to do with virtual crossings. It is a natural group associated with the structure of algebraic braiding.     

基于径向基函数网络的虚拟物流企业伙伴选择方法研究

在对虚拟物流企业系统研究的基础上 ,针对虚拟物流企业伙伴选择问题的特点 ,给出了一个面对虚拟物流企业伙伴选择问题的较为全面的选择过程框架 .并提出了一个基于径向基函数网络算法的虚拟物流企业伙伴选择模型 ,实例仿真说明了该算法和模型的有效性 .     

基于灰色关联的虚拟企业伙伴选择

虚拟企业组建时,面对网络上众多且又处于分散无序状态的潜在合作资源,往往难以找到合适的合作伙伴.研究了虚拟企业选择伙伴的指标体系,应用层次分析法计算出各指标的权重,并借鉴灰色关联度理论较好地解决虚拟企业网络化资源伙伴的选择问题.     

重建极性连续统理论的基本定律和原理(Ⅷ)——全功能原理

进一步阐明了现有极性连续统力学的能量守恒定律在理论上的不完整性．为能使之完整起见,提出了全功能原理及增率型全功能原理．通过对它们的全变分,即可分别得到虚位移-微转动和虚应力-偶应力原理及虚速度-角速度和虚应力率-偶应力率原理．从这些原理可以同时而且很自然推导出微极连续统力学的所有均衡方程和边界条件．所得到非传统结果与现有能量守恒定律问题存在的本质性差异作了说明．     

The number of bound states of a one-particle Hamiltonian on a three-dimensional lattice

We consider the Hamiltonian , describing the motion of one quantum particle on a three-dimensional lattice in an external field. We investigate the number of eigenvalues and their arrangement depending on the value of the interaction energy for μ ≥ 0 and λ ≥ 0. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 158, No. 3, pp. 425–443, March, 2009.     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

三维实体退化虚拟层合梁单元在梁极限承载力分析中的应用

提出采用三维实体退化虚拟层合梁单元计算梁极限承载力的方法。考虑结构的几何非线性和材料非线性,利用该单元编制了极限承载力计算程序,并将其应用于梁极限承载力的分析。计算实例表明,该单元收敛快,稳定性好,在单元数较少的情况下,具有较高的精度。由于能克服块体单元或梁段     

急件订单干扰下虚拟单元重调度

虚拟单元生产中,针对急件订单干扰情况,研究了考虑序位相似性,即尽量保持初始工序的加工次序的虚拟单元重调度问题。为了应对急件订单干扰,设置了各工件工序可用机器集合和相应的加工时间集合,构建了以序位相似性最大和急件订单完工时间、系统总流程时间最短为目标的多目标非线性整数规划模型。针对模型自身特征,采用了遗传—蚁群算法相结合的优化算法求解模型。最后,以船舶实际生产为例,验证了模型的可行和优越性,以及算法的有效性。