拉盖尔-高斯光束通过有硬边光阑光学系统的传输

采用将硬边光阑展为有限个复高斯函数之和的方法,得到了拉盖尔-高斯光束通过有硬边光阑近轴ABCD光学系统中传输的近似解析公式,作了数值计算以说明传输公式的应用,并对使用该式的误差作了讨论。     

一类非线性方程解的存在和唯一性及在图像中的应用

本文我们给出一个修正的非线性扩散方程模型，与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分：卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题，因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性，同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型，并且给出几个具体图像在该模型下处理结果。     

基于遗传算法的图像边缘信息链表匹配技术

提出了一种基于遗传算法的图像边缘信息链表匹配方法。首先,采用CANNY算子的方法提取图像边缘;然后,将图像边缘信息链表化;最后,基于链表化结果利用遗传算法进行链表匹配。该方法能够减少匹配过程中的计算量,且能实现高效匹配。通过仿真实验,验证了该方法的性能。     

The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

图像边缘检测在关节镜图像处理中的应用

主要论述了采用图像边缘检测和图像跟踪算法对采集的关节镜图像进行图像处理和分析的过程。在图像处理的基础上，系统自动测量出指定目标的形状参数，实现了系统的测量要求。本研究为实现关节镜手术过程图像的保存和手术的准确性提供了可行的方法。     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003     

图的边韧性度

文[1]中,定义图G(V,E)的边韧性度定义为min{(|S|+T(G-S))/(ω(G-S)):S?E(G)},这里,T-(G-S)和ω(G-S)分别表示G-S中最大分支的顶点数和连通分支数.这是一个能衡量网络图稳定性较好的参数,因为它不仅考虑到了图G-S的分支数也考虑到了它的阶数.在以前的工作中,作者得到了边韧性度图的一个充要条件.利用这些结果证明了K-树是严格边韧性度图,并找到了边韧性度与较高阶的边坚韧度和边坚韧度之间的关系.     

基于分层光学扫描的三维数字化测量技术

采用切削分层光扫描测量与计算机数据信息合成相结合的方法，有效地解决了具有复杂内外腔结构零件的三维数字化测量。该方法比传统三维测量速度快、自动化程度高，能同时准确测量零件内外腔表面，零件边缘测量误差可控制在CCD两个像素内。利用获取的铝合金精密小箱体三维数据，在计算机上重构了零件的三维模型，并用RP技术制造出了零件物理原形。     

形态学边缘检测的新算法及其应用

提出了一种基于数学形态学的边缘检测的所算法，该算法具有简便和灵活可编程控制等优点，比原来主算法更国完善，在实际应用中有着很好的前景，并给出了实验结果。     

An auxiliary theorem for stability analysis in the presence of interval-valued parameters

A theorem which helps to determine the boundary of the image of an interval inR ⁿ under a differentiable mapping,F:R ⁿ C, is expounded. Examples illustrating the application of the theorem are given.