基于旋转描述的三维几何造型方法

提出了一种能用凸四边形表示并可作平面展开的三维实体造型的设计方法。该方法用旋转描述表把二维平面展开图和三维实体联系起来，模拟人工折叠过程，由二维平面展开图逐次旋转变换完成三维造型重建。造型重建后，再通过纹理映射将平面设计图案映射到实体的各个面上，完成对实体着色渲染，生成具有真实感的三维实体。     

基于地理信息系统的天津房地产管理数据库

从地理信息系统CIS的组成开始．提出该类系统的组织与管理方法，同时重点介绍了在现阶段开发该类系统时所使用的高端技术，最后对GIS系统的发展趋势作出分析与顶测。     

Characteristics of origin-destination pair traffic in Funet

In this paper we analyze measurements gathered from a 2.5~Gbps link in the Finnish university network (Funet) in 2004. The traffic is broken down into origin-destination (OD) pair components based on source and destination IP address. We study the traffic characteristics of these components, and identify four typical representative OD pairs. For these pairs we investigate the validity of a moving IID Gaussian model. We find that the statistical properties of these OD pairs differ significantly from each other, with only some of them close to Gaussian. The OD pairs are also found to have some cross-correlation between each other, contradicting an often made assumption about OD pair independence. Furthermore, the existence of a mean-variance relation between the OD pairs is studied. We find that there is a relation between mean and variance, but for some periods of time it is rather weak.     

基于聚类算法实现信号盲分类

本文解决了信号处理、工业控制等领域存在的非平稳信号盲分类问题。在聚类中广泛应用的K-Means算法及其它基于中心的聚类算法有两个共同的缺陷-需要预先确定类数目且随机初始化中心引起性能不稳定。本文提出的算法较好地解决了这两个问题，提高了算法稳定性，实现了非平稳信号盲分类。提取非平稳信号的小波系数作为聚类的样本空间，分析聚类结果的统计偏差以估计类的数目，采用调和均值准则进行分类。最后给出的仿真结果表明本文提出的方法较传统的K-Means算法明显降低分类错误率。     

空间目标的可见光散射与红外辐射

利用Lowtran7大气传输模型计算0.4～0.8μm可见光波段的太阳辐射、大气自身的热辐射以及天地背景辐射.依据粗糙面光散射理论与双向反射分布函数计算空中目标表面对太阳辐射和云层对阳光反射的散射.利用传热学和背景辐射理论,根据能量守恒定律建立空间目标表面温度的热平衡方程.以气球为例,计算不同表面涂层材料的气球,在不同地理位置、不同高度和不同时间条件下,其温度及辐射功率的变化.分析空间目标红外辐射特性的一般规律和特征.     

CPM自滤波非稳腔YAG激光器研究

把由非谐振环和凸面全反射镜构成的自滤波非稳腔应用于撞脉冲锁模Ｎｄ：ＹＡＧ激光器，改善了光束的空间质量和输出稳定性，获得发散角为２倍衍射极限，能量５０ｍＪ，脉宽１０ｐｓ的锁模脉冲，并与未加滤波小孔的ＣＰＭ非稳腔的输出性能进行实验比较。，     

产品定级中挑选专家的数学模型

在工农业产品评定级别中，专家组的水平是至关重要的。文中给出一个挑选专家组成员的数学模型，可以检验专家对参评产品的决策水平，为评价所评结论的可信度提供参考依据。     

基于神经网络的VQ图象编码

文章给出将神经网络与矢量量化相结合的两种编码方法，介绍了其原理和实现的算法。经计算机模拟表明，在比特率低于０．３ｂｐｐ时仍可得到高质量的编码图象。     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.