一种简便通用的快速干涉检查算法

提出了一种简便通用的快速干涉检查算法.该算法是在机械CAD中,利用合理排序、简化建模、网格图和离散时间表、运动路径简化等方法从而实现快速干涉检查的一种方法.     

The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems

Electronic commerce is an important application that has evolved significantly recently. However, electronic commerce systems are complex and difficult to be correctly designed. Guaranteeing the correctness of an e-commerce system is not an easy task due to the great amount of scenarios where errors occur, many of them very subtle. In this work we presents a methodology that uses formal-method techniques, specifically symbolic model checking, to design electronic commerce applications and to automatically verify them. Also, a model checking pattern hierarchy has been developed—it specifies patterns to construct and verify the formal model of e-commerce systems. We consider this research the first step to the development of a framework, which will integrate the methodology, an e-commerce specification language based on business rules, and a model checker. Adriano Pereira received the B.S. and M.S. degrees in computer science in 2000 and 2002, respectively, and he is currently pursuing the Ph.D. degree in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on performance analysis and modeling of e-business and distributed systems, and formal methods. Mark Song received the B.S., M.S. and Ph.D. degrees in computer science from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His current interests are on distributed systems and formal methods – especially BMC (Bounded Model Checking). Gustavo Franco received the B.S. and M.S. degrees in computer science in 2001 and 2004, respectively, from the Federal University of Minas Gerais, Belo Horizonte, Brazil. His research was on modeling the user behavior of e-business and distributed systems, and formal methods. Actually his current interests are on software engeneering and project management of IT projects.     

求通信网生存能力的一种分裂二叉树算法

本文研究了布尔代数方法在通信网生存能力分析中的应用，提出了一种求布尔代数式不交化变换的分裂二叉树算法，与现有的同类算法相比，该算法具有结构清晰、执行效率高、易于实现等优点。     

Generation of adaptive gait patterns for quadruped robot with CPG network including motor dynamic model

This paper describes the generation of adaptive gait patterns using new Central Pattern Generators (CPGs) including motor dynamic models for a quadruped robot under various environments. The CPGs act as the flexible oscillators of the joints and adjust joint angles to required values. The CPGs are interconnected with each other and sets of their coupling parameters are adjusted by a genetic algorithm so that the quadruped robot can realize stable and adequate gait patterns. Generation of gait patterns results in the formation of the CPG networks suitable for the formation of not only a straight walking pattern but also of rotating gait patterns. Experimental results demonstrate that the proposed CPG networks are effective for the automatic adjustment of the adaptive gait patterns for the tested quadruped robot under various environments. Furthermore, the target tracking control based on image processing is achieved by combining the general gait patterns. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 155(1): 35–43, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20225     

数值地形图的生成及其水文地貌特征评价

数值地形图(DEM)是利用地理信息系统(GIS)进行流域水文模拟的基础, 其精度直接影响模拟结果在没有现成的数值地形图时, 应用人员往往利用传统的地形图来生成它. 本文分别采用Arc/Info地理信息系统软件提供的哈奇逊法和不规则三角网五次插值法, 对一个实验流域的高程取样点进行插值, 生成了4种不同的数值地形图, 从凹洼分布、流域界定、河网提取、地面坡度和地形指数、以及地面径流汇成等方面, 对它们的水文地貌精度进行了比较. 结果表明, 两种方法都能生成由高程点群所反映的地形, 然而由于哈奇逊法能够结合流域的河网结构及其具有物理基础的水文地貌加强法来处理凹洼问题, 因此大大地提高了其所生成的流域数值地形图水文地貌特征精度.     

GPS/电子地图组合定位技术在侦察机器人系统中的应用

介绍了GPS／电子地图组合定位技术在侦察机器人系统中的应用。对GPS接收机进行二次开发，在WINDOWS环境下，基于VB6．0，利用通信控件捕获基准站和移动站的RTCM SC－104格式差分GPS电文。分析比较了几种GPS定位算法的优劣，根据侦察机器人系统的特点，选择逆向伪距差分算法对电文进行处理，并与电子地图相结合进行精确定位。对逆向伪距差分算法的实现做了详细介绍并对实验结果做了简要分析，在电子地图的管理上，提出了将监视区域二次划分的方法，利用BMP位图，对侦察机器人所在的方位进行可视化精确定位。     

Hard disc drive air bearing design: modified DIRECT algorithm and its application to slider air bearing surface optimization

Hard disk drives continue to increase in areal data density. This requires air bearing sliders with lower and lower flying heights (FH). Also the uniformity of the FH and the flatness of the roll profile with radius become more critical as the FH gets lower. By using modern optimization techniques, it is possible to optimize slider air bearing surface (ABS) designs according to multiple design goals. In this paper, we discuss two modifications to the DIRECT algorithm: one to handle tolerance and one to deal with hidden constraints. Some numerical experiments were carried out using these modifications and the modified DIRECT algorithm was applied to slider ABS optimization. The results show that these two modifications can improve the efficiency of the DIRECT algorithm and they also provide more flexibility in slider ABS optimization.     

非AWGN环境下调制类型自动识别

在非AWGN环境下，针对CW，AM，FM，OOK，PSK，QPSK，16QAM，FSK，MSK，SSB十种混合调制信号，对调制类型特征提取方法和自动识别算法进行了分析、综合、设计和计算机仿真。提出了梯层电平分析方法、频率瞬时信号分析、剔除载波的归一化能量分析、平方后信号的频谱分析、四次方后的信号频谱分析等方法。当SNR=10dB时，计算机仿真结果是正确识别率不低于95％，自动识别的平均处理时间为不超过10s。     

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

基于遗传算法的图像边缘信息链表匹配技术

提出了一种基于遗传算法的图像边缘信息链表匹配方法。首先,采用CANNY算子的方法提取图像边缘;然后,将图像边缘信息链表化;最后,基于链表化结果利用遗传算法进行链表匹配。该方法能够减少匹配过程中的计算量,且能实现高效匹配。通过仿真实验,验证了该方法的性能。