Mean curvature flow with a forcing term in minkowski space

We study the forced mean curvature flow of graphs in Minkowski space and prove longtime existence of solutions. When the forcing term is a constant, we prove convergence to either a constant mean curvature hypersurface or a translating soliton – depending on the boundary conditions at infinity. It is a pleasure to thank my PhD advisors Klaus Ecker and Gerhard Huisken for their assistance and encouragement. I also thank Maria Athanassenas, Oliver Schnürrer and Marty Ross for their interest and useful comments, and the Max Planck Gesellschaft for financial support.     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

透镜初级球差的横向剪切干涉条纹研究

利用玻璃平行平板构成简单的横向剪切干涉仪可以观察到单薄透镜形成的准直光束的剪切干涉条纹,由干涉条纹分布求出对应的几何像差和离焦量.用焦距为190 mm的单薄透镜做实验,实验结果与计算机模拟结果符合,说明可以从剪切干涉条纹的分布求出透镜的轴向调整误差和初级球差.     

CRT显示器稳定性实验研究

用屏幕色度计对一台SONY-G520显示器的显色特性进行了测量,研究了其开机稳定性和短、中、长期内的色差及色度偏差。实验结果表明,开机后,显示器的亮度Y和色度x,y分别可在2h,30min和1h达到相对稳定状态,且在达到相对稳定后,在短、中、长期内的平均色差分别为0.0611,0.1469和1.2536CIELAB色差单位;在中期内,Y,x,y,L,a,b的平均偏差分别为0.0663,0.0008,0.0015,0.0695,0.4740和0.1766。通过对显示器稳定性的测量,为在对比度敏感测量和色貌模型、图像质量、图像感知模型评价等研究领域中用显示器进行实验研究奠定了基础。     

On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

Minimum boundary touching tilings of polyominoes

We study the problem of tiling a polyomino P with as few squares as possible such that every square in the tiling has a non‐empty intersection with the boundary of P . Our main result is an algorithm which given a simply connected polyomino P computes such a tiling of P . We indicate how one can improve the running time of this algorithm for the more restricted row‐column‐convex polyominoes. Finally we show that a related decision problem is in NP for rectangular polyominoes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Variational extension of the mean spherical approximation to arbitrary dimensions

We generalize a variational principle for the mean spherical approximation for a system of charged hard spheres in 3D to arbitrary dimensions. We first construct a free energy variational trial function from the Debye-Hückel excess charging internal energy at a finite concentration and an entropy obtained at the zero-concentration limit by thermodynamic integration. In three dimensions the minimization of this expression with respect to the screening parameter leads to the mean spherical approximation, usually obtained by solution of the Ornstein-Zernike equation. This procedure, which interpolates naturally between the zero concentration/coupling limit and the high-concentration/ coupling limit, is extended to arbitrary dimensions. We conjecture that this result is also equivalent to the MSA as originally defined, although a technical proof of this point is left for the future. The Onsager limitT ΔS ^MSA /ΔE ^MSA → 0 for infinite concentration/coupling is satisfied for all d ≠ 2, while ford=2 this limit is 1. On leave from Department of Physics, University of Puerto Rico, Mayagüez Campus, Mayagüez, Puerto Rico, 00681.     

Multivariate Gini Indices

Two extensions of the univariate Gini index are considered:R_D, based on expected distance between two independent vectors from the same distribution with finite meanμ ^d; andR_V, related to the expected volume of the simplex formed fromd+1 independent such vectors. A new characterization ofR_Das proportional to a univariate Gini index for a particular linear combination of attributes relates it to the Lorenz zonoid. TheLorenz zonoidwas suggested as a multivariate generalization of the Lorenz curve.R_Vis, up to scaling, the volume of the Lorenz zonoid plus a unit cube of full dimension. Whend=1, bothR_DandR_Vequal twice the area between the usual Lorenz curve and the line of zero disparity. Whend>1, they are different, but inherit properties of the univariate Gini index and are related via the Lorenz zonoid:R_Dis proportional to the average of the areas of some two-dimensioned projections of the lift zonoid, whileR_Vis the average of the volumes of projections of the Lorenz zonoid over all coordinate subspaces.     

三维Minkowski空间中的曲面及其可积性

利用可积系统的思想,借助三维Minkowski空间L3的矩阵模型,研究了L3中具有调和逆平均曲率的类空曲面和洛伦兹调和逆平均曲率类时曲面的可积性及其形变.     

关于三次高斯和的均值

主要研究三次高斯和的均值性质，并给出一个较强的渐近公式。