分像素插值算法的VLSI实现

针对H.264/AVC标准中分像素插值运算复杂度高和存储访问量大的问题, 提出新的分像素插值算法。该算法采用易于硬件实现的4阶滤波器取代6阶滤波器进行分像素插值; 基于算法给出了一种1/4像素精度的8×8 块插补流水线结构。经性能分析和滤波器结构比较表明, 该结构在一个时钟内可以完成32个1/2像素位置的插值运算, 可应用于所有大小块, 且有面积小, 速度快的特点。实验结果表明, 与H.264标准相比, 该算法可以降低15%的空间复杂度, 提高了峰值信噪比, 降低了比特率, 提高了编码性能。     

基于Homotopy算法的低复杂度多用户大规模MIMO信号检测方法

在上行多用户大规模多输入多输出(multiple input multiple output,MIMO)系统中,为了降低信号检测的计算复杂度,在传统的最小均方误差(minimum mean square error,MMSE)算法的基础上,提出一种基于Homotopy算法的低复杂度信号检测方法。在该方法中,通过对Homotopy方程的解向量采用逐级展开来逼近真实解向量,从而避免MMSE检测算法中的高阶矩阵的求逆运算,降低了信号检测的计算复杂度。仿真结果表明,最多需要对Homotopy方程的解向量进行4阶展开,就可获得与MMSE检测算法几乎同样的误比特率(bit error rate,BER)性能,同时,其计算复杂度仅为O(K2),其中,K为小区用户数。     

无限集合的有限子集理论的等价转化

利用Ehrenfeucht博奕 ,证明了任一无限集合的有限子集理论与自然数集合的有限子集理论是初等等价的     

不同状态下运动皮层连通性仿真

为了研究脑卒中后运动功能损伤与康复的机制以寻找促进脑卒中患者康复的有效途径,用有向图表示运动相关区域连接成的网络,并将其视为动力学系统,通过复杂度反映系统功能分离和整合的程度,利用模式搜索方法优化网络结构,研究在静止状态、运动状态、中风损伤后运动皮层连通性的变化.仿真结果显示:运动状态下各区域间有较强的连接,而在损伤状态下,连接强度降低,与发生部位有关;在这两种状态下大脑半球内部区域间连接均大于其它类型连接,区域自连接较弱.研究结果表明该模型可以定性反映大脑运动皮层的连通性变化或者可塑性.     

Managing Complexity Through Methodic Participation: The Case of Air Quality in Santiago,Chile

Three concrete results have been achieved over a 5-year period in Santiago, Chile, in a process addressed to managing through participation the difficult air quality situation of this 5-million-person metropolis: (1) a highly complex problem has become manageable, (2) a legitimate and effective Prevention and Decontamination Plan is in operation, and (3) citizens and the government are mutually committed to this process. This paper describes how these results have been achieved by applying Innovative Development, a social systems methodology developed by the author and co-workers and applied in many fields over the last 20 years. Following a review of the problem and results that have been achieved, an explanation is offered for why a participative methodology is necessary for dealing with a highly complex problem like the current one. The fourth section provides a brief outline of the Innovative Development methodology. The last section presents the case itself, describing three stages. In the short space available we have tried to balance the practical, methodological, and conceptual issues of this case and this approach.     

Catastrophe mechanism and classification of discontinuity behavior in thermal science (II)

The catastrophe mechanisms of thermal performance characteristics of the firebox gas combustion system were analyzed from the viewpoint of catastrophe theory. The mathematical models of cusp catastrophe were established. The relationship between the thermal performance characteristics and the changing of system control variables was studied. The cusp catastrophe mechanisms of typical performance characteristics, such as kicking and lagging, and those of transition from quenching to igniting were explained. It was illustrated that discontinuity behavior of thermal systems with an “S” motion feature curve and lagging feature may be equivalently classified according to the topology of cusp catastrophe, influenced by two groups of independent control variables.     

Catastrophe mechanism and classification of discontinuity behavior in thermal science (I)

The mechanism of discontinuity behavior has important significance in the study of thermal science, such as fire, combustion, explosion and heat transfer. This sort of discontinuity behavior and the catastrophe caused by system nonlinearity may be equivalently classified according to the catastrophe model promulgated by catastrophe theory. Under the conditions of uniform temperature and thermal isolation, the self-ignition behavior of a Semenov System can be viewed as a result of the fold catastrophe of the system.     

电网检修排序问题

研究一个从实践中提出的电网检修排序（调度）问题，并证明了该问题的一般情形是ＮＰ－困难的，对其特殊情形给出了多项式时间的算法．     

求解0-1背包问题的两种方法的分析与比较

背包问题(KP)是计算机科学中典型的NP-hard问题,不存在多项式时间的精确算法。本文首先给出了求解0-1KP问题的一种改进的近似算法,讨论了算法复杂度与近似比;然后,给出了求解0-1KP的动态规划算法描述,并分析了算法的复杂度;最后,对两种方法进行了理论分析,并利用3个较大规模0-1KP实例的仿真计算结果与GDPSO进行比较。     

A FRAMEWORK FOR REAL-VALUED CIPHER SYSTEMS

Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been proved yet, most cryptographic researchers believe that one-way functions exist. In addition, many candidates for one-way functions have been proposed. Therefore, the key step for developing real-valued cipher systems is to define real one-way functions and to propose candidates for them. In this paper, based on computational complexity theory over the real field, we give two definitions of real one-way functions; one is for digital one-way functions and the other is for general one-way functions. Candidates for these two classes of one-way functions are also proposed. Moreover, we present two examples to demonstrate that the candidates for both digital one-way functions and general one-way functions can be applied to construct secure real-valued cipher systems.