传统吉祥图案如何在现代设计中应用与发展

传统吉祥图案是中华民族文化千百年来沉淀的结果,是广大劳动人民集体的智慧与创造,是中华民族思想文化得以传承的源泉。时代的发展、变迁,物质条件及生活方式的改变,人们的观念意识和审美情趣也在不断的发生变化,与之相生相伴的各种艺术形式也都打上了鲜明的时代烙印。传统吉祥图案纹饰,变化万千,可以让我们看出当时的时代风尚,将这些传统吉祥图案认真总结,可将它归纳出主要的几种类型。     

基于LDA模型的新闻话题的演化

新闻话题及演化的研究可以帮助人们快速了解和获取新闻内容。提出了一种挖掘新闻话题随时间变化的方法,通过话题抽取和话题关联实现话题的演化。首先应用LDA(Latent Dirichlet Allocation Model)对不同时间段的文集进行话题的自动抽取,话题数目在不同时间段是可变的;计算相邻时间段中任意两个话题的分布距离实现话题的关联。实验结果证明该方法不但可以描述同一个话题随时间的演化过程,还可以描述话题内容随时间的变化,反映了话题(或子话题)之间多对多的演化关系。     

一种基于数据挖掘的量化新增需求代码量的分析方法

需求演化频繁发生于软件项目中,并且在很大程度上影响着软件项目的成败。对需求演化的影响进行准确的估算,将有效地帮助项目管理者降低软件项目失败的风险。其中,如何量化新增需求对软件项目的影响,是一个尤其难以解决的问题。提出一种基于数据挖掘的需求演化影响的量化分析方法,将新增需求与软件项目已有需求进行聚类,对于聚类结果进行分析,能够相对准确地量化新增需求将要产生的代码量。     

A hybrid differential evolution algorithm integrated with an ant system and its application

A new hybrid differential evolution algorithm, in which an ant system is used to select the optimal base vector of mutation operation, named the ant system differential evolution (ASDE), is proposed. In ASDE, each dimension in the feasible solution space is divided into several subspaces evenly, and each subspace is marked with the same initial intensity of pheromone trails. The probability of choosing an individual as the base vector is influenced by the visibility and pheromone quantity of the individual. The trail of the selected base vector’s location subspaces will be reinforced with some pheromones, when the offspring is better than its parent. The experimental results show that the ASDE generally outperforms the other differential evolution algorithms for nine benchmark functions. Furthermore, the ASDE is applied to develop the global kinetic model for SO₂ oxidation on the Cs-Rb-V catalyst, and satisfactory results are obtained.     

A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

This paper presents a novel discrete differential evolution (DDE) algorithm for solving the no-wait flow shop scheduling problems with makespan and maximum tardiness criteria. First, the individuals in the DDE algorithm are represented as discrete job permutations, and new mutation and crossover operators are developed based on this representation. Second, an elaborate one-to-one selection operator is designed by taking into account the domination status of a trial individual with its counterpart target individual as well as an archive set of the non-dominated solutions found so far. Third, a simple but effective local search algorithm is developed to incorporate into the DDE algorithm to stress the balance between global exploration and local exploitation. In addition, to improve the efficiency of the scheduling algorithm, several speed-up methods are devised to evaluate a job permutation and its whole insert neighborhood as well as to decide the domination status of a solution with the archive set. Computational simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is shown that the proposed DDE algorithm is superior to a recently published hybrid differential evolution (HDE) algorithm [Qian B, Wang L, Huang DX, Wang WL, Wang X. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research 2009;36(1):209–33] and the well-known multi-objective genetic local search algorithm (IMMOGLS2) [Ishibuchi H, Yoshida I, Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 2003;7(2):204–23] in terms of searching quality, diversity level, robustness and efficiency. Moreover, the effectiveness of incorporating the local search into the DDE algorithm is also investigated.     

Using frameworks to develop a distributed conferencing system: an experience report

Application frameworks are a powerful means to reduce software development costs while improving quality. However, at the same time they are difficult to select and understand, as well as hard to learn, use, and debug effectively and efficiently. In this paper we report the story of eConference, a distributed conferencing system that was developed as part of a broader research effort. Here we discuss the lessons learned from the evolution of our conferencing tool over four generations, which have been necessary to find good frameworks and build a flexible distributed tool. Copyright © 2009 John Wiley & Sons, Ltd.     

面向本体的服务组合差分进化策略

针对目前Web服务描述服务功能的语义不够深入而使服务识别组合能力欠佳的问题,提出一种面向本体的语义服务功能描述方法,建立本体间的映射关系模型和服务质量关系模型,通过改进差分进化算法求解,得到一种较好的服务组合识别方法。在九寨沟旅游管理信息系统中的应用表明,该方法比传统的方法优越。     

邻域结构为复杂网络的粒子群算法*

为避免早熟收敛和局部最优,设计了一种基于复杂网络进行个体交互的粒子群算法(CNS-PSO)。该算法在粒子与网络节点间建立映射关系,并根据节点的邻居集合,获得粒子的动态飞行邻居。每个飞行邻居集合是一个独立又彼此联系的进化小社会。在CNS-PSO中,每个粒子的位置更新策略不仅考虑了认知部分及社会的信息共享,还考虑了小社会内和小社会间的信息交流。在8个测试函数上,将CNS-PSO与标准PSO进行了对比,在不同维度的大多数函数上,前者的性能均优后者。说明具有无标度网络邻域结构的CNS-PSO算法具有较强的避免早熟和逃逸局部最优的能力。     

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn–Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.