实施ERP战略过程中的关键因素

ＥＲＰ是企业进行流程再造的重要手段之一，ＥＲＰ战略的实施又会涉及企业的方方面面，对企业经营活动有着重大影响。本文讨论了在实施ＥＲＰ战略的过程中几个值得注意的问题。     

机、电、微机控制一体化

通过平面电机绘图机系统的设计,描述了机、电、微机控制技术一体化的优越性。一个重要的优点是机械、电气技术的结合将会大大地简化平面电机绘图系统的结构和制造工艺,因而降低了成本。另一个重要优点是微机控制技术将会大大地扩大机电产品的功能。最后结论:机、电、微机控制技术一体化是机电产品今后的发展趋势。     

Implementing the ALGOL 68 heap

The implications of the heap, reference variables and global generators in ALGOL 68 are examined and some notes on possible implementation mechanisms are presented. In particular the use or simulation of hardware with segment addressing facilities is discussed.     

Implementation of the Levels Structure Value

We implement the levels structure value (Winter, 1989) for cooperative transfer utility games with a levels structure. The mechanism is a generalization of the bidding mechanism by Pérez-Castrillo and Wettstein (2001).     

各向同性超弹性本构模型数值计算及验证

现有多种形式的橡胶本构模型试图预测橡胶力学性质,其中部分模型已写入有限元软件中用于仿真计算,还存在较多拟合性较好的模型无法在有限元材料库中直接获得。本文详述了由不变量和主伸长率描写的各向同性超弹性本构模型的数值实现方法,并结合最新的本构模型开发了UHYPER和UMAT子程序。将UHYPER用于有限元实现对多孔橡胶板的拉伸仿真,对比仿真和试验结果,验证子程序的正确性以及评估本构模型预测复杂应变场的准确性;将UMAT用于单轴、等双轴和剪切拉伸的有限元仿真,对比仿真和本构模型理论结果,验证子程序的可靠性。结果表明,有限元仿真结果与理论结果拟合较好,子程序能够契合本构模型的力学描述,所述方法可以用于超弹性材料的数值计算。     

用时滞和阶跃序列组合生成网格多涡卷蔡氏混沌吸引子

提出了在规范型蔡氏电路中生成两种不同类型网格多涡卷混沌吸引子的新方法.与现有文献报道仅构造同一类型非线性函数产生多涡卷混沌吸引子的主要差别在于,这种方法能在一个蔡氏电路中同时构造时滞序列和阶跃序列,并通过其不同的组合方式来扩展相空间中指标2的鞍焦平衡点,从而生成两种不同类型的网格多涡卷混沌吸引子.理论分析、数值模拟和电路实验结果证实了该方法的可行性. 关键词： 规范型蔡氏电路 网格多涡卷混沌吸引子 时滞序列和阶跃序列 电路实现     

Cavity control as a new quantum algorithms implementation treatment

Based on recent experiments [Nature 449, 438 (2007) and Nature Physics 6, 777 (2010)], a new approach for realizing quantum gates for the design of quantum algorithms was developed. Accordingly, the operation times of such gates while functioning in algorithm applications depend on the number of photons present in their resonant cavities. Multi-qubit algorithms can be realized in systems in which the photon number is increased slightly over the qubit number. In addition, the time required for operation is considerably less than the dephasing and relaxation times of the systems. The contextual use of the photon number as a main control in the realization of any algorithm was demonstrated. The results indicate the possibility of a full integration into the realization of multi-qubit multiphoton states and its application in algorithm designs. Furthermore, this approach will lead to a successful implementation of these designs in future experiments.     

Bipotential versus return mapping algorithms: Implementation of non associated flow rules

Numerical implementation of constitutive laws involves specific incremental methods. The “return mapping” (Simo and Hughes, 1998) and the “bipotential” (de Saxcé, 1992) are one of those, associated respectively to two different classes of materials: the General Standard Materials (GSM) for the return mapping and the Implicit Standard Materials (ISM) for the bipotential.The objective of this paper is then to compare the implementation of those both methods in the case of non associated flow rules in plasticity.In the first section, the properties of the different previous material classes will be recalled and the methods of “return mapping” and “bipotential” will be detailed. The comparison of both methods is realised on the non linear kinematic hardening rule of Armstrong–Frederick (Armstrong and Frederick, 1966) in a second section and the details are given in a third part. The numerical implementation is realised in Abaqus/Standard 6.11 by the means of a UMat subroutine and the practical simple case of tension–compression is analysed in a last section.     

A matrix-free high-order discontinuous Galerkin compressible Navier-Stokes solver: A performance comparison of compressible and incompressible formulations for turbulent incompressible flows

Both compressible and incompressible Navier-Stokes solvers can be used and are used to solve incompressible turbulent flow problems. In the compressible case, the Mach number is then considered as a solver parameter that is set to a small value, M ≈0.1, in order to mimic incompressible flows. This strategy is widely used for high-order discontinuous Galerkin (DG) discretizations of the compressible Navier-Stokes equations. The present work raises the question regarding the computational efficiency of compressible DG solvers as compared to an incompressible formulation. Our contributions to the state of the art are twofold: Firstly, we present a high-performance DG solver for the compressible Navier-Stokes equations based on a highly efficient matrix-free implementation that targets modern cache-based multicore architectures with Flop/Byte ratios significantly larger than 1. The performance results presented in this work focus on the node-level performance, and our results suggest that there is great potential for further performance improvements for current state-of-the-art DG implementations of the compressible Navier-Stokes equations. Secondly, this compressible Navier-Stokes solver is put into perspective by comparing it to an incompressible DG solver that uses the same matrix-free implementation. We discuss algorithmic differences between both solution strategies and present an in-depth numerical investigation of the performance. The considered benchmark test cases are the three-dimensional Taylor-Green vortex problem as a representative of transitional flows and the turbulent channel flow problem as a representative of wall-bounded turbulent flows. The results indicate a clear performance advantage of the incompressible formulation over the compressible one.