到复Grassmann流形的多重调和映照的构造

本文给出了一些到复Ｇｒａｓｓｍａｎｎ流形的多重调和映照的构造定理,从而推广了莫小欢,Ｂｕｒｓｔａｌｌ　Ｆ． Ｅ．,Ｗｏｏｄ Ｊ． Ｃ．和 Ｕｄａｇａｗａ Ｓ．的结果．     

G2,n中的可兼共形调和曲面

本文通过建立复Ｇｒａｓｓｍａｎｎ流形Ｇ２，ｎ中调和曲面的Ｇａｕｓｓ丛的基本公式，在适当的拓扑条件下给出了Ｇ２，ｎ中可兼共形调和曲面的构造定理．推广和改进了Ｂｕｒｓｔａｌｌ和Ｗｏｏｄ的低亏格曲面的结果．     

RLW—Burgers方程的精确解

借助未知函数的变换，ＲＬＷ－Ｂｕｒｇｅｒｓ方程和ＫｄＶ－Ｂｕｒｇｅｒｓ方程化为易于求解的齐次形式的方程，从而得到ＲＬＷ－Ｂｕｒｇｅｒｓ方程和ＫｄＶ－Ｂｕｒｇｅｒｓ方程的精确解。     

S.I.S.向量随机测度在弱拓扑及相容拓扑下的收敛性

本文主要研究ｓ．ｉ．ｓ．向量随机测度在弱拓扑及相容拓扑下的收敛性,给出了ｓ．ｉ．ｓ．向量随机测度在弱拓扑 容拓扑下的Ｖｉｔａｌｉ－Ｈａｌｍ－Ｓａｋｓ定理,作为应用,我们建立了Ｒ＾１－值有界可测函数关于Ｂａｎａｃｈ空间值ｓ．ｉ．ｓ．向量随机测度的随机积分的收敛定理,并得到了具ｔｙｐｅｐ的Ｂａｎａｃｈ空间中ｓ．ｉ．ｓ．向量随机测度的大数定律及中心极限定理。     

受迫二维广义KdV-Burgers方程的周期行波解

本文研究了受迫二维广义ＫｄＶ－Ｂｕｒｇｅｒｓ方程的周期行波解问题,讨论了解的有界性并给出了解的估计式,进而讨论了周期解的存在性及唯一性.     

L_2-Cross-Validation最近邻中位数估计的相合性:m-相依情形

给出了ｍ－相依情形的Ｌ２－Ｃｒｏｓｓ－Ｖａｌｉｄａｔｉｏｎ最近邻中位数估计的弱相合性和用Ｌ_２－Ｃｒｏｓｓ－Ｖａｌｉｄａｔｉｏｎ方法选择的光滑参数的下界．     

Euler-Bernoulli梁边界反馈控制系统的Riesz基生成问题

本文用基扰动的方法,证明了由速度和角速度组成的边界反馈Ｅｕｌｅｒ－Ｂｅｒｎｏｕｌｌｉ梁振动系统的广义本征元生成状态空间Ｈ的Ｒｉｅｓｚ基,从而给出了振动系统最优指数衰减率的计算公式,     

一个数学问题的再研究

本刊１９９７年５月号问题１０７２是：设△ＡＢＣ的三内角Ａ，Ｂ，Ｃ的对边长分别为ａ，ｂ，ｃ，则ｓｉｎＡ－ｓｉｎＢｂｃ＋ｓｉｎＢ－ｓｉｎＣｃａ＋ｓｉｎＣ－ｓｉｎＡａｂ≥０（１）（１）式是一个形式优美的不等式，但“１０７２”所给出的证法比较繁．本文先给出它...     

一类不同可靠度部件非单调关联系统的最优设计

本文对航天系统中应用广泛的一类典型的非单调关联系统（ｎ中取ｒ至ｓ系统）进行了可靠性分析,比较了目前对系统进行可靠度计算的几种方法的优劣,详细研究了给定ｒ,ｓ及不同部件可靠度ｐ_ｉ的情况下,使系统效益达到最高的条件ｎ值的最优配置问题,并结合国外某类航天系统工程中的计算机集成系统给出了一个数值例子,并用面向 Ｗｉｎｄｏｗｓ的 ＶＢ６． ０实现了一个图形交互的求解系统最优配置和系统可靠度的软件．     

Riemann面到复Grassmann流形的调和映射的构造

设φ是从Ｒｉｅｍａｎｎ面Ｍ到复Ｇｒａｓｓｍａｎｎ流形Ｇｋ，ｎ的调和映射．本文证得φ的Ｇａｕｓｓ丛之间的基本关系式．利用它和约化定理，证明了若干构造定理和调和序列的基本不等式，推广了Ｗｏｏｄ，Ｒａｍａｎａｔｈａｎ，Ｕｄａｇａｗａ，Ｂｕｒｓｔａｌｌ及Ｗｏｌｆｓｏｎ的相应结果．通过把迷向调和映射的Ｇａｕｓｓ丛作正交和，给出了从２维拓扑球到Ｇｋ，ｎ（２≤ｋ＜ｎ）的具有一切迷向阶的调和映射的例子，它们的曲率和Ｋａｈｌｅｒ角均为常值．     

Fractal video sequences coding with region-based functionality

In this paper, we explore the fractal video sequences coding in the context of region-based functionality. Since the main drawback of fractal coding is the high computational complexity, some schemes are proposed to speed up the encoding process. As fractal encoding essentially spends most time on the search for the best-matching block in a large domain pool, this paper firstly ameliorates the conventional CPM/NCIM method and then applies a new hexagon block-matching motion estimation technology into the fractal video coding. The images in the video sequences are encoded region by region according to a previously-computed segmentation map. Experimental results indicate that the proposed algorithm spends less encoding time and achieves higher compression ratio and compression quality compared with the conventional CPM/NCIM method.     

A secure and efficient entropy coding based on arithmetic coding

A novel security arithmetic coding scheme based on nonlinear dynamic filter (NDF) with changeable coefficients is proposed in this paper. The NDF is employed to generate the pseudorandom number generator (NDF-PRNG) and its coefficients are derived from the plaintext for higher security. During the encryption process, the mapping interval in each iteration of arithmetic coding (AC) is decided by both the plaintext and the initial values of NDF, and the data compression is also achieved with entropy optimality simultaneously. And this modification of arithmetic coding methodology which also provides security is easy to be expanded into the most international image and video standards as the last entropy coding stage without changing the existing framework. Theoretic analysis and numerical simulations both on static and adaptive model show that the proposed encryption algorithm satisfies highly security without loss of compression efficiency respect to a standard AC or computation burden.     

GLS coding based security solution to JPEG with the structure of aggregated compression and encryption

There exists close relation among chaos, coding and cryptography. All the three can be combined into a whole as aggregated chaos-based coding and cryptography (ATC) to compress and encrypt data simultaneously. In particular, image data own high redundancy and wide transmission and thereby it is well worth doing research on ATC for image, which is very helpful to real application.JPEG with high compression ratio has not provided security. If JPEG is incorporated into powerful cryptographic features, its application can be further extended. For this reason, in this paper, GLS coding as a special form of ATC, which attains synchronous compression and encryption, is used to modify JPEG and fill its gap. An image is first initialized using DCT, quantization and run-length coding in turn, just as JPEG. Then, it is encoded and encrypted simultaneously by utilizing GLS coding and binary keystream resulting from the chaotic generator. Results demonstrate that our scheme can not only achieve good compression performance but also resist known/chosen-plaintext attacks efficiently.     

Large Deviation Theorems for Gaussian Processes and Their Applications in Information Theory

We discuss on the large deviation theorems for stationary Gaussian processes and their applications in information theory. The topics investigated here include error probability of string matching, error probabilities for random codings, and a conditional limit theorem which justifies the maximum entropy principle.     

Sugeno模糊积分在分形编码中的应用

分形技术已被许多研究者应用于图像编码．在分形编码方案中，L^2距离技普遍采用去评价range块与domain块之间的匹配程度．本文将采用一种新的距离——基于Sugeno模糊积分的模糊距离去替代L^2距离．实验表明，在四叉树算法中，和L^2距离相比，在不损害压缩比和解码质量的前提下，混合或单纯使用模糊距离可提高编码速度35%～50％。     

Exact emulation of a priority queue with a switch and delay lines

All-optical packet switched networking is hampered by the problem of realizing viable queues for optical packets. Packets can be buffered in delay lines, but delay lines do not functionally emulate queues from an input-output point of view. In this paper we consider the problem of exact emulation of a priority queue of size K using a switching system comprised of a switch of size (M + 1) × (M + 1), which has one distinguished input for external arrivals, one distinguished output for external departures, and fixed-length delay lines of lengths L₁, L₂, ..., L_M connecting the other inputs and outputs in pairs. We measure the complexity of such an emulation by M + 1. We prove that and present a construction which works with ; further, in our construction . We also sketch an idea for an all-optical packet switched communication network architecture based on approximate emulation of priority queues of finite size using switches and delay lines, with erasure control coding at the packet level. AMS 2000 subject classifications: Primary: 60K25; Secondary: 90B22 · 90B36 · 68R99 The work of A. D. Sarwate is supported by an NDSEG Graduate Research Fellowship which is sponsored by the U.S. Department of Defense. The work of V. Anantharam is supported by ONR grant No. N00014-1-0637, DARPA grant No. N66001-00-C-8062, and by NSF grant No. ECS 0123512.     

Construction of a (64, 2 37, 12) Code via Galois Rings

Certain nonlinear binary codes contain more codewords than any comparable linear code presently known. These include the Kerdock and Preparata codes, which exist for all lengths 4^m 16. At length 16 they coincide to give the Nordstrom-Robinson code. This paper constructs a nonlinear (64, 2₃₇, 12) code as the binary image, under the Gray map, of an extended cyclic code defined over the integers modulo 4 using Galois rings. The Nordstrom-Robinson code is defined in this same way, and like the Nordstrom-Robinson code, the new code is better than any linear code that is presently known.     

Disambiguating verbal comments in social interaction: A computer model of meaning*

This paper describes a computer program for disambiguating the meaning of verbal acts in social interaction. The program was implemented using artificial intelligence techniques, representing utterances by frames, designing separate agents employing procedural rules to infer values of each coding dimension, and sharing information through a blackboard. The computer algorithms are discussed and illustrated with examples, then results of an empirical test of the program are reported. A training‐set of verbal interactions among health care practitioners and patients was examined to build the program, with an independent test‐set of data used to assess program performance. On a practical level, this program offers a promising approach for computer‐assisted or even automatic coding of interaction processes, reducing coding costs and improving reliability and validity. On a theoretical level, these algorithms offer a model of how individuals disambiguate the meaning of verbal comments in social interaction, providing substantive insights into the mechanisms of social interaction.     

The movement towards a more experimental approach to problem solving in mathematics using coding

Motivated by a problem proposed in a coding competition for secondary students, I will show on this paper how coding substantially changed the problem-solving process towards a more experimental approach.