Putting value of information theory into practice: a methodology for building sequential decision support systems

Abstract: The paper presents a methodology for building sequential decision support systems based on decision theory using value of information (for short, DT‐VOI based SDSSs). DT‐VOI based SDSSs support decision‐makers in difficult problems of sequential decision‐making. In particular we consider the problem of building DT‐VOI based SDSSs which are capable of supporting decisions in critical situations where (1) making a decision entails knowing the states of some critical hypotheses, and such knowledge is acquired by performing suitable tests; (2) test outcomes are uncertain; (3) performing a test entails, in general, some drawbacks, so that a trade‐off exists between such drawbacks and the value of the information provided by the test; (4) performing a test has the side‐effect that it changes the expected benefit from performing other tests; (5) exceptional situations alter probability and utility default values.     

序列模式图及其构造算法

序列模式挖掘是数据挖掘的一个重要分支。在序列事务及有关信息处理中有着广泛的应用,目前已有许多序列模式模型及相应的挖掘算法,该文在对序列模式挖掘问题及挖掘算法进行分析的基础上。定义了一种称为序列模式图的序列模式框架。用于表示序列模式挖掘过程发现的所有序列模式,序列模式图是由离散状态的序列集到统一的图结构的桥梁,可以将序列模式挖掘结果统一到序列模式图中来,基于序列模式图进行研究可发现某些结构化的新知识,称之为后序列模式挖掘,文中还给出了序列模式图的有关性质及构造算法。     

Human–machine interface in bioprosthesis control using EMG signal classification

Abstract: We present a concept of human–machine interface intended for the task of bioprosthesis decision control by means of sequential recognition of the patient's intent based on the electromyography (EMG) signal acquired from his/her body. The EMG signal characteristics, the problem of processing the signals including acquisition and feature extraction and their classification are discussed. The contextual (sequential) recognition via fuzzy relations for the classification of the patient's intent is considered and the implied decision algorithms are presented. In the proposed method, the fuzzy relation is determined on the basis of the learning set as a solution of an appropriate optimization problem and then this relation is used in the form of a matrix of membership degrees at successive instants of the sequential decision process. Three algorithms of sequential classification which differ from one another in the sets of input data and procedure are described. The proposed algorithms were experimentally tested in the recognition of phases of the grasping process of the hand on the basis of the EMG signal, where the real-coded genetic algorithm was used as an optimization procedure. The concept of the measurement stand which was the source of information exploited in the experimental investigations of the algorithms is also described.     

面向顺序存储结构的数据流分析

C程序中数组、malloc动态分配后的连续内存等顺序存储结构被大量使用,但大多数传统的数据流分析方法未能充分描述其结构及其上的操作,特别是在利用指针访问顺序存储结构时,传统的分析方法只关注了指针的指向关系,而未讨论指针可能发生偏移的数值信息,且未考虑发生偏移时可能存在越界的不安全问题,导致了对顺序存储结构分析不精确.针对以上不足,首先对顺序存储结构进行抽象建模,并对顺序存储结构与指针结合使用时的指向关系与偏移量进行有效表示,建立了用于顺序存储结构的抽象内存模型SeqMM;其次,归纳总结C程序中顺序存储结构涉及的指针相关迁移操作、谓词操作及遍历顺序存储结构的循环操作,提出了安全范围判别保证操作安全性;之后,针对函数调用时形参指针引用顺序存储结构与实参的映射过程进行过程间推导规则设计;最后,基于上述分析,提出了一种内存泄漏缺陷检测算法,对5个开源C工程的内存泄漏缺陷进行检测.实验结果表明,所提出的Seq MM能够有效地刻画C程序中的顺序存储结构及其涉及的各种操作,其数据流分析结果能够用于内存泄漏的检测工作,同时在效率和精度之间取得合理的权衡.     

模糊序贯决策算法优化设计及Matlab实现

对模糊序贯决策算法进行了优化设计,构建了一种基于模糊关系矩阵的模糊序贯决策算法,并利用Matlab程序实现了算法,给出了源程序,通过实例分析说明了算法的简洁性。     

Analyzing Sequential Patterns in Retail Databases

Finding correlated sequential patterns in large sequence databases is one of the essential tasks in data mining since a huge number of sequential patterns are usually mined, but it is hard to find sequential patterns with the correlation. According to the requirement of real applications, the needed data analysis should be different. In previous mining approaches, after mining the sequential patterns, sequential patterns with the weak affinity are found even with a high minimum support. In this paper, a new framework is suggested for mining weighted support affinity patterns in which an objective measure, sequential ws-confidence is developed to detect correlated sequential patterns with weighted support affinity patterns. To efficiently prune the weak affinity patterns, it is proved that ws-confidence measure satisfies the anti-monotone and cross weighted support properties which can be applied to eliminate sequential patterns with dissimilar weighted support levels. Based on the framework, a weighted support affinity pattern mining algorithm （WSMiner） is suggested. The performance study shows that WSMiner is efficient and scalable for mining weighted support affinity patterns.     

基于贝叶斯序贯博弈模型的智能电网信息物理安全分析

智能电网是利用信息技术优化从供应者到消费者的电力传输和配电网络.作为一种信息物理系统（Cyber-physical system,CPS）,智能电网由物理设备和负责数据计算与通信的网络组成.智能电网的诸多安全问题会出现在通信网络和物理设备这两个层面,例如注入坏数据和收集客户隐私信息的网络攻击,攻击电网物理设备的物理攻击等.本文主要研究了智能电网的系统管理员（防护者）如何确定攻击者类型,从而选择最优防护策略的问题.提出了一种贝叶斯序贯博弈模型以确定攻击者的类型,根据序贯博弈树得到博弈双方的均衡策略.首先,对类型不确定的攻击者和防护者构建静态贝叶斯博弈模型,通过海萨尼转换将不完全信息博弈转换成完全信息博弈,得到贝叶斯纳什均衡解,进而确定攻击者的类型.其次,考虑攻击者和防护者之间的序贯博弈模型,它能够有效地帮助防护者进行决策分析.通过逆向归纳法分别对两种类型的攻击者和防护者之间的博弈树进行分析,得到博弈树的均衡路径,进而得到攻击者的最优攻击策略和防护者的最优防护策略.分析表明,贝叶斯序贯博弈模型能够使防护者确定攻击者的类型,并且选择最优防护策略,从而为涉及智能电网信息安全的相关研究提供参考.     

快速路匝道入口智能网联车协同合并控制研究

针对快速路匝道入口场景在高车流量的情况下容易发生交通拥堵的问题,提出了一种快速路匝道入口智能网联车(connected and automated vehicles, CAV)协同合并控制的解决方案,将问题解耦成多车顺序决策和车辆运动规划两部分。其中多车顺序决策对通行效率起到重要作用,因此设计了一种基于状态评价模型(state evaluation model, SEM)的多车顺序决策算法。该算法首先建立状态空间并初始化,考虑通行效率和车辆延迟设计状态评价函数,通过状态转移关系选择出最优状态,最终回溯得到最优通行顺序。根据车辆状态和到达冲突点时间,控制器实时推导各车辆纵向速度的解析解,实现车辆运动规划。仿真和实验结果表明,该方案在满足交通系统实时性要求的同时能有效提高快速路匝道入口的通行效率,缩短车辆延迟,降低燃油消耗。     

基于Bitmap的序列模式挖掘的改进算法

结合BBSP,提出了一种称做最终位置归纳序列模式挖掘(LPI-SPM)的新算法,该算法可以有效地从大型数据库中获取所有的频繁序列模式。该策略与以前工作的不同点在于:当判断一个序列是否是模式时,通过扫描数据库创建S-矩阵来实现(PrefixSpan)或者通过对候选项进行交运算(SPADE)或并运算(BBSP)统计其数量来实现。相反,在基于下列事实的基础上LPI-SPN会很容易实施这一过程,即若一个项的最终位置小于当前前缀位置,在相同的顾客序列中,该项就不会出现在当前前缀的后面。LPI-SPM在序列挖掘过程中可以大大缩减搜索空间,而且挖掘序列模式的效力可观。实验结果表明,在各种数据集合中LPI-SPM胜过BBSP三倍。     

基于SQP/GA混合优化算法的双容水箱非线性预测控制

为了计算控制序列，非线性模型预测控制可以转换为一个带约束的非线性优化过程．本文分析了三种约束处理方案，根据遗传算法的特点，将等式约束用于状态量计算，在搜索空间降维的同时消除遗传算法难以求解的等式约束．对双容水箱进行遗传算法和序列二次规划仿真试验和实际控制，结果表明遗传算法对控制量的优化效果优于序列二次规划．为克服遗传算法耗时较长、优化结果存在随机抖动的缺点，结合序列二次规划提出一种混合优化算法，仿真和实控结果表明其可行性和有效性．     

The transformation of collections of communicating sequential processes that represent pipeline configurations

The segments of a pipelined process can be represented as communicating sequential processes. The communication between the segments of the pipeline are represented as channel communication between the communicating sequential processes. It is possible to merge two communicating sequential processes (that would be adjacent in the pipeline) into one communicating sequential process. This is done by matching the output expressions of the first communicating sequential process (e.g. chlexpr) with the appropriate input expressions of the second communicating sequential process (e.g. ch?var) and replacing each pair by a single assignment statement (var = expr).     

一种序列模式发现的新方法

针对序列模式挖掘,提出频繁2序列图(F2SG)来表示数据库中的序列信息,通过扫描一次数据库,将与挖掘任务相关的信息映射到F2SG中,并在此基础上提出一种新的序列模式发现算法——GBSP。GBSP算法充分利用F2SG中表示的项目之间的次序关系进行频繁序列挖掘,提高了其生成效率。理论分析与实验表明,该算法较传统的序列模式发现算法在时间和空间性能上具有优越性。     

一种基于时间窗口的数据预处理算法

提出了一个基于时间窗口的数据预处理算法．面向具体应用,根据已有知识,此算法可以智能化地滤去一些“噪声”数据．与一般的定义不同．本文所谓的“噪声”数据是指那些由一些已知的规则决定性地影响着的数据,研究显示它们会对进一步的数据挖掘形成极大干扰．实际测试结果表明,本算法能够改善一些已有数据挖掘算法的执行效果．     

分配序列效应代数的理想和同余

分配的序列效应代数（简记为DSEA）,是指在一个效应代数上带有一种乘积运算并满足一定的条件。介绍了分配的序列效应代数中的左理想、右理想、理想、素理想和同余等概念,并且证明了满足（RDP）性质并且以1为乘积单位的分配序列效应代数是具有（RDP）性质的反格分配序列效应代数的子直积。     

考虑价格的跨种类模糊序列模式挖掘算法*

消费者对不同种类的产品具有不同的价格偏好,而传统的序列模式挖掘算法仅考虑序列中不同项目的出现顺序,使得挖掘到的序列模式没有包含产品价格以及种类等重要信息。为了克服传统算法的这一缺陷,在序列模式中体现更多的用户行为信息,本文基于模糊集理论,提出了一种在产品种类维度上进行的跨种类模糊价格序列模式挖掘算法。实验结果表明,与传统序列模式挖掘算法相比,该算法可以有效解决序列数据的稀疏性问题,能够挖掘得到更多个性化的序列模式。     

Transfer of Learning by Composing Solutions of Elemental Sequential Tasks

Although building sophisticated learning agents that operate in complex environments will require learning to perform multiple tasks, most applications of reinforcement learning have focused on single tasks. In this paper I consider a class of sequential decision tasks (SDTs), called composite sequential decision tasks, formed by temporally concatenating a number of elemental sequential decision tasks. Elemental SDTs cannot be decomposed into simpler SDTs. I consider a learning agent that has to learn to solve a set of elemental and composite SDTs. I assume that the structure of the composite tasks is unknown to the learning agent. The straightforward application of reinforcement learning to multiple tasks requires learning the tasks separately, which can waste computational resources, both memory and time. I present a new learning algorithm and a modular architecture that learns the decomposition of composite SDTs, and achieves transfer of learning by sharing the solutions of elemental SDTs across multiple composite SDTs. The solution of a composite SDT is constructed by computationally inexpensive modifications of the solutions of its constituent elemental SDTs. I provide a proof of one aspect of the learning algorithm.     

多时间粒度序列模式挖掘

序列模式挖掘是数据挖掘的一个重要问题.传统的序列模式仅能揭示频繁出现的项目以及出现的顺序,但不能揭示在前续项目出现的情况下,后续项目出现的时间.在本文中,引入一种新的多时间粒度序列模式,模式中相邻项目之间的转换时间采用从原数据集中导出的、多时间粒度下的最小有界时间区间和平均时间标注.建立了多时间粒度序列模式挖掘模型,提出了一种新的多时间序列模式挖掘算法MG-PrefixSpan.实验表明,算法是有效的.     

Sequential decision-theoretic models and expert systems

Sequential decision models are an important component of expert systems since, in general, the cost of acquiring information is significant and there is a trade-off between the cost and the value of information. Many expert systems in various domains (business, engineering, medicine etc.), needing costly inputs that are not known until the system operates, have to face this problem. In the last decade the field of sequential decision models based on decision theory (sequential decision-theoretic models) have become more and more important due to both the continuous progress made by research in Bayesian networks and the availability of modern powerful tools for building Bayesian networks and for probability propagation. This paper provides readers (especially knowledge engineers and expert system designers) with a unified and integrated presentation of the disparate literature in the field of sequential decision-making based on decision theory, in order to improve comprehensibility and accessibility. Besides the presentation of the general theory, a view of sequential diagnosis as an instance of the general concept of sequential decision-theoretic models is also shown.     

基于序贯博弈的Ad Hoc网络功率控制算法

针对分布式拓扑结构的Ad Hoc网络,将用户处于异步竞争方式下的功率控制问题抽象为动态博弈模型,通过多步迭代的逆向归纳法,逐步分析了两用户组及多用户组下的序贯博弈过程。并提出一种分布式的功率控制博弈算法,有效求解了用户发射功率的均衡策略,来优化用户之间的并发传输能力,提高频谱效率。仿真实验表明,建立基于序贯博弈的功率控制过程,能够有效地减轻用户之间的干扰影响,提升用户接收信干噪比质量,从而改善了系统吞吐率性能收益。     

基于上位机的混合流程顺序控制系统

以计算机为基础的生产过程控制与调度自动化系统,常会遇到包含并发控制流程、多条件多路径的复杂控制过程等等．基于当前计算机和通信技术的发展水平,该文提供了一种通过在调度中心上位机运用全组态配置和后台程序搭配的设计方法,实现混合流程的顺序控制,可以有效缩短控制时间、减少误操作从而能使下位机运行的可靠性明显提高,具有可观的经济效益和社会效益．