首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Generating fixed-length sequences satisfying any givennth-order transition probability matrix
Authors:Gilbert Remillard  James M Clark
Institution:1. Department of Psychology, University of Winnipeg, R3B 2E9, Winnipeg, MB, Canada
Abstract:An experimental design involving sequences ofm distinct events can be conceptualized as annthorder transition probability matrix specifying the probabilities with which each of themdistinct events is to follow certainn-grams. This paper describes a general method for constructing sequences of shortest possible length that satisfy any such matrix and presents a computer program that randomly generates such sequences.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号