95W-Ni-Fe 合金工艺缺陷的 SAM 和 XPS 分析

藉助扫描俄歇探针、Ｘ射线光电子谱等分析了９５Ｗ－Ｎｉ－Ｆｅ合金碳污染和氧化的本质。发现，碳污染试样中碳的化学状态主要为石墨，少量为铁或镍的有机化合物，这些物质的界面富集使材料脆化。钨合金氧化后，氧大量富集于钨／粘结相界面，使沿着该界面的断裂更容易发生。     

Tracking non-rigid objects in clutter background with geometricactive contours

A new variational framework of geometric active contours to track multiple non-rigid moving objects in the clutter background is presented. Incorporating motion edge information, it consists of motion detection and tracking stages. The results of experiments are promising and demonstrate the validity of the proposed framework     

Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis

High-dimensional data appear in many applications of data mining, machine learning, and bioinformatics. Feature reduction is commonly applied as a preprocessing step to overcome the curse of dimensionality. Uncorrelated Linear Discriminant Analysis (ULDA) was recently proposed for feature reduction. The extracted features via ULDA were shown to be statistically uncorrelated, which is desirable for many applications. In this paper, an algorithm called ULDA/QR is proposed to simplify the previous implementation of ULDA. Then, the ULDA/GSVD algorithm is proposed, based on a novel optimization criterion, to address the singularity problem which occurs in undersampled problems, where the data dimension is larger than the sample size. The criterion used is the regularized version of the one in ULDA/QR. Surprisingly, our theoretical result shows that the solution to ULDA/GSVD is independent of the value of the regularization parameter. Experimental results on various types of data sets are reported to show the effectiveness of the proposed algorithm and to compare it with other commonly used feature reduction algorithms.     

气流粉碎技术在氢氧化铝生产中的应用

论述了氢氧化铝粉体填料的用途、应用现状及加工现状,该产品目前在供应与需求方面显现出的矛盾.针对此项问题阐述了选用气流粉碎磨生产氢氧化铝粉体材料的目的、意义,充分对比了气流粉碎磨和普通万能粉碎磨的SiO2%,Fe2O3%,Na2O%,+320%、附水等产品质量指标,产能和电单耗等消耗指标.气流粉碎技术在氢氧化铝粉体生产中应用之后,氢氧化铝粉体填料的质量得到了比较大的提高,创造了可观的经济效益;同时,生产能力有较大幅度提高,且设备自动化程度高,有效减轻了职工的劳动强度.     

航天产品多源可靠性信息的收集与整理--建立可靠性信息数据库

航天产品可靠性信息的来源多样，可靠性信息的时间性、随机性、有价性、时效性和可追溯性等特征，决定了可靠性数据收集应满足真实性、连续性、完整性等基本要求。同时，对多源信息的收集应遵循先进行需求分析，再确定数据收集点并制定数据收集表格的程度进行。给出了信息的适用性准则和信息分类的三维模型。最后结合具体型号航天产品的可靠性工作的要求，给出了可靠性信息数据库系统的整体方案设计。     

担载型含稀土三组份体系在二氧化碳甲烷化反应中的催化性能

用浸渍法制备了一系列氧化锆担载的含稀土Ⅷ族金属催化剂，对其在二氧化碳甲烷化过程中的催化活性作了研究，并用漫反射紫外可见光谱，ＦＴＩＲ等手段对催化剂作了表征。结果表明，含稀土新型催化剂具有催化活性高，目标产物选择性好等优点；稀土主要以氧化物形式存在于催化剂表面，参与对氢及表面含碳物种的吸附及活化；含稀土三组份催化剂的活性与所添加稀土三价离子的４ｆ电子数有关。     

丁苯嵌段共聚物与醋酸乙烯酯本体接枝物表征的研究

本文主要对接枝共聚物SBS-g-VAC的红外光谱(IR)、核磁共振潜(NMR)、透射电镜(TEM)、扫描电镜(SEM)的表征工作进行了讨论,表明了接枝物SBS-g-VAC的存在及其结构特征。     

基于本体的BML命令语义标注方法

作战管理语言（Battle Management Language,BML）是一种无歧义的语言规范,用于解决指控和仿真系统间的互操作问题。针对BML命令缺乏语义信息,难以被计算机理解和自动处理的问题,分析了BML的五视图体系结构,引入了BNF形式化语法,并在此基础上提出了一种语义标注方法,对命令中的对象、时间和地理位置等要素进行标注,然后整合各要素来表达整条命令的语义,系统通过解析标注文档可以实现对命令的无歧义理解,最后给出实例予以说明。论文为表达BML命令的语义提出了一种借鉴思路。     

A data access framework for service-oriented rich clients

Facilitated by the SOA and new Web technologies, Service-Oriented Rich Clients (SORCs) compose various Web-delivered services in Web browser to create new applications. The SORCs support client-side data storage and manipulation and provide more features than traditional thin clients. However, the SORCs might suffer from data access issues, mainly due to both client-side incompatible data sources and server-side improper or even undesirable cache strategies. Addressing the data access issues, this paper proposes a data access framework for SORCs. The main contributions of this paper are as follows. First, the framework makes the SORCs accommodate heterogeneous local storage solutions and diverse Web browsers properly. The framework abstracts the underlying details of different local storages and selects the most proper data sources for current SORC in use. Secondly, the framework provides a cache mechanism, which supports client-side customized cache strategies. An adaptive technique for the strategies is also proposed to adjust cache strategies based on users?? historical actions to achieve better performance.     

A group priority earliest deadline first scheduling algorithm

In most priority scheduling algorithms, the number of priority levels is assumed to be unlimited. However, if a task set requires more priority levels than the system can support, several jobs must in practice be assigned the same priority level. To solve this problem, a novel group priority earliest deadline first (GPEDF) scheduling algorithm is presented. In this algorithm, a schedulability test is given to form a job group, in which the jobs can arbitrarily change their order without reducing the schedulability. We consider jobs in the group having the same priority level and use shortest job first (SJF) to schedule the jobs in the group to improve the performance of the system. Compared with earliest deadline first (EDF), best effort (BE), and group-EDF (gEDF), simulation results show that the new algorithm exhibits the least switching, the shortest average response time, and the fewest required priority levels. It also has a higher success ratio than both EDF and gEDF.