A Survey on the Numerics and Computations for the Landau-Lifshitz Equation of Micromagnetism

The Landau-Lifshitz (LL)equation of micromagnetism governs rich variety of the evolution of magnetization patterns in ferromagnetic media. This is due to the complexity of physical quantities appearing in the LL equation. This complexity causes also an interesting mathematical properties of the LL equation: nonlocal character for some quantities,nonconvex side-constraints, strongly nonlinear terms. These effects influence also the numerical approximations. In this work, recent developments on the approximation of weak solutions, together with the overview of well-known methods for strong solutions,are addressed. Author is supported by the Fund for Scientific Research - Flanders FWO (Belgium).     

An actor-critic algorithm for constrained Markov decision processes

An actor-critic type reinforcement learning algorithm is proposed and analyzed for constrained controlled Markov decision processes. The analysis uses multiscale stochastic approximation theory and the envelope theorem' of mathematical economics.     

固定网综合信息平台的建设

详细介绍了中兴ZXF118固定网综合业务信息平台的结构、建设方案及其组网方案。     

The CADE-14 ATP System Competition

This paper documents the design, competing systems, results, and conclusions of the CADE-14 ATP System Competition (CASC-14).     

广义Foster定理

利用Ｍａｘｗｅｌｌ方程组导出了适用于有耗网络的广义Ｆｏｓｔｅｒ定理，得到了一些有关电抗斜率以及Ｑ值的有用公式及结论。     

Implicit induction in conditional theories

We propose a new procedure for proof by induction in conditional theories where case analysis is simulated by term rewriting. This technique reduces considerably the number of variables of a conjecture to be considered for applying induction schemes. Our procedure is presented as a set of inference rules whose correctness has been formally proved. Moreover, when the axioms are ground convergent and the functions are completely defined, it is possible to apply the system for refuting conjectures. The procedure is even refutationally complete for conditional equations with Boolean preconditions over free constructors. The method is entirely implemented in the proverSPIKE. This system has solved interesting problems in a completely automatic way, that is, without interaction with the user and without ad hoc heuristics. It has also proved the challenging Gilbreath card trick, with only two easy lemmas.Preliminary versions of the results have been presented at the 13th International Joint Conference on Artificial Intelligence, Chambéry (France), 1993 (Bouhoula and Rusinowith, 1993).     

原油换热网络Simulink动态仿真中提高运行速度的问题

提出状态空间离散化的思想,建立换热器的动态机理模型,然后通过Simulink模块化进行连接,对换热网络进行动态仿真。在大规模原油换热网络的仿真中,采用存储初值和切断代数环的方法,使换热网络的收敛速度得到了很大的提高,为复杂换热网络的动态仿真和实时优化打下了基础。这种方法,还可适用于一般石油化工过程装置的大规模动态仿真运行中。     

三网融合的技术现状和未来发展

三网融合是网络发展的主要方向,无线网络是接入有线网络的一个重要途径。本文主要概述了因特网、电信网络、有线电视网络和无线网络的技术现状;分析在三网融合的形势下,它们各自都可以为发展未来包含现在由三种网络提供的所有服务的综合业务网提供核心技术的能力;指出没有单个网络技术能够成为无争议的赢家:融合的网络将具有异构网络集合的特征,提供多种多样的服务;然后在更广阔的视野上阐明了在三网融合之后的未来全局多媒体网络的特征以及建立具有这样的特征的网络所面临的挑战和所需要的变革和创新。     

基于模型设计的数字集群分组数据业务的实现

为解决数字集群通信系统中图像、视频等大数据业务的传输问题,深入分析数字集群空中接口协议栈的结构,重点研究分组数据业务提供者子网相关汇聚协议的结构和原理。基于模型设计方法设计该协议的相关功能模块,并进行编码实现。开发中使用IBM Rational Rhapsody这一基于UML建模的开发工具,使整个开发过程简洁而清晰。最后,通过对协议进行一致性测试,证明协议参数及流程符合数字集群通信系统协议标准。     

A λ-unifiability test for set theory

We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation.