Effect of crystalline lens surfaces and refractive index on image quality by model simulation analysis

The surfaces and refractive index of crystalline lens play an important role in the optical performance of human eye.On the basis of two eye models,which are widely applied at present,the effect of lens surfaces and its refractive index distribution on optical imaging is analyzed with the optical design software ZEMAX (Zemax Development Co.,San Diego,USA).The result shows that good image quality can be provided by the aspheric lens surfaces or (and) the gradient-index (GRIN) distribution.It has great potential in the design of intraocular lens (IOL).The eye models with an intraocular implantation are presented.     

图上Nordhaus-Gaddum型的符号全控制数的界

函数f:V(G)→{-1,1}称为图G的符号全控制函数,如果对每一个开邻域集上的点的函数值的和都大于等于1.符号全控制函数的权值是指图中所有点的函数值的求和.图的符号全控制数为图中所有符号全控制函数的最小权值.令G表示图G的补图.在该文中,我们研究符号全控制数的Nordhaus-Gaddum型不等式,给出了路与其补图的符号全控制数和的上界,以及图与其补图的符号全控制数和的下界.     

Localization Results for the Meyer-König and Zeller Max-Product Operator

In this article, we investigate the local approximation and shape preserving properties in subintervals for the Meyer-König and Zeller max-product operators. The results obtained put in evidence that in the class of strictly positive continuous functions, the local properties of the nonlinear Meyer-König and Zeller max-product operators are much stronger and more general than those in the case of their linear counterparts.     

Dirac-type generalizations concerning large cycles in graphs

Bondy conjectured a common generalization of various results in hamiltonian graph theory concerning Hamilton and dominating cycles by introducing a notion of PD_λ-cycles (cycles that dominate all paths of lengths at least λ). We show that the minimum degree version of Bondy’s conjecture is true (along with the reverse version) if PD_λ-cycles are replaced by CD_λ-cycles (cycles that dominate all cycles of lengths at least λ). Fraisse proved a minimum degree generalization including a theorem of Nash-Williams for Hamilton cycles as a special case. We present the reverse version of this result including a theorem of Voss and Zuluaga as a special case. Two earlier less known results (due to the author) are crucial for the proofs of these results. All results are sharp in all respects. A number of possible similar generalizations are conjectured as well.     

A concentration result with application to subgraph count

Let H = (V,E) be a k ‐uniform hypergraph with a vertex set V and an edge set E. Let V _p be constructed by taking every vertex in V independently with probability p. Let X be the number of edges in E that are contained in V _p. We give a condition that guarantees the concentration of X within a small interval around its mean. The applicability of this result is demonstrated by deriving new sub‐Gaussian tail bounds for the number of copies of small complete and complete bipartite graphs in the binomial random graph. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

The local flow-box theorem for discretizations the analytic case

The discretization counterpart of the C^w local flow-box theorem, a C^w normal form result for one-step discretizations of ordinary differential equations in the vicinity of nonequilibria is presented. The very same problem in the less smoother function class c^k, k∞ has been investigated in [lo]. The remaining analytic case requires completely different techniques. The proof is based on the parametrized version of a Nash-Moser type implicit function theorem by Belitskii and Tkachenko [5,6]. Connections to results on structural stability under discrctization and backward error analysis are also investigated.     

A note on additive results for the Drazin inverse

For two square matrices that commute, we present some additive results for the Drazin inverse. We also give the application to relative perturbation of eigenvalues when the perturbed matrix commutes with the original matrix and perturbation bounds of the Drazin inverse.     

Solution concepts in vector optimization: a fresh look at an old story

Over the past decades various solution concepts for vector optimization problems have been established and used: among them are efficient, weakly efficient and properly efficient solutions. In contrast to the classical approach, we define a solution to be a set of efficient solutions on which the infimum of the objective function with respect to an appropriate complete lattice (the space of self-infimal sets) is attained. The set of weakly efficient solutions is not considered to be a solution, but weak efficiency is essential in the construction of the complete lattice. In this way, two classic concepts are involved in a common approach. Several different notions of semicontinuity are compared. Using the space of self-infimal sets, we can show that various originally different concepts coincide. A Weierstrass existence result is proved for our solution concept. A slight relaxation of the solution concept yields a relationship to properly efficient solutions.