遗传算法求解复杂集装箱装载问题方法研究

现场集装箱装载问题多为多目标、多约束优化的复杂问题.遗传算法本身的鲁棒性、并行搜索性以及在NP完全问题求解中的广泛应用,表明遗传算法是解决复杂集装箱装载问题的有效途径.探讨了遗传算法在求解这一复杂问题过程中的应用,给出了有效的编码形式和解码运算.算例求解结果显示出很好的效果.     

符号M阵列面结构光多分辨解码方法研究

研究了符号M阵列面结构光图像的多分辨解码方法,结合基于形心特征的标准符号的分类和识别,着重提出了多分辨解码过程中未识别区域的提取方法,并结合实际问题提出了图像标记和符号识别的特殊处理方法,如分割符号间隔、填充十字型区域等,进而实现照度不均面结构光图像解码率最大化的目的.同时该解码方法也大大提高了照度不均模式图像解码的执行效率.     

基于本体的P2P网络资源检索算法研究

为使基于DHT的结构化P2P网络支持语义检索,提高查全率,提出一种基于DHT和本体的搜索方法SOC (semantic ontology chord).针对结构化P2P网络搜索时只能根据关键词精确匹配的缺点,改进了DHT中的资源标识符,利用本体技术进行模糊搜索,并使兴趣相似节点在逻辑上处于邻近位置,提高了P2P网络中资源检索的查全率.使用Peer-Sim模拟器进行了仿真模拟,仿真实验结果表明,随着网络规模的增加,该搜索方法相比Chord模型具有较高的查全率.     

基于Winsock数据交互平台的设计

介绍了Winsock的基本概念及其编程原理，描述了基于C／S模式的客户和服务器端通信程序的执行过程，分析了交互平台中数据处理的打包和解包过程，确定打包和解包的数据单元格式，并在此基础上，完成了数据打包和解包的函数算法设计。     

A novel intelligent verification platform based on a structured analysis model

An intelligent verification platform based on a structured analysis model is presented.Using an abstract model mechanism with specific signal interfaces for user callback,the unified structured analysis data,shared by the electronic system level design,functional verification,and performance evaluation,enables efficient management review,auto-generation of code,and modeling in the transaction level.We introduce the class tree,flow parameter diagram,structured flow chart,and event-driven finite state machine as structured analysis models.As a sand table to carry maps from different perspectives and levels via an engine,this highly reusable platform provides the mapping topology to search for unintended consequences and the graph theory for comprehensive coverage and smart test cases.Experimental results show that the engine generates efficient test sequences,with a sharp increase in coverage for the same vector count compared with a random test.     

An Experimental Comparison of the Maintainability of Object-Oriented and Structured Design Documents

Several important questions still need to be answered regarding the maintainability of object-oriented design documents. This paper focuses on the following issues: are object-oriented design documents easier to understand and modify than structured design documents? Do they need to comply with quality guidelines such as the ones provided by Coad and Yourdon? What is the impact of such quality standards on the understandability and modifiability of design documents? Answers can be based on informed opinion or empirical evidence. Since software technology investments are substantial and contradictory opinions exist regarding design strategies, performing empirical studies on these topics is a relevant research activity. This paper presents a controlled experiment performed with computer science students as subjects. Results strongly suggest that quality guidelines based on Coad and Yourdon principles have a beneficial effect on the maintainability of object-oriented design documents. However, there is no strong evidence regarding the alleged higher maintainability of object-oriented design documents over structured design documents. Furthermore, results suggest that object-oriented design documents are more sensitive to poor design practices, in part because their cognitive complexity becomes increasingly unmanageable. However, because our ability to generalise these results is limited, they should be considered as preliminary, i.e., it is very likely that they can only be generalised to programmers with little object-oriented training and programming experience. Such programmers can, however, be commonly found on maintenance projects. As well as additional research, external replications of this study are required to confirm the results and achieve confidence in these findings.     

求解圆形packing问题的一个快速拟物算法

求解NP难问题一直是计算机科学技术中的一个瓶颈任务。自20世纪70年代以来的研究表明,不存在求解此类问题的完整严格的有效算法。因此用启发式方法求解成为当今研究的一个热点。圆形packing问题是一个有着很高理论和实用价值的NP难问题。该文提出了一些有效的搜索策略,得到了一个求解它的快速有效启发式算法。最后用计算实例验证了此算法的有效性,计算结果表明此算法明显优于已有快速算法。     

On hypercube packings,blocking sets and a covering problem

Consider sets S of hypercubes of side 2 in the discrete n-dimensional torus of side 4 with the property that every possible hypercube of side 2 has a nonempty intersection with some hypercube in S. The problem of minimizing the size of S is studied in two settings, depending on whether intersections between hypercubes in S are allowed or not. If intersections are not allowed, then one is asking for the smallest size of a non-extensible packing S  ; this size is denoted by f(n)$f(n)$. If intersections are allowed, then the structure S is called a blocking set. The smallest size of a blocking set S   is denoted by h(n)$h(n)$. By computer-aided techniques, it is shown that f(5)=12$f(5)=12$, f(6)=16$f(6)=16$, h(6)=15$h(6)=15$ and h(7)≤23$h(7)\le 23$. Also, non-extensible packings as well as blocking sets of certain small sizes are classified for n≤6$n\le 6$. There is a direct connection between these problems and a covering problem originating from the football pools.     

一种混合全局寻优算法及其在布局中的应用

布局问题是NP完全问题,传统的优化算法很难求得全局最优欠解,遗传算法和模拟退火算法等的随机搜索算法的求解精度和效率不能令人满意,文中将启发式随机搜索策略的局部优化算法相结合,构造混合全局寻优算法,以旋转卫星舱布局问题的简化模型为背景,建立了多目标优化的数学模型,通过一已在最优解的布局算例与遗传算法和乘子法的计算结果比较,该算法求解的质量和效率更优,表明此算法在布局优化中具有应用潜力。     

一种基于实测的高维动态负载平衡方法

针对大规模科学计算中的强非规则结构负载问题,作者开发出一种基于实测的动态负载平衡方法．首先,将由规则结构化网格组成的模拟区域剖分成多块;其次,把块的高维坐标转换成一维Hilbert空间填充曲线（HSFC）索引;然后,基于实测信息采用多层均权法剖分按一维HSFC索引排列的块;最后根据剖分信息重分配块以平衡负载．它把仅适用于一维的多层均权法扩展到二维和三维,并引入更多的实测信息和块数据结构．与ISP方法相比,该方法在64个CPU上提高负载平衡效率10％,在某MPP的500个CPU上模拟强非规则结构负载问题时,获得了88％的负载平衡效率和84％的并行效率．