Synthesis of nano-polycrystalline diamond from glassy carbon at pressures up to 25 GPa

ABSTRACT

Nano-polycrystalline diamond (NPD) with various grain sizes has been synthesized from glassy carbon at pressures 15–25?GPa and temperatures 1700–2300°C using multianvil apparatus. The minimum temperature for the synthesis of pure NPD, below which a small amount of compressed graphite was formed, significantly increased with pressure from ～1700°C at 15?GPa to ～1900°C at 25?GPa. The NPD having grain sizes less than ～50?nm was synthesized at temperatures below ～2000°C at 15?GPa and ～2300°C at 25?GPa, above which significant grain growth was observed. The grain size of NPD decreases with increasing pressure and decreasing temperature, and the pure NPD with grain sizes less than 10?nm is obtained in a limited temperature range around 1800–2000°C, depending on pressure. The pure NPD from glassy carbon is highly transparent and exhibits a granular nano-texture, whose grain size is tunable by selecting adequate pressure and temperature conditions.     

一种改进的新三步搜索算法

在对三步法工作原理进行研究的基础上提出了新三步搜索算法（NITSS）。该方法充分利用视频序列运动矢量概率分布上的中心偏置特性．在三步搜索算法的基础上引入了十字型分布的4个点构成搜索点群。实验结果表明。新三步搜索算法解决了三步法的小运动估计效果较差问题．提高了搜索精度，保持了三步法的高效率。     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

基于AFM的微结构加工实验研究

本文建立了微动工作台和原子力显微镜相结合的微加工系统，在该系统上采用金刚石针尖进行微加工实验，与SPI系统本身的刻划软件刻划出的图形进行了比较分析，得出这个系统适合微结构的加工；并给出了采用该方法加工的1111面及多边形面微结构；还分析了金刚石针尖几何角度及SPM和工作台的相关参数对加工的影响。     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

一个线性约束优化问题的广义梯度投影法

本文对线性约束优化问题提出了一个新的广义梯度投影法，该算法采用了非精确线性搜索，并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向．在通常的假设条件下，证明了该算法的整体收敛性和超线性收敛速度．     

非晶金刚石膜的性能及其应用

非品金刚石薄膜具有超高硬度等一系列优异的特殊性能，为工程界孜孜追求的材料表面镀膜。用百纳科技公司研发制造的过滤阴极真空电弧离子镀膜机镀制的非晶金刚石薄膜，SP^3金刚石结构量≥80％，硬度高，膜／基结合力高，摩擦系数小，耐磨损，耐腐蚀，透光率高，在电子，机械，光学，生物医学上有广泛应用前景。我们已在视窗玻璃，丝锥，模具，硬质合金刀头等产品上成功应用。