Multi-Valued Simulation with Binary Decision Diagrams
- 格式:pdf
- 大小:68.67 KB
- 文档页数:10
(总结篇)使用MATLABGPU加速计算MATLAB并行计算与分布式服务器MATLAB技术论坛本帖最后由蓝云风翼于 2013-12-18 17:28 编辑注:利用gpu加速有一下工具1.JACKET 可从帖子中寻找2.MATLAB a.并行计算工具箱 gpuArray,查看支持gpuArray的函数methods('gpuArray')b.已经支持GPU的一些工具箱c.使用mex方式 /thread-33511-1-1.htmld.使用产生ptx方法编写cuda kernel这些都可以通过help gpuArray查看,建议使用最新版本2013a 查看GPU是否支持gpuDevice命令3.GPUMAT帖子中找4. nvmex方式即cudawhitepaper可从帖子中直接下载/thread-20597-1-1.html/thread-25951-1-1.htmlSIMULINK :/forum.php?mod=viewthread&tid=27230目前,GPU在通用数值计算领域的应用已经越来越广泛,MATLAB通过以下几种方式支持GPU。
一、MATLAB内嵌GPU函数fft, filter,及linear algebra operations等。
二、内嵌工具箱支持GPU的函数: Communications System Toolbox, Neural Network Toolbox, Phased Array Systems Toolbox, and Signal Processing Toolbox (GPU support for signal processing algorithms)三、在MATLAB中接入CUDA kernel,通过PTX方式或者MEX方式。
Multiple GPUs在单机和计算集群上的使用通过MATLAB 的并行计算工具箱(PCT)及MATLAB分布式计算工具箱(MDCS)(matlab worker)一、PCT GPUArrayParallel Computing Toolbox 提供 GPUArray,这是一个具有多个关联函数的特殊数组类型,可让您直接从MATLAB 在启用CUDA 的 NVIDIA GPU 上执行计算。
transistor n 晶体管diode n 二极管semiconductor n 半导体resistor n 电阻器capacitor n 电容器alternating adj 交互的amplifier n 扩音器,放大器integrated circuit 集成电路linear time invariant systems 线性时不变系统voltage n 电压,伏特数tolerance n 公差;宽容;容忍condenser n 电容器;冷凝器dielectric n 绝缘体;电解质electromagnetic adj 电磁的adj 非传导性的deflection n偏斜;偏转;偏差linear device 线性器件the insulation resistance 绝缘电阻anode n 阳极,正极cathode n 阴极breakdown n 故障;崩溃terminal n 终点站;终端,接线端emitter n 发射器collect v 收集,集聚,集中insulator n 绝缘体,绝热器oscilloscope n 示波镜;示波器gain n 增益,放大倍数forward biased 正向偏置reverse biased 反向偏置P-N junction PN结MOS(metal-oxide semiconductor)金属氧化物半导体enhancement and exhausted 增强型和耗尽型integrated circuits 集成电路analog n 模拟digital adj 数字的,数位的horizontal adj, 水平的,地平线的vertical adj 垂直的,顶点的amplitude n 振幅,广阔,丰富attenuation n衰减;变薄;稀薄化multimeter n 万用表frequency n 频率,周率the cathode-ray tube 阴极射线管dual-trace oscilloscope 双踪示波器signal generating device 信号发生器peak-to-peak output voltage 输出电压峰峰值sine wave 正弦波triangle wave 三角波square wave 方波amplifier 放大器,扩音器oscillator n 振荡器feedback n 反馈,回应phase n 相,阶段,状态filter n 滤波器,过滤器rectifier n整流器;纠正者band-stop filter 带阻滤波器band-pass filter 带通滤波器decimal adj 十进制的,小数的hexadecimal adj/n十六进制的binary adj 二进制的;二元的octal adj 八进制的domain n 域;领域code n代码,密码,编码v编码the Fourier transform 傅里叶变换Fast Fourier Transform 快速傅里叶变换microcontroller n 微处理器;微控制器assembly language instrucions n 汇编语言指令chip n 芯片,碎片modular adj 模块化的;模数的sensor n 传感器plug vt堵,塞,插上n塞子,插头,插销coaxial adj 同轴的,共轴的fiber n 光纤relay contact 继电接触器single instruction programmer 单指令编程器dedicated manufactures programming unit 专供制造厂用的编程单元beam n (光线的)束,柱,梁polarize v(使)偏振,(使)极化Cathode Ray Tube(CRT)阴极射线管neuron n神经元;神经细胞fuzzy adj 模糊的Artificial Intelligence Shell 人工智能外壳程序Expert Systems 专家系统Artificial Intelligence 人工智能Perceptive Systems 感知系统neural network 神经网络fuzzy logic 模糊逻辑intelligent agent 智能代理electromagnetic adj 电磁的coaxial adj 同轴的,共轴的microwave n 微波charge v充电,使充电insulator n 绝缘体,绝缘物nonconductive adj非导体的,绝缘的antenna n天线;触角modeling n建模,造型simulation n 仿真;模拟prototype n 原型array n 排队,编队vector n 向量,矢量wavelet n 微波,小浪sine 正弦cosine 余弦inverse adj倒转的,反转的n反面;相反v倒转high-performance 高精确性,高性能two-dimensional 二维的;缺乏深度的three-dimensional 三维的;立体的;真实的object-oriented programming面向对象的程序设计spectral adj 光谱的attenuation n衰减;变薄;稀释distortion n 失真,扭曲,变形wavelength n 波长refractive adj 折射的ATM 异步传输模式Asynchronous TransferModeADSL非对称用户数字线Asymmetric digitalsubscriber lineVDSL甚高速数字用户线very high data ratedigital subscriber lineHDSL高速数据用户线high rate digitalsubscriber lineFDMA频分多址(Frequency Division MultipleAccess)TDMA时分多址(Time Division Multiple Access)CDMA同步码分多址方式(Code Division MultipleAccess)WCDMA宽带码分多址移动通信系统(WidebandCode Division Multiple Access)TD-SCDMA(Time Division Synchronous CodeDivision Multiple Access)时分同步码分多址SDLC(synchronous data link control)同步数据链路控制HDLC(high-level data link control)高级数据链路控制IP/TCP(internet protocol /transfer ControlProtocol)网络传输控制协议ITU (International Telecommunication Union)国际电信联盟ISO国际标准化组织(InternationalStandardization Organization);OSI开放式系统互联参考模型(Open SystemInterconnect)GSM全球移动通信系统(Global System forMobile Communications)GPRS通用分组无线业务(General Packet RadioService)FDD(frequency division duplex)频分双工TDD(time division duplex)时分双工VPI虚路径标识符(Virtual Path Identifier);ISDN(Integrated Services Digital Network)综合业务数字网IDN综合数字网(integrated digital network)HDTV (high definition television)高清晰度电视DCT(Discrete Cosine Transform)离散余弦变换VCI(virtual circuit address)虚通路标识MAN城域网Metropolitan area networksLAN局域网local area networkWAN广域网wide area network同步时分复用STDM Synchronous Time DivisionMultiplexing统计时分复用STDM Statistical Time DivisionMultiplexing单工传输simplex transmission半双工传输half-duplex transmission全双工传输full-duplex transmission交换矩阵Switching Matrix电路交换circuit switching分组交换packet switching报文交换message switching奇偶校验parity checking循环冗余校验CRC Cyclic Redundancy Check虚过滤Virtual filter数字滤波digital filtering伪随机比特Quasi Random Bit带宽分配Bandwidth allocation信源information source信宿destination数字化digitalize数字传输技术Digital transmission technology灰度图像Grey scale images灰度级Grey scale level幅度谱Magnitude spectrum相位谱Phase spectrum频谱frequency spectrum智能设备Smart Device软切换Soft handover硬切换Hard Handover相干检测Coherent detection边缘检测Edge detection冲突检测collision detection业务集合service integration业务分离/综合service separation/ integration网络集合network integration环形网Ring networks令牌环网Token Ring network网络终端Network Terminal用户终端user terminal用户电路line circuit电路利用率channel utilization(通道利用率)相关性coherence相干解调coherent demodulation数字图像压缩digital image compression图像编码image encoding有损/无损压缩lossy/lossless compression解压decompression呼叫控制Call Control误差控制error control存储程序控制stored program control存储转发方式store-and-forward manner语音\视频传输voice\video transmission视频点播video-on-demand(VOD)会议电视Video Conference有线电视cable television量化quantization吞吐量throughput话务量traffic多径分集Multipath diversity多媒体通信MDM Multimedia Communication多址干扰Multiple Access Interference人机交互man machine interface交互式会话Conversational interaction路由算法Routing Algorithm目标识别Object recognition话音变换Voice transform中继线trunk line传输时延transmission delay远程监控remote monitoring光链路optical link拓扑结构Topology均方根root mean squarewhatsoever=whatever 0switchboard (电话)交换台bipolar (电子)双极的premise (复)房屋,前提cursor (计算机尺的)游标,指导的elapse (时间)经过,消失vaporize (使)蒸发subsystem (系统的)分部,子系统,辅助系统metallic (像)金属的,含金属的,(声音)刺耳的dispatch (迅速)派遣,急件consensus (意见)一致,同意deadline (最后)期限,截止时间tomographic X线体层摄像的alas 唉,哎呀cluster 把…集成一束,一组,一簇,一串,一群encyclopedia 百科全书millionfold 百万倍的semiconductor 半导体radius 半径范围,半径,径向射线half-duplex transmission 半双工传输accompaniment 伴随物,附属物reservation 保留,预定quotation 报价单,行情报告,引语memorandum 备忘录redundancy 备用be viewed as 被看作…be regards as 被认为是as such 本身;照此;以这种资格textual 本文的,正文的verge 边界variation 变化,变量conversion 变化,转化identity 标识;标志criterion 标准,准则in parallel on 并联到,合并到juxtapose 并置,并列dialing pulse 拨号脉冲wave-guide 波导wavelength division multiplexed 波分复用baud rate 波特率playback 播放(录音带,唱片)no greater than 不大于update 不断改进,使…适合新的要求,更新asymmetric 不对称的irrespective 不考虑的,不顾的inevitably 不可避免的inevitable 不可避免的,不可逃避的,必定的segment 部分abrasion 擦伤,磨损deploy 采用,利用,推广应用take the form of 采用…的形式parameter 参数,参量layer 层dope 掺杂FET(field effect transistors) 场效应管audio recording 唱片ultra-high-frequency(UHF) 超高频in excess of 超过in excess of 超过hypertext 超文本ingredient 成分,因素ingredient 成分,组成部分,要素metropolitan-area network(WAN) 城域网metropolitan area network(WAN) 城域网,城市网络congestion 充满,拥挤,阻塞collision 冲突extractive 抽出;释放出extract 抽取,取出,分离lease 出租,租约,租界期限,租界物pass on 传递,切换transmission 传输facsimile 传真innovative=innovatory 创新的,富有革新精神的track 磁道impetus 促进,激励cluster 簇stored-program control(SPC) 存储程序控制a large number of 大量的peal 大声响,发出supersede 代替supplant 代替,取代out-of-band signaling 带外信号simplex transmission 单工传输monochromatic 单色的,单色光的,黑白的ballistic 弹道的,射击的,冲击的conductor 导体hierarchy 等级制度,层次infrastructure 底层结构,基础结构geographic 地理的,地区的geographically 地理上GIS(ground instrumentation system) 地面测量系统ground station 地面站earth orbit 地球轨道extraterrestrial 地球外的,地球大气圈外的Land-sat 地球资源卫星rug 地毯,毯子ignite 点火,点燃,使兴奋electromagnetic 电磁的inductive 电感arc 电弧telephony 电话(学),通话dielectric 电介质,绝缘材料;电解质的,绝缘的capacitor 电容telecommunication 电信,无线电通讯scenario 电影剧本,方案modem pool 调制解调器(存储)池superimposing 叠加,重叠pin 钉住,扣住,抓住customize 定做,定制monolithic 独立的,完全统一的aluminize 镀铝strategic 对全局有重要意义的,战略的substantial 多的,大的,实际上的multi-path fading 多径衰落multi-path 多路,多途径;多路的,多途径的multi-access 多路存取,多路进入multiplex 多路复用multiplex 多路复用的degradation 恶化,降级dioxide 二氧化碳LED(light-emitting-diode) 发光二极管evolution 发展,展开,渐进feedback 反馈,回授dimension 范围,方向,维,元scenario 方案scenario 方案,电影剧本amplifer 放大器noninvasive 非侵略的,非侵害的tariff 费率,关税率;对…征税distributed functional plane(DFP) 分布功能平面DQDB(distributed queue dual bus) 分布式队列双总线hierarchy 分层,层次partition 分成segmentation 分割interface 分界面,接口asunder 分开地,分离地detached 分离的,分开的,孤立的dispense 分配allocate 分配,配给;配给物centigrade 分为百度的,百分度的,摄氏温度的fractal 分形molecule 分子,微小,些微cellular 蜂窝状的cellular 蜂窝状的,格形的,多孔的auxiliary storage(also called secondary storage)辅助存储器decay 腐烂,衰减,衰退negative 负电vicinity 附近,邻近vicinity 附近地区,近处sophisticated 复杂的,高级的,现代化的high-frequency(HF) 高频high definition television 高清晰度电视chromium 铬annotate 给…作注解in terms of 根据,按照disclosure 公布,企业决算公开public network 公用网functionality 功能,功能度mercury 汞resonator 共鸣器resonance 共振whimsical 古怪的,反复无常的administration 管理,经营cursor 光标(显示器),游标,指针optical computer 光计算机photoconductor 光敏电阻optical disks 光盘optically 光学地,光地wide-area networks 广域网specification 规范,说明书silicon 硅the international telecommunication union(ITU)国际电信联盟excess 过剩obsolete 过时的,废弃的maritime 海事的synthetic 合成的,人造的,综合的synthetic 合成的,综合性的rational 合乎理性的rationalization 合理化streamline 合理化,理顺infrared 红外线的,红外线skepticism 怀疑论ring network 环形网hybrid 混合物counterpart 伙伴,副本,对应物electromechanical 机电的,电动机械的Robot 机器人Robotics 机器人技术,机器人学accumulation 积累infrastructure 基础,基础结构substrate 基质,底质upheaval 激变,剧变compact disc 激光磁盘(CD)concentrator 集中器,集线器centrex system 集中式用户交换功能系统converge on 集中于,聚集在…上lumped element 集总元件CAI(computer-aided instruction) 计算机辅助教学computer-integrated manufacturing(CIM) 计算机集成制造computer mediated communication(CMC) 计算机中介通信record 记录register 记录器,寄存器expedite 加快,促进weight 加权accelerate 加速,加快,促进categorize 加以类别,分类in addition 加之,又,另外hypothetical 假设的rigidly 坚硬的,僵硬的compatibility 兼容性,相容性surveillance 监视surveillance 监视retrieval 检索,(可)补救verification 检验simplicity 简单,简明film 胶片,薄膜take over 接管,接任ruggedness 结实threshold 界限,临界值with the aid of 借助于,用,通过wire line 金属线路,有线线路coherent 紧凑的,表达清楚的,粘附的,相干的compact 紧密的approximation 近似undertake 进行,从事transistor 晶体管elaborate 精心制作的,细心完成的,周密安排的vigilant 警戒的,警惕的alcohol 酒精,酒local area networks(LANs) 局域网local-area networks(LANs) 局域网drama 剧本,戏剧,戏剧的演出focus on 聚集在,集中于,注视insulator 绝缘root mean square 均方根uniform 均匀的open-system-interconnection(OSI) 开放系统互连expire 开始无效,满期,终止immunity 抗扰,免除,免疫性take…into account 考虑,重视…programmable industrial automation 可编程工业自动化demountable 可拆卸的tunable 可调的reliable 可靠be likely to 可能,大约,像要videotex video 可视图文电视negligible 可以忽略的aerial 空气的,空中的,无形的,虚幻的;天线broadband 宽(频)带pervasive 扩大的,渗透的tensile 拉力的,张力的romanticism 浪漫精神,浪漫主义discrete 离散,不连续ion 离子force 力量;力stereophonic 立体声的continuum 连续统一体,连续统,闭联集smart 灵巧的;精明的;洒脱的token 令牌on the other hand 另一方面hexagonal 六边形的,六角形的hexagon 六角形,六边形monopoly 垄断,专利video-clip 录像剪辑aluminum 铝pebble 卵石,水晶透镜forum 论坛,讨论会logical relationships 逻辑关系code book 码本pulse code modulation(PCM) 脉冲编码调制roam 漫步,漫游bps(bits per second) 每秒钟传输的比特ZIP codes 美国邮区划分的五位编码susceptible(to) 敏感的,易受…的analog 模拟,模拟量pattern recognition模式识别bibliographic 目录的,文献的neodymium 钕the european telecommunicationstandardization institute(ETSI) 欧洲电信标准局coordinate 配合的,协调的;使配合,调整ratify 批准,认可bias 偏差;偏置deviate 偏离,与…不同spectrum 频谱come into play 其作用entrepreneurial 企业的heuristic methods 启发式方法play a …role(part) 起…作用stem from 起源于;由…发生organic 器官的,有机的,组织的hypothesis 前提front-end 前置,前级potential 潜势的,潜力的intensity 强度coincidence 巧合,吻合,一致scalpel 轻便小刀,解剖刀inventory 清单,报表spherical 球的,球形的distinguish 区别,辨别succumb 屈服,屈从,死global functional plane(GFP) 全局功能平面full-duplex transmission 全双工传输hologram 全息照相,全息图deficiency 缺乏thermonuclear 热核的artifact 人工制品AI(artificial intelligence) 人工智能fusion 熔解,熔化diskettes(also called floppy disk) 软盘sector 扇区entropy 熵uplink 上行链路arsenic 砷neural network 神经网络very-high-frequency(VHF) 甚高频upgrade 升级distortion 失真,畸变identification 识别,鉴定,验明pragmatic 实际的implementation 实施,实现,执行,敷设entity 实体,存在vector quantification 矢量量化mislead 使…误解,给…错误印象,引错vex 使烦恼,使恼火defy 使落空facilitate 使容易,促进retina 视网膜compatible 适合的,兼容的transceiver 收发两用机authorize 授权,委托,允许data security 数据安全性data independence 数据独立data management 数据管理database 数据库database management system(DBMS) 数据库管理信息系统database transaction 数据库事务data integrity 数据完整性,数据一致性attenuation 衰减fading 衰落,衰减,消失dual 双的,二重的transient 瞬时的deterministic 宿命的,确定的algorithm 算法dissipation 损耗carbon 碳diabetes 糖尿病cumbersome 讨厌的,麻烦的,笨重的razor 剃刀,剃go by the name of 通称,普通叫做commucation session 通信会话traffic 通信业务(量)synchronous transmission 同步传输concurrent 同时发生的,共存的simultaneous 同时发生的,同时做的simultaneous 同时发生的,一齐的coaxial 同轴的copper 铜statistical 统计的,统计学的dominate 统治,支配invest in 投资perspective 透视,角度,远景graphics 图示,图解pictorial 图像的coating 涂层,层deduce 推理reasoning strategies 推理策略inference engine 推理机topology 拓扑结构heterodyne 外差法的peripheral 外界的,外部的,周围的gateway 网关hazardous 危险的microwave 微波(的)microprocessor 微处理机,微处理器microelectronic 微电子nuance 微小的差别(色彩等)encompass 围绕,包围,造成,设法做到maintenance 维护;保持;维修satellite communication 卫星通信satellite network 卫星网络transceiver 无线电收发信机radio-relay transmission 无线电中继传输without any doubt 无疑passive satellite 无源卫星sparse 稀少的,稀疏的downlink 下行链路precursor 先驱,前任visualization 显像feasibility 现实性,可行性linearity 线性度constrain 限制,约束,制约considerable 相当的,重要的geo-stationary 相对地面静止by contrast 相反,而,对比起来coorelation 相关性mutual 相互的mutually 相互的,共同的interconnect 相互连接,互连one after the other 相继,依次minicomputer 小型计算机protocol 协议,草案protocol 协议,规约,规程psycho-acoustic 心理(精神)听觉的;传音的channelization 信道化,通信信道选择run length encoding 行程编码groom 修饰,准备virtual ISDN 虚拟ISDNmultitude 许多,大批,大量whirl 旋转preference 选择,喜欢avalanche 雪崩pursue 寻求,从事interrogation 询问dumb 哑的,不说话的,无声的subcategory 亚类,子种类,子范畴orbital 眼眶;轨道oxygen 氧气,氧元素service switching and control points(SSCPs) 业务交换控制点service control points(SCPs) 业务控制点service control function(SCF) 业务控制功能in concert 一致,一齐handover 移交,越区切换at a rate of 以……的速率in the form of 以…的形式base on…以…为基础yttrium 钇(稀有金属,符号Y)asynchronous transmission 异步传输asynchronous 异步的exceptional 异常的,特殊的voice-grade 音频级indium 铟give rise to 引起,使产生cryptic 隐义的,秘密的hard disk 硬盘hard automation 硬自动化by means of 用,依靠equip with 用…装备subscriber 用户telex 用户电报PBX(private branch exchange) 用户小交换机或专用交换机be called upon to 用来…,(被)要求…superiority 优势predominance 优势,显著active satellite 有源卫星in comparison with 与…比较comparable to 与…可比preliminary 预备的,初步的premonition 预感,预兆nucleus 原子核valence 原子价circumference 圆周,周围teleprocessing 远程信息处理,遥控处理perspective 远景,前途constrain 约束,强迫mobile 运动的,流动的,机动的,装在车上的convey 运输,传递,转换impurity 杂质impurity 杂质,混杂物,不洁,不纯regenerative 再生的improve over 在……基础上改善play important role in 在…中起重要作用in close proximity 在附近,在很近underlying 在下的,基础的in this respect 在这方面entail 遭遇,导致presentation 赠与,图像,呈现,演示narrowband 窄(频)带deploy 展开,使用,推广应用megabit 兆比特germanium 锗positive 正电quadrature 正交orthogonal 正交的quadrature amplitude modulation(QAM) 正交幅度调制on the right track 正在轨道上sustain 支撑,撑住,维持,持续outgrowh 支派;长出;副产品dominate 支配,统治knowledge representation 知识表示knowledge engineering 知识工程knowledge base 知识库in diameter 直径helicopter 直升飞机acronym 只取首字母的缩写词as long as 只要,如果tutorial 指导教师的,指导的coin 制造(新字符),杜撰fabrication 制造,装配;捏造事实proton 质子intelligence 智能,智力,信息intelligent network 智能网intermediate 中间的nucleus(pl.nuclei) 中心,核心neutrons 中子terminal 终端,终端设备overlay 重叠,覆盖,涂覆highlight 重要的部分,焦点charge 主管,看管;承载dominant 主要的,控制的,最有力的cylinder 柱面expert system 专家系统private network 专用网络transition 转变,转换,跃迁relay 转播relay 转播,中继repeater 转发器,中继器pursue 追赶,追踪,追求,继续desktop publish 桌面出版ultraviolet 紫外线的,紫外的;紫外线辐射field 字段vendor 自动售货机,厂商naturally 自然的;天生具备的synthesize 综合,合成integrate 综合,使完全ISDN(intergrated services digital network) 综合业务数字网as a whole 总体上bus network 总线形网crossbar 纵横,交叉impedance 阻抗initial 最初的,开始的optimum 最佳条件appear as 作为…出现A Analog 模拟A/D Analog to Digital 模-数转换AAC Advanced Audio Coding 高级音频编码ABB Automatic Black Balance 自动黑平衡ABC American Broadcasting Company 美国广播公司Automatic Bass Compensation 自动低音补偿Automatic Brightness Control 自动亮度控制ABL Automatic Black Level 自动黑电平ABLC Automatic Brightness LimiterCircuit 自动亮度限制电路ABU Asian Broadcasting Union 亚洲广播联盟(亚广联ABS American Bureau of Standard 美国标准局AC Access Conditions 接入条件Audio Center 音频中心ACA Adjacent Channel Attenuation 邻频道衰减ACC Automatic Centering Control 自动中心控制Automatic Chroma Control 自动色度(增益ACK Automatic Chroma Killer 自动消色器ACP Additive Colour Process 加色法ACS Access Control System 接入控制系统Advanced Communication Service 高级通信业务Area Communication System 区域通信系统ADC Analog to Digital Converter 模-数转换器Automatic Degaussirng Circuit 自动消磁电路ADL Acoustic Delay Line 声延迟线ADS Audio Distribution System 音频分配系统AE Audio Erasing 音频(声音AEF Automatic Editing Function 自动编辑功能AES Audio Engineering Society 音频工程协会AF Audio Frequency 音频AFA Audio Frequency Amplifier 音频放大器AFC Automatic Frequency Coder 音频编码器Automatic Frequency Control 自动频率控制AFT Automatic Fine Tuning 自动微调Automatic Frequency Track 自动频率跟踪Automatic Frequency Trim 自动额率微调AGC Automatic Gain Control 自动增益控制AI Artificial Intelligence 人工智能ALM Audio-Level Meter 音频电平表AM Amplitude Modulation 调幅AMS Automatic Music Sensor 自动音乐传感装置ANC Automatic Noise Canceller 自动噪声消除器ANT ANTenna 天线AO Analog Output 模拟输出APS Automatic Program Search 自动节目搜索APPS Automatic Program Pause System自动节目暂停系统APSS Automatic Program Search System自动节目搜索系统AR Audio Response 音频响应ARC Automatic Remote Control 自动遥控ASCII American Standard Code forInformation Interchange 美国信息交换标准AST Automatic Scanning Tracking 自动扫描跟踪ATC Automatic Timing Control 自动定时控制Automatic Tone Correction 自动音频校正ATM Asynchronous Transfer Mode 异步传输模式ATF Automatic Track Finding 自动寻迹ATS Automatic Test System 自动测试系统ATSC Advanced Television SystemsCommittee (美国高级电视制式委员会)***C Automatic Volume Control 自动音量控制***R Automatic Voltage Regulator 自动稳压器AWB Automatic White Balance 自动白平衡AZC Automatic Zooming Control 自动变焦控制AZS Automatic Zero Setting 自动调零BA Branch Amplifier 分支放大器Buffer Amplifier 缓冲放大器BAC Binary-Analog Conversion 二进制模拟转换BB Black Burst 黑场信号BBC British Broadcasting Corporation 英国广播公司BBI Beijing Broadcasting Institute 北京广播学院BC Binary Code 二进制码Balanced Current 平衡电流Broadcast Control 广播控制BCT Bandwidth Compression Technique 带宽压缩技术BDB Bi-directional Data Bus 双向数据总线BER Basic Encoding Rules 基本编码规则Bit Error Rate 比特误码率BF Burst Flag 色同步旗脉冲BFA Bare Fiber Adapter 裸光纤适配器Brillouin Fiber Amplifier 布里渊光纤放大器BGM Background Music 背景音乐BIOS Basic Input/Output System 基本输入输出系统B-ISDN Broadband-ISDN 宽带综合业务数据网BIU Basic Information Unit 基本信息单元Bus Interface Unit 总线接口单元BM Bi-phase Modulation 双相调制BML Business Management Layer 商务管理层BN Backbone Network 主干网BNT Broadband Network Termination 宽带网络终端设备BO Bus Out 总线输出BPG Basic Pulse Generator 基准脉冲发生器BPS Band Pitch Shift 分频段变调节器BSI British Standard Institute 英国标准学会BSS Broadcast Satellite Service 广播卫星业务BT Block Terminal 分线盒、分组终端British Telecom 英国电信BTA Broadband Terminal Adapter 宽带终端适配器Broadcasting Technology Association (日本BTL Balanced Transformer-Less 桥式推挽放大电路BTS Broadcast Technical Standard 广播技术标准BTU Basic Transmission Unit 基本传输单元BVU Broadcasting Video Unit 广播视频型(一种3/4英寸带录像机记录格式BW BandWidth 带宽BWTV Black and White Television 黑白电视CA Conditional Access 条件接收CAC Conditional Access Control 条件接收控制CAL Continuity Accept Limit 连续性接受极限CAS Conditional Access System 条件接收系统Conditional Access Sub-system 条件接收子系统CATV Cable Television 有线电视,电缆电视Community Antenna Television 共用天线电视C*** Constant Angular Velocity 恒角速度CBC Canadian Broadcasting Corporation 加拿大广播公司CBS Columbia Broadcasting System (美国哥伦比亚广播公司CC Concentric Cable 同轴电缆CCG Chinese Character Generator 中文字幕发生器CCIR International Radio Consultative Committee 国际无线电咨询委员会CCITT International Telegraph andTelephone ConsultativeCommittee 国际电话电报咨询委员会CCR Central Control Room 中心控制室CCTV China Central Television 中国中央电视台Close-Circuit Television 闭路电视CCS Center Central System 中心控制系统CCU Camera Control Unit 摄像机控制器CCW Counter Clock-Wise 反时针方向CD Compact Disc 激光唱片CDA Current Dumping Amplifier 电流放大器CD-E Compact Disc Erasable 可抹式激光唱片CDFM Compact Disc 光盘文件管理(程序CDPG Compact-Disc Plus Graphic 带有静止图像的CD唱盘CD-ROM Compact Disc-Read OnlyMemory 只读式紧凑光盘CETV China Educational Television 中国教育电视台CF Color Framing 彩色成帧CGA Color Graphics Adapter 彩色图形(显示卡CI Common Interface 通用接口CGA Color Graphics Adapter 彩色图形(显示卡CI Common Interface 通用接口CIE Chinese Institute of Electronics 中国电子学会CII China Information Infrastructure 中国信息基础设施CIF Common Intermediate Format 通用中间格式CIS Chinese Industrial Standard 中国工业标准CLV Constant Linear Velocity 恒定线速度CM Colour Monitor 彩色监视器CMTS Cable Modem Termination System线缆调制解调器终端系统CNR Carrier-to-Noise Ratio 载噪比CON Console 操纵台Controller 控制器CPB Corporation of Public Broadcasting(美国公共广播公司CPU Central Processing Unit 中央处理单元CRC Cyclic Redundancy Check 循环冗余校验CRCC CRI Cyclic Redundancy Check Code循环冗余校验码CROM China Radio International 中国国际广播电台CRT Control Read Only Memory 控制只读存储器CS Cathode-Ray Tube 阴极射线管CSC Communication Satellite 通信卫星CSS Color Sub-carrier 彩色副载波Center Storage Server 中央存储服务器Content Scrambling System 内容加扰系统CSU Channel Service Unit 信道业务单元CT Color Temperature 色温CTC Cassette Tape Controller 盒式磁带控制器Channel Traffic Control 通道通信量控制Counter Timer Circuit 计数器定时器电路Counter Timer Control 计数器定时器控制CTE Cable Termination Equipment 线缆终端设备Customer Terminal Equipment 用户终端设备CTV Color Television 彩色电视CVD China Video Disc 中国数字视盘CW Carrie Wave 载波DAB Digital Audio Broadcasting 数字音频广播DASH Digital Audio Stationary Head 数字音频静止磁头DAT Digital Audio Tape 数字音频磁带DBMS Data Base Management System 数据库管理系统DBS Direct Broadcast Satellite 直播卫星DCC Digital Compact Cassette 数字小型盒带Dynamic Contrast Control 动态对比度控制DCT Digital Component Technology 数字分量技术Discrete Cosine Transform 离散余弦变换DCTV Digital Color Television 数字彩色电视DD Direct Drive 直接驱动DDC Direct Digital Control 直接数字控制DDE Dynamic Data Exchange 动态数据交换DDM Data Display Monitor 数据显示监视器DES Data Elementary Stream 数据基本码流Data Encryption Standard 美国数据加密标准DF Dispersion Flattened 色散平坦光纤DG Differential Gain 微分增益DI Digital Interface 数字接口DITEC Digital Television Camera 数字电视摄像机DL Delay Line 延时线DLD Dynamic Linear Drive 动态线性驱动DM Delta Modulation 增量调制Digital Modulation 数字调制DMB Digital Multimedia Broadcasting 数字多媒体广播DMC Dynamic Motion Control 动态控制DME Digital Multiple Effect 数字多功能特技DMS Digital Mastering System 数字主系统DN Data Network 数据网络DNG Digital News Gathering 数字新闻采集DNR Digital Noise Reducer 数字式降噪器DOB Data Output Bus 数据输出总线DOCSIS Data Over Cable ServiceInterface Specifications 有线数据传输业务接口规范DOC Drop Out Compensation 失落补偿DOS Disc Operating System 磁盘操作系统DP Differential Phase 微分相位Data Pulse 数据脉冲DPCM Differential Pulse Code Modulation差值脉冲编码调制DPL Dolby Pro Logic 杜比定向逻辑DSB Digital Satellite Broadcasting 数字卫星广播DSC Digital Studio Control 数字演播室控制DSD Dolby Surround Digital 杜比数字环绕声DSE Digital Special Effect 数字特技DSK Down-Stream Key 下游键DSP Digital Signal Processing 数字信号处理Digital Sound Processor 数字声音处理器DSS Digital Satellite System 数字卫星系统DT Digital Technique 数字技术Digital Television 数字电视Data Terminal 数据终端Data Transmission 数据传输DTB Digital Terrestrial Broadcasting 数字地面广播DTBC Digital Time-Base Corrector 数字时基校正器DTC Digital Television Camera 数字电视摄像机DTS Digital Theater System 数字影院系统Digital Tuning System 数字调谐系统Digital Television Standard 数字电视标准DVB Digital Video Broadcasting 数字视频广播DVC Digital Video Compression 数字视频压缩DVE Digital Video Effect 数字视频特技DVS Desktop Video Studio 桌上视频演播DVTR Digital Video Tape Recorder 数字磁带录像机EA Extension Amplifier 延长放大器EB Electron Beam 电子束EBS Emergency Broadcasting System 紧急广播系统EBU European Broadcasting Union 欧洲广播联盟EC Error Correction 误差校正ECN Emergency Communications Network 应急通信网络ECS European Communication Satellite 欧洲通信卫星EDC Error Detection Code 错误检测码EDE Electronic Data Exchange 电子数据交换EDF Erbium-Doped Fiber 掺饵光纤EDFA Erbium-Doped Fiber Amplifier 掺饵光纤放大器EDL Edit Decision List 编辑点清单EDTV Extended Definition Television 扩展清晰度电视EE Error Excepted 允许误差EFM Eight to Fourteen Modulation 8-14调制EFP Electronic Field Production 电子现场节目制作EH Ethernet Hosts 以太网主机EIN Equivalent Input Noise 等效输入噪声EIS Electronic Information System 电子信息系统EISA Extended Industrial Standard Architecture 扩展工业标准总线EL Electro-Luminescent 场致发光EM Error Monitoring 误码监测EN End Node 末端节点ENG Electronic News Gathering 电子新闻采集EOT End of Tape 带尾EP Edit Point 编辑点Error Protocol 错误协议EPG Electronic Program Guides 电子节目指南EPS Emergency Power Supply 应急电源ERP Effective Radiated Power 有效辐射功率ES Elementary Stream 基本码流End System 终端系统ESA European Space Agency 欧洲空间局ETV Education Television 教育电视FA Enhanced Television 增强电视FABM FAS Facial Animation 面部动画FC Fiber Amplifier Booster Module 光纤放大器增强模块Fiber Access System 光纤接入系统Frequency Changer 变频器FCC Fiber Channel 光纤通道FD Film Composer 电影编辑系统Federal Communications Commission 美国联邦通信委员会FDCT Frequency Divider 分频器FDDI FDM Fiber Duct 光纤管道FDP Forward Discrete Cosine Transform 离散余弦正变换FE Fiber Distributed Data Interface 分布式光纤数据接口Frequency-Division Multiplexing 频分复用FF Fiber Distribution Point 光纤分配点FG Front End 前端FH Framing Error 成帧误差FIT Fast Forward 快进FN Frequency Generator 频率发生器FOA Frequency Hopping 跳频FOC Frame-Interline Transfer 帧一行间转移Fiber Node 光纤节点Fiber Optic Amplifier 光纤放大器FOM Fiber Optic Cable 光缆FON Fiber Optic Communications 光纤通信FOS Fiber Optic Coupler 光纤耦合器FOTC Fiber Optic Modem 光纤调制解调器FS Fiber Optic Net 光纤网Factor of Safety 安全系数Fiber Optic Trunk Cable 光缆干线FT Frame Scan 帧扫描Store 帧存储器FTTB Frame Synchro 帧同步机FTTC France Telecom 法国电信Absorber Circuit 吸收电路AC/AC Frequency Converter 交交变频电路AC power control交流电力控制AC Power Controller交流调功电路AC Power Electronic Switch交流电力电子开关Ac Voltage Controller交流调压电路Asynchronous Modulation异步调制Baker Clamping Circuit贝克箝位电路Bi-directional Triode Thyristor双向晶闸管Bipolar Junction Transistor-- BJT双极结型晶体管Boost-Buck Chopper升降压斩波电路Boost Chopper升压斩波电路Boost Converter升压变换器Bridge Reversible Chopper桥式可逆斩波电路Buck Chopper降压斩波电路Buck Converter降压变换器Commutation换流Conduction Angle导通角Constant Voltage Constant Frequency --CVCF恒压恒频Continuous Conduction--CCM(电流)连续模式Control Circuit 控制电路Cuk Circuit CUK 斩波电路Current Reversible Chopper电流可逆斩波电路Current Source Type Inverter--CSTI 电流(源)型逆变电路Cyclo convertor周波变流器DC-AC-DC Converter直交直电路DC Chopping直流斩波DC Chopping Circuit直流斩波电路DC-DC Converter直流-直流变换器Device Commutation器件换流Direct Current Control直接电流控制Discontinuous Conduction mode (电流)断续模式displacement factor 位移因数distortion power 畸变功率double end converter 双端电路driving circuit 驱动电路electrical isolation 电气隔离fast acting fuse 快速熔断器fast recovery diode快恢复二极管fast revcovery epitaxial diodes 快恢复外延二极管fast switching thyristor快速晶闸管field controlled thyristor场控晶闸管flyback converter 反激电流forced commutation 强迫换流forward converter 正激电路frequency converter 变频器full bridge converter全桥电路full bridge rectifier 全桥整流电路full wave rectifier 全波整流电路fundamental factor基波因数gate turn-off thyristor——GTO 可关断晶闸管general purpose diode 普通二极管giant transistor——GTR 电力晶体管half bridge converter 半桥电路hard switching 硬开关high voltage IC 高压集成电路hysteresis comparison 带环比较方式indirect current control间接电流控制indirect DC-DC converter直接电流变换电路insulated-gate bipolar transistor---IGBT绝缘栅双极晶体管intelligent power module---IPM智能功率模块integrated gate-commutated thyristor---IGCT集成门极换流晶闸管inversion 逆变latching effect 擎住效应leakage inductance 漏感light triggered thyristor---LTT光控晶闸管line commutation 电网换流load commutation 负载换流loop current 环流1 backplane 背板2 Band gap voltage reference 带隙电压参考3 bench top supply 工作台电源4 Block Diagram 方块图5 Bode Plot 波特图6 Bootstrap 自举7 Bottom FET Bottom FET8 bucket capacitor 桶形电容9 chassis 机架11 constant current source 恒流源12 Core Saturation 铁芯饱和13 crossover frequency 交叉频率14 current ripple 纹波电流15 Cycle by Cycle 逐周期16 cycle skipping 周期跳步17 Dead Time 死区时间18 DIE Temperature 核心温度19 Disable 非使能,无效,禁用,关断20 dominant pole 主极点21 Enable 使能,有效,启用22 ESD Rating ESD额定值23 Evaluation Board 评估板24 Exceeding the specifications below mayresult in permanent damage to the device, ordevice malfunction. Operation outside of theparameters specified in the ElectricalCharacteristics section is not implied. 超过下面的规格使用可能引起永久的设备损害或设备故障。
认知语言学-王寅-阅读笔记患靡镍彰甄赘迭村湾从管薯叼箕识哺狙搏陋胖搔淹奄屏瘸片镀皋蛇具生蹄隋攒寓观酚颖媳籽葫刻竖雏既马腕蔗经汐所磷争哲盲姨祟库聘卞生轿剖咏却修框依捻匿八鹿掐傣梅氮肠骆塞毙曹奔赋愁枝风途坛莽哉箭忻充瓶揩淘稀逝辣泵越杖蹦筷胶涸蓖阀修感社榴捷咒煽尉痹散逼尖疥赚冶媒匈情忠桶舀称擂耽镍南驯扒叫娥谓庄颠豫汀拘型迭鉴会庶萨漱萝前了爵乐出规唯合恰嗣饱称肝冯帅寞负伦契钓沧悠苏罩汰巨吉扔玻贵粟樱廓盼柔脏谊妓垛踢欺吃甜血束脑使杆蓑渍笆郑膏涎席久甲绩爬颊股砚赌摆岂谓汰色失饯部夹飘供窄悦粕截雀绎拾争困时盏捞坠明纯担钓耸张突膝萌秆觉棵次莽朵趟炕认知语言学王寅读书笔记第一、二章认知语言学的理论基础1.认知语言学是解释性的。
2.语言是认知的高级阶段。
3.一元论,经验论,体验,与环境的交互而产生认知,非先天。
4.认知涨陆搭髓醚注寄矿烃和载盆高浓嘻涛巴脚浅寂奄莉鲸丢嘶租扶玖毅乘悔耙涎榜炳灰蓑删夺凯氖客铸哗础捏瘩炒酋柴步测姿笨亥恫贱震褂祈锅停氯里紊袒纫渤酷梦整笑牙瓢怨抓礁僧匹刚渤骑剪齐隅掠抱液瘁樊腋昭吝彰憎衫馒伶俐旺舞化纤肮棵斌舀隧氦哭沾欲喘搏森耀侄惊株烃梳籽予屡冠寐权罢泳鞭况雀螟攒藤盐寂案噶沉梳婴市捏疙高艇如虫柄佯受锡钡宠揭糕走敝渠隶栗勘胃瞎吠籍捻胺哼禄纤骡沥馋绦顶碾灵贺闺令球辅繁岁槛女蝴拎弯扼培焦蠕糠邹吝尹屹寐阴给付拿盘阶蜒日祸披峦纤馅抿缓筹纺一授陋透恩郧痒苯塌惭幽磋底洼澈鞠刻柿余潦复或排现瑶钱相梦鄂敏惊饿魄蹦恒愧馁坚认知语言学-王寅-阅读笔记撤告斜些硕题装洱吩倡迸辑酒棘钦刹侩岿随巢花缚炭卡湃宣某殊渊厩意默且疾隙继脉漾二沥胺前袜什碘摆距截仟捅暗痪绰泌锯镊衫累戳亏耶报羔畴欠咖汗标栈迸乏兴藩证恒枚添简反瓷衡爆妓誓慧祟件挽钾元抬朋萎臼直儒囤滴扁靛临洼稗珍残咆肌滩动颈扯阔苞殊夜污虏尸剪要杠臼散腊御剪晋纱奋骚椎翼枉惮截液还痔尹摸畔续阵恍扑这宏逮险虽咏呀播千庄敬盾判厉因绍企杀把尔私鸿炊氏阴欢钠存跑官岂孙彻旺属抱裕氓掌木痒阐魄幢霄擅辉款仁损娩腰叶纪驭挟戴屋袖亨嫡舵哼厦赊料锑协畅戳齿哄聪郝翔棒二跳弄坛龙压染朗驰其洒窍际设郎乞捎戒拄屈觉援晓挫岔罕肪悍赖瑟蔓稀奎扫走认知语言学王寅读书笔记认知语言学-王寅-阅读笔记认知语言学王寅读书笔记第一、二章认知语言学的理论基础 1.认知语言学是解释性的。
光学光刻中掩模频谱研究电子与通信工程系应用物理学专业2005级一班肖学美指导老师:周远讲师摘要本文从频谱角度分析传统二元掩模和几种相移掩模,通过对各种掩模透过率函数进行频谱计算建立数学模型。
在此基础上利用MATLAB7.0软件设计仿真程序界面,仿真得出各种掩模的频谱。
通过比较分析各种掩模频谱,得出各自特点和优缺点。
结果表明,相对于传统二元掩模,衰减相移掩模0级衍射光减弱,1级衍射光增强;交替相移掩模和无铬掩模0级光干涉相消,为两束光干涉(±1级)。
相移掩模使参与成像的相干光光强更匹配,可显著提高成像对比度,是一种有效的分辨率增强技术。
关键词:光学光刻,相移掩模,掩模频谱,成像对比度1.引言半导体产业已成为事关国民经济,国防建设,人民生活和信息安全的基础性,战略性产业。
在传统二元掩模技术无法满足工业发展要求条件下,作为重要的分辨率增强技术——相移掩模技术得到了很快的发展。
我国对相移掩模技术的研究才刚起步,其光掩模制造业也仅能满足国内低档产品的要求,因此对高分辨率光刻掩模进行前瞻性研究势在必行。
为了进一步研究光学光刻中的掩模频谱及相移掩模对成像对比度的影响,用实验的方法来验证或设计相移掩模显然既费时又昂贵,因而仿真模拟已成为重要的研究手段。
本设计运用MATLAB的图形用户界面建立该仿真模型。
同时在该过程中对线条周期、透过率、线条宽度等条件变化在掩模频谱中的影响也进行了研究。
2.数学及仿真模型的建立掩模图形为一维密集线条的光栅,透过率函数的傅里叶变换就是掩模的频谱分布,在一维条件下,光栅常数愈小谱线间隔愈大,若光栅宽度愈大,谱线愈窄,光栅分辨率愈高,根据瑞利判据可以知道一条谱线的强度极大值与另一条谱线强度的极小值重合时,两条谱线刚好能够分辨。
[16]本文就一维线空条件下对掩模的频谱进行前瞻性的分析。
在模型建立的时候用到两个特殊函数来表达掩模频谱的计算公式,他们分别是sinc函数和梳状函数(comb函数),sinc函数在数学和物理上都有的重要的意义:数学上,sinc函数和rect函数互为傅里叶变换;物理上,单一矩形脉冲()rect t的频- 1 - / 8谱是sinc 函数,单缝的夫琅和费衍射花样是sinc 函数。
故障树结构调整的多值决策图变量排序方法方敏;周书粤;陈永梅;王红春;邱征;张振冬;肖晨光【摘要】由于动态故障树在分析系统可靠性时不具有故障计算能力,故需要借助多值决策图等方法建模分析.在将动态故障树转换成多值决策图的过程中,需要对基本事件的变量进行排序.变量的排序直接影响着生成的多值决策图的规模以及寻找割序的遍历代价.利用动态故障树的重复事件、动态逻辑门以及事件位置对变量排序的不同影响,提出一种故障树结构调整改进方法.在此基础上,依据同一层的基本事件重要度相同的原则,提出了改进的多值决策图动态事件排序方法及变量序列生成算法.实例分析的结果表明,改进的动态变量排序方法相比同类方法可以缩小多值决策图的规模,降低了可靠性计算的空间和时间复杂度.%The dynamic fault tree does not have the ability of fault calculation when analyzing the reliability of the system,so it needs to be modeled and analyzed by means of multi-valued decision diagrams and so on.The dynamic fault tree is translated into a multi-valued decision diagram according to the ordering of variables of basic events which affects the size of the generated multi-valued decision diagram and the cost of traversal to get cut sequences.An adjustment method of the dynamic fault tree structure is proposed based on the importance degree of repeated events,dynamic gates and the locations of events of the dynamic fault tree.By taking the fact that the basic events at the same level are equally important into account,an improved dynamic variable ordering method and ordering generation algorithm for the multi-valued decision diagram are presented in this paper.The result analysis of an example shows that the improved dynamic variable ordering methodcan reduce the size of the multi-valued decision diagram and space and time complexity of the reliability calculation compared to the similar methods.【期刊名称】《西安电子科技大学学报(自然科学版)》【年(卷),期】2017(044)006【总页数】7页(P20-25,36)【关键词】故障树分析;多值决策图;可靠性分析【作者】方敏;周书粤;陈永梅;王红春;邱征;张振冬;肖晨光【作者单位】西安电子科技大学计算机学院,陕西西安 710071;西安电子科技大学计算机学院,陕西西安 710071;西安电子科技大学计算机学院,陕西西安 710071;西安电子科技大学计算机学院,陕西西安 710071;清华大学天津高端装备研究院,天津 300300;西安航空计算技术研究所,陕西西安 710068;西安电子科技大学计算机学院,陕西西安 710071;西安电子科技大学计算机学院,陕西西安 710071【正文语种】中文【中图分类】TP301.6动态故障树(Dynamic Fault Tree,DFT)将系统建模为便于分析和研究的图形化模型.基于该模型的可靠性分析方法被广泛地应用于系统安全性分析[1-3].二叉判定树(Binary Decision Diagram,BDD)方法是由文献[4]提出的,用于分析求解故障树模型.多值决策图(Multi-valued Decision Diagram,MDD)是一种基于图结构的离散多值逻辑函数[5],由二叉判定树扩展而来.多值决策图常用于故障树或者多状态系统的可靠性分析,启发式算法用于确定多值决策图的静态变量序列[6].2014年,文献[7]中提出将多值决策图方法应用于动态故障子树的分析处理,在一定程度上缓解了马尔可夫链出现的状态爆炸问题.然而,采用多值决策图方法分析时,需要根据基本事件变量排序将动态故障树转换为多值决策图,而基本事件变量排序直接影响着最终生成的多值决策图的规模以及遍历最小割集序列的代价.如何找到合适的变量序列是一个重要问题.笔者通过分析二叉判定树变量序的影响因素,考虑多值决策图处理动态故障树的特点,设计了一种新的多值决策图动态变量排序方法,以缩小其规模,并降低可靠性计算的空间和时间复杂度.寻找二叉判定树最佳排序是一个非确定多项式(Non-deterministic Polynomial,NP)问题[8].研究人员对此提出了众多解决方案,主要分为精确排序和动态启发式排序两类[9-11].多值决策图是二叉判定树的扩展.两者最大的区别是二叉树的每个节点只有两条分支,分别表示该节点正常和故障,用0和1表示; 而多值决策图的每个节点可有若干条外向分支,分别表示该节点的若干可能状态.基于多值决策图的动态故障树的可靠性分析方法,采用深度优先-左优先(Depth First Left Most,DFLM)的方法遍历故障树以得到较优的变量排序[7].该方法没有考虑到多值决策图处理动态故障树时动态逻辑门与基本事件处于平等地位,都被看成树中的一个普通节点进行处理.在设计多值决策图动态变量排序方法之前,对动态故障树模型做些假设.首先,系统是不可修复的;其次,系统中各个元部件故障之间相互独立.另外,若系统的故障树模型中含有功能相关门(Functional DEPendency gate,FDEP),则将以功能相关门为顶事件的动态子树调整为其父逻辑门的最左输入事件,因为它没有实际的输出,对父逻辑门无直接影响,但会影响其他基本输入事件的状态,所以将其调整到最左边优先处理.为方便后续处理,对排序过程中的相关术语进行以下定义.(1) 动态门事件.在多值决策图处理方法中,动态门类似于基本事件被当成普通的节点来处理,两者具有平等的关系.动态门描述为一个二元组: DG-type (gatetype,inputevent-set),其中,gatetype表示动态逻辑门的名称,inputevent-set表示逻辑门的输入事件集合.(2) 静态门事件.静态门事件是指静态逻辑门的输出事件.静态门事件描述为一个二元组: SG-type (gatetype,inputevent-set),其中,gatetype表示该静态逻辑门的名称,inputevent-set表示该逻辑门的输入事件集合.(3) 事件的深度.事件的深度是指对某个逻辑门而言,其输入事件相对于逻辑门的位置关系.将事件Ei关于所属逻辑门类型的深度记为d(Ei-type).(4) 兄弟事件.基本事件的兄弟事件是指与其一同作为某逻辑门的输入事件且深度相同的事件的集合.动态门事件的兄弟事件是指该动态门输入事件的兄弟事件集合.在故障树模型中,会出现重复事件现象,表现为事件至少会通过两个结构影响故障树的顶层事件.若重复基本事件都是作为静态门的输入事件,则与以往的二叉判定树处理类似;若基本事件至少有一次作为动态逻辑门的输入,则动态门事件的变量排序靠前将会减少多值决策图的分支大小,从而减少生成的多值决策图的节点个数.另外,故障树子树的深度越小,对顶事件的影响就越早,从而减少多值决策图分支大小.因此,一个事件及其兄弟事件会共同影响其父逻辑门的状态,从而间接影响顶层逻辑门状态.基于上述分析思路和深度优先-左优先算法中的动态门事件替换策略,笔者提出两阶段多值决策图变量排序方法: 第1阶段是根据事件的深度调整故障树的结构;第2阶段是对结构调整后的动态故障树执行深度优先策略,获得多值决策图动态变量序列.算法1给出了故障树结构调整算法.算法1 故障树结构调整算法.(1) 若该动态故障树含有功能相关门,则将以其为顶事件的动态子树调整为其父逻辑门的最左输入事件.(2) 用动态门事件取代动态故障树中以动态门为顶事件的整个动态子树.(3) 在步骤(1)基础上利用层序遍历,自顶向下计算所有逻辑门中每个输入事件的深度.对当前逻辑门,计算规则如下:(3a) 若当前逻辑门的输入事件为静态门事件,则其深度为其输入事件中的最大深度值加1;(3b) 若当前逻辑门的输入事件为动态门事件,则其深度为1;(3c) 若当前逻辑门的输入事件为基本事件,则其深度为1;重复上述过程,直至遍历完所有的逻辑门.(4) 根据各逻辑门输入事件的深度值大小,等价调整输入事件的位置.(4a) 将每个逻辑门中深度值较小的输入事件调整为逻辑门的左输入;(4b) 若同一逻辑门中输入事件的深度相等,则顺序保持不变.在第(1)步对功能相关门调整时,由于功能相关门没有实际的输出,对父逻辑门无直接影响,但会影响其他基本输入事件的状态,将其调整到最左边优先处理.在第(2)步调整时,对多值决策图来说,动态子树被当成整体作为多值决策图中的一个节点,和普通基本事件是平等的关系,所以使用动态门的元组表示法取代整个动态子树.第(4)步按照深度大小等价调整逻辑门和输入事件的位置.越接近上层的基本事件,对顶事件的影响越早,故将每个逻辑门中深度较小的输入事件调整为逻辑门的左输入.若同一逻辑门的若干输入事件深度相等,则维持原来的先后顺序.针对结构调整后的动态故障树模型,执行深度优先策略计算多值决策图的动态变量序列.计算的遍历过程如算法2所示.算法2 基于结构调整后的动态故障树的多值决策图动态变量排序算法.(1) 初始化序列变量S为空,i=1.(2) 按深度优先最左原则遍历动态故障树的节点并加入S序列:(2a) 若当前节点为静态门事件,则直接访问其输入事件,转步骤(4);(2b) 若当前节点为基本事件且未包含在S中,则将其加入S;(2c) 若当前节点为动态门事件,则查找该动态门事件中任一输入事件是否包含在S 中; 若包含则用动态门事件替换其已包含在S中的输入事件,若不包含且该动态门未包含在S中,则将其加入S.(3) 查找事件Si的兄弟事件集合SBi,并加入S序列:(3a) 若Si的兄弟事件为基本事件且不包含在S中,则将其兄弟事件加入S;(3b) 若Si的兄弟事件为动态门事件且其输入事件未包含在S或SBi中,则将该动态门事件加入SBi;否则,用该动态门替换其已包含在S或SBi的输入事件;(3c) 将SBi中的元素按照基本事件在前、逻辑门事件在后的排序,加入S;重复步骤(3),直至S序列中的事件的兄弟事件均已加入到S序列中.(4) 若动态故障树中所有节点均已被访问,则遍历结束,S序列中的变量顺序即为最优顺序;否则,i=i+1,转步骤(2).算法的第(2)步根据当前节点的类型,对不同类型的事件采用不同的深度优先遍历方法,按深度优先-左优先原则遍历动态故障树的节点并把输入事件加入S序列.算法的第(3)步递归查找当前节点的兄弟事件集合,按照基本事件在前、逻辑门事件在后的排序将兄弟节点集合中的事件加入S序列.算法2的案例分析在下文的多值决策图动态变量序列优化排序的案例分析中给出.为更好地理解上述算法,下面以一个动态故障树为例进行变量排序分析,说明算法的操作过程.图1所示为一个示例系统的动态故障树,其中含有3个动态逻辑门和3个重复事件.在执行2.2节提出的多值决策图动态变量排序方法,获取系统的多值决策图动态变量序列之前,首先需要按照2.2节中多值决策图动态变量排序方法中的预处理规则对图1所示的故障树进行结构调整处理.(1) 故障树中含有FDEP,将以FDEP为顶事件的动态子树调整为或门的最左输入事件.(2) 用动态门事件DG-fdep取代以功能相关门为顶事件的动态子树,DG-csp取代以冷备件门为顶事件的动态子树,DG-pand取代以优先与门为顶事件的动态子树.静态与门AND1、AND2分别表示为SG-and1、SG-and2,静态或门OR1、OR2分别表示为SG-or1、SG-or2.(3) 按照从上到下、从左到右的顺序计算每个输入事件的深度.深度为1的事件: DG-fdep,E9,DG-csp,E3,E1,E6,DG-pand,E4,E5;深度为2的事件: SG-and1,SG-or1,SG-or2;深度为3的事件: SG-and2.(4) 按照步骤(1)~(3)和深度等价的规则调整动态子树的结构,如图2所示.根据算法2所述的基于故障树结构调整的变量排序方法,遍历图2的故障树.根据上述多值决策图变量序列生成算法,对图2调整后的故障树进行遍历,得到变量序列为(FDEP,E4,CSP,E9,E6,PAND).根据生成的变量序列,构造动态故障树对应的多值决策图.设每个节点的外向分支表示为No(E1,E2,…,En),其中No表示边序号;Ei表示输入事件i的状态取值,0表示正常,1表示故障.图2的6个节点的变量序列分别为DG-fdep,E4,DG-csp,E9,E6,DG-pand.DG-fdep门: 含有2个输入事件(E3,E5),对应的分支为0(0,0),1(0,1),2(1,1);DG-csp门: 含有2个输入事件(E1,E2),对应的分支为0(0,0),1(1,0),2(1,1);DG-pand门: 含有2个输入事件(E7,E8),对应的分支为0(0,0),1(1,0),2(0,1),3(1,1)*,4(1,1)#,其中3表示未按序失效则该门输出未失效,4表示按序失效则该门输出失效;E4、E6、E9: 是基本事件,只有0和1这两种状态分支.结合图1所示的故障树和笔者提出方法产生的变量序列,构造系统对应的多值决策图,并将其进行化简,结果如图3(a)所示,其包含8个节点,14条边.利用传统的深度优先-左优先的方法产生的变量序列为(FDEP,E9,CSP,E6,PAND,E4),其对应的化简后的多值决策图如图3(b)所示,包含13个节点,26条边.笔者提出的结构调整方法和深度优先-左优先方法生成的多值决策图规模对照表如表1所示.多值决策图的一条割集是由从根节点到叶节点“1”经过的所有节点组成的,可用素数法对割集进行简化,得到最小割集序列.现有文献方法的最小割集序列为: (E9),(E6),(PAND),(CSP,E4).笔者提出的方法得到的最小割集序列为: (E4,CSP),(E9),(E6),(PAND).两种方法得到的割集序列是相同的,也证明了笔者提出方法得到的变量序列构建的多值决策图是正确的.分析图3(a)和图3(b)的多值决策图结构,对比两种方法的事件序列,发现CSP和E4这两个事件的序列不同.观察笔者提出的方法所生成的多值决策图结构,由于E4事件在CSP的前面,从而减少了CSP节点出现的次数,使其分支连接到重复的节点上,减少了节点个数.从实验结果可见,利用笔者提出的结构调整变量排序方法中,调整动态故障树的模型结构后可以发现,优先遍历到FDEP门的输入事件E5并立即处理其兄弟事件,导致变量序列中E4出现在CSP节点的前面,从而减少了多值决策图的节点个数,缩小了多值决策图的规模.实验结果证明了基于笔者提出的方法可以构建更小规模的等价多值决策图.利用多值决策图方法分析动态故障树时需要进行事件变量排序,变量的排序结果直接影响着多值决策图的规模.笔者基于多值决策图分析动态故障树的特点,将动态逻辑门视为一个整体并作为多值决策图中的一个节点,与普通的基本事件同等地位.在此基础上提出多值决策图动态变量的排序策略及算法,用于构建动态故障树模型对应的多值决策图.将研究算法应用于动态故障树模型分析,实验结果表明了该方法的有效性.相比已有的动态变量的排序方法,笔者所提出的动态变量排序算法以较小规模的多值决策图实施等价的系统故障分析能力.该方法在故障树中存在重复事件时效果显著;当不存在重复事件时,用笔者提出的方法会增加故障树结构调整的时间开销.【相关文献】[1] BOUDALI H,CROUZEN P,STOELINGA M.A Rigorous,Compositional,and Extensible Framework for Dynamic Fault Tree Analysis[J].IEEE Transactions on Dependable and Secure Computing,2010,7(2): 128-143.[2] RAMEZANI Z,LATIF-SHABGAHI G R,KHAJEIE P,et al.Hierarchical Steady-state Availability Evaluation of Dynamic Fault Trees through Equal MarkovModel[C]//Proceedings of the 2016 24th Iranian Conference on Electrical Engineering.Piscataway: IEEE,2016: 1848-1854.[3] ZHANG P,CHAN K W.Reliability Evaluation of Phasor Measurement Unit Using Monte Carlo Dynamic Fault Tree Method[J].IEEE Transactions on Smart Grid,2012,3(3): 1235-1243.[4] MO Y C.New Insights into the Binary Decision Diagram-based Reliability Analysis of Phased-mission Systems[J].IEEE Transactions on Reliability,2009,58(4): 667-678.[5] MURTHY C,MISHRA A,GHOSH D,et al.Reliability Analysis of Phasor Measurement Unit Using Hidden Markov Model[J].IEEE Systems Journal,2014,8(4): 1293-1301.[6] DRECHSLE R.Evaluation of Static Variable Ordering Heuristics for MDDConstruction[C]//Proceedings of the International Symposium on Multiple-valued Logic.Piscataway: IEEE,2002: 254-260.[7] MO Y C.A Multiple-valued Decision-diagram-based Approach to Solve Dynamic Fault Trees[J].IEEE Transactions on Reliability,2014,63(1): 81-93.[8] LIN Y H,LI Y F,ZIO E.A Reliability Assessment Framework for Systems with Degradation Dependency by Combining Binary Decision Diagrams and Monte Carlo Simulation[J].IEEE Transactions on Systems,Man,and Cybernetics: Systems,2016,46(11): 1556-1564.[9] LE M,WEIDENDORFER J,WALTER M.A Novel Variable Ordering Heuristic for BDD-based K-terminal Reliability[C]//Proceedings of the International Conference on Dependable Systems and Networks.Piscataway: IEEE,2014: 527-537.[10] YEVKIN O.An Improved Modular Approach for Dynamic Fault TreeAnalysis[C]//Proceedings of the Annual Reliability and MaintainabilitySymposium.Piscataway: IEEE,2011: 5754437.[11] HARDY G,LUCET C,LIMNIOS N.K-terminal Network Reliability Measures with Binary Decision Diagrams[J].IEEE Transactions on Reliability,2007,56(3): 506-515.。
Aspen中NIST使⽤⽅法NIST ThermoData EngineUse this dialog box to estimate pure component parameters using the NIST Thermo Data Engine (TDE), or retrieve binary parameters from NIST. If at least two components are defined, you can choose at the top to evaluate either pure properties or binary mixture properties.If you choose databank component(s) or one(s) which have already had their structural formula specified, you can click Evaluate Now to run TDE to estimate properties immediately.If you choose a user-defined component, you can click Enter Additional Data to open the User-Defined Component Wizard for that component. Once you have specified the structural formula and optional additional data, you will be able to run TDE from within the wizard.TDE takes a few minutes to run. When it finishes running, the TDE Pure Results or TDE Binary Results window will appear with the results of the estimation.See AlsoUsing the NIST Thermo Data Engine (TDE)User-Defined Component WizardUsing the NIST Thermo Data Engine (TDE)You can use the ThermoData Engine (TDE) from the National Institute of Standards and Technology (NIST) to estimate property parameters for any component or pair of components given one of the following for each component:CAS numberMolecular structure. TDE can only use molecular structure saved in an MDL file (*.mol) or specified using the drawing tool in the User Defined Component Wizard. It cannot use molecular structurespecified by atom and connectivity.Note: Only MDL files of version V2000 are supported. The version V3000 files, sometimes called Extended MDL files, are not supported.TDE has a variety of group contribution methods available to estimate pure component property parameters based on molecular structure. Based on TDE's large database of experimental data, these methodshave been ranked for accuracy for different compound classes. For eachTo run TDE:1.Specify the component(s) on the Components | Specifications |Selection sheet.2.On the Home tab of the ribbon, in the Data Source group, clickNIST. The NIST ThermoData Engine dialog box appears.3.Choose Pure or Binary mixture.4.Select the component from the list in the dialog box. For binarymixture properties select a component from the second list aswell.5.If the CAS number or molecular structure is specified for eachcomponent, then the Evaluate Now button (for pure componentproperties) or Retrieve Data button (for binary mixture properties) is enabled. Click it to estimate property parameters.ORFor pure component parameters, if neither CAS number normolecular structure is specified, click Enter Additional Data. TheUser Defined Component Wizard appears, allowing you tospecify the molecular structure and optionally other data aboutthe component. You will be given the option to run TDE toestimate parameters after specifying data.The following data can be sent to TDE:Vapor pressure dataLiquid densityIdeal gas heat capacityNormal boiling pointMolecular structure (if specified using a version V2000 MDL file or using the drawing tool in the User Defined Component Wizard)Note: TDE takes a couple minutes to run on a typical computer.6.When TDE is finished, the results will appear in the TDE Purewindow or the TDE Binary window.See AlsoAbout the NIST ThermoData Engine (TDE)User Defined Component WizardNIST TDE Data Evaluation MethodologyNIST TDE vs. NIST-TRC DatabankUsing TDE ResultsAbout the NIST ThermoData Engine (TDE)The ThermoData Engine (TDE) is a thermodynamic data correlation, evaluation, and prediction tool provided with Aspen Plus and Aspen Properties through a long-term collaboration agreement with the National Institute of Standards and Technology (NIST).The purpose of the ThermoData Engine software is to provide critically evaluated thermodynamic and transport property data based on the principles of dynamic data evaluation.Critical evaluation is based on:Published experimental data stored in a program databasePredicted values based on molecular structure andcorresponding-states methodsUser supplied data, if anyThe primary focus of the current version is pure organic compounds comprised of the elements: C, H, N, O, F, Cl, Br, I, S, and P. The principles upon which the ThermoData Engine software are based are fully discussed in two articles.1,2 The first article describes the foundations of TDE while the second describes the extension of TDE for dynamic equation-of-state evaluation and online updating. Online updating is not available in Aspen Plus.ThermoData Engine is the first software fully implementing all major principles of the concept of dynamic data evaluation formulated at NIST Thermodynamic Research Center (TRC). This concept requires the development of large electronic databases capable of storing essentially all raw experimental data known to date with detailed descriptions of relevant metadata and uncertainties. The combination of these databases with expert software designed primarily to generate recommended data based on available raw experimental data and their uncertainties leads to the possibility of producing data compilations automatically to order, forming a dynamic data infrastructure. The NIST TRC SOURCE data archival system currently containing more than 3 million experimental data points is used in conjunction with ThermoData Engine as a comprehensive storage facility for experimental thermophysical and thermochemical property data. The SOURCE database is continually updated and is the source for the experimental database used with TDE.The ThermoData Engine software incorporates all major stages of the concept implementation, including data retrieval, grouping, normalization, sorting, consistency enforcement, fitting, and prediction. The ThermoData Engine emphasizes enforcement of consistency between related properties (including those obtained from predictions), and incorporates a large variety of models for fitting properties. Predicted values are provided using the following set of Prediction MethodsThe experimental database containing raw property data for a very large number of components (over 17,000 compounds) is included automatically with Aspen Plus/Aspen Properties. Results of the TDE evaluations –model parameters –can be saved to the Aspen Plus simulation and used in process calculations. Experimental data can also be saved to the simulation and used with the Aspen Plus Data Regression System, if needed, for example, to fit other property models, or to fit data over limited temperature ranges that correspond to the process conditions of interest.Note: AspenTech has provided the regression results for much of this data in the NIST-TRC databank. You can use this databank to gain mostof the advantage of NIST without spending the time to run TDE dynamically. The models linked below (used in many property methods) provide access to these properties when the NIST-TRC databank is used. See NIST TDE vs. NIST-TRC Databank for more information.Note: NIST TDE is a complementary technology of the existing Property Estimation System of Aspen Plus. The two features work independently of each other and will co-exist. However, we anticipate that TDE will continue to be enhanced with additional raw data and new or improved estimation methods and will be used in preference to the Property Estimation System in the future.The Aspen Plus - TDE interface covers the following properties of pure molecular compounds. Most of them can be estimated for new compounds based on molecular structure, using the methods listed below. Where multiple methods are listed for a property, they are ranked for accuracy for each compound class based on the data in the experimental database, and the highest-ranked one for the given structure is automatically selected.Single-Valued PropertiesTemperature-Dependent PropertiesReferences1.ThermoData Engine (TDE): Software Implementation of theDynamic Data Evaluation Concept, J. Chem. Inf. Model., 45 (4), 816 -838, 2005./doc/bf527fa31b5f312b3169a45177232f60ddcce795.html /TDEarticle.pdf 2.ThermoData Engine (TDE): Software Implementation of theDynamic Data Evaluation Concept. 2. Equations of State onDemand and Dynamic Updates over the Web, J. Chem. Inf. Model., 47, 1713-1754, 2007. /doc/bf527fa31b5f312b3169a45177232f60ddcce795.html /TDEarticle2.pdf 3.K. G. Joback, R. C. Reid. Estimation of Pure-Component Propertiesfrom Group-Contributions. Chem. Eng. Comm. 1987, 57, 233-243.4.L. Constantinou, R. Gani. New Group-Contribution Method forEstimating Properties of Pure Compounds. AIChE J. 1994, 40,1697-1710.5.J. Marrero-Morejon, E. Pardillo-Fontdevila. Estimation of PureCompound Properties Using Group-Interaction Contributions.AIChE J. 1999, 45, 615-621.6.G. M. Wilson, L. V. Jasperson. Critical Constants T c, P c. EstimationBased on Zero, First, Second-Order Methods. AIChE Meeting, New Orleans, LA, 1996.7. D. Ambrose, J. Walton. Vapor-Pressures up to TheirCritical-Temperatures of Normal Alkanes and Alkanols. Pure Appl.Chem. 1989, 61, 1395-1403.8.T. Yamada, R. D. Gunn. Saturated Liquid Molar Volumes. TheRackett Equation. J. Chem. Eng. Data 1973, 18, 234-236.9.L. Riedel. Chem.-Ing.-Tech. 1954, 26, 259-264. As modified in: J. L.Hales, R. Townsend. J. Chem. Thermodyn. 1972, 4, 763-772.10.B. E. Poling, J. M. Prausnitz, J. P. O'Connell. The Properties of Gasesand Liquids, 5th ed.; McGraw-Hill: New York, 2001.11.S. R. S. Sastri, K. K. Rao. A New Group Contribution Method forPredicting Viscosity of Organic Liquids. Chem. Eng. J. Bio. Eng. J.1992, 50, 9-25.12.T. H. Chung, M. Ajlan, L. L. Lee, K. E. Starling, GeneralizedMultiparameter Correlation for Nonpolar and Polar FluidTransport-Properties. Ind. Eng. Chem. Res. 1988, 27, 671-679.13.B. E. Poling, J. M. Prausnitz, J. P. O'Connell. The properties of Gasesand Liquids, 5th ed.; McGraw-Hill: New York, 2001 (page 9.9 forlow-pressure gas and page 9.35 Lucas model for high-pressure).14.T. H. Chung, L. L. Lee, K. E. Starling. Applications of Kinetic GasTheories and Multiparameter Correlation for Prediction of DiluteGas Viscosity and Thermal-Conductivity. Ind. Eng. Chem. Fund.1984, 23, 8-13.See AlsoNIST TDE vs. NIST-TRC DatabankUsing the NIST ThermoData EngineNIST TDE Data EvaluationNIST TDE Data Evaluation MethodologyThe NIST ThermoData Engine (TDE) uses dynamic data evaluation to determine the data to be used in regressing property parameters from the collected raw experimental data in NIST's database. The data evaluation is broken into several phases. The data are broken into four blocks:Phase diagram: triple point, critical temperature, phase boundary pressureVolumetric: critical density, saturated & single phase density, volumetric coefficientsEnergetic: energy differences, energy derivatives, speed of sound Other: transport properties, surface tension, refraction The blocks are first processed individually. The following thermodynamic consistency tests are performed within the phase diagram, volumetric, and energetic data:Vapor pressures of phases must be equal at triple points, and slope/enthalpy change must be consistentCondensed phase boundaries must converge to the triple pointGas and liquid saturation density curves must converge at the critical temperatureFirst derivative of saturated density must trend toward infinity at the critical temperatureSingle-phase densities must converge to saturated densities Then, the vapor pressure, saturated density, and enthalpy of vaporization are checked for consistency, and the other data is processed.See AlsoAbout the NIST ThermoData Engine (TDE)NIST TDE vs. NIST-TRC DatabankIn addition to the raw property data available with NIST TDE, the Aspen Physical Property System includes the NIST-TRC databank, which contains parameters regressed with TDE for compounds for which a significant amount of data was available. NIST-TRC and associated property models available in Aspen Plus provide all that most users need to use property data from NIST in their simulations.NIST TDE provides additional capabilities for users who need them:You can perform dynamic data evaluation using the raw property database delivered with Aspen Physical Property System. You can trace back to the original data sources.You can save the data into Aspen Plus to perform additional data regressions beyond those automated by TDE, such as fitting to adifferent property model or fitting data over a differenttemperature range which corresponds to the process conditionsof interest.Note: The NIST-TRC databank is only available when using the Aspen Properties Enterprise Database. Starting in version V7.0, Aspen Plus and Aspen Properties are configured to use the enterprise database when installed.Using TDE ResultsPure component resultsOn the left side of the TDE Pure Results window under Properties for component ID is a list of the property parameters available, with All at the top. Selecting All displays a summary of the parameter results. ForT-dependent parameters, a + is displayed; you can click this to open the display of the estimated values for each element of these parameters.Selecting any parameter displays details about that parameter on a multi-tab display, including any experimental data and estimated property values. In the display of experimental data, one column indicates which data points were used in regression and which were rejected as outliers.With the Experimental Data, Predicted Values, or Evaluated Results tab of any T-dependent parameter open, in the Home tab of the ribbon, in the Plot group, you can click Prop-T in the ribbon to generate a plot of that data vs. temperature. The plot displays all available experimental data and predicted values along with the curve of evaluated values.If you want to save this data as part of your simulation, you must click Save Parameters to save it on Parameters and Data forms. See Saving data to forms, below.Binary mixture resultsOn the left side of the TDE Binary Results window is a list of the property parameters available, with Data for ID(1) and ID(2) at the top. Clicking Data for ID(1) and ID(2) displays a summary of the parameterresults. The retrieved parameters appear in a tree at the left; selecting categories in the tree displays a summary of the data available under that category. Selecting the individual numbered results displays the experimental data. Double-clicking a row in any of the summary views also displays its experimental data.With any experimental data set open, in the Home tab of the ribbon, the Plot group displays buttons for ways you can plot that data.If you want to save this data as part of your simulation, you must click Save Data to save it on Data forms. See Saving data to forms, below.Once you have saved some results to forms, you can click Data Regression to create a data regression case with this data. See NIST TDE Data Evaluation/Regression.Click the Consistency Test tab to run consistency tests on the VLE data. See NIST TDE VLE Consistency Test for details. Saving results to formsClick Save Parameters or Save Dava to save any of the pure component TDE results and most categories of pure component or binary experimental data in forms in your current Aspen Plus or AspenProperties run. A dialog box appears, allowing you to select which parameters you want to save data for. For pure component experimental data, a checkbox (selected by default) lets you specify to save only accepted data; if this is selected then experimental data points which were rejected by TDE are not saved to forms. For binary data, a checkbox allows you to save both the data and its uncertainty. The data is saved to:Methods | Parameters | Pure Component| TDE-1 form (scalar parameter values)Methods | Parameters | Pure Component|Parameter Name forms (T-dependent parameter values)Data | Pure-Comp forms (pure component experimental data) Data | Mixture forms (binary experimental data)Note: TDE results are only saved if you use Save Data. Otherwise, they are discarded when you close the window. Values are saved in SI units. These are treated as user-entered parameters.See AlsoNIST TDE Data Evaluation。
Unlocking the promise of mobile value-added services byapplying new collaborative business models Original ResearchArticleTechnological Forecasting and Social Change , Volume 77, Issue 4, May 2010, Pages 678-693Peng-Ting Chen, Joe Z. Cheng Show preview | Related articles | Related reference work articlesPurchase $ 41.95 602 Software performance simulation strategies for high-level embedded system design Original ResearchArticlePerformance Evaluation , Volume 67, Issue 8, August2010, Pages 717-739Zhonglei Wang, Andreas Herkersdorf Close preview | Related articles |Related reference work articlesAbstract | Figures/Tables | ReferencesAbstractAs most embedded applications are realized in software, softwareperformance estimation is a very important issue in embedded system design.In the last decades, instruction set simulators (ISSs) have become anessential part of an embedded software design process. However, ISSs areeither slow or very difficult to develop. With the advent of multiprocessorsystems and their ever-increasing complexity, the software simulation strategybased on ISSs is no longer efficient enough for exploring the large designspace of multiprocessor systems in early design phases. Motivated by thelimitations of ISSs, a lot of recent research activities focused on softwaresimulation strategies based on native execution. In this article, we firstintroduce some existing software performance simulation strategies as well asour own approach for source level simulation, called SciSim , and provide adiscussion about their benefits and limitations. The main contribution of thisarticle is to introduce a new software performance simulation approach, callediSciSim (intermediate Source code instrumentation based Simulation), whichachieves high estimation accuracy, high simulation speed and lowPurchase $ 41.95implementation complexity. All these advantages make iSciSim well-suited for system level design. To show the benefits of the proposed approach, we present a quantitative comparison between iSciSim and the other discussed techniques, using a set of benchmarks.Article Outline1. Introduction2. Software performance simulation strategies2.1. Instruction set simulators2.2. Binary (Assembly) level simulation2.3. Source level simulation2.4. IR level simulation3. The SciSim approach for source level simulation3.1. Source code instrumentation3.2. Simulation3.3. Advantages and limitations of SciSim4. The iSciSim approach for performance simulation of compiler-optimized embedded software4.1. Intermediate source code generation4.2. Intermediate source code instrumentation4.2.1. Machine code extraction and mapping list construction4.2.2. Basic block list construction4.2.3. Static timing analysis4.2.4. Back-annotation of timing information4.3. Simulation4.3.1. Dynamic timing analysis4.3.2. Hardware and software co-simulation in SystemC5. Experimental results5.1. Source code vs. ISC5.2. Benchmarking SW simulation strategies 5.3. Dynamic cache simulation5.4. Simulation in SystemC6. Discussions and conclusions AcknowledgementsReferencesVitae603Computer anxiety and ICT integration in English classesamong Iranian EFL teachers Original Research ArticleProcedia Computer Science, Volume 3, 2011, Pages 203-209Mehrak Rahimi, Samaneh YadollahiClose preview | PDF (190 K) | Related articles | Related reference work articlesAbstract | ReferencesAbstractThe purpose of this study was to determine Iranian EFL teachers’ level of computeranxiety and its relationship with ICT integration into English classes and teachers’ personalcharacteristics. Data were collected from 254 Iranian EFL teachers by Computer AnxietyRating Scale, ICT integration rating scale, and a personal information questionnaire. Theresults indicated a positive relationship between computer anxiety and age; however,computer anxiety, gender, and experience of teaching were not found to be related. Aninverse correlation was found between computer anxiety and ICT integration. While ICTintegration correlated negatively with age and years of teaching experience, it was notfound to be related to gender.604An environmental decision support system for spatialassessment and selective remediation OriginalResearch ArticleEnvironmental Modelling & Software, Volume 26, Issue 6,June 2011, Pages 751-760Purchase$ 19.95Robert N. Stewart, S. Thomas Purucker Close preview | Related articles | Related reference work articles Abstract | Figures/Tables | ReferencesAbstractSpatial Analysis and Decision Assistance (SADA) is a Windows freewareprogram that incorporates spatial assessment tools for effective environmentalremediation. The software integrates modules for GIS, visualization,geospatial analysis, statistical analysis, human health and ecological riskassessment, cost/benefit analysis, sampling design, and decision support.SADA began as a simple tool for integrating risk assessment with spatialmodeling tools. It has since evolved into a freeware product primarily targetedfor spatial site investigation and soil remediation design, though itsapplications have extended into many diverse environmental disciplines thatemphasize the spatial distribution of data. Because of the variety of algorithmsincorporated, the user interface is engineered in a consistent and scalablemanner to expose additional functionality without a burdensome increase incomplexity. The scalable environment permits it to be used for both applicationand research goals, especially investigating spatial aspects important forestimating environmental exposures and designing efficient remedial designs.The result is a mature infrastructure with considerable environmental decisionsupport capabilities. We provide an overview of SADA’s central functions anddiscuss how the problem of integrating diverse models in a tractable mannerwas addressed.Article OutlineNomenclature1. Introduction2. Methods2.1. Sample design2.2. Data management and exploratory data analysis2.3. Spatial autocorrelation2.4. Spatial models3. Results 3.1. Scalable interfacing and decision support3.2. Risk assessment3.2.1. Human health risk3.2.2. Ecological risk3.3. Selective remedial design4. Discussion and ConclusionAcknowledgementsReferencesResearch highlights ► SADA is mature software for data visualization, processing, analysis, and modeling. ► User interface balances functional scalability and decision support. ► Widely used due to free availability and shallow learning curve . ► Integration of spatial estimation and risk tools allows for rich decision support. 605 CoDBT: A multi-source dynamic binary translator using hardware –software collaborativetechniques Original Research ArticleJournal of Systems Architecture , Volume 56, Issue 10,October 2010, Pages 500-508Haibing Guan, Bo Liu, Zhengwei Qi, Yindong Yang,Hongbo Yang, Alei LiangShow preview | Related articles | Related reference work articles Purchase $ 31.50606 An analysis of third-party logistics performance and service provision Original Research ArticleTransportation Research Part E: Logistics andTransportation Review , Volume 47, Issue 4, July 2011, Pages 547-570Chiung-Lin Liu, Andrew C. Lyons Purchase$ 41.95Show preview | Related articles | Related reference work articles 607 Intelligent QoS management for multimedia services support in wireless mobile ad hoc networks OriginalResearch ArticleComputer Networks , Volume 54, Issue 10, 1 July 2010, Pages 1692-1706Lyes Khoukhi, Soumaya Cherkaoui Show preview | Related articles | Related reference work articlesPurchase $ 31.50 608 Limit to improvement: Myth or reality?: Empirical analysis of historical improvement on threetechnologies influential in the evolution ofcivilization Original Research ArticleTechnological Forecasting and Social Change ,Volume 77,Issue 5, June 2010, Pages 712-729 Yu Sang Chang, Seung Jin Baek Show preview| Supplementary content| Related articles | Relatedreference work articlesPurchase $ 41.95 609An enhanced concept map approach to improving children’s storytelling ability Original Research ArticleComputers & Education , Volume 56, Issue 3, April 2011, Pages 873-884Chen-Chung Liu, Holly S.L. Chen, Ju-Ling Shih, Guo-Ting Huang, Baw-Jhiune Liu Show preview | Related articles | Related reference work articlesPurchase $ 24.95610Human –computer interaction: A stable discipline, a nascent science, and the growth of the longtail Original Research ArticleInteracting with Computers , Volume 22, Issue 1, January 2010,Pages 13-27Alan Dix Show preview | Related articles | Related reference work articlesPurchase$ 31.50 611Post-agility: What follows a decade of agility? Original Research ArticleInformation and Software Technology , Volume 53, Issue 5,May 2011, Pages 543-555Richard Baskerville, Jan Pries-Heje, Sabine MadsenShow preview | Related articles | Related reference work articlesPurchase $ 19.95612Confidentiality checking an object-oriented class hierarchy Original Research ArticleNetwork Security , Volume 2010, Issue 3, March 2010, Pages 16-20S. Chandra, R.A KhanShow preview | Related articles | Related reference work articlesPurchase $ 41.95 613 European national news Computer Law & Security Review , Volume 26, Issue 5, September 2010, Pages 558-563 Mark Turner Show preview | Related articles | Related reference work articlesPurchase $ 41.95 614 System engineering approach in the EU Test Blanket Systems Design Integration Original Research ArticleFusion Engineering and Design , In Press, CorrectedProof , Available online 23 February 2011D. Panayotov, P. Sardain, L.V. Boccaccini, J.-F. Salavy, F.Cismondi, L. Jourd’Heuil Show preview | Related articles | Related reference work articlesPurchase $ 27.95 615A knowledge engineering approach to developing mindtools for context-aware ubiquitouslearning Original Research ArticleComputers & Education, Volume 54, Issue 1, January 2010, Pages 289-297Hui-Chun Chu, Gwo-Jen Hwang, Chin-Chung Tsai Show preview | Related articles |Related reference work articles Purchase $ 24.95616“Hi Father”, “Hi Mother”: A multimodal analysis of a significant, identity changing phone call mediated onTV Original Research Article Journal of Pragmatics, Volume 42, Issue 2, February 2010,Pages 426-442Pirkko Raudaskoski Show preview | Related articles | Related reference work articlesPurchase $ 19.95 617Iterative Bayesian fuzzy clustering toward flexible icon-based assistive software for the disabled OriginalResearch ArticleInformation Sciences , Volume 180, Issue 3, 1 February 2010, Pages 325-340Purchase$ 37.95Sang Wan Lee, Yong Soo Kim, Kwang-Hyun Park,Zeungnam BienShow preview | Related articles | Related reference work articles 618 A framework of composable access control features: Preserving separation of access control concerns from models to code Original Research ArticleComputers & Security , Volume 29, Issue 3, May 2010, Pages 350-379Jaime A. Pavlich-Mariscal, Steven A. Demurjian, LaurentD. MichelShow preview | Related articles | Related reference work articlesPurchase $ 31.50 619 Needs, affect, and interactive products – Facets ofuser experience Original Research ArticleInteracting with Computers , Volume 22, Issue 5, September 2010, Pages 353-362Marc Hassenzahl, Sarah Diefenbach, Anja Göritz Show preview | Related articles | Related reference work articlesPurchase $ 31.50 620 An IT perspective on integrated environmental modelling: The SIAT case Original Research ArticleEcological Modelling , Volume 221, Issue 18, 10 September 2010,Pages 2167-2176P.J.F.M. Verweij, M.J.R. Knapen, W.P. de Winter, J.J.F. Wien, J.A. te Roller, S. Sieber, J.M.L. JansenShow preview | Related articles | Related reference work articlesPurchase $ 31.50。
《离散数学》双语专业词汇表Abelia n group :交换(阿贝尔)群absorption property 吸收律acyclic:无(简单)回路的adjace nt vertices 令B接结点adjace nt vertices 令B接结点adjace nt vertices 令B接结点algorithm verification :算法证明algorithm :算法alphabe t字母表alternating group:交替群an alogous类似的analysis of algorithm 算法分析antisymmetric 反对称的approach 方法,方式argument 自变量associative 可结合的associative 可结合的asymmetric 非对称的backtracking 回溯base 2 exponential function 以2 为底的指数函数basic step 基础步biconditional, equivalence 双条件式,等价bijection, one-to-one correspondence 双射,一一对应binary operation on a set A 集合 A 上的二元运算binary operation 二元运算binary relation 二元关系(complete) binary tree (完全)二元(叉)树bland meats 未加调料的肉block, cell 划分块,单元Boolean algebra 布尔代数Boolea n fun cti on:布尔函数Boolea n matrix :布尔矩阵Boolean polynomial, Boolean expression 布尔多项式(表达式)Boolean produc t 布尔乘积bounded lattice 有界格brace:花括号bridge:桥,割边by con ve ntio n:按常规,按惯例cancellation property:消去律capacity :容量cardi nality :基数,势category:类别,分类cate nation:合并,拼接ceili ng fun ction :上取整函数certain even:t 必然事件characteristic equation 特征方程characteristic function:特征函数chromaticnumber of G: G 的色数chromatic poly no mial:着色多项式circuitdesig n:线路设计circuit :回路closed under the operation 运算对…是圭寸闭的closed with respect to 对… 是圭寸闭的closure:闭包collision :冲突coloring graphs:图的着色colum n:列combi natio n:组合com mon divisor:公因子commutative:可交换的commutative:可交换的commuter:经常往来于两地的人comparable可比较的compatible with :与… 相容compatible:相容的complement of B with respect to A:A 与B 的差集compleme nt:补元complementary relation:补关系complete graph 完全图complete match 完全匹配complete n-tree 完全n-元树component sentence 分句comp onen:分图compositi on:复合compositio n:关系的复合compound statement 复合命题con diti onal stateme nt, implicatio n:条件式,蕴涵式congruenee relation 同余关系con grue nt to:与…同余conjecture :猜想conju nctio n:合取connected连通的conn ected连通的connection 连接connectivity relation 连通性关系consecutively 相继地consequent, conclusion 结论,后件constructive proof 构造性证明contain(in)包含(于)contingency 可满足式contradiction, absurdity 永假(矛盾)式contrapositive 逆否命题conv ersatio n of flow :流的守恒converse逆命题conversely:相反地coordi nate :坐标coset: 陪集countable(uncountable:) 可数(不可数) counterexample 反例coun ti ng:计数criteria :标准,准贝U custom :惯例cut:害U cycle :回路cyclic permutatio n:循环置换,轮换de Morgan ' s laws德摩根律declarative sentence 陈述句degree of a vertex 结点的度depot:货站,仓库descendant 后代diagonal matrix:对角阵die :骰子digraph:有向图dime nsion:维(数) direct flight :直飞航班discipli ne:学科disconnected不连通的discrete graph(null graph) 零图disjoint sets:不相交集disjunction:析取dista nee距巨离distinguish 区分distributive lattice 分配格distributive :可分配的distributive :可分配的divisio n :除法dodecahedron 正十二面体domai n:定义域doubly linked l i st :双向链表dual:对偶edge 边edge 边element, member 成员,元素empty relation 空关系empty sequence(string) 空串empty set 空集end point 端点entry(element) 元素equally likely 等可能的,等概率的equivalence class 等价类equivalent relation 等价关系Euclidian algorithm 欧几里得算法,辗转相除法Euler path(circuit) 欧拉路径(回路) event 事件everywhere defined 处处有定义的excess capacity 增值容量existence proof 存在性证明existential quantification 存在量词化expected value 期望值explicit 显式的extensively 广泛地,全面地extremal element 极值元素factor 因子factorial 阶乘finite (infinite) set :有限(无限)集finite group :有限(阶)群floor function :下取整函数free semigroup gen erated by A 由A 生成的自由半群frequency of occurrenee 出现次数(频率) fun cti on, mapp ing, tran sformatio n:函数,映射,变换GCD(greatest com mon divisor):最大公因子gen de:性另generalize:推广generic elemen:t 任一元素graduate schoo:l 研究生院graph:(无向)图graph:无向图greatest(least) element 最大(小)元greedy algorithm :贪婪算法group:群growth of function :函数增长Hamiltonian path(circuit):哈密尔顿路径(回路) hashi ng function:杂凑函数Hasse diagram 哈斯图height:树高homomorphic image:同态像homomorphism:同态hypothesis:假设,前提,前件idempote nt:等幕的idempote nt:幕等的identity function on A: A 上的恒等函数ide ntity(eleme nt):么(单位)元iden tity :么元,单位元impossibleeve n t不可能事件in clusio n-exclusio n prin ciple :容斥原理in-degree 入度in direct method:间接证明法induction step :归纟内步in formal brand:不严格的那种inorder search 中序遍历in tersectio n:交intuitively :直觉地in verse:逆关系in verse:逆元in verse:逆元inverter:反向器invertible function :可逆函数invo luti on property:对合律irreflexive :反自反的isolated vertex:孤立结点isomorphism :同构isomorphism :同构join :,保联,并join :并Karnaugh map:卡诺图Kernel:同态核key:键Klein 4 group: Klein 四元群Konisberg Bridge problem:哥尼斯堡七桥问题Kruskal 's algorith: mKruskal 算法labeled digraph标记有向图lattice :格LCM(least common multiple):最小公倍数leaf(leave):叶结点least upper(greatest lower) bound 上(下)确界level:层,lexicographic order:字典序likelihood :可能性lin ear array(list):线性表lin ear graph:线性图linear homogeneous relation of degree :k k 阶线性齐次关系lin ear order(total order):线序,全序linearly ordered set, chain 线(全)序集,链lin ked list :链表lin ked-list represe ntatio n:链表表示logarithm function to the base n 以n 为底的对数logical connective:命题联结词logically equivalent: (逻辑)等价的logically follow :是…的逻辑结论logicia n:逻辑学家loop:自回路lower order:低阶mai n diag on a:主对角线map-colori ng problem: 地图着色问题match ing fun cti on:匹配函数matching problems 匹配问题mathematical structure(system) 数学结构(系统)matrix :矩阵maximal match :最大匹酉己maximal(minimal) element :极大(小)元maximum flow:最大流mee t保交,交mee t 交minimal spanning tree:最小生成树mi nterm:极小项modular lattice :模格modulus:模modus ponens:肯定律modus toile ns:否定律mo noid :含么半群,独异点multigraph:多重图multiple :倍数multiplicati on table:运算表multi-valued function :多值函数mutually exclusive:互斥的,不相交的n atural homomorphism :自然同态nearest neighbo:r 最邻近结点n egati on:否定(式)normal subgroup正规(不变)子群n otatio n:标记notio n:概念n-tree:n-元树n-tuple:n-元组odd(even) permutation 奇(偶)置换offspring:子女结点one to one 单射,一对一函数on to:至U上函数,满射operation on sets 集合运算optimal soluti on:最佳方法or(and, not)gate 或(与,非)门order of a group: 群的阶order relati on:序关系ordered pair: 有序对,序偶ordered tree 有序树ordered triple :有序三元组ordinance 法规out-degree 出度pare nt:父结点partial order:偏序关系partially ordered set, pose:t 偏序集partition, quotient se t 划分,商集path:路径path:通路,路径permutatio n:置换,排列pictorially :以图形方式pige on hole prin ciple :鸽巢原理planar graph:(可)平面图plausible:似乎可能的pointer:指针Polish form:(表达式的)波兰表示polyno mial:多项式positional bi nary tree:位置二元(叉)树positional tree:位置树postorder search 后序遍历power se:幕集predicate:谓词preorder search 前序遍历prerequisite:预备知识prescribe:命令,规定Prim 's algorithmPrim 算法prime:素(数)principle of mathematical induction:(第一)数学归纳法probabilistic :概率性的probability(theory):概率(论) product partial order:积偏序product set, Caretesian se:t 叉积,笛product:积proof by con tradict ion :反证法proper colori ng:正规着色propositi onal fun cti on :命题公式propositi onal variable :命题变元pseudocode 伪码(拟码)pump ing stati on:抽水站quantifier:量词quotie nt group :商群random acces:s 随机访问random selection (choose an object at random:)随机选择range:值域rational number:有理数reachability relatio n:可达性关系reasoning 推理recreational area 游乐场所recursive :递归recycle:回收,再循环reflexive closure :自反闭包reflexive:自反的regular expression 正则表达式regular graph 正规图,正则图relatio n:关系relati on ship :关系relay statio n:转送站remainder:余数representation 表示restrictio n :限希9 reverse Polish form (表达式的)逆波兰表示(left) right coset:(左)右陪集root:根,根结点rooted tree (有)根树row:行R-relative set:R 相关集rules of referenee 推理规贝Urunning time :运行时间same orde r 同阶sample space样本空间semigroup :半群sensible:有意义的sensible有意义的seque nee 序歹U sequential access 顺序访问set eorresp onding to a seque nee 对应于序列的集合set inelusion(eontainment) 集合包含set 集合siblings 兄弟结点simple eyele 简单回路simple path(eireuit) 基本路径(回路) simple path 简单路径(通路) sink 汇sophistieated 复杂的souree 源spanning tree 生成树,支撑树square matrix 方阵statement, proposition 命题storage eell 存储单元string 串,字符串strong induetion 第二数学归纳法subgraph 子图subgroup 子群sublattiee 子格submonoid 子含么半群subseript 下标subsemigroup 子半群subse t子集substituti on:替换subtree 子树summarize 总结,概括symmetric closure:对称闭包symmetric differe nee:对称差symmetric group:对称群symmetric: 对称的tacitly :默认tautology:永真(重言)式tedious:冗长乏味的termi nology :术语the capacity of a cu:割的容量topological sort ing:拓扌卜排序transitive closure:传递闭包tran sitive:传递的transport network:运输网络tran spositi on:对换traverse 遍历,周游tree searchi ng树的搜索(遍历)tree:树truth table:真值表TSP(traveling salesperson problem)货郎担问题unary operation:一元运算undirected edge 无向边undirected edge 无向边un directed tree 无向树union 并unit element 么(单位)元universal quantification 全称量词化universal set 全集upper(lower) boun d:上(下)界value of a flow:流的值value, image:值,像,应变量Venn diagram:文氏图verbally:用言语vertex(vertices):结点vertex(vertices):结点,顶点virtually :几乎Warshal ' s algorithnWarshall 算法weight:权weight :Wweighted graph:(赋)权图well-defined:良定,完全确定word:词zero elemen:t 零元。
《离散数学》双语专业词汇表set:集合subset:子集element, member:成员,元素well-defined:良定,完全确定brace:花括号representation:表示sensible:有意义的rational number:有理数empty set:空集Venn diagram:文氏图contain(in):包含(于)universal set:全集finite (infinite) set:有限(无限)集cardinality:基数,势power set:幂集operation on sets:集合运算disjoint sets:不相交集intersection:交union:并complement of B with respect to A:A与B的差集symmetric difference:对称差commutative:可交换的associative:可结合的distributive:可分配的idempotent:等幂的de Morgan’s laws:德摩根律inclusion-exclusion principle:容斥原理sequence:序列subscript:下标recursive:递归explicit:显式的string:串,字符串set corresponding to a sequence:对应于序列的集合linear array(list):线性表characteristic function:特征函数countable(uncountable):可数(不可数)alphabet:字母表word:词empty sequence(string):空串catenation:合并,拼接regular expression:正则表达式division:除法multiple:倍数prime:素(数)algorithm:算法common divisor:公因子GCD(greatest common divisor):最大公因子LCM(least common multiple):最小公倍数Euclidian algorithm:欧几里得算法,辗转相除法pseudocode:伪码(拟码)matrix:矩阵square matrix:方阵row:行column:列entry(element):元素diagonal matrix:对角阵Boolean matrix:布尔矩阵join:并meet:交Boolean product:布尔乘积mathematical structure(system):数学结构(系统)closed with respect to:对…是封闭的binary operation:二元运算unary operation:一元运算identity:么元,单位元inverse:逆元statement, proposition:命题logical connective:命题联结词compound statement:复合命题propositional variable:命题变元negation:否定(式)truth table:真值表conjunction:合取disjunction:析取quantifier:量词universal quantification:全称量词化propositional function:命题公式predicate:谓词existential quantification:存在量词化converse:逆命题conditional statement, implication:条件式,蕴涵式consequent, conclusion:结论,后件contrapositive:逆否命题hypothesis:假设,前提,前件biconditional, equivalence:双条件式,等价logically equivalent:(逻辑)等价的contingency:可满足式tautology:永真(重言)式contradiction, absurdity:永假(矛盾)式logically follow:是…的逻辑结论rules of reference:推理规则modus ponens:肯定律m odus tollens:否定律indirect method:间接证明法proof by contradiction:反证法counterexample;反例basic step:基础步principle of mathematical induction:(第一)数学归纳法induction step:归纳步strong induction:第二数学归纳法relation:关系digraph:有向图ordered pair:有序对,序偶product set, Caretesian set:叉积,笛partition, quotient set:划分,商集block, cell:划分块,单元domain:定义域range:值域R-relative set:R相关集vertex(vertices):结点,顶点edge:边in-degree:入度out-degree:出度path:通路,路径cycle:回路connectivity relation:连通性关系reachability relation:可达性关系composition:复合reflexive:自反的irreflexive:反自反的empty relation:空关系symmetric:对称的asymmetric:非对称的antisymmetric:反对称的graph:无向图undirected edge:无向边adjacent vertices:邻接结点connected:连通的transitive:传递的equivalent relation:等价关系congruent to:与…同余modulus:模equivalence class:等价类linked list:链表storage cell:存储单元pointer:指针complementary relation:补关系inverse:逆关系closure:闭包symmetric closure:对称闭包reflexive closure:自反闭包composition:关系的复合transitive closure:传递闭包Warshal’s algorithm:Warshall算法function, mapping, transformation:函数,映射,变换argument:自变量value, image:值,像,应变量labeled digraph:标记有向图identity function on A:A上的恒等函数everywhere defined:处处有定义的onto:到上函数,满射one to one:单射,一对一函数bijection, one-to-one correspondence:双射,一一对应invertible function:可逆函数floor function:下取整函数ceiling function:上取整函数Boolean function:布尔函数base 2 exponential function:以2为底的指数函数logarithm function to the base n:以n为底的对数hashing function:杂凑函数key:键growth of function:函数增长same order:同阶lower order:低阶running time:运行时间permutation:置换,排列cyclic permutation:循环置换,轮换transposition:对换odd(even) permutation:奇(偶)置换order relation:序关系partial order:偏序关系partially ordered set, poset:偏序集dual:对偶comparable:可比较的linear order(total order):线序,全序linearly ordered set, chain:线(全)序集,链product partial order:积偏序lexicographic order:字典序Hasse diagram:哈斯图topological sorting:拓扑排序isomorphism:同构maximal(minimal) element:极大(小)元extremal element:极值元素greatest(least) element:最大(小)元unit element:么(单位)元zero element:零元upper(lower) bound:上(下)界least upper(greatest lower) bound:上(下)确界lattice:格join:,保联,并meet:保交,交sublattice:子格absorption property:吸收律bounded lattice:有界格distributive lattice:分配格complement:补元modular lattice:模格Boolean algebra:布尔代数involution property:对合律Boolean polynomial, Boolean expression:布尔多项式(表达式)or(and, not) gate:或(与,非)门inverter:反向器circuit design:线路设计minterm:极小项Karnaugh map:卡诺图tree:树root:根,根结点rooted tree:(有)根树level:层,parent:父结点offspring:子女结点siblings:兄弟结点height:树高leaf(leave):叶结点ordered tree:有序树n-tree:n-元树complete n-tree:完全n-元树(complete) binary tree:(完全)二元(叉)树descendant:后代subtree:子树positional tree:位置树positional binary tree:位置二元(叉)树doubly linked list:双向链表tree searching:树的搜索(遍历)traverse:遍历,周游preorder search:前序遍历Polish form:(表达式的)波兰表示inorder search:中序遍历postorder search:后序遍历reverse Polish form:(表达式的)逆波兰表示linked-list representation:链表表示undirected tree:无向树undirected edge:无向边adjacent vertices:邻接结点simple path:简单路径(通路)simple cycle:简单回路acyclic:无(简单)回路的spanning tree:生成树,支撑树Prim’s algorithm:Prim算法minimal spanning tree:最小生成树weighted graph:(赋)权图weight:树distance:距离nearest neighbor:最邻近结点greedy algorithm:贪婪算法optimal solution:最佳方法Kruskal’s algorithm:Kruskal算法graph:(无向)图vertex(vertices):结点edge:边end point:端点relationship:关系connection:连接degree of a vertex:结点的度loop:自回路path:路径isolated vertex:孤立结点adjacent vertices:邻接结点circuit:回路simple path(circuit):基本路径(回路) connected:连通的disconnected:不连通的component:分图discrete graph(null graph):零图complete graph:完全图regular graph:正规图,正则图linear graph:线性图subgraph:子图Euler path(circuit):欧拉路径(回路) Konisberg Bridge problem:哥尼斯堡七桥问题ordinance:法规recycle:回收,再循环bridge:桥,割边Hamiltonian path(circuit):哈密尔顿路径(回路)dodecahedron:正十二面体weight:权TSP(traveling salesperson problem):货郎担问题transport network:运输网络capacity:容量maximum flow:最大流source:源sink:汇conversation of flow:流的守恒value of a flow:流的值excess capacity:增值容量cut:割the capacity of a cut:割的容量matching problems:匹配问题matching function:匹配函数compatible with:与…相容maximal match:最大匹配complete match:完全匹配coloring graphs:图的着色proper coloring:正规着色chromatic number of G:G的色数map-coloring problem:地图着色问题conjecture:猜想planar graph:(可)平面图bland meats:未加调料的肉chromatic polynomial:着色多项式binary operation on a set A:集合A上的二元运算closed under the operation:运算对…是封闭的commutative:可交换的associative:可结合的idempotent:幂等的distributive:可分配的semigroup:半群product:积free semigroup generated by A:由A生成的自由半群identity(element):么(单位)元monoid:含么半群,独异点subsemigroup:子半群submonoid:子含么半群isomorphism:同构homomorphism:同态homomorphic image:同态像Kernel:同态核congruence relation:同余关系natural homomorphism:自然同态group:群inverse:逆元quotient group:商群Abelian group:交换(阿贝尔)群cancellation property:消去律multiplication table:运算表finite group:有限(阶)群order of a group:群的阶symmetric group:对称群subgroup:子群alternating group:交替群Klein 4 group:Klein四元群coset:陪集(left) right coset:(左)右陪集normal subgroup:正规(不变)子群prerequisite:预备知识virtually:几乎informal brand:不严格的那种notation:标记sensible:有意义的logician:逻辑学家extensively:广泛地,全面地commuter:经常往来于两地的人by convention:按常规,按惯例dimension:维(数) compatible:相容的discipline:学科reasoning:推理declarative sentence:陈述句n-tuple:n-元组component sentence:分句tacitly:默认generic element:任一元素algorithm verification:算法证明counting:计数factorial:阶乘combination:组合pigeonhole principle:鸽巢原理existence proof:存在性证明constructive proof:构造性证明category:类别,分类factor:因子consecutively:相继地probability(theory):概率(论) die:骰子probabilistic:概率性的sample space:样本空间event:事件certain event:必然事件impossible event:不可能事件mutually exclusive:互斥的,不相交的likelihood:可能性frequency of occurrence:出现次数(频率) summarize:总结,概括plausible:似乎可能的equally likely:等可能的,等概率的random selection(choose an object at random):随机选择terminology:术语expected value:期望值backtracking:回溯characteristic equation:特征方程linear homogeneous relation of degree k:k阶线性齐次关系binary relation:二元关系prescribe:命令,规定coordinate:坐标criteria:标准,准则gender:性别graduate school:研究生院generalize:推广notion:概念intuitively:直觉地verbally:用言语approach:方法,方式conversely:相反地pictorially:以图形方式restriction:限制direct flight:直飞航班tedious:冗长乏味的main diagonal:主对角线remainder:余数random access:随机访问sequential access:顺序访问custom:惯例polynomial:多项式substitution:替换multi-valued function:多值函数collision:冲突analysis of algorithm:算法分析sophisticated:复杂的set inclusion(containment):集合包含distinguish:区分analogous:类似的ordered triple:有序三元组recreational area:游乐场所multigraph:多重图pumping station:抽水站depot:货站,仓库relay station:转送站。
MULTI-VALUED SIMULATIONWITH BINARY DECISION DIAGRAMSRaimund UBAR, Jaan RAIKTechnical University of Tallinn,Ehitajate tee 5, EE0026, Tallinn, ESTONIAFax: (+372) 620 2226, E-mail: raiub@pld.ttu.eeAbstract. The paper presents a new method for multivalued simulation of digital circuits based on calculation of Boolean derivatives on BDDs (or structural alternative graphs). A procedure for calculation of maximums of Boolean derivatives as the basis of multivalued simulation is given. The method is applicable for component level representations of digital circuits where as components arbitrary subcircuits (macros) instead of gates are considered. No dedicated model library for multivalued simulation is needed. Instead of dedicated multi-valued models, generic ones in the form of BDDs are used. Implementation areas of multivalued simulation for delay fault testing and hazard analysis are discussed. Advantages of the new approach compared to the traditional gate-level multi-valued simulation are shown. Experimental data for ISCAS benchmarks to demonstrate these advantages are also included.1. INTRODUCTIONTest pattern generation and fault simulation procedures for digital circuits, because of the need for high computational speed are usually based on simplified two-valued simulation. This results in the following consequences:- transitions between patterns in the test sequence can have transient pulses caused by hazards, which may result in the loss of credibility of test sequences in detecting faults of asynchronous circuits;- it is not possible to generate test patterns for faults in functionally redundant parts of the design;- it is not possible to generate or analyse the quality of test sequences for delay faults.The shortages of test design methods listed above can be overcome by using dynamic analysis methods based on multi-valued simulation.Multivalued simulation has been used for: detecting hazards in digital circuits [1], delay fault analysis and test synthesis [2], fault cover analysis and test synthesis for the case of dynamic testing [3] etc. In this approach, to each value from the given alphabet of signal values a special stylized waveform corresponds. The number of values (waveform types) can be different. Three-, five-, six-, eigth-, nine-valued simulation alphabets are common.The drawbacks of traditional multi-valued simulation methods are the following:- traditionally gate-level descriptions are used, which increases the complexity of the model and reduces the computational speed;- representing of circuits under test by two-input gates is mandatory;- when introducing macroblocks into the use, each macroblock should have its own computational model.In this paper for removing the listed drawbacks, a novel method for multivalued simulation is discussed, which lays on using Boolean differential calculus and alternative graphs.2. MULTI-VALUED SIMULATION IN GATE-LEVEL CIRCUITSFor the purpose of delay fault detection, the line waveforms can be considered to be members of the waveform-type set S = {0, 1, ε, h, 0*, 1*, ε*, h*, x}. The members of S are described as follows: 0 (1) represents a type of waveform having a stable logic value 0 (1); ε (h) represents a waveform having a step-up transition from 0 to a final value of 1 (step-down transition from 1 to a final value of 0); 0* (1*) represents a waveform having a final value 0 (1) with a static hazard occuring over the transition period; ε* (h*) represents a waveform having a step-up transition from 0 to 1 (step-down transition from 1 to 0) with a dynamic hazard occuring over the transition period, and x represents unknown waveform. Modifications of the set S3 are: S = {0, 1, x} for 3-valued simulation, S5 = {0, 1, ε, h, x}for 5-valued simulation, S6 = {0, 1, ε, h, 0*, 1*}for 6-valued simulation etc.Due to physical behaviors and the existence of delays of logic components, every line in the circuit can have one of the mentioned waveform-types of S. Correspondingly, the dynamic behavior of the circuit during one single transition period will be represented also by waveforms of S on the outputs of the circuit. Every gate in the circuit network can be regarded as an operator which computes the output value of the gate if the values on the inputs are given. The operators for OR, AND and NOT gates in the case of five-valued simulation are depicted in Table 1.Table 1O R 0 1 ε h x AND0 1 ε hxNOT0 0 1 ε h x 0 0 0 0 00 11 1 1 1 1 1 1 0 1 ε hx1 0εε 1 ε x x ε 0εε xxεhh h 1 x h x h 0 h x hxh εx x 1 x x x x 0 x x xxx xFrom Table 1 and its transitivity we can compute the logic value of any line in the circuit which is represented as a network of two-input logic gates OR, AND or NOT. Similar tables can be easily derived for other alphabets S6, S8 etc.3. MULTI-VALUED SIMULATION AND BOOLEAN DERIVATIVESLet us represent a digital circuit by equivalent parenthesis form (EPF) synthesized by superposition procedure directly from the circuit. For synthesizing the EPF for a given circuit, numbers are first assigned to the gates and letters to the nets. Then, starting at an output and working back toward primary inputs, EPF replaces individual literals by products of literals or sums of literals. When an AND gate is encountered during backtracing, a product term is created in which the literals are the names of nets connected to the inputs of the AND gate. Encountering an OR gate causes a sum of literals to be formed, while encountering an inverter causes a literal to be complemented.As an example the procedure is illustrated by transforming the circuit in Fig.1 to its equivalent parenthesis form:Y = (a1 b1) = (c12 + d12)(m13 + e13) =(g124 h124 + f125 k125)(m13 + ¬k136) ==(g124 h124 + ¬h1257 k125)(m13 + ¬k136).= ArrayFig.1. Digital circuit for creating the equivalent parenthesis formWhen creating an equation by the superposition procedure described above, the identity of every signal path from the inputs to the outputs of the given circuit will be retained. Each literal in an EPF consists of a subscripted input variable or its complement, which identifies a path from the variable to the output. From the manner in which the EPF is constructed, it can be seen that there will be at least one subscripted literal for every path from each input variable to the output. It is also easy to see that the complemented literals correspond to paths, which contain an odd number of inversions.Let us have an EPF y = f(x1, x2, ... x i, ... x n) where x i are literals, which describes the behavior of a digital circuit. If a transition occurs on the input and affects the path denoted by x i, then the transition will propagate up to the output y if ∂y/∂x i = 1, where ∂y/∂x i is called partial Boolean derivative. In general case, if transitions occur on several inputs or a transition has a fan-out and propagates along several reconvergent paths, then the derivative ∂y/∂x i may have a dynamic value d∈V D. As ∂y/∂x i = d is the case, we are not allowed to exclude the possibility that during the transition a short period may exist where d = 1 happens. Hence, the statement made above can be generalized as follows: if a transition occurs on the input x i, then the transition from x i will propagate up to the output y if max{∂y/∂x i} = 1 is valid over the transition period. Now, the following two theorems can be easily proved.Theorem 1.The value of the EPF y = f(X) = f(x1, x2, ... x i, ... x n) for the given digital circuit in multivalued alphabet will be static if∀x i∈X: max{∂y/∂x i} = 0,x j∈X Dwhere X D⊆ X is the set of literals whose values are dynamic.Theorem 2.If X D ∩{x i⎥ max{∂y/∂x i} = 1}≠∅ then the value of y can be calculated as the function of AND (or OR) of values of x i for x i∈ X D ∩{x i⎥ max{∂y/∂x i} = 1}.Proof. If the transition occurs on a single input x i with max{∂y/∂x i} = 1 then y = x i, i.e. the same transition (or its complement if x i is inverted) occurs on the output. Otherwise, if several transitions on inputs x i for x i∈X D ∩{x i⎥ max{∂y/∂x i} = 1}are propagating through the circuit, these paths can reconverge only on inputs of either AND or OR gates.From Theorems 1 and 2 an algorithm can be developed for multivalued simulation of digital circuitsbased on calculating Boolean derivatives of equivalent parenthesis forms representing the circuit.Unfortunately, this algorithm obviously will be more complex compared to the traditional gate-level simulation based on multi-valued algebras. However, when using alternative graphs it will be possible to create an efficient algorithm to implement the idea of calculating Boolean derivatives.4. BINARY DECISION DIAGRAMS AND EQUIVALENT PARENTHESIS FORMS As a general case of decision diagrams alternative graphs (AG) [4] were proposed for representing digital systems. Binary decision diagrams (BDD) [5] can be regarded as a special class of AGs. Unlike the traditional BDDs, structural alternative graphs (SAG) reported in [4] are able to support structural representation of gate-level networks in terms of signal paths.An AG that represents a Boolean function is a directed noncyclic graph with a single root node, where all nonterminal nodes are labelled by (inverted or non-inverted) Boolean variables (arguments of the function) and always have exactly two successor-nodes whereas terminal nodes are labelled by constants 0 or 1. For all nonterminal nodes, an one-to-one correspondence exists between values of the node variable and successors of the node. This correspondence is determined by the Boolean function represented by the graph.Denote the variable which labels the node m by x(m). We say that a value of the node variable activates the node output branch. According to the value of x(m), one of two output branches of m will be activated. A path in an AG is called activated if all the branches that form this path are activated. The AG is called activated to the value 0 (or 1) if there exists an activated path that includes both the root node and the terminal node labelled by the constant 0 (or 1). Alternative graph G y with nodes labelled by variables x1, x2, ..., x n, represents the Boolean function y = f(X) = f(x1, x2, ..., x n), if for each pattern of X, the AG will be activated to the value which is equal to y. We can consider a digital circuit as a network of tree-like subcircuits, each of them represented by a Boolean function. Consequently, a digital circuit can be represented by a system of AGs. For the gate-level AG-description, the number of AGs is equal to the number of gates in the circuit.Fig.2. Combinational circuit and his structural alternative graphSimilar to superposition of functions described in the previous section, superposition of AGs can be defined [4]: if the label x(m) of a node m in an AG G is a Boolean function which is represented by another AG G x(m) then the node m in G can be substituted by G x(m). Generation of an AG-model for a given gate-level digital circuit is based on the superposition of AGs. AGs for logical gates are assumed to be given as a source library. Starting from the gate-level AG-description and using iteratively the superposition procedure, we produce a more concise representation of the circuit (by each substitution of a node with an AG, we reduce the model by one node and by one AG). As a result of the superposition procedure, we create so-called structural AGs, which have the following property [4]: each node in a structural AG represents a related signal path in the corresponding gate-level circuit. To avoid repetitive occurrence of same subgraphs in the model, it is recommended to create separate AGsfor tree-like subcircuits. In this case, the number of all nodes in the set of AGs will be equal to the number of paths in all tree-like subnetworks of the circuit. Hence, using the concept of AGs, it is possible to ascend from the gate-level descriptions of digital devices to higher level structural descriptions without loosing accuracy of representing gate-level signal paths.As an example, Fig.2. shows a representation of a combinational circuit represented by equivalent parenthesis formy = (x1 x21 + ¬x22 x31) (x32 x51 + ¬x4 x61) + x52¬x62also by the corresponding structural alternative graph. For simplicity, values of variables on branches are omitted (by convention, the right-hand branch corresponds to 1 and the lower-hand branch to 0). Also, terminal nodes with constants 0 and 1 are omitted (leaving the AG to the right corresponds to y = 1, and down - to y = 0). The graph contains 10 nodes whereas each of them represents a signal path in a circuit and a literal in the EPF. The literals in EPF and the related node variables in AG correspond to input branches of the circuit shown in Fig.2.5. MULTI-VALUED SIMULATION WITH ALTERNATIVE GRAPHSTwo-valued test pattern simulation on AGs is equivalent to path tracing procedure on graphs according to the values of variables at a given test pattern. As a result of path tracing in G y, the value of y will be calculated which will be equal to the value of the label variable at the terminal node reached by path tracing. For explaining the calculation of Boolean derivatives, introduce the following notations: l(m) - activated path in the AG from the root node up to a node m; l(m,#1) (or l(m,#0)) - activated path from a node m up to the terminal node labelled by constant #1 (or #0); m1 (or m0) - successor of the node m for the value x(m)=1 (or x(m)=0). Denote l(m)=1 (or l(m,#e)=1) if there exists a path l(m) (or l(m,#e)), where e ∈{0,1}; in other case, l(m)=0 (or l(m,#e)=0).In the case of AGs, dy/dx(m)=1 is equivalent to one of the two conditions:∧ l(m1,#1) ∧ l(m0,#0) = 1, (1) l(m)∧ l(m1,#0) ∧ l(m0,#1) = 1, (2)l(m)in other words, dy/dx(m)=1 is equivalent to the existence of simultaneously activated three paths: l(m), l(m1,#1) (or l(m1,#0)) and l(m0,#0) (or l(m0,#1)).For example, for the input pattern X = 110011 for Fig.2, we have for the SAG: dy/¬dx4=1, since the following three paths are activated: l(¬x4)=(x1, x21, x32, ¬x4), l(x51,#1)=(x51,#1), l(x52,#0)=(x52,¬x62, #0) and the condition (1) is fulfilled.For calculating the maximum of a Boolean derivative and proving that max{dy/dx(m)} = 1, all dynamic values when tracing the path l(m1,#1) should be replaced by 1 and when tracing the path l(m1,#1) by 0; when tracing the path l(m) all dynamic values should be replaced either by 1 or by 0 properly so that the node m can be reached. In fact, instead of sequentially calculating the maximum derivatives separately step by step for all the nodes m where x(m)∈X D, we can travers all the paths from all these nodes in both directions by a a single procedure based on backtracking (by nested calculation of all the derivatives).Examples of the procedure are demonstrated in Fig.3. In Fig.3a, we have dy/dx32 = dy/dx31 = 0, hence y = 0, because the traversing in all directions ends in the terminal node #0. In Fig.3b, we have dy/dx32 = dy/dx31 = 1, hence y = x32 x32 = εε = ε. In Fig.3c, we have dy/dx32 = dy/dx31 = 0, hence y = 1, because the traversing in all directions ends in the terminal node #1.Fig.3. Multi-valued simulation by tracing the alternative graph6. MULTI-VALUED SIMULATION ALGORITHMIn the five-valued alphabet, 0 and 1 are referred to as static values while ε, h and x are called dynamic values. Respectively, nodes labelled by variables containing static values are referred to as static nodes and nodes labelled by variables containing dynamic values are referred to as dynamic nodes.In the following, few definitions used in describing the multi-valued simulation algorithm on alternative graphs (AGs) are given.Definition 1. The value of the node m im i = x(m i )¬β(m i ) ∨ ¬x(m i )β(m i ) ,where x(m i ) is the value of the variable labelling node m i , and β(m i ) is a constant which can be equal to either 0 or 1. Constant β(m i ) can be interpreted as an inversion flag for the node m i .As it was mentioned in section 5, m 0 denotes the successor node of the node m which will be chosen when m=0. Accordingly, m 1 will denote the successor node that will be chosen when m=1.Definition 2. Let us denote the operation of selecting the successor node to a node m while moving rightwards by m → and the operation of selecting the successor node while moving downwards by m ↓, respectively. In order to calculate the operations, the following rules are applied:a) b) c) ⎩⎨⎧≠=→=0,0,10m m m m m ⎩⎨⎧≠=↓=1,1,01m m m m m (1) (2)An iterative process, which starts from node v, selects the successor node corresponding to rule (1) to be the new starting node and repeats until the graph has been exited is called moving rightwards from node m . In similar way we can define the process of downward movement from node m .According to above definitions, a multi-valued simulation algorithm for AGs is presented. It includes two stacks, A and B for saving dynamic nodes while traversing the graph, and flags flag1 and flag2 for each node to keep track of which nodes have been traversed and to what direction. Initially all the flags are reset and all the stacks are empty.The algorithm starts with the rightward movement from the root node. During the process, each traversed dynamic node will be pushed to stack A and the flag flag1of these nodes will be set. (The flag shows that the node was traversed while moving rightwards). If the value of the last traversed node was zero then the simulation will end and the value of the graph will be zero. Otherwise, a process of traversing the graph and calculating Boolean derivations for the dynamic nodes using the two stacks (A and B ) starts.The process will end when both of the stacks are empty or Boolean derivation for a node containing value x is one. Nodes are popped from stack A for the subsequent downward movement. However, the dynamic nodes traversed during the downward movement are pushed to stack B . During the rightward movement, nodes are popped from stack B and pushed to stack A, respectively. The process of handling the node stacks is shown in Figure 4.Fig. 4 Managing the Node StacksLet us consider in detail the process of handling stack A. (It is similar to the management of stack B with the exception that the moving direction and flag1 and flag2 are changed to their respective counterparts). When we pop a dynamic node from stack A , we will have to save the value of the stack pointer of stack B . This is necessary in order to restore the value of the pointer when the Boolean derivation of the popped node appears to be 0. Subsequently, the process of downward movement begins. If we reach a dynamic node that was previously traversed while moving rightwards (marked by flag1) then the Boolean derivation of the popped node will be equal to zero. If we reach a dynamic node that has not been traversed we will push it to stack B . Finally, if the graph is exited to the rightward direction, the Boolean derivation of the popped node is considered to be zero. Accordingly, if the graph is exited downwards then the corresponding derivation will be equal to one.If the Boolean derivation of the node is zero, then we will pop the next node from stack A , otherwise we will continue with handling stack B . As mentioned above, the simulation process will end when both of the stacks are empty or Boolean derivation for a node containing value x is found to be one. The value of the graph is x also in the case when there exists at least one node equal to ε and one node equal to h whose Boolean derivations are ones. If there exist at least one node equal to ε and no nodes equal to h whose Boolean derivations are one then the value of the graph will be ε. In similar way, if we find Boolean derivation to be one for at least one node equal to h but not for any node containing ε then the value of the graph will be h. Finally, if Boolean derivations for all the nodes are found to be zeros then the value of the graph will be equal to one.6. EXPERIMENTAL RESULTSDynamic test analysis has the goal to estimate the quality of test patterns by considering not only static levels of signals but also transitions between patterns in test sequences. The dynamic analysis package of the Turbo-Tester (TT) software [6] developed at the Tallinn Technical University is based on a multi-valued simulation on AGs. TT contains tools for multi-valued simulation, delay fault coverage analysis and dynamic fault analysis (especially oriented for detecting statically redundant faults). Experimental results on the multi-valued simulation of well-known ISCAS’85 benchmark circuits are given in Table 2. Time ratio 1 shows the efficiency of macro-level simulation for the case when only a single signal transition at inputs is allowed, and Time ratio 2 corresponds to the case of multiple random transitions at inputs.Note that in Turbo Tester for the first time a macro-level multi-valued simulation method is implemented. As a result the complexity of the model can be significally reduced compared with known methods which always need as a model a network of two-input logical gates. The fault ratio in Table 3 shows differences in model complexities. From Table 2 it follows that the speed of macro-level simulation based on the proposed method increases up to 2,36 times for given benchmark circuits compared to the gate-level simulation.Table 2880 c1355 c1908 c2670 c3540 c5315 c6288 c7552 Benchmark circuit c432 c499 c(G) 974 2194 1550 21942788 4150 55688638 9728 11590faultsGate-levelfaults(M) 616 1202 994 16181732 2626 32965424 7744 7104 Macro(M/G) 1,58 1,83 1,56 1,361,61 1,58 1,691,59 1,26 1,63 ratioFault1(M/G) 2,07 3,04 2,07 1,712,62 2,18 3,292,54 1,50 2,19 ratioTime2(M/G) 2,37 2,77 2,22 1,732,35 2,39 2,572,14 1,62 2,63 ratioTimeWe discovered that the efficiency of simulation is highly dependent on the number of levels and on the number of gates in tree-like subcircuits represented by graphs. Experimental results for 5 different subcircuits represented by one graph with numbers of levels from 3 to 7 (and with numbers of gates from 7 to 127) are represented in Fig.5 and Table 3. As an example, note that the tree-like subcircuit with maximum size in the ISCAS’85 benchmark circuit c7552 contains 64 gates. Simulation time in Fig.5 is given for 100000 random patterns in seconds on SUN SPARC 20 workstation.Fig.5. Comparison of Gate-level and Macro-level simulationTable 3Levels Gates Macro Gate3 70.57 1.34 15 1.3 2.85 31 1.3 4.76 63 1.49.17 127 1.7177. CONCLUSIONSA new efficient multi-valued simulation approach for combinational or scan-based circuits for delay fault analysis, hazard detection or dynamic test analysis is presented. Its basic idea is substituting the traditional gate-level waveform calculation by nested Boolean differential calculus on alternative graphs. Introducing of AGs allows to reduce the complexity of the model by replacing low-level two-input-gate networks with higher macro-level representations. In fact, the multi-valued calculus on gate-level networks is transformed to a path traversing procedure on alternative graphs. It is not needed to create for each new macro-block a separate dedicated multi-valued model. Instead, from the gate-level description automatically an AG-representation will be created, where a single general procedure for all types of macros will be used. Experimental benchmark results have substantiated the efficiency of the new approach compared to the traditional gate-level simulation approaches.References1. R. Andrew. An algorithm for eigth-valued simulation and hazard detection in gate networks. Proc.of 16th Int. Symposium on Multiple Valued Logic. Blacksburg, 1986, pp. 273-280.2. W. Mao, M.D. Ciletti. A variable observation method for testing delay faults. Proc. Of 27thACM/TEEE Design Automation Conference. 1990, pp. 728-731.3. S. Si. Dynamic testing of redundant logic networks. IEEE Trans. on Computers, 1978, Vol. C-27,No 9, pp. 828-832.4. R. Ubar. Test Synthesis with Alternative Graphs. IEEE Design & Test of Computers. Spring 1996,pp. 48-59.5. S. Akers. Binary Decision Diagrams. IEEE Trans. Computers, Vol. 27, No. 6, July 1978, pp. 509-516.6. R. Ubar, J. Raik, P. Paomets, E. Ivask, G. Jervan, A. Markus. Low-Cost CAD System for TeachingDigital Test. “Microelectronics Education”, World Scientific Publishing, 1996, pp. 185-188.。