热变形参数对Ti-15-3合金显微组织的影响及预测

通过等温压缩试验和金相分析研究了热变形参数对Ti-15-3(Ti-15V-3Cr-3Sn-3Al）合金固溶处理后显微组织的影响，等效晶粒尺寸随变形温度升高而增大，随变形程度和变形速率增加而减小，再结晶程度随变形温度升高而减小，随变形程度和变形速率增加而增大，采用人工神经网络的方法建立了等效晶粒尺寸及再结晶晶粒体积百分数与变形程度，变形速率和变形温度间的数学模型，预测值与实测值吻合较好，表明该方法很好地预测热变形参数对Ti-15-3合金固溶处理后显微组织的影响。     

Oxidation behavior of temary Fe- 15Cu-5Al and Fe-85Cu-5Al alloys in pure oxygen at 900℃

The oxidation of two two-phase ternary Fe-Cu-Al alloys containing about 5%（mole fraction） aluminium, one Fe-rich and one Cu-rich, has been studied at 900 ℃ in 1~105 Pa pure oxygen. The Fe-rich Fe-15Cu-5Al alloy presents two quasi-parabolic stages, with a large decrease of the parabolic rate constant after about 50min. The presence of 5% Al greatly reduces the oxidation rate of this alloy with respect to a binary Fe-Cu alloy of similar composition by forming an external protective Al203 layer, which is present near the scale/alloy interface. Due to the high stress-growth effect, this thin Al203 layer cannot completely prevent further oxidation of the alloy underneath. On the contrary, the Cu-rich Fe-85Cu-5Al alloy presents a single parabolic stage and forms a thick and porous external scale, coupled to the internal oxidation of Fe and Al. As a result, the oxidation of Cu-rich alloy at 900 ℃ is much faster than that of the Fe-rich alloy.     

P91与ZG15Cr2Mo1异种钢焊接工艺

将P91和ZG15Cr2Mo1异种钢焊接工艺应用于新型300MW火力发电机组重要部件中，针对两种钢的特点，确定了合适的焊接材料和具体可行的焊接工艺，取得了令人满意的效果。     

大伙房水库输水工程15!#洞TBM段衬砌混凝土施工技术分析

大伙房水库输水工程15#洞下游主洞采用TBM法开挖,全长2 373 m,其中Ⅱ类围岩175 m,Ⅲ类围岩1 805 m,Ⅳ类围岩393 m。文章主要对大伙房水库输水工程15#洞下游TBM段衬砌混凝土施工与安全技术进行分析,为后期水库的运行提供参考。     

一种高速图像数据记录器设计

针对摄像机输出的高速数字视频信号的存储需求,设计了一种图像数据记录器,实现了对数据的存储、回传和转发等功能;图像数据接收采用点到点LVDS模式,存储电路选用K9WBG08U1M作为存储介质,使用CY7C4285V-15构成数据缓冲电路;通过采用交错双平面模式对FLASH进行页编程和对坏块的特殊处理使记录器很好地实现了对30.72MB/s高速数字视频信号的存储;测试结果表明,该记录器能够准确记录图像信息,图像还原后清晰准确.     

Suboptimal robust synthesis for MIMO plant under coprime factor perturbations

Suboptimal robust synthesis for MIMO nominal system under coprime factor perturbations is considered in classical and non-classical statements. In the classical statement, weights of perturbations and upper bound on magnitude bounded exogenous disturbance are assumed to be known to controller designer. Suboptimal synthesis within ε tolerance is reduced to the solution of log₂(1/ε) standard mixed sensitivity problems of ℓ₁ optimization. In the non-classical statement, the upper bounds on perturbations and exogenous disturbance are to be estimated from measurement data and suboptimal synthesis is reduced to the solution of 1/ε mixed sensitivity problems.     

An LMI approach to synthesis subject to almost asymptotic regulation constraints

A multi-objective controller synthesis problem is considered in which an output is to be regulated approximately by assuring a bound on the steady-state peak amplification in response to an infinite-energy disturbance, while also guaranteeing a desired level of performance measured in terms of the worst-case energy gain from a finite-energy input to a performance output. Relying on a characterization of the controllers with which almost asymptotic regulation is accomplished, the problem of guaranteeing the desired level of performance is reduced to solving a system of linear matrix inequalities subject to a set of linear equality constraints. Based on the solution of this system, a procedure is outlined for the construction of a suitable controller whose order is equal to the order of the plant plus the order of the exogenous system.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Invariance properties of RAMS and linear time

An operation on integers isLTTC if it is computable in linear time on a Turing machine (using the dyadic or binary representation of integers). AnLTTC-RAM (respectivelyI-RAM) is a RAM which only uses LTTC operations (respectively operations in the setI).The address-free time complexity measure of a RAM evaluates execution times using the logarithmic cost criterion but assumes that addressing operations are performed for free.     

Space-efficient recognition of sparse self-reducible languages

Mahaney and others have shown that sparse self-reducible sets have time-efficient algorithms, and have concluded that it is unlikely that NP has sparse complete sets. Mahaney's work, intuition, and a 1978 conjecture of Hartmanis notwithstanding, nothing has been known about the density of complete sets for feasible classes until now. This paper shows that sparse self-reducible sets have space-efficient algorithms, and in many cases, even have time-space-efficient algorithms. We conclude that NL, NC ^k , AC ^k , LOG(DCFL), LOG(CFL), and P lack complete (or even Turing-hard) sets of low density unless implausible complexity class inclusions hold. In particular, if NL (respectively P, _k , or NP) has a polylog-sparse logspace-hard set, then NLSC (respectively PSC, _k , or PHSC), and if P has subpolynomially sparse logspace-hard sets, then PPSPACE.