Flatness maintenance and roughness reduction of silicon mirror in chemical mechanical polishing process

As an important optical component in laser system,silicon mirror surface is required to have micron-level flatness and subnanometer-level roughness.The research concentrates on how to improve roughness as far as possible while maintaining flatness of silicon mirror surface during chemical mechanical polishing(CMP)process.A polishing edge effect model is established to explain the reason of flatness deterioration,and a roughness theoretical model is set up to get the limit of perfect surface roughness.Based on the models above,a polishing device is designed to maintain the surface flatness,and the optimized polishing process parameters are obtained by orthogonal tests to get a near-perfect surface roughness.Finally the maintenance of flatness and the improvement of roughness can be achieved at the same time in one step of CMP process.This work can be a guide for silicon mirror manufacture to improve optical reflection performance significantly.

Reduction of Reactive-Ion Etching-Induced Ge Surface Roughness by SF6/CF4Cyclic Etching for Ge Fin Fabrication

An SF6/CF4 cyclic reactive-ion etching （RIE） method is proposed to suppress the surface roughness and to opti- mize the morphology of Ge fin, aiming at the fabrication of superior Ge FinFETs for future CMOS technologies. The surface roughness of the Ge after RIE can be sufficiently reduced by introducing SF6-O2 etching steps into the CF4-O2 etching process, while maintaining a relatively large ratio of vertical etching over horizontal etching of the Ge. As a result, an optimized rms roughness of 0.9nm is achieved for Ge surfaces after the SF6/CF4 cyclic etching with a ratio of greater than four for vertical etching over horizontal etching of the Ge, by using a proportion of 60% for SF6-O2 etching steps.

A new ensemble feature selection and its application to pattern classification

Neural network ensemble based on rough sets reduct is proposed to decrease the computational complexity of conventional ensemble feature selection algorithm. First, a dynamic reduction technology combining genetic algorithm with resampling method is adopted to obtain reducts with good generalization ability. Second, Multiple BP neural networks based on different reducts are built as base classifiers. According to the idea of selective ensemble, the neural network ensemble with best generalization ability can be found by search strategies. Finally, classification based on neural network ensemble is implemented by combining the predictions of component networks with voting. The method has been verified in the experiment of remote sensing image and five UCI datasets classification. Compared with conventional ensemble feature selection algorithms, it costs less time and lower computing complexity, and the classification accuracy is satisfactory.

Attribute reduction in interval-valued information systems based on information entropies

Interval-valued data appear as a way to represent the uncertainty affecting the observed values. Dealing with interval-valued information systems is helpful to generalize the applications of rough set theory. Attribute reduction is a key issue in analysis of interval-valued data. Existing attribute reduction methods for single-valued data are unsuitable for interval-valued data. So far, there have been few studies on attribute reduction methods for interval-valued data. In this paper, we propose a framework for attribute reduction in interval-valued data from the viewpoint of information theory. Some information theory concepts, including entropy, conditional entropy, and joint entropy, are given in interval-valued information systems. Based on these concepts, we provide an information theory view for attribute reduction in interval-valued information systems. Consequently, attribute reduction algorithms are proposed. Experiments show that the proposed framework is effective for attribute reduction in interval-valued information systems.

General medical practice in China:evaluation of urban community health care service functions based on a rough set reduction theory

Objective:This study aims to achieve an empirical evaluation on the functional performances of urban community health care services in fi ve administrative districts of Nanchang city in China.Methods:In order to increase effectiveness,data collected from fi ve administrative districts of Nanchang city were processed to exclude redundant information.Rough set reduction theory was brought in to evaluate the performances of community health care services in these districts through calculating key indices’weighed importance.Results:Comprehensive evaluation showed the score rankings from high to low as Qing-yunpu district,Xihu district,Qingshanhu district,Donghu district,and Wanli district.Conclusion:The objective performance evaluation had actually reflected the general situation(including social-economic status)of community health care services in these administrative districts of Nanchang.Attention and practical works of community health service management were needed to build a more harmonious and uniform community health care service system for residents in these districts of Nanchang.

Attribute reduction based on fuzziness of approximation set in multi-granulation spaces

Rough set theory is an important tool to solve uncertain problems. Attribute reduction, as one of the core issues of rough set theory, has been proven to be an effective method for knowledge acquisition. Most of heuristic attribute reduction algorithms usually keep the positive region of a target set unchanged and ignore boundary region information. So, how to acquire knowledge from the boundary region of a target set in a multi-granulation space is an interesting issue. In this paper, a new concept, fuzziness of an approximation set of rough set is put forward firstly. Then the change rules of fuzziness in changing granularity spaces are analyzed. Finally, a new algorithm for attribute reduction based on the fuzziness of 0.5-approximation set is presented. Several experimental results show that the attribute reduction by the proposed method has relative better classification characteristics compared with various classification algorithms.