H.264/AVC技术进展及其务实发展策略思考

结合NGN及3G演进的固定、移动视频业务实际需求状况，论述H．264／AVC的重要技术进展及其务实发展策略。     

基于模式理论光栅椭偏参数反演的数值模拟

将一种广泛用于求解系统优化问题的方法——正单纯形法，求解光栅的椭偏方程。首先，利用求解光栅的傅立叶模式理论对TE和TM波的复反射系数进行求解。然后计算出其相应的椭偏参数(△，Ψ)，并在该值的基础上加入不同偏差的随机高斯噪声，将加入噪声后的值(△m，Ψm)作为模拟测量值。最后使用优化算法进行反演。通过对几种常用面形光栅椭偏参数的数值模拟，一方面表明傅立叶模式理论计算光栅的椭偏参数不仅精度高。而且速度快；另一方面表明利用正单纯形法得到的光栅参数值很接近于正演时假设的参数值，从而从理论上证明了利用椭偏法测量光栅各种光学参数的可行性。     

区域分割法辅助计算复杂图像面积

介绍计算具有复杂边缘轮廓的图像面积的区域分割法。采用鼠标多边形作图法近似圈定待处理的图像区域。本文由格林定理出发得到有限连续边界与其包围区域面积之间的函数关系,并且应用这一函数关系得出多边形与其包围区域面积的数学关系,近似得到图像区域面积。文中以烟幕图像为例对上述结论进行了验证。文章最后给出了在VC++环境下实现多边形分割的部分源代码。     

带有给定切线多边形的保形有理三次B样条曲线

本文给出了带有给定切线多边形的保形有理三次Ｂ样条曲线，其部分权因子可通过选取切点的位置来确定，由此方法还导出了保形有理三次Ｂ样条插值曲线，最后，给出了两个例子。     

A general class of simple majority decision rules based on linguistic opinions

In this paper we have introduced a class of decision rules related to simple majority, by considering individual intensities of preference. These intensities will be shown by means of linguistic labels. In order to compare the amount of opinion obtained by each alternative, we have considered the total ordered monoid generated by the sums of the original labels, according to an addition and an ordering. In this general framework different sets of linguistic labels can be employed and these sets can be represented by means of diverse mathematical objects. Moreover, on these mathematical representations of linguistic labels several orderings can be considered. Thus, flexibility is an important feature of this new class of group decision making procedures. Some examples of putting in practice the simple majority decision rules based on linguistic labels are provided, and the main properties of these voting systems are analyzed. It is worth emphasizing that these properties are satisfied for any total ordered monoid, regardless of the mathematical representation of linguistic labels or the ordering used to compare collective opinions.     

PC ARC/NFO与ERDAS系统数据转换方法及其意义

重点讨论了PC ARC/INFO与ERADS之间数据转换的限制因素和方法,同时还探讨了它们各自的数据存放格式及其相互转换的意义。     

Spline-regression estimation of the influence of exposure dose on cancer probability

Spline regression is used to analyze the influence of radiation on the cancer probability in a group of participants of Chernobyl accident mitigation, depending on the exposure dose. A new method is proposed to approximate modified polygons by linear splines with two nodes. An algorithm for the identification of a transition point is outlined. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 168–176, May–June 2006.     

Precise rendering method for exact anti-aliasing and highlighting

This paper introduces the Precise Rendering Method, which generates accurately anti-aliased and highlighted images from tessellated polygons. The Precise Rendering Method first solves the aliasing problems of hidden surface removal by using the Cross Scanline Algorithm. This algorithm can exactly calculate polygon areas projected onto each pixel by using horizontal and vertical scanlines. Aliasing artifacts in shading are then prevented by the Reflection Intergration Method, which analytically integrates the intensity of reflection in the solid angle defined by surface normals at vertices of the projected area. Several synthesized images are created to show the efficiency of the Precise Rendering Method.     

ALGORITHMIC SYNTHESIS OF GENERAL NON-SHARP SIMPLE DISTILLATION COLUMN SEQUENCES

An algorithmic approach was used to select recoveries for non-sharp sequence designs. Simple distillation columns were employed. The non-key component distribution was modeled using the Fenske equation. The combination of producing impure products and allowing non-key component distribution, results in a large search space. With this large search space size and software limitations, five problems were solved (see summary table in the Design Examples sub-section). The optimal non-key component distribution was found to be significant but not necessarily maximal. Parallel processing was selected as optimal in contrast to the more traditional sequential processing.     

Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n²) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.