64 resultados para Algebraic Bethe-ansatz
Resumo:
The problems of dislocation nucleation and emission from a crack tip are analysed based on Peierls model. The concept adopted here is essentially the same as that proposed by Rice. A slight modification is introduced here to identify the pure linear elastic response of material. A set of new governing equations is developed, which is different from that used by Beltz and Rice. The stress field and the dislocation density field can be expressed as the first and second Chebyshev polynomial series respectively. Then the opening and slip displacements can be expanded as the trigonometric series. The Newton-Raphson Method is used to solve a set of nonlinear algebraic equations. The new governing equations allow us to extend the analyses to the case of dislocation emission. The calculation results for pure shearing, pure tension and combined tension and shear loading are given in detail.
Resumo:
Using a variational method, a general three-dimensional solution to the problem of a sliding spherical inclusion embedded in an infinite anisotropic medium is presented in this paper. The inclusion itself is also a general anisotropic elastic medium. The interface is treated as a thin interface layer with interphase anisotropic properties. The displacements in the matrix and the inclusion are expressed as polynomial series of the cartesian coordinate components. Using the virtual work principle, a set of linear algebraic equations about unknown coefficients are obtained. Then the general sliding spherical inclusion problem is accurately solved. Based on this solution, a self-consistent method for sliding polycrystals is proposed. Combining this with a two-dimensional model of an aggregate polycrystal, a systematic analysis of the mechanical behaviour of sliding polycrystals is given in detail. Numerical results are given to show the significant effect of grain boundary sliding on the overall mechanical properties of aggregate polycrystals.
Resumo:
It is proved that the simplified Navier-Stokes (SNS) equations presented by Gao Zhi[1], Davis and Golowachof-Kuzbmin-Popof (GKP)[3] are respectively regular and singular near a separation point for a two-dimensional laminar flow over a flat plate. The order of the algebraic singularity of Davis and GKP equation[2,3] near the separation point is indicated. A comparison among the classical boundary layer (CBL) equations, Davis and GKP equations, Gao Zhi equations and the complete Navier-Stokes (NS) equations near the separation point is given.
Resumo:
In the case of suspension flows, the rate of interphase momentum transfer M(k) and that of interphase energy transfer E(k), which were expressed as a sum of infinite discontinuities by Ishii, have been reduced to the sum of several terms which have concise physical significance. M(k) is composed of the following terms: (i) the momentum carried by the interphase mass transfer; (ii) the interphase drag force due to the relative motion between phases; (iii) the interphase force produced by the concentration gradient of the dispersed phase in a pressure field. And E(k) is composed of the following four terms, that is, the energy carried by the interphase mass transfer, the work produced by the interphase forces of the second and third parts above, and the heat transfer between phases. It is concluded from the results that (i) the term, (-alpha-k-nabla-p), which is related to the pressure gradient in the momentum equation, can be derived from the basic conservation laws without introducing the "shared-pressure presumption"; (ii) the mean velocity of the action point of the interphase drag is the mean velocity of the interface displacement, upsilonBAR-i. It is approximately equal to the mean velocity of the dispersed phase, upsilonBAR-d. Hence the work terms produced by the drag forces are f(dc) . upsilonBAR-d, and f(cd) . upsilonBAR-d, respectively, with upsilonBAR-i not being replaced by the mean velocity of the continuous phase, upsilonBAR-c; (iii) by analogy, the terms of the momentum transfer due to phase change are upsilonBAR-d-GAMMA-c, and upsilonBAR-d-GAMMA-d, respectively; (iv) since the transformation between explicit heat and latent heat occurs in the process of phase change, the algebraic sum of the heat transfer between phases is not equal to zero. Q(ic) and Q(id) are composed of the explicit heat and latent heat, so that the sum Q(ic) + Q(id)) is equal to zero.
Resumo:
In this paper, TASCflow3D is used to solve inner and outer 3D viscous incompressible turbulent flow (R-e = 5.6 X 10(6)) around axisymmetric body with duct. The governing equation is a RANS equation with standard k-epsilon turbulence model. The discrete method used is a finite volume method based on the finite element approach. In this method, the description of geometry is very flexible and at the same time important conservative properties are retained. The multi-block and algebraic multi-grid techniques are used for the convergence acceleration. Agreement between experimental results and calculation is good. It indicates that this novel approach can be used to simulate complex flow such as the interaction between rotor and stator or propulsion systems containing tip clearance and cavitation.
Resumo:
A full two-fluid model of reacting gas-particle flows with an algebraic unified second-order moment (AUSM) turbulence-chemistry model is used to simulate Beijing coal combustion and NOx formation. The sub-models are the k-epsilon-kp two-phase turbulence model, the EBU-Arrhenius volatile and CO combustion model, the six-flux radiation model, coal devolatilization model and char combustion model. The blocking effect on NOx formation is discussed. In addition, the chemical equilibrium analysis is used to predict NOx concentration at different temperature. Results of CID simulation and chemical equilibrium analysis show that, optimizing air dynamic parameters can delay the NOx formation and decrease NOx emission, but it is effective only in a restricted range. In order to decrease NOx emission near to zero, the re-burning or other chemical methods must be used.
Resumo:
Fuzzy sets in the subject space are transformed to fuzzy solid sets in an increased object space on the basis of the development of the local umbra concept. Further, a counting transform is defined for reconstructing the fuzzy sets from the fuzzy solid sets, and the dilation and erosion operators in mathematical morphology are redefined in the fuzzy solid-set space. The algebraic structures of fuzzy solid sets can lead not only to fuzzy logic but also to arithmetic operations. Thus a fuzzy solid-set image algebra of two image transforms and five set operators is defined that can formulate binary and gray-scale morphological image-processing functions consisting of dilation, erosion, intersection, union, complement, addition, subtraction, and reflection in a unified form. A cellular set-logic array architecture is suggested for executing this image algebra. The optical implementation of the architecture, based on area coding of gray-scale values, is demonstrated. (C) 1995 Optical Society of America
Resumo:
The ballistic transport in the semiconductor, planar, circular quantum dot structures is studied theoretically. The transmission probabilities show apparent resonant tunneling peaks, which correspond to energies of bound states in the dot. By use of structures with different angles between the inject and exit channels, the resonant peaks can be identified very effectively. The perpendicular magnetic field has obvious effect on the energies of bound states in the quantum dot, and thus the resonant peaks. The treatment of the boundary conditions simplifies the problem to the solution of a set of linear algebraic equations. The theoretical results in this paper can be used to design planar resonant tunneling devices, whose resonant peaks are adjustable by the angle between the inject and exit channels and the applied magnetic field. The resonant tunneling in the circular dot structures can also be used to study the bound states in the absence and presence of magnetic field.
Resumo:
The concept of traces has been introduced for describing non-sequential behaviour of concurrent systems via its sequential observations. Traces represent concurrent processes in the same way as strings represent sequential ones. The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes anologous to that available for sequential systems. The following topics will be discussed: algebraic properties of traces, trace models of some concurrency phenomena, fixed-point calculus for finding the behaviour of nets, modularity, and some applications of the presented theory.
Resumo:
Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.
Resumo:
We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.
Resumo:
随着产品设计的复杂化,应用领域中的数学建模和仿真越来越重要,传统建模方法基于赋值语句,主要考虑单一系统,工程人员需要对程序设计语言和算法求解有相当程度的熟悉,这导致了传统建模方法很难满足复杂产品设计的需要。欧洲仿真界的学者在总结现有建模方法的基础上于1997年推出了一种面向对象的、陈述式的基于方程的语言——Modelica,Modelica语言支持多领域建模,Modelica语言得到了仿真领域众多厂商的支持,成为统一建模领域的事实标准,实现Modelica仿真环境具有重大意义。 编译器是Modelica仿真环境中的核心组件,Modelica编译器会产生高指标DAE系统,除了部分特殊结构的高指标DAE,现有求解器一般不能对通用高指标DAE直接求解,现在一般做法是先对高指标DAE进行指标约简,将其转换成等价的低指标DAE,然后进行求解。这就要求Modelica编译器具有指标约简的功能,以便利用现有求解器进行求解。 本文介绍了几种现有的指标约简算法,给出了各个算法指标约简原理和约简步骤,并对这些算法进行了分析和比较,得出各自的优缺点。最后,本文设计并实现了一个指标约简系统,采用三个Modelica模型产生的方程对系统进行了测试,并验证了实验结果的正确性。
Resumo:
Modelica语言仿真建模在科研工作中已经得到了广泛应用。它能方便地对包含机械、电子、液压、控制、热流等领域的复合物理系统进行基于组件的仿真。现有基于Modelica语言的仿真建模软件支持图形化建模和文本建模两种方式,集成了面向对象、陈述式描述、统一建模、组件重用的优势,给科研工作带来了巨大的便利。 Modelica软件仿真的过程可归结为微分代数方程(differential algebraic equation,DAE)系统的求解。在求解DAE系统时,需要对DAE系统进行约简,直到庞大的DAE系统约简为目前自动求解方法成熟的ODE系统,或约简为方程个数不多的、指标较低的DAE系统,才能使Modelica建模仿真软件具有工业上的应用价值。在约简DAE系统之前,需要对之进行预处理,根据方程之间的数据依赖关系进行拓扑排序,确定求解顺序。排序的过程对应着将DAE系统结构关联矩阵进行块状下三角(block lower triangle,BLT)变换。寻找强连通分量和拓扑排序是对DAE系统进行预处理的重要组成部分。 本文剖析了Modelica软件在仿真时的运行机制,使用几个实例来详细描述在仿真过程中,Modelica软件完成的工作。在寻找强连通分量和拓扑排序这一步,本文提出了使用Kosaraju算法的策略,对由模型得到的有向图直接使用Kosaraju算法,得出DAE系统的求解顺序。文章叙述了强连通分量的含义,并阐述了在求强连通分量时的理论依据,由此引出了Tarjan算法和Kosaraju算法,再分析和比较Tarjan算法和Kosaraju算法,对比了两种策略的优劣,并进行了实验。同时,本文分析了OpenModelica软件包的结构,修改了软件包在寻找强连通分量及拓扑排序相关模块的代码。