ZnO nanowire lines and bundles: Template-deformation-guided alignment for patterned field-electron emitters

One-dimensional ZnO materials have been promising for field-emission (FE) application, but how to facially control the alignment of ZnO emitters is still a great challenge especially for patterned display application. Here, we report the fabrication of novel ZnO nanowire (NW) line and bundle arrays for patterned field-electron emitters. The effects of PS template size and heating time on the resulted ZnO nanoarrays were systematically studied. The deformation degree of PS templates was controlled and hence utilized to adjust the alignment of electrochemically deposited ZnO arrays. It was found that the length of NW lines and the density of NW bundles can effectively tuned by the PS template heating time. The optimal FE performance with turn-on electric field as low as of 4.4 V μm⁻¹ and the field-enhancement factor as high as of 1450 were achieved through decreasing the screening effect among the patterned field-electron emitters.     

Rank 2 Ample Vector Bundles on Some Smooth Rational Surfaces

Several classification results for ample vector bundles of rank 2 on Hirzebruch surfaces, and on Del Pezzo surfaces, are obtained. In particular, we classify rank 2 ample vector bundles with _c2 less than seven on Hirzebruch surfaces, and with _c2 less than four on Del Pezzo surfaces.     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

第五讲新型光纤水听器和矢量水听器

光纤水听器和矢量水听器作为当前水声研究领域最具有代表性的两大技术倍受业界关注。光纤水听器的重要贡献在于，从一个全新的角度出发，试图解决传统的水声传感和声纳数据传输一体化设计和实现的一系列问题，这有助于改善声纳系统的可靠性，并且有可能降低其制造、使用和维护的总成本。矢量水听器则由于其特有的指向性和矢量一相位处理方法，在低频和甚低频水声微弱目标探测方面具有潜在的优势．经过不懈的努力，光纤水听器和矢量水听器系统已经从实验室逐渐进入到工程应用阶段．这些对未来声纳系统的发展会产生相当重要的影响．文章尝试从声纳设计的角度对这两者的技术现状进行简要综述，包括它们各自的物理基础、工作原理、关键技术和应用领域．     

Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Mod 2 cohomology of combinatorial Grassmannians

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles. It defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles. It then gives a transformation from matroid bundles to spherical quasifibrations, by showing that the geometric realization of a matroid bundle is a spherical quasifibration. The poset of oriented matroids of a fixed rank classifies matroid bundles, and the above transformations give a splitting from topology to combinatorics back to topology. A consequence is that the mod 2 cohomology of the poset of rank k oriented matroids (this poset classifies matroid bundles) contains the free polynomial ring on the first k Stiefel-Whitney classes.