A Boolean Control Network approach to pursuit evasion problems in polygonal environments
- 格式:pdf
- 大小:274.43 KB
- 文档页数:6
Fuzzy Logic and SystemsFuzzy logic is a mathematical concept that deals with reasoning that is approximate rather than fixed and exact. It is an extension of traditional Boolean logic and has found applications in various fields such as control systems,artificial intelligence, and decision-making processes. One of the key characteristics of fuzzy logic is its ability to handle vague and uncertain information, which makes it particularly useful in situations where precise measurements and clear boundaries are difficult to define. From a technical perspective, fuzzy logic operates on the principle of assigning degrees of truthto statements or propositions, rather than the conventional true or false values used in classical logic. This allows for a more nuanced and flexible approach to reasoning, where the boundaries between categories are not sharply defined. For example, in traditional logic, a statement such as "the temperature is hot" would be either true or false based on a specific threshold value. In contrast, fuzzy logic allows for a gradual transition between "hot" and "not hot," enabling a more realistic representation of the way humans perceive and interpret temperature. In the context of control systems, fuzzy logic has been widely used to model and control complex and non-linear systems. Unlike traditional control systems thatrely on precise mathematical models, fuzzy logic controllers can accommodate imprecise and incomplete information, making them well-suited for real-world applications where the environment is uncertain and dynamic. For instance, in automotive applications, fuzzy logic has been employed in anti-lock braking systems, engine control units, and automatic transmission systems to improve performance and safety under varying driving conditions. In the field ofartificial intelligence, fuzzy logic has been integrated into expert systems to emulate human decision-making processes. By incorporating fuzzy sets and fuzzy rules, these systems can handle uncertain and ambiguous information, making them more adaptable to real-world problems. This has led to advancements in areas such as medical diagnosis, financial forecasting, and natural language processing, where the ability to reason with uncertain and incomplete data is crucial. From a philosophical perspective, fuzzy logic challenges the traditional binary view of the world and acknowledges the inherent fuzziness and ambiguity in human cognition.It reflects the way humans think and communicate, where concepts are often vague and context-dependent. By embracing this inherent uncertainty, fuzzy logic offers a more human-centric approach to reasoning and problem-solving, bridging the gap between formal logic and human intuition. In conclusion, fuzzy logic represents a paradigm shift in the way we approach reasoning and decision-making. By embracing uncertainty and vagueness, it offers a more realistic and human-like approach to handling complex systems and uncertain information. Its applications in control systems, artificial intelligence, and decision support systems have demonstrated its effectiveness in dealing with real-world problems where precise measurements and clear boundaries are difficult to define. As we continue to grapple with the complexities of the world, fuzzy logic provides a valuable tool for navigating the inherent uncertainty and ambiguity that permeate our lives.。
Review Questions第一章1.Which characteristics of a multiterminal system make it different from a computer network?A processing power of multiterminal systems remained fully centralized, whilecomputer networks have a distributed processing power.一个多端系统处理能力仍然完全集中,而计算机网络具有分布式处理能力。
2.When were the first important results achieved in the field of joining computers using long-haul links?In the late 60s在60年代后期3.What is ARPANET?A.A network of supercomputers belonging to military organizations and research institutes in the United StatesB.An international scientific research networkC.The technology of creating WANsA is correct4.When did the first network operating systems appear?In the late 60s60年代后期5.In what order did the events listed here take place?A.The invention of WebB.The development of standard LAN technologiesC.The start of voice transmission in digital form through telephone networksThe invention of World Wide Web互联网的诞生6.Which of the events stimulated LAN development?Appearance of large-scale integrated circuits (LSI devices) resulted in invention of microcomputers which in its turn stimulated a research activity in the area of local computer networks (LANs). The adoption of personal computers was a powerful incentive for the development of LANs.大规模集成电路(LSI器件出现)导致这反过来刺激了研究活动在本地计算机网络(LAN)的微型计算机的发明。
人工智能原理_北京大学中国大学mooc课后章节答案期末考试题库2023年1.Turing Test is designed to provide what kind of satisfactory operationaldefinition?图灵测试旨在给予哪一种令人满意的操作定义?答案:machine intelligence 机器智能2.Thinking the differences between agent functions and agent programs, selectcorrect statements from following ones.考虑智能体函数与智能体程序的差异,从下列陈述中选择正确的答案。
答案:An agent program implements an agent function.一个智能体程序实现一个智能体函数。
3.There are two main kinds of formulation for 8-queens problem. Which of thefollowing one is the formulation that starts with all 8 queens on the boardand moves them around?有两种8皇后问题的形式化方式。
“初始时8个皇后都放在棋盘上,然后再进行移动”属于哪一种形式化方式?答案:Complete-state formulation 全态形式化4.What kind of knowledge will be used to describe how a problem is solved?哪种知识可用于描述如何求解问题?答案:Procedural knowledge 过程性知识5.Which of the following is used to discover general facts from trainingexamples?下列中哪个用于训练样本中发现一般的事实?答案:Inductive learning 归纳学习6.Which statement best describes the task of “classification” in machinelearning?哪一个是机器学习中“分类”任务的正确描述?答案:To assign a category to each item. 为每个项目分配一个类别。
a and i 摘要和目录a and notb gate a及反b闸a drive a 磁盘驱动器a impliesb gate, negative a及非b闸;负a隐含b闸;负a蕴含b闸a implies,b gate b或非a闸a programming language, apl apl 语言a- conversion a-变换a-bus 主总线a-conversion a-变换a-light a缓存器控制灯a-type addrress constant a型地址常数a/d (analog-to-digital) 模拟对数字转换a/d converter 模拟至数字转换器a/d converter controller 模拟数字转换控制器a/d converter, counter type 计数式模拟数字转换器a/d converter, successive approximation 连续近似模拟数字转换器a/d converter, video 视讯模拟数字转换器a/d interface 模拟-数字接口a/dconverter, charge balancing 电荷平衡模拟数字转换器a/v ready 影音专用硬盘机aadjacent-channel selectivity 邻近道选择性aba 美国银行业协会aba number 美国银行协会数码abacus 算盘abandon 舍弃abbreviated address calling 缩写地址呼号abend dump 异常终止倾印abend exit 异常终止出口abend recovery program 异常终止恢复程序abend, unrecoverable 不可恢复异常终止aberration 像差abilene abileneabkhazian 亚布卡萨文abnormal 不正常abnormal end of task (abend) 异常终止abnormal end of task dump (abend dump) 异常终止倾印abnormal end of task exit (abend exit) 异常终止出口abnormal execution 异常性执行abnormal termination 异常终止abored cycle 中止周期abort 放弃abort function 中止函式abort timer 中断定时器aborted cycle 中止周期about 关于about box 「关于」对话框above 890 decision 高超890决议abrasiveness 研磨性absa, business software alliance 商业软件联盟absolute address 绝对地址absolute addressing 绝对寻址absolute assembler 绝对组合器absolute cell reference 绝对区段参考absolute code 绝对码absolute coding 绝对编码absolute command 绝对指令absolute coordinate 绝对坐标absolute data 绝对数据absolute error 绝对误差absolute expression 绝对表示法absolute instruction 绝对指令absolute loader (absldr) 绝对载入器absolute maximum rating 绝对最大定额absolute order 绝对命令absolute path 绝对路径absolute position 绝对地址absolute positioning 绝对位置absolute reference 绝对参考absolute term 绝对项absolute time 绝对时间absolute value 绝对值absolute value device 绝对值装置absolute value sign 绝对值符号absolute vector 绝对向量absolute-value device 绝对值装置absolute-valuesign 对值符号absorption 吸收absorption current 吸收电流abstract 摘录abstract base class 抽象基底类别abstract class 抽象类别abstract data type 抽象数据类型abstract declarator 抽象宣告子abstract file 摘要档案abstract symbol 摘录符号abstract syntax 抽象语法abstract syntax of sgml sgml的抽象语法abstracting service 摘录服务abstracting, automatic 自动化摘录abstraction 抽象性ac adapter 交流电转接器ac dump 交流电源切断ac erasing 交流抹除ac input module, controller 控制器交流输入模板ac output module, controller 控制器输出模块ac power cord 交流电电源线ac tesi 交流测试ac test 交流测试ac/dc ringing 交流/直流振铃acc area communication controller 区域网管中心accelerated graphic port(agp) 绘图加速连接端口accelerated graphics port (agp) 图形加速端口acceleration period 加速期acceleration time 加速时间accelerator board 加速板accelerator editor 加速键编辑器accelerator key 加速键accelerator mapping 加速键对映accelerator resource 加速键资源accelerator table 加速键对应表accent 重音;声调accent sensitive 区分腔调字accept 接受acceptance test 验收测试access 存取access arm 存取臂access arrangement 存取装置access authority 存取法则access button 存取键access charge 存取费用access code 存取密码access coding, minimal 存取编码access control 存取控制access control field 接达控制字段access date 存取日期access environment 存取设备access function 存取函式access hole 存取孔access key 便捷键access line 存取线access mask 存取屏蔽access mechanism 存取机制access method 存取方法access method routines 存取方法例程access mode 存取模式access path 接达路径access permission 存取许可access permition 存取许可access privileges 存取权限access rate 接取速率access right 存取权限access scan 存取扫瞄;存取搜索access server 存取服务器access site 存取位置access specifier 存取规范access speed 接取速度access time 存取时间access time, address 地址存取时间access time, memory 记忆存取时间access time, ram 随机存取内存存取时间access time, tape 磁带存取时间access will be granted 授与存取access, content-addressable memory 可寻址内容记忆存取access, direct 直接存取access, immediate 实时存取access, instantaneous 立即存取access, multiple 复存取access, parallel 并行存取access, random 随机存取access, remote batch 远距群组存取access, serial 串行存取access, zerc 零存取access-address, second-level address 存取地址;间接地址access-control entry 存取控件 (ace)accessarm 存取臂accessiblity domain 存取范围定义域accessor function 存取子函式accessor type 存取子类别accessories 附件accessory 附件according file 根据档案accordion 手风琴accordion coil 指状线圈account 账号account policy 账号政策account type 账号类型accounting 账号accounting check 账号检查accounting machine 会计机accounting(cama) 集中式自动化通话记帐制accounting-operator number identification(cama-oni)operator 集中式自动化通accumulate(acc) 累积accumulating reproducer 累积复制器accumulator 累加器accumulator (acc) 累积器accumulator (acc) (accum) 累积器 1.一种设计,其可决定一算数accumulator jump instruction 累积器跳越指令accumulator shift instruction 累积器位移指令accumulator, running 流动累积器accuracy 精确度accuracy control character 准确度控制字符accuracy control system 准确度控制系统accurately 准确地acd 自动呼叫分配器acdump 交流撤除acetate base 醋酸纤膜衬底achieved reliability 达成可靠度acia (asynchronous communications interface adapter) 异步通讯接口转接器acia interface signals 异步通讯界面配接器界面信号acia microcomputer control 异步通信接口配接器微算机控制ack n/aack/nak transmission 认可字符/不认可字符传输acknowledge 确认acknowledge character (ack) 认可字符acknowledgment(ack) 确认acl (audit command language) 审核指令语言acm 计算器组织协会acm (association for computing machinery) 计算器器协会acm committee on nomenlature 计算器器术语委员会acoustic coupler 声音耦合器acoustic coupler operation 声音耦合作业acoustic coupler, auto-answer modem 自答型调变解调声音耦合器acoustic coupling 声耦合acoustic delay line 音声延迟线acoustic fingerprinting 声纹辨识技术acoustic level 噪音位准acoustic memory 音响记忆器acoustic modem 音声调变解调器acoustic storage 音响储存体acpi 高等组态与能源界面acquire 取得acquire printer ports 取得打印机连接端口acquisition 收购acronym 首字缩action 作用action cycle 作用周期action line 作用线action message 作用讯息action period 作用周期action provider component 动作提供者组件action query 动作型查询action specification 作用说明action spot 作用点action table 动作表action/adventure 动作/冒险片activate (a block) 启动activate button 触动钮activate object 活化物件activate request 活化要求activate task list 活化工作清单activate this window 活化这个窗口activates 活化activates embedded or linked object 活化内嵌或连结的对象activation 启动activation key 活化金钥activator 活化子active 作用中active area 作用区域active break point 作用断点active card 主动式卡active cell 作用储存格active component 主动组件active content 主动式内容active context handle 主动式内容控制代码active desktop componnet 动态桌面组件active display 主动显示active document 作用中文件active document applications 主动式文件应用程序active document server 主动式文件伺服程序active document support 主动式文件支持active document type 现用的文件型别active document type declaration 现用的文件型别宣告active element 有效组件active file 执行中档案active html documents 主动式 html 文件active hub 主动集线器active line 现役传送线active link 现役无线电传送线路active link type 现用的链接型别active link type declaration 现用的链接型别宣告active master file 现役主档案active master item 现役主项目active matrix display 主动矩阵显示active navigation 主动式导览active program 现役程序active satellite 主动卫星active screen buffer 作用中屏幕缓冲区active server page (asp) 动态伺服页active state 作用状态active station 主动讯号台active terminator 主动式终端器active title bar 作用中窗口的标题列active title bar text 作用中窗口的标题列文字active transducer 主动转换器active window 作用中窗口active window caption color 作用中窗口的标题色彩activex activex技术activity 活性,活动率activity level 活动等级activity loading 活动馈入法activity network 活动网络activity ratio 活动性,活动比率activitylevel 活动位准activityloading 活动馈入法actual address 实际地址actual argument 实质自变量actual data transfer rate 实际数据转移率actual decimal point 实际十进制点actual key 实位键actual parameter list 实质参数清单actual time 实时actual transfer rate 实际传送率actual working time (awt) 实际工作时间actuating signal 动作信号acute 锐角acyclic feeding 非周期性馈送acyclic graph 非循环图ad banner 广告横幅ad impression 广告曝光ad request 广告索阅ad view 广告点选人数ada ada语言ada language structure ada语言结构adapso 美国加拿大数据运作服务协会adaptation layer, aal atm 调节层adapter 适配器adapter (interface card) 适配卡adapter plug 配接器插头adapter, channel 通道配接器adapter, gpib interface 一般用途界面总线配接器adapting, sell 自适态adaptive caching 自适式高速缓存adaptive channel allocation 自适通路分配adaptive control action 自适控制作用adaptive differential pulse code modulation, adpcm 可调式差动博码调变、可适性差分脉冲码调adaptive dithering 拟色adaptive palette 最适化色盘adaptive transversal equalizer 自适截面均衡器adbot software (adware) adwareadc 模拟至数字转换器adc interfacing, systems 系统模拟数字转换接口adc, flash or parallel type 闪电或并行式模拟数字转换器adc, integrating 积体模拟数字转换器adc/mps support hardware 连接adc (模拟数字转换器) 和mps (微处理器系adccp 高等数据通讯控制程序adcon (address constant) 地址常数add 加入add as 加入为add cut line 加入裁切行add device driver 加入驱动程序add existing item 加入现有项目add existing project 加入现有项目add file 附加档案add folder 加入数据夹add item 加入项目add mode 加格式add new 加入新的add new hardware 加入新的硬件add new item 加入新项目add new project 加入新的项目add new solution item 加入新的方案项目add on card 加置卡add operation 加法运算add personal mailbox 新增个人信箱add time 加运算耗时add to 加入到add to output 加入到输出add to solution 加入到解决方案add to storage 加入储存add, boolean 布尔加add, logical 逻辑加add, special 特级加add-in 增益功能add-in memory 添加内存add-ins 加载宏add-on 增添辅助物add-on card 附加卡add-on memories, lsi 大规模集成电路附加记忆add-on program 附加程序add-subtract time 加-减耗时add/remove 新增/移除add/remove program 新增/移除程序added entry 附加入口addend 加数adder 加法器adder (a)(addr) 加法器adder subtracter 加减器adder, analog 模拟加法器adder-accumulator 加法累积器addition 加法addition item 附加项addition operator 加法运算子addition record 增添纪录addition table 加法表addition time, microprocessor 微处理机加算时间addition, destructive 破坏性加法addition, nondestructive 非破坏性加法addition, serial 串行加法addition, zeroaccess 零出入加法additional 额外additional character 附加字符additional header data 额外的标头数据additional materials 额外材料additive attributes 增添属性additive color 投影色彩additive operator 加法类运算子additive process 添加处理address 地址address access time 地址存取时间address alignment 地址列线address book 通讯簿address bus 地址总线address code 地址代码address comparator 地址比较器address computation 地址计算address conflict 地址冲突address constant 地址常数address conversion 地址转换address effective 有效地址address error exception 地址错误例外address field 地址栏address field, dish 磁盘地址栏address format 地址格式address instruction, functional 函数指令地址;功能地址指令address instruction, immediate 实时指令地址address mapping 地址变换address mark 地址符号address marks, disk 磁盘地址符号address mode 地址模式address modes, microprocessor 微处理机地址模式address modification (adm) 地址修改address operand 操作数地址address part 地址部address path, microprocessor 微处理机地址路径address register 地址缓存器address restriction 地址限制address size 地址大小address source, instruction 指令地址源address space 地址空间address space identifier (asid) 地址空间识别符号address stop 地址停止符address storage, display lights 展示讯号地址储存器address system, one-over-one 一超一地址制address trace 地址轨address track 地址磁道address translation 地址转译address translator (at) 地址转译器address, absolute 绝对地址address, actual 实际地址address, arithmetic 算术地址address, base 基地址address, calculated 计算地址address, checking file program 检查档案程序地址address, direct 直接地址address, direct reference 直接参考地址address, dummy 虚假地址address, effective virtual 有效虚地址address, floating 浮动地址address, four 四址address, immediate 实时地址address, indexed 指针地址address, indirect 间接地址address, indirect reference 间接参考地址address, instruction 指令地址address, machine 机械地址address, memory 内存地址address, memory and i/o 内存和输出入地址address, microprocessor 微处理机地址address, multiple 多级地址address, nth-level n级地址address, one plus one 一加一地址address, operand effective 操作数有效地址address, p p地址address, page 页面地址address, presumptive 假定地址address, program counter 程序计算器地址address, q q地址address, reference 参考地址address, regional 区域地址address, register field 缓存器栏地址address, relative 相对地址address, result 结果地址address, second-level 第二级地址address, single 单址address, single-level 单级地址address, specific 特定地址address, symbolic 符号地址address, third-level 第三级地址address, three 三地址address, two 二址address, variable 可变地址address, zero-level 零级地址address-of operator 取址运算子addressability 地址度addressability measure 地址度量度addressable atorage 程控的可定地址储存计算器addressable horizontal position 水平可寻址位置addressable point 可寻址点addressable storage 键盘控制的可定地址储存计算器addressable vertical positions 垂直可寻址位置addressable-pollable terminal 录册地址性终端机addressed location, specific 特定寻址位置addressed memory 寻址记忆器addressee 受讯者addresses of address 地址之寻址addressing 寻址addressing (addr) 寻址addressing capabilities 寻址能力addressing capacity 寻址容量addressing capacity, microprocessor 微处理机寻址容量addressing characters 寻址字符addressing level 寻址等级addressing mode 寻址模式addressing modes 寻址模态addressing modes, instruction 指令寻址模态addressing modes, microprocessor 微处理机定型模态addressing modes, relocatable code 可重寻址码寻址模态addressing types 寻址型式addressing (addr) 寻址addressing, bit set/clear mode 单位元寻址;清除模态寻址addressing, common data bus 共数据总线寻址addressing, deferred 暂位寻址addressing, direct 直接寻址法addressing, disk file 磁盘档案寻址addressing, extended 扩展寻址addressing, file pockets 档案袋寻址addressing, fixed-position 固定位置寻址addressing, hash 初步寻址法addressing, immediate 实时寻址法addressing, indexed 指标寻址addressing, indirect 间接寻址法addressing, inherent 固有寻址;本质寻址addressing, relative 相对寻址addressing, repetitive 重复寻址addressing, self-relative 自我相对寻址addressing, specific 特定寻址addressing, symbolic 符号寻址addressing, three-level 三阶寻址addressing, two-level 二阶寻址addressing, types 寻址型式addressless instruction format 无地址指令格式addresstransiator (at) 地址转译器adi 美国文件协会adis 自动数据交换系统adjacency 字距adjacent 相邻adjacent channel 近信道adjacent domains 邻近区域adjacent link storage image 邻近连接储存映象adjacent nodes 邻近节点adjacent subareas 邻近次区域adjacent-channel interference 邻近通道干扰adjacent-channel selectivity 邻近通道选择性adjust (line end) 调准(行尾)adjust column 调整字段adjust text mode 调准文字模态adjustable extent 可调范围adjustment, character 字符调整administration 管理administration console 管理主控台administrative data processing 行政数据处理administrative operations 行政管理作业administrative support system 行政支持系统administrative system 行政系统administrator 系统管理员administrator account 系统管理员账号adp system 自动化数据处理系统adpe 自动数据处理设备adps 自动数据处理系统adsl 非对称式数字用户线路(asymmetric digital subscriber line) adsl asymmetrical digital subscriber line 非对称数字用户回路adult 成人片advance card technology canada (act canada) 加拿大卡片科技推广促进advance data link controller (adlc) 高等数据连接控制器advanced 进阶advanced communications service (acs) 高等通信服务advanced configuration & power interface(acpi) 高等组态与能源界面advanced configuration and power interface (acpi) 进阶组能与电源界面advanced encryption standard (aes) 高级加密标准advanced encryption standard, aes 先进加密标准advanced information systems (ais) 高等信息系统advanced intellgent network (ain) 高阶智能网络advanced intelligent tape 先进智能型磁带机系统advanced mobile phone service 高等移动电话服务advanced mobile phone service (amps) 先进行动电话服务advanced mobile phone system (amps) 模拟式行动电话系统advanced optical character reader (aocr) 高等感光文字阅读机advanced research projects agency (arpa) 高阶研究计划署advanced television system commission (atsc) 美国先进电视系统委员会advenced graphics port (agp) 加速影像处理端口adventure 冒险片advertising 广播advisory committee 中文界面谘询委员会advisory committee on code of practice for recognized certification authorities认advisory committee [gac] 互联网域名及规约编号指配组织辖adx 自动数据交换aed 自动工程设计系统aerial 天线aerial cable 架空电缆afar 阿法文afips 美国信息处理协会联盟afr 自动格式组织afrikaans 南非荷兰文after service 售后服务after-image 余像agenda 议程agent 代理程序aggregate 汇总aggregate expression 聚合表示aggregate field 汇总数据域位aggregate function 汇总函式aggregate object 汇总物件aggregate point of presence with gigabit capacity giga传输汇集点aggregate query 汇总查询aggregate type 汇总类型aggregation 汇总agument transfer instruction 参数转移指令ai 人工智能ai, artificial intelligence 人工智能,人工智能aida aida法则aifc 声音文件格式aiming circle 标的圈aiming field 标的场aiming symbol 标的符号airbrush 喷枪airbrushed strokes 喷枪笔画airline reservation system 航空订位系统ais n/aait﹒另类aix 高阶交谈式作业系列al 汇编语言alarm 警示alarm display 警报显示器alarm systems, microprocessor 微处理机警报系统alarm, audible 音响警报(器)alarm-repeated transmission 警报复送albanian 阿尔巴尼亚文album 相簿ald n/aalerting (alerting signal) 警示讯号alertor 警报器algebraic expression 代数表示algebraic expression manipulation statement 代数表示操作陈述algebraic language 代数语言algebraic manipulation 代数操作algebraic sign conventions 代数符号规则algol algol程序语言algol (algorithmic language) 奥高(算法语言)algol 10 奥高10语言algol 68 奥高68语言algorithm 算法algorithm convergence 算法收敛性algorithm, programming 程序设计算法algorithm, scheduing 排程算法algorithm, transfer 转移运算法algorithm, translation 翻译算法algorithmic 算法的algorithmic language 算法语言algorithmic routine 演算例程alias 别名alias name 别名aliasing 别名align 对齐align center 置中对齐align left 靠左对齐align right 靠右对齐align text 对齐文字align to grid 贴齐网格线alignment 排列alignment pin 调整脚alignmentpin 调整脚all 算术逻辑单位all files 所有档案all purpose computer 全能计算机;全方位计算机all types 所有类型all-number calling (anc) 全数目呼叫all-number calling(anc) 全数目呼叫all-source analysts 全资源分析师allocate 分派allocation unit 配置单位allocation, dynamic-storage 动态储存配置allocation, resource 资源配置allocation, storage 储存配置allocator 分派器allotting 取位选择allow 允许almador almador芯片组aln 高阶智能网络alpha αalpha channel alpha 色板alpha cpu alpha 微处理器alpha flux α通量。
周期时变布尔网络的完全同步化韩吉;张化光;田辉【摘要】This paper mainly investigates the complete synchronization of two Boolean networks (BNs) coupled uni-directionally in the drive-response configuration, where the drive BN is periodically time-variant. We discuss it in two cases under the algebraic framework of logical systems. For each case, a necessary and sufficient criterion for complete synchronization is presented. Accordingly, two general design approaches to a synchronizing response BN are developed. Finally, numerical examples are given in order to illustrate the effectiveness of our results.%本文主要研究了驱动–响应结构下的布尔网络的完全同步化,其中驱动系统是一个周期性时变的布尔网络。
对于上述问题,本文基于逻辑系统的代数形式下分两种情况讨论。
对于每种情况,都将给出一个完全同步的充要条件。
相应地,提出了两个响应布尔网络的同步化方案。
最后,通过一些数值例子来说明本文结果的有效性。
【期刊名称】《控制理论与应用》【年(卷),期】2016(033)007【总页数】7页(P863-869)【关键词】布尔网络;周期性时变布尔网络;完全同步【作者】韩吉;张化光;田辉【作者单位】东北大学信息科学与工程学院,辽宁沈阳110819;东北大学信息科学与工程学院,辽宁沈阳110819;东北大学信息科学与工程学院,辽宁沈阳110819; 河南理工大学数学与信息科学学院,河南焦作454000【正文语种】中文【中图分类】TP273Boolean network was first introduced by Kauffman in 1969.Ithasbeen w idely used inmodeling complex systems such as gene regulatory networks,biological evolutionmodelsand neuralnetworks.Ateach discrete timepoint,every node ina BN can takeoneof two binary values,1 or0,where 1means that the node isactive and 0 inactive.Every nodeupdatesstate on thebasisof a logical relationship with the form of a Boolean function.Although themodelsof BNsare very simple,they can describe basic dynam ic behavior ofmany realsystemsand provide useful information.Therefore,lotsof issuesaboutBNshave been investigated such asstability,controllability,optimal controland so on[1-6].As we know,the synchronization problem of systemshasbeen attractingmany researchers from various fields,see[7-9].The complete synchronization of BN-swhich can be equivalently transformed into the linear discrete-time systemsby utilizing thesem i-tensorproduct(STP)[10]also caused a lot of attention and many results were provided.For example,a necessary and sufficientcriterion forcompletesynchronizationof BNs wasprovided in[11],ageneralapproach for the design of a response BN was given in[12]and the synchronization problem of BNswithsome special cases such asdifferentupdate,time-delay and output-coupledwere investigated in[13-16],respectively,and so on.Most of researchers just considered the situation that the BNs were time-invariant Boolean networks(TIBNs),while the synchronization problem of timevariantBoolean networks(TVBNs)was rarely studied. TVBNs havemany essential properties different from TIBNs.Asa specialcaseof TVBNs,periodically timevariantBoolean networks(PTVBNs)can beused to describemany systems such as the sw itched BNswhich have periodical sw itching signals[17],the Boolean con-trol networks(BCNs)which have dynam ical control lers[18],the perturbed BNswhich have periodical function perturbations[19],and so on.Therefore,the study of synchronization of PTVBNs is significant.A lthough the problem of PTVBNs have been studied in few papers[20-21],the problem of complete synchronization of PTVBNshas notbeen solved well.This is themotivation of our paper.In this paper,we investigate a special case of the complete synchronization problem for two BNs that the drive BN isperiodically time-variant.At first,we study the cycles of PTVBNs and provide some special propertieswhich never exist in the cycles of TIBNs.Then,according to these properties,the PTVBNs are divided into two categories.A fter that,the synchronization problemsaresolved forboth two categoriesby utilizing STPand the results are turned out to be quite different from each other.At last,two examples for both categories are provided to support our points.Themajor contributions of this paper:1)provide two necessaryand sufficient criteria for complete synchronization of PTVBNs;2)make two design approaches to a synchronizing response BN,which can complete synchronize with the drive BN in finite steps.Thispaper isorganized as follows.Problem formulation and some prelim inariesaregiven in Section 2.In Section 3,the periodically time-variant drive Boolean network is discussed in two casesand some criteria for completesynchronization and somegeneralapproaches for the design of a synchronizing response BN are provided.Two numericalexamples are given in Section 4 and a conclusion isdrawn in Section 5.First,we give some notations.1)N represents thesetofnon-negative integers,N+represents the setof positive integersand N[λ1,λ2]represents thesetof integersfromλ1toλ2whichmeans that N[λ1,λ2]={λ1,λ1+1,………,λ2}.2)In∈Rn×nrepresents the identity matrix,represents the i-th column of In.3)∆nrepresents the set of,where i=1,2,………,n.4)ε(x)represents a bijection from∆2nto N[1,2n]such that5)Col(A)represents the setof all columns of A,where A∈Rm×n.6)B=]iscalled a logicalmatrix and its shorthand form is7)Φnrepresents a logicalmatrix such thatConsider two BNswith n nodes respectively coupled unidirectionally in the drive-response configurationwhereσ(t)=t%p+1 is a periodic function with period p,t%p represents the remainder of t/p,ϕ(t)is a function from N to N+,the xiandyirepresent the nodesof the drive BN and response BN,respectivelyandrepresentthe Boolean functions from{1,0}nto{1,0}and from{1,0}2nto{1,0}forevery i∈N[1,n],j1∈N[1,p]andj2∈N+,respectively.Themainmathematical toolof thispaper is the STP,which is a generation of conventionalmatrix product. Sincemostproperties of the conventionalmatrix product remain true under STP,the product of this paper is usually considered as STP if there is no confusion. By[22],the Boolean values1 and 0 can be equivalently transformed into the vectors=(1,0)Tand=(0,1)T,respectively.Take x(t)=x1(t)x2(t)………xn (t)and y(t)=y1(t)y2(t)………yn(t),then BNs(1)and(2)are equivalent to the follow ing discrete-time systems:where Fσ(t)∈ L2n×2nand Gϕ(t)∈ L2n×22nare the structurematricesof BNs(1)and(2),respectively.For convenience,let x(t,x(0))represent the trajectory of the drive BN(1)with initial state x(0)∈{1,0}nand y(t,x(0),y(0))be the trajectory of the responseBN(2)under the drive trajectory x(t,x(0))with the initial state y(0)∈{1,0}2n.Let the columnsof Fσ(t)and Gϕ(t)beand,respectively, whichmeans thatThe complete synchronization of BNs(1)and(2)is defined as follows. Definition 1 BNs(1)and(2)are completely synchronized if there is a positive integer k such that y(t,x(0),y(0))=x(t,x(0))forall x (0),y(0)∈∆2nand any t≥k.Because the complete synchronization for BNs is closely related to the attractors(including the fixed pointand cycles),we provide an introduction to the cyclesof PTVBNs.Definition 2[20] A state x0∈ ∆2nis called afixed point of BN(1)if Fσ(t)x0=x0for any t≥0. A sequence{x(0),x(1),………,x(t),x(t+1),………}is called a cycle of BN(1)with length l if:1)x(t+l)= x (t)for any t≥0;2)for any 0<T<l,there is a positive integer e t such that x(e t+T)/=x(e t).In this paper,the periodic sequence{x(0),x(1),………,x(t),x (t+1),………}which is a cycle of BN(1)with length l isdenoted by where˜x(l)=x(0)and˜x(i)=x(i)for every i∈N[0,l-1].Forany t≥0,we call x(t)in thiscycle ifand only if x(t)=˜x(t%l).For the cycles of PTVBNs,the follow ing Lemma can be obtained. Lemma 1 For BN(1),there isa positive integer k such that x(k)is in one of the cycles of BN(1)for every x(0)∈∆2nand any t≥k.Proof Take F =Fσ(p-1)Fσ(p-2)………Fσ(0),we have asasubsystem of BN(3).Becauseof the infinitenessof the state space,for any x(0)∈∆2n,there are positive integers k and l such thatis one cycle of BN(7)for any t′≥k.It can be found thatisa cycleof BN(3).So the proof is completed.Suppose thatBN(1)has s cycles represented asAccordingly,define a setC={x|x∈∆2n,there exist i∈N[1,s]andAbout the cyclesof PTVBNs,two casesneed to be introduced.1)There is x∈C which appears several times in a period of acycle.Forexample,considera PTVBN with period 2 and= δ2[2,1].Thenisa cyclewith length 4,it can be found thatandboth appear tw ice in a period of thiscycle.2)There is x∈C which is inmore than one cycle. Forexample,letbe a PTVBN with period 2 and F1= δ4[2,3,1,2],F2= δ4[2,4,3,1].Thenis in two cycles of thisDefine a subsetof C as follows:It can be found that C′= ∆2in BN(12)and C′=,}in BN(13),respectively.Therefore,C′isnot alwaysan empty set.Sowe divide complete synchronization problem for BNs(1)and(2)into two cases:1)C′=∅;2)C′/=∅.3.1 Case1:C′=∅Because C′=∅,consider the candidate response BN(2)asa TIBN.Then equation(6)is rew ritten asTherefore,the candidate response BN can be described as follows:Then by equations(3)(5)(15)and(16),wehavewhereThen the follow ing theorem can beobtained.Theorem 1 Assume C′=∅,where C′isdefined in(14).BNs(1)and(2)are completely synchronized if and only if there isanon-negative integerk≤22n suchthatwhere p is the period of BN(1),Θ[0]=I22nandProof Sufficiency.According to equation(17),we haveBy Theorem 2 in[13],x(t)=y(t)for every x(0),y(0)∈∆2nif and only if Col(Θ[t]).For any t≥kp+1,there exist j∈N[1,p]and k′∈N such that t=kp+j+k′p.Meanwhile, it can be found that,whereΘθ=Θp).ThenwehaveObviously,the follow ing equation isalso true:By utilizing equations(19)(21)and(22),we haveTherefore,x(t)=y(t)for every x(0),y(0)∈∆2nand anyt≥kp+1.Thismeans the complete synchronization of BNs(1)and(2). Necessity.By Definition 1,if BNs(1)and(2)are completely synchronized,there is a positive integer k′such that x(t)=y(t)for every x(0),y(0)∈∆2nand any t≥k′.Hence,one can obtainThen,by equation(23),take a positive integer k such that kp+1≥k′,then equation(19)holds.By[22],thereexistpositive integers r1<r2≤22nsuch that,whichmeans thatfor anyτ≥0.So the BNs(1)and(2)can not be completely synchronized if there exist integers k′>22np such that.Therefore,wehave k′≤22np and k≤22n.The proof is completed.For case1,letusprovidean approach for the design of a synchronizing response BN.Theorem 2 Assume C′=∅,the response BN(2)completely synchronizeswith the drive BN(1)ifProof By Lemma 1,there is a positive integer k such that x(t)=(j)is in one cycleof BN(1)forevery x(0)∈∆2nand any t≥k.By equations(16)-(18),for every y(0)∈∆2n.By(24),we have y(t+1)=(j+1)=x(t+1).Therefore,y(t)=x(t)forevery x(0),y(0)∈∆2nand any t>k. The proof is completely.3.2 Case2:C′̸=∅In order to get themain results,we give a lemma first.Lemma 2 There is no TIBN such that it completely synchronizeswith BN(1)if C′/=∅.Proof We prove itby reduction to absurdity.Assume that BN(2)is a TIBN and completely synchronizeswith BN(1).By Definition 1,there is a positive integer k1such that y(t,x(0),y(0))=x(t,x(0))for every x(0),y(0)∈ ∆2nand any t≥ k1.BecauseC′/= ∅,there exists x0∈ C such that(j1)=)for someandTake x(0)=(0),wehavefor any k2≥0.Take k2such that k2li1≥k1,we can obtainBy equation(18),thismeans thatSim ilarly,take x(0)=(0),we can getBecauseε(x)is a bijection,we haveε(j1))= ε(j2))andε(j1+1))/=ε(j2+1)).Then the follow ing equationshold:Equations(31)and(32)lead to a contradiction.Therefore,the proof is completed.By Lemma 2,only TVBN is the candidate thatcan completely synchronizewith BN(1)in Case 2.By equations(3)-(6)we havewhereRemark 1 Ifϕ(t)is not a periodic function,may notbe periodically time-variant.In this case,becomesquite complex andwe can hardly provide aregular conclusion.Therefore,ϕ(t)is just considered as a periodic function.Remark 2 By Definition 1 and Lemma 1,if BNs(1)and(2)are completely synchronized,itmustsatisfyBecause C′̸=∅,there exist(j1),(j2)in the cycles of BNs(1)such that(j1)=(j2)(j1+1)̸=(j2+1)andσ(j1)̸=σ(j2).Therefore,if theequality(35)holds forBN(1)in case 2,itmust satisfy condition(1):for any j1,j2∈N,ifσ(j1)̸= σ(j2),thenϕ(j1)̸= ϕ(j2).By Remark 1,take ϕ(t)=t%q+1,where q is the period ofϕ(t).Then condition(1)is equivalent to condition(2):for any j1,j2∈N,if j1%p̸=j2%p,thenj1%q̸=j2%q.It can be found that condition(2)holds if and only if q=m p,where m∈N+.This conclusion can be proved by utilizing the properties of integer and Euclidean algorithm.By Remark 1 and Remark 2,we just considerϕ(t)=t%(m p)+1 inCase2.Then the follow ing theorem can beobtained.Theorem 3 Assume C′/=∅,BNs(1)and(2)are completely synchronized if and only if there is a non-negative integer k≤22nsuch thatwhere m p is the period of BNs(2),=I22nandfor any t>0.The proof issim ilar to Theorem 1.Weprovidean approach for thedesign ofasynchronizing response BN. Theorem 4 BNs(1)and(2)are completely synchronized in Case 2 ifThe proof issim ilar to Theorem 2.Remark 3 Obviously,a TIBN can be treated as a PTVBN with period m p such that Gϕ(t)≡G.Therefore,no matterwhich case PTVBN(1)with theperiod of p belongs to,thereexistsa PTVBN with the period of mp to completely synchronizewith it forany m∈N+.4.1 Example for Case1Givea drive BN as follows:Now,let us design a response BN to completely synchronizewith BN(38)by using Theorem 2.It can be obtained that F1= δ4[3,4,2,3],F2=δ4[2,1,1,4]and the period is p=2.The cycle of(38)is C:.According to Theorem 2,takeandcan be chosen arbitrarily.Forexample,takeTherefore,thestructurematrix of the designed response BN isBy using the technique provided in[22],the logical equations for the designed response BN areTake x(0)=(1,0)and y(0)=(0,0).The Hamm ing distance H(t)=|x1(0)-y1(0)|+|x2(0)-y2(0)| versus the time t is plotted in Fig1.By Fig 1,these two BNsare completely synchronized from the fourth step.4.2 Exam p le for Case2Considera drive BN asLetusprovide the response BNs to completely synchronize with BN(39)by utilizing Theorem 4.It can be obtained that F1= δ4[1,4,2,3],F2= δ4[2,3,1,2]and the period is p=_2.The cycles of(39)are C1:and1)Consider theperiod of the response BN q=p= 2.By Theorem 4,take andcan be chosen arbitrarily in{1,2,3,4}. For example,takeThen we can obtain the structurematrix of the designed response BNand the logicalequations for the designed response BN areTake x(0)=(0,0)and y(0)=(0,1).The Hamm ing distance H(t)=|x1(0)-y1(0)|+|x2(0)-y2(0)| versus the time t isplotted in Fig 2.By Fig 2,these two BNsare completely synchronized from the fifth step. 2)Consider the period of the response BN q=2p =4.By Theorem 4,take Then we can obtain the structurematrix of the designed response BNand the logicalequations for the designed response BN areTake x(0)=(0,0)and y(0)=(0,1).The Hamming distance H(t)=|x1(0)-y1(0)|+|x2(0)-y2(0)| versus the time t is plotted in Fig 3.By Fig 3,these two BNsare completely synchronized from the third step. In this paper,we have studied the problem of complete synchronization for two BNs,which are coupled unidirectionally in a drive-response configuration and the drive BN is a PTVBN.Because the structure of PTVBN ismore complex than TIBN’s.The dri ve BN has been considered in two different kinds.We have provided thenecessary and sufficiency criteria for complete synchronization,and general approaches for the design of a response BN for both kinds,respectively. Some numerical examples have been given to support these viewpoints.In the future work,we w ill investigate the complete synchronization of PTVBNs with time-delay and output-coupled.[1]LIH,WANG Y,LIU Z.Stability analysis for sw itched Boolean networks under arbitrary sw itching signals[J].IEEE Transactions on Automatic Control,2014,59(7):1978-1982.[2]LI F,SUN J.Controllability and optimal control of a temporal Booleannetwork[J].Neural Networks–-the Official Journal of the InternationalNeuralNetwork Society,2012,34(4):10-17.[3]CHENH,LIX,SUN J.Stabilization,controllability and optimalcontrolof Boolean networkswith impulsive effectsand state constraints[J].IEEETransactionson Automaic Control,2015,60(3):806-811.[4]ZHAO Y,LIZ,CHENG D.Optimal control of logical controlnetworks[J].IEEE Transactions on Automatic Control,2011,56(8):1766-1776.[5]FORNASINIE,VALCHERM E.Optimalcontrolof Boolean control networks[J].IEEE Transactionson Automatic Control,2014,59(5):1258-1270.[6]TIAN H,WANG Z,HOU Y,et al.State feedback controller design for synchronization ofmaster-slave Boolean networksbased on core input-state cycles[J].Neurocomputing,2016,174(22):1031-1037.[7]ZHANG H,ZHANG J,YANG G,etal.Leader-based optimal coordination control for the consensusproblem ofmulti-agentdifferential games via fuzzy adaptive dynam ic programm ing[J].IEEE Transactionson Fuzzy Systems,2015,23(1):152-163.[8]ZHANGH,MA T,HUANG G,etal.Robustglobalexponentialsyncrhonization of uncertain chaotic delayed neural networks via dualstage impulsive control[J].IEEE Transactionson SystemsMan and Cybernetics PartB-Cybernetics,2010,40(3):831-844.[9]ZHANG H,HUANGW,WANG Z,etal.Adaptive synchronization between two differentchaotic systemswith unknown parameters[J]. Physicsletter A,2006,350(5/6):363-366.[10]QIH,CHENGD.Analysisand controlof Boolean networks:a sem itensorproductapproach[C]//Asian ControlConference.Hong Kong:IEEE,2009,8:1352-1356.[11]LIR,CHU plete synchronization of Boolean networks[J]. IEEE Transactionson NeuralNetworksand Learning Systems,2012,23(5):840-846.[12]LIR,YANG M,CHU T.Synchronization design of Boolean networks via the sem i-tensor productmethod[J].IEEE Transactionson NeuralNetworksand Learning Systems,2013,24(6):996-1001. [13]ZHANGH,WANG X,LIN X.Synchronization of Boolean networks with different update schemes[J].IEEE Transactions on Computational Biology and Bionformatics,2014,11(5):965-972.[14]LI R,YANG M,CHU T.Synchronization of Boolean networks with time-delays[J].Applied Mathematics and Computation,2012,219(3):917-927.[15]ZHONG J,LU J,LIUY,etal.Synchronization inanarrary ofoutputcoupled Boolean networkswith time delay[J].IEEETransactionson NeuralNetworksand Learning Systems,2014,25(12):2288-2294. [16]LIR,CHU T.Synchronization in an arrary of coupled Boolean networks[J].Physics Letters A,2012,376(45):3071-3075.[17]LI H,WANG Y.On reachability and controllability of sw itched Boolean control networks[J].Automatica,2012,48(11):2917-2922.[18]CHENG D.Input-state approach to Boolean networks[J].IEEETransactionson NeuralNetworks,2009,20(3):512-521.[19]XIAO Y,DOUGHERTY E R.The impact of function perturbations in Boolean networks[J].Bioinformatics,2007,23(10):1265-1273. [20]ZOU Y,ZHU J.Cyclesofperiodically time-variantBoolean networks [J].Automatica,2015,51:175-179.[21]ZHANG H,TIAN H,WANG Z.Synchronization analysis and design of coupled Boolean networks based on periodic sw itching sequences[J].IEEE Transactions on Neural Networks and Learning Systems.2015,DOI:10.1109/TNNLS.2015.2499446.[22]CHENG D,QIH.A linear representation of dynamics of Boolean networks[J].IEEETransactionson Automatic Control,2010,55(10):2251-2258.韩吉(1988-),男,博士研究生,目前研究方向为布尔网络、多智能体,E-mail:*****************;张化光(1959-),男,教授,博士生导师,目前研究方向为智能控制、近似动态规划、复杂网络建模与控制、分布式控制等,E-mail:****************;田辉(1980-),男,博士研究生,讲师,目前研究方向为逻辑动态系统和网络演化博弈,E-mail:*******************.cn.。
HUAWEI AC6605-26-PWRAccess Controller DatasheetCopyright © Huawei Technologies Co., Ltd. 2013. All rights reserved.No part of this document may be reproduced or transmitted in any form or by any means without prior written consent of HuaweiTechnologies Co., Ltd.Trademark Notice, HUAWEI, and are trademarks or registered trademarks of Huawei Technologies Co., Ltd.Other trademarks, product, service and company names mentioned are the property of their respective owners.General DisclaimerThe information in this document may contain predictive statements including,without limitation, statements regarding the future financial and operating results,future product portfolio, new technology, etc. There are a number of factors thatcould cause actual results and developments to differ materially from thoseexpressed or implied in the predictive statements. Therefore, such information isprovided for reference purpose only and constitutes neither an offer nor an1The Huawei AC6605-26-PWR access controller(AC) delivers secure network access with advancedmanagement features for campus, industrial, andmedium- to large-scale enterprise networks. Thishigh-performance AC integrates 1,000 M Ethernetswitch functionality for both wired and wireless accesscontrol and also works well for extending hotspotcoverage. When used with Huawei Premium SeriesAPs, Enhanced Series APs, and Standard Series APs, theAC6605-26-PWR delivers a flexible network solutionthat is easy to install and maintain at an attractiveprice.Advanced Network FeaturesThe Huawei AC6605-26-PWR provides AP connectionand control for medium- to large-size enterprise andcampus networks. The Huawei AC6605-26-PWR offersthese features:licenses for managing multiple APs•128 Gbit/s switching capacity•Compatibility with 802.11a/b/g/n•PoE power supply for up to 24 interfaces•Flexible networking and forwarding•Comprehensive user policy management and•authorization controlCentralized authentication and distributed•forwardingSecure and reliable N+1 backup•Centralized AP management and maintenance•Integrated WLAN management•Multiple interface support2 10-GE optical interfaces•24 GE and 4 GE combo interfaces•1 RJ-45 serial maintenance interface•1 RJ-45 network maintenance interface•1 mini-USB serial maintenance interface•Large-capacity, high-performance designwith proven reliabilityConnections for up to 512 APs•Backplane capacity of 128 Gbit/s with non-blocking•data switching supportPort backup using Link Aggregation Control•Protocol (LACP) or Multiple Spanning Tree Protocol(MSTP)Dual, hot-swappable AC/DC power supplies•Easy to install and easy to maintainConvenient size ( 442 mm×420 mm×43.6 mm):•small enough to fit a standard cabinetPower supplies are hot swappable•Boolean port support for environmental monitoring•and intra-board temperature probes, which monitorthe operating environment of the AC in real timeDynamic energy managementLow-noise fans, which dynamically adjust to load•changes to keep equipment noise and powerconsumption lowAutomatic power-saving mode, which engages•during idle operation (when no peer device isconnected)Highly integrated, energy-saving design, which•provides even higher performance and lower powerconsumption when coupled with an intelligentdevice management systemeSightmanagementService accessUser layerInternetAggregation switchAC6605L2 switchHUAWEI AC6605-26-PWR Access Controller DatasheetHUAWEI AC6605-26-PWR Access Controller Datasheet 2HUAWEI AC6605-26-PWR Access Controller Datasheet3HUAWEI AC6605-26-PWR Access Controller Datasheet4Chain NetworkingIn chain networking, APs or access switches directly connect to the AC6605. The AC6605 functions as both an AC and an aggregation switch to forward and process data and management services for the APs.In chain networking scenarios, the AC6605 sets up CAPWAP tunnels with APs to con figure and manage these APs. Service data of wireless users can be forwarded between APs and the AC6605 over CAPWAP data tunnels or be directly forwarded by APs.The AC6605 has a wired switching unit with powerful access, aggregation, and switching capabilities. Direct forwarding is often used in chain networking scenarios. This networking mode simpli fies network architecture and isused with large-scale and centralized WLANs.eSightInternetAggregation switchAC6605L2 switchWDS and Mesh NetworkingWDS and MESH networking are used to expand wireless coverage areas for outdoor deployments.NetworkAC6605MESHWDSswitchService management layerService access layerUser layerWireless Distribution Systems (WDS) and Mesh networks use a distributed network of APs. The WDS and Mesh networks connect to an AC through a switch, and the AC connects to the network through a network device, such as a gateway or an aggregation switch. The WDS and Mesh connect to user stations (STAs).HUAWEI AC6605-26-PWR Access Controller Datasheet5HUAWEI AC6605-26-PWR Access Controller Datasheet6AC6605-26-PWR Speci ficationsHUAWEI AC6605-26-PWR Access Controller Datasheet7HUAWEI AC6605-26-PWR Access Controller Datasheet8HUAWEI AC6605-26-PWR Access Controller Datasheet9HUAWEI AC6605-26-PWR Access Controller Datasheet10Wired featuresAC6605-26-PWR purchase and accessoryinformation。
转发信息库[hw] Forward Information Base傅里叶变换[hw] Fourier Transform帧标[hw] frame preamble成帧,帧形成,帧定位[hw] framing自由软件[hw] freeware网关控制协议[hw] gateway control protocol组件、群件[hw] groupware高级数据链路控制(规程)[hw] High-level Data Link Control跳,步跳[hw] hop整数倍[hw] integer multiple; integral multiple内部网关协议[hw] Interior Gateway Protocol国际移动用户识别码[hw] International Mobile Subscriber Identity因特网控制报文协议[hw] Internet Control Message Protocol因特网工程师任务组[hw] Internet Engineering Task Force因特网密匙交换协议[hw] Internet Key Exchange protocol调用[hw] invokeIP包[hw] IP packet借用IP地址[hw] IP unnumbered链接调用[hw] Linked Invoke地点[hw] locale必选定长部分[hw] mandatory fixed part媒体接入控制[hw] Media Access ControlMPLS垫层[hw] MPLS shim多链接点到点协议(PPP协议),多链路PPP捆绑[hw] Multilink PPP 多协议标记交换[hw] Multiprotocol Label Switching线路适应能力[hw] network adaptability网络控制协议[hw] Network Control Protocol网络接口栓[hw] Network Interface Tap网管中心[hw] Network Management Center节点[hw] node一号通[hw] One Number Link You报文[hw] packet基于SDH/SONET的报封装[hw] Packet Over SONET/SDH净荷类型[hw] Payload Type对等网络[hw] peer network对等网络[hw] peer-to-peer network永久虚通路、永久虚拟通道[hw] Permanent Virtual Channel相位[hw] phase物理媒介子层[hw] Physical Medium sub-layer明文[hw] plain text点到点协议[hw] Point-to-Point Protocol电源线、电线、电源电缆[hw] power cable原始基准时钟[hw] Primary Reference Clock原语[hw] Primitive通信领域专业词汇中英文对照产品激活[hw] Product Activation运营商边缘[hw] Provider Edge总串口配置模式[hw] pseudo-serial configuration mode公共路由封装协议[hw] Public Routing Encapsulation公用软件/无版权软件[hw] public-domain softwareR2信令, (中国)一号信令;产品目的地国家的随路信令[hw] R2 signaling随机存取[hw] random access随机早期检测[hw] Random Early Detection冗余位[hw] redundancy bit远端用户拨入鉴权服务[hw] Remote Authentication Dial in User Service路由管理中心[hw] Router Management Center路由反射器[hw] router reflector路由信息协议[hw] Routing Information Protocol密钥[hw] secret key分段/重装[hw] Segmenting/reassembling观看本地图像[hw] selfview/view outgoing video顺序存取[hw] sequential access业务中心[hw] Service System会话[hw] session共享软件[hw] shareware七号信令[hw] Signaling System Number 7单个联系客体[hw] Single Association Object小型计算机系统接口[hw] Small Computer Systems Interface软件许可证[hw] software licensing水平分割更新[hw] split-horizon updates间谍软件[hw] spyware独立(式)[hw] stand-alone交换多兆比特数据业务[hw] Switched Multi-megabit Data Service交换虚电路[hw] Switched Virtual Circuit暂时信令连接[hw] temporary signaling connections终端访问控制器控制系统协议[hw] Terminal Access Controller Access Control System 令牌环网[hw] token ring network流量整形[hw] Traffic Shaping通用类[hw] Universal通用串行总线[hw] Universal Serial Bus用户数据包协议[hw] User Datagram Protocol低码率通信视频编码[hw] video coding for low bit rate communication虚通路标识[hw] Virtual Channel Identifier虚电路[hw] Virtual Circuit虚拟私有数据网络[hw] Virtual Private Data Network静电复印机[hw] xeroxSNMP团体[hw] SNMP communitySNMP团体名[hw] SNMP community name接入[hw] access“(全部)”级别[hw] (All) level操作类别(4类) [hw] 4 classes of operations缩位拨号[hw] Abbreviated Dialling记帐卡呼叫[hw] Account Card CallingActiveX 数据对象[hw] ActiveX Data ObjectsActiveX 数据对象(多维)[hw] ActiveX Data Objects (Multidimensional) 增强智能外设[hw] Advanced Intelligent Peripheral计费通知(计费)[hw] Advice of Charge (Charging)计费通知(信息)[hw] Advice of Charge (Information)“全部”成员[hw] All member)美国国家标准学会[hw] American National Standards InstituteANSI 到OEM 转换[hw] ANSI to OEM conversion模拟显示业务接口服务器[hw] Analogue Display Service Interface server 分析服务器[hw] Analysis serverAPI 服务器游标[hw] API server cursor应用上下文[hw] Application Context应用上下文协商[hw] Application Context Negotiation应用实体[hw] Application Entity应用实体调用[hw] Application Entity Invocation应用接口模块[hw] Application Interface Module应用编程接口[hw] Application Programming Interface应用协议数据单元[hw] Application Protocol Data Unit应用业务单元[hw] Application Service ElementASCII码[hw] ASCII character话务员[hw] Attendant鉴权中心[hw] Authentication Centre鉴权码[hw] Authorization Code被叫确认付费[hw] Auto Collect Call自动更换记帐[hw] Automatic Alternative Billing自动回呼[hw] Automatic Call Back自动呼叫分配器/ 排队机[hw] Automatic Call Distributor自动语音识别[hw] Automatic Speech Recognition接入信道[hw] access channel接入码[hw] access code接入时延[hw] access delay接入功能[hw] access function精确度[hw] accuracy证实消息[hw] acknowledge/acknowledgement message操作[hw] action激活[hw] activation激活的移动台[hw] active MS活动语句[hw] active statement特殊连接器名称[hw] ad hoc connector name加载项[hw] add-in附加设备(辅助实体)[hw] adjunct代理[hw] agent聚合函数[hw] aggregate function聚合查询[hw] aggregate query聚合[hw] aggregation聚合前缀[hw] aggregation prefix聚合包装[hw] aggregation wrapper警报[hw] alert提醒方式[hw] alerting pattern别名[hw] alias命名别名[hw] aliasing祖先[hw] ancestor批注属性[hw] annotational property匿名订阅[hw] anonymous subscription应用程序角色[hw] application role应用[hw] applications存档文件[hw] archive file参数条款[hw] argument clause项目[hw] article资产定位[hw] asset location资产跟踪[hw] asset tracking资产状况显现[hw] asset visualization辅助SSF [hw] assisting SSF原子的[hw] atomic特性[hw] attribute身份验证[hw] authentication授权[hw] authorization自动恢复[hw] automatic recovery独立[hw] autonomy轴[hw] axis禁止所有入局呼叫[hw] Barring of All Incoming Calls禁止所有出局呼叫[hw] Barring of All Outgoing Calls漫游时,禁止入局呼叫[hw] Barring of Incoming Calls when Roaming Outside the Home PLMN Country禁止国际出局呼叫[hw] Barring of Outgoing International Calls禁止所有除归属国PLMN外的国际出局呼叫[hw] Barring of Outgoing International Calls except those directed to the Home PLMN Country基站控制器[hw] Base Station Controller基站控制器区域[hw] Base Station Controller (BSC) area基站收发信台[hw] Base Transceiver Station基本呼叫处理[hw] Basic Call Process基本呼叫状态模型[hw] Basic Call State Model基本速率接口[hw] Basic Rate Interface布尔型[hw] Boolean备份[hw] backup备份设备[hw] backup device备份文件[hw] backup file备份媒体[hw] backup media备份集[hw] backup set均衡层次结构[hw] balanced hierarchy基本数据类型[hw] base data type基表[hw] base table基本呼叫[hw] basic call批处理[hw] batchbcp 文件[hw] bcp filesbcp 实用工具[hw] bcp utility取缺省值…… [hw] be defaulted to互斥的[hw] be mutually exclusive承载控制[hw] bearer control承载业务[hw] bearer servicebinary 数据类型[hw] binary data type二进制大对象[hw] binary large object捆绑[hw] bind绑定[hw] bindingbit 数据类型[hw] bit data type按位运算[hw] bitwise operation块[hw] blocks边界网关[hw] border gateway浏览模式[hw] browse mode缓存的[hw] buffered内置函数[hw] built-in functions业务规则[hw] business rulesCAMEL业务环境[hw] CAMEL Service EnvironmentCAMEL签约信息[hw] CAMEL Subscription Information呼叫控制接入功能实体[hw] Call Control Agent Functional Entity呼叫控制功能[hw] Call Control Function呼叫控制功能实体[hw] Call Control Functional Entity呼叫偏转[hw] Call Deflection呼叫详细记录[hw] Call Detail Record呼叫分配[hw] Call Distribution呼叫前转[hw] Call Forwarding遇忙呼叫前转[hw] Call Forwarding on Mobile Subscriber Busy无法到达呼叫前转[hw] Call Forwarding on Mobile Subscriber Not Reachable 无应答呼叫前转[hw] Call Forwarding on No Reply无条件呼叫前转[hw] Call Forwarding Unconditional呼叫间隙[hw] Call Gapping呼叫保持[hw] Call Hold具有通知的呼叫保持[hw] Call Hold with Announcement呼叫实例数据[hw] Call Instance Data呼叫限制[hw] Call Limiter呼叫记录[hw] Call Logging呼叫排队[hw] Call Queueing重选呼叫路由[hw] Call Rerouting Distribution呼叫段[hw] Call Segment呼叫段模型[hw] Call Segment Model呼叫转移[hw] Call Transfer呼叫等待[hw] Call Waiting主叫线识别显示[hw] Calling Line Identification Presentation主叫线识别限制[hw] Calling Line Identification Restriction主叫姓名识别显示[hw] Calling Name Presentation能力集[hw] Capability Set资源管理台/卡号台[hw] Card Management Point运营商接入码[hw] Carrier Access Code分区分时(业务) [hw] Cell and Time Distribution小区广播自动台[hw] Cell Broadcast Automatic station小区广播中心[hw] Cell Broadcast Center小区广播频道[hw] Cell Broadcast Channel小区广播实体[hw] Cell Broadcast Entity小区广播维测台[hw] Cell Broadcast Maintenance and Test console小区广播人工台[hw] Cell Broadcast Manual station蜂窝消息业务[hw] Cellular Messaging Teleservice蜂窝寻呼业务[hw] Cellular Paging TeleserviceCHECK 约束[hw] CHECK constraints电路域[hw] Circuit Switched (CS) domain电路交换数据[hw] Circuit Switched Data客户接入代理[hw] Client Access Agent闭合用户群[hw] Closed User Group共同管理信息系统[hw] Common Management Information System遇忙呼叫完成[hw] Completion of Call to Busy Subscriber会议呼叫[hw] Conference Calling被叫线识别显示[hw] Connected Line Identification Presentation被叫线识别限制[hw] Connected Line Identification Restriction协商呼叫[hw] Consultation CallingCPU 忙[hw] CPU busy信用卡呼叫[hw] Credit Card Calling客户侧管理[hw] Customer Profile Management移动网络增强逻辑的客户化应用[hw] Customized Applications for Mobile network Enhanced Logic定制的拨号方案[hw] Customized Dialling Plan客户规定的记录通知[hw] Customized Recorded Announcement客户规定的振铃[hw] Customized Ringing高速缓存老化[hw] cache aging计算列[hw] calculated column计算字段[hw] calculated field计算成员[hw] calculated member计算条件[hw] calculation condition计算公式[hw] calculation formula计算传递[hw] calculation pass计算子多维数据集[hw] calculation subcube呼叫控制[hw] call control遇到呼叫间隙[hw] call gapping encountered呼叫模型[hw] call model呼叫方处理[hw] call party handling呼叫的技能路由[hw] call skill route调用级接口[hw] call-level interface呼叫/业务处理[hw] call/service processing被叫方子地址[hw] called party subaddress被叫方/用户[hw] called party/user主叫设备组[hw] calling facility group主叫设备组成员[hw] calling facility group member主叫方子地址[hw] calling party subaddress主叫方/用户[hw] calling party/user预定义的(短消息)[hw] canned运营商(商业通信)[hw] carrier (commercial telecommunications) 运营商识别码[hw] carrier identification code运营商选择[hw] carrier selection级联删除[hw] cascading delete级联更新[hw] cascading update事例[hw] case事例键[hw] case key事例集[hw] case set单元[hw] cell单元集[hw] cellset证书[hw] certificate更改脚本[hw] change script可更改维度[hw] changing dimensionchar 数据类型[hw] char data type字符格式[hw] character format字符集[hw] character set计费号码[hw] charge number计费方[hw] charged party检查点[hw] checkpoint子代[hw] child城市观光[hw] city sightseeing业务类别[hw] class of service子句[hw] clause客户端应用程序[hw] client application客户端游标[hw] client cursor聚集索引[hw] clustered index聚集[hw] clustering投币电话[hw] coin line排序规则[hw] collation收集地址信息[hw] collected address information 收集位数[hw] collected digits列[hw] column列筛选[hw] column filter列级排序规则[hw] column-level collation列级约束[hw] column-level constraint命令关系[hw] command relationship提交[hw] commit组合索引[hw] composite index组合键[hw] composite key计算列[hw] computed column串联[hw] concatenation并发[hw] concurrency会议业务[hw] conferencing services信心区域[hw] confidence region连接[hw] connection连接控制[hw] connection control连接点[hw] connection point连接视图状态[hw] connection view state一致信息发送[hw] consistent messaging常量[hw] constant约束[hw] constraint消费者[hw] consumer延续媒体[hw] continuation media控制[hw] control控制关系[hw] control relationship控制窗口[hw] control window控制中断报表[hw] control-break report控制流语言[hw] control-of-flow language控制支路[hw] controlling leg通话中断[hw] conversation abort对话业务[hw] conversational service核心特征[hw] core feature核心网络[hw] core network相关子查询[hw] correlated subquery误用[hw] corrupt覆盖范围[hw] coverage跨国车辆跟踪[hw] cross-country vehicle tracking交叉表查询[hw] crosstab query多维数据集[hw] cube多维数据集角色[hw] cube role当前位置[hw] current location游标[hw] cursorcursor 数据类型[hw] cursor data type游标库[hw] cursor library自定义汇总[hw] custom rollup自定义规则[hw] custom rule切割和补偿[hw] cut and paste数据控制语言[hw] Data Control Language默认约束[hw] DEFAULT constraint删除查询[hw] Delete query提醒被叫用户[hw] Destinating User Prompter按目标选择路由[hw] Destination Call Routing检出点[hw] Detection Point1号数字用户信令系统(DSS 1) [hw] Digital Subscriber Signalling System No. 1 (DSS 1) 不连续接收机制[hw] Discontinuous Reception Mechanism分布功能平面[hw] Distributed Functional Plane分布业务逻辑[hw] Distributed Service Logic分发列表[hw] Distribution List分发服务器[hw] Distributor无DSN 连接[hw] DSN-less connectionDTS 包[hw] DTS package双音多频[hw] Dual Tone Multi-Frequency数据[hw] data数据块[hw] data block数据连接[hw] data connection数据定义[hw] data definition数据定义语言[hw] data definition language数据字典[hw] data dictionary数据字典视图[hw] data dictionary view数据爆炸[hw] data explosion数据文件[hw] data file数据完整性[hw] data integrity数据沿袭[hw] data lineage数据管理[hw] data management数据操作语言[hw] data manipulation language数据集市[hw] data mart数据成员[hw] data member数据修改[hw] data modification数据对象[hw] data object数据抽取[hw] data pump数据清理[hw] data scrubbing数据源[hw] data source数据源名称[hw] data source name数据模板[hw] data template数据类型[hw] data type数据仓库[hw] data warehouse数据定义查询[hw] data-definition query数据库[hw] database数据库目录[hw] database catalog数据关系图[hw] database diagram数据库文件[hw] database file数据库语言[hw] database language数据库对象[hw] database object数据库所有者[hw] database owner数据库工程[hw] database project数据库角色[hw] database role数据库架构[hw] database schema数据库脚本[hw] database script数据报模式[hw] datagram message mode数据集[hw] datasetdatetime 数据类型[hw] datetime data type去激活[hw] deactivation死锁[hw] deadlockdecimal 数据类型[hw] decimal data type决策支持[hw] decision support决策树[hw] decision tree声明引用完整性[hw] declarative referential integrity 默认[hw] default默认数据库[hw] default database默认实例[hw] default instance默认语言[hw] default language默认成员[hw] default member默认结果集[hw] default result set延迟下发[hw] deferred delivery延迟定位请求[hw] deferred location request延期容忍[hw] delay tolerant分隔符[hw] delimiter下发的状态报告[hw] delivery receipt递送报告[hw] delivery report使非规范化[hw] denormalize密度[hw] density拒绝[hw] deny相关性[hw] dependencies注销[hw] deregister后代[hw] descendant目的对象[hw] destination object目的地路由地址[hw] destination routing address目的用户[hw] destination user被拨号码[hw] dialled digits对话[hw] dialogue字典条目[hw] dictionary entry差异数据库备份[hw] differential database backup维度[hw] dimension维度层次结构[hw] dimension hierarchy维度表[hw] dimension table直接连接[hw] direct connect直接对象[hw] direct object直接响应模式[hw] direct response mode目录号码[hw] directory number脏页[hw] dirty pages脏读[hw] dirty read调度业务[hw] dispatching services分发[hw] distribute分布式查询[hw] distributed query分发数据库[hw] distribution database分发保持期[hw] distribution retention period分发业务[hw] distribution services域[hw] domain域完整性[hw] domain integrity转出网[hw] donor network双字节字符集[hw] double-byte character set深化/浅化[hw] drill down/drill up钻取[hw] drill through双向消息交互[hw] duplex/two-way message exchange 动态配置/去配置[hw] dynamic arming/disarming动态游标[hw] dynamic cursor动态数据[hw] dynamic data动态筛选[hw] dynamic filter动态锁定[hw] dynamic locking动态恢复[hw] dynamic recovery动态SQL 语句[hw] dynamic SQL statements动态快照[hw] dynamic snapshot电子信息协会[hw] Electronic Messaging Association 电子编码[hw] Electronic Numbering邮件服务器[hw] Email Server加强呼叫路由[hw] Enhanced Call Routing设备标识寄存器[hw] Equipment Identity RegisterESME接收方[hw] ESME receiverESME收发方[hw] ESME transceiverESME发送方[hw] ESME transmitter事件检测点[hw] Event Detection Point事件检出点(动态检出点)-通知[hw] Event Detection Point-Notification 事件检出点(动态检出点)-请求[hw] Event Detection Point-Request显式呼叫转移[hw] Explicit Call Transfer扩展简单邮件传输协议[hw] Extended Simple Mail Transfer Protocol扩展用户接口服务器[hw] Extended User Interface Server外部机器接口[hw] External Machine Interface扩展短消息实体[hw] External Short Message Entity窃听[hw] eavesdropping单元[hw] element基本功能[hw] elementary function紧急提醒业务[hw] emergency alert services紧急业务网络[hw] emergency services network加密触发器[hw] encrypted trigger加密[hw] encryption增强多级优先和抢占[hw] enhanced Multi Level Precedence and Preemption 实体[hw] entity实体完整性[hw] entity integrity枚举[hw] enumeration同等联接[hw] equijoin删除[hw] erasure错误码[hw] error code错误日志[hw] error log错误状态号[hw] error state number转义符[hw] escape character事件[hw] event排它锁[hw] exclusive lock执行进程[hw] executive process显式事务[hw] explicit transaction表达式[hw] expression扩展存储过程[hw] extended stored procedure扩展盘区[hw] extent外部服务器[hw] external server设备限制级别[hw] Facility Restriction Level联邦信息处理标准[hw] Federal Information Processing Standard有限状态机[hw] Finite State Machine有线智能网[hw] Fixed Intelligent Network跟我转移[hw] Follow-me Diversion框架[hw] Framework被叫集中付费[hw] Freephone前置机、前端处理机[hw] Front End Processor合格域名[hw] Fully Qualified Domain Name功能实体[hw] Functional Entity功能实体动作[hw] Functional Entity Action设备代码[hw] facility code设备组[hw] facility group设备组成员[hw] facility group member事实[hw] fact事实数据表[hw] fact table特征[hw] feature特征码[hw] feature code特征交互[hw] feature interaction特征交互管理器[hw] feature interactions manager提取[hw] fetch字段[hw] field字段长度[hw] field length字段终止符[hw] field terminator文件[hw] file文件DSN [hw] file DSN文件存储类型[hw] file storage type文件组[hw] filegroup填充因子[hw] fill factor筛选[hw] filter有限状态机模型[hw] finite state machine model流水游标[hw] firehose cursor首位超时[hw] first digit time out固定数据库角色[hw] fixed database role固定服务器角色[hw] fixed server role平展界面[hw] flattened interface平展行集[hw] flattened rowset车队和资产管理业务[hw] fleet and asset management servicesfloat 数据类型[hw] float data type外键[hw] foreign key外表[hw] foreign table前向兼容多媒体信息发送[hw] forward compatible multimedia messaging 只进游标[hw] forward-only cursor转发路径[hw] forward-path前转路径[hw] forwarded leg前转的多媒体短消息[hw] forwarded MM前转MMS用户代理[hw] forwarding MMS user agent前转用户[hw] forwarding subscriber碎片[hw] fragmentation完整外部联接[hw] full outer join全文目录[hw] full-text catalog全文启用[hw] full-text enabling全文索引[hw] full-text index全文查询[hw] full-text query全文服务[hw] full-text service功能[hw] function函数[hw] function功能程序[hw] functional routine网关GPRS支持节点[hw] Gateway GPRS Support Node (GGSN)网关移动定位中心[hw] Gateway Mobile Location Center短消息关口MSC [hw] Gateway MSC For Short Message Service总功能平面[hw] Global Functional Plane总业务逻辑[hw] Global Service Logic总虚拟网业务[hw] Global Virtual Network ServicesGPRS会话[hw] GPRS sessionGPRS附着[hw] GPRS-attachGPRS分离[hw] GPRS-detach群呼寄存器实体[hw] Group Call Register (GCR) entityGSM家族网络[hw] GSM family networksGSM业务控制功能[hw] GSM Service Control FunctionGSM专用资源功能[hw] GSM Specialized Resource Function网关[hw] gateway基本名称[hw] generic name全局控制[hw] global control全局默认值[hw] global default全局属性[hw] global properties全局规则[hw] global rule全局订阅[hw] global subscriptions全局变量[hw] global variable授权[hw] grant粒度[hw] granularity群呼区域[hw] group call area来宾[hw] guest高可用数据复制[hw] High-availability Data Replication高级SIB [hw] High-Level SIB归属环境[hw] Home Environment归属环境增殖业务提供商[hw] Home Environment Value Added Service Provider 超文本标记语言[hw] Hypertext Markup Language行进方向[hw] heading异类数据[hw] heterogeneous data层次结构[hw] hierarchy高可用性SME [hw] high availability SME家庭网络[hw] home network同类数据[hw] homogeneous data跃点[hw] hop水平精确度[hw] horizontal accuracy水平分区[hw] horizontal partitioning巨型维度[hw] huge dimension智能网概念模型[hw] IN Conceptual Model智能网数据库[hw] IN DataBase智能网数据库管理系统[hw] IN DataBase Management System智能网域[hw] IN domain智能交换管理[hw] IN Switching Manager智能交换状态模型[hw] IN Switching State Model智能业务[hw] IN supported service信息流[hw] Information Flows融合智能网[hw] Integrated Intelligent Network综合业务数字网[hw] Integrated Services Digital Network智能网[hw] Intelligent Network智能网应用规程[hw] Intelligent Network Application Protocol智能外设[hw] Intelligent Peripheral交互式语音应答系统[hw] Interactive V oice Response System国际电子技术委员会[hw] International Electrotechnical Commission 国际标准化组织[hw] International Organization for Standardization 可支持Internet 的[hw] Internet-enabled查询PLMN [hw] Interrogating PLMN短消息互通MSC [hw] Interworking MSC For Short Message Service 可用IP [hw] IP availableIP多点传送业务[hw] IP MulticastIPSSP能力[hw] IPSSP capabilitiesISDN用户部份[hw] ISDN User Part标识符[hw] identifier标识列[hw] identity column标识属性[hw] identity property空闲时间[hw] idle timeimage 数据类型[hw] image data type立即定位请求[hw] immediate location request即时更新[hw] immediate updating即时更新订阅[hw] immediate updating subscriptions隐性事务[hw] implicit transaction暗示性权限[hw] implied permission带内信令[hw] inband signalling入呼[hw] inbound call入呼/来话[hw] incoming call增量更新[hw] incremental update索引[hw] index索引OR 运算[hw] index ORing索引页[hw] index page间接宾语[hw] indirect object信息流[hw] information flow信息模型[hw] information model初始位置[hw] initial location初始媒体[hw] initial media初始快照[hw] initial snapshot内联接[hw] inner join输入成员[hw] input member输入集[hw] input set输入源[hw] input source不感知游标[hw] insensitive cursor插入查询[hw] insert query插入值查询[hw] insert values query实例[hw] instanceint (integer) 数据类型[hw] int (integer) data type整型[hw] integer集成安全性[hw] integrated security完整性约束[hw] integrity constraint意向锁[hw] intent lock位间超时[hw] inter digit time out互动业务[hw] interactive service交互式结构化查询语言[hw] interactive structured query language 拦截/截取[hw] intercept接口[hw] interface(v.)与……接口[hw] interface接口含义[hw] interface implication内部标识符[hw] internal identifier对接;相容[hw] interoperability进程间通讯[hw] interprocess communication联网功能[hw] interworking function调用[hw] invocation不规则形式[hw] irregular form不规则形式类型[hw] irregular form type隔离级别[hw] isolation level作业[hw] job联接[hw] join联接列[hw] join column联接条件[hw] join condition联接字段[hw] join field联接筛选[hw] join filter联接运算符[hw] join operator联接路径[hw] join path联接表[hw] join table连接表[hw] junction table内核参数[hw] kernel parameter键[hw] key键列[hw] key column键范围锁[hw] key range lock键集驱动游标[hw] keyset-driven cursor关键字[hw] keywordLCS客户端[hw] LCS clientLCS客户接入禁止列表[hw] LCS client access barring list LCS开户概况[hw] LCS client subscription profileLCS特性[hw] LCS featureLCS服务器[hw] LCS server定位测量单元[hw] LMU indicator本地交换局[hw] Local Exchange(local central office)本地移动台标识[hw] Local Mobile Station Identity位置区域[hw] Location Area定位测量单元[hw] Location Measurement Unit定位业务[hw] Location Service大级别[hw] large level上次已知位置[hw] last known location延迟[hw] latency合法拦截业务[hw] lawful interception services层[hw] layer叶[hw] leaf叶级[hw] leaf level叶成员[hw] leaf member左向外联接[hw] left outer join支路[hw] leg级别[hw] level级别层次结构[hw] level hierarchy库[hw] library链接多维数据集[hw] linked cube链接服务器[hw] linked server链接表[hw] linked table链接表[hw] linking table侦听SME [hw] listening SME活锁[hw] livelock本地多维数据集[hw] local cube本地分发服务器[hw] local distributor本地登录标识[hw] local login identification本地服务器[hw] local server本地业务[hw] local service本地订阅[hw] local subscription局部变量[hw] local variable区域设置标识符[hw] locale identifier地方化广告[hw] localized advertising按位置计费[hw] location based charging依靠位置的内容广播[hw] location dependent content broadcast位置估计[hw] location estimate位置号[hw] location number位置状态[hw] location status基于位置的信息业务[hw] location-based information services锁[hw] lock锁升级[hw] lock escalation日志文件[hw] log file逻辑名称[hw] logical name逻辑运算符[hw] logical operators登录(帐户)[hw] login (account)登录安全模式[hw] login security mode查找表[hw] lookup table低可用性SME [hw] low availability SME低延期[hw] low delay邮件传送代理[hw] Mail Transfer Agent维测服务器[hw] Maintenance and Test Server恶意呼叫识别[hw] Malicious Call Identification大众呼叫[hw] Mass Calling会聚式会议电话[hw] Meet-me Conference消息等待指示[hw] Message Waiting Indication消息等待通知[hw] Message Waiting Notification消息等待[hw] Messages-Waiting消息等待数据[hw] Messages-Waiting-Data消息等待指示[hw] Messages-Waiting-Indication消息应用程序接口[hw] Messaging Application Programming Interface 多媒体消息生成[hw] MM creation多媒体短消息下发[hw] MM delivery多媒体短消息提交[hw] MM submission多媒体消息时间标记[hw] MM time stampingMMS客户端[hw] MMS Client运营商控制的多媒体消息[hw] MMS control by the operator用户控制的多媒体消息[hw] MMS control by the userMMS封装[hw] MMS encapsulationMMS发送端/发送方MMS手机[hw] MMS originating terminal MMS发送者[hw] MMS originator多媒体消息网关[hw] MMS Proxy-Relay多媒体消息网关/调度中心[hw] MMS Relay/ServerMMS接收者[hw] MMS recipientMMS接收端/接收方MMS手机[hw] MMS recipient terminalMMS服务器(多媒体消息调度中心) [hw] MMS ServerMMS终端/MMS手机[hw] MMS terminalMMS用户代理[hw] MMS user agentMMS增值业务应用[hw] MMS VAS applications监控模块[hw] MONitor移动设备[hw] Mobile Equipment移动台[hw] Mobile Station移动台内存溢出标志[hw] Mobile-Station-Memory-Capacity-Exceeded-Flag移动台不可达标志[hw] Mobile-Station-Not-Reachable-Flag移动台不可达原因[hw] Mobile-Station-Not-Reachable-Reason移动梦网[hw] Monternet消息待发[hw] More-Messages-To-SendMSC区域[hw] MSC area多呼[hw] Multicall多维表达式[hw] Multidimensional Expressions多媒体短消息[hw] Multimedia Message多媒体信息业务[hw] Multimedia Messaging Service多媒体信息业务环境[hw] Multimedia Messaging Service Environment多媒体信息业务网络结构[hw] Multimedia Messaging Service Network Architecture 多方通话[hw] MultiParty Service多重关联控制功能[hw] Multiple Association Control Function多方呼叫[hw] Multiway Calling机器DSN [hw] machine DSN生成表查询[hw] make table query管理功能构件[hw] management building block管理功能[hw] management function必须的[hw] mandatory多对多关系[hw] many-to-many relationship多对一关系[hw] many-to-one relationshipmaster 数据库[hw] master database主定义位置[hw] master definition site主文件[hw] master file主位置[hw] master site平均比特率[hw] mean bit rate度量值[hw] measure度量[hw] measurement媒体描述[hw] media description媒体家族[hw] media family媒体格式转换[hw] media format conversion媒体格式[hw] media formats媒体首部[hw] media header媒体名称[hw] media name媒体服务器[hw] media server媒体集[hw] media set媒体类型[hw] media type媒体种类转换[hw] media type conversion成员[hw] member成员委派[hw] member delegation成员组[hw] member group成员键列[hw] member key column成员名列[hw] member name column成员属性[hw] member property成员变量[hw] member variable备注[hw] memo合并[hw] merge合并复制[hw] merge replication消息体[hw] message body消息元素[hw] message element消息前转[hw] message forwarding消息头[hw] message header消息格式[hw] message layout消息编号[hw] message number消息限制[hw] message qualification消息过滤[hw] message screening消息业务[hw] messaging service元数据[hw] meta data方法[hw] method挖掘模型[hw] mining model镜像[hw] mirroring混合模式[hw] mixed mode移动号码可携带[hw] mobile number portability移动台[hw] mobile station移动台漫游号码[hw] mobile station roaming number移动终止[hw] mobile termination移动黄页[hw] mobile yellow pages模型[hw] modelmodel 数据库[hw] model database模型相关性[hw] model dependency模块[hw] module取模[hw] modulomoney 数据类型[hw] money data type监视关系[hw] monitor relationship监视窗口[hw] monitor window多点传送业务[hw] multicast service多维OLAP [hw] multidimensional OLAP多维结构[hw] multidimensional structure多重继承[hw] multiple inheritance多实例[hw] multiple instances多线程服务器应用程序[hw] multithreaded server application 多用户[hw] multiuser网络接入点[hw] Network Access Point网络决定的用户忙[hw] Network Determined User Busy网络功能体系[hw] Network Functional Architecture网络管理[hw] Network Manager北美紧急业务路由位[hw] North American Emergency Services Routing Digits 北美紧急业务路由密钥[hw] North American Emergency Services Routing Key 北美平等接入业务[hw] North American Equal Access北美GSM号码可携带[hw] North American GSM Number Portability北美编号方案[hw] North American Numbering Plan编码方案识别[hw] Numbering Plan Identity名称句式[hw] name phrasing命名实例[hw] named instance命名管道[hw] named pipe命名集[hw] named set命名关系[hw] naming relationship本机格式[hw] native format导航[hw] navigationnchar 数据类型[hw] nchar data type嵌套查询[hw] nested query嵌套表[hw] nested table网络[hw] network网络需求监控[hw] network demand monitoring网络操作员[hw] network operator网络提供商[hw] network provider别名[hw] nicknameniladic 函数[hw] niladic functions无延期[hw] no delay干扰词[hw] noise word非聚集索引[hw] nonclustered index非叶[hw] nonleaf非叶成员[hw] nonleaf member不可重复读取[hw] nonrepeatable read(短消息)普通优先级[hw] normal priority规范化规则[hw] normalization rulesntext 数据类型[hw] ntext data type为空性[hw] nullability号码可携带[hw] number portability号码范围所有者网络[hw] number range owner network数值表达式[hw] numeric expressionnvarchar 数据类型[hw] nvarchar data typeODBC 数据源[hw] ODBC data sourcODBC 驱动程序[hw] ODBC driver网外接入[hw] Off-net Access网外呼叫[hw] Off-net CallingOLE 自动化控制器[hw] OLE Automation controllerOLE 自动化对象[hw] OLE Automation objects。
1.1 In the following options, which does not define in protocol? ( D )A the format of messages exchanged between two or more communicatingentitiesB the order of messages exchanged between two or more communicating entitiesC the actions taken on the transmission of a message or other eventD the transmission signals are digital signals or analog signals1.2 In the following options, which is defined in protocol? ( A )A the actions taken on the transmission and/or receipt of a message or other eventB the objects exchanged between communicating entitiesC the content in the exchanged messagesD the location of the hosts1.3 An application can rely on the connection to deliver all of its data without error and in the proper order. The sentence describes (C ).A flow controlB congestion-controlC reliable data transferD connection-oriented service1.4 The Internet’s connection-oriented service has a name, it is ( A ).A TCPB UDPC TCP/IPD IP1.5 The Internet’s connectionless service is called ( B ).A TCPB UDPC TCP/IPD IP1.6 Which of the following nodes belongs to the network core?CA. a Web ServerB. a Host with Win2003 ServerC. a Router with NAT serviceD. a Supernode on Skype Network1.7 In the Internet, the equivalent concept to end systems is ( )A.A hostsB serversC clientsD routers1.8 In the Internet, end systems are connected together by ( C ).A copper wireB coaxial cableC communication linksD fiber optics1.9 End systems access to the Internet through its (C ).A modemsB protocolsC ISPD sockets1.10 In the following options, which belongs to the network core? ( B )A end systemsB routersC clientsD servers1.11 End systems, packet switches, and other pieces of the Internet, run ( D ) that control the sending and receiving of information within the Internet.A programsB processesC applicationsD protocols1.12 The internet allows ( D ) running on its end systems to exchange data with each other.A clients applicationsB server applicationsC P2P applicationsD distributed applications1.13 The protocols of various layers are called ( A ).A the protocol stackB TCP/IPC ISPD network protocol1.14 In the OSI reference model, the upper layers of the OSI model are, in correct orderDA Session, application, presentationB Session, presentation, applicationC Session, application, presentation, physicalD Application, presentation, session1.15 The lower layers of the OSI model are, in correct orderDA physical, system, network, logicalB physical, logical, network, systemC physical, transport, network, data linkD physical, data link, network, transport1.16 The Internet Protocol (IP) generally corresponds to which OSI layer?AA Network (layer three)B Transport (layer four)C Data link (layer two)D Session (layer five)1.17 What layer of the OSI model is designed to perform error detection functions?BA PhysicalB Data linkC NetworkD transport1.18 Which of the following protocol layers is not explicitly part of the Internet Protocol Stack? _____B____A. application layerB. session layerC. data link layerD. transport layer1.19 The 5-PDU is called__A_A. messageB. segmentC. datagramD. frame1.20 The Internet’s network layer is responsible for moving network-layer packets known as B( ) from one host to another.A frameB datagramC segmentD message1.21 Transport-layer packets are called:BA. messageB. segmentC. datagramD. frame1.22 The units of data exchanged by a link-layer protocol are called ( A).A FramesB SegmentsC DatagramsD bit streams1.23 There are two fundamental approaches to building a network core, ( B ) and packet switching.A electrical current switchingB circuit switchingC data switchingD message switching1.24 Datagram networks and virtual-circuit networks differ in that ( C ).A datagram networks are circuit-switched networks, and virtual-circuit networksare packet-switched networks.B datagram networks are packet-switched networks, and virtual-circuit networksare circuit-switched networks.C datagram networks use destination addresses and virtual-circuit networks useVC. numbers to forward packets toward their destination.D datagram networks use VC. numbers and virtual-circuit networks usedestination addresses to forward packets toward their destination.1.25 (A ) means that the switch must receive the entire packet before it can begin to transmit the first bit of the packet onto the outbound link.A Store-and-forward transmissionB FDMC End-to-end connectionD TDM1.26 In ( C ) networks, the resources needed along a path to provide for communication between the end system are reserved for the duration of the communication session.A packet-switchedB data-switchedC circuit-switchedD message-switched1.27 In ( A ) networks, the resources are not reserved; a session’s messages use the resources on demand, and as a consequence, may have to wait for access to communication link.A packet-switchedB data-switchedC circuit-switchedD message-switched1.28 In a circuit-switched network, if each link has n circuits, for each link used by the end-to-end connection, the connection gets ( A) of the link’s bandwidth for the duration of the connection.A a fraction 1/nB allC 1/2D n times1.29 For (C ), the transmission rate of a circuit is equal to the frame rate multiplied by the number of bits in a slot.A CDMAB packet-switched networkC TDMD FDM1.30 The network that forwards packets according to host destination addresses is called ( D) network.A circuit-switchedB packet-switchedC virtual-circuitD datagram1.31 The network that forwards packets according to virtual-circuit numbers is called ( C ) network.A circuit-switchedB packet-switchedC virtual-circuitD datagram1.32 The time required to propagate from the beginning of the link to the next router is ( C).A queuing delayB processing delayC propagation delayD transmission delay1.33 Processing delay does not include the time to (B ).A examine the packet’s headerB wait to transmit the packet onto the linkC determine where to direct the packetD check bit-error in the packet1.34 In the following four descriptions, which one is correct? ( C)A The traffic intensity must be greater than 1.B The fraction of lost packets increases as the traffic intensity decreases.C If the traffic intensity is close to zero, the average queuing delay will be closeto zero.D If the traffic intensity is close to one, the average queuing delay will be closeto one.1.35 Suppose, a is the average rate at which packets arrive at the queue, R is the transmission rate, and all packets consist of L bits, then the traffic intensity is ( B ),A LR/aB La/RC Ra/LD LR/a1.36 Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are R1 and R2, respectively. Assuming that the switch uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length L? (Ignore queuing delay, propagation delay, and processing delay.) ( A )A L/R1+L/R2B L/R1C L/R2D none of the above1.37 We are sending a 30 Mbit MP3 file from a source host to a destination host. Suppose there is only one link between source and destination and the link has a transmission rate of 10 Mbps. Assume that the propagation speed is 2 * 108 meters/sec, and the distance between source and destination is 10,000 km. Also suppose that message switching is used, with the message consisting of the entire MP3 file. How many bits will the source have transmitted when the first bit arrives at the destination?CA. 1 bitB. 30,000,000 bitsC. 500,000 bitsD. none of the above1.38 In the following entries, which is not a kind of access network?(D )A residential accessB company accessC wireless accessD local access1.39 The following technologies may be used for residential access, exceptDA. HFCB. DSLC. Dial-up modemD. FDDI1.40 Which kind of media is not a guided media? ( D)A twisted-pair copper wireB a coaxial cableC fiber opticsD digital satellite channel。
Actual IO Table AddressApplicationASCIIAuxiliary AreaBaud rateBCDBinary Coded Decimal BinaryBitBooleanBridgeBroadcast addressBusCentral Processing Unit ClipboardCommand modifier Common link parameter Compact Flash ComponentsControl bitController Link Counter areaCounterCPU bus link areaCPU typeCPUCS-seriesCJ-seriesCX-ServerCX-Server ProjectCycle timeData areaData bitsData linkData Link EditorData link tableData locationData memory DatagramDDEDDE management library DDE Manager toolDebug modeDecimalDefaultDestination network address Destination node number Destination nodeDevice groupDevice typeDeviceDialogDLLDouble Floating Point DownloadDragDriverDynamic Data Exchange Echo testEEPROMElementsEnd ConnectionEnd network addressError statusEthernetEven parityEvent frameExclusive modeFile Transfer Protocol FINSFinsGatewayFlagFloating PointFolderFrame lengthFTPExpansion memoryFile memoryFile memoryGateway deviceGateway network address Gateway PLCGUIHard disk HexadecimalHierarchyHigh LinkHost computerHost link systemHost link unitIconIDSC device type Import toolInput bit data areaInputInstructionIntel HexInterfaceInternal data type Internode testInvoking applicationIO bitIO Table componentIOIP address tableIP addressIP router tableInput bitInput deviceLocal area network Local network address IPItemLANLink Relay AreaLink systemLink unitLinkLoadLocal network number Local tableLREALLSSMark parityMasterMbMemory areaMemory Card component Memory Card Writer Memory cardMHzMicro host linkMicrosoft ExcelMicrosoft Windows Explorer ModemMonitor modenNative data format Network bridgeNetwork parameters Network Service Board Node numberNodeNSBOdd parityOfflineOLEOnlineOutput Bit data area Output bitOutput deviceOutputPacketParity bitParityPathPeripheralPerformance Monitor tool Ping testPLCPLC Clock toolPLC Error componentPLC Memory component PLC Setup component PointPortProgramProgram memory Program modeProjectPROM writerPROMProtocolPSTNRackRAMRead modeRead/write mode Refresh parameter table Registered IO Table Relay network address Relay node number Relay tableRemote networkRemote TerminalsResetRootRoot groupRotary switchRouting tableRoutingRS232RS422RTsRun ModeSerial ConnectionServerServer application Signed DecimalSIOUSlaveSlotsSoftware switchesSpace paritySpecial Input /Output UnitSRM1 device typeStep AreaStop bitsSymbolSYSMAC LINK SYSMAC NET SYSMAC WAY System areaSystem configuration Tagged databaseTAPITarget PLCTaskbarTCP/IPTemperature Controller Temporary Relay Area Timer areaToolsTopicTransceiverTransfer from PLC TextTransfer to PLC UnknownTransition Area TransmitterUDPUnitsUser Datagram Protocol WordUnit number真正的硬件配置的PLC单元和电源插槽。
CISSP考试练习(习题卷15)第1部分:单项选择题,共100题,每题只有一个正确答案,多选或少选均不得分。
1.[单选题]George is responsible for setting and tuning the thresholds for his company behavior-based IDS.Which of thefollowing outlines the possibilities of not doing this activity properly?乔治负责设置和他的公司基于行为的入侵检测系统的阈值调整。
以下哪一项概括不做这个活动的可能性?A)lf the threshold is set too low, non-intrusive activities are considered attacks (false positives) if the threshold is set too high, then malicious activities are not identified (false negatives).如果阈值设置太低,非侵入性的活动被认为是攻击(假阳性).如果阈值设置太高,则未识别恶意活动(假阴性)B)If the threshold is set too low, non-intrusive activities are considered attacks (false negatives) f the threshold is set to high, then malicious activities are not identified (false positives).如果阈值设置太低,非侵入性的活动被认为是攻击(假阴性)。
如果阈值设置太高,则未识别恶意活动(假阳性)C)if the threshold is set too high, non-intrusive activities are considered attacks (false positives).if the threshold is set too low, then malicious activities are not identified (false negatives).如果阈值设置太高,非侵入性的活动被认为是攻击(假阳性)。
转发信息库[hw] Forward Information Base傅里叶变换[hw] Fourier Transform帧标[hw] frame preamble成帧,帧形成,帧定位[hw] framing自由软件[hw] freeware网关控制协议[hw] gateway control protocol组件、群件[hw] groupware高级数据链路控制(规程)[hw] High-level Data Link Control跳,步跳[hw] hop整数倍[hw] integer multiple; integral multiple内部网关协议[hw] Interior Gateway Protocol国际移动用户识别码[hw] International Mobile Subscriber Identity 因特网控制报文协议[hw] Internet Control Message Protocol因特网工程师任务组[hw] Internet Engineering Task Force因特网密匙交换协议[hw] Internet Key Exchange protocol调用[hw] invokeIP包[hw] IP packet借用IP地址[hw] IP unnumbered链接调用[hw] Linked Invoke地点[hw] locale必选定长部分[hw] mandatory fixed part媒体接入控制[hw] Media Access ControlMPLS垫层[hw] MPLS shim多链接点到点协议(PPP协议),多链路PPP捆绑[hw] Multilink PPP 多协议标记交换[hw] Multiprotocol Label Switching线路适应能力[hw] network adaptability网络控制协议[hw] Network Control Protocol网络接口栓[hw] Network Interface Tap网管中心[hw] Network Management Center节点[hw] node一号通[hw] One Number Link You报文[hw] packet基于SDH/SONET的报封装[hw] Packet Over SONET/SDH净荷类型[hw] Payload Type对等网络[hw] peer network对等网络[hw] peer-to-peer network永久虚通路、永久虚拟通道[hw] Permanent Virtual Channel相位[hw] phase物理媒介子层[hw] Physical Medium sub-layer明文[hw] plain text点到点协议[hw] Point-to-Point Protocol电源线、电线、电源电缆[hw] power cable原始基准时钟[hw] Primary Reference Clock原语[hw] Primitive通信领域专业词汇中英文对照产品激活[hw] Product Activation运营商边缘[hw] Provider Edge总串口配置模式[hw] pseudo-serial configuration mode公共路由封装协议[hw] Public Routing Encapsulation公用软件/无版权软件[hw] public-domain softwareR2信令, (中国)一号信令;产品目的地国家的随路信令[hw] R2 signaling 随机存取[hw] random access随机早期检测[hw] Random Early Detection冗余位[hw] redundancy bit远端用户拨入鉴权服务[hw] Remote Authentication Dial in User Service 路由管理中心[hw] Router Management Center路由反射器[hw] router reflector路由信息协议[hw] Routing Information Protocol密钥[hw] secret key分段/重装[hw] Segmenting/reassembling观看本地图像[hw] selfview/view outgoing video顺序存取[hw] sequential access业务中心[hw] Service System会话[hw] session共享软件[hw] shareware七号信令[hw] Signaling System Number 7单个联系客体[hw] Single Association Object小型计算机系统接口[hw] Small Computer Systems Interface软件许可证[hw] software licensing水平分割更新[hw] split-horizon updates间谍软件[hw] spyware独立(式)[hw] stand-alone交换多兆比特数据业务[hw] Switched Multi-megabit Data Service交换虚电路[hw] Switched Virtual Circuit暂时信令连接[hw] temporary signaling connections终端访问控制器控制系统协议[hw] Terminal Access Controller Access Control System令牌环网[hw] token ring network流量整形[hw] Traffic Shaping通用类[hw] Universal通用串行总线[hw] Universal Serial Bus用户数据包协议[hw] User Datagram Protocol低码率通信视频编码[hw] video coding for low bit rate communication虚通路标识[hw] Virtual Channel Identifier虚电路[hw] Virtual Circuit虚拟私有数据网络[hw] Virtual Private Data Network静电复印机[hw] xeroxSNMP团体[hw] SNMP communitySNMP团体名[hw] SNMP community name接入[hw] access“(全部)”级别[hw] (All) level操作类别(4类) [hw] 4 classes of operations缩位拨号[hw] Abbreviated Dialling记帐卡呼叫[hw] Account Card CallingActiveX 数据对象[hw] ActiveX Data ObjectsActiveX 数据对象(多维)[hw] ActiveX Data Objects (Multidimensional) 增强智能外设[hw] Advanced Intelligent Peripheral计费通知(计费)[hw] Advice of Charge (Charging)计费通知(信息)[hw] Advice of Charge (Information)“全部”成员[hw] All member)美国国家标准学会[hw] American National Standards InstituteANSI 到OEM 转换[hw] ANSI to OEM conversion模拟显示业务接口服务器[hw] Analogue Display Service Interface server 分析服务器[hw] Analysis serverAPI 服务器游标[hw] API server cursor应用上下文[hw] Application Context应用上下文协商[hw] Application Context Negotiation应用实体[hw] Application Entity应用实体调用[hw] Application Entity Invocation应用接口模块[hw] Application Interface Module应用编程接口[hw] Application Programming Interface应用协议数据单元[hw] Application Protocol Data Unit应用业务单元[hw] Application Service ElementASCII码[hw] ASCII character话务员[hw] Attendant鉴权中心[hw] Authentication Centre鉴权码[hw] Authorization Code被叫确认付费[hw] Auto Collect Call自动更换记帐[hw] Automatic Alternative Billing自动回呼[hw] Automatic Call Back自动呼叫分配器/ 排队机[hw] Automatic Call Distributor自动语音识别[hw] Automatic Speech Recognition接入信道[hw] access channel接入码[hw] access code接入时延[hw] access delay接入功能[hw] access function精确度[hw] accuracy证实消息[hw] acknowledge/acknowledgement message操作[hw] action激活[hw] activation激活的移动台[hw] active MS活动语句[hw] active statement特殊连接器名称[hw] ad hoc connector name加载项[hw] add-in附加设备(辅助实体)[hw] adjunct代理[hw] agent聚合函数[hw] aggregate function聚合查询[hw] aggregate query聚合[hw] aggregation聚合前缀[hw] aggregation prefix聚合包装[hw] aggregation wrapper警报[hw] alert提醒方式[hw] alerting pattern别名[hw] alias命名别名[hw] aliasing祖先[hw] ancestor批注属性[hw] annotational property匿名订阅[hw] anonymous subscription应用程序角色[hw] application role应用[hw] applications存档文件[hw] archive file参数条款[hw] argument clause项目[hw] article资产定位[hw] asset location资产跟踪[hw] asset tracking资产状况显现[hw] asset visualization辅助SSF [hw] assisting SSF原子的[hw] atomic特性[hw] attribute身份验证[hw] authentication授权[hw] authorization自动恢复[hw] automatic recovery独立[hw] autonomy轴[hw] axis禁止所有入局呼叫[hw] Barring of All Incoming Calls禁止所有出局呼叫[hw] Barring of All Outgoing Calls漫游时,禁止入局呼叫[hw] Barring of Incoming Calls when Roaming Outside the Home PLMN Country禁止国际出局呼叫[hw] Barring of Outgoing International Calls禁止所有除归属国PLMN外的国际出局呼叫[hw] Barring of Outgoing International Calls except those directed to the Home PLMN Country基站控制器[hw] Base Station Controller基站控制器区域[hw] Base Station Controller (BSC) area基站收发信台[hw] Base Transceiver Station基本呼叫处理[hw] Basic Call Process基本呼叫状态模型[hw] Basic Call State Model基本速率接口[hw] Basic Rate Interface布尔型[hw] Boolean备份[hw] backup备份设备[hw] backup device备份文件[hw] backup file备份媒体[hw] backup media备份集[hw] backup set均衡层次结构[hw] balanced hierarchy基本数据类型[hw] base data type基表[hw] base table基本呼叫[hw] basic call批处理[hw] batchbcp 文件[hw] bcp filesbcp 实用工具[hw] bcp utility取缺省值…… [hw] be defaulted to互斥的[hw] be mutually exclusive承载控制[hw] bearer control承载业务[hw] bearer servicebinary 数据类型[hw] binary data type二进制大对象[hw] binary large object捆绑[hw] bind绑定[hw] bindingbit 数据类型[hw] bit data type按位运算[hw] bitwise operation块[hw] blocks边界网关[hw] border gateway浏览模式[hw] browse mode缓存的[hw] buffered内置函数[hw] built-in functions业务规则[hw] business rulesCAMEL业务环境[hw] CAMEL Service EnvironmentCAMEL签约信息[hw] CAMEL Subscription Information呼叫控制接入功能实体[hw] Call Control Agent Functional Entity呼叫控制功能[hw] Call Control Function呼叫控制功能实体[hw] Call Control Functional Entity呼叫偏转[hw] Call Deflection呼叫详细记录[hw] Call Detail Record呼叫分配[hw] Call Distribution呼叫前转[hw] Call Forwarding遇忙呼叫前转[hw] Call Forwarding on Mobile Subscriber Busy无法到达呼叫前转[hw] Call Forwarding on Mobile Subscriber Not Reachable无应答呼叫前转[hw] Call Forwarding on No Reply无条件呼叫前转[hw] Call Forwarding Unconditional呼叫间隙[hw] Call Gapping呼叫保持[hw] Call Hold具有通知的呼叫保持[hw] Call Hold with Announcement呼叫实例数据[hw] Call Instance Data呼叫限制[hw] Call Limiter呼叫记录[hw] Call Logging呼叫排队[hw] Call Queueing重选呼叫路由[hw] Call Rerouting Distribution呼叫段[hw] Call Segment呼叫段模型[hw] Call Segment Model呼叫转移[hw] Call Transfer呼叫等待[hw] Call Waiting主叫线识别显示[hw] Calling Line Identification Presentation主叫线识别限制[hw] Calling Line Identification Restriction主叫姓名识别显示[hw] Calling Name Presentation能力集[hw] Capability Set资源管理台/卡号台[hw] Card Management Point运营商接入码[hw] Carrier Access Code分区分时(业务) [hw] Cell and Time Distribution小区广播自动台[hw] Cell Broadcast Automatic station小区广播中心[hw] Cell Broadcast Center小区广播频道[hw] Cell Broadcast Channel小区广播实体[hw] Cell Broadcast Entity小区广播维测台[hw] Cell Broadcast Maintenance and Test console小区广播人工台[hw] Cell Broadcast Manual station蜂窝消息业务[hw] Cellular Messaging Teleservice蜂窝寻呼业务[hw] Cellular Paging TeleserviceCHECK 约束[hw] CHECK constraints电路域[hw] Circuit Switched (CS) domain电路交换数据[hw] Circuit Switched Data客户接入代理[hw] Client Access Agent闭合用户群[hw] Closed User Group共同管理信息系统[hw] Common Management Information System遇忙呼叫完成[hw] Completion of Call to Busy Subscriber会议呼叫[hw] Conference Calling被叫线识别显示[hw] Connected Line Identification Presentation被叫线识别限制[hw] Connected Line Identification Restriction协商呼叫[hw] Consultation CallingCPU 忙[hw] CPU busy信用卡呼叫[hw] Credit Card Calling客户侧管理[hw] Customer Profile Management移动网络增强逻辑的客户化应用[hw] Customized Applications for Mobile network Enhanced Logic定制的拨号方案[hw] Customized Dialling Plan客户规定的记录通知[hw] Customized Recorded Announcement客户规定的振铃[hw] Customized Ringing高速缓存老化[hw] cache aging计算列[hw] calculated column计算字段[hw] calculated field计算成员[hw] calculated member计算条件[hw] calculation condition计算公式[hw] calculation formula计算传递[hw] calculation pass计算子多维数据集[hw] calculation subcube呼叫控制[hw] call control遇到呼叫间隙[hw] call gapping encountered呼叫模型[hw] call model呼叫方处理[hw] call party handling呼叫的技能路由[hw] call skill route调用级接口[hw] call-level interface呼叫/业务处理[hw] call/service processing被叫方子地址[hw] called party subaddress被叫方/用户[hw] called party/user主叫设备组[hw] calling facility group主叫设备组成员[hw] calling facility group member主叫方子地址[hw] calling party subaddress主叫方/用户[hw] calling party/user预定义的(短消息)[hw] canned运营商(商业通信)[hw] carrier (commercial telecommunications) 运营商识别码[hw] carrier identification code运营商选择[hw] carrier selection级联删除[hw] cascading delete级联更新[hw] cascading update事例[hw] case事例键[hw] case key事例集[hw] case set单元[hw] cell单元集[hw] cellset证书[hw] certificate更改脚本[hw] change script可更改维度[hw] changing dimensionchar 数据类型[hw] char data type字符格式[hw] character format字符集[hw] character set计费号码[hw] charge number计费方[hw] charged party检查点[hw] checkpoint子代[hw] child城市观光[hw] city sightseeing业务类别[hw] class of service子句[hw] clause客户端应用程序[hw] client application客户端游标[hw] client cursor聚集索引[hw] clustered index聚集[hw] clustering投币电话[hw] coin line排序规则[hw] collation收集地址信息[hw] collected address information 收集位数[hw] collected digits列[hw] column列筛选[hw] column filter列级排序规则[hw] column-level collation列级约束[hw] column-level constraint命令关系[hw] command relationship提交[hw] commit组合索引[hw] composite index组合键[hw] composite key计算列[hw] computed column串联[hw] concatenation并发[hw] concurrency会议业务[hw] conferencing services信心区域[hw] confidence region连接[hw] connection连接控制[hw] connection control连接点[hw] connection point连接视图状态[hw] connection view state一致信息发送[hw] consistent messaging常量[hw] constant约束[hw] constraint消费者[hw] consumer延续媒体[hw] continuation media控制[hw] control控制关系[hw] control relationship控制窗口[hw] control window控制中断报表[hw] control-break report控制流语言[hw] control-of-flow language控制支路[hw] controlling leg通话中断[hw] conversation abort对话业务[hw] conversational service核心特征[hw] core feature核心网络[hw] core network相关子查询[hw] correlated subquery误用[hw] corrupt覆盖范围[hw] coverage跨国车辆跟踪[hw] cross-country vehicle tracking交叉表查询[hw] crosstab query多维数据集[hw] cube多维数据集角色[hw] cube role当前位置[hw] current location游标[hw] cursorcursor 数据类型[hw] cursor data type游标库[hw] cursor library自定义汇总[hw] custom rollup自定义规则[hw] custom rule切割和补偿[hw] cut and paste数据控制语言[hw] Data Control Language默认约束[hw] DEFAULT constraint删除查询[hw] Delete query提醒被叫用户[hw] Destinating User Prompter按目标选择路由[hw] Destination Call Routing检出点[hw] Detection Point1号数字用户信令系统(DSS 1) [hw] Digital Subscriber Signalling System No. 1 (DSS 1)不连续接收机制[hw] Discontinuous Reception Mechanism分布功能平面[hw] Distributed Functional Plane分布业务逻辑[hw] Distributed Service Logic分发列表[hw] Distribution List分发服务器[hw] Distributor无DSN 连接[hw] DSN-less connectionDTS 包[hw] DTS package双音多频[hw] Dual Tone Multi-Frequency数据[hw] data数据块[hw] data block数据连接[hw] data connection数据定义[hw] data definition数据定义语言[hw] data definition language数据字典[hw] data dictionary数据字典视图[hw] data dictionary view数据爆炸[hw] data explosion数据文件[hw] data file数据完整性[hw] data integrity数据沿袭[hw] data lineage数据管理[hw] data management数据操作语言[hw] data manipulation language数据集市[hw] data mart数据成员[hw] data member数据修改[hw] data modification数据对象[hw] data object数据抽取[hw] data pump数据清理[hw] data scrubbing数据源[hw] data source数据源名称[hw] data source name数据模板[hw] data template数据类型[hw] data type数据仓库[hw] data warehouse数据定义查询[hw] data-definition query数据库[hw] database数据库目录[hw] database catalog数据关系图[hw] database diagram数据库文件[hw] database file数据库语言[hw] database language数据库对象[hw] database object数据库所有者[hw] database owner数据库工程[hw] database project数据库角色[hw] database role数据库架构[hw] database schema数据库脚本[hw] database script数据报模式[hw] datagram message mode数据集[hw] datasetdatetime 数据类型[hw] datetime data type去激活[hw] deactivation死锁[hw] deadlockdecimal 数据类型[hw] decimal data type决策支持[hw] decision support决策树[hw] decision tree声明引用完整性[hw] declarative referential integrity 默认[hw] default默认数据库[hw] default database默认实例[hw] default instance默认语言[hw] default language默认成员[hw] default member默认结果集[hw] default result set延迟下发[hw] deferred delivery延迟定位请求[hw] deferred location request延期容忍[hw] delay tolerant分隔符[hw] delimiter下发的状态报告[hw] delivery receipt递送报告[hw] delivery report使非规范化[hw] denormalize密度[hw] density拒绝[hw] deny相关性[hw] dependencies注销[hw] deregister后代[hw] descendant目的对象[hw] destination object目的地路由地址[hw] destination routing address目的用户[hw] destination user被拨号码[hw] dialled digits对话[hw] dialogue字典条目[hw] dictionary entry差异数据库备份[hw] differential database backup维度[hw] dimension维度层次结构[hw] dimension hierarchy维度表[hw] dimension table直接连接[hw] direct connect直接对象[hw] direct object直接响应模式[hw] direct response mode目录号码[hw] directory number脏页[hw] dirty pages脏读[hw] dirty read调度业务[hw] dispatching services分发[hw] distribute分布式查询[hw] distributed query分发数据库[hw] distribution database分发保持期[hw] distribution retention period分发业务[hw] distribution services域[hw] domain域完整性[hw] domain integrity转出网[hw] donor network双字节字符集[hw] double-byte character set深化/浅化[hw] drill down/drill up钻取[hw] drill through双向消息交互[hw] duplex/two-way message exchange 动态配置/去配置[hw] dynamic arming/disarming动态游标[hw] dynamic cursor动态数据[hw] dynamic data动态筛选[hw] dynamic filter动态锁定[hw] dynamic locking动态恢复[hw] dynamic recovery动态SQL 语句[hw] dynamic SQL statements动态快照[hw] dynamic snapshot电子信息协会[hw] Electronic Messaging Association 电子编码[hw] Electronic Numbering邮件服务器[hw] Email Server加强呼叫路由[hw] Enhanced Call Routing设备标识寄存器[hw] Equipment Identity RegisterESME接收方[hw] ESME receiverESME收发方[hw] ESME transceiverESME发送方[hw] ESME transmitter事件检测点[hw] Event Detection Point事件检出点(动态检出点)-通知[hw] Event Detection Point-Notification 事件检出点(动态检出点)-请求[hw] Event Detection Point-Request 显式呼叫转移[hw] Explicit Call Transfer扩展简单邮件传输协议[hw] Extended Simple Mail Transfer Protocol扩展用户接口服务器[hw] Extended User Interface Server外部机器接口[hw] External Machine Interface扩展短消息实体[hw] External Short Message Entity窃听[hw] eavesdropping单元[hw] element基本功能[hw] elementary function紧急提醒业务[hw] emergency alert services紧急业务网络[hw] emergency services network加密触发器[hw] encrypted trigger加密[hw] encryption增强多级优先和抢占[hw] enhanced Multi Level Precedence and Preemption实体[hw] entity实体完整性[hw] entity integrity枚举[hw] enumeration同等联接[hw] equijoin删除[hw] erasure错误码[hw] error code错误日志[hw] error log错误状态号[hw] error state number转义符[hw] escape character事件[hw] event排它锁[hw] exclusive lock执行进程[hw] executive process显式事务[hw] explicit transaction表达式[hw] expression扩展存储过程[hw] extended stored procedure扩展盘区[hw] extent外部服务器[hw] external server设备限制级别[hw] Facility Restriction Level联邦信息处理标准[hw] Federal Information Processing Standard有限状态机[hw] Finite State Machine有线智能网[hw] Fixed Intelligent Network跟我转移[hw] Follow-me Diversion框架[hw] Framework被叫集中付费[hw] Freephone前置机、前端处理机[hw] Front End Processor合格域名[hw] Fully Qualified Domain Name功能实体[hw] Functional Entity功能实体动作[hw] Functional Entity Action设备代码[hw] facility code设备组[hw] facility group设备组成员[hw] facility group member事实[hw] fact事实数据表[hw] fact table特征[hw] feature特征码[hw] feature code特征交互[hw] feature interaction特征交互管理器[hw] feature interactions manager提取[hw] fetch字段[hw] field字段长度[hw] field length字段终止符[hw] field terminator文件[hw] file文件DSN [hw] file DSN文件存储类型[hw] file storage type文件组[hw] filegroup填充因子[hw] fill factor筛选[hw] filter有限状态机模型[hw] finite state machine model流水游标[hw] firehose cursor首位超时[hw] first digit time out固定数据库角色[hw] fixed database role固定服务器角色[hw] fixed server role平展界面[hw] flattened interface平展行集[hw] flattened rowset车队和资产管理业务[hw] fleet and asset management servicesfloat 数据类型[hw] float data type外键[hw] foreign key外表[hw] foreign table前向兼容多媒体信息发送[hw] forward compatible multimedia messaging 只进游标[hw] forward-only cursor转发路径[hw] forward-path前转路径[hw] forwarded leg前转的多媒体短消息[hw] forwarded MM前转MMS用户代理[hw] forwarding MMS user agent前转用户[hw] forwarding subscriber碎片[hw] fragmentation完整外部联接[hw] full outer join全文目录[hw] full-text catalog全文启用[hw] full-text enabling全文索引[hw] full-text index全文查询[hw] full-text query全文服务[hw] full-text service功能[hw] function函数[hw] function功能程序[hw] functional routine网关GPRS支持节点[hw] Gateway GPRS Support Node (GGSN)网关移动定位中心[hw] Gateway Mobile Location Center短消息关口MSC [hw] Gateway MSC For Short Message Service总功能平面[hw] Global Functional Plane总业务逻辑[hw] Global Service Logic总虚拟网业务[hw] Global Virtual Network ServicesGPRS会话[hw] GPRS sessionGPRS附着[hw] GPRS-attachGPRS分离[hw] GPRS-detach群呼寄存器实体[hw] Group Call Register (GCR) entityGSM家族网络[hw] GSM family networksGSM业务控制功能[hw] GSM Service Control FunctionGSM专用资源功能[hw] GSM Specialized Resource Function网关[hw] gateway基本名称[hw] generic name全局控制[hw] global control全局默认值[hw] global default全局属性[hw] global properties全局规则[hw] global rule全局订阅[hw] global subscriptions全局变量[hw] global variable授权[hw] grant粒度[hw] granularity群呼区域[hw] group call area来宾[hw] guest高可用数据复制[hw] High-availability Data Replication高级SIB [hw] High-Level SIB归属环境[hw] Home Environment归属环境增殖业务提供商[hw] Home Environment Value Added Service Provider超文本标记语言[hw] Hypertext Markup Language行进方向[hw] heading异类数据[hw] heterogeneous data层次结构[hw] hierarchy高可用性SME [hw] high availability SME家庭网络[hw] home network同类数据[hw] homogeneous data跃点[hw] hop水平精确度[hw] horizontal accuracy水平分区[hw] horizontal partitioning巨型维度[hw] huge dimension智能网概念模型[hw] IN Conceptual Model智能网数据库[hw] IN DataBase智能网数据库管理系统[hw] IN DataBase Management System智能网域[hw] IN domain智能交换管理[hw] IN Switching Manager智能交换状态模型[hw] IN Switching State Model智能业务[hw] IN supported service信息流[hw] Information Flows融合智能网[hw] Integrated Intelligent Network综合业务数字网[hw] Integrated Services Digital Network智能网[hw] Intelligent Network智能网应用规程[hw] Intelligent Network Application Protocol智能外设[hw] Intelligent Peripheral交互式语音应答系统[hw] Interactive Voice Response System国际电子技术委员会[hw] International Electrotechnical Commission 国际标准化组织[hw] International Organization for Standardization 可支持Internet 的[hw] Internet-enabled查询PLMN [hw] Interrogating PLMN短消息互通MSC [hw] Interworking MSC For Short Message Service 可用IP [hw] IP availableIP多点传送业务[hw] IP MulticastIPSSP能力[hw] IPSSP capabilitiesISDN用户部份[hw] ISDN User Part标识符[hw] identifier标识列[hw] identity column标识属性[hw] identity property空闲时间[hw] idle timeimage 数据类型[hw] image data type立即定位请求[hw] immediate location request即时更新[hw] immediate updating即时更新订阅[hw] immediate updating subscriptions隐性事务[hw] implicit transaction暗示性权限[hw] implied permission带内信令[hw] inband signalling入呼[hw] inbound call入呼/来话[hw] incoming call增量更新[hw] incremental update索引[hw] index索引OR 运算[hw] index ORing索引页[hw] index page间接宾语[hw] indirect object信息流[hw] information flow信息模型[hw] information model初始位置[hw] initial location初始媒体[hw] initial media初始快照[hw] initial snapshot内联接[hw] inner join输入成员[hw] input member输入集[hw] input set输入源[hw] input source不感知游标[hw] insensitive cursor插入查询[hw] insert query插入值查询[hw] insert values query实例[hw] instanceint (integer) 数据类型[hw] int (integer) data type整型[hw] integer集成安全性[hw] integrated security完整性约束[hw] integrity constraint意向锁[hw] intent lock位间超时[hw] inter digit time out互动业务[hw] interactive service交互式结构化查询语言[hw] interactive structured query language 拦截/截取[hw] intercept接口[hw] interface(v.)与……接口[hw] interface接口含义[hw] interface implication内部标识符[hw] internal identifier对接;相容[hw] interoperability进程间通讯[hw] interprocess communication联网功能[hw] interworking function调用[hw] invocation不规则形式[hw] irregular form不规则形式类型[hw] irregular form type隔离级别[hw] isolation level作业[hw] job联接[hw] join联接列[hw] join column联接条件[hw] join condition联接字段[hw] join field联接筛选[hw] join filter联接运算符[hw] join operator联接路径[hw] join path联接表[hw] join table连接表[hw] junction table内核参数[hw] kernel parameter键[hw] key键列[hw] key column键范围锁[hw] key range lock键集驱动游标[hw] keyset-driven cursor关键字[hw] keywordLCS客户端[hw] LCS clientLCS客户接入禁止列表[hw] LCS client access barring list LCS开户概况[hw] LCS client subscription profileLCS特性[hw] LCS featureLCS服务器[hw] LCS server定位测量单元[hw] LMU indicator本地交换局[hw] Local Exchange(local central office)本地移动台标识[hw] Local Mobile Station Identity位置区域[hw] Location Area定位测量单元[hw] Location Measurement Unit定位业务[hw] Location Service大级别[hw] large level上次已知位置[hw] last known location延迟[hw] latency合法拦截业务[hw] lawful interception services层[hw] layer叶[hw] leaf叶级[hw] leaf level叶成员[hw] leaf member左向外联接[hw] left outer join支路[hw] leg级别[hw] level级别层次结构[hw] level hierarchy库[hw] library链接多维数据集[hw] linked cube链接服务器[hw] linked server链接表[hw] linked table链接表[hw] linking table侦听SME [hw] listening SME活锁[hw] livelock本地多维数据集[hw] local cube本地分发服务器[hw] local distributor本地登录标识[hw] local login identification本地服务器[hw] local server本地业务[hw] local service本地订阅[hw] local subscription局部变量[hw] local variable区域设置标识符[hw] locale identifier地方化广告[hw] localized advertising按位置计费[hw] location based charging依靠位置的内容广播[hw] location dependent content broadcast位置估计[hw] location estimate位置号[hw] location number位置状态[hw] location status基于位置的信息业务[hw] location-based information services锁[hw] lock锁升级[hw] lock escalation日志文件[hw] log file逻辑名称[hw] logical name逻辑运算符[hw] logical operators登录(帐户)[hw] login (account)登录安全模式[hw] login security mode查找表[hw] lookup table低可用性SME [hw] low availability SME低延期[hw] low delay邮件传送代理[hw] Mail Transfer Agent维测服务器[hw] Maintenance and Test Server恶意呼叫识别[hw] Malicious Call Identification大众呼叫[hw] Mass Calling会聚式会议电话[hw] Meet-me Conference消息等待指示[hw] Message Waiting Indication消息等待通知[hw] Message Waiting Notification消息等待[hw] Messages-Waiting消息等待数据[hw] Messages-Waiting-Data消息等待指示[hw] Messages-Waiting-Indication消息应用程序接口[hw] Messaging Application Programming Interface 多媒体消息生成[hw] MM creation多媒体短消息下发[hw] MM delivery多媒体短消息提交[hw] MM submission多媒体消息时间标记[hw] MM time stampingMMS客户端[hw] MMS Client运营商控制的多媒体消息[hw] MMS control by the operator用户控制的多媒体消息[hw] MMS control by the userMMS封装[hw] MMS encapsulationMMS发送端/发送方MMS手机[hw] MMS originating terminalMMS发送者[hw] MMS originator多媒体消息网关[hw] MMS Proxy-Relay多媒体消息网关/调度中心[hw] MMS Relay/ServerMMS接收者[hw] MMS recipientMMS接收端/接收方MMS手机[hw] MMS recipient terminalMMS服务器(多媒体消息调度中心) [hw] MMS ServerMMS终端/MMS手机[hw] MMS terminalMMS用户代理[hw] MMS user agentMMS增值业务应用[hw] MMS VAS applications监控模块[hw] MONitor移动设备[hw] Mobile Equipment移动台[hw] Mobile Station移动台内存溢出标志[hw] Mobile-Station-Memory-Capacity-Exceeded-Flag移动台不可达标志[hw] Mobile-Station-Not-Reachable-Flag移动台不可达原因[hw] Mobile-Station-Not-Reachable-Reason移动梦网[hw] Monternet消息待发[hw] More-Messages-To-SendMSC区域[hw] MSC area多呼[hw] Multicall多维表达式[hw] Multidimensional Expressions多媒体短消息[hw] Multimedia Message多媒体信息业务[hw] Multimedia Messaging Service多媒体信息业务环境[hw] Multimedia Messaging Service Environment多媒体信息业务网络结构[hw] Multimedia Messaging Service Network Architecture多方通话[hw] MultiParty Service多重关联控制功能[hw] Multiple Association Control Function多方呼叫[hw] Multiway Calling机器DSN [hw] machine DSN生成表查询[hw] make table query管理功能构件[hw] management building block管理功能[hw] management function必须的[hw] mandatory多对多关系[hw] many-to-many relationship多对一关系[hw] many-to-one relationshipmaster 数据库[hw] master database主定义位置[hw] master definition site主文件[hw] master file主位置[hw] master site平均比特率[hw] mean bit rate度量值[hw] measure度量[hw] measurement媒体描述[hw] media description媒体家族[hw] media family媒体格式转换[hw] media format conversion媒体格式[hw] media formats媒体首部[hw] media header媒体名称[hw] media name媒体服务器[hw] media server媒体集[hw] media set媒体类型[hw] media type媒体种类转换[hw] media type conversion成员[hw] member成员委派[hw] member delegation成员组[hw] member group成员键列[hw] member key column成员名列[hw] member name column成员属性[hw] member property成员变量[hw] member variable备注[hw] memo合并[hw] merge合并复制[hw] merge replication消息体[hw] message body消息元素[hw] message element消息前转[hw] message forwarding消息头[hw] message header消息格式[hw] message layout消息编号[hw] message number消息限制[hw] message qualification消息过滤[hw] message screening消息业务[hw] messaging service元数据[hw] meta data方法[hw] method挖掘模型[hw] mining model镜像[hw] mirroring混合模式[hw] mixed mode移动号码可携带[hw] mobile number portability移动台[hw] mobile station移动台漫游号码[hw] mobile station roaming number 移动终止[hw] mobile termination移动黄页[hw] mobile yellow pages模型[hw] modelmodel 数据库[hw] model database模型相关性[hw] model dependency模块[hw] module取模[hw] modulomoney 数据类型[hw] money data type监视关系[hw] monitor relationship监视窗口[hw] monitor window多点传送业务[hw] multicast service多维OLAP [hw] multidimensional OLAP多维结构[hw] multidimensional structure多重继承[hw] multiple inheritance多实例[hw] multiple instances多线程服务器应用程序[hw] multithreaded server application多用户[hw] multiuser网络接入点[hw] Network Access Point网络决定的用户忙[hw] Network Determined User Busy网络功能体系[hw] Network Functional Architecture网络管理[hw] Network Manager北美紧急业务路由位[hw] North American Emergency Services Routing Digits北美紧急业务路由密钥[hw] North American Emergency Services Routing Key北美平等接入业务[hw] North American Equal Access北美GSM号码可携带[hw] North American GSM Number Portability北美编号方案[hw] North American Numbering Plan编码方案识别[hw] Numbering Plan Identity名称句式[hw] name phrasing命名实例[hw] named instance命名管道[hw] named pipe命名集[hw] named set命名关系[hw] naming relationship本机格式[hw] native format导航[hw] navigationnchar 数据类型[hw] nchar data type嵌套查询[hw] nested query嵌套表[hw] nested table网络[hw] network网络需求监控[hw] network demand monitoring网络操作员[hw] network operator网络提供商[hw] network provider别名[hw] nicknameniladic 函数[hw] niladic functions无延期[hw] no delay干扰词[hw] noise word非聚集索引[hw] nonclustered index非叶[hw] nonleaf非叶成员[hw] nonleaf member不可重复读取[hw] nonrepeatable read(短消息)普通优先级[hw] normal priority规范化规则[hw] normalization rulesntext 数据类型[hw] ntext data type为空性[hw] nullability号码可携带[hw] number portability号码范围所有者网络[hw] number range owner network。
7HFKQRORJ\ PDSSLQJ XVLQJ 6,6Laboratory 2in course “Logic synthesis”2002-versionWritten by Tomas Bengtsson and Shashi KumarÃÃ,QWURGXFWLRQ BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB'RFXPHQWV QHHGHG IRU WKLV ODEBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB5HFRPPHQGHG SUHSDUDWLRQV IRU WKLV ODE BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB6KRUW LQWURGXFWLRQ WR )3*$V BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB,QIRUPDWLRQ DERXW &/%V XVHG LQ WKLV ODE BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB7DVNV BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB0DNLQJ VFULSWV IRU WHFKQRORJ\ PDSSLQJ BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB7HFKQRORJ\ PDSSLQJ RI PXOWLSOLHUBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB7HFKQRORJ\ PDSSLQJ RI *UD\ FRGH FRQYHUWHU BBBBBBBBBBBBBBBBBBBBBBBBBBB7HFKQRORJ\ PDSSLQJ RI D EHQFKPDUN BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB$Q H[DPSOH RI 7HFKQRORJ\ PDSSLQJ BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB'HVFULSWLRQ RI H[DPSOH BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB6RPH WLSVBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB7KH H[DPSOH WKURXJK 6,6BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBDecomposition_____________________________________________97.3.1. Gate7.3.2. LUTMapping_________________________________________________11commands_______________________________________127.3.3. Post-processing7.3.4. Programmable Logic Block Generation_____________________________14ÃÃ,QWURGXFWLRQAfter a circuit has been optimized using Logic Optimization tools, the next step is to bring the circuit closer to implementation by using the available information about implementation technology. This step is called Technology Mapping. This step involves converting the abstract description (FSM or Boolean functions) of the circuit to a network of limited type of components, normally from a library of components. Due to this reason, Technology Mapping is also sometimes referred as Library Binding. This step involves, selecting components from the library and forming a network of these components. Normally the objectives in Technology Mapping are to have the final implementation using a minimum number of components or to minimize the area of the implementation.Technology mapping to an FPGA results in the final implementation suitable for a specific FPGA type from a specific company. This is because the internal architecture of FPGAs from different companies is quite different. The internal architectures of various FPGAs from the same company also differ depending on the component series. For example, XILINX 4000 series FPGA has different type of logic blocks as compared to 3000 series. There are two further steps after a circuit has been converted to a network of blocks of a FPGA. These steps are called 3ODFHPHQW and 5RXWLQJ. In the placement step, the logic blocks in the network are assigned specific physical blocks within the FPGA. In the routing step, the used logic blocks are connected using programmable interconnection resources.In this laboratory, we are only concerned with the first step, which is converting the abstract design to a network of logic blocks for Xilinx FPGA family.'RFXPHQWV QHHGHG IRU WKLV ODEAmong the documents from the first lab you will need the document from UCLA (University of California Los Angeles), which describes the extension of SIS for technology mapping. In this document we recommend you to skip the first part and start reading the part starting with a header “Commands provided by UCLA FPGA Mapping Package”. This documents can be found in Appendix A of this lab manual.A “hand-in” form that you have to fill in to pass the lab is also given. That hand in form and this lab manual can be found in Pingpong.5HFRPPHQGHG SUHSDUDWLRQV IRU WKLV ODETo be able to use the lab time more efficient we recommend you to study the document from UCLA the part mentioned in section 2 “Documents needed for this lab”. It is also recommended that you complete the task described in section 6.1 “Task 1 Making scripts for technology mapping” before the lab.ÃÃ6KRUW LQWURGXFWLRQ WR )3*$VFPGAs are one family of programmable logic circuits. An FPGA contains programmable logic blocks and programmable interconnection between the blocks. The programmable blocks are called CLBs (Complex Logic Block). The CLBs contain one or more LUTs (Look Up Table). A LUT is a combinatory device with some inputs and one output. It can be programmed to realize any Boolean function. The CLB can be programmed so the output of the LUTs goes to the output of the CLB direct or via a flip-flop. This can be done individually for every LUT. The inputs to the CLB are connected to the inputs in the LUTs. If the CLB contains more than one LUT, some inputs to the CLB may be connected to inputs in more than one LUT.To connect outputs and inputs of CLBs to other CLBs and to the ports of a chip the programmable interconnection part is used. In this lab we are not going to deal with this. We are only going to map logic into fit CLBs. We will use some old FPGAs, Xilinx3000 – series and Xilinx4000 – series. For our purpose we don’t gain anything by using newer ones. The CLBs in both series has two LUTs. The LUTs in Xilinx3000 – series has four inputs and in Xilinx4000 – series they have five inputs.The picture below shows an example of a simple CLB. The CLBs we will use in this lab looks a little different.,QIRUPDWLRQ DERXW &/%V XVHG LQ WKLV ODEAs written in the previous section the LUTs in Xilinx 3000-series have four inputs each and in Xilinx 4000-series the LUTs have five inputs each. The parameter “-k” used in many technology-mapping commands should specify number of inputs to one LUT.ÃÃ7DVNV7DVN 0DNLQJ VFULSWV IRU WHFKQRORJ\ PDSSLQJIn this task you should prepare scripts for technology mapping. Make one script containing technology-mapping commands, which makes optimization with respect to area minimization for mapping to Xilinx 3000-series. Make another script doing the same but for minimizing the depth of the circuit. Copy those scripts and modify the copies to work for Xilinx 4000-series. You don’t need to put the final commands “match_3k” and “match_4k” into the scripts. You can write those commands in the SIS-prompt when you need them instead.Fill in the scripts in the “hand-in” form.7DVN 7HFKQRORJ\ PDSSLQJ RI PXOWLSOLHUIn this task you should use your multiplier from the previous lab and make technology mapping in some different ways. In this lab you should alter the following parameters:• You can either use technology-independent optimization before you make technology mapping or you can skip technology-independent optimization. When you are making technology-independent optimization in this task you should use “rugged-script”• You can optimize for area or for depth. To do this you should use your scripts from the previous task.• You can technology-map for either Xilinx 3000-series or Xilinx 4000-series.The alternatives enumerated above makes eight different combinations of optimizations. Make those and fill in the required results in the “hand-in” form. There are also some questions in the “hand-in” form you should answer.7DVN 7HFKQRORJ\ PDSSLQJ RI *UD\ FRGH FRQYHUWHUIn this task you should use the “Gray-code to binary converter” you have made in the previous lab. The task is to technology-map it so it fits into two CLBs in Xilinx 3000-series. Do this and answer the questions in the “hand-in” form!7DVN 7HFKQRORJ\ PDSSLQJ RI D EHQFKPDUNIn this task you should technology-map the benchmark “t481.pla”. You should map it so that it only requires five LUTs in Xilinx 3000-series. This is the goal of this task and you decide what should be done to get there. Answer the questions in the “hand-in”-form!$Q H[DPSOH RI 7HFKQRORJ\ PDSSLQJ'HVFULSWLRQ RI H[DPSOHTo describe an example of technology mapping, an FSM to control one traffic light is used. This traffic-light controller is nothing that can be used in traffic rather it can be used to show a traffic light fitting in a fair. The controller is made as a Moore-machine.ÃÃThe FSM has three inputs. The first input let the traffic-light run in normal mode if it’s “0”, and in a mode with twinkle amber (amber ≈ yellow) if it is “1”. In the normal mode the traffic light is red, green or it is on its way between. If the second input is “1”, when the traffic light is green, it is forced to red via amber. If the third input is “1”, when the traffic light is red, it is forced to green via red_amber.The outputs from the FSM are signals to the three lamps. It is in the order green, amber and red, and “1” means on.The state-diagram below shows the system.ÃÃA description of this in kiss-format is shown below:.start_kiss.i 3.o 300- green green 10001- green amber 1001-- green twinkle_amber 1000-- amber red 0101-- amber twinkle_dark 0100-0 red red 0010-1 red red_amber 0011-- red twinkle_amber 0010-- red_amber green 0111-- red_amber twinkle_amber 0110-- twinkle_amber red 0101-- twinkle_amber twinkle_dark 0100-- twinkle_dark amber 0001-- twinkle_dark twinkle_amber 000.end_kiss.endThis file is available as “/home/beto/public/logic_synthesis/traf.kiss” in the UNIX-system.6RPH WLSVIt’s good to use commands like “print_stats” and “print_level” to see what is happening between the different steps in the optimization and mapping process. Also remember that “write_blif” can give some useful information in some cases.7KH H[DPSOH WKURXJK 6,6First we make the technology independent optimization. (That is what the first laboratory was about.) We use “state_minimize”, “state_assign” and then run “rugged-script”. We then get: UC Berkeley SIS with UCLA FPGA Extension (compiled 2-Apr-98 at 11:09 PM) VLV! UHDGBNLVV WUDI NLVV.start_kissVLV! VWDWHBPLQLPL]HRunning stamina, written by June Rho, University of Colorado at Boulder Number of states in original machine : 6Number of states in minimized machine : 5VLV! VWDWHBDVVLJQRunning nova, written by Tiziano Villa, UC BerkeleyWarning: network ‘SISEAAa29918’, node "v0" does not fanoutWarning: network ‘SISEAAa29918’, node "v1" does not fanoutWarning: network ‘SISEAAa29918’, node "v2" does not fanoutVLV! VRXUFH UXJJHGVLV! ZULWHBEOLI.model traf.kiss.inputs IN_0 IN_1 IN_2.outputs OUT_0 OUT_1 OUT_2.latch v6.0 LatchOut_v3 1.latch v6.1 LatchOut_v4 1ÃÃ.latch v6.2 LatchOut_v5 0.start_kiss.i 3.o 3.p 12.s 5.r S10-- S0 S2 0101-- S0 S3 0100-0 S2 S2 0010-1 S2 S4 0011-- S2 S0 0010-- S3 S0 0001-- S3 S0 0000-- S4 S1 0111-- S4 S0 01100- S1 S1 10001- S1 S0 1001-- S1 S0 100.end_kiss.latch_order LatchOut_v3 LatchOut_v4 LatchOut_v5.code S0 000.code S2 111.code S3 001.code S4 010.code S1 110.names LatchOut_v3 LatchOut_v5 OUT_010 1.names LatchOut_v3 LatchOut_v5 OUT_100 1.names OUT_0 LatchOut_v4 OUT_201 1.names v6.1 v6.2 LatchOut_v5 v6.011- 11-0 1.names IN_0 IN_1 OUT_1 OUT_2 LatchOut_v5 v6.10-1-- 10--1- 100--0 1.names IN_0 IN_2 LatchOut_v4 LatchOut_v5 v6.2--00 10011 1.exdc.inputs IN_0 IN_1 IN_2 LatchOut_v3 LatchOut_v4 LatchOut_v5 .outputs v6.0 v6.1 v6.2 OUT_0 OUT_1 OUT_2.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.210- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_1ÃÃ10- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_210- 1011 1.endThe key-word “.exdc” means that the following blif-description is the don’t-care-set. The description above is the optimized description of the function where don’t-cares are forced to one and zero to make the function as small as possible.*DWH 'HFRPSRVLWLRQIn the description of technology mapping from UCLA, it’s written that command“tech_decomp” should be run before “dmig”-command is run. The parameter “-k 4” in the “dmig”-command is chosen to 4 because the plan is to map this to an FPGA with 4-input LUTs.VLV! WHFKBGHFRPS D RVLV! GPLJ NVLV! ZULWHBEOLI.model traf.kiss.inputs IN_0 IN_1 IN_2.outputs OUT_0 OUT_1 OUT_2.latch v6.0 LatchOut_v3 1.latch v6.1 LatchOut_v4 1.latch v6.2 LatchOut_v5 0.start_kiss.i 3.o 3.p 12.s 5.r S10-- S0 S2 0101-- S0 S3 0100-0 S2 S2 0010-1 S2 S4 0011-- S2 S0 0010-- S3 S0 0001-- S3 S0 0000-- S4 S1 0111-- S4 S0 01100- S1 S1 10001- S1 S0 1001-- S1 S0 100.end_kiss.latch_order LatchOut_v3 LatchOut_v4 LatchOut_v5.code S0 000.code S2 111.code S3 001.code S4 010.code S1 110.names LatchOut_v3 LatchOut_v5 OUT_010 1.names LatchOut_v3 LatchOut_v5 OUT_1ÃÃ00 1.names OUT_0 LatchOut_v4 OUT_201 1.names [21] [22] v6.01- 1-1 1.names [25] [26] [27] v6.11-- 1-1- 1--1 1.names [23] [24] v6.21- 1-1 1.names v6.1 LatchOut_v5 [21]10 1.names v6.1 v6.2 [22]11 1.names IN_0 IN_2 LatchOut_v4 LatchOut_v5 [23]0011 1.names LatchOut_v4 LatchOut_v5 [24]00 1.names IN_0 IN_1 LatchOut_v5 [25]000 1.names IN_0 OUT_2 [26]01 1.names IN_0 OUT_1 [27]01 1.exdc.inputs IN_0 IN_1 IN_2 LatchOut_v3 LatchOut_v4 LatchOut_v5 .outputs v6.0 v6.1 v6.2 OUT_0 OUT_1 OUT_2.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.210- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_210- 1011 1.endÃÃ/87 0DSSLQJWhen gate decomposition is done there are some commands to choose between, which map the function to LUTs (Look Up Tables).VLV! GDJPDS NVLV! ZULWHBEOLI.model traf.kiss.inputs IN_0 IN_1 IN_2.outputs OUT_0 OUT_1 OUT_2.latch v6.0 LatchOut_v3 1.latch v6.1 LatchOut_v4 1.latch v6.2 LatchOut_v5 0.start_kiss.i 3.o 3.p 12.s 5.r S10-- S0 S2 0101-- S0 S3 0100-0 S2 S2 0010-1 S2 S4 0011-- S2 S0 0010-- S3 S0 0001-- S3 S0 0000-- S4 S1 0111-- S4 S0 01100- S1 S1 10001- S1 S0 1001-- S1 S0 100.end_kiss.latch_order LatchOut_v3 LatchOut_v4 LatchOut_v5.code S0 000.code S2 111.code S3 001.code S4 010.code S1 110.names LatchOut_v3 LatchOut_v5 OUT_010 1.names LatchOut_v3 LatchOut_v5 OUT_100 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_201- 1-11 1.names [21] [22] v6.01- 1-1 1.names [25] [26] [27] v6.11-- 1-1- 1--1 1.names IN_0 IN_2 LatchOut_v4 LatchOut_v5 v6.2--00 10011 1.names LatchOut_v5 [25] [26] [27] [21]01-- 1ÃÃ0-1- 10--1 1.names v6.2 [25] [26] [27] [22]11-- 11-1- 11--1 1.names IN_0 IN_1 LatchOut_v5 [25]000 1.names IN_0 LatchOut_v3 LatchOut_v4 LatchOut_v5 [26]001- 10-11 1.names IN_0 LatchOut_v3 LatchOut_v5 [27]000 1.exdc.inputs IN_0 IN_1 IN_2 LatchOut_v3 LatchOut_v4 LatchOut_v5.outputs v6.0 v6.1 v6.2 OUT_0 OUT_1 OUT_2.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.210- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_210- 1011 1.end3RVW SURFHVVLQJ FRPPDQGVThe post-processing command “mpack” can for some cases merge two LUTs into one LUT. VLV! PSDFN NVLV! ZULWHBEOLI.model traf.kiss.inputs IN_0 IN_1 IN_2.outputs OUT_0 OUT_1 OUT_2.latch v6.0 LatchOut_v3 1.latch v6.1 LatchOut_v4 1.latch v6.2 LatchOut_v5 0.start_kiss.i 3.o 3.p 12.s 5.r S10-- S0 S2 0101-- S0 S3 010ÃÃ0-0 S2 S2 0010-1 S2 S4 0011-- S2 S0 0010-- S3 S0 0001-- S3 S0 0000-- S4 S1 0111-- S4 S0 01100- S1 S1 10001- S1 S0 1001-- S1 S0 100.end_kiss.latch_order LatchOut_v3 LatchOut_v4 LatchOut_v5.code S0 000.code S2 111.code S3 001.code S4 010.code S1 110.names LatchOut_v3 LatchOut_v5 OUT_010 1.names LatchOut_v3 LatchOut_v5 OUT_100 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_201- 1-11 1.names [21] [22] v6.01- 1-1 1.names [25] [26] [27] v6.11-- 1-1- 1--1 1.names IN_0 IN_2 LatchOut_v4 LatchOut_v5 v6.2--00 10011 1.names LatchOut_v5 [25] [26] [27] [21]01-- 10-1- 10--1 1.names v6.2 [25] [26] [27] [22]11-- 11-1- 11--1 1.names IN_0 IN_1 LatchOut_v5 [25]000 1.names IN_0 LatchOut_v3 LatchOut_v4 LatchOut_v5 [26]001- 10-11 1.names IN_0 LatchOut_v3 LatchOut_v5 [27]000 1.exdc.inputs IN_0 IN_1 IN_2 LatchOut_v3 LatchOut_v4 LatchOut_v5 .outputs v6.0 v6.1 v6.2 OUT_0 OUT_1 OUT_2.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.110- 1011 1ÃÃ.names LatchOut_v3 LatchOut_v4 LatchOut_v5 v6.210- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_010- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_110- 1011 1.names LatchOut_v3 LatchOut_v4 LatchOut_v5 OUT_210- 1011 1.end3URJUDPPDEOH /RJLF %ORFN *HQHUDWLRQIn our installation of SIS it is possible to map to Xilinx 3000 and 4000 –series.VLV! PDWFKB N Y##PI=3 #PO=3 #LUT=11 #CLB=6 #LEVEL=3#0001: ( OUT_2 , v6.2 )#0002: ( OUT_1 , [26] )#0003: ( OUT_0 , [27] )#0004: ( v6.1 , [21] )#0005: ( v6.0 , [25] )#0006: ( [22] ) sis> match_3k -vThe argument “-v” makes it print the list about which LUTs should be in the same CLB. $SSHQGL[$SSHQGL[ $+--------------------------------------------------------------------------+ | RASP_SYN: LUT-Based FPGA Technology Mapping Package (Release B 1.0) | | -- Synthesis Core of the UCLA RASP Systems | +--------------------------------------------------------------------------+ | Copyright (C) 1991-1997 the Regents of University of California | +--------------------------------------------------------------------------+ | Authors: Eugene Ding, VLSI CAD Lab, UCLA CS Dept. <eugene@> | | Yean-Yow Hwang, VLSI CAD Lab, UCLA CS Dept.<yeanyow@>| | Chang Wu, VLSI CAD Lab, UCLA CS Dept. <changwu@> | | Songjie Xu, VLSI CAD Lab, UCLA CS Dept. <sxu@> | | Project Director: Prof. Jason Cong, UCLA CS Dept. <cong@> | +--------------------------------------------------------------------------+ | This release includes the following mapping algorithms: | | DAG_Map version 1.0 | | FlowMap version 2.1 | | FlowMap-r version 2.0 | | FlowSYN version 2.0 | | CutMap version 1.2 | | ZMap version 1.0 | | TurboMap version 1.0+--------------------------------------------------------------------------+ -------------------<0> ACKNOWLEDGEMENTÃÃ-------------------The FlowMap and CutMap and TurboMap packages are integrated into the SIS system and uses many of the routines provided by SIS. The SIS system was developed in UC Berkeley Electronic Research Lab.--------------------------------------<1> RELEASE AGREEMENT AND CONTACT INFO--------------------------------------Please refer to "release.statement".-----------<2> CONTENT-----------sis -- binary of SIS compiled with FlowMap andCutMap packages.doc -- this file.release.statement -- to be read first.rasp_syn -- a csh script of FPGA mappingselect -- mapping result selectorThis release contains programs primarily developed by September 1997. More functions will be added to future release when they are stablized. It runs on Sun SPARCstation under SunOS 4.1.3 and Solaris.Some commands are not included in the release due to nondisclosure agreement.RASP_SYN package provides a complete solution to SRAM-based FPGA mapping engine. The entire flow of RASP_SYN is:1. gate decomposition to get K-bounded circuit, where K is thefanin limit of LUTs of the target architecture2. generic LUT mapping3. post-processing mainly for area reduction4. architecture specific mapping.RASP_SYN comes with a user-friendly csh script for the ease of use. However, you can modify the script or write your own based on your specific needs.------------------------<3> TECHNICAL REFERENCES------------------------J. Cong, Y. Ding, "An Optimal Technology Mapping Algorithm for DelayOptimization in Lookup-Table based FPGA Designs," IEEE Trans. on CAD, Vol. 13, No. 1, Jan. 1994, pp. 1-12.J. Cong, Y. Ding, "On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping," IEEE Trans. on VLSI Systems, Vol 2., No. 2, June 1994,pp. 137-148.J. Cong, Y. Ding, T. Gao, K. Chen, "LUT-Based FPGA Technology Mappingunder Arbitrary Net-Delay Models," Computers & Graphics,Vol.18, No.4, 1994, 507-516.J. Cong, Y. Ding, "Beyond the Combinatorial Limit in Depth Minimization for LUT-Based FPGA Designs," Proc. 1993 IEEE/ACM Int’l Conf. on CAD,Santa Clara, CA, Nov. 1993, pp. 110-114.K.Chen, J.Cong, Y.Ding, A.Kahng, P.Trajmar, "DAG-MAP: Graph-BasedÃÃFPGA Technology Mapping for Delay Optimization," IEEE Design & Testof Computers, Sept. 1992J. Cong, J. Peck, Y. Ding, "RASP: A General Logic Synthesis System forSRAM-based FPGAs," Proc. ACM 4th Int’l Symp. on FPGA, pp. 137-143, 1996J. Cong, Y. Hwang, "Simultaneous Depth and Area Minimization in LUT-BasedFPGA Mapping," Proc. ACM 3rd Int’l Symp. on FPGA, Feb. 1995, pp. 68-74.J. Cong, Y. Hwang, "Structural Gate Decomposition for Depth-OptimalTechnology Mapping in LUT-based FPGA Designs," Proc. ACM/IEEE 33rdDesign Automation Conf., pp. 726-729, 1996.J. Cong, C. Wu, "An Improved Algorithm for Performance Optimal TechnologyMapping with Retiming in LUT-Based FPGA Design," Proc. IEEE InternalConference on Computer Design, pp. 572-578, 1996Xilinx, FPGA Data Book, 1994---------<4> USAGE---------4.1 Running with a super scriptSuper Script of UCLA FPGA MappingUsage: rasp_syn circuit -sis path -k k -device xc3k/xc4k -algo algo -relax r -objective area/delay/tradeoff/allRasp_syn is a csh script for an easy usage of UCLA FPGA Mapping algorithms.In default, the input is in EQN format with extension .eqn. The output isan LUT network with/without matching information in EQN format as well.Please keep the program "select" in the current directory.To use other data formats as BLIF or SLIF which are supported by SIS of UCB, please set FMT in rasp_syn script to blif or slif and use .blif or .slifas the name extension of the input file. The output format will be changed automatically, except the CLB matching file format, which will be keptin EQN format. For Xilinx XC3K/XC4K CLBs, the CLB clustering informationwill be presented as:#CLB_number: (lut1, lut2)lut1 = ..lut2 = ..There are two ways to run rasp_syn:1. Running with single given mapping algorithmThe algorithm must be specified with option -algo algorithm. The targetis K-LUT. The output circuit is in circuit.k in EQN format.2. Running with multiple algorithmsRasp_syn can run all the built-in algorithms automatically and returnthe best result (in terms of area or delay) or a set of resultsbased on area-delay tradeoff or all the results for you.To run multiple algorithms, you simply do not specify any algorithm with-algo option.OptionsÃÃ-sis Specify the path of sis. The default is sis and the pathmust be specified in the environment.-k Used only in single algorithm mode. K is the input numberof LUTs. The output is in circuit.k.-device Used only in multi-algorithm mode. This is the default mode. The current supported devices are:xc3k Xilinx XC3000 Familyxc4k Xilinx XC4000 Family-algo Specify the mapping algorithm in single algorithm mode.The current supported algorithms are:flowmap: FlowMapflowmap-r: FlowMap-rflowsyn: FlowSYNcutmap: CutMapzmap: ZMap for delayzma: ZMap for area-relax Used only in single algorithm mode with FlowMap-r.R is the depth relaxation.-objective Used only in multi-algorithm mode. The objective can be:area: Area first. This is the default objective.delay: Depth firsttradeoff: Area-delay tradeoffall: All the results4.2 Running SIS without the super scriptSIS is a complete logic synthesis package. All of the following commands have been built in SIS which can be run directly from SIS.Commands provided by UCLA FPGA Mapping Package--------------------------------------------------------------------1. Gate Decomposition Commands* dmig [ -k <K_value> ] [ -f ]Decompose a simple gate network into a K-bounded network(i.e. each gate has no more than K inputs), orcomplex gates into K-bounded gates with -f option.For obtaining a simple gate network, use sis command"tech_decomp -a 1000 -o 1000."-k specifies max. gate input size K, with a default value 2.-f decompose complex gates in the network* dogma [ -k <K_value> ]Decompose a simple gate network into a 2-bounded networksuch that flowmap, cutmap, or zmap can obtain a best (small) depth.-k specifies the LUT input size K, with a default value 5.--------------------------------------------------------------------2. LUT Mapping Commands* dagmap [ -k <K_value> ]Map a K-bounded network into a K-LUT network of small depthÃÃ(might not be optimal).-k specifies the LUT input size K, with a default value 5.* flowmap [ -k <K_value> ] [-r <R_value> ] [ -s <S_value> ]Map a K-bounded network into a K-LUT network of optimal depth,or within the optimal depth plus R.Area can be further reduced by post-processing packing routines.-k specifies the LUT input size K, with a default value 5.-r specifies the relaxed depth value R.If -r is not used, every node is at its optimal depth,-r 0 will trade depth on non-critical paths for a smaller area(the LUT network still has an optimal depth),-r R will allow depth to increase by R (then dfmap is called toreduce the area).-s specifies the cone input size S for which resynthesis of conesare performed for a smaller LUT network depth.* dfmap [ -k <K_value> ]Map a K-bounded network into a K-LUT network of optimal areaWITHOUT any node duplication.It is used after flowmap -r and mffc_shrink, and is followedby a LUT packing procedure. For example, we use dfmap in"flowmap -k 5 -r 1; mffc_shrink -k 5; dfmap -k 5; greedy_pack -k 5"-k specifies the LUT input size K, with a default value 5.* cutmap [ -k <K_value> ] [-x ]Map a K-bounded network into a K-LUT network of optimal depthwith simultaneous area minimization.Area can be further reduced by post-processing packing routines.-k specifies the LUT input size K, with a default value 5.-x specifies depth relaxation on non-critical paths.* zmap [ -k <K_value> ] [-c ]Map a K-bounded network into a K-LUT network of optimal depthwith simultaneous area minimization (cut enumeration approach).Area can be further reduced by post-processing packing routines.-k specifies the LUT input size K, with a default value 5.-c will minimize area only with no bound on depth* turbomap [ -k <K_value> ] [-c <clock_value> ] [ -a <area_reduction> ]Map a K-bounded network into a K-LUT network with the minimum clockperiod. Area can be further reduced by post-processing packing routines.-k specifies the LUT input size K,default value: 5.-c specifies an upper-bound on the clock period,-1: no upper-bound, (default)。
ABB Network PartnerRelay Configuration Tool (4)Specification for RE_ 54_ Configurations (5)Editing the RE_ 54_ Relay Terminal Configurations (6)Getting started (6)Libraries (6)Logical POUs (7)Program Organisation Unit (POU) (7)Physical hardware (9)Configuration (10)Resource (11)Hardware version (11)Analogue channels (11)Binary inputs (16)Measurements (17)Condition monitoring (18)Tasks (19)Programs and tasks (19)Task interval (19)Global variables (20)Declaring variables (21)Variables declared as global (25)Compiling the project (28)Main Configuration Rules for RE_ 54_ (29)General (29)Binary inputs (29)Explicit feedback (30)Measurement function blocks (31)Warnings (31)Execution order (32)F-key (33)APPENDIX A (35)APPENDIX B............................................................................................ 37-50 APPENDIX C............................................................................................ 51-65About this manualThis guideline describes in general the procedures for configuring the REF 54_ feeder terminals or REM 543 machine terminals correctly with the Relay Configuration Tool. Furthermore, chapter 4 provides some practical tips as well as recommendations and restrictions for doing the configuration.Please note that the examples and dialogue pictures of the Relay Configuration Tool in this manual refer to REF 54_ feeder terminals.1.Relay Configuration ToolThe Relay Configuration Tool, which is a standard programming system for RED500devices, is used for configuring the protection, control, condition monitoring, measure-ment and logic functions of the feeder terminal. The tool is based on the IEC 1131-3standard, which defines the programming language for relay terminals, and includes thefull range of IEC features. The PLC logics are programmed with Boolean functions,timers, counters, comparators and flip-flops. The programming language described inthis manual is a function block diagram (FBD) language.2.Specification for RE_ 54_ ConfigurationsPrior to starting the configuration of a relay terminal, the Specification for Relay Con-figuration is to be filled out. The specification can be found as appendix B for REF 54_and appendix C for REM 543 in the end of this manual.The purpose of the specification is to provide the technical information required for theproper configuration of the relay terminals.3.Editing the RE_ 54_ Relay Terminal Configurations 3.1.Getting startedStart up the tool by double clicking the icon. After adding a new object as an empty con-figuration to the CAP505 environment (refer to the CAP505 Operator’s Manual, 1MRS750838-RUM), the program opens an empty project template (see figure below) with atoolbar at the top. The next step is to build the project tree structure by inserting librar-ies, program organisation units (POUs) and target specific items to the project tree.The project tree editor is a window in which the whole project is represented as a tree.The project tree is illustrated with several icons. Most of the icons represent a file of theproject and different looking icons represent different types of files. The tree alwayscontains 4 subtrees: Libraries, Data Types, Logical POUs and Physical Hardware.Fig. 3.1-1. The project tree with its four subtrees.The project tree is the main tool for editing the project structure. Editing the projectstructure means inserting POUs or worksheets to the project structure or deleting exist-ing ones. The editors for editing the data of the code bodies and the variable declarationcan be called by double clicking the corresponding object icons.If you intend to edit an old project, note that saving the changes made with the “save as”project unchanged, the project has to be saved with a new name before making anychanges.3.1.1.LibrariesBefore editing any worksheets of POUs, the whole project tree structure must be build.The function block library (protection, control, measurement, condition monitoring andstandard functions) needed in the relay configuration is to be inserted to the “Libraries”subtree.Before inserting the library to the project, all worksheets are to be closed; otherwise theI/O description of function blocks will be confused. The programs, function blocks (e.g.NOC3Low, the low set stage of non-directional three-phase overcurrent protection) andfunctions of the library can be reused in the new project, which is edited.The library, e.g. REFLIB01 for REF54_ (see the figure below), includes all availablefunction blocks. Therefore, attention is to be paid to which function blocks can be usedin a specific configuration. For example, if the protection library PR116005(1MRS116005) has been ordered, the auto-reclose function block AR5Func cannot beinserted to the project since AR5Func is not included in that library.Fig. 3.1.1.-1. Libraries for REF54_ and REM 543.3.1.2.Logical POUsIn the project tree editor and in the library editor, the “Logical POUs” subtree representsa directory for all POUs related to the project. The maximum of 20 POUs can beinserted to the subtree. The figure below shows a “Logical POUs” subtree with 6 POUs;“Measure”, “Prot_Me” and “Co_CM_A” represent FBD (Function Block Diagram)programs, and “Horizon”, “CONDIS” and “SWG” are FBD function blocks.Fig. 3.1.2.-1. “Logical POUs” subtree with 6 POUs.3.1.3.Program Organisation Unit (POU)Each Program Organisation Unit, a POU, consists of several worksheets: a POUdescription worksheet for comments, a variable worksheet for variable declarations anda code body worksheet for the relay configuration. The name of each worksheet is indi-cated beside the corresponding icon and the *-symbol after the name of a worksheetindicates that the worksheet has not been compiled yet.Fig. 3.1.3.-1. Program organisation unit with three worksheets.The description worksheet (e.g. ProtectT) illustrated below is for describing the POU or the configuration element. The worksheet is named by adding a ’T’ to the name of the POU.Fig. 3.1.3.-2. Description worksheet.The variable worksheet (e.g. ProtectV) is for the variable declaration. The worksheet is named by adding a ’V’ to the name of the POU.Fig. 3.1.3.-3. Variable declaration worksheet.A code body worksheet (e.g. Protect, Measure) is for a code body declaration in theform of an FBD, a Function Block Diagram. All configurations for relays of the RED500 platform are made in the graphical FBD language. A code body programmed in theFBD language is composed of functions and function blocks that are connected to eachother using variables or lines. An output of a function block can be connected to the out-put of another function block only via an OR gate (refer to section 4.1.)Fig. 3.1.3.-4. Code body declaration in FBD language.Even though the tool permits adding several graphical worksheets under one POU, onlyone worksheet is recommended to be used per POU. If more space is needed for a con-figuration, the worksheet size can be increased or, if more I/O points are required, thefunctionality can be divided to several POUs. Note that one POU has altogether 511 I/Opoints available for function blocks. For example, the function block NOC3High in thefigure above includes 15 I/O points, which means that there are still 496 I/O pointsavailable.3.1.4.Physical hardwareIn the project tree editor, the physical hardware is represented as a subtree (see below)after the hardware of the relay terminal, i.e. Configuration, Resource and Tasks, hasbeen defined.Fig. 3.1.4.-1. Example of a subtree for the physical hardware.The configuration elements available in the “Physical Hardware” subtree may differfrom configuration to configuration. Each terminal of the RED 500 platform can beconfigured separately.3.1.4.1.ConfigurationThe name and target of the configuration are first defined in the dialogue Properties/Configuration.Fig. 3.1.4.1.-1. Defining the configuration type.3.1.4.2.ResourceThe configuration “Conf” above is for the REF 543 resource (the selected processortype), which is defined in the dialogue Properties/Resource. The resource must also begiven a name.Fig. 3.1.4.2.-1. Defining the processor type.Hardware versionAfter selecting the processor type, click “Settings...” in the dialogue Properties/Resource (see figure above) to define the correct hardware version.Note! After selecting the correct hardware version (Relay Variant; see figure below), donot click OK but wait until the next dialogue opens and select “Analog Channels” (seefigure 3.1.4.2.-3.).Fig. 3.1.4.2.-2. Defining the hardware version.Analogue channelsIn the dialogue Settings/Analog Channels, click each channel in turn to select the meas-uring device and signal type for the channels used and select “Not in use” for otherchannels.Furthermore, the technical data and measurements for the selected channels are to becompleted correctly before the configuration is used in a real application.Fig. 3.1.4.2.-3. Defining the analogue channels.Technical dataFig. 3.1.4.2.-4. Defining the rated values for the selected channel.MeasurementsFor information about the special measurements required for each function block, refer to the Technical Descriptions of Functions (CD-ROM 1MRS 750889-MCD).Phase currents and voltagesIf the signal type selected for an analogue channel is to be shown in the MIMIC view via the MMIDATA_ function block (MIMIC dynamic data point), the true RMS mode must be selected in the “Special Measurements” dialogue. Moreover, in case the Inrush3 function block (3-phase transformer inrush and motor start-up current detector) is to be used, the 2nd harmonic restraint must be selected for the analogue channels (IL1, IL2, IL3) used.Fig. 3.1.4.2.-5. Selecting the required special measurement modes for phase current measurement.Neutral currentWhen e.g. the DEF2_ function block (directional earth-fault protection) is going to be used, intermittent earth-fault protection must be selected for the channel via which the current Io is measured. Unless intermittent earth-fault protection has been chosen, the following configuration error indication will appear on the display of the relay terminal ( # denotes the number of the analogue channel in question):System: SUPERVCh # errorFig. 3.1.4.2.-6. Selecting the required special measurement modes for neutral current measurement.FrequencyWhen, for example, any of the function blocks MEFR_ (system frequency measure-ment), SCVCSt_ or Freq1St_ is in use, frequency measurement must be selected for the channel via which the voltage is measured for frequency measurement (for example: Channel 10, Voltage Transformer 4, Signal type U3 / Measurements button in the “Con-figuration of REF543” dialogue).Fig. 3.1.4.2.-7. Selecting the required special measurement modes for frequency meas-urement.Virtual channelsIn case no measuring devices are applied for measuring residual voltage (Uo) and neu-tral current (Io), the virtual channels 11 and 12 must be used.Fig. 3.1.4.2.-8. Using virtual channels 11 and 12 in case no measuring devices are applied for measuring Io and Uo.In case of the virtual channel 12, voltage measuring devices must be associated with phase voltages.Fig. 3.1.4.2.-9. Associating voltage measuring devices with phase voltages.After a compiled configuration is downloaded to a relay and the relay is started (storing and resetting are done), it will internally check whether the analogue channels are cor-rectly configured regarding the analogue inputs of function blocks. If the connectedchannels have been configured incorretly, the ERR output signal of the specific function block goes active and the event E48 is sent. Furthermore, either the event E13 or E5 is sent depending on the function block in question.Binary inputsThe filter time is set for each binary input of the relay terminal via the resource settings dialogue “Binary Inputs”. Inversion of the inputs can also be set. For further informa-tion refer to the Technical Reference Manual of REF 54_ or REM 543.Fig. 3.1.4.2.-10. Defining the binary inputs.MeasurementsWhen the MEPE7 function block (power and energy measurement) is used, the measur-ing mode must be selected via the resource settings dialogue “Measurements”.Fig. 3.1.4.2.-11. Selecting the measuring mode for power and energy measurement.Condition monitoringValues for the circuit-breaker wear function blocks CMBWEAR 1 and 2 can be set via the resource settings dialogue “Condition Monitoring”.Fig. 3.1.4.2.-12. Setting the values for circuit-breaker wear.3.1.4.3.TasksPrograms and tasksPrograms are associated with tasks via the dialogues Properties/Task and Properties/Program. Cyclic tasks are activated within a specific time interval and the program isexecuted periodically.The two dialogues below illustrate the association of a program type (Prot_Me) with atask (Task1) (see also figure 3.1.4.-1. in section “Physical hardware”).Fig. 3.1.4.3.-1. Naming a cyclic task.Fig. 3.1.4.3.-2. Associating the selected task with the desired program type.Task intervalGenerally, the operation accuracy is increased when the task speed is increased, but atthe same time, the load of the microprocessors is increased as well. Although the taskspeed can be freely chosen with the tool, it is necessary to determine a maximum taskexecution interval for each function block; otherwise the operation accuracy and operatetimes for protection functions cannot be guaranteed. The maximum task executioninterval is based on test results and has also been used in the type testing of the functionblocks. The recommended task execution interval quaranteed by the manufactirer canbe found in section Technical Data in the technical description of each function block.According to the standard, the Relay Configuration Tool includes the possibility ofdefining the tasks on two different levels:1) each POU (= program organisation unit) can be tied to a separate task2) a separate function block inside a POU can be tied to any taskHowever, the alternative 2) is not yet supported in the RED environment, which meansthat if a separate function block inside a POU is given a separate task definition, it willbe ignored when transferred to the relay. This means that when the function blocks arebeing placed in different POUs, not only the category of the function (protection, con-trol, etc.) but also the maximum task execution interval should be considered since allfunction blocks inside a POU will run at the same speed.For further information about the microprocessor loads and task execution intervals offunction blocks refer to the manual “Technical Descriptions of Functions, Introduction”(CD-ROM: Technical Descriptions of Functions, 1MRS750889-MCD).The task execution interval for each task is defined via the dialogue Properties/Task(click “Settings...”). For example, the task execution interval for Task1 in figure belowis defined as 10 ms, which means that the program Prot_Me is run 100 times per onesecond.Fig. 3.1.4.3.-3. Setting the task execution interval for a program.3.2.Global variablesThe physical contacts of RE_ 54_ are defined in the “Global Variables” worksheet.Declarations for the physical contacts are automatically defined when the correct hard-ware version of RE_ 54_ is selected. Declarations for the analogue channels are createdafter the analogue channel settings defined in the resource settings dialogue have beenapproved.Fig. 3.2-1. Global Variables worksheet.3.3.Declaring variablesAt its beginning, each programmable controller POU type declaration is to contain atleast one declaration part that specifies the types of the variables used in the organisa-tion unit. The declaration part shall have the textual form of one of the keywordsV AR_INPUT, VAR_OUTPUT, V AR and V AR_EXTERNAL followed by one or moredeclarations separated by semicolons and terminated by the keyword END_V AR. Allthe comments you write must be edited in parentheses and asterisks.(**********************************)(*Variable declaration*)(*of REF 541*)(**********************************)Caution is required regarding comments and variable declarations. The following codeexample will be compiled successfully but because of the non-closed comment theEND_VAR - V AR_EXTERNAL couple will be excluded and thus the channel numbersbecome local variables of the POU and they get the initial value zero.V AR (*AUTOINSERT*)NOC3Low_1:NOC3Low; (* Erroneous nonclosed comment *END_VARV AR_EXTERNALU12:SINT;(* Measuring channel 8 *)U23:SINT;(* Measuring channel 9 *)U31:SINT;(* Measuring channel 10 *)END_VARThree examples of creating the textual declaration for different kinds of graphical pro-grams are given below.EXAMPLE 1.•POU type:FBD program •Function block type declaration: VARINPUT1:BOOL :=FALSEINPUT2:BOOL :=FALSEINPUT3:BOOL :=FALSEOUTPUT:BOOL :=FALSE END_VARFig. 3.3-1. Function block image.EXAMPLE 2.•POU type:NOC3Low, manufacturer dependent function block •Function block type declaration:V AR_INPUTIL1:SINT :=0;(* Analogue channel *)IL2:SINT :=0;(* Analogue channel *)IL3:SINT :=0;(* Analogue channel *)BS1:BOOL :=FALSE;(* Blocking signal *)BS2:BOOL :=FALSE;(* Blocking signal *)TRIGG:BOOL :=FALSE;(* Triggering *)GROUP:BOOL :=FALSE;(* Grp1/Grp2 select *)DOUBLE:BOOL :=FALSE;(* Doubling signal *)BSREG:BOOL :=FALSE;(* Blocking registering *)RESET:BOOL :=FALSE;(* Reset signal *)END_VARV AR_OUTPUTSTART:BOOL :=FALSE; (* Start signal *)TRIP:BOOL :=FALSE; (* Trip signal *)CBFP:BOOL :=FALSE; (* CBFP signal *)ERR:BOOL :=FALSE; (* Error signal *)END_VARFig. 3.3-2. Function block image of NOC3Low.EXAMPLE 3.•POU type:Configurer dependent FBD function block CONDIS •Function block type declaration:Fig. 3.3-3. Type declaration of the configurer made function block CONDIS.Fig. 3.3-4. Use of the configurer made function block CONDIS.Fig. 3.3-5. Contents of the CONDIS function block.In the example 3 above, part of the configuration has been separated to a configurermade function block called CONDIS. Such function blocks may not be given namesalready belonging to library functions blocks or IEC standard function blocks. Thefunction block CONDIS has been used like any other function block in the graphicalprogram. The order of inputs of a function block that has been inserted to a worksheetmay not be changed. It must also be remembered that a function block with an instancenamed by the configurer can only be inserted to the project once.3.4.Variables declared as globalThe range of validity of the declarations included in the declaration part shall be“local”to the POU in which the declaration part is contained. One exception to this rule are var-iables that have been declared to be “global”. Such variables are only accessible to aPOU via a V AR_EXTERNAL declaration. The type of a variable declared in aV AR_EXTERNAL block shall agree with the type declared in the V AR_GLOBALblock of the associated program, configuration or resource.Fig. 3.4-1. Local and global variables.The figure above illustrates the ways how values of variables can be communicated among software elements. Variable values within a program can be communicated directly by connecting the output of one program element to the input of another or via local variables such as the variable y illustrated in the upper left corner of the figure above. In the same configuration, variable values can be communicated between pro-grams via global variables such as the variable x illustrated in “Configuration C” in the figure above. In such a case, make sure that the global variable is only written from one location in the project. The global variable can still be read from several locations. Do not use binary inputs or outputs for data transfer between tasks.Despite the fact that according to the IEC standard 1131-3 all local variables that have no initial value are initially FALSE (0), the initial values for all local variables have to be given in the variable worksheet of the logical POU. This is because somewhere in the configuration, especially in the beginning of running the configuration i.e. when the relay is started up, the variable can be used before the initial value has been created for the variable. The initial values for global variables are given in the global variable worksheet (see CASE 1 below).CASE 1. Variables declarationV ARIABLE WORKSHEET of logical POU*********************************************************************V ARTRIPPING:BOOL:= FALSE;BLOCK:BOOL:= TRUE;TMP1:BOOL:= FALSE;END_VARV AR_EXTERNALPS1_4_HSPO1 :BOOL; (* Double pole high speed power output *)(* 4.1/10,11,12,13 *)PS1_4_HSPO2 :BOOL; (* Double pole high speed power output *)(* X4.1/15,16,17,18 *)PS1_4_HSPO3 :BOOL; (* Double pole high speed power output *)(* X4.1/6,7,8,9 *)END_VARV AR_EXTERNALTCS1_ALARM:BOOL;END_VAR********************************************************************* GLOBAL V ARIABLE WORKSHEET*********************************************************************V AR_GLOBALPS1_4_HSPO1AT %QX 1.1.2 :BOOL := FALSE;(* Double pole high speed power output X4.1/10,11,12,13 *) PS1_4_HSPO2AT %QX 1.2.2 :BOOL := FALSE;(* Double pole high speed power output X4.1/15,16,17,18 *) PS1_4_HSPO3AT %QX 1.3.2 :BOOL := FALSE;(* Double pole high speed power output X4.1/6,7,8,9 *) END_VARV AR_GLOBALTCS1_ALARM:BOOL:= FALSE;END_VAR*********************************************************************piling the projectThe “Build Project” mode in the “Make” menu is used to compile the whole project forthe first time after editing, which means compiling all POUs, global variables, resourcesetc., whereas the “Make” mode can be used to compile the worksheets that have beenedited. The changed worksheets are marked with an asterisk in the project tree editor.“Make” is the standard mode for compiling and should normally be used when you havefinished editing.In the Relay ConfigurationTool you can view the execution order of the different func-tions or function blocks in your worksheet. The execution order corresponds to theintermediate PLC code created while compiling. Note that the execution order can onlybe seen if you have already compiled the worksheet using the menu item “CompleteWorksheet” in the submenu “Make”.By editing the mwt.ini file, one can affect the execution order. The line below can beadded to section [MAKE]:SH_EXECUTION_ORDER_TOP_BOTTOMSets the order of execution of functions and function blocks in graphical editor0Sets the execution order from left to right1Sets the execution order from top to bottomThe default value is …0“. The execution order can only be changed when compiling aworksheet again.4.Main Configuration Rules for RE_ 54_4.1.General Make sure that all analogue signals are connected and all necessary inputs and outputs are wired. Note that the outputs of function blocks may not be connected together. There are also many other FBD programming rules to follow. One of the most typical rules is not to use the “wired-OR” connection. All signals that are connected to the same output signal (both output relays and horizontal communication outputs) must be connected via an OR-gate (see figure below).Fig. 4.1-1. Use of an explicit Boolean OR gate (on the right).4.2.Binary inputs Do not write binary inputs - like BIO2_7_BI2.Fig. 4.2-1. Writing global binary inputs is not allowed.Binary inputs can be read from several locations.I>I>>TRIP TRIP PS1_4_HSPO1PS1_4_HSPO1I>I>>TRIP TRIP PS1_4_HSPO1"wired-OR" structure is not allowed an explicit Boolean "OR" block is required instead ORFig. 4.2-2. Correct way of using global binary inputs.4.3.Explicit feedbackAn explicit feedback loop may not be used. In case the tool gives a warning about thefeedback loop after compiling, the loop must be broken up by connecting the input ofthe function block and the output of another function block separately to the auxiliaryvariable.Fig. 4.3-1. Explicit feedback loop is not allowed.Fig. 4.3-2. Explicit feedback via the auxiliary variable FEEDBACK.4.4.Measurement function blocksAll the measurement inputs of the function blocks must be connected. In case e.g. thethree-phase current measurement function block MECU3A is implemented by twophases of currents, one of the currents available must be connected to the remainingthird input of MECU3A. Unless something is connected to the third current input, thefunction block will attempt to use the sensor channel 1 instead of the empty channel,and if no measurements have been defined for channel 1, a supervision error will result.4.5.WarningsIn case of the indication “Warning: Instance ‘xx’ is never used” in connection with Array compilation, remove the corresponding instances of the function block from the varia-bles worksheet of the POU. The tool will not give a separate warning for unused varia-bles, which is why they need to be removed manually. When a global variable is addedto a sheet as a copy-paste -function, the global radio button has to be chosen (see figurebelow); otherwise the variable becomes a local variable of the POU, which is due to theauto-insert feature of the tool (global variable = V AR_EXTERNAL, local variable =V AR).Fig. 4.5-1. Copying a global variable to a worksheet of a POU.4.6.Execution orderCheck the execution order after the compilation. The connection of simple variables toeach other generates a code, the execution order of which in relation to the callingsequence of POUs cannot be seen by means of the Layout Execution Order function.Fig. 4.6-1. The INTERLOCKING variable is updated (TMP1) during the task executioncycle (see the execution order 1,2,3).In addition, the execution order may be illogical or even incorrect considering the func-tionality.Fig. 4.6-2. The explicit feedback (TMP1) delays the updating of the INTERLOCKINGvariable by one task execution cycle.If the MOVE function is used instead of direct connection, the execution order can beutilised in concluding whether the result is desirable.4.7.F-keyThe freely programmable F-key is declared as VAR_GLOBAL in the global variableworksheet as follows:F001V021:BOOL:=0;(* Free configuration point (F-key) *)The F-key parameter can be added to the configuration logic as an external variable(V AR_EXTERNAL). Similar parameters that can be inserted to a relay logic are listedbelow:F001V011:BOOL:=0;(*(W) Resetting of operation indications*)F001V012:BOOL:=0;(*(W) Resetting of operation indications & latched output signals*)F001V013:BOOL:=0;(*(*(W) Resetting of operation indications, latched output signals & wave-form memory*)*)F001V020:BOOL:=0;(*(W) Resetting of accumulated energy measurement*) F001V021:BOOL:=0;(’(R, W) Free configuration point (F-key)*)F002V004:BOOL:=0;(*(*(R, W) Control: Interlocking bypass mode for all control objects (Enables all)*)*)F002V005:USINT:=0;(*(W) Control: Recent control position*) F002V006:BOOL:=0;(*(W) Control: Virtual LON input poll status*)F900V251:BOOL:=0;(*(*(W) Control: Execute all command for selected objects (inside module)*)*)F900V252:BOOL:=0;(*(W) Control: Cancel all command for selected objects (inside module)*)F000V251:BOOL:=0;(*(*(W) Control: Execute all command for selected objects (inside module)*)*)F000V252:BOOL:=0;(*(W) Control: Cancel all command for selected objects (inside module)*)。
2-dimensional space3D mapabstractaccess dataAccessibilityaccuracyacquisitionad-hocadjacencyadventaerial photographsAge of dataagglomerationaggregateairborneAlbers Equal-Area Conic projection (ALBER alignalphabeticalphanumericalphanumericalalternativealternativealtitudeameliorateanalogue mapsancillaryANDannotationanomalousapexapproachappropriatearcarc snap tolerancearealAreal coverageARPA abbr.Advanced Research Projects Agen arrangementarrayartificial intelligenceArtificial Neural Networks (ANN) aspatialaspectassembleassociated attributeattributeattribute dataautocorrelationautomated scanningazimuthazimuthalbar chartbiasbinary encodingblock codingBoolean algebrabottombottom leftboundbreak linebufferbuilt-incamouflagecardinalcartesian coordinate system cartographycatchmentcellcensuscentroidcentroid-to-centroidCGI (Common Gateway Interface) chain codingchainscharged couple devices (ccd) children (node)choropleth mapclass librariesclassesclustercodecohesivelycoilcollinearcolumncompactcompasscompass bearingcomplete spatial randomness (CSR) componentcompositecomposite keysconcavityconcentricconceptual modelconceptuallyconduitConformalconformal projectionconic projectionconnectivityconservativeconsortiumcontainmentcontiguitycontinuouscontourcontour layercontrol pointsconventionconvertcorecorrelogramcorrespondencecorridorCostcost density fieldcost-benefit analysis (CBA)cost-effectivecouplingcovariancecoveragecoveragecriteriacriteriacriterioncross-hairscrosshatchcross-sectioncumbersomecustomizationcutcylindrical projectiondangledangle lengthdangling nodedash lineDATdata base management systems (DBMS) data combinationdata conversiondata definition language (DDL)data dictionarydata independencedata integritydata itemdata maintenancedata manipulationData manipulation and query language data miningdata modeldata representationdata tabledata typedatabasedateDBAdebris flowdebugdecadedecibeldecision analysisdecision makingdecomposededicateddeductiveDelaunay criterionDelaunay triangulationdelete(erase)delineatedemarcationdemographicdemonstratedenominatorDensity of observationderivativedetectabledevisediagonaldictatedigital elevation model (DEM)digital terrain model (DTM) digitizedigitizedigitizerdigitizing errorsdigitizing tablediscrepancydiscretediscretedisparitydispersiondisruptiondissecteddisseminatedissolvedistance decay functionDistributed Computingdividedomaindot chartdraftdragdrum scannersdummy nodedynamic modelingeasy-to-useecologyelicitingeliminateellipsoidellipticityelongationencapsulationencloseencodeentity relationship modelingentity tableentryenvisageepsilonequal area projectionequidistant projectionerraticerror detection & correctionError Maperror varianceessenceet al.EuclideanEuclidean 2-spaceexpected frequencies of occurrences explicitexponentialextendexternal and internal boundaries external tablefacetfacilityfacility managementfashionFAT (file allocation table)faultyfeaturefeaturefeedbackfidelityfieldfield investigationfield sports enthusiastfields modelfigurefile structurefillingfinenessfixed zoom infixed zoom outflat-bed scannerflexibilityforefrontframe-by framefreefrom nodefrom scratchfulfillfunction callsfuzzyFuzzy set theorygantrygenericgeocodinggeocomputationgeodesygeographic entitygeographic processgeographic referencegeographic spacegeographic/spatial information geographical featuresgeometricgeometric primitive geoprocessinggeoreferencegeo-relational geosciences geospatialgeo-spatial analysis geo-statisticalGiven that GNOMONIC projection grain tolerance graticulegrey scalegridhand-drawnhand-heldhandicaphandlehand-written header recordheftyheterogeneity heterogeneous heuristichierarchical hierarchicalhill shading homogeneoushosthouseholdshuehumichurdlehydrographyhyper-linkedi.e.Ideal Point Method identicalidentifiable identification identifyilluminateimageimpedanceimpedanceimplementimplementimplicationimplicitin excess of…in respect ofin terms ofin-betweeninbuiltinconsistencyincorporationindigenousinformation integration infrastructureinherentinheritanceinlandinstanceinstantiationintegerintegrateinteractioninteractiveinteractiveinternet protocol suite Internet interoperabilityinterpolateinterpolationinterrogateintersectintersectionIntersectionInterval Estimation Method intuitiveintuitiveinvariantinventoryinvertedirreconcilableirreversibleis adjacent tois completely withinis contained iniso-iso-linesisopleth mapiterativejunctionkeyframekrigingKriginglaglanduse categorylatitudelatitude coordinatelavalayerlayersleaseleast-cost path analysisleftlegendlegendlegendlength-metriclie inlightweightlikewiselimitationLine modelline segmentsLineage (=history)lineamentlinearline-followinglitho-unitlocal and wide area network logarithmiclogicallogicallongitudelongitude coordinatemacro languagemacro-like languagemacrosmainstreammanagerialmanual digitizingmany-to-one relationMap scalemarshalmaskmatricesmatrixmeasured frequencies of occurrences measurementmedialMercatorMercator projectionmergemergemeridiansmetadatameta-datametadatamethodologymetric spaceminimum cost pathmirrormis-representmixed pixelmodelingmodularmonochromaticmonolithicmonopolymorphologicalmosaicmovemoving averagemuiticriteria decision making (MCDM) multispectralmutually exclusivemyopicnadirnatureneatlynecessitatenestednetworknetwork analysisnetwork database structurenetwork modelnodenodenode snap tolerancenon-numerical (character)non-spatialnon-spatial dataNormal formsnorth arrowNOTnovicenumber of significant digit numeric charactersnumericalnumericalobject-based modelobjectiveobject-orientedobject-oriented databaseobstacleomni- a.on the basis ofOnline Analytical Processing (OLAP) on-screen digitizingoperandoperatoroptimization algorithmORorderorganizational schemeoriginorthogonalORTHOGRAPHIC projectionortho-imageout ofoutcomeoutgrowthoutsetovaloverdueoverheadoverlapoverlayoverlay operationovershootovershootspackagepairwisepanpanelparadigmparent (node)patchpath findingpatternpatternpattern recognitionperceptionperspectivepertain phenomenological photogrammetric photogrammetryphysical relationships pie chartpilotpitpixelplanarplanar Euclidean space planar projection platformplotterplotterplottingplug-inpocketpoint entitiespointerpoint-modepointspolar coordinates polishingpolygonpolylinepolymorphism precautionsprecisionpre-designed predeterminepreferences pregeographic space Primary and Foreign keys primary keyprocess-orientedprofileprogramming tools projectionprojectionproprietaryprototypeproximalProximitypseudo nodepseudo-bufferpuckpuckpuckPythagorasquadquadrantquadtreequadtree tessellationqualifyqualitativequantitativequantitativequantizequasi-metricradar imageradii bufferrangelandrank order aggregation method ranking methodrasterRaster data modelraster scannerRaster Spatial Data Modelrating methodrational database structureready-madeready-to-runreal-timerecordrecreationrectangular coordinates rectificationredundantreference gridreflexivereflexive nearest neighbors (RNN) regimeregisterregular patternrelationrelationalrelational algebra operators relational databaseRelational joinsrelational model relevancereliefreliefremarkremote sensingremote sensingremote sensingremotely-sensed repositoryreproducible resemblanceresembleresemplingreshaperesideresizeresolutionresolutionrespondentretrievalretrievalretrievalretrieveridgerightrobustrootRoot Mean Square (RMS) rotateroundaboutroundingrowrow and column number run-length codingrun-length encoded saddle pointsalientsamplesanitarysatellite imagesscalablescalescanscannerscannerscannerscarcescarcityscenarioschemascriptscrubsecurityselectselectionself-descriptiveself-documentedsemanticsemanticsemi-automatedsemi-major axessemi-metricsemi-minor axessemivariancesemi-variogram modelsemi-varogramsensorsequencesetshiftsillsimultaneous equations simultaneouslysinusoidalskeletonslide-show-stylesliverslope angleslope aspectslope convexitysnapsnapsocio-demographic socioeconomicspagettiSpatial Autocorrelation Function spatial correlationspatial dataspatial data model for GIS spatial databaseSpatial Decision Support Systems spatial dependencespatial entityspatial modelspatial relationshipspatial relationshipsspatial statisticsspatial-temporalspecificspectralspherical spacespheroidsplined textsplitstakeholdersstand alonestandard errorstandard operationsstate-of-the-artstaticSTEREOGRAPHIC projection STEREOGRAPHIC projection stereoplotterstorage spacestovepipestratifiedstream-modestrideStructured Query Language(SQL) strung outsubdivisionsubroutinesubtractionsuitesupercedesuperimposesurrogatesurveysurveysurveying field data susceptiblesymbolsymbolsymmetrytaggingtailoredtake into account of … tangencytapetastefullyTelnettentativeterminologyterraceterritorytessellatedtextureThe Equidistant Conic projection (EQUIDIS The Lambert Conic Conformal projection (L thematicthematic mapthemeThiessen mapthird-partythresholdthroughputthrust faulttictiertiletime-consumingto nodetolerancetonetopographic maptopographytopologicaltopological dimensiontopological objectstopological structuretopologically structured data set topologytopologytrade offtrade-offTransaction Processing Systems (TPS) transformationtransposetremendousTriangulated Irregular Network (TIN) trimtrue-direction projectiontupleunbiasednessuncertaintyunchartedundershootsunionunionupupdateupper- mosturban renewaluser-friendlyutilityutility functionvaguevalidityvarianceVariogramvectorvector spatial data model vendorverbalversusvertexvetorizationviablevice versavice versaview of databaseview-onlyvirtualvirtual realityvisibility analysisvisualvisualizationvitalVoronoi Tesselationvrticeswatershedweedweed toleranceweighted summation method whilstwithin a distance ofXORzoom inzoom out三维地图摘要,提取,抽象访问数据可获取性准确,准确度 (与真值的接近程度)获得,获得物,取得特别邻接性出现,到来航片数据年龄聚集聚集,集合空运的, (源自)航空的,空中的艾伯特等面积圆锥投影匹配,调准,校直字母的字母数字的字母数字混合编制的替换方案替代的海拔,高度改善,改良,改进模拟地图,这里指纸质地图辅助的和注解不规则的,异常的顶点方法适合于…弧段弧捕捉容限来自一个地区的、 面状的面状覆盖范围(美国国防部)高级研究计划署排列,布置数组,阵列人工智能人工神经网络非空间的方面, 方向, 方位, 相位,面貌采集,获取关联属性属性属性数据自动扫描方位角,方位,地平经度方位角的条状图偏差二进制编码分块编码布尔代数下左下角给…划界断裂线缓冲区分析内置的伪装主要的,重要的,基本的笛卡儿坐标系制图、制图学流域,集水区像元,单元人口普查质心质心到质心的公共网关接口链式编码链电荷耦合器件子节点地区分布图类库类群编码内聚地线圈在同一直线上的列压缩、压紧罗盘, 圆规, 范围 v.包围方位角完全空间随机性组成部分复合的、混合的复合码凹度,凹陷同心的概念模型概念上地管道,导管,沟渠,泉水,喷泉保形(保角)的等角投影圆锥投影连通性保守的,守旧的社团,协会,联盟包含关系相邻性连续的轮廓,等高线,等值线等高线层控制点习俗,惯例,公约,协定转换核心相关图符合,对应走廊, 通路费用花费密度域,路径权值成本效益分析有成本效益的,划算的结合协方差面层,图层覆盖,覆盖范围标准,要求标准,判据,条件标准,判据,条件十字丝以交叉线作出阴影截面麻烦的用户定制剪切圆柱投影悬挂悬挂长度悬挂的节点点划线数据文件的扩展名数据库管理系统数据合并数据变换数据定义语言数据字典与数据的无关数据的完整性数据项数据维护数据操作数据操作和查询语言数据挖掘数据模型数据表示法数据表数据类型数据库日期数据库管理员泥石流调试十年,十,十年期分贝决策分析决策,判定分解专用的推论的,演绎的狄拉尼准则狄拉尼三角形删除描绘划分人口统计学的说明分母,命名者观测密度引出的,派生的可察觉的发明,想出对角线的,斜的要求数字高程模型数字地形模型数字化数字化数字化仪数字化误差数字化板,数字化桌差异,矛盾不连续的,离散的不连续的,离散的不一致性分散,离差中断,分裂,瓦解,破坏切开的,分割的发散,发布分解距离衰减函数分布式计算分割域点状图草稿,起草拖拽滚筒式扫描仪伪节点动态建模容易使用的生态学导出消除椭球椭圆率伸长包装,封装围绕编码实体关系建模实体表进入,登记想像,设想,正视,面对希腊文的第五个字母ε等积投影等距投影不稳定的误差检查和修正误差图误差离散,误差方差本质,本体,精华以及其他人,等人欧几里得的,欧几里得几何学的欧几里得二维空间期望发生频率明显的指数的延伸内外边界外部表格(多面体的)面工具设备管理样子,方式文件分配表有过失的,不完善的(地理)要素,特征要素反馈诚实,逼真度,重现精度字段现场调查户外运动发烧友场模型外形, 数字,文件结构填充精细度以固定比例放大以固定比例缩小平板式扫描仪弹性,适应性,机动性,挠性最前沿逐帧无…的起始节点从底层完成,实现函数调用模糊的模糊集合论构台,桶架, 跨轨信号架通用的地理编码地理计算大地测量地理实体地理(数据处理)过程地理参考地理空间地理信息,空间信息地理要素几何的,几何学的几何图元地理(数据)处理过程地理坐标参考地理关系的地球科学地理空间的地学空间分析地质统计学的假设心射切面投影颗粒容差地图网格灰度栅格,格网手绘的手持的障碍,难点处置、处理手写的头记录重的,强健的异质性异构的启发式的层次层次的山坡(体)阴影图均匀的、均质的主机家庭色调腐植的困难,阻碍水文地理学超链接的即,换言之,也就是理想点法相同的可识别的、标识识别阐明图像,影像全电阻,阻抗阻抗实现,履行履行,实现牵连,暗示隐含的超过…关于根据…在中间的嵌入的,内藏的不一致性,矛盾性结合,组成公司(或社团)内在的,本土的信息集成基础设施固有的继承,遗传, 遗产内陆的实例,例子实例,个例化整数综合,结合相互作用交互式的交互式的协议组互操作性内插插值询问相交交集、逻辑的乘交区间估值法直觉的直觉的不变量存储,存量反向的,倒转的,倒置的互相对立的不能撤回的,不能取消的相邻完全包含于包含于相等的,相同的线族等值线图迭代的接合,汇接点主帧克里金内插法克里金法标签,标记间隙,迟滞量土地利用类别纬度 (B)纬度坐标熔岩,火山岩图层图层出租,租用最佳路径分析左图例图例图例长度量测在于小型的同样地限制,限度,局限线模型线段谱系,来源容貌,线性构造线性的,长度的,直线的线跟踪的岩性单元局域和广域网对数的逻辑的逻辑的经度 (L)经度坐标宏语言类宏语言宏主流管理人的, 管理的手工数字化多对一的关系地图比例尺排列,集合掩膜matrix 的复数矩阵实测发生频率量测中间的合并墨卡托墨卡托投影法合并合并,融合子午线元数据元数据,也可写为 metadata元数据方法学,方法论度量空间最佳路径镜像错误表示混合像素建模模块化的单色的,单频整体的垄断, 专利权, 专卖形态学镶嵌, 镶嵌体移动移动平均数多准则决策分析多谱线的,多谱段的相互排斥的短视,没有远见的最低点,天底,深渊,最底点本性,性质整洁地成为必要嵌套的、巢状的网络网络分析网状数据库结构网络模型节点节点节点捕捉容限非数值的(字符)非空间的非空间数据范式指北针非新手,初学者有效位数数字字符数值的数值的基于对象的模型客观的,目标的面向对象的模型面向对象的数据库阻碍全能的,全部的以…为基础在线分析处理屏幕数字化运算对象,操作数算子,算符,操作人员优化算法或次,次序组织方案原点,起源,由来直角的,直交的正射投影正射影像缺少结果长出,派出,结果,副产物开头 ,开端卵形的,椭圆形的迟到的管理费用重叠,叠加叠加叠置运算超出过头线软件包成对(双)地,两个两个地平移面,板范例、父节点补钉,碎片,斑点路径搜索图案式样,图案, 模式模式识别感觉,概念,理解力透视图从属, 有关, 适合现象学的,现象的摄影测量的摄影测量物理关系饼图导航洼坑象素平面的平面欧几里得空间平面投影平台绘图仪绘图仪绘图插件便携式,袖珍式,小型的点实体指针点方式点数,分数极坐标抛光多边形多义线,折线多形性,多态现象预防措施精确, 精度(多次测量结果之间的敛散程度) 预定义的,预设计的预定、预先偏好先地理空间主外键主码面向处理的纵剖面、轮廓编程工具投影投影所有权,业主原型,典型最接近的,近侧的接近性假的, 伪的伪节点缓冲区查询(数字化仪)鼠标数字化鼠标鼠标毕达哥拉斯方庭,四方院子象限,四分仪四叉树四叉树方格限定,使合格定性的量的定量的、数量的使量子化准量测雷达影像以固定半径建立缓冲区牧场,放牧地等级次序集合法等级评定法栅格栅格数据模型栅格扫描仪栅格空间数据模型分数评定法关系数据结构现成的随需随运行的实时记录娱乐平面坐标纠正多余的,过剩的, 冗余的参考网格自反的自反最近邻体制,状态,方式配准规则模式关系关系关系代数运算符关系数据库关系连接中肯,关联,适宜,适当地势起伏,减轻地势的起伏评论,谈论,谈到遥感遥感遥感遥感的知识库可再产生的相似,相似性,相貌相似类似,像重取样调整形状居住, 驻扎调整大小分辨率分辨率回答者,提取检索检索检索高压脊右稳健的根部均方根旋转迂回的舍入的、凑整的行行和列的编号游程长度编码行程编码鞍点显著的,突出的,跳跃的,凸出的样品, 标本, 样本卫生状况卫星影像可升级的比例尺扫描扫描仪扫描仪扫描仪缺乏,不足情节模式脚本,过程(文件)灌木安全, 安全性选择选择自定义的自编程的语义的,语义学的语义的,语义学的半自动化长半轴半量测短半轴半方差半变差模型半变差图传感器次序集合、集、组改变, 移动基石,岩床联立方程同时地正弦的骨骼,骨架滑动显示模式裂片坡度坡向坡的凸凹性咬合捕捉社会人口统计学的社会经济学的意大利面条自相关函数空间相互关系空间数据GIS的空间数据模型 空间数据库空间决策支持系统空间依赖性空间实体空间模型空间关系空间关系空间统计时空的具体的,特殊的光谱的球空间球状体,回转椭圆体曲线排列文字分割股票持有者单机标准误差,均方差标准操作最新的静态的极射赤面投影极射赤面投影立体测图仪存储空间火炉的烟囱形成阶层的流方式步幅,进展,进步结构化查询语言被串起的细分,再分子程序相减组, 套件,程序组,代替,取代叠加,叠印代理,代用品,代理人测量测量,测量学野外测量数据免受...... 影响的(地图)符号符号,记号对称性给...... 贴上标签剪裁讲究的考虑…接触,相切胶带、带子风流地,高雅地远程登录试验性的术语台地,露台领域,领地,地区棋盘格的,镶嵌的花样的纹理等距圆锥投影兰伯特保形圆锥射影专题的专题图主题,图层泰森图第三方的阈值生产量,生产能力,吞吐量逆冲断层地理控制点等级,一排,一层,平铺费时间的终止节点允许(误差)、容差、容限、限差色调地形图地形学拓扑的拓扑维数拓扑对象拓扑结构建立了拓扑结构的数据集拓扑关系拓扑交替换位,交替使用,卖掉交换,协定,交易事务处理系统变换,转换转置,颠倒顺序巨大的不规则三角网修整真方向投影元组不偏性不确定性海图上未标明的,未知的欠头线合并并集、逻辑的和上升级最上面的城市改造用户友好的效用, 实用,公用事业效用函数含糊的效力,正确,有效性方差,变差变量(变化记录)图矢量矢量空间数据模型经销商言语的, 动词的对,与…相对顶点 (单数)矢量化可实行的,可行的反之亦然反之亦然数据库的表示只读的虚拟的虚拟现实通视性分析视觉的可视化,使看得见的重大的沃伦网格顶点(复数)分水岭杂草,野草 v.除草,铲除清除容限度加权求和法同时在 ...... 距离内异或放大缩小。
外文文献原稿和译文原稿IntroductionIn the modern industrial control field, along with the rapid development of computer technology, the emergence of a new trend of intelligent control, namely to machine simulation human thinking mode, using reasoning, deduce and induction, so the means, the production control, this is artificial intelligence. One expert system, fuzzy logic and neural network is the artificial intelligence of several key research hot spot. Relative to the expert system, the fuzzy logic belongs to the category of computational mathematics and contain the genetic algorithm, the chaos theory and linear theory etc, it comprehensive of operators practice experience, has the design is simple and easy to use, strong anti-interference ability and reaction speed, easy to control and adaptive ability, etc. In recent years, in a process control, built to touch, estimation, identify, diagnosis, the stock market forecast, agricultural production and military sciences to a wide range of applications. To carry out in-depth research and application of fuzzy control technology, the paper introduces the basic theory of fuzzy control technology and development, and to some in the application of the power electronics are introduced.Fuzzy Logic and Fuzzy Control1, fuzzy logic and fuzzy control conceptIn 1965, the university of California, Berkeley, computer experts Lofty Zadeh put forward "fuzzy logic" concept, the root lies in the area's logic or clear logic distribution, used to define the confused, unable to quantify or the problem of precision, for ˙ in a man's von based on "true-false" reasoning mechanism, and thus create a electronic circuit and integrated circuit of the Boolean algorithm, fuzzy logic to fill the gaps in special things in sampling and analysis of blank. On the basis of fuzzy logic fuzzy set theory, a particular things as the set of features membership, he can be in "is" and "no" within the scope of the take between any value. And fuzzy logic is reasonable quantitative mathematical theory, the mathematical basis forfundamental for is to deal with these the statistical uncertain imprecise information.Fuzzy control based on fuzzy logic is a process of description of the control algorithm. For parameters precisely known mathematical model, we can use Berd graph or chart to analysts the Nyquist process to obtain the accurate design parameters. And for some complex system, such as particle reaction, meteorological forecast equipment, establishing a reasonable and accurate mathematical model is very difficult, and for power transmission speed of vector control problems, although it can be measured by the model that, but for many variables and nonlinear variation, the accurate control is very difficult. And fuzzy control technology only on the basis of the practical experience and the operator and intuitive inference, also relies on design personnel and research and development personnel of experience and knowledge accumulation, it does not need to establish equipment model, so basically is adaptive, and have strong robustness. After many years development, there have been many successful application of the fuzzy control theory of the case, such as Rutherford, Carter and Ostergaard were applied and metallurgical furnace and heat exchangers control device.2, the analysis method is discussedIndustrial control stability of the system is discussed the premise of the problem, because of the nonlinear and not to the unity of the description, make a judgment, so the fuzzy control system analysis method of stability analysis has been a hot spot, comprehensive in recent years you of scholars paper published the system stability analysis has these several circumstances :1), LiPuYa panov method: direct method based on the discrete time (D-T) and continuous time fuzzy control stability analysis and design method, the stability condition of the relative comparison conservative.2), sliding variable structure system analysis method3), round stability criterion methods: use sector bounded nonlinear concept, according to the stability criterion, led to the stability of the fuzzy control.4), POPOV criterion5), other methods such as relationship matrix analysis, exceed stable theory, phase-plane, matrix inequality or convex optimization method, fuzzy hole-holemapping etc, detailed information and relevant literature many, in this one no longer etc.Set Design of Fuzzy ControlThe design of the fuzzy control is a very complicated process, in general, take the design steps and tools is more normative. The fuzzy controller general use of the special software and hardware, universal hardware chip in on the market at present is more, including main products are shown below. And special IC has developed very fast, it special IC and software controller integrates in together.In the process of design, the design of the general to take steps for:1, considering whether the subject by fuzzy control system. That is considered the routine control mode of may.2, from equipment operation personnel place to get as much information.3 and selecting the mathematical model could, if use the conventional method design, estimate the equipment performance characteristics.4, determine the fuzzy logic control object.5, determine the input and output variables.6, determine the variables as determined the belonging of the range.7, confirm the variables of the corresponding rules.8, determine the scale coefficients.9, if have a ready-made, mathematical model of fuzzy controller with already certain of system simulation, observation equipment performance, and constantly adjust rules and scale coefficients until reaching satisfaction performance. Or to design fuzzy controller.10, real-time operation controller, constantly adjust to the best performance. Fuzzy Control Application and ProspectAs artificial intelligence of a new research field, the fuzzy control absorb lessons from the traditional design method and other new technology's essence, in many fields has made considerable progress. In the new type of power electronic and automatic control system, some experts in the linear adding the conditions of the power amplifier, the application of the fuzzy control based on the servo motor control, in the fuzzy control system with the PID and model reference adaptive control (MRAC)comparison proved the advantages of the method of fuzzy control. Fuzzy turn sent gain tuned controller views of the induction motor drive system vector control Fuzzy control as a is the development of new technology, now in most experts also to focus on application system research, and make considerable achievement, but in the theory research and system analysis or relative backward, so much so that some scholars have questioned its theoretical basis and effective. In view of this can be clear that the fuzzy control the combination of theory and practice is still needs to be further explored. The development prospects are very attractive, and in recent years, its theoretical study also made significant progress. In the past forty years of the development process, the fuzzy control also has some limitations: 1) control precision low, performance is not high, stability is poorer; 2) theory system is not complete. 3) the adaptive ability low. For these weaknesses, the fuzzy control and some other new technology, such as neural network (NN), genetic algorithm, and the combination of to a higher level of application development expand the huge space.SummaryFuzzy control as a comprehensive application example, in the global information the push of wave, in the next few decades, to the rapid development of economy will inject new vitality, the expert thinks, the next generation of industrial control is the basis of fuzzy control and neural network, and chaos theory as the pillar of the artificial intelligence. With the fuzzy control theory research and further more perfect of, the scope of application of the growing and supporting the development and manufacture of IC, the fuzzy control will be open to the field of industrial automation development of light application prospect, but also to the various areas of the researchers suggest more important task.译文引言在现代工业控制领域,伴随着计算机技术的突飞猛进,出现了智能控制的新趋势,即以机器模拟人类思维模式,采用推理、演绎和归纳等手段,进行生产控制,这就是人工智能。