《C语言程序设计》课堂教学方法的探讨

《C语言程序设计》一直是计算机专业及相关专业的专业基础课。该课程既难教又难学。传统的教学方法往往过分注重语法形式的介绍，却忽视了算法的讲解，使得学生无法解决一些实际编程，也很容易挫伤学生的学习兴趣。为此应以算法教学为主。因材施教，合理使用教材，在改用多媒体教学的同时，适当配以板书。调动学生的主观能动性，提高其编程能力。     

一种改进的共同进化遗传算法及其应用

将共同进化遗传算法应用于临床营养决策优化中,虽然取得了一定成果,但算法中仍存在早熟现象、局部搜索能量弱等问题,为此提出一种改进的共同进化模型。算法使用新的子群体划分方法和交叉算子,引入精英保留策略、信息交换原则和小生境技术。通过对糖尿病营养治疗的仿真表明,改进后的算法在保证群体多样性和避免早熟现象的前提下,提高了算法的局部和全局寻优能力,且膳食配方中营养素达标率符合要求,满足专家建议的糖尿病饮食需求。     

A tolerant approach to reconstruct topology from unorganized trimmed surfaces

Presented in this paper is a topology reconstruction algorithm from a set of unorganized trimmed surfaces. Error-prone small geometric elements are handled to give proper topological information. It gives complete topology to topologically complete models, and it is also tolerant to incomplete models. The proposed algorithm is vertex-based in that clues for topological information are searched from the set of vertices first, not from that of edges.     

Convolutional solutions of partial difference equations

A significant part of the theory of one-dimensional linear shift-invariant systems is based on the concept of weighting function (or impulse response): the output is the convolution of the weighting function with the input. This paper introduces the concept of linear translation-invariant systems and uses this notion in studying impulse response, z-transforms, and transfer functions for multidimensional systems.     

Data fitting with a spline using a real-coded genetic algorithm

To obtain a good approximation for data fitting with a spline, frequently we have to deal with knots as variables. The problem to be solved then becomes a continuous nonlinear and multivariate optimization problem with many local optima. Therefore, it is difficult to obtain the global optimum. In this paper, we propose a method for solving this problem by using a real-coded genetic algorithm. Our method can treat not only data with a smooth underlying function, but also data with an underlying function having discontinuous points and/or cusps. We search for the best model among candidate models by using the Bayes Information Criterion (BIC). With this, we can appropriately determine the number and locations of knots automatically and simultaneously. Five examples of data fitting are given to show the performance of our method.     

多冗余点到点链路下OSPF扩散算法的一种改进方案

文章讨论了OSPF路由协议的扩散算法在多冗余点到点链路情况下存在的缺陷,提出了一种基于扩散接口选举的改进方案。     

Rendering of Surface and Volume Details in Volume Data*

Aiming at the detail rendering in volume data, a new volume illumination model, called Composed Scattering Model (CSM), is presented. In order to enhance different details in volume data, scattering intensity is decomposed into volume scattering intensity and surface scattering intensity with different weight functions. According to the Gauss probability distribution of gray and gradient of data, we propose an accurate method to detect the materials in a voxel, called composed segmentation. In addition, we discuss the principle of constructing these weight functions based on the operators defined in composed segmentation. CSM can generate images containing more details than most popular volume rendering models. This model has been applied to the direct volume rendering of 3D data sets obtained by CT and MRI. The resultant images show not only rich details but also clear boundary surfaces. CSM is demonstrated as an accurate volume rendering model suited for detail enhancement in volume data sets.     

集群系统与公用网互连的仿真模型和模拟算法

在讨论ＭＰＴ１３２７信令的集群移动通信系统与国内Ｎｏ．７信令的ＰＳＴＮ网间互连，帝现两种信令配合中，研究了集群系统的仿真模型和模拟算法，同时模拟出整个集群系统的工作情况，运行结果证实了所提方案的可行性与准确性。     

Calendar maintenance of arbitrarily structured systems

A semi-Markov model is constructed that describes an arbitrarily structured multicomponent technological system and takes into account its calendar maintenance. Using an aggregation algorithm, approximate values of stationary reliability characteristics and an optimal term of maintenance work are determined for the system. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 69–86, March–April 2006.     

Stereo and motion correspondences using nonlinear optimization method

This paper presents a new approach for using stereo and motion correspondences to solve the problem of tracking multiple independently moving features. In this approach, quantitative relational structure (QRS) is proposed as a framework for the integration of stereo–motion correspondences. The similarity function, tightly coupled to stereo and motion cues, is constructed on QRS, and then energy function E² consisting of the similarity function is defined. The tracking problem can be converted into the maximization problem of the energy function E². The stereo and motion correspondences that maximize E² are recovered by applying an extended graduated assignment algorithm. The relaxation labeling method is also presented for the comparison with the proposed method. Experimental results are presented to illustrate the performance of the proposed method.