基于径向基函数、区间分析和非支配排序遗传算法的结构区间多目标优化

研究目的：为改善实际工程结构在不确定性条件下的多性能指标,提供一种高效的区间多目标优化方法。创新要点：建立一个目标和约束均为区间不确定性参数函数的区间约束多目标优化模型,提出并实现基于径向基函数、区间分析和非支配排序遗传算法（NSGA-II）的区间多目标优化算法。研究方法：首先,利用区间序关系将每个区间目标转换为同时优化其中点和半径的确定性双目标,利用区间可能度法将区间约束转换为确定性约束,并在此基础上,利用加权法和罚函数法将每个区间目标的约束优化问题转换为相应的无约束优化问题;然后,利用拉丁超立方实验设计和有限元分析构建预测各待优化结构性能指标值的径向基函数;最后,将径向基函数、区间分析法与NSGA-II相结合,快速求出转换后确定性无约束多目标优化问题的所有Pareto最优解,并通过考虑材料不确定性的高速压力机滑块机构设计实例验证该方法的有效性。重要结论：目标和约束均为不确定性参数函数的区间多目标优化模型能有效反映实际工程中同时改善结构多性能指标的需求。基于径向基函数、区间分析和NSGA-II相结合的区间多目标优化算法将传统区间优化模型求解中的嵌套优化过程简化为单层遗传优化过程,大大提高了求解效率,并可获得多目标优化问题的所有Pareto最优解。     

一种平面二维坐标点排序新方法

在图像处理中的结果显示时,常常需要将获得的离散点按一定的关系准则连接起来以形成一定的闭合区域,这就需要确定点间连接的前后关系,也就是点的正确排序．而基于种子参考点的排序新方法,通过计算由各排序点和种子点间的连线同Y轴正向构成的角度,然后按照获得的角度大小关系,实现了对二维坐标点的有效排序．     

Sorting on GPUs for large scale datasets: A thorough comparison

Although sort has been extensively studied in many research works, it still remains a challenge in particular if we consider the implications of novel processor technologies such as manycores (i.e. GPUs, Cell/BE, multicore, etc.). In this paper, we compare different algorithms for sorting integers on stream multiprocessors and we discuss their viability on large datasets (such as those managed by search engines). In order to fully exploit the potentiality of the underlying architecture, we designed an optimized version of sorting network in the K-model, a novel computational model designed to consider all the important features of many-core architectures. According to K-model, our bitonic sorting network mapping improves the three main aspects of many-core architectures, i.e. the processors exploitation, and the on-chip/off-chip memory bandwidth utilization. Furthermore we are able to attain a space complexity of Θ(1). We experimentally compare our solution with state-of-the-art ones (namely, Quicksort and Radixsort) on GPUs. We also compute the complexity in the K-model for such algorithms. The conducted evaluation highlight that our bitonic sorting network is faster than Quicksort and slightly slower than radix, yet being an in-place solution it consumes less memory than both algorithms.     

基因组重排的反转排序的近似算法

本文主要研究基因无方向的基因组重排的反转排序问题.本文算法基于断点图的概念,给出一个时间复杂性为O(maxb3(π),nb(π)),空间复杂性为O(n)的求解近似最优解的算法,其中n为基因组中基因个数,π=(π1,π2,...πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据试验的结果表明,该近似算法可以求得较好的结果.     

CallCenter系统用户识别模块设计与实现

介绍了CallCenter系统用户识别模块的识别原理、号码提取和地区识别原理及实现，实现了来电用户识别、分类和资料归档功能，为CallCenter系统的座席资源分配提供了参考依据，提高了CallCenter系统的客户响应效率。     

基于机器视觉技术的番茄苗分类和排序技术研究

传统番茄苗选择中,往往是操作员根据形态学特征,基于视觉评分标准来识别幼苗,这是一种主观的、容易发生人为错误的方法。针对这一问题,文章基于机器视觉技术设计了一种全自动移栽番茄苗分级分选算法,选择UXGA(Ultra eXtended Graphics Array)极速扩展图像阵列相机、蓝色背光和滤光装置获取番茄幼苗图像信息,从图像信息中确定幼苗的弯曲度、叶片节点和茎粗,然后对其进行分级和排序,进而将这些幼苗分级为“可接受”和“剔除”。结果表明,根据番茄苗茎的粗细,将幼苗分级,分为大、中、小三类,具有良好的效果。该算法不仅适用于番茄幼苗,还可以应用于茄子、辣椒和许多其他幼苗,分选成功率为97%。     

可用性测试方法在IA研究中的应用

企业进行信息构建时必须研究用户，而可用性测试作为信息构建的重要组成部分，是一种研究用户的有效手段，通过规范的可用性测试过程，可了解用户行为并指导网站设计。作为可用性测试方法的一种，卡片分拣法可以探索用户对于网站信息如何分类，以此提高用户搜索成功率。     

归并排序的一种改进算法

给出了归并排序算法的一种改进算法,对具有“离散”性的多个数据排序时利用该算法具有较明显的优势。     

Learning sorting algorithms through visualization construction

Recent increased interest in computational thinking poses an important question to researchers: What are the best ways to teach fundamental computing concepts to students? Visualization is suggested as one way of supporting student learning. This mixed-method study aimed to (i) examine the effect of instruction in which students constructed visualizations on students’ programming achievement and students’ attitudes toward computer programming, and (ii) explore how this kind of instruction supports students’ learning according to their self-reported experiences in the course. The study was conducted with 58 pre-service teachers who were enrolled in their second programming class. They expect to teach information technology and computing-related courses at the primary and secondary levels. An embedded experimental model was utilized as a research design. Students in the experimental group were given instruction that required students to construct visualizations related to sorting, whereas students in the control group viewed pre-made visualizations. After the instructional intervention, eight students from each group were selected for semi-structured interviews. The results showed that the intervention based on visualization construction resulted in significantly better acquisition of sorting concepts. However, there was no significant difference between the groups with respect to students’ attitudes toward computer programming. Qualitative data analysis indicated that students in the experimental group constructed necessary abstractions through their engagement in visualization construction activities. The authors of this study argue that the students’ active engagement in the visualization construction activities explains only one side of students’ success. The other side can be explained through the instructional approach, constructionism in this case, used to design instruction. The conclusions and implications of this study can be used by researchers and instructors dealing with computational thinking.     

我国实施城市生活垃圾分类处理的对策分析

城市生活垃圾分类回收一直是我国垃圾处理工作一大难题．该文从我国城市垃圾分类混乱化、无序化等现状入手，分析了我国城市生态环境恶化，垃圾分类回收进程缓慢的原因，提出垃圾处理工作应与我国经济发展相协调，并提出实行城市生活垃圾分类回收的相应对策．