Minkowski和的一些性质

给出了混合面积A（t）和混合周长L（t）的表达式，并证明了√A（t）和A（t）／L（t）的凹凸性．这一性质建立了混合面积和混合周长与等周不等式之间的联系．     

Reversibility and Stochastic Networks

The experimental error variance in a response surface model with a block effect has traditionally been assumed to be constant. In some experimental situations, however, this variance may be different for the different blocks that compose the associated design. This article discusses the analysis of a response surface model with a random block effect and heterogeneous error variances among the blocks. The model includes interactions between the fixed polynomial effects and the block effect. Procedures for estimating and testing the fixed effects and the random effects in the model are described. In particular, ANOVA-based procedures for testing equality of the error variances and testing the random effects are introduced.     

The Limiting Distribution of the Residual Processes in Nonstationary Autoregressive Processes

The weak limit of the partial sums of the normalized residuals in an AR(1) process y _t = ρ y _{t −1} + e _t is shown to be a standard Brownian motion W ( x ) when |ρ| ≠ 1. However, when |ρ| = 1, the weak limit is W ( x ) plus an extra term due to estimation of ρ. Asymptotic behaviour of the partial sums is investigated with ρ = exp( c )/ n ) in the vicinity of unity, yielding a c -dependent weak limit as n ←∞, whose limit is again W ( x ) as | c | ←∞. An extension is made to nonstationary AR( p ) processes with multiple characteristic roots on the unit circle. The weak limit of the partial sums has close resemblance to that for the polynomial regression.     

Hyper-Kloosterman Sums and their Applications to the Coding Theory

The dual code of the Melas code is called the Kloosterman code. The weights of its codewords can be expressed by the Kloosterman sums, and are uniformly distributed with respect to the Sato-Tate measure. In this paper, the hyper-Kloosterman code C _m (q), a generalization of the Kloosterman code is defined, and the uniform distribution property is deduced using the hyper-Kloosterman sums when m is even and p− 1|m. Finally we discuss doubly-evenness for the weights in the binary case. It shows that we can construct infinitely many doubly-even codes in a non-trivial way. Received: October 30, 2000; revised version: February 28, 2001     

Premium honeys: Response of sensory panelists

Four honeys and one synthetic ‘honey’ were ranked by 62 panelists for relative acceptability; willingness to buy was ranked after price information was provided. Data were analyzed with the R-index procedure and Friedman ranked sums test. Honey floral source and production location differed. Panelists completed a questionnaire concerning food selection and perception and selection of honey. Instrumental techniques were used to characterize the honeys.

Honey was perceived by these panelists to have a unique flavor and positive image. Alaska wildflower, a fireweed table honey and Alaska fireweed/clover were the most acceptable. Acceptability did not necessarily correspond to willingness to buy. Similar results were obtained from both the R-index and rank sums analyses. The instrumental assessment of color and acceptability were significantly correlated. Generally, characteristics that distinguish premium from table honeys were unimportant in the selection process used by these panelists.     

A Generalization of a Lower Bound Technique due to Fredman and Saks

{In a seminal paper of 1989, Fredman and Saks proved lower bounds for some important data-structure problems in the cell probe model. In particular, lower bounds were established on worst-case and amortized operation cost for the union-find problem and the prefix sum problem. The goal of this paper is to turn their proof technique into a general tool that can be applied to different problems and computational models. To this end we define two quantities: Output Variability depends only on the model of computation. It indicates how much variation can be found in the results of a program with certain resource bounds. This measures in some sense the power of a model. Problem Variability characterizes in a similar sense the difficulty of the problem. } Our Main Theorem shows that by comparing a model's output variability to a problem's problem variability, lower bounds on the complexity of solving the problem on the given model may be inferred. The theorem thus shows how to separate the analysis of the model of computation from that of the problem when proving lower bounds. We show how the results of Fredman and Saks fit our framework by computing the output variability of the cell probe model and the problem variability for problems considered in their paper. This allows us to reprove their lower bound results, and slightly extend them. The main purpose of this paper though is to present the generalized technique. Received January 25, 1999; revised July 30, 1999.     

φ-混合随机变量序列加权和的完全收敛性

讨论了同分布下的φ-混合随机变量序列的完全收敛性,构建了1个定理和1个推论,它改进了前人的一些研究成果,获得了更一般的结论．     

同分布PA序列部分和之和的弱大数定律

本文主要研究了同分布PA序列{Xn}的部分和之和Tn的弱大数定律,与I.I.D序列以及NA序列部分和之和的弱大数定律形成对照,从而进一步完善了PA序列的大数定律理论.     

一类具有高非线性度的密码函数

A class of semi-bent functions with four trace terms is constructed by using the Hadamard transform and the values of Kloosterman sums. Moreover, it is shown that the new semi-bent functions with n variables have the degree n/2. These semi-bent functions have not only high nonlinearity but also high algebraic degrees, so that they provide more available functions for designing the filter generators of stream ciphers.     

图像阈值分割技术中的部分和算法综述

分析图像阈值分割技术在理论改进与实际应用过程中所面临的瓶颈问题,寻找解决问题的切入点。从提高算法效率的角度,以熵阈值法和Otsu阈值法为例,通过分类对比并结合理论综述,整理发掘出部分和算法研究对于阈值分割技术的作用和意义。与部分和问题相融合,是阈值分割技术未来的研究方向和重点。