工程选材的模糊综合评判及其应用

为了研究模糊综合评判在工程材料选择中的应用,以刀具材料为例,根据由专家评分得到的权重集A、模糊变换确定的单因素评判矩阵R,在5种评判因素、两种工况下,对8种经初选后的刀具材料进行模糊综合评判.结果表明,两种工况下选出的最佳刀具材料分别为Cr4Mo8V2和Al2O3陶瓷,这和采用加权性质分析法得出的选择结果一致.说明采用模糊综合评判,对众多选材因素进行定量分析,从而选出最佳材料,是工程选材的一条可行途径.     

移动通信直放站的工程设计

介绍了直放站的应用特点以及工作原理,阐述了在设计过程中直放站站址选择、前期勘测及理论测算方法,指出了设计中需要注意的几个问题。     

如何建立正确的学术期刊评价体系——兼论《核心期刊与期刊评价》

通过对《核心期刊与期刊评价》一书的解读，提出了现行的核心期刊和期刊评价体系已经发生扭曲的论点，并探讨如何建立科学完善的核心期刊遴选和评价制度。     

一种新的免疫克隆选择算法

提出了一种新的人工免疫系统算法——免疫克隆选择算法,描述了算法的操作过程.采用函数优化仿真实验与进化算法进行比较,结果表明免疫克隆选择算法收敛速度快,求解精度高,稳定性好,并能有效地克服早熟问题和骗问题.     

井下无线通信中的弱信号检测技术

介绍了煤矿井下无线通信现状,分析了技术上存在的问题——巷道条件对无线传输的影响、弱信号接收困难和井下环境噪声的干扰,对解决方案进行了探讨。同时指出,借鉴陆地移动通信技术解决方案可以解决煤矿井下移动通信难题。     

浅谈建筑装饰材料

建筑装饰材料是建筑装饰工程的物质基础,装饰材料选用应慎重考虑造型、功能、用途等方面的原因,才能更好地体现出设计者的艺术风格和审美情趣。     

Study on the Rotor Spinning Processing of Spun Silk/CashmereBlended Yarn

This paper studies roto spinning blended yarn producedof spun silk and cashmere. Nine samples were spun, from threedifferent opening rollers and different navels.According to theUster test results of yarn quality prioerties, optimum selection isdane by using analysis method of combining fuzzy decision-makingand fuzzy pattern classification.Expermental plan is designedbased on universal rotated experitmental design, and the method ofconfined optimization is used to optimize the speed of openingtaller, the speed of rotor and twist factor, according to the resultsof yarn quality test by Uster.     

Feature Selection Based on Difference and Similitude in Data Mining

Feature selection is the pretreatment of data mining. Heuristic search algorithms are often used for this subject. Many heuristic search algorithms are based on discernibility matrices, which only consider the difference in information system. Because the similar characteristics are not revealed in discernibility matrix, the result may not be the simplest rules. Although differencesimilitude（DS） methods take both of the difference and the similitude into account, the existing search strategy will cause some important features to be ignored. An improved DS based algorithm is proposed to solve this problem in this paper. An attribute rank function, which considers both of the difference and similitude in feature selection, is defined in the improved algorithm. Experiments show that it is an effective algorithm, especially for large-scale databases. The time complexity of the algorithm is O（｜ C ｜^2｜U ｜^2）.     

Rapid genome evolution in Pms 1 region of rice revealed by comparative sequence analysis

Pms1, a locus for photoperiod sensitive genic male sterility in rice, was identified and mapped to chromosome 7 in previous studies. Here we report an effort to identify the candidate genes for Pms1 by comparative sequencing of BAC clones from two cultivars Minghui 63 and Nongken 58, the parents for the initial mapping population. Annotation and comparison of the sequences of the two clones resulted in a total of five potential candidates which should be functionally tested. We also conducted com-parative analysis of sequences of these two cultivars with two other cultivars, Nipponbare and 93-11, for which sequence data were available in public databases. The analysis revealed large differences in sequence composition among the four genotypes in the Pms1 region primarily due to retroelement activity leading to rapid recent growth and divergence of the genomes. High levels of polymorphism in the forms of indels and SNPs were found both in intra- and inter-subspecific comparisons. Dating analysis using LTRs of the retroelements in this region showed that the substitution rate of LTRs was much higher than reported in the literature. The results provided strong evidence for rapid genomic evolution of this region as a consequence of natural and artificial selection.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.