序列模糊概念格模型及其渐进式构造

传统的序列模式挖掘主要是挖掘满足最小支持度的频繁序列,没有考虑序列在实际中的重要度。为了能够有效地挖掘重要的序列模式,提出了一种序列模糊概念格模型,对所有序列的项目引入了重要度权值,定义了序列的重要度及可以动态调整最小支持度minsup的自适应系数;扩展了模糊形式背景,使其能够方便地表示序列,定义了概念的Galois闭包连接、序列模糊概念及序列模糊格结构,并给出了序列模糊概念格的渐进式构造算法 ScqFuzCL。实验表明,序列模糊概念格模型可以方便有效地组织自适应序列模式,在时间与空间上都具有良好的性能,并为进一步挖掘自适应序列模式提供了理论支持。     

Learning cooperative grasping with the graph representation of a state-action space

In this paper we present a method for two robot manipulators to learn cooperative tasks. If a single robot is unable to grasp an object in a certain orientation, it can only continue with the help of other robots. The grasping can be realized by a sequence of cooperative operations that re-orient the object. Several sequences are needed to handle the different situations in which an object is not graspable for the robot. It is shown that a distributed learning method based on a Markov decision process is able to learn the sequences for the involved robots, a master robot that needs to grasp and a helping robot that supports him with the re-orientation. A novel state-action graph is used to store the reinforcement values of the learning process. Further an example of aggregate assembly shows the generality of this approach.     

两套过滤器反冲洗程序并行解决方案

该反冲洗系统是以艾默生DeltaV为控制系统,采用SFC（Sequential FunctionChart）顺序控制功能进行组态设计。介绍了＇过滤器反冲洗顺控流程,包含反冲洗联锁、反冲洗间隔时间、反冲洗时间、反冲洗跳过等,能提供两套过滤器反冲洗程序并行解决方案。     

A kernel trick for sequences applied to text-independent speaker verification systems

This paper presents a principled SVM based speaker verification system. We propose a new framework and a new sequence kernel that can make use of any Mercer kernel at the frame level. An extension of the sequence kernel based on the Max operator is also proposed. The new system is compared to state-of-the-art GMM and other SVM based systems found in the literature on the Banca and Polyvar databases. The new system outperforms, most of the time, the other systems, statistically significantly. Finally, the new proposed framework clarifies previous SVM based systems and suggests interesting future research directions.     

输电线路野外作业无线通信系统设计研究

随着智能电网概念的提出,电网正逐步加强以科技的手段实施对自身电网的监测维护,特别是在对架空输电线路的施工、维护和监测。由于工作地点都在野外等偏远地区,如何解决通信链路的通畅,使工作现场实时与后台指挥中心保持信息互通是电力系统迫切需要解决的问题。提出一种全新的无线通信平台,采用IP数字扩频无线专网和3G无线公网结合的设计方案,不仅可以为电力野外施工提供一个无线通信平台,而且具有带宽大、传输速率高、不受地势影响、架设简单和成本低的特点,彻底解决野外作业的通信孤岛。     

C语言程序关键词序列表示法

提出C语言程序关键词序列表示法,以消除由于个性化编程所造成的代码的不同,以证明程序是相同的.     

基于块排序索引的生物序列局部比对查询技术

生物数据库中的查询是在生物序列数据集中查找与输入查询序列相似的目标,目前的一些流行工具如BLAST等,是利用启发式算法来提高查询的速度。然而,这些启发式算法无法找到所有的满足要求的结果,而一些精确算法,如动态规划算法,却需要非常高昂的代价。最近,一种新的技术,QASIS,提出了在后缀树的遍历中使用动态规划的精确查找算法,其性能与BLAST相当。但是它的主要缺点就是后缀树这种索引结构需要巨大的空间开销。本文采用基于无损压缩的块排序结构来索引超常的生物序列,减小索引的存储空间开销,有效地减少动态规划算法的计算代价。实验结果表明基于块排序索引的算法在性能方面优于OASIS算法。     

Improvement of constructive heuristics using variable neighbourhood descent for scheduling a flow shop with sequence dependent setup time

This paper deals with the problem of scheduling a flow shop operating in a sequence dependent setup time environment. The objective is to determine the sequence that minimises the makespan. Two efficient neighbourhood search-based heuristics have been developed and tested using 960 problems, and the results obtained reveal their usefulness. The algorithms make use of two existing constructive heuristics. A neighbourhood search known as variable neighbourhood descent is used to improve the two constructive heuristics. Experimentation is carried out on the 96 groups of problems with 10 problem instances in each group. Performance analysis is carried out using the relative performance improvement of each heuristic. The analysis shows a consistently better performance of the neighbourhood-based improvement heuristics. A paired comparison test is used for validating the superiority of the proposed heuristics. The statistical analysis reveals that the performance of the neighbourhood-based heuristics is very much dependent on the initial constructive heuristics used.     

基于F410的分布式小电流接地系统故障选线装置

介绍了一种基于C8051F410单片机为核心构成的分布式小电流选线装置,并详细阐述了其硬件结构及选线原理。该装置硬件结构简单,安装方便,对提高城市配电网安全运行有很大的意义。