基于遗传算法的排课编码设计

采用遗传算法的基本理论,研究如何利用遗传算法解决高校排课中的教室冲突、时间冲突、教师冲突和课表优化等问题,根据人们的期望值设定遗传算法染色体的优先级。     

多合同的激励优化与最优工期确定

本文对于时间-费用交换问题,基于总价合同中的奖惩手段对承包方缩短工期的激励作用,考虑同一个工程项目包含多个总价合同时,通过建立多合同的主从递阶决策模型,对各个合同的激励进行优化,并选择工程最优工期,使项目业主和承包方的博弈达到均衡状态。然后,采用启发式遗传算法求解该模型。最后,给出了一个简单的算例。     

HTTP动态自适应流技术中码率选择算法研究综述

HTTP动态自适应流技术利用现有的内容分发网络和互联网基础设施,部署方便、快捷,具有良好的防火墙穿透能力、NAT转换功能,成为网络视频分发业务的主流技术。为保证媒体传输的流畅性,为用户提供良好的用户体验质量（QoE）,需要采用合理的码率选择算法,由此码率自适应选择算法成为研究热点,大量新方法不断涌现。对HTTP动态自适应流技术背景和概念进行了概述,从流媒体传输涉及的服务端和客户端两个决策实体出发,对大量方法进行了分类阐述,指出该领域存在的问题,对研究趋势进行了展望。     

Teaching algorithmic problem solving or conceptual understanding: Role of developmental level,mental capacity,and cognitive style

It has been shown previously that many students solve chemistry problems using only algorithmic strategies and do not understand the chemical concepts on which the problems are based. It is plausible to suggest that if the information is presented in differing formats, the cognitive demand of a problem changes. The main objective of this study is to investigate the degree to which cognitive variables, such as developmental level, mental capacity, and disembedding ability explain student performance on problems which: (1) could be addressed by algorithms or (2) require conceptual understanding. All conceptual problems used in this study were based on a figurative format. The results obtained show that in all four problems requiring algorithmic strategies, developmental level of the students is the best predictor of success. This could be attributed to the fact that these are basically computational problems, requiring mathematical transformations. Although all three problems requiring conceptual understanding had an important aspect in common (the figurative format), in all three the best predictor of success is a different cognitive variable. It was concluded that: (1) the ability to solve computational problems (based on algorithms) is not the major factor in predicting success in solving problems that require conceptual understanding; (2) solving problems based on algorithmic strategies requires formal operational reasoning to a certain degree; and (3) student difficulty in solving problems that require conceptual understanding could be attributed to different cognitive variables.     

排序算法时间复杂度的研究

算法设计的好坏直接影响计算机的运行时间，计算机排序方法较多，时间复杂度差别较大．本文从理论上研究了线性排序(选择法、冒泡法、计数法)、比较排序、堆排序和快速排序等几种常用的排序算法的时间复杂度．     

Bounded space algorithms for variant of variable-sized bin packing

Given a list of items and a sequence of variable-sized bins arriving one by one, it is NP-hard to pack the items into the bin list with a goal to minimize the total size of bins from the earliest one to the last used. In this paper a set of approximation algorithms is presented for cases in which the ability to preview at most k（〉=2） arriving bins is given. With the essential assumption that all bin sizes are not less than the largest item size, analytical results show the asymptotic worst case ratios of all k-bounded space and offiine algorithms are 2. Based on experiments by applying algorithms to instances in which item sizes and bin sizes are drawn independently from the continuous uniform distribution respectively in the interval [0,u] and [u,l ], averagecase experimental results show that, with fixed k, algorithms with the Best Fit packing（closing） rule are statistically better than those with the First Fit packing（closing） rule.     

ATM—快速分组交换的高级形式

在这篇文章中,我们概述并比较了快速分组交换与ATM的技术及其特点,并对ATM的一些重要特性作了详尽论述。     

Josephus问题的动态图形演示

本大讨论了用动态图形方式演示求解Ｊｏｓｅｐｈｕｓ问题的原理和方法，该方法对如何在教学中使用ＣＡＩ技术提出了一个实例、本文同时给出了用Ｃ语言编制的Ｊｏｓｅｐｈｕｓ问题求解过程的动态图形演示ＣＡＩ软件。     

吊车模型控制实验系统的研制

介绍了吊车模型控制系统的结构特点及控制问题,记述了双模模糊控制器的结构原理和改进的遗传算法,并用改进的遗传算法优化模糊控制器。给出了模糊控制器优化前后的控制结果曲线及数据对比。     

基于SIMD-BF的并行FFT算法

主要讨论了在数字图像信号处理中起重要作用的快速傅立叶变换，结合了近年来人们对该算法并行化的研究成果，创析了一种基于SIMD-BF模型上的实用并行算法。