轧制速度对AZ31镁合金管材冷轧成形的影响

轧制速度是三辊式冷轧成形过程中关键的工艺参数，决定其力学特征及温升情况。基于此，本文以冷轧AZ31镁合金管材为研究对象，通过全流程数值仿真计算，对比分析不同轧制速度在各特征变形段对等效应力、等效塑性应变及节点温度的影响规律。结果表明，等效应力、等效塑性应变及节点温度均随轧制速度的增大而增大。通过元胞自动机模型及实验等手段，探明了晶粒在轧制过程中产生连续再结晶并细化的初步组织演变规律；对比分析实验与模拟结果并结合多方面因素，得到800mm/s的轧制速度可以更好的满足工艺要求的结果，为冷轧镁合金管材轧制速度的选择提供依据。     

酸洗废液制备聚合氯化铁形态及稳定性研究

以钢铁盐酸酸洗废液为原料,催化氧化制备聚合氯化铁(PFC)。考察了聚合氯化铁稳定性的影响因素,并采用Ferron逐时络合比色法考察了制备温度、HCl/Fe的质量比、P/Fe的摩尔比、熟化时间对聚合氯化铁中铁形态分布及转化规律的影响。研究结果表明:在制备温度为60℃、HCl/Fe≥0.45,P/Fe≥0.12时,催化氧化制备的聚合氯化铁能稳定存在6个月以上,不发生水解。催化氧化制备的PFC中铁主要以Fe(a)和Fe(c)的形式存在,Fe(b)含量很少,随着熟化时间的延长,Fe(b)在14天左右完全消失。随HCl/Fe的质量比及P/Fe的摩尔比的增大,Fe(a)、Fe(b)含量先增加后降低,Fe(c)含量先减少后增加。     

区域能源互联网信息物理建模及控制策略

大力发展低碳经济是解决能源危机、环境污染、温室效应等问题的有效途径之一。在分析区域分布式能源系统一般结构的基础上,提出冷热电联供下基于多智能体系统的区域能源互联网架构模型。结合元胞自动机理论,给出考虑冷热电协同控制的能源路由器设计方案。提出一种集中分散相融合的分布式协调控制策略。仿真算例验证了所提模型和控制策略的有效性。     

基于多维有限自动机的DFA改进算法

多个正则表达式规则编译成一个DFA(deter minister finite automata)时,会产生状态爆炸、存储急剧增加的现象。针对最严重的状态爆炸问题,从信息论的角度给出了解释,并提出多维数学模型,将冗余状态分为0维状态和1维状态,通过前者按照维度压缩,后者动态构建的方法将空间复杂度降到理论下界,并在此基础上提出多维有限自动机(MFA, multi-dimensional finite automata)。实验表明,MFA构造时间比XFA略少,比DFA、STT冗余压缩算法和Hybrid-FA降低了2~3个数量级;存储空间比XFA略高,比DFA、STT冗余压缩算法、mDFA、Hybrid-FA降低了1~2个数量级;匹配时间比DFA、Hybrid-FA略多,但是比XFA略少,比STT冗余压缩算法和mDFA降低了1~2个数量级。     

基于 Mealy 机的藏文字构件分解

藏文字构件分解是藏文信息处理的基础,具有重要的理论价值和广阔的应用前景。针对藏文字构件的复杂性与多样性,文章通过分析现代藏文字的构字规则和结构特点,研究了藏文字构件的分解过程,利用Mealy机的输出字符与移动一一对应的特性描述了藏文字构件的行为语义,给出了对于任意字符串能否被Mealy机分解的判定定理及基于Mealy机的藏文字构件分解算法,并设计实现了基于Mealy机的藏文字构件分解系统,验证了算法的可行性。     

转膛自动机弹带二次挤进过程数值模拟

为研究转膛自动机转膛衬套与身管衬套膛线不等高带来的弹带二次挤进问题,建立反映膛线高度差的弹 带二次挤进过程分析有限元模型。通过数值仿真获得弹带完全挤进转膛衬套和身管衬套的应力、变形和温度;仿真 结果与实弹射击回收的弹带刻痕吻合较好,说明所建立有限元模型具有一定的可信度。对比转膛衬套采用半高膛线 与全高膛线的仿真结果表明：转膛衬套与身管衬套膛线不等高显著影响弹带挤进过程,采用半高膛线能使弹带挤入 转膛衬套更平稳,但弹带在二次挤进身管衬套时会产生更强的冲击;采用全高膛线在弹带挤入转膛衬套时更困难, 但在二次挤进身管衬套时较为平稳。     

Design of a timed and controlled release osmotic pump system of atenolol

The objective of the article was to design a novel timed and controlled release osmotic pump (TCOP) containing atenolol as an active pharmaceutical ingredient and compare with a bilayer-core osmotic pump (BCOP) of atenolol. Different from BCOP, a modulating barrier was added to delay the drug release and obtain desired lag time (T_lag). The influences of the amount of pore-forming agent and modulating barrier, coating weight gain on the lag time (T_lag) and drug release rate (R_t) of TCOP were investigated. The central composite design-response surface methodology (RSM) was applied to optimize the formulation. Rhodamine B was added to modulating barrier to determine the release process of modulating barrier. A method used to correct the release profiles with a certain lag time by ΔT_lag and interpolating was applied to compare TCOP with BCOP. T_lag was directly proportional to the amount of modulating barrier and coating weight gain, but inversely related to the amount of pore forming agent, which were contrary to the effects on R_t. The optimal formulation including 60?mg PEO WSR N80, 3?g PEG 4000 and 6% coating weight gain could obtain a 3.59-h T_lag. According to the release of Rhodamine B, the modulating barrier was completely pushed out at ～5.0?h, longer than 3.59?h, therefore, atenolol along with remaining modulating barrier was released together between 3.59 and 5.0?h. By comparing with BCOP, the release profiles subtracting the part of lag time had no significant difference, yet R_t of TCOP presented a slight decrease.     

Language acceptability of finite automata based on theory of semi‐tensor product of matrices

Using the theories of many‐valued logic and semi‐tensor product of matrices (STP), this paper investigates how to mathematically determine whether or not a regular language is recognized by finite automata (FA). To this end, the dynamic behaviour of FA is first formulated as bilinear dynamic equations, which provides a uniform model for deterministic and non‐deterministic FA. Based on the bilinear model, the recognition power of FA understanding of regular languages is investigated and several algebraic criteria are obtained. With the algebraic criteria, to judge whether a regular sentence is accepted by a FA or not, one only needs to calculate an STP of some vectors, rather than making the sentence run over the machine as traditional manners. Further, the inverse problem of recognition is considered, an algorithm is developed that can mathematically construct all the accepted sentences for a given FA. The algebraic approach of this paper may be a new angle and means to understand and analyse the dynamics of FA.