A job grouping approach for planning container transfers at automated seaport container terminals

This paper proposes a practical job grouping approach, which aims to enhance the time related performance metrics of container transfers in the Patrick AutoStrad container terminal, located in Brisbane, Australia. It first formulates a mathematical model of the automated container transfers in a relatively complex environment. Apart from the consideration on collision avoidance of a fleet of large vehicles in a confined area, it also deals with many other difficult practical challenges such as the presence of multiple levels of container stacking and sequencing, variable container orientations, and vehicular dynamics that require finite acceleration and deceleration times. The proposed job grouping approach aims to improve the makespan of the schedule for yard jobs, while reducing straddle carrier waiting time by grouping jobs using a guiding function. The performance of the current sequential job allocation method and the proposed job grouping approach are evaluated and compared statistically using a pooled t-test for 30 randomly generated yard configurations. The experimental results show that the job grouping approach can effectively improve the schedule makespan and reduce the total straddle carrier waiting time.     

Combination framework of rendezvous algorithm for multi‐agent systems with limited sensing ranges

In this paper, we present a novel rendezvous algorithm framework ‐ the combination framework, which is named after the term convex combination in computational geometry. The convergence of the proposed algorithms is proved based on the novel tools from the recent results in graph theory and consensus study. It has been observed that the circumcenter algorithm can be considered as a special case of the combination framework. Moreover, the relevant analysis provides us a novel viewpoint on designing and the rendezvous rate of rendezvous algorithms for networked multi‐agent systems with limited sensing ranges. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Energy-aware weighted graph based dynamic topology control algorithm

In this paper a new energy-aware weighted dynamic topology control (WDTC) algorithm is proposed to extend the lifetime of wireless network and balance the nodes’ energy consumption. The idea is that each node builds its local minimum spanning tree (MST) based on the energy-aware weighted graph and the network topology is adjusted accordingly. It was proved theoretically that the topology under WDTC algorithm could preserve the network connectivity and a sufficient condition for the degree of no more than 6 was also given. Simulation shows that WDTC algorithm can effectively prolong the network lifetime and has good topological features.     

Generating Event Sequence-Based Test Cases Using GUI Runtime State Feedback

This paper presents a fully automatic model-driven technique to generate test cases for Graphical user interfaces (GUIs)-based applications. The technique uses feedback from the execution of a “seed test suite,” which is generated automatically using an existing structural event interaction graph model of the GUI. During its execution, the runtime effect of each GUI event on all other events pinpoints event semantic interaction (ESI) relationships, which are used to automatically generate new test cases. Two studies on eight applications demonstrate that the feedback-based technique 1) is able to significantly improve existing techniques and helps identify serious problems in the software and 2) the ESI relationships captured via GUI state yield test suites that most often detect more faults than their code, event, and event-interaction-coverage equivalent counterparts.     

MANET与Internet互连环境中基于多指标的网关优选方案

针对MANET与Internet多网关互连时,网关负载不平衡、分组时延大等问题,提出基于移动节点到网关的跳数、网关负载和路径质量的多指标网关优选方案.以数据包队列长度表示网关负载,以网关公告间隔的变化和网关请求/应答时间表示路径质量.移动节点利用这三个指标,按照简单加性加权算法计算备选网关的效用函数,选择效用值最高的网关作为其接入网关.仿真试验结果表明,应用该方案实现了网关间的负载平衡,分组递交率高、平均分组延迟小,优于单纯以跳数和负载为指标的网关选择方案.     

一类非张量积区域快速傅立叶变换算法在匡产并行机上的可扩展性测试

本文给出了一类基于六边形非张量积区域上的广义离散快速傅立叶变换算法（HFFT）以及它在国产百万亿次超级计算机（曙光5000A）上的测试运行情况．文章介绍了该算法在曙光5000A上的大规模集群测试加速比和可扩展性特性,并通过分析,说明HFFT在国产超级计算机的大规模并行环境下拥有良好的可扩展性．在使用8192个处理器核的情况下,HFFT加速比达到了277倍．我们同样对FFTw软件包进行了测试．本文的分析为解决其他科学计算程序在国产百万亿次规模集群上的可扩展性问题,提供了一些先行的参考和建议．     

一种基于Ajax的爬虫模型的设计与实现

Ajax技术给传统的爬虫带来了巨大的挑战,为了能够提取出在Ajax程序中隐藏的WEB资源,需要解决两大关键问题：JavaScript脚本解析和每一次脚本事件触发后的页面状态信息的保存。提出一种适合Ajax的爬虫模型,在模型中设计了一个嵌入的脚本解析引擎和使用了有向状态图,有效地解决了上述的两个关键问题。实验结果显示该爬虫模型能够有效地提取出Ajax程序中的隐藏资源。     

基于距离学习的生物医学文本聚类算法研究

近年来, 随着生物医学文献数量的大量增加,对生物医学文献进行搜索和挖掘,查找有用的信息成为了生物信息学的一个重要研究方向.聚类作为一种无监督的自动化程度很高的机器学习方法,在信息检索和生物信息学领域中获得了广泛的运用.针对生物医学文本的特点提出了基于距离学习的聚类算法,实验结果证明了该方法的有效性.     

模具改模知识归纳系统设计与实现

日益增多的模具改模方案使得人工归纳改模知识的效率和知识有效性已不能满足实际工作需要,迫切需要建立专用的改模知识归纳系统对大量改模方案进行有效地分析和整理。在改模知识分层递阶表达模型及相应粗糙集归纳算法的基础上,结合改模知识归纳流程,设计并开发了基于粗糙集的模具改模知识归纳系统,实现了改模方案重构、特征约简和规则生成等知识归纳功能,并建立了改模特征知识库和规则库。实际应用表明可以有助于改模知识工程师快速有效地进行改模知识归纳。     

基于形式概念分析与分类树法的Web应用测试方法

Web应用软件开发周期短,时间和资源条件有限,要求有高效的测试。应用分类树法从Web应用导航模型自动生成测试用例,并应用形式概念分析对生成的测试用例集进行精简,在满足给定覆盖标准的前提下,得到较小的测试用例集,提高测试效率。