改进的哈奇扬算法求解线性不等式组问题

本文研究了求解线性不等式组问题的哈奇扬算法, 发现算法中的不足, 并对其进行了改进; 运用改进后的算法求出了不等式组的解。     

Study on Complexity of Sutong Bridge’s Objectives system and its Meta-Synthesis Management

Objectives define the boundaries of complex engineering system. It is a hard work to determine the specific objectives of a complex engineering system. The objectives system development needs a complicated process, from nix to prototype, and to final definition. The total process will cover the following course: from chaos to well-ordered; from qualitativeness to combination of quantitativeness and qualitativenss, then to qualitativeness to quantitativeness (a recurrent process), expert experience and theoretical science, rationality and sensibility, synthetic analysis and meta-synthetic, routinization and non-routinization. Such process is explicit in phase development yet overlapped; mutually confined yet mutually independent; permeated conflicts yet pregnant in harmony. This article explores the complexity of Sutong bridge’s objectives development and the process of meta-synthesis in the Sutong Bridge engineering.     

带有优先约束的分批排序问题

对工件带有优先约束的分批排序问题进行了研究,其目标函数为最大完工时间．优先约束为：有一个树上包含有n个工件,其余的m-1条链上的工件数总和为常数,且工件的加工时间不限制．对于此种情况,给出了一个多项式时间算法．     

一种基于冲突跟踪的RFID防冲突算法

在射频识别系统中,防冲突技术是RFID技术必须解决的关键问题之一.针对查询树算法因逐位增加查询前缀而增加了阅读器时间复杂度和通信复杂度这一问题,给出了一种利用冲突位来更新查询前缀的改进算法--冲突跟踪树算法.通过构建冲突跟踪树,从理论上分析了改进算法的通信复杂度.在冲突位是连续的假设前提下,给出了计算阅读器通信复杂度的3个引理和一个定理,并对其做了详细证明.最后利用Matlab对相关算法性能进行了对比仿真.结果表明,在冲突位是连续的前提下,冲突跟踪树算法阅读器的通信复杂度优于查询树算法阅读器的通信复杂度,从而得出在一般情况下,冲突跟踪树算法更能有效改善阅读器的通信复杂度,节省系统的开销.     

Low complexity method for spreading sequence estimation of DSSS signal in non-cooperative communication systems

It is a necessary step to estimate the spreading sequence of direct sequence spread spectrum (DSSS) signal for blind despreading and demodulation in non-cooperative communications. Two innovative and effective detection statistics axe proposed to implement the synchronization and spreading sequence estimation procedure. The proposed algorithm also has a low computational complexity with only linear additions and modifications. Theoretical analysis and simulation results show that the algorithm performs quite well in low SNR environment, and is much better than all the existing typical algorithms with a comprehensive consideration both in performance and computational complexity.     

译码转发系统中一种半分布式用户选择策略

针对译码转发系统中传统的用户选择策略复杂度过高的问题,提出一种半分布式用户选择策(SDUS策略).该策略以最大化系统瞬时互信息量为目标,引入中继选择的判决门限,并根据此门限生成协作集,目的节点从协作集及源节点(当协作集为空集时)中选择信道质量最好的用户作为协作节点.SDUS策略不仅能够显著降低系统的运算复杂度,还能够改善系统的中断性能.仿真实验表明,当信噪比为20 dB且系统中的中继节点数为120时,SDUS策略的运算开销仅约为机会中继策略和选择协作策略的39.5%和51.1%.     

New algorithms for evaluating parametric surface

Through generalization of mathematical model of surface lofting program in the CONSURF system, the definitions for two generalized Ball surfaces and their recursive algorithms are given. Furthermore, the conversion al gorithms from Bézier surface to these two generalized Ball surfaces are presented. On the basis of these algorithms, two more efficient algorithms for evaluating parametric surfaces are also derived. One uses generalized Ball forms directly for evaluating surface, and the other converts the given Bézier surface to a generalized Ball surface firstly, and then evalu ates the surface. Both theoretical analysis and example computations show that the two new algorithms are more efficient than the de Casteljau algorithm. Especially when Wang-Ball surface is used, the time complexity is reduced from cubic to quadratic of the degree of the surface. If these algorithms are applied to displaying, interactive rendering, designing, intersection-finding, offsetting and approximating for surfaces, considerable economic results can be achieved.     

分形图像压缩的研究进展

分形图像压缩是一种具有独特优势且极有前途的数据压缩技术 ,至今未能广泛应用是由于其面临着高计算复杂度的困难。文中提出了克服这一困难的一些有效方法 ;同时 ,提出了改善重建图像视觉效果的措施 ,并探讨了分形图像编码的未来研究方向     

计算加权Moore-Penrose逆A+M,N的一个改进的并行算法

利用PREPARTAFP和SARWATEDV[6] 的一些结果 ,给出一个计算加权Moore Penrose逆A MN 的改进的并行算法 ,改善了文献 [8]中提出的算法。在与PREPARTAFP和SARWATEDV文 [6 ]中相同的假设下证明了改进的并行算法的时间复杂性和处理机台数分别为 T =0 ((logn) 2 ) ,　 P =max m/n 2 nα/logn ,2r1 / 2 nα(logrlogn)时空积 (成本最优性 ) T× P小于T×P(T和P分别为 [8]中原有并行算法的时间复杂性和处理机台数 )。     

On bio-diversity, complexity of M-CSF and its receptor

With the development of science, the methods and the views of scientific research changed from analyses to syntheses. Recently, more attention has been paid to bio-diversity and complexity. According to the study on M-CSF and its receptor for years, the author suggests that, the multi-level of bio-diversity also appears at the bio-macromolecular level. Probability of bio-diversity is one of the bases for bio-complexity. Cellular sociology and topobiology are important aspects in bio-complexity, and should be developed. If taking Chinese traditional medicine together with the advantage from Reductionism, joining the study on complexity, Chinese scientist would make a chair in the international scientific society.