2A14铝合金TTT曲线及其淬火敏感性

采用分级淬火实验方法,绘制了2A14铝合金时间-温度-转换率(TTT)曲线,利用XRD、TEM、EDS等观察分析了合金等温过程中的组织变化,结合Avrami方程研究了等温过程中相变动力学。结果表明合金TTT曲线鼻尖温度为350℃,淬火敏感区间为300~400℃。2A14铝合金过饱和固溶体在350℃等温处理时快速分解,第二相脱溶析出速率达到最高。鼻尖温度较大的过饱和度和较高的扩散速率是第二相快速析出和长大的主要原因。2A14铝合金淬火过程中,建议在淬火敏感区间(300~400℃)提高冷却速率抑制第二相析出,在其他温度区间适当降低冷却速率,以获得较高的综合性能。     

Real-time approximation of molecular interaction interfaces based on hierarchical space decomposition

The interaction interface between two molecules can be represented as a bisector surface equidistant from the two sets of spheres of varying radii representing atoms. We recursively divide a box containing both sphere-sets into uniform pairs of sub-boxes. The distance from each new box to each sphere-set is conservatively approximated by an interval, and the number of sphere-box computations is greatly reduced by pre-partitioning each sphere-set using a kd-tree. The subdivision terminates at a specified resolution, creating a box partition (BP) tree. A piecewise linear approximation of the bisector surface is then obtained by traversing the leaves of the BP tree and connecting points equidistant from the sphere-sets. In 124 experiments with up to 16,728 spheres, a bisector surface with a resolution of 1/2⁴ of the original bounding box was obtained in 28.8 ms on average.     

Improved deterministic algorithms for weighted matching and packing problems

Based on the method of (n,k)-universal sets, we present a deterministic parameterized algorithm for the weighted rd-matching problem with time complexity O^∗(4^{(r−1)k+o(k)}), improving the previous best upper bound O^∗(4^rk+o(k)). In particular, the algorithm applied to the unweighted 3d-matching problem results in a deterministic algorithm with time O^∗(16^k+o(k)), improving the previous best result O^∗(21.26^k). For the weighted r-set packing problem, we present a deterministic parameterized algorithm with time complexity O^∗(2^{(2r−1)k+o(k)}), improving the previous best result O^∗(2^2rk+o(k)). The algorithm, when applied to the unweighted 3-set packing problem, has running time O^∗(32^k+o(k)), improving the previous best result O^∗(43.62^k+o(k)). Moreover, for the weighted r-set packing and weighted rd-matching problems, we give a kernel of size O(k^r), which is the first kernelization algorithm for the problems on weighted versions.     

异构环境下实时多媒体信息组播技术

该文先介绍了组播骨干网(Mbone)和组播的相关概念,然后讨论了Internet和Mbone的异构性,在此基础上论述了如何有效地在异构环境下传输实时多媒体信息,并比较了两种对异构性的不同解决方案.     

电力数字调度机软件系统的设计与实现

电力调度交换机正被逐渐地应用于电力生产调度,它在电力通信中具有举足轻重的作用.文章首先介绍了一种新型程控调度交换机软件的基本结构和设计思想,讨论了在实现此软件系统中涉及到的操作系统设计、呼叫处理程序和其他关键问题.     

基于Multi-Agent的农业专家系统在Internet上的系统设计

该文充分考虑了农业专家系统中需要不同领域知识进行协作,以及领域知识的分布性、易于更新性、可重用性等特点,同时也考虑对原有的各领域专家系统进行利用,提出一个新的基于Multi－Agent的农业专家系统的实现模式.最后,提出一个在Internet环境下的系统实现方案.     

SET协议的支付模型分析

文章对安全电子交易协议SET的核心部分&&安全支付模型&&进行了详细分析,给出了有关协议数据的形式化描述,叙述了安全支付过程中的购买请求、支付授权、资金清算等处理流程,为进一步研究电子商务的安全支付问题,给出了一个参考模型.     

近线性神经和元非线性神经元

人工神经网络(ANN)中普遍采用的神经元模型具有单调有界的I／O特性,该文称其为近线性神经元(ALN,approximate－linear neuron),ALN既简化了网络的复杂性,也是限制ANN能力的一个瓶径.通过比较Hopfield神经网络的稳定性和Conway生命游戏的复杂行为,该文提出非线性神经元(NLN,non－linear neuron)的概念,其I／O特性是完全非线性的.ALN可以进一步提高ANN的非线性,从而增强它的功能,余数制神经网络是一个例子.