一种动态多目标决策模型及其应用

针对一类动态多指标决策问题。提出一种多目标多阶段动态决策模型。根据所提出的效用函数,将决策矩阵归一化到相应的效用矩阵。该效用函数以指标的平均值为参数考点,突出了“奖优罚劣”原则,提高了分辨精度。最后提出一种动态决策目标函数,并通过对５城市３年综合经济效益的评估实例,表明此方法是合理可行的。     

Temporal Kohonen Map and the Recurrent Self-Organizing Map: Analytical and Experimental Comparison

This paper compares two Self-Organizing Map (SOM) based models for temporal sequence processing (TSP) both analytically and experimentally. These models, Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM), incorporate leaky integrator memory to preserve the temporal context of the input signals. The learning and the convergence properties of the TKM and RSOM are studied and we show analytically that the RSOM is a significant improvement over the TKM, because the RSOM allows simple derivation of a consistent learning rule. The results of the analysis are demonstrated with experiments.     

不确定时延环境的图像序列预测理论

该文提出的“不确定时延环境的图像序列预测理论”从图像通信系统目端的角度出发,可以将接收端的不连续序列图像构造成连续的视频数据。即使图像源端发送出帧速率小于24帧每秒的图像序列（如每秒15帧）,在复现端仍然能够看到连续的视频图像。     

基于OnTrac平台逆向分析系统的设计

探讨了软件逆向工程的基本原理,基于OnTrac平台设计了一个针对Python源代码的逆向分析系统,并简要介绍Reverse-UML系统以及核心模块。     

基于成本的数据库查询优化浅析

主要介绍基于成本的数据库查询优化的一些基本概念,针对多表连接的三种方法：嵌套循环链接、归并连接和混合连接进行分析和阐述．并成本估算,列出估算公式,     

Web日志挖掘与上网行为习惯分析

本文以某校校园网Web日志挖掘为例,首先阐述如何进行Web挖掘,其次运用该理论分析该校Web日志得到用户上网行为习惯,并给出合理化建议,最后引出进一步探索的方向,为以后工作奠定基础。本文采用的挖掘方法具有通用性和实用性,对于类似时序序列趋势分析都可参考本文。     

古代汉字展示的视觉序列在日常生活中的发展

中国古代汉字的视觉序列是单行的从上到下、横列的从右到左。战国以后,文字的视觉序列便由此随着文字一起为更多的人所的认识及使用。围绕人们生活周围的视觉序列更是丰富多彩,如:招幌、商业印刷品、对联及园林匾额和楹联等等。     

Approximate fixed point sequence for a finite family of asymptotically pseudocontractive mappings

Let E be a real Banach space and K be a nonempty, closed, convex, and bounded subset of E. Let T_i:K→K, i=1,2,…,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε_n}, and asymptotically pseudocontractive mappings with sequences , where {ε_n} and , i=1,2,…,N, satisfy certain mild conditions. Let a sequence {x_n} be generated from x₁K by

for all integers n1, where T_n=T_n(modN), {u_n} be a sequence in K, and {λ_n}, {θ_n} and {μ_n} are three real sequences in [0,1] satisfying appropriate conditions; then x_n−T_lx_n→0 as n→∞ for each l{1,2,…,N}.     

A parallel algorithm for approximate regularity

Spatial regularity amidst a seemingly chaotic image is often meaningful. Many papers in computational geometry are concerned with detecting some type of regularity via exact solutions to problems in geometric pattern recognition. However, real-world applications often have data that is approximate, and may rely on calculations that are approximate. Thus, it is useful to develop solutions that have an error tolerance.

A solution has recently been presented by Robins et al. [Inform. Process. Lett. 69 (1999) 189–195] to the problem of finding all maximal subsets of an input set in the Euclidean plane that are approximately equally-spaced and approximately collinear. This is a problem that arises in computer vision, military applications, and other areas. The algorithm of Robins et al. is different in several important respects from the optimal algorithm given by Kahng and Robins [Patter Recognition Lett. 12 (1991) 757–764] for the exact version of the problem. The algorithm of Robins et al. seems inherently sequential and runs in O(n^5/2) time, where n is the size of the input set. In this paper, we give parallel solutions to this problem.     

缫丝排序算法

文中提出一种改进的排序算法,弥补了快速排序在大规模下堆栈低效及合并排序在小规模下优势不明显的问题.算法扩展了合并排序思想,从一种特殊的蚕茧缫丝工艺得到启发,使用2～6个滚轴分离待排序列中的有序片段,在滚轴始末端扩展新数据,从而达到在合并操作前增加有序子序列长度的目的.理论推导表明,缫丝排序中的基本操作数量较合并排序减少4.75N,相当于将待排序列缩小至原有规模的1/4;效率测试实验表明,缫丝排序在各种规模下均能获得相比最快经典排序算法10％～15％的稳定优势,相比前人的改进排序算法具备相当的互补性,并能有效降低排序库函数自适应选择算法的实现复杂度.