欢迎来到天天文库
浏览记录
ID:27234033
大小:128.50 KB
页数:11页
时间:2018-12-02
《软件学报2003年第13卷全年总目录》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、软件学报2003年第13卷全年总目录2003年第13卷第1期传值进程模型检测中诊断信息的生成·····················································刘剑林惠民( 1 )量子自动机的刻画·································································································邱道文( 9 )g演算到Action演算的转换········································
2、······························金英金成植( 16 )基于量子逻辑的自动机和文法理论·········································································邱道文( 23 )基于蛇型磁带的海量数据排序算法··························································李建中张艳秋( 28 )求解TSP问题的多级归约算法····································邹鹏周智陈国
3、良顾钧( 35 )具有O(n)消息复杂度的协调检查点设置算法············································汪东升邵明珑( 43 )对一个分布式终止探测算法的改进··························································刘旭民苏运霖( 49 )三机冗余容错系统的描述和验证······························································郭亮唐稚松( 54 )支持工作流动态变化的过程元模型····
4、························································孙瑞志史美林( 62 )程序执行时间的静态预估与可视化分析方法················孙昌爱金茂忠刘超靳若明( 68 )基于任务的访问控制模型··········································································邓集波洪帆( 76 )开放式实时系统的调度理论与方法分析·····································邹勇李明树王青(
5、 83 )多级安全性政策的历史敏感性··································································石文昌孙玉芳( 91 )青鸟面向对象软件建模工具的研究与实现····················麻志毅赵俊峰孟祥文张文娟( 97 )基于UML的软硬件协同设计的模型分析方法····························陈思功秦晓章恒羽中( 103 )Internet测量与分析综述··················张宏莉方滨兴胡铭曾姜誉詹春艳张树峰( 110 )基于标记的缓存
6、协作分布式Web服务器系统···········································林曼筠钱华林( 117 )通用多速率组播加权公平速率分配理论·····················································翟明玉顾冠群( 124 )一个应用于移动AdHoc网络管理的簇生成算法···········冯永新王光兴刘治国姜月秋( 132 )移动分布式实时嵌套事务提交·····································刘云生廖国琼李国徽夏家莉( 139 )基于RSA和单向函数防欺
7、诈的秘密共享体制···········································费如纯王丽娜( 146 )安全组播的Huffman层次密钥管理············································屈劲葛建华蒋铭( 151 )2003年第13卷第2期-XI-THSORT:单机并行排序算法·······················································施遥张力刘鹏( 159 )用Q(t)的广义连接图求有障碍时的最短路径·················周智蒋承东黄刘生
8、顾钧( 1
此文档下载收益归作者所有