光突发交换边缘路由器性能分析

本文详细分析了各种因素对光突发交换边缘路由器的性能的影响.结果显示,不同服务等级的时延要求可以通过控制组装的最大时延得以保证;不同等级数据包长的大范围变动会导致信道分配的不公平性;边缘节点越多,丢包率越高;在总输出容量一定的情况下,增加输出数据信道数可以在获得低的丢包率的同时达到较高的通道利用率,但随着边缘节点数的增加,增加输出信道数对丢包率的改善作用下降.     

光锥与CCD耦合器件调制传递函数的测试方法

采用直接对倾斜刀口成像的方法测量光锥与CCD耦合器件的调制传递函数.这种方法对静止刀口成像,利用刀口与光锥纤维列间的一定倾斜角度,在垂直于刀口的不同行之间形成不同的值,代替了传统刀口扫描中的扫描装置,并无需保证刀口与阵列的平行,相应地减小了测量误差. 在数据处理中采用了二次平均法,即对同一幅图像得出的不同位置值进行平均及多次测量结果平均,在一定程度上消除了由于离散性产生的空间非平移不变性的影响.     

迈克尔逊干涉仪实验中系统误差的发现及处理

改变传统观念,重视系统误差的发现及处理,培养发现问题、解决问题的能力。     

基于图像处理的人眼注视方向检测研究

提出了一种基于图像处理技术以实现人眼注视方向的实时检测方法。研究了人眼瞳孔、眼眶的位置、形状及其与视线方向的关系。以人眼注视不同方向时,眼睛瞳孔位置和眼眶形状产生的差异为基础,通过对所拍摄的眼部图片进行实时处理与分析,实现了对人眼注视方向的实时检测。实验结果表明了该方法的可行性及有效性。     

Edge, vertex and mixed fault diameters

Let denote the maximum diameter among all subgraphs obtained by deleting q edges of G. Let denote the maximum diameter among all subgraphs obtained by deleting p vertices of G. We prove that for all meaningful a. We also define mixed fault diameter , where p vertices and q edges are deleted at the same time. We prove that for 0<la, , and give some examples.     

THREE-DIMENSIONAL NUMERICAL LOCALIZATION OF IMPERFECTIONS BASED ON A LIMIT MODEL IN ELECTRIC FIELD AND A LIMIT PERTURBATION MODEL

From a limit model in electric field obtained by letting the frequency vanish in the time-harmonic Maxwell equations, we consider a limit perturbation model in the tangential boundary trace of the curl of the electric field for localizing numerically certain small electromagnetic inhomogeneities, in a three-dimensional bounded domain. We introduce here two localization procedures resulting from the combination of this limit perturbation model with each of the following inversion processes： the Current Projection method and an Inverse Fourier method. Each localization procedure uses, as data, a finite number of boundary measurements, and is employed in the single inhomogeneity case; only the one based on an Inverse Fourier method is required in the multiple inhomogeneities case. Our localization approach is numerically suitable for the context of inhomogeneities that are not purely electric. We compare the numerical results obtained from the two localization procedures in the single inhomogeneity configuration, and describe, in various settings of multiple inhomogeneities, the results provided by the procedure based on an Inverse Fourier method.     

OPTIMAL ERROR ESTIMATES FOR NEDELEC EDGE ELEMENTS FOR TIME-HARMONIC MAXWELL'S EQUATIONS

In this paper, we obtain optimal error estimates in both L^2-norm and H（curl）-norm for the Nedelec edge finite element approximation of the time-harmonic Maxwell＇s equations on a general Lipschitz domain discretized on quasi-uniform meshes. One key to our proof is to transform the L^2 error estimates into the L^2 estimate of a discrete divergence-free function which belongs to the edge finite element spaces, and then use the approximation of the discrete divergence-free function by the continuous divergence-free function and a duality argument for the continuous divergence-free function. For Nedelec＇s second type elements, we present an optimal convergence estimate which improves the best results available in the literature.     

Edge quantisation of elliptic operators

The ellipticity of operators on a manifold with edge is defined as the bijectivity of the components of a principal symbolic hierarchy , where the second component takes values in operators on the infinite model cone of the local wedges. In the general understanding of edge problems there are two basic aspects: Quantisation of edge-degenerate operators in weighted Sobolev spaces, and verifying the ellipticity of the principal edge symbol which includes the (in general not explicitly known) number of additional conditions of trace and potential type on the edge. We focus here on these questions and give explicit answers for a wide class of elliptic operators that are connected with the ellipticity of edge boundary value problems and reductions to the boundary. In particular, we study the edge quantisation and ellipticity for Dirichlet–Neumann operators with respect to interfaces of some codimension on a boundary. We show analogues of the Agranovich–Dynin formula for edge boundary value problems. Nicoleta Dines and Bert-Wolfgang Schulze were supported by Chinese-German Cooperation Program “Partial Differential Equations”, NNSF of China and DFG of Germany. Xiaochun Liu was supported by NNSF of China through Grant No. 10501034, and Chinese-German Cooperation Program “Partial Differential Equations”, NNSF of China and DFG of Germany.     

Approximating the maximum 2- and 3-edge-colorable subgraph problems

For a fixed value of a parameter k≥2, the Maximum k-Edge-Colorable Subgraph Problem consists in finding k edge-disjoint matchings in a simple graph, with the goal of maximising the total number of edges used. The problem is known to be -hard for all k, but there exist polynomial time approximation algorithms with approximation ratios tending to 1 as k tends to infinity. Herein we propose improved approximation algorithms for the cases of k=2 and k=3, having approximation ratios of 5/6 and 4/5, respectively.     

A new type of edge-derived vertex coloring

We study the minimum number of weights assigned to the edges of a graph G with no component K₂ so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.