Investigation of the grain coarsening behavior of some Aluminum alloys

Grain coarsening tests were carried out on Al-4.5 pct Cu and Al-4.5 pct Si alloys. The effects of three variables, melt composition, pour temperature, and mold temperature, were determined. It was found that the macrostructure generally coarsened with increased pour and mold temperatures. Coarsening was extreme in the unrefined alloys but was retarded by the active grain refiners like titanium and columbium. The effect of boron was spectacular in suppressing coarsening tendencies. The results of the investigation support the carbide theory of nucleation as opposed to the peritectic theory.     

Chromium distribution between liquid iron and molten basic slags

An equilibrium study was made of the distribution of chromium and oxygen between liquid iron, containing less than 1 pct Cr, and simple slags of the CaO(MgO)-SiO₂-FeO-Cr₂O₃ type in the temperature range 1526° to 1734°C The effects of slag oxidation, temperature, and basicity were observed.     

激光快速成形Rene′88DT高温合金的时效强化研究

研究了时效时间对激光快速成形后时效硬化镍基高温合金Rene′88DT中沉淀相组织演化和力学性能的影响。发现随时效时间的增加，沉淀相y’略有长大，颗粒之间发生大颗粒吞噬小颗粒的粗化，时效40h后沉淀相颗粒粗化明显。对经不同时间时效后的激光快速成形Rene′88DT试样进行了硬度测试。结果显示，在时效时间为28h时，硬度有一峰值HRC49。在此基础上，采用1165℃，2h固溶、空冷＋760℃，28h时效的热处理工艺对激光快速成形标准拉伸棒样进行了热处理，拉伸结果显示成形件的抗拉强度较激光沉积态提高了400MPa，屈服强度接近同种材料的粉末锻造水平。     

Research on graphite powders used for HTR-PM fuel elements

Different batches of natural graphite powders and electrographite powders were characterized by impurity, degree of graphitization, particle size distribution, specific surface area, and shape characteristics. The graphite balls consist of proper mix-ratio of natural graphite, electrographite and phenolic resin were manufactured and characterized by thermal conductivity, anisotropy of thermal expansion, crush strength, and drop strength. Results show that some types of graphite powders possess very high purity, degree of graphitization, and sound size distribution and apparent density, which can serve for matrix graphite of HTR-PM. The graphite balls manufactured with reasonable mix-ratio of graphite powders and process method show very good properties. It is indicated that the properties of graphite balls can meet the design criterion of HTR-PM. We can provide a powerful candidate material for the future manufacture of HTR-PM fuel elements.     

Video summarization via minimum sparse reconstruction

The rapid growth of video data demands both effective and efficient video summarization methods so that users are empowered to quickly browse and comprehend a large amount of video content. In this paper, we formulate the video summarization task with a novel minimum sparse reconstruction (MSR) problem. That is, the original video sequence can be best reconstructed with as few selected keyframes as possible. Different from the recently proposed convex relaxation based sparse dictionary selection method, our proposed method utilizes the true sparse constraint L₀ norm, instead of the relaxed constraint _L2,1$L_{2,1}$ norm, such that keyframes are directly selected as a sparse dictionary that can well reconstruct all the video frames. An on-line version is further developed owing to the real-time efficiency of the proposed MSR principle. In addition, a percentage of reconstruction (POR) criterion is proposed to intuitively guide users in obtaining a summary with an appropriate length. Experimental results on two benchmark datasets with various types of videos demonstrate that the proposed methods outperform the state of the art.     

Zipf定律与网络信息计量学

作为文献计量学重要定律的Zipf定律已在许多领域得到较广泛的应用,网络信息计量学伴随着网络信息的激增而受到人们越来越大的关注。该文结合搜索结果数量的分布情况,提出了在网络信息计量学中仍然存在Zipf定律的猜想,并采用公开的词语集在几个代表性的搜索引擎中进行实验验证,证实了搜索结果数目近似服从Zipf定律的结论,其中Baidu与So搜索结果的Zipf指数为0.003。     

External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes

This paper studies the problem of how to conduct external sorting on flash drives while avoiding intermediate writes to the disk. The focus is on sort in portable electronic devices, where relations are only larger than the main memory by a small factor, and on sort as part of distributed processes where relations are frequently partially sorted. In such cases, sort algorithms that refrain from writing intermediate results to the disk have three advantages over algorithms that perform intermediate writes. First, on devices in which read operations are much faster than writes, such methods are efficient and frequently outperform Merge Sort. Secondly, they reduce flash cell degradation caused by writes. Thirdly, they can be used in cases where there is not enough disk space for the intermediate results. Novel sort algorithms that avoid intermediate writes to the disk are presented. An experimental evaluation, on different flash storage devices, shows that in many cases the new algorithms can extend the lifespan of the devices by avoiding unnecessary writes to the disk, while maintaining efficiency, in comparison with Merge Sort.     

Strong Convergence Analysis of Batch Gradient-Based Learning Algorithm for Training Pi-Sigma Network Based on TSK Fuzzy Models

By combining of the benefits of high-order network and TSK (Tagaki-Sugeno-Kang) inference system, Pi-Sigma network is capable to dispose with the nonlinear problems much more effectively, which means it has a compacter construction, and quicker computational speed. The aim of this paper is to present a gradient-based learning method for Pi-Sigma network to train TSK fuzzy inference system. Moreover, some strong convergence results are established based on the weak convergence outcomes, which indicates that the sequence of weighted fuzzy parameters gets to a fixed point. Simulation results show the modified learning algorithm is effective to support the theoretical results.     

Image inpainting algorithm based on TV model and evolutionary algorithm

With the development of modern image processing techniques, the numbers of images increase at a high speed in network. As a new form of visual communication, image is widely used in network transmission. However, the image information would be lost after transmission. In view of this, we are motivated to restore the image to make it complete in an effective and efficient way in order to save the network bandwidth. At present, there are two main methods for digital image restoration, texture-based method and non-textured-based method. In the texture-based method, Criminisi algorithm is a widely used algorithm. However, the inaccurate completion order and the inefficiency in searching matching patches are two main limitations of Criminisi algorithm. To overcome these shortcomings, in this paper, an exemplar image completion based on evolutionary algorithm is proposed. In the non-textured-based method, total variation method is a typical algorithm. An improved total variation algorithm is proposed in this paper. In the improved algorithm, the diffusion coefficients are defined according to the distance and direction between the damaged pixel and its neighborhood pixel. Experimental results show that the proposed algorithms have better general performance in image completion. And these two new algorithms could improve the experience of network surfing and reduce the network communication cost.