Effect of binder-phase modification and Cr3C2 addition on properties of WC-IOC0 cemented carbide

For production of fine-grained and corrosion-resistant tungsten carbide (WC) based cemented carbides, addition of chromium carbide (Cr₃3C₂) in small amounts is standard practice. No systematic study, however, has been made of the effects of large additions (maximum 6 wt % ) of Cr₃C₂ as a substitute for tungsten carbide. This study focuses on the effect of hard-phase substitution by C₃C₂ in WC-1OCo cemented carbide. An attempt is also made to modify the binder metal cobalt by partial or complete substitution of nickel. Specimens were prepared using the standard liquid-phase sintering process and were tested for sintered porosity, mechanical properties, corrosion resistance, and microstructural parameters. Results confirm the findings of earlier workers regarding grain refinement and improvement of mechanical properties upon the addition of small amounts (<2 wt%) of Cr₃C₂. Modification of the binder phase improves indentation fracture toughness and corrosion resistance. Addition of Cr₃C₂ independent of the binder type improves corrosion resistance.     

基于用“动态汛限水位”来利用雨洪资源

雨洪资源的依法利用,早已在国外广泛展开。国内的雨洪资源利用,还面临着重新计算汛限水位高度,然后再依法予以重新确认的难题。唯有如此,才能缓解各级行政部门为了多产粮而＂压＂水库管理部门不顾风险的超汛限蓄水。因此,现阶段用＂动态汛限水位＂来化解矛盾,使水库管理部门从被迫接受潜规则的超汛限蓄水,转变为可以摆上台面的依法科学合理...     

高职国际商务类专业毕业环节考核模式比较研究

随着越来越多的学者对高职院校毕业环节考核模式的合理性和可行性提出质疑,很多高职院校都纷纷开始进行一些新模式的探索和改革.对此就现状开展调查,并从结果入手,对目前高职院校国际商务专业群中所采用的多种考核模式进行分析和比较,探寻真正切合高职教育理念、符合国际商务专业群特点的理想考核模式,并为所有高职文科类专业提供借鉴和参考...     

论文科院校计算机类课程机房授课势在必行

针对文科院校计算机类课程操作性强的特点,对比分析了传统的多媒体+机房的授课模式与机房授课模式的优缺点,提出了计算机类课程机房授课模式的改革思路,介绍了该模式应具备的条件和具体的实施过程。     

Approximation algorithm for coloring of dotted interval graphs

Dotted interval graphs were introduced by Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348] as a generalization of interval graphs. The problem of coloring these graphs found application in high-throughput genotyping. Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] improves the approximation ratio of Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In this work we improve the approximation ratio of Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] and Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In the exposition we develop a generalization of the problem of finding the maximum number of non-attacking queens on a triangle.     

Limit load and shakedown analysis of plastic structures under stochastic uncertainty

Problems from plastic analysis are based on the convex, linear or linearised yield/strength condition and the linear equilibrium equation for the stress (state) vector. In practice one has to take into account stochastic variations of several model parameters. Hence, in order to get robust maximum load factors, the structural analysis problem with random parameters must be replaced by an appropriate deterministic substitute problem. A direct approach is proposed based on the primary costs for missing carrying capacity and the recourse costs (e.g. costs for repair, compensation for weakness within the structure, damage, failure, etc.). Based on the mechanical survival conditions of plasticity theory, a quadratic error/loss criterion is developed. The minimum recourse costs can be determined then by solving an optimisation problem having a quadratic objective function and linear constraints. For each vector a(·) of model parameters and each design vector x, one obtains then an explicit representation of the “best” internal load distribution F^∗. Moreover, also the expected recourse costs can be determined explicitly. Consequently, an explicit stochastic nonlinear program results for finding a robust maximal load factor μ^∗. The analytical properties and possible solution procedures are discussed.     

基于信任域的移动adhoc网络信任模型研究

详细阐述了基于信任域的信任模型策略分析、模型的基本设计思想、模型中的数据结构,探讨了保障簇代理安全性的措施,研究了计算机信任值及修正信任值的方法。     

语义桌面环境下一种基于概念图的文档检索方法

语义桌面作为语义Web的一个重要分支,可以为个人计算机用户提供丰富的元数据,用以记录桌面文档的各种特征。这些特征包括文件的常规属性和与用户行为相关的属性,它们为桌面文档检索提供帮助。受到"概念图"理论的启发,本文提出了一种语义桌面环境下的文档检索算法。该算法能有效地利用语义桌面提供的元数据建立一种便于快速查找的文档索引结构,迅速地确定用户查询与桌面文档之间的投影算子。实验表明,该算法的时间效率比以往的基于匹配推理的投影算法有很大的提高,可以在很大程度上满足用户对桌面文档进行快速检索的需求。     

GML模式匹配技术研究

GML是基于XML的空间信息编码标准。GML模式匹配技术作为实现应用模式的集成与共享的关键技术,与GML解析机理和实现技术密切相关。本文详细介绍了关于GML模式匹配的概念;给出了匹配方法的步骤、算法及已所实现的模式匹配详细流程,包括语意与结构相似度判断以及权重的设置;最后,对匹配过程中包含的不确定因素进行了分析与讨论。     

一种基于图论的聚类算法NeiMu

提出一种新的基于图论的聚类算法NeiMu。该算法首先分析数据中的对象,寻找每个对象的k近邻,根据k近邻关系构造k近邻有向图,然后通过k近邻有向图中的k-互邻居关系构造k-聚类图,发现数据中的自然聚类。算法的特点是根据数据之间的互为k近邻关系确定数据中的自然簇,而不必引入其他方法来划分小簇,从而能够保证对象不会被错误聚类,仅会与其他小簇一起融合到一个大簇中。这一优点可以有效保证NeiMu算法的聚类质量。而且,NeiMu算法给出的这种类似自底向上的层次聚类结果还有利于用户根据渐变的结果确定最佳的k值。实验结果表明,该算法对密度变化大的数据、大小相差大的数据、任意分布形状的数据均具有很好的聚类质量,对孤立点也很健壮。