Wilson标架特征及对偶性质

利用Ｗｉｌｓｏｎ的方法，可构造出一函数族，本文得到它们成为标架的判定条件．此外，还得到了其对偶标架的性质．     

区域上Triebel-Lizorkin空间的原子分解与限制定理

本文在区域Ω( Rn,n≥1)上定义了某类在边界上消失的Triebel-Lizorkin空间 ,并给出了它的原子分解定理,对偶定理.同时证明了当区域 时,得到了限制和扩张定理     

FIB快速加工纳米孔点阵的新方法

纳米尺度的点阵在纳米器件和基础科学研究方面都具有非常重要的应用.目前普遍采用的聚焦离子束和电子束曝光技术可以很方便的在衬底上加工纳米量级的微细结构，但大面积的图形加工过程需要花费太多的机时.介绍一种利用设计图形BMP文件的像素点阵和实际加工区域之间的匹配关系，通过聚焦离子束加工获得所需要的纳米孔点阵的新方法.采用这种方法可以在短时间内获得大面积的纳米点阵结构. 关键词： 聚焦离子束 电子束曝光 纳米孔点阵     

Valuations and hyperplanes of dual polar spaces

Valuations were introduced in De Bruyn and Vandecasteele (Valuations of near polygons,preprint, 2004) as a very important tool for classifying near polygons. In the present paper we study valuations of dual polar spaces. We will introduce the class of the SDPS-valuations and characterize these valuations. We will show that a valuation of a finite thick dual polar space is the extension of an SDPS-valuation if and only if no induced hex valuation is ovoidal or semi-classical. Each SDPS-valuation will also give rise to a geometric hyperplane of the dual polar space.     

小波与函数空间

Triebe利用Littlewood Paley分解将大多数函数空间分类成两类三指标的函数空间：Besov空间和Triebel Lizorkin空间；但Littlewood Paley 分解很难直接分析Sobolev空间L^p的插值空间Lorentz空间，也很难分析Triebel Lizorkin空间F^{α,q}_1的预备对偶空间和对偶空间.运用小波，作者给出这些空间一个统一刻画：Triebel Lizorkin Lorentz 空间，Besov Lorentz空间和F^{α,q}_1的预备对偶空间和对偶空间；另外也研究这些空间的三个性质.     

A new strongly polynomial dual network simplex algorithm

This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m +n logn) logn) time for the network withn nodes andm arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos’ (1993) dual network simplex algorithm by a factor ofm/n.     

A Construction of Cartesian Authentication Codes from Vector Space and Dual Authentication Codes

ＡＣｏｎｓｔｒｕｃｔｉｏｎｏｆＣａｒｔｅｓｉａｎＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓｆｒｏｍＶｅｃｔｏｒＳｐａｃｅａｎｄＤｕａｌＡｕｔｈｅｎｔｉｃａｔｉｏｎＣｏｄｅｓＦｅｎｇＲｏｎｇｑｕａｎ（冯荣权）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ...     

Poisson Traffic Processes in RGSMP and Generalized Networks

1.Introductiontrafficprocessesinqueueingnetworksareanimportantoperatingfacetofsuchmodels,aswellasvaluableinthestudyofvaliddecompositionsofnetworks.IfwefindsometrafficprocessesinanetworkPoisson,thenitoftenrendersthemathematicalanalysistractable.Generalized…     

Optimal ordering policies with convertible lead times

A firm receives orders that will be required at an uncertain time given by an Erlang distribution, and over time observes the associated independent exponential events. The firm, in turn, places orders at a linear cost from a supplier with fixed lead time l and has the option of converting (expediting) each order, at a cost, over a certain time interval after the order is originally placed. A converted order arrives l_e < l units of time after it is converted. We show that a threshold policy is optimal. Under such a policy the firm places an order after a certain number of exponential events have been observed. An order is converted the first time, if any, when the residual lead time exceeds a time threshold related to the number of exponential events realized since the order was placed.