Statistics of strange attractors by generalized cell mapping

It is proposed in this paper to use the generalized cell mapping to locate strange attractors of dynamical systems and to determine their statistical properties. The cell-to-cell mapping method is based upon the idea of replacing the state space continuum by a large collection of state space cells and of expressing the evolution of the dynamical system in terms of a cell-to-cell mapping. This leads to a Markov chain which in turn allows us to compute all the statistical properties as well as the invariant distribution. After a general discussion, the method is applied in this paper to strange attractors of a variety of systems governed either by point mappings or by differential equations. The results indicate that it is a viable, effective and attractive method. Some comments on this method in comparison with the method of direct iteration will also be made.     

多圆柱上的完全准凸映射

在C~n中有界凸Reinhardt域上讨论了一类介于凸映射类与星形映射类之间的“完全准凸映射类”.特别地,在C~n中的多圆柱上给出了完全准凸映射的分解定理,得到了多圆柱上判别凸映射的一个改进的充分条件.     

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces

This paper deals with the connectedness of the cone-efficient solution set for vector optimization inlocally convex Hausdorff topological vector spaces.The connectedness of the cone-efficient solution set is provedfor multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set ofalternatives.The generalized saddle theorem plays a key role in the proof.     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

Non-expansive Mappings and Iterative Methods in Uniformly Convex Banach Spaces

In this article, we will investigate the properties of iterative sequence for non-expansive mappings and present several strong and weak convergence results of successive approximations to fixed points of non-expansive mappings in uniformly convex Banach spaces. The results presented in this article generalize and improve various ones concerned with constructive techniques for the fixed points of non-expansive mappings.     

Sensitivity of Homogeneity Mapping of Dielectric Wafer Using Millimeter Waves

A plane electromagnetic wave normally falling on a surface of a dielectric plate has been considered to investigate the sensitivity of the dielectric constant homogeneity mapping in the dielectric wafer by measuring the phase and/or the amplitude of the millimeter wave reflected from or transmitted through it. Measurement conditions at which the highest sensitivity might be achieved are established. The sensitivity at Fabry-Perot resonance conditions as well as at frequency shifted from resonance has been considered.     

基于Zernike多项式表示色域边界的色域映射

在彩色图像的跨媒体复制中,由于不同媒体有不同的色域,所以在大多数情况下色域映射是不可避免的。不论采用何种映射算法,色域映射的第一步是确定有关媒体的色域边界。目前大多数的色域边界都是用一组测量的或用其它方法得到的离散数据来表示的。然而,由于这种表示方式是利用一组离散数据来实施色域映射的两个基本处理(即确定任一指定的等色调面平面中色域的边缘线以及确定色域边界与一条映射线的交点),比较复杂和费时,因此希望找到一种色域边界的解析表达式来解决这一问题。简述了不久前提出的一种解析函数色域边界表示方法,并用实例说明了如何利用这种解析表示(Zernike多项式)来实现上述的边缘线确定和交点确定。最后给出了几种映射算法的色域映射完整过程及其结果。     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20