扩展时间事件图的分析

本文研究了一类扩展时间事件图的分析问题，证明了系统的输出时间序列有三类．有限序列，准周期序列，近似于Dlogp q的序列．     

因果链上因果效应的关系及推断

探讨因果链上总因果效应与局部因果效应的关系及因果效应的可识别性. 给出了在因果链上因果效应的传递关系. 根据这个关系, 给出了通过控制因果链上中间因素消除混杂偏倚的方法.     

扩展de Bruijn图的生成树和广播

扩展de Bruijn图EB(d,m;h1,h2,…,hk)是de Bruijn图的一种推广,它是一种再要的网络互连结构.本文主要研究扩展de Bruijn图中的有根生成树,证明了对任何顶点u和任意整数r:2≤r≤d,扩展de Bruijn图都有以u为根且深度为[log(?),d]·max{hi:1≤i≤k}的rk-叉生成树,并由此获得了扩展de Bruijn图的广播时间的上界.     

基于景气跟踪图的经济景气分析方法

首次将景气跟踪图方法引入中国经济景气分析中,并从宏观经济和行业分析两个维度对中国经济景气情况进行了分析.景气跟踪图方法基于时钟分析方法,对多个重要的经济时间序列指标的发展、运行进行跟踪,进而分析国民经济运行状态.景气跟踪图方法是一种新的景气分析方法,目前多用于宏观经济分析,作者尝试将其引入到行业分析中.针对直接采用原有景气跟踪图可能存在的问题,作者结合先行指标体系进行景气跟踪图分析,同时提出了基于景气跟踪图的经济持久期分析方法.中国经济的实证结果表明改进的景气跟踪图方法在宏观经济与行业分析中均有非常良好的表现,是现有景气分析方法的很好改进与补充.     

SAS软件在质量管理中的应用

本文介绍了质量控制的常用方法及其在ＳＡＳ软件中的实现     

非线性结构向量自回归因果图的广义似然比辨识方法

利用图模型方法研究非线性结构向量自回归模型的因果性问题.构建了非线性结构向量自回归因果图模型,提出图模型因果性的广义似然比辨识方法.构造同期因果关系和滞后因果关系的广义似然比统计量,使用bootstrap方法来确定检验统计量的原分布,模拟研究论述了方法的有效性.     

关于计时事件图的同步性

计时事件图可用于通信、制造等系统的建模、分析、控制和优化.运用极大加代数方法研究计时事件图的同步性.对自治系统,在极大子系统之间添加时间限制来得到系统的同步,并给出同步系统的一些性质和系统同步的最短周期时间.对非自治系统,通过因果反馈得到系统的同步性,并给出较短的周期时间.     

因果模型中因果效应的可识别性研究

对有向非循环图中的因果关系进行探讨,提出了相应的虚拟事实模型,并利用条件独立关系作为辅助信息对一种较为简单的虚拟事实模型的可识别性进行了研究.将可忽略假设推广为可替换性假设,并且得到：在可替换性假设之下,因果效应具有可识别性,即有可能从观察数据直接计算因果效应.     

基于多变量的Granger因果检验方法

针对既有的Granger因果检验方法只能处理两个变量间的因果关系问题,指出这种方法会导致间接因果与直接因果的混淆及由于数据同源而产生的伪因果问题,提出一种可以消除以上问题的多变量因果检验方法,该方法立足于原有的Granger因果检验,适用于短时相依的和平稳的时间序列数据,并根据蒙特卡罗方法给出了统计推断的检验量,设计了方法的实施步骤.最后,应用一个仿真的实例具体展示了方法的使用过程和方法的有效性。     

用Venn图表示相互独立事件及其概率

在概率论中，常用Ｖｅｎｎ图来表示事件及其概率，但尚未见用它来表示相互独立事件及其概率的报导．本文提出了一个解决这一问题的方法     

Supervisory Control of Extended Timed Event Graphs

This paper describes the dynamic behavior of extended timed event graphs related to place delay in the dioid framework. By Cofer and Garg‘s supervisory control theory, we address control problems of extended timed event graphs. Supervisory control of extended timed event graphs (a class of discrete event dynamic systems) is studied in the dioid framework, a necessary and sufficient condition for the ideals of the set of firing time sequences of transitions to be controllable is presented. We prove all the strongly controllable subsets can form a complete lattice,     

图论在离散事件动态系统中的应用

运用图论方法和极大代数方法,研究了非强连通图中的强连通分支的最大圈长平均值与该图的赋权邻接矩阵的特征值之间的关系,并进一步证明了其等价性.     

广义Peterson图的邻点可区别的全染色

设P_(n,k)是一个简单图,其顶点集和边集分别为:V(P_(n,k))={u_0,u_1,…u_(n-1),v_0,v_1,…v_(n-1)},E(P_(n,k))={u_iu_(i+1),u_iv_i,v_iv_(1+k)},则称P_(n,k)为广义Peterson图,其中n≥5,0相似文献   

扩充竞赛图的(1,2)步竞争图

2011年Factor等人提出了有向图的(1,2)步竞争图的概念,并完全刻画了竞赛图的(1,2)步竞争图.设D=(V,A)是一个有向图.如果无向图G=(V,E)满足,V(G)=V(D)并且xy∈E(G)当且仅当D中存在顶点z≠x,y使得d_(D-y)(x,z)=1,d_(D-x)(y,z)≤2或者d_(D-x)(y,z)=1,d_(D-y)(x,z)≤2,那么称G为D的(1,2)步竞争图,记为C_(1,2)(D).本文主要刻画了扩充竞赛图的(1,2)步竞争图.     

基于NEGM(1,1)模型的因果预测方法及应用研究

非等间隔时间序列在工程技术问题中是常见的.研究了一类非等间隔广义时间序列的预测问题,也就是将因果预测模型中的自变量作为广义时间,应用NEGM(1,1)模型将因果预测转化为时间序列预测,并应用空军航材消耗实例进行了模型检验.实践表明本文的方法具有广泛的使用价值.     

Fuzzy图最大树聚类方法及其应用

针对《中国大学评价》中9所交通院校,应用距离补公式计算出Fuzzy关系矩阵,画出Fuzzy图,找出最大树,选取适当的阈值λ对最大树进行截割,得到λ水平上的分类.在此基础上对这9所学校进行合理的分类.     

基于STEP-FRAM的机坪保障车辆事件分析

为了克服传统事件分析方法解决单一因素、相对简易系统故障引发的事件的不足,利用STEP-FRAM模型对机场停机坪保障车辆的不安全事件进行了系统分析,结果表明:使用这种方法可以找出导致机场保障车辆不安全事件的功能共振及其影响因素,解释事件的原因和过程,从而设计出预防和控制措施,降低机坪保障车辆不安全事件再次发生的风险.     

Graph Theoretic and Spectral Analysis of Enron Email Data

Analysis of social networks to identify communities and model their evolution has been an active area of recent research. This paper analyzes the Enron email data set to discover structures within the organization. The analysis is based on constructing an email graph and studying its properties with both graph theoretical and spectral analysis techniques. The graph theoretical analysis includes the computation of several graph metrics such as degree distribution, average distance ratio, clustering coefficient and compactness over the email graph. The spectral analysis shows that the email adjacency matrix has a rank-2 approximation. It is shown that preprocessing of data has significant impact on the results, thus a standard form is needed for establishing a benchmark data. Anurat Chapanond is currently a Ph.D. student in Computer Science, RPI. Anurat graduated B. Eng. degree in Computer Engineering from Chiangmai University (Thailand) in 1997, M. S. in Computer Science from Columbia University in 2002. His research interest is in web data mining analyses and algorithms. M.S. Krishnamoorthy received the B.E. degree (with honors) from Madras University in 1969, the M. Tech degree in Electrical Engineering from the Indian Institute of Technology, Kanpur, in 1971, and the Ph. D. degree in Computer Science, also from the Indian Institute of Technology, in 1976. From 1976 to 1979, he was an Assistant Professor of Computer Science at the Indian Institute of Technology, Kanpur. From 1979 to 1985, he was an Assistant Professor of Computer Science at Rensselaer Polytechnic Institute, Troy, NY, and since, 1985, he has been an Associate Professor of Computer Science at Rensselaer. Dr. Krishnamoorthy's research interests are in the design and analysis of combinatorial and algebraic algorithms, visualization algorithms and programming environments. Bulent Yener is an Associate Professor in the Department of Computer Science and Co-Director of Pervasive Computing and Networking Center at Rensselaer Polytechnic Institute in Troy, New York. He is also a member of Griffiss Institute of Information Assurance. Dr. Yener received MS. and Ph.D. degrees in Computer Science, both from Columbia University, in 1987 and 1994, respectively. Before joining to RPI, he was a Member of Technical Staff at the Bell Laboratories in Murray Hill, New Jersey. His current research interests include bioinformatics, medical informtatics, routing problems in wireless networks, security and information assurance, intelligence and security informatics. He has served on the Technical Program Committee of leading IEEE conferences and workshops. Currently He is an associate editor of ACM/Kluwer Winet journal and the IEEE Network Magazine. Dr. Yener is a Senior Member of the IEEE Computer Society.     

基于不完全信息的扩展审计博弈比较及应用

针对扩展审计博弈的不足及策略信息的不确定性,将审计博弃与统计抽样结合起来,研究不确定条件下,扩展审计博弈的扩展成本与利益转移、策略矩阵与审计风险、样本估计与内控评估,以实现审计师在不确定条件下的策略分析与选择.解决了动态博弈、风险计量系统性决策问题,提高了扩展审计博弈的可靠性与适用性.最后,给出了一个实例,用以演示扩展审计博弈过程,以证实该方法的有效性.     

Privacy Preserving Link Analysis on Dynamic Weighted Graph

Link analysis algorithms have been used successfully on hyperlinked data to identify authoritative documents and retrieve other information. They also showed great potential in many new areas such as counterterrorism and surveillance. Emergence of new applications and changes in existing ones created new opportunities, as well as difficulties, for them: (1) In many situations where link analysis is applicable, there may not be an explicit hyperlinked structure. (2) The system can be highly dynamic, resulting in constant update to the graph. It is often too expensive to rerun the algorithm for each update. (3) The application often relies heavily on client-side logging and the information encoded in the graph can be very personal and sensitive. In this case privacy becomes a major concern. Existing link analysis algorithms, and their traditional implementations, are not adequate in face of these new challenges. In this paper we propose the use of a weighted graph to define and/or augment a link structure. We present a generalized HITS algorithm that is suitable for running in a dynamic environment. The algorithm uses the idea of “lazy update” to amortize cost across multiple updates while still providing accurate ranking to users in the mean time. We prove the convergence of the new algorithm and evaluate its benefit using the Enron email dataset. Finally we devise a distributed implementation of the algorithm that preserves user privacy thus making it socially acceptable in real-world applications. This material is based upon work supported by the National Science Foundation under Grant No. 0222745. Part of this work was presented at the SDM05 Workshop on Link Analysis in Newport Beach, California, April 2005. Yitao Duan is a Ph.D. candidate in Computer Science at the University of California, Berkeley. His research interests include practical privacy enhancing technologies for a variety of situations including: ubiquitous computing, collaborative work, smart spaces, and location-aware services etc. His research goal is to develop provably strong (cryptographic and information-theoretic) protocols that are practically realizable. He received his B.S. and M.S. in Mechanical Engineering from Beijing University of Aeronautics and Astronautics, China in 1994 and 1997. Jingtao Wang is a Ph.D. student in Computer Science at the University of California, Berkeley. His research interests include context-aware computing, novel end-user interaction techniques and statistical machine learning. He was a research member, later a staff research member and team lead at IBM China Research Lab from 1999 to 2002, working on online handwriting recognition technologies for Asian languages. He received his B.E. and M.E. in electrical and computer engineering from Xi'an Jiaotong University, China in 1996 and 1999. He is a member of the ACM and ACM SIGCHI since 2000. Matthew Kam is a Ph.D. student in computer science at the University of California, Berkeley working on educational technology and human-computer interaction for low-income communities in developing regions. He received a B.A. in economics and a B.S. in Electrical Engineering and Computer Sciences, also from Berkeley. He is a member of the ACM and Engineers for a Sustainable World. John Canny is the Paul and Stacy Jacobs Distinguished Professor of Engineering in Computer Science at the University of California, Berkeley. His research is in human-computer interaction, with an emphasis on modeling methods and privacy approaches using cryptography. He received his Ph.D. in 1987 at the MIT AI Lab. His dissertation on Robot Motion Planning received the ACM dissertation award. He received a Packard Foundation Faculty Fellowship and a Presidential Young Investigator Award. His peer-reviewed publications span robotics, computational geometry, physical simulation, computational algebra, theory and algorithms, information retrieval, HCI and CSCW and cryptography.